aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorboydgreenfield <boyd.greenfield@gmail.com>2013-12-08 22:20:51 -0800
committerboydgreenfield <boyd.greenfield@gmail.com>2013-12-08 22:20:51 -0800
commit360c363aa355591a158a37c4824feea6da7c9224 (patch)
tree4722a10d0e53713e213cc97bb0ed8e178715156b
parent44f7d56c9c96e766502e74f8b5bfde2296474f6c (diff)
downloadpackages-360c363aa355591a158a37c4824feea6da7c9224.tar.gz
packages-360c363aa355591a158a37c4824feea6da7c9224.zip
Add bloom package
Efficient Bloom filter implementation in Nimrod, with a default C implementation of MurmurHash3 for hashing (optional Nimrod built-in hash functions may be used as well).
-rw-r--r--packages.json12
1 files changed, 11 insertions, 1 deletions
diff --git a/packages.json b/packages.json
index 7fe04a2..0e06cb8 100644
--- a/packages.json
+++ b/packages.json
@@ -471,6 +471,16 @@
"tags": ["library", "wrapper", "binding", "crypto", "cryptography", "hash", "password", "security"],
"description": "Binding and utilities for scrypt",
"license": "CC0"
- }
+ },
+
+ {
+ "name": "bloom",
+ "url": "git://github.com/boydgreenfield/nimrod-bloom/",
+ "method": "git",
+ "tags": ["Bloom filter", "Bloom", "probabilistic", "data structure", "set membership", "MurmurHash", "MurmurHash3"],
+ "description": "Efficient Bloom filter implementation in Nimrod using MurmurHash3.",
+ "license": "MIT",
+ "web": "https://www.github.com/boydgreenfield/nimrod-bloom/"
+ }
]