return enumerator if no block given; add #each_byte

Author: questionmarkexclamationpoint

lib/bitarray-array.rb

@@ -26,14 +26,21 @@ def [](position)
   end
 
   # Iterate over each bit
-  def each(&block)
+  def each
+    return to_enum(:each) unless block_given?
     @size.times { |position| yield self[position] }
   end
 
   # Returns the field as a string like "0101010100111100," etc.
   def to_s
     @field.collect{|ea| ("%0#{ELEMENT_WIDTH}b" % ea).reverse}.join[0..@size-1]
   end
+  
+  # Iterate over each byte
+  def each_byte
+    return to_enum(:each_byte) unless block_given?
+    @field.each { |byte| yield byte }
+  end
 
   # Returns the total number of bits that are set
   # (The technique used here is about 6 times faster than using each or inject direct on the bitfield)

lib/bitarray.rb

@@ -26,7 +26,8 @@ def [](position)
   end
 
   # Iterate over each bit
-  def each(&block)
+  def each
+    return to_enum(:each) unless block_given?
     @size.times { |position| yield self[position] }
   end
 
@@ -38,11 +39,17 @@ def to_s
       @field.bytes.collect { |ea| ("%08b" % ea) }.join[0, @size]
     end
   end
+  
+  # Iterates over each byte
+  def each_byte
+    return to_enum(:each_byte) unless block_given?
+    @field.bytes.each{ |byte| yield byte }
+  end
 
   # Returns the total number of bits that are set
   # (The technique used here is about 6 times faster than using each or inject direct on the bitfield)
   def total_set
-    @field.bytes.inject(0) { |a, byte| a += byte & 1 and byte >>= 1 until byte == 0; a }
+    each_byte.inject(0) { |a, byte| a += byte & 1 and byte >>= 1 until byte == 0; a }
   end
 
   def byte_position(position)