rjspotter-bloomfilter 0.1.3

data/README.rdoc

@@ -0,0 +1,58 @@
+= BloomFilter
+
+Counting Bloom Filter implemented in Ruby.
+
+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. For more detail: http://en.wikipedia.org/wiki/Bloom_filter
+
+== Implementation
+
+Instead of using k different hash functions, this implementation seeds the CRC32 hash
+with k different initial values (0, 1, ..., k-1). This may or may not give you a good
+distribution, it all depends on the data.
+
+== Example
+
+  require 'bloomfilter'
+
+  # M (size of bit array)
+  # K (number of hash functions)
+  # R (random seed) 100000000, k=4, random seed=1
+
+  #                    M,  K, R
+  bf = BloomFilter.new(10, 2, 1)
+  bf.insert("test")
+  bf.include?("test")
+  => true
+  bf.include?("test2")
+  => false
+  bf.delete("test")
+  bf.include?("test")
+  => false
+
+  # Hash with a bloom filter!
+  bf["test2"] = "bar"
+  bf["test2"]
+  => "bar"
+  bf["test3"]
+  => nil
+
+  bf.stats
+  Number of filter bits (m): 10
+  Number of filter elements (n): 2
+  Number of filter hashes (k) : 2
+  Predicted false positive rate = 10.87%
+
+
+== Configuring Bloom Filter
+
+Performance of the Bloom filter depends on a number of variables:
+- size of the bit array
+- number of hash functions
+
+To figure out the values for these parameters, refer to:
+ http://www.igvita.com/2008/12/27/scalable-datasets-bloom-filters-in-ruby/
+
+== Credits
+Tatsuya Mori <valdzone@gmail.com> (Original: http://vald.x0.com/sb/)

data/Rakefile

@@ -0,0 +1,64 @@
+require 'rake'
+require 'rake/clean'
+require 'rake/rdoctask'
+require 'rake/gempackagetask'
+require 'rake/testtask'
+require 'fileutils'
+include FileUtils
+
+# Default Rake task is compile
+task :default => :compile
+
+def make(makedir)
+  Dir.chdir(makedir) { sh 'make' }
+end
+
+def extconf(dir)
+  Dir.chdir(dir) { ruby "extconf.rb" }
+end
+
+def setup_extension(dir, extension)
+  ext = "ext/#{dir}"
+  ext_so = "#{ext}/#{extension}.#{Config::CONFIG['DLEXT']}"
+  ext_files = FileList[
+    "#{ext}/*.c",
+    "#{ext}/*.h",
+    "#{ext}/extconf.rb",
+    "#{ext}/Makefile",
+    "lib"
+  ]
+
+  task "lib" do
+    directory "lib"
+  end
+
+  desc "Builds just the #{extension} extension"
+  task extension.to_sym => ["#{ext}/Makefile", ext_so ]
+
+  file "#{ext}/Makefile" => ["#{ext}/extconf.rb"] do
+    extconf "#{ext}"
+  end
+
+  file ext_so => ext_files do
+    make "#{ext}"
+    cp ext_so, "lib"
+  end
+end
+
+setup_extension("", "sbloomfilter")
+
+task :compile => [:sbloomfilter]
+
+CLEAN.include ['build/*', '**/*.o', '**/*.so', '**/*.a', '**/*.log', 'pkg']
+CLEAN.include ['ext/Makefile']
+
+Rake::TestTask.new do |t|
+  %w[ ext lib test ].each do |dir|
+    t.libs << dir
+  end
+
+  t.test_files = FileList['test/test_*.rb']
+  t.verbose = true
+end
+Rake::Task[:test].prerequisites << :compile
+

data/examples/bf.rb

@@ -0,0 +1,54 @@
+#!/usr/bin/env ruby
+require 'bitset'
+require 'zlib'
+
+#
+# Pure ruby implementation of a Bloom filter, just for kicks
+#
+
+class BloomFilter
+
+  def initialize(max_entries, num_hashes, seed)
+    @num_hashes = num_hashes
+    @size = max_entries.to_i
+    @bitmap = BitSet.new(@size)
+    @__mask = BitSet.new(@size)
+    @seed = seed
+  end
+
+  def insert(key)
+    mask = make_mask(key)
+    @bitmap |= mask
+  end
+
+  def new?(key)
+    mask = make_mask(key)
+    return ((@bitmap & mask) != mask);
+  end
+
+  def make_mask(key)
+    @__mask.clear
+    0.upto(@num_hashes.to_i - 1) do |i|
+      hash = Zlib.crc32(key, i + @seed)
+      @__mask.set(hash % @size, 1)
+    end
+    return @__mask
+  end
+end
+
+
+def main
+  bf = BloomFilter.new(1000000, 4, 0)
+  num = 0
+  while line = ARGF.gets
+    data = line.chop
+
+    if bf.new_entry?(data)
+      num += 1
+      bf.insert(data)
+    end
+  end 
+  print "#element = #{num}\n"
+end
+
+main

data/examples/simple.rb

@@ -0,0 +1,26 @@
+#!/usr/bin/env ruby
+require 'bloomfilter'
+
+WORDS = %w(duck penguin bear panda)
+TEST = %w(penguin moose racooon)
+
+# m = 100, k = 4, seed = 1
+bf = BloomFilter.new(100, 4, 1)
+
+WORDS.each { |w| bf.insert(w) }
+TEST.each do |w|
+  puts "#{w}: #{bf.include?(w)}"
+end
+
+bf.stats
+
+#  penguin: true
+#  moose: false
+#  racooon: false
+#
+#  Number of filter buckets (m): 100
+#  Number of bits per buckets (b): 1
+#  Number of filter elements (n): 4
+#  Number of filter hashes (k) : 4
+#  Raise on overflow? (r) : false
+#  Predicted false positive rate = 0.05%

data/ext/crc32.c

@@ -0,0 +1,32 @@
+/* simple CRC32 code */
+/*
+ * Copyright 2005 Aris Adamantiadis
+ *
+ * This file is part of the SSH Library
+ *
+ * The SSH Library is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or (at your
+ * option) any later version.
+ *
+ *
+ * The SSH Library is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
+ * License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with the SSH Library; see the file COPYING.  If not, write to
+ * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
+ * MA 02111-1307, USA. */
+
+#include "crc32.h"
+
+unsigned int crc32(unsigned int crc, char *buf, int len) {
+    while (len > 0) {
+        crc = crc_table[(crc ^ *buf) & 0xff] ^ (crc >> 8);
+        --len;
+        ++buf;
+    }
+    return crc;
+}

data/ext/crc32.h

@@ -0,0 +1,78 @@
+/* simple CRC32 code */
+/*
+ * Copyright 2005 Aris Adamantiadis
+ *
+ * This file is part of the SSH Library
+ *
+ * The SSH Library is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or (at your
+ * option) any later version.
+ *
+ *
+ * The SSH Library is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
+ * License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with the SSH Library; see the file COPYING.  If not, write to
+ * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
+ * MA 02111-1307, USA. */
+
+static unsigned int crc_table[] = {
+    0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
+    0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
+    0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
+    0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
+    0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
+    0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
+    0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
+    0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
+    0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
+    0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
+    0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
+    0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
+    0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
+    0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
+    0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
+    0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
+    0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
+    0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
+    0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
+    0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
+    0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
+    0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
+    0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
+    0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
+    0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
+    0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
+    0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
+    0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
+    0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
+    0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
+    0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
+    0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
+    0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
+    0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
+    0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
+    0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
+    0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
+    0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
+    0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
+    0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
+    0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
+    0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
+    0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
+    0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
+    0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
+    0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
+    0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
+    0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
+    0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
+    0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
+    0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
+    0x2d02ef8dUL
+};
+
+unsigned int crc32(unsigned int crc, char *buf, int len);

data/ext/extconf.rb

@@ -0,0 +1,4 @@
+#!/usr/bin/env ruby 
+require "mkmf"
+
+create_makefile("sbloomfilter")

data/ext/sbloomfilter.c

@@ -0,0 +1,297 @@
+/*
+ *   sbloomfilter.c - simple Bloom Filter
+ *   (c) Tatsuya Mori <valdzone@gmail.com>
+ */
+
+#include "ruby.h"
+#include "crc32.h"
+
+static VALUE cBloomFilter;
+
+struct BloomFilter {
+    int m; /* # of buckets in a bloom filter */
+    int b; /* # of bits in a bloom filter bucket */
+    int k; /* # of hash functions */
+    int s; /* # seed of hash functions */
+    int r; /* # raise on bucket overflow? */
+    int num_set; /* # of set bits */
+    unsigned char *ptr; /* bits data */
+};
+
+void bits_free(struct BloomFilter *bf) {
+    ruby_xfree(bf->ptr);
+}
+
+
+void bucket_unset(struct BloomFilter *bf, int index) {
+    int byte_offset = (index * bf->b) / 8;
+    int bit_offset = (index * bf->b) % 8;
+    unsigned int c = bf->ptr[byte_offset];
+    c += bf->ptr[byte_offset + 1] << 8;
+    unsigned int mask = ((1 << bf->b) - 1) << bit_offset;
+    if ((c & mask) == 0) {
+      // do nothing
+    } else {
+        bf->ptr[byte_offset] -= (1 << bit_offset) & ((1 << 8) - 1);
+        bf->ptr[byte_offset + 1] -= ((1 << bit_offset) & ((1 << 16) - 1)) >> 8;
+    }
+    
+}
+
+void bucket_set(struct BloomFilter *bf, int index) {
+    int byte_offset = (index * bf->b) / 8;
+    int bit_offset = (index * bf->b) % 8;
+    unsigned int c = bf->ptr[byte_offset];
+    c += bf->ptr[byte_offset + 1] << 8;
+    unsigned int mask = ((1 << bf->b) - 1) << bit_offset;
+    if ((c & mask) == mask) {
+        if (bf->r == 1) rb_raise(rb_eRuntimeError, "bucket got filled up");
+    } else {
+        bf->ptr[byte_offset] += (1 << bit_offset) & ((1 << 8) - 1);
+        bf->ptr[byte_offset + 1] += ((1 << bit_offset) & ((1 << 16) - 1)) >> 8;
+    }
+    
+}
+
+int bucket_check(struct BloomFilter *bf, int index) {
+    int byte_offset = (index * bf->b) / 8;
+    int bit_offset = (index * bf->b) % 8;
+    unsigned int c = bf->ptr[byte_offset];
+    c += bf->ptr[byte_offset + 1] << 8;
+
+    unsigned int mask = ((1 << bf->b) - 1) << bit_offset;
+    return (c & mask) >> bit_offset;
+}
+
+int bucket_get(struct BloomFilter *bf, int index) {
+  int byte_offset = (index * bf->b) / 8;
+  int bit_offset = (index * bf->b) % 8;
+  unsigned int c = bf->ptr[byte_offset];
+  c += bf->ptr[byte_offset + 1] << 8;
+
+  unsigned int mask = ((1 << bf->b) - 1) << bit_offset;
+  return (c & mask) >> bit_offset;
+}
+
+static VALUE bf_s_new(int argc, VALUE *argv, VALUE self) {
+    struct BloomFilter *bf;
+    VALUE arg1, arg2, arg3, arg4, arg5, obj;
+    int m, k, s, b, r, bytes;
+
+    obj = Data_Make_Struct(self, struct BloomFilter, NULL, bits_free, bf);
+
+    /* default = Fugou approach :-) */
+    arg1 = INT2FIX(100000000);
+    arg2 = INT2FIX(4);
+    arg3 = INT2FIX(0);
+    arg4 = INT2FIX(1);
+    arg5 = INT2FIX(0);
+
+    switch (argc) {
+        case 5:
+	    if (argv[4] == Qtrue) {
+		    arg5 = INT2FIX(1);
+	    }
+        case 4:
+	    arg4 = argv[3];
+        case 3:
+	    arg3 = argv[2];
+        case 2:
+	    arg2 = argv[1];
+        case 1:
+	    arg1 = argv[0];
+	    break;
+    }
+
+    m = FIX2INT(arg1);
+    k = FIX2INT(arg2);
+    s = FIX2INT(arg3);
+    b = FIX2INT(arg4);
+    r = FIX2INT(arg5);
+
+    if (b < 1 || b > 8)
+        rb_raise(rb_eArgError, "bucket size");
+    if (m < 1)
+        rb_raise(rb_eArgError, "array size");
+    if (k < 1)
+        rb_raise(rb_eArgError, "hash length");
+    if (s < 0)
+        rb_raise(rb_eArgError, "random seed");
+
+    bf->b = b;
+    bf->m = m;
+    bf->k = k;
+    bf->s = s;
+    bf->r = r;
+    bf->num_set = 0;
+
+    bytes = ((m * b) + 15) / 8;
+    bf->ptr = ALLOC_N(unsigned char, bytes);
+
+    /* initialize the bits with zeros */
+    memset(bf->ptr, 0, bytes);
+    rb_iv_set(obj, "@hash_value", rb_hash_new());
+
+    return obj;
+}
+
+static VALUE bf_m(VALUE self) {
+    struct BloomFilter *bf;
+    Data_Get_Struct(self, struct BloomFilter, bf);
+    return INT2FIX(bf->m);
+}
+
+static VALUE bf_k(VALUE self) {
+    struct BloomFilter *bf;
+    Data_Get_Struct(self, struct BloomFilter, bf);
+    return INT2FIX(bf->k);
+}
+
+static VALUE bf_b(VALUE self) {
+    struct BloomFilter *bf;
+    Data_Get_Struct(self, struct BloomFilter, bf);
+    return INT2FIX(bf->b);
+}
+
+static VALUE bf_r(VALUE self) {
+    struct BloomFilter *bf;
+    Data_Get_Struct(self, struct BloomFilter, bf);
+    return bf->r == 0 ? Qfalse : Qtrue;
+}
+
+static VALUE bf_num_set(VALUE self) {
+    struct BloomFilter *bf;
+    Data_Get_Struct(self, struct BloomFilter, bf);
+    return INT2FIX(bf->num_set);
+}
+
+static VALUE bf_insert(VALUE self, VALUE key) {
+    int index, seed;
+    int i, len, m, k, s;
+    char *ckey;
+
+    struct BloomFilter *bf;
+    Data_Get_Struct(self, struct BloomFilter, bf);
+
+    Check_Type(key, T_STRING);
+    ckey = STR2CSTR(key);
+    len = (int) (RSTRINGLEN(key)); /* length of the string in bytes */
+
+    m = bf->m;
+    k = bf->k;
+    s = bf->s;
+
+    for (i = 0; i <= k - 1; i++) {
+        /* seeds for hash functions */
+        seed = i + s;
+
+        /* hash */
+        index = (int) (crc32((unsigned int) (seed), ckey, len) % (unsigned int) (m));
+
+        /*  set a bit at the index */
+        bucket_set(bf, index);
+    }
+
+    bf->num_set += 1;
+    return Qnil;
+}
+
+static VALUE bf_delete(VALUE self, VALUE key) {
+    int index, seed;
+    int i, len, m, k, s;
+    char *ckey;
+
+    struct BloomFilter *bf;
+    Data_Get_Struct(self, struct BloomFilter, bf);
+
+    Check_Type(key, T_STRING);
+    ckey = STR2CSTR(key);
+    len = (int) (RSTRINGLEN(key)); /* length of the string in bytes */
+
+    m = bf->m;
+    k = bf->k;
+    s = bf->s;
+
+    for (i = 0; i <= k - 1; i++) {
+        /* seeds for hash functions */
+        seed = i + s;
+
+        /* hash */
+        index = (int) (crc32((unsigned int) (seed), ckey, len) % (unsigned int) (m));
+
+        /*  set a bit at the index */
+        bucket_unset(bf, index);
+    }
+
+    bf->num_set += 1;
+    return Qnil;
+}
+
+
+static VALUE bf_include(VALUE self, VALUE key) {
+    int index, seed;
+    int i, len, m, k, s;
+    char *ckey;
+
+    struct BloomFilter *bf;
+    Data_Get_Struct(self, struct BloomFilter, bf);
+
+    Check_Type(key, T_STRING);
+    ckey = STR2CSTR(key);
+    len = (int) (RSTRINGLEN(key)); /* length of the string in bytes */
+
+    m = bf->m;
+    k = bf->k;
+    s = bf->s;
+
+    for (i = 0; i <= k - 1; i++) {
+        /* seeds for hash functions */
+        seed = i + s;
+
+        /* hash */
+        index = (int) (crc32((unsigned int) (seed), ckey, len) % (unsigned int) (m));
+
+        /* check the bit at the index */
+        if (!bucket_check(bf, index))
+            return Qfalse; /* i.e., it is a new entry ; escape the loop */
+    }
+
+    return Qtrue;
+}
+
+static VALUE bf_to_s(VALUE self) {
+    struct BloomFilter *bf;
+    unsigned char *ptr;
+    int i;
+    VALUE str;
+
+    Data_Get_Struct(self, struct BloomFilter, bf);
+    str = rb_str_new(0, bf->m);
+
+    ptr = (unsigned char *) RSTRINGPTR(str);
+    for (i = 0; i < bf->m; i++)
+        *ptr++ = bucket_get(bf, i) ? '1' : '0';
+
+    return str;
+}
+
+void Init_sbloomfilter(void) {
+    cBloomFilter = rb_define_class("BloomFilter", rb_cObject);
+    rb_define_singleton_method(cBloomFilter, "new", bf_s_new, -1);
+    rb_define_method(cBloomFilter, "m", bf_m, 0);
+    rb_define_method(cBloomFilter, "k", bf_k, 0);
+    rb_define_method(cBloomFilter, "b", bf_b, 0);
+    rb_define_method(cBloomFilter, "r", bf_r, 0);
+    rb_define_method(cBloomFilter, "num_set", bf_num_set, 0);
+    rb_define_method(cBloomFilter, "insert", bf_insert, 1);
+    rb_define_method(cBloomFilter, "delete", bf_delete, 1);
+    rb_define_method(cBloomFilter, "include?", bf_include, 1);
+    rb_define_method(cBloomFilter, "to_s", bf_to_s, 0);
+
+    /* functions that have not been implemented, yet */
+
+    //  rb_define_method(cBloomFilter, "clear", bf_clear, 0);
+    //  rb_define_method(cBloomFilter, "&", bf_and, 1);
+    //  rb_define_method(cBloomFilter, "|", bf_or, 1);
+    //  rb_define_method(cBloomFilter, "<=>", bf_cmp, 1);
+}

data/lib/bloomfilter.rb

@@ -0,0 +1,31 @@
+require 'sbloomfilter'
+
+class BloomFilter
+  def stats
+    fp = ((1.0 - Math.exp(-(self.k * self.num_set).to_f / self.m)) ** self.k) * 100
+    printf "Number of filter buckets (m): %d\n" % self.m
+    printf "Number of bits per buckets (b): %d\n" % self.b
+    printf "Number of filter elements (n): %d\n" % self.num_set
+    printf "Number of filter hashes (k) : %d\n" % self.k
+    printf "Raise on overflow? (r) : %s\n" % self.r.to_s
+    printf "Predicted false positive rate = %.2f%\n" % fp
+  end
+
+  def []= key, value
+    insert(key)
+    @hash_value[key] = value
+  end
+
+  def [] key
+    return nil unless include?(key)
+    @hash_value[key]
+  end
+
+  def key? key
+    include?(key)
+  end
+
+  def keys
+    @hash_value.keys
+  end
+end

data/test/helper.rb

@@ -0,0 +1,2 @@
+require 'bloomfilter'
+require 'test/unit'

data/test/test_bloom_filter.rb

@@ -0,0 +1,44 @@
+require 'helper'
+
+class TestBloomFilter < Test::Unit::TestCase
+  def test_include?
+    bf = BloomFilter.new(10, 2, 1, 1, false)
+    bf.insert("test")
+    bf.insert("test")
+    bf.insert("test")
+    bf.insert("test")
+    bf.insert("test")
+    assert bf.include?("test")
+    assert !bf.include?("lkajdsfhlkajsdfhlakjsdfhalsjdkfh")
+  end
+
+  def test_hash_key_insert
+   bf = BloomFilter.new(10, 2, 1)
+   bf['foo'] = 'bar'
+   assert bf.key?('foo')
+   assert_equal 'bar', bf['foo']
+  end
+
+  def test_hash_key?
+   bf = BloomFilter.new(10, 2, 1)
+   assert !bf.key?('foo')
+   bf['foo'] = 'bar'
+   assert bf.key?('foo')
+  end
+
+  def test_keys
+   bf = BloomFilter.new(10, 2, 1)
+   bf['foo'] = 'bar'
+   bf['awesome'] = 'bar'
+   assert_equal %w{ awesome foo }.sort, bf.keys.sort
+  end
+
+  #TODO: no delete function yet.
+  def test_delete
+    bf = BloomFilter.new(10, 2, 1, 2, false)
+    bf.insert("test")
+    assert bf.include?("test")
+    bf.delete("test")
+    assert !bf.include?("test")
+  end
+end

metadata

@@ -0,0 +1,65 @@
+--- !ruby/object:Gem::Specification 
+name: rjspotter-bloomfilter
+version: !ruby/object:Gem::Version 
+  version: 0.1.3
+platform: ruby
+authors: 
+- Ilya Grigorik
+- Tatsuya Mori
+- Randall Potter
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2009-07-01 00:00:00 -07:00
+default_executable: 
+dependencies: []
+
+description: Counting Bloom Filter in Ruby 1.9.1 version
+email: rjspotter@gmail.com
+executables: []
+
+extensions: 
+- ext/extconf.rb
+extra_rdoc_files: []
+
+files: 
+- README.rdoc
+- Rakefile
+- ext/crc32.c
+- ext/crc32.h
+- ext/extconf.rb
+- ext/sbloomfilter.c
+- lib/bloomfilter.rb
+- examples/bf.rb
+- examples/simple.rb
+- test/helper.rb
+- test/test_bloom_filter.rb
+has_rdoc: true
+homepage: http://github.com/igrigorik/bloomfilter
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+requirements: []
+
+rubyforge_project: bloomfilter
+rubygems_version: 1.2.0
+signing_key: 
+specification_version: 2
+summary: Counting Bloom Filter in Ruby 1.9.1 version
+test_files: []
+