minimizer-queue 1.1.0

Fast computation of minimizers using a monotone queue
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

# minimizer-queue

[![crates.io](https://img.shields.io/crates/v/minimizer-queue)](https://crates.io/crates/minimizer-queue)
[![docs](https://img.shields.io/docsrs/minimizer-queue)](https://docs.rs/minimizer-queue)

Fast computation of minimizers using a monotone queue.

## Features

- insertion in amortized constant time
- lookup in constant time
- keeps track of the relative position of the minimizers
- supports custom [hasher](https://doc.rust-lang.org/stable/core/hash/trait.BuildHasher.html), using [`aHash`](https://github.com/tkaitchuck/aHash) by default
- can be seeded to produce a different ordering
- optimized modulo computation with [`strength_reduce`](https://github.com/ejmahler/strength_reduce)

## Example usage

```rust
use minimizer_queue::MinimizerQueue;

let mut queue = MinimizerQueue::new(3); // width 3
queue.insert(1);
queue.insert(2);
queue.insert(3);
queue.get_min(); // element with the smallest hash among 1, 2 and 3

queue.insert(4);
queue.get_min(); // element with the smallest hash among 2, 3 and 4
```