bitset 0.0.0 → 0.0.1

data/README.rdoc

@@ -1,19 +1,3 @@
-= bitset
-
-Description goes here.
-
-== Contributing to bitset
- 
-* Check out the latest master to make sure the feature hasn't been implemented or the bug hasn't been fixed yet
-* Check out the issue tracker to make sure someone already hasn't requested it and/or contributed it
-* Fork the project
-* Start a feature/bugfix branch
-* Commit and push until you are happy with your contribution
-* Make sure to add tests for it. This is important so I don't break it in a future version unintentionally.
-* Please try not to mess with the Rakefile, version, or history. If you want to have your own version, or is otherwise necessary, that is fine, but please isolate to its own commit so I can cherry-pick around it.
-
-== Copyright
-
-Copyright (c) 2011 Tyler McMullen. See LICENSE.txt for
-further details.
+= Bitset
 
+A fast Bitset implementation for Ruby. Available as the 'bitset' gem.

data/VERSION

@@ -1 +1 @@
-0.0.0
+0.0.1

data/ext/bitset/bitset.c

@@ -250,8 +250,20 @@ static VALUE rb_bitset_hamming(VALUE self, VALUE other) {
     return INT2NUM(count);
 }
 
+static VALUE rb_bitset_each(VALUE self) {
+    Bitset * bs = get_bitset(self);
+    int i;
+
+    for(i = 0; i < bs->len; i++) {
+        rb_yield(get_bit(bs, i) > 0 ? Qtrue : Qfalse);
+    }
+
+    return self;
+}
+
 void Init_bitset() {
     cBitset = rb_define_class("Bitset", rb_cObject);
+    rb_include_module(cBitset, rb_mEnumerable);
     rb_define_alloc_func(cBitset, rb_bitset_alloc);
     rb_define_method(cBitset, "initialize", rb_bitset_initialize, 1);
     rb_define_method(cBitset, "size", rb_bitset_size, 0);
@@ -272,4 +284,5 @@ void Init_bitset() {
     rb_define_alias(cBitset, "^", "xor");
     rb_define_alias(cBitset, "symmetric_difference", "xor");
     rb_define_method(cBitset, "hamming", rb_bitset_hamming, 1);
+    rb_define_method(cBitset, "each", rb_bitset_each, 0);
 }

data/spec/bitset_spec.rb

@@ -200,4 +200,18 @@ describe Bitset do
       bs1.hamming(bs2).should == 3
     end
   end
+
+  describe :each do
+    it 'iterates over the bits in the Bitset' do
+      bs = Bitset.new(4)
+      bs.set 0, 2
+
+      i = 0
+      bs.each do |bit|
+        bit.should == bs[i]
+        i += 1
+      end
+      i.should == 4
+    end
+  end
 end

metadata

@@ -5,8 +5,8 @@ version: !ruby/object:Gem::Version
   segments: 
   - 0
   - 0
-  - 0
-  version: 0.0.0
+  - 1
+  version: 0.0.1
 platform: ruby
 authors: 
 - Tyler McMullen