1
I Use This!
Very Low Activity
Analyzed about 7 hours ago. based on code collected about 7 hours ago.

Project Summary

C++ Bloom Filter Library, with the following capabilities:

Optimal parameter selection based on expected false positive rate. Union, intersection and difference operations between bloom filters. Compression of in-use table (increase in false positive probability vs space) Portable and efficient source code implementation. Compatible Compilers:

GCC 4.0+ Intel C++ Compiler 9.0+ Microsoft Visual C++ 8.0+ Comeau C/C++ 4.1+ For more information please visit: http://www.partow.net/programming/hashfunctions/index.html

Tags

algorithm bloom bloomier c++ code cplusplus difference efficient fast fastlookup filter hash intersection library lookup membership partow probabilistic query set union

In a Nutshell, bloomfilter...

Quick Reference

Mozilla Public License 1.1
Permitted

Commercial Use

Modify

Distribute

Place Warranty

Use Patent Claims

Forbidden

Sub-License

Hold Liable

Required

Distribute Original

Disclose Source

Include Copyright

State Changes

Include License

Include Install Instructions

These details are provided for information only. No information here is legal advice and should not be used as such.

All Licenses

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    search using multiple tags to find exactly what you need
  • ...
    55% of companies leverage OSS for production infrastructure
  • ...
    data presented on the Open Hub is available through our API

Languages

Languages?height=75&width=75
C++
97%
Make
3%

30 Day Summary

Mar 26 2019 — Apr 25 2019

12 Month Summary

Apr 25 2018 — Apr 25 2019

Ratings

1 user rates this project:
5.0
 
5.0/5.0
Click to add your rating
   Spinner
Review this Project!