4 releases

Uses old Rust 2015

0.1.3 Aug 23, 2019
0.1.2 Feb 27, 2019
0.1.1 Feb 12, 2017
0.1.0 Feb 11, 2017

#766 in Data structures

Download history 171/week @ 2021-06-24 96/week @ 2021-07-01 62/week @ 2021-07-08 94/week @ 2021-07-15 79/week @ 2021-07-22 97/week @ 2021-07-29 92/week @ 2021-08-05 73/week @ 2021-08-12 94/week @ 2021-08-19 79/week @ 2021-08-26 76/week @ 2021-09-02 339/week @ 2021-09-09 79/week @ 2021-09-16 69/week @ 2021-09-23 85/week @ 2021-09-30 85/week @ 2021-10-07

634 downloads per month

MIT license

9KB
125 lines

A concurrent implementation of Bloom filters.

Bloom filters is a simple data structure, which is used in many different situations. It can neatly solve certain problems heaurustically without need for extreme memory usage.

This implementation is fairly standard, except that it uses atomic integers to work concurrently.


lib.rs:

A concurrent implementation of Bloom filters.

Bloom filters is a simple data structure, which is used in many different situations. It can neatly solve certain problems heaurustically without need for extreme memory usage.

This implementation is fairly standard, except that it uses atomic integers to work concurrently.

No runtime deps