Bloombroom v1.2.0 - fast Bloom Filter for continuous/streaming keys Posted by colinsurprenant on February 27, 2013 — 0 comments I just pushed Bloombroom v1.2.0 , a Ruby & JRuby gem with fast Bloom Filters implementations: - Standard Bloom Filter for bounded key space - Continuous Bloom Filter for unbounded keys (keys stream) Also includes: - Fast FNV hashing using C implementation with FFI bindings - Bit Field for compact & fast manipulation of bits field of arbitrary length - Bit Bucket Field for compact & fast manipulation of series of bit "buckets" of arbitrary size
Full article: http://www.rubyflow.com/items/8987-bloombroom-v1-2-0-fast...
@JapanTechFeeds
»
28 Feb '13, 12am
@tomordonez
»
27 Feb '13, 7pm
@RacingOnRails
»
27 Feb '13, 7pm
@chillicoder
»
27 Feb '13, 7pm
Last Sunday marked the 20th anniversary of work commencing on Ruby way back in 1993 and it was celebrated in style with th...
Performance Is Innovation. Consistency. Longer Drives. A Choice. For Every Player. Durability. Commitment. In The Details.
