bloom_fit 0.1.0 → 0.1.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +4 -4
- data/README.md +4 -0
- data/Rakefile +5 -7
- data/lib/bloom_fit/version.rb +1 -1
- metadata +1 -1
checksums.yaml
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
---
|
|
2
2
|
SHA256:
|
|
3
|
-
metadata.gz:
|
|
4
|
-
data.tar.gz:
|
|
3
|
+
metadata.gz: 5f1a3e06592409a17a287562a4f51910e4c103cc7e7a95fa18b051e684ec2f72
|
|
4
|
+
data.tar.gz: 85dab6561d4626f1ece379cbdd63678befac1e19d8f3cc403a270a13da5ca049
|
|
5
5
|
SHA512:
|
|
6
|
-
metadata.gz:
|
|
7
|
-
data.tar.gz:
|
|
6
|
+
metadata.gz: 2553c5c3ce8bff634d2d2f79bc58d9d05ee96426e681c3bdb3295c762fc01c9b2de0fe5aa97cc6755037a7c8a80cc4d367c31b6457e8b087489d36797ad1a598
|
|
7
|
+
data.tar.gz: 803c578af7494501775e52bb4db1ea46b5311c7280d20aaa632185d486dcd35ce60390a48d3ca4af2cb6adec4b9cbcc7aa7c922fcc5d9e58b0d7cdeb60a12fa7
|
data/README.md
CHANGED
|
@@ -1,5 +1,9 @@
|
|
|
1
1
|
# BloomFit makes Bloom Filter tuning easy
|
|
2
2
|
|
|
3
|
+
[](https://rubygems.org/gems/bloom_fit)
|
|
4
|
+
[](https://github.com/rmm5t/bloom_fit/actions/workflows/ci.yml)
|
|
5
|
+
[](https://rubygems.org/gems/bloom_fit)
|
|
6
|
+
|
|
3
7
|
BloomFit provides a MRI/C-based non-counting bloom filter for use in your Ruby projects. It is heavily based on [bloomfilter-rb]'s native implementation, but provides a better hashing distribution by using DJB2 over CRC32, avoids the need to supply a seed, removes counting abilities, improves performance for very large datasets, and will automatically calculate the bit size (m) and the number of hashes (k) when given a capacity and false-positive-rate.
|
|
4
8
|
|
|
5
9
|
A [Bloom filter](http://en.wikipedia.org/wiki/Bloom_filter) is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Instead of using k different hash functions, this implementation a DJB2 hash with k seeds from the CRC table.
|
data/Rakefile
CHANGED
|
@@ -1,11 +1,9 @@
|
|
|
1
|
-
require
|
|
2
|
-
require
|
|
3
|
-
require
|
|
4
|
-
require
|
|
5
|
-
require 'rake/extensiontask'
|
|
1
|
+
require "bundler/gem_tasks"
|
|
2
|
+
require "bundler/setup"
|
|
3
|
+
require "rspec/core/rake_task"
|
|
4
|
+
require "rake/extensiontask"
|
|
6
5
|
|
|
7
|
-
|
|
8
|
-
Rake::ExtensionTask.new('cbloomfilter')
|
|
6
|
+
Rake::ExtensionTask.new("cbloomfilter")
|
|
9
7
|
RSpec::Core::RakeTask.new(:spec)
|
|
10
8
|
Rake::Task[:spec].prerequisites << :clean
|
|
11
9
|
Rake::Task[:spec].prerequisites << :compile
|
data/lib/bloom_fit/version.rb
CHANGED