https://github.com/shadowsocks/libbloom
A simple and small bloom filter implementation in plain C.
https://github.com/shadowsocks/libbloom
Last synced: 9 months ago
JSON representation
A simple and small bloom filter implementation in plain C.
- Host: GitHub
- URL: https://github.com/shadowsocks/libbloom
- Owner: shadowsocks
- License: bsd-2-clause
- Fork: true (jvirkki/libbloom)
- Created: 2017-02-17T00:46:40.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2020-07-01T07:55:58.000Z (almost 6 years ago)
- Last Synced: 2024-12-08T01:01:10.387Z (over 1 year ago)
- Language: C
- Homepage:
- Size: 1.2 MB
- Stars: 16
- Watchers: 8
- Forks: 34
- Open Issues: 0
-
Metadata Files:
- Readme: README
- License: LICENSE
Awesome Lists containing this project
README
Introduction
------------
This is libbloom, a simple and small bloom filter implementation in C.
If you are reading this you probably already know about bloom filters
and why you might use one. If not, the wikipedia article is a good intro:
http://en.wikipedia.org/wiki/Bloom_filter
Building
--------
The Makefile assumes GNU Make, so run 'make' or 'gmake' as appropriate
on your system.
By default it builds an optimized 64 bit libbloom. See Makefile comments
for other build options.
The shared library will be in ./build/libbloom.so
Sample Usage
------------
#include "bloom.h"
struct bloom bloom;
bloom_init(&bloom, 1000000, 0.01);
bloom_add(&bloom, buffer, buflen);
if (bloom_check(&bloom, buffer, buflen)) {
printf("It may be there!\n");
}
Documentation
-------------
Read bloom.h for more detailed documentation on the public interfaces.
License
-------
This code (except MurmurHash2) is under BSD license. See LICENSE file.
See murmur2/README for info on MurmurHash2.