hamster 0.3.10 → 0.4.0

data/lib/hamster/undefined.rbc

@@ -0,0 +1,258 @@
+!RBIX
+0
+x
+M
+1
+n
+n
+x
+10
+__script__
+i
+28
+99
+7
+0
+65
+49
+1
+2
+13
+99
+12
+7
+2
+12
+7
+3
+12
+65
+12
+49
+4
+4
+15
+49
+2
+0
+15
+2
+11
+I
+6
+I
+0
+I
+0
+I
+0
+n
+p
+5
+x
+7
+Hamster
+x
+11
+open_module
+x
+15
+__module_init__
+M
+1
+n
+n
+x
+7
+Hamster
+i
+28
+5
+66
+99
+7
+0
+65
+49
+1
+2
+13
+99
+12
+7
+2
+12
+7
+3
+12
+65
+12
+49
+4
+4
+15
+49
+2
+0
+11
+I
+6
+I
+0
+I
+0
+I
+0
+n
+p
+5
+x
+9
+Undefined
+x
+11
+open_module
+x
+15
+__module_init__
+M
+1
+n
+n
+x
+9
+Undefined
+i
+13
+5
+66
+99
+7
+0
+7
+1
+65
+5
+49
+2
+4
+11
+I
+5
+I
+0
+I
+0
+I
+0
+n
+p
+3
+x
+5
+erase
+M
+1
+n
+n
+x
+5
+erase
+i
+14
+20
+0
+5
+49
+0
+1
+9
+11
+1
+8
+13
+20
+0
+11
+I
+3
+I
+1
+I
+1
+I
+1
+n
+p
+1
+x
+6
+equal?
+p
+5
+I
+0
+I
+5
+I
+0
+I
+6
+I
+e
+x
+62
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/undefined.rb
+p
+1
+x
+5
+value
+x
+13
+attach_method
+p
+3
+I
+2
+I
+5
+I
+d
+x
+62
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/undefined.rb
+p
+0
+x
+13
+attach_method
+p
+3
+I
+2
+I
+3
+I
+1c
+x
+62
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/undefined.rb
+p
+0
+x
+13
+attach_method
+p
+3
+I
+0
+I
+1
+I
+1c
+x
+62
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/undefined.rb
+p
+0

data/lib/hamster/vector.rb

@@ -0,0 +1,157 @@
+require 'forwardable'
+
+require 'hamster/undefined'
+require 'hamster/immutable'
+require 'hamster/enumerable'
+
+module Hamster
+
+  def self.vector(*items)
+    items.reduce(EmptyVector) { |vector, item| vector.add(item) }
+  end
+
+  class Vector
+
+    extend Forwardable
+
+    include Immutable
+
+    include Enumerable
+
+    BLOCK_SIZE = 32
+    INDEX_MASK = BLOCK_SIZE - 1
+    BITS_PER_LEVEL = 5
+
+    def initialize
+      @levels = 0
+      @root = []
+      @size = 0
+    end
+
+    def empty?
+      @size == 0
+    end
+    def_delegator :self, :empty?, :null?
+
+    def size
+      @size
+    end
+    def_delegator :self, :size, :length
+
+    def first
+      get(0)
+    end
+    def_delegator :self, :first, :head
+
+    def last
+      get(-1)
+    end
+
+    def add(item)
+      transform do
+        update_leaf_node(@size, item)
+        @size += 1
+      end
+    end
+    def_delegator :self, :add, :<<
+    def_delegator :self, :add, :cons
+
+    # def delete(index)
+    # end
+
+    def set(index, item = Undefined)
+      return set(index, yield(get(index))) if item.equal?(Undefined)
+      raise IndexError if empty? or index == @size
+      raise IndexError if index.abs > @size
+      return set(@size + index, item) if index < 0
+      transform do
+        update_leaf_node(index, item)
+      end
+    end
+
+    def get(index)
+      return nil if empty? or index == @size
+      return nil if index.abs > @size
+      return get(@size + index) if index < 0
+      leaf_node_for(@root, root_index_bits, index)[index & INDEX_MASK]
+    end
+    def_delegator :self, :get, :[]
+    def_delegator :self, :get, :at
+
+    def each(&block)
+      return self unless block_given?
+      traverse_depth_first(&block)
+      nil
+    end
+
+    def filter
+      return self unless block_given?
+      reduce(EmptyVector) { |vector, item| yield(item) ? vector.add(item) : vector }
+    end
+
+    def clear
+      EmptyVector
+    end
+
+    def inspect
+      to_a.inspect
+    end
+
+    def eql?(other)
+      return true if other.equal?(self)
+      return false unless instance_of?(other.class) && @size == other.size
+      @root.eql?(other.instance_variable_get(:@root))
+    end
+    def_delegator :self, :eql?, :==
+
+    private
+
+    def traverse_depth_first(node = @root, level = @levels, &block)
+      return node.each(&block) if level == 0
+      node.each { |child| traverse_depth_first(child, level - 1, &block) }
+    end
+
+    def leaf_node_for(node, child_index_bits, index)
+      return node if child_index_bits == 0
+      child_index = (index >> child_index_bits) & INDEX_MASK
+      leaf_node_for(node[child_index], child_index_bits - BITS_PER_LEVEL, index)
+    end
+
+    def update_leaf_node(index, item)
+      copy_leaf_node_for(new_root, root_index_bits, index)[index & INDEX_MASK] = item
+    end
+
+    def copy_leaf_node_for(node, child_index_bits, index)
+      return node if child_index_bits == 0
+      child_index = (index >> child_index_bits) & INDEX_MASK
+      if child_node = node[child_index]
+        child_node = child_node.dup
+      else
+        child_node = []
+      end
+      node[child_index] = child_node
+      copy_leaf_node_for(child_node, child_index_bits - BITS_PER_LEVEL, index)
+    end
+
+    def new_root
+      if full?
+        @levels += 1
+        @root = [@root]
+      else
+        @root = @root.dup
+      end
+    end
+
+    def full?
+      (@size >> root_index_bits) > 0
+    end
+
+    def root_index_bits
+      @levels * BITS_PER_LEVEL
+    end
+
+  end
+
+  EmptyVector = Vector.new
+
+end

data/lib/hamster/version.rb

@@ -1,5 +1,5 @@
 module Hamster
 
-  VERSION = "0.3.10".freeze
+  VERSION = "0.4.0".freeze
 
 end

data/lib/hamster/version.rbc

@@ -0,0 +1,136 @@
+!RBIX
+0
+x
+M
+1
+n
+n
+x
+10
+__script__
+i
+28
+99
+7
+0
+65
+49
+1
+2
+13
+99
+12
+7
+2
+12
+7
+3
+12
+65
+12
+49
+4
+4
+15
+49
+2
+0
+15
+2
+11
+I
+6
+I
+0
+I
+0
+I
+0
+n
+p
+5
+x
+7
+Hamster
+x
+11
+open_module
+x
+15
+__module_init__
+M
+1
+n
+n
+x
+7
+Hamster
+i
+15
+5
+66
+65
+7
+0
+7
+1
+64
+49
+2
+0
+49
+3
+2
+11
+I
+3
+I
+0
+I
+0
+I
+0
+n
+p
+4
+x
+7
+VERSION
+s
+6
+0.3.10
+x
+6
+freeze
+x
+9
+const_set
+p
+3
+I
+2
+I
+3
+I
+f
+x
+60
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/version.rb
+p
+0
+x
+13
+attach_method
+p
+3
+I
+0
+I
+1
+I
+1c
+x
+60
+/Users/haruki_zaemon/Projects/hamster/lib/hamster/version.rb
+p
+0