resq_dsa

​

Module: resq_dsa

​

Contents

Modules

• bloom - Bloom filter for approximate set membership.
• count_min - Count-Min sketch for frequency estimation.
• graph - Graph data structure and pathfinding algorithms.
• heap - Bounded heap for K-nearest neighbor tracking.
• trie - Trie prefix tree and Rabin-Karp pattern matching.

---

​

Module: bloom

Bloom filter for approximate set membership.

​

Module: count_min

Count-Min sketch for frequency estimation.

​

Module: graph

Graph data structure and pathfinding algorithms. Requires the std feature (enabled by default) because it depends on std::collections::{HashMap, HashSet, BinaryHeap, VecDeque}.

​

Module: heap

Bounded heap for K-nearest neighbor tracking.

​

Module: trie

Trie prefix tree and Rabin-Karp pattern matching. Requires the std feature (enabled by default) because it depends on std::collections::HashMap.