Crate pdatastructs [−] [src]
A collection of data structures that are based probability theory and therefore only provide the correct answer if a certain probability. In exchange they have a better runtime and memory complexity compared to traditional data structures.
Structs
| BloomFilter |
Simple implementation of a BloomFilter |
| CountMinSketch |
Simple implementation of a Count-min sketch |
| HyperLogLog |
A simple implementation of a HyperLogLog |
| MyBuildHasherDefault |
Like |
| ReservoirSampling |
Simple implementation of Reservoir Sampling with fast approximation |
| TopK |
Top-K implementation. |
Traits
| Counter |
Abstract, but safe counter. |