> ## Documentation Index
> Fetch the complete documentation index at: https://resq-dependabot-github-actions-github-actions-478e18be3d.mintlify.site/llms.txt
> Use this file to discover all available pages before exploring further.

# Resq dsa

**resq\_dsa**

# Module: resq\_dsa

## Contents

**Modules**

* [`bloom`](#bloom) - Bloom filter for approximate set membership.
* [`count_min`](#count_min) - Count-Min sketch for frequency estimation.
* [`graph`](#graph) - Graph data structure and pathfinding algorithms.
* [`heap`](#heap) - Bounded heap for K-nearest neighbor tracking.
* [`trie`](#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`.
