1 #ifndef DISTINCTELEMENTSPRIMITIVE_H
2 #define DISTINCTELEMENTSPRIMITIVE_H
7 #include "../hashing/hashfunction.h"
38 elements.insert(element);
44 return elements.size();
DistinctElementsPrimitive< U, H > & operator<<(U const &element)
Base class template for any hash function mapping an element from universe U to hashing space H...
Count distinct elements in a stream using a std::set (for debugging)
~DistinctElementsPrimitive()
DistinctElementsPrimitive(unsigned long long sizeOfUniverse, double eps, std::function< HashFunction< U, H > *(unsigned long long sizeOfHashingSpace)> hashfunctionCreator)
unsigned long long numberOfDistinctElements()