fast_bloom_filter 1.0.0 → 2.1.0

data/lib/fast_bloom_filter/version.rb

@@ -1,3 +1,3 @@
 module FastBloomFilter
-  VERSION = "1.0.0"
+  VERSION = "2.1.0"
 end

data/lib/fast_bloom_filter.rb

@@ -21,30 +21,30 @@ module FastBloomFilter
       items.each { |item| add(item.to_s) }
       self
     end
-    
+
     def count_possible_matches(items)
       items.count { |item| include?(item.to_s) }
     end
-    
+
     def inspect
       s = stats
-      size_kb = (s[:size_bytes] / 1024.0).round(2)
+      total_kb = (s[:total_bytes] / 1024.0).round(2)
       fill_pct = (s[:fill_ratio] * 100).round(2)
-      
-      "#<FastBloomFilter::Filter capacity=#{s[:capacity]} " \
-      "size=#{size_kb}KB hashes=#{s[:num_hashes]} fill=#{fill_pct}%>"
+
+      "#<FastBloomFilter::Filter v2 layers=#{s[:num_layers]} " \
+      "count=#{s[:total_count]} size=#{total_kb}KB fill=#{fill_pct}%>"
     end
-    
+
     def to_s
       inspect
     end
   end
-  
-  def self.for_emails(capacity, error_rate: 0.001)
-    Filter.new(capacity, error_rate)
+
+  def self.for_emails(error_rate: 0.001, initial_capacity: 10_000)
+    Filter.new(error_rate: error_rate, initial_capacity: initial_capacity)
   end
-  
-  def self.for_urls(capacity, error_rate: 0.01)
-    Filter.new(capacity, error_rate)
+
+  def self.for_urls(error_rate: 0.01, initial_capacity: 10_000)
+    Filter.new(error_rate: error_rate, initial_capacity: initial_capacity)
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: fast_bloom_filter
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 2.1.0
 platform: ruby
 authors:
-- Your Name
+- Roman Haydarov
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2026-02-09 00:00:00.000000000 Z
+date: 2026-03-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -66,10 +66,10 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '5.0'
-description: Memory-efficient probabilistic data structure. 20-50x less memory than
-  Set, perfect for Rails apps.
+description: Memory-efficient scalable Bloom Filter that grows dynamically. No upfront
+  capacity needed. 20-50x less memory than Set, perfect for Rails apps.
 email:
-- your.email@example.com
+- romnhajdarov@gmail.com
 executables: []
 extensions:
 - ext/fast_bloom_filter/extconf.rb
@@ -82,13 +82,13 @@ files:
 - ext/fast_bloom_filter/fast_bloom_filter.c
 - lib/fast_bloom_filter.rb
 - lib/fast_bloom_filter/version.rb
-homepage: https://github.com/yourusername/fast_bloom_filter
+homepage: https://github.com/roman-haidarov/fast_bloom_filter
 licenses:
 - MIT
 metadata:
-  homepage_uri: https://github.com/yourusername/fast_bloom_filter
-  source_code_uri: https://github.com/yourusername/fast_bloom_filter
-  changelog_uri: https://github.com/yourusername/fast_bloom_filter/blob/main/CHANGELOG.md
+  homepage_uri: https://github.com/roman-haidarov/fast_bloom_filter
+  source_code_uri: https://github.com/roman-haidarov/fast_bloom_filter
+  changelog_uri: https://github.com/roman-haidarov/fast_bloom_filter/blob/main/CHANGELOG.md
 post_install_message:
 rdoc_options: []
 require_paths:
@@ -104,8 +104,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.4.22
+rubygems_version: 3.3.27
 signing_key:
 specification_version: 4
-summary: High-performance Bloom Filter in C for Ruby
+summary: Scalable Bloom Filter in C for Ruby - grows automatically
 test_files: []