bloom_fit 0.1.1 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 5f1a3e06592409a17a287562a4f51910e4c103cc7e7a95fa18b051e684ec2f72
-  data.tar.gz: 85dab6561d4626f1ece379cbdd63678befac1e19d8f3cc403a270a13da5ca049
+  metadata.gz: efa22c92049e3607485a8fcfe471b15cca6e85e6da0c7b19b65f74b9f6ad5fe9
+  data.tar.gz: 5e8432456b1258111671d536165217bc3e82e0e430c3bc63112abc4670f91e78
 SHA512:
-  metadata.gz: 2553c5c3ce8bff634d2d2f79bc58d9d05ee96426e681c3bdb3295c762fc01c9b2de0fe5aa97cc6755037a7c8a80cc4d367c31b6457e8b087489d36797ad1a598
-  data.tar.gz: 803c578af7494501775e52bb4db1ea46b5311c7280d20aaa632185d486dcd35ce60390a48d3ca4af2cb6adec4b9cbcc7aa7c922fcc5d9e58b0d7cdeb60a12fa7
+  metadata.gz: 72738a57ccb3a1a8989e86993490c3ba6a4f90925c834c1acd70ba104df8ef2bb318d5c66830786ba662e88df09f9ce46d7184810e3d4ec1c6b4cc0b41fcec44
+  data.tar.gz: 7472e370d1a66a6034ecb2f0d4720b9edd12f21e181a37cae2869e0e34c70a829366e7ee6caf880f4c4d8c789bc18bdbe2f83e6699617ccc77460320f2a2a1af

data/README.md

@@ -4,7 +4,12 @@
 [![CI](https://github.com/rmm5t/bloom_fit/actions/workflows/ci.yml/badge.svg)](https://github.com/rmm5t/bloom_fit/actions/workflows/ci.yml)
 [![Gem Downloads](https://img.shields.io/gem/dt/bloom_fit.svg)](https://rubygems.org/gems/bloom_fit)
 
-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.
+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 differs in the following ways:
+
+- uses DJB2 over CRC32 yielding better hash distribution
+- improves performance for very large datasets
+- avoids the need to supply a seed
+- automatically calculates the bit size (m) and the number of hashes (k) when given a capacity and false-positive-rate
 
 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.
 
@@ -13,8 +18,6 @@ Performance of the Bloom filter depends on the following:
 - size of the bit array
 - number of hash functions
 
-BloomFit is a fork of [bloomfilter-rb].
-
 ## Resources
 
 - Background: [Bloom filter](http://en.wikipedia.org/wiki/Bloom_filter)
@@ -25,7 +28,7 @@ BloomFit is a fork of [bloomfilter-rb].
 
 MRI/C implementation which creates an in-memory filter which can be saved and reloaded from disk.
 
-(COMING SOON) If you'd like to specify an expected item count and a false-positive rate that you can tolerate:
+(COMING SOON) If you'd like to specify an expected item count and a false-positive rate that you can tolerate. Visit the [Bloom Filter Calculator](https://hur.st/bloomfilter/) to learn more.
 
 ```ruby
 require "bloom_fit"
@@ -40,11 +43,11 @@ bf["bird"] = "bar"
 bf["bird"]             # => true
 bf["mouse"]            # => false
 
-bf.stats
-# => Number of filter bits (m): 3600
-# => Number of set bits (n): 20
-# => Number of filter hashes (k) : 10
-# => Predicted false positive rate = 0.00%
+puts bf.stats
+# Number of filter bits (m): 3600
+# Number of set bits (n): 20
+# Number of filter hashes (k) : 10
+# Predicted false positive rate = 0.00%
 ```
 
 If you'd like more control over the traditional inputs like bit size and the number of hashes:
@@ -62,11 +65,11 @@ bf["bird"] = "bar"
 bf["bird"]             # => true
 bf["mouse"]            # => false
 
-bf.stats
-# => Number of filter bits (m): 100
-# => Number of set bits (n): 4
-# => Number of filter hashes (k) : 2
-# => Predicted false positive rate = 10.87%
+puts bf.stats
+# Number of filter bits (m): 100
+# Number of set bits (n): 4
+# Number of filter hashes (k) : 2
+# Predicted false positive rate = 10.87%
 ```
 
 ## Credits

data/ext/cbloomfilter/cbloomfilter.c

@@ -11,110 +11,99 @@
 # define RSTRING_PTR(x) (RSTRING(x)->ptr)
 #endif
 
-/* Reuse the standard CRC table for consistent seeds */
-static unsigned int *seeds = crc_table;
+/* Reuse the standard CRC table for consistent salts */
+static unsigned int *salts = crc_table;
 
 static VALUE cBloomFilter;
 
 struct BloomFilter {
-    int m; /* # of buckets in a bloom filter */
-    int b; /* # of bits in a bloom filter bucket */
+    int m; /* # of bits in a bloom filter */
     int k; /* # of hash functions */
-    int r; /* # raise on bucket overflow? */
     unsigned char *ptr; /* bits data */
     int bytes; /* size of byte data */
 };
 
-unsigned long djb2(unsigned char *str, int len) {
+unsigned long djb2(const char *str, int len) {
     unsigned long hash = 5381;
-    unsigned char *c;
-    c = (unsigned char *) str;
-    while (len > 0) {
-        hash = ((hash << 5) ^ hash) ^ (*c);
-        --len;
-        ++c;
+    for (int i = 0; i < len; i++) {
+        hash = ((hash << 5) + hash) + str[i];
     }
     return hash;
 }
 
-void bits_free(struct BloomFilter *bf) {
+static void bf_free(void *ptr) {
+    struct BloomFilter *bf = ptr;
+
+    if (bf == NULL) {
+        return;
+    }
+
     ruby_xfree(bf->ptr);
+    ruby_xfree(bf);
 }
 
-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 {
-        // reduce the counter: 11 00 => 10 00 (suppose bf->b is 2)
-        c -= (1 << bit_offset) & ((1 << 8) -1);
-        // shift the bitmap right by 1 bit: 10 00 => 01 00
-        c = (~mask & c) | ((c & mask) >> (bit_offset + 1) << bit_offset);
-
-        bf->ptr[byte_offset] = c & ((1 << 8) - 1);
-        bf->ptr[byte_offset + 1] = (c & ((1 << 16) - 1)) >> 8;
+static size_t bf_memsize(const void *ptr) {
+    const struct BloomFilter *bf = ptr;
+
+    if (bf == NULL) {
+        return 0;
     }
+
+    return sizeof(*bf) + (bf->ptr == NULL ? 0 : (size_t) bf->bytes);
 }
 
-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 {
-        c = c + ((1 << bit_offset) & ((1 << 8) -1)) | c;
-        bf->ptr[byte_offset] = c & ((1 << 8) - 1);
-        bf->ptr[byte_offset + 1] = (c & ((1 << 16) - 1)) >> 8;
-    }
+static const rb_data_type_t bf_type = {
+    "CBloomFilter",
+    {0, bf_free, bf_memsize,},
+    0, 0, RUBY_TYPED_FREE_IMMEDIATELY,
+};
+
+static struct BloomFilter *bf_ptr(VALUE obj) {
+    struct BloomFilter *bf;
+
+    TypedData_Get_Struct(obj, struct BloomFilter, &bf_type, bf);
+
+    return bf;
+}
+
+static VALUE bf_alloc(VALUE klass) {
+    struct BloomFilter *bf;
+    VALUE obj = TypedData_Make_Struct(klass, struct BloomFilter, &bf_type, bf);
+
+    bf->m = 0;
+    bf->k = 0;
+    bf->ptr = NULL;
+    bf->bytes = 0;
+
+    return obj;
 }
 
-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;
+static void bucket_set(struct BloomFilter *bf, int index) {
+    int byte_offset = index / 8;
+    int bit_offset = index % 8;
 
-    unsigned int mask = ((1 << bf->b) - 1) << bit_offset;
-    return (c & mask) >> bit_offset;
+    bf->ptr[byte_offset] |= (unsigned char) (1U << 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;
+static int bucket_check(struct BloomFilter *bf, int index) {
+    int byte_offset = index / 8;
+    int bit_offset = index % 8;
 
-    unsigned int mask = ((1 << bf->b) - 1) << bit_offset;
-    return (c & mask) >> bit_offset;
+    return (bf->ptr[byte_offset] >> bit_offset) & 1;
 }
 
-static VALUE bf_s_new(int argc, VALUE *argv, VALUE self) {
+static VALUE bf_initialize(int argc, VALUE *argv, VALUE self) {
     struct BloomFilter *bf;
-    VALUE arg1, arg2, arg3, arg4, obj;
-    int m, k, b, r;
+    VALUE arg1, arg2;
+    int m, k;
 
-    obj = Data_Make_Struct(self, struct BloomFilter, NULL, bits_free, bf);
+    bf = bf_ptr(self);
 
     /* default = Fugou approach :-) */
-    arg1 = INT2FIX(100000000);
+    arg1 = INT2FIX(1000);
     arg2 = INT2FIX(4);
-    arg3 = INT2FIX(1);
-    arg4 = INT2FIX(0);
 
     switch (argc) {
-        case 4:
-      if (argv[3] == Qtrue) {
-        arg4 = INT2FIX(1);
-      }
-        case 3:
-      arg3 = argv[2];
         case 2:
       arg2 = argv[1];
         case 1:
@@ -124,66 +113,48 @@ static VALUE bf_s_new(int argc, VALUE *argv, VALUE self) {
 
     m = FIX2INT(arg1);
     k = FIX2INT(arg2);
-    b = FIX2INT(arg3);
-    r = FIX2INT(arg4);
 
-    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");
 
-    bf->b = b;
     bf->m = m;
     bf->k = k;
-    bf->r = r;
 
-    bf->bytes = ((m * b) + 15) / 8;
+    ruby_xfree(bf->ptr);
+    bf->ptr = NULL;
+    bf->bytes = 0;
+    /* Preserve the existing serialized bitmap length, including one padding byte. */
+    bf->bytes = (m + 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());
+    rb_iv_set(self, "@hash_value", rb_hash_new());
 
-    return obj;
+    return self;
 }
 
 static VALUE bf_clear(VALUE self) {
-    struct BloomFilter *bf;
-    Data_Get_Struct(self, struct BloomFilter, bf);
+    struct BloomFilter *bf = bf_ptr(self);
     memset(bf->ptr, 0, bf->bytes);
     return Qtrue;
 }
 
 static VALUE bf_m(VALUE self) {
-    struct BloomFilter *bf;
-    Data_Get_Struct(self, struct BloomFilter, bf);
+    struct BloomFilter *bf = bf_ptr(self);
     return INT2FIX(bf->m);
 }
 
 static VALUE bf_k(VALUE self) {
-    struct BloomFilter *bf;
-    Data_Get_Struct(self, struct BloomFilter, bf);
+    struct BloomFilter *bf = bf_ptr(self);
     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_set_bits(VALUE self){
-    struct BloomFilter *bf;
+    struct BloomFilter *bf = bf_ptr(self);
     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;
@@ -192,13 +163,13 @@ static VALUE bf_set_bits(VALUE self){
     return INT2FIX(count);
 }
 
-static VALUE bf_insert(VALUE self, VALUE key) {
+static VALUE bf_add(VALUE self, VALUE key) {
     VALUE skey;
-    unsigned long hash, index;
+    unsigned long hash;
+    int index;
     int i, len, m, k;
     char *ckey;
-    struct BloomFilter *bf;
-    Data_Get_Struct(self, struct BloomFilter, bf);
+    struct BloomFilter *bf = bf_ptr(self);
 
     skey = rb_obj_as_string(key);
     ckey = StringValuePtr(skey);
@@ -209,7 +180,7 @@ static VALUE bf_insert(VALUE self, VALUE key) {
 
     hash = (unsigned long) djb2(ckey, len);
     for (i = 0; i <= k - 1; i++) {
-        index = (unsigned long) (hash ^ seeds[i]) % (unsigned int) (m);
+        index = (int) ((hash ^ salts[i]) % (unsigned int) (m));
 
         /*  set a bit at the index */
         bucket_set(bf, index);
@@ -219,10 +190,9 @@ static VALUE bf_insert(VALUE self, VALUE key) {
 }
 
 static VALUE bf_merge(VALUE self, VALUE other) {
-    struct BloomFilter *bf, *target;
+    struct BloomFilter *bf = bf_ptr(self);
+    struct BloomFilter *target = bf_ptr(other);
     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];
     }
@@ -230,19 +200,17 @@ static VALUE bf_merge(VALUE self, VALUE other) {
 }
 
 static VALUE bf_and(VALUE self, VALUE other) {
-    struct BloomFilter *bf, *bf_other, *target;
+    struct BloomFilter *bf = bf_ptr(self);
+    struct BloomFilter *bf_other = bf_ptr(other);
+    struct BloomFilter *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->b);
-    args[3] = INT2FIX(bf->r);
     klass = rb_funcall(self,rb_intern("class"),0);
-    obj = bf_s_new(4,args,klass);
-    Data_Get_Struct(obj, struct BloomFilter, target);
+    obj = rb_class_new_instance(2, args, klass);
+    target = bf_ptr(obj);
     for (i = 0; i < bf->bytes; i++){
         target->ptr[i] = bf->ptr[i] & bf_other->ptr[i];
     }
@@ -251,19 +219,17 @@ static VALUE bf_and(VALUE self, VALUE other) {
 }
 
 static VALUE bf_or(VALUE self, VALUE other) {
-    struct BloomFilter *bf, *bf_other, *target;
+    struct BloomFilter *bf = bf_ptr(self);
+    struct BloomFilter *bf_other = bf_ptr(other);
+    struct BloomFilter *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->b);
-    args[3] = INT2FIX(bf->r);
     klass = rb_funcall(self,rb_intern("class"),0);
-    obj = bf_s_new(4,args,klass);
-    Data_Get_Struct(obj, struct BloomFilter, target);
+    obj = rb_class_new_instance(2, args, klass);
+    target = bf_ptr(obj);
     for (i = 0; i < bf->bytes; i++){
         target->ptr[i] = bf->ptr[i] | bf_other->ptr[i];
     }
@@ -271,13 +237,13 @@ static VALUE bf_or(VALUE self, VALUE other) {
     return obj;
 }
 
-static VALUE bf_delete(VALUE self, VALUE key) {
-    unsigned long hash, index;
+static VALUE bf_include(VALUE self, VALUE key) {
+    VALUE skey;
+    unsigned long hash;
+    int index;
     int i, len, m, k;
     char *ckey;
-    VALUE skey;
-    struct BloomFilter *bf;
-    Data_Get_Struct(self, struct BloomFilter, bf);
+    struct BloomFilter *bf = bf_ptr(self);
 
     skey = rb_obj_as_string(key);
     ckey = StringValuePtr(skey);
@@ -288,69 +254,19 @@ static VALUE bf_delete(VALUE self, VALUE key) {
 
     hash = (unsigned long) djb2(ckey, len);
     for (i = 0; i <= k - 1; i++) {
-        index = (unsigned long) (hash ^ seeds[i]) % (unsigned int) (m);
-
-        /*  set a bit at the index */
-        bucket_unset(bf, index);
-    }
-
-    return Qnil;
-}
-
-
-static VALUE bf_include(int argc, VALUE* argv, VALUE self) {
-    unsigned long hash, index;
-    int i, len, m, k, 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 */
+        index = (int) ((hash ^ salts[i]) % (unsigned int) (m));
 
-      m = bf->m;
-      k = bf->k;
-
-      hash = (unsigned long) djb2(ckey, len);
-      for (i = 0; i <= k - 1; i++) {
-          index = (unsigned long) (hash ^ seeds[i]) % (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;
+        /* check the bit at the index */
+        if (!bucket_check(bf, index)) {
+            return Qfalse; /* i.e., it is a new entry ; escape the loop */
+        }
     }
-}
-
-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;
+    return Qtrue;
 }
 
 static VALUE bf_bitmap(VALUE self) {
-    struct BloomFilter *bf;
-    Data_Get_Struct(self, struct BloomFilter, bf);
+    struct BloomFilter *bf = bf_ptr(self);
 
     VALUE str = rb_str_new(0, bf->bytes);
     unsigned char* ptr = (unsigned char *) RSTRING_PTR(str);
@@ -361,8 +277,7 @@ static VALUE bf_bitmap(VALUE self) {
 }
 
 static VALUE bf_load(VALUE self, VALUE bitmap) {
-    struct BloomFilter *bf;
-    Data_Get_Struct(self, struct BloomFilter, bf);
+    struct BloomFilter *bf = bf_ptr(self);
     unsigned char* ptr = (unsigned char *) RSTRING_PTR(bitmap);
 
     memcpy(bf->ptr, ptr, bf->bytes);
@@ -372,26 +287,21 @@ static VALUE bf_load(VALUE self, VALUE bitmap) {
 
 void Init_cbloomfilter(void) {
     cBloomFilter = rb_define_class("CBloomFilter", rb_cObject);
-    rb_define_singleton_method(cBloomFilter, "new", bf_s_new, -1);
+    rb_define_alloc_func(cBloomFilter, bf_alloc);
+    rb_define_method(cBloomFilter, "initialize", bf_initialize, -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, "set_bits", bf_set_bits, 0);
-    /* rb_define_method(cBloomFilter, "s", bf_s, 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, "add", bf_add, 1);
+    rb_define_method(cBloomFilter, "include?", bf_include, 1);
     rb_define_method(cBloomFilter, "clear", bf_clear, 0);
-    rb_define_method(cBloomFilter, "merge!", bf_merge, 1);
+    rb_define_method(cBloomFilter, "merge", bf_merge, 1);
     rb_define_method(cBloomFilter, "&", bf_and, 1);
     rb_define_method(cBloomFilter, "|", bf_or, 1);
 
-    rb_define_method(cBloomFilter, "to_s", bf_to_s, 0);
     rb_define_method(cBloomFilter, "bitmap", bf_bitmap, 0);
     rb_define_method(cBloomFilter, "load", bf_load, 1);
 
     /* functions that have not been implemented, yet */
-
     //  rb_define_method(cBloomFilter, "<=>", bf_cmp, 1);
 }

data/ext/cbloomfilter/extconf.rb

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

data/lib/bloom_fit/configuration_mismatch.rb

@@ -0,0 +1,4 @@
+class BloomFit
+  class ConfigurationMismatch < ArgumentError
+  end
+end

data/lib/bloom_fit/version.rb

@@ -1,3 +1,3 @@
 class BloomFit
-  VERSION = "0.1.1".freeze
+  VERSION = "0.3.0".freeze
 end