Class: CBloomFilter

Inherits:
Object
  • Object
show all
Defined in:
ext/cbloomfilter/cbloomfilter.c

Class Method Summary collapse

Instance Method Summary collapse

Class Method Details

.new(*args) ⇒ Object 



85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 85

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->bytes = ((m * b) + 15) / 8;
    bf->ptr = ALLOC_N(unsigned char, bf->bytes);

    /* initialize the bits with zeros */
    memset(bf->ptr, 0, bf->bytes);
    rb_iv_set(obj, "@hash_value", rb_hash_new());

    return obj;
}

Instance Method Details

#&(other) ⇒ Object 



236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 236

static VALUE bf_and(VALUE self, VALUE other) {
    struct BloomFilter *bf, *bf_other, *target;
    VALUE klass, obj, args[5];
    int i;

    Data_Get_Struct(self, struct BloomFilter, bf);
    Data_Get_Struct(other, struct BloomFilter, bf_other);
    args[0] = INT2FIX(bf->m);
    args[1] = INT2FIX(bf->k);
    args[2] = INT2FIX(bf->s);
    args[3] = INT2FIX(bf->b);
    args[4] = INT2FIX(bf->r);
    klass = rb_funcall(self,rb_intern("class"),0);
    obj = bf_s_new(5,args,klass);
    Data_Get_Struct(obj, struct BloomFilter, target);
    for (i = 0; i < bf->bytes; i++){
        target->ptr[i] = bf->ptr[i] & bf_other->ptr[i];
    }

    return obj;
}

#b ⇒ Object 



165
166
167
168
169
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 165

static VALUE bf_b(VALUE self) {
    struct BloomFilter *bf;
    Data_Get_Struct(self, struct BloomFilter, bf);
    return INT2FIX(bf->b);
}

#bitmap ⇒ Object 



366
367
368
369
370
371
372
373
374
375
376
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 366

static VALUE bf_bitmap(VALUE self) {
    struct BloomFilter *bf;
    Data_Get_Struct(self, struct BloomFilter, bf);

    VALUE str = rb_str_new(0, bf->bytes);
    unsigned char* ptr = (unsigned char *) RSTRING_PTR(str);

    memcpy(ptr, bf->ptr, bf->bytes);
    
    return str;
}

#clear ⇒ Object 



146
147
148
149
150
151
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 146

static VALUE bf_clear(VALUE self) {
    struct BloomFilter *bf;
    Data_Get_Struct(self, struct BloomFilter, bf);
    memset(bf->ptr, 0, bf->bytes);
    return Qtrue;
}

#delete(key) ⇒ Object 



280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 280

static VALUE bf_delete(VALUE self, VALUE key) {
    int index, seed;
    int i, len, m, k, s;
    char *ckey;
    VALUE skey;
    struct BloomFilter *bf;
    Data_Get_Struct(self, struct BloomFilter, bf);

    skey = rb_obj_as_string(key);
    ckey = StringValuePtr(skey);
    len = (int) (RSTRING_LEN(skey)); /* 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);
    }

    return Qnil;
}

#include?(*args) ⇒ Boolean

Returns:

  • (Boolean) 


311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 311

static VALUE bf_include(int argc, VALUE* argv, VALUE self) {
    int index, seed;
    int i, len, m, k, s, tests_idx, vlen;
    char *ckey;
    VALUE tests, key, skey;
    struct BloomFilter *bf;

    rb_scan_args(argc, argv, "*", &tests);

    Data_Get_Struct(self, struct BloomFilter, bf);
    vlen = RARRAY_LEN(tests);
    for(tests_idx = 0; tests_idx < vlen; tests_idx++) {
      key = rb_ary_entry(tests, tests_idx);
      skey = rb_obj_as_string(key);
      ckey = StringValuePtr(skey);
      len = (int) (RSTRING_LEN(skey)); /* 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;
    }

}

#insert(key) ⇒ Object 



195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 195

static VALUE bf_insert(VALUE self, VALUE key) {
    VALUE skey;
    int index, seed;
    int i, len, m, k, s;
    char *ckey;
    struct BloomFilter *bf;
    Data_Get_Struct(self, struct BloomFilter, bf);

    skey = rb_obj_as_string(key);
    ckey = StringValuePtr(skey);
    len = (int) (RSTRING_LEN(skey)); /* 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);
    }

    return Qnil;
}

#k ⇒ Object 



159
160
161
162
163
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 159

static VALUE bf_k(VALUE self) {
    struct BloomFilter *bf;
    Data_Get_Struct(self, struct BloomFilter, bf);
    return INT2FIX(bf->k);
}

#load(bitmap) ⇒ Object 



378
379
380
381
382
383
384
385
386
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 378

static VALUE bf_load(VALUE self, VALUE bitmap) {
    struct BloomFilter *bf;
    Data_Get_Struct(self, struct BloomFilter, bf);
    unsigned char* ptr = (unsigned char *) RSTRING_PTR(bitmap);

    memcpy(bf->ptr, ptr, bf->bytes);    

    return Qnil;
}

#m ⇒ Object 



153
154
155
156
157
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 153

static VALUE bf_m(VALUE self) {
    struct BloomFilter *bf;
    Data_Get_Struct(self, struct BloomFilter, bf);
    return INT2FIX(bf->m);
}

#merge!(other) ⇒ Object 



225
226
227
228
229
230
231
232
233
234
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 225

static VALUE bf_merge(VALUE self, VALUE other) {
    struct BloomFilter *bf, *target;
    int i;
    Data_Get_Struct(self, struct BloomFilter, bf);
    Data_Get_Struct(other, struct BloomFilter, target);
    for (i = 0; i < bf->bytes; i++) {
        bf->ptr[i] |= target->ptr[i];
    }
    return Qnil;
}

#r ⇒ Object 



171
172
173
174
175
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 171

static VALUE bf_r(VALUE self) {
    struct BloomFilter *bf;
    Data_Get_Struct(self, struct BloomFilter, bf);
    return bf->r == 0 ? Qfalse : Qtrue;
}

#s ⇒ Object 



177
178
179
180
181
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 177

static VALUE bf_s(VALUE self) {
    struct BloomFilter *bf;
    Data_Get_Struct(self, struct BloomFilter, bf);
    return INT2FIX(bf->s);
}

#set_bits ⇒ Object 



183
184
185
186
187
188
189
190
191
192
193
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 183

static VALUE bf_set_bits(VALUE self){
    struct BloomFilter *bf;
    int i,j,count = 0;
    Data_Get_Struct(self, struct BloomFilter, bf);
    for (i = 0; i < bf->bytes; i++) {
        for (j = 0; j < 8; j++) {
            count += (bf->ptr[i] >> j) & 1;
        }
    }
    return INT2FIX(count);
}

#to_s ⇒ Object 



350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 350

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 *) RSTRING_PTR(str);
    for (i = 0; i < bf->m; i++)
        *ptr++ = bucket_get(bf, i) ? '1' : '0';

    return str;
}

#|(other) ⇒ Object 



258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
 
# File 'ext/cbloomfilter/cbloomfilter.c', line 258

static VALUE bf_or(VALUE self, VALUE other) {
    struct BloomFilter *bf, *bf_other, *target;
    VALUE klass, obj, args[5];
    int i;

    Data_Get_Struct(self, struct BloomFilter, bf);
    Data_Get_Struct(other, struct BloomFilter, bf_other);
    args[0] = INT2FIX(bf->m);
    args[1] = INT2FIX(bf->k);
    args[2] = INT2FIX(bf->s);
    args[3] = INT2FIX(bf->b);
    args[4] = INT2FIX(bf->r);
    klass = rb_funcall(self,rb_intern("class"),0);
    obj = bf_s_new(5,args,klass);
    Data_Get_Struct(obj, struct BloomFilter, target);
    for (i = 0; i < bf->bytes; i++){
        target->ptr[i] = bf->ptr[i] | bf_other->ptr[i];
    }

    return obj;
}