ds 0.0.4 → 0.0.6

data/test/test_binary_heap.rb

@@ -1,53 +1,59 @@
-require "help"
+require 'help'
 
 describe BinaryHeap do
-
   before do
-    @arr = [9,8,4,5,11,6]
-    @arr2 = [4,2,9,11,3,5,1]
+    @arr = [9, 8, 4, 5, 11, 6]
+    @arr2 = [4, 2, 9, 11, 3, 5, 1]
     @heap = BinaryHeap.new(*@arr)
     @heap2 = BinaryHeap.max(*@arr2)
   end
 
-  it "should create heap from array" do
-    @heap.to_a.must_equal [11,9,6,5,8,4]
-    @heap2.to_a.must_equal [11,4,9,2,3,5,1]
+  it 'should create heap from array' do
+    @heap.to_a.must_equal [11, 9, 6, 5, 8, 4]
+    @heap2.to_a.must_equal [11, 4, 9, 2, 3, 5, 1]
+  end
+
+  it '#insert should insert new element to the heap maintaining heap relation.' do
+    @heap.size.must_equal 6
+    @heap.insert(13).to_a.must_equal [13, 9, 11, 5, 8, 4, 6]
+    @heap.size.must_equal 7
   end
 
-  it "#insert should insert new element to the heap maintaining heap relation." do
-    @heap.insert(13).to_a.must_equal  [13,9,11,5,8,4,6]
+  it '#top should return max or min heap element' do
+    @heap.top.must_equal 11
+    @heap.shift
+    @heap.top.must_equal 9
   end
 
-  it "#shift should remove element from heap maintaining heap relation." do
+  it '#shift should remove element from heap maintaining heap relation.' do
     @heap.shift.must_equal 11
-    @heap.to_a.must_equal [9,8,6,5,4]
+    @heap.to_a.must_equal [9, 8, 6, 5, 4]
     @heap.shift.must_equal 9
-    @heap.to_a.must_equal [8,5,6,4]
+    @heap.to_a.must_equal [8, 5, 6, 4]
     @heap.shift.must_equal 8
-    @heap.to_a.must_equal [6,5,4]
+    @heap.to_a.must_equal [6, 5, 4]
     @heap.shift.must_equal 6
-    @heap.to_a.must_equal [5,4]
+    @heap.to_a.must_equal [5, 4]
     @heap.shift.must_equal 5
     @heap.to_a.must_equal [4]
     @heap.shift.must_equal 4
     @heap.shift.must_be_nil
   end
 
-  describe "Minimal Heap" do
-
+  describe 'Minimal Heap' do
     before do
-      @min_heap = BinaryHeap.new(*@arr){|parent,child| parent < child}
+      @min_heap = BinaryHeap.new(*@arr) { |parent, child| parent < child }
       @min_heap2 = BinaryHeap.min(*@arr)
     end
 
-    it "should create heap from array." do
-      @min_heap.to_a.must_equal [4,5,6,8,11,9]
-      @min_heap2.to_a.must_equal [4,5,6,8,11,9]
+    it 'should create heap from array.' do
+      @min_heap.to_a.must_equal [4, 5, 6, 8, 11, 9]
+      @min_heap2.to_a.must_equal [4, 5, 6, 8, 11, 9]
     end
 
-    it "#insert should insert new element to the heap maintaining heap relation." do
-      @min_heap.insert(3).to_a.must_equal [3,5,4,8,11,9,6]
-      @min_heap2.insert(3).to_a.must_equal [3,5,4,8,11,9,6]
+    it '#insert should insert new element to the heap maintaining heap relation.' do
+      @min_heap.insert(3).to_a.must_equal [3, 5, 4, 8, 11, 9, 6]
+      @min_heap2.insert(3).to_a.must_equal [3, 5, 4, 8, 11, 9, 6]
     end
   end
 end

data/test/test_binary_tree.rb

@@ -1,57 +1,67 @@
 require 'help'
 
 describe BinaryTree do
-
   before do
-
     @bin_tree = BinaryTree.new
-    [2,5,8,9,11,12,14].each{|x| @bin_tree.insert(x)}
+    [2, 5, 8, 9, 11, 12, 14].each { |x| @bin_tree.insert(x) }
 
     @izo_tree = BinaryTree.new
-    [2,7,8,3,11,12,14].each{|x| @izo_tree.insert(x)}
+    [2, 7, 8, 3, 11, 12, 14].each { |x| @izo_tree.insert(x) }
 
     @small_tree = BinaryTree.new(2)
     @small_tree << BinaryTree.new(7)
     @small_tree << BinaryTree.new(8)
 
     @bin_walker = TreeWalker.new(@bin_tree)
+  end
 
+  it '#to_a should return tree converted to array.' do
+    @bin_tree.to_a.must_equal [2, 5, 8, 9, 11, 12, 14]
   end
-    
-  it "#to_a should return tree converted to array." do
-    @bin_tree.to_a.must_equal [2,5,8,9,11,12,14]
+
+  it '#parent should return node parent' do
+    @small_tree.parent.must_equal nil
+    @small_tree.right.parent.must_equal @small_tree
+    @bin_tree.right.parent.must_equal @bin_tree
   end
 
-  it "#height should return tree height." do
+  it '#sibblings should return node sibblings' do
+    r = @small_tree.right
+    l = @small_tree.left
+    r.sibblings.must_equal [l]
+    r = @bin_tree.right
+    l = @bin_tree.left
+    r.sibblings.must_equal [l]
+  end
+
+  it '#height should return tree height.' do
     @bin_tree.height.must_equal 3
   end
 
-  it "#width should return tree width." do
+  it '#width should return tree width.' do
     @bin_tree.width.must_equal 4
   end
 
-  it "#leaf_count should return number of tree leaves." do
+  it '#leaf_count should return number of tree leaves.' do
     @bin_tree.leaf_count.must_equal 4
   end
-  
-  it "#get_leaves should return list of tree leaves." do
-    @bin_tree.get_leaves.to_a.collect{ |e| e.data }.must_equal [9,11,12,14]
+
+  it '#get_leaves should return list of tree leaves.' do
+    @bin_tree.get_leaves.to_a.collect(&:data).must_equal [9, 11, 12, 14]
   end
 
-  it "#lowest_height should return node which lies closest to the root." do
-    assert @bin_tree.lowest_height.data.must_equal 9 
+  it '#lowest_height should return node which lies closest to the root.' do
+    assert @bin_tree.lowest_height.data.must_equal 9
   end
 
-  it "#mirror should mirror tree." do
+  it '#mirror should mirror tree.' do
     @bin_tree.mirror!
-    @bin_tree.to_a.must_equal [2,8,5,14,12,11,9]
+    @bin_tree.to_a.must_equal [2, 8, 5, 14, 12, 11, 9]
   end
 
-  it "#isometric should check if tree is isometric to antother." do
+  it '#isometric should check if tree is isometric to antother.' do
     assert @bin_tree.izometric?(@izo_tree)
     assert @izo_tree.izometric?(@bin_tree)
     refute @bin_tree.izometric?(@small_tree)
   end
-
 end
-

data/test/test_expandable_array.rb

@@ -1,26 +1,22 @@
 require 'help'
 
 describe ExpandableArray do
- 
-  describe "Zero Array" do
-    
+  describe 'Zero Array' do
     before do
-      @zero_arr = ExpandableArray.new(0,0)
+      @zero_arr = ExpandableArray.new(0, 0)
       @zero_arr[0] = 1
     end
 
-    it "access to element x should set all elements from array size to x to zero." do
+    it 'access to element x should set all elements from array size to x to zero.' do
       @zero_arr.size.must_equal 1
       @zero_arr[3].must_equal 0
       @zero_arr.size.must_equal 4
-      @zero_arr.must_equal [1,0,0,0]
+      @zero_arr.must_equal [1, 0, 0, 0]
     end
 
-    it "setting value on index x should set all elements from array size to x to zero." do
+    it 'setting value on index x should set all elements from array size to x to zero.' do
       @zero_arr[5] = 2
-      @zero_arr.must_equal [1,0,0,0,0,2]
+      @zero_arr.must_equal [1, 0, 0, 0, 0, 2]
     end
   end
 end
-
-

data/test/test_heap_store.rb

@@ -0,0 +1,34 @@
+require 'help'
+
+describe HeapStore do
+  before do
+    @store = HeapStore.new(1, 2, 3, 4, 5, 6, 7)
+  end
+
+  it '#size returns store size.' do
+    @store.size.must_equal 7
+  end
+
+  it 'indexing starts form one.' do
+    @store[1].must_equal 1
+  end
+
+  it '#first returns element on index 1.' do
+    @store.first.must_equal 1
+  end
+
+  it '#pop removes last element.' do
+    @store.pop.must_equal 7
+    @store.size.must_equal 6
+  end
+
+  it '#push adds element to store.' do
+    @store.push 11
+    @store.size.must_equal 8
+  end
+
+  it '#to_a returns array representation.' do
+    @store.to_a.must_equal [1, 2, 3, 4, 5, 6, 7]
+    @store.to_a.must_be_kind_of Array
+  end
+end

data/test/test_indexed_set.rb

@@ -0,0 +1,26 @@
+require 'help'
+
+describe 'IndexedSet' do
+  before do
+    @set = IndexedSet.new
+    @set.push(:first)
+  end
+
+  it '#push should add new element to set and return its index.' do
+    @set.push(:second).must_equal 1
+    @set.push(:first).must_equal 0
+  end
+
+  it '#index should return element index.' do
+    @set.index(:first).must_equal 0
+    @set.push(:second)
+    @set.index(:second).must_equal 1
+    @set.index(:non_exist).must_be_nil
+  end
+
+  it '#to_a should return array.' do
+    @set.push(:second)
+    @set.push(:third)
+    @set.to_a.must_equal [:first, :second, :third]
+  end
+end

data/test/test_list.rb

@@ -1,195 +1,312 @@
 require 'help'
 
 describe List do
-
   before do
-    @list = List.from_array([1,2,3,4])
-    @list2 = List.from_array([4,5,7])
+    @list = List.new(1, 2, 3, 4)
+    @list2 = List.new(4, 5, 7)
+    @empty_list = List.new
+    @numbers = List.new(*(1..10).to_a)
+    @even_numbers = List.new(2, 4, 6, 8, 10)
+  end
 
-    @numbers =  List.from_array((1..10).to_a)
-    @even_numbers = List.from_array([2,4,6,8,10])
+  describe 'Empty list' do
+    it '#empty? should be true' do
+      assert @empty_list.empty?
+    end
+
+    it '#append should add element to list' do
+      @empty_list.append(8)
+      @empty_list.to_a.must_equal [8]
+    end
+
+    it '#unshift should add element to list' do
+      @empty_list.unshift(8)
+      @empty_list.to_a.must_equal [8]
+    end
+
+    it '#shift raises exception' do
+      proc { @empty_list.shift }.must_raise ListError
+    end
   end
 
-  it "#from_array should transform array to list." do
-    @list.must_be_kind_of List  
+  it '#from_array should transform array to list.' do
+    @list.must_be_kind_of List
     @list.length.must_equal 4
   end
 
-  it "#length should return list size." do
+  it '#clone returns new list with identical values' do
+    cloned = @list.clone
+    cloned.must_be_kind_of List
+    cloned.to_a.must_equal [1, 2, 3, 4]
+    @list[0] = 9
+    @list.to_a.must_equal [9, 2, 3, 4]
+    cloned.to_a.must_equal [1, 2, 3, 4]
+  end
+
+  it '#clear resets lists' do
+    @list.clear
+    @list.must_be_kind_of List
+    @list.to_a.must_equal []
+    @list.size.must_equal 0
+  end
+
+  it '#length should return list size.' do
     @list.length.must_equal 4
     @list2.length.must_equal 3
   end
 
+  it '#get should return list element if element is on the list' do
+    x = @list.head.next
+    found = @list.get(x)
+    found.must_be_kind_of ListElement
+  end
+
+  it '#get! should raise error if element is not found on the list' do
+    x = @list2.head.next
+    proc { @list.get!(x) }.must_raise ListError
+  end
+
+  it 'at returns element on given index' do
+    @list.at(2).data.must_equal 3
+    @list2.at(2).data.must_equal 7
+    @list.at(42).must_equal nil
+    @list.at(-1).data.must_equal 4
+    @list.at(-2).data.must_equal 3
+    @list.at(-4).data.must_equal 1
+    @list.at(-42).must_equal nil
+  end
+
+  it '#[] returns element on given index' do
+    @list[2].data.must_equal 3
+    @list2[2].data.must_equal 7
+
+    @list[1..2].map(&:data).must_equal [2, 3]
+    @list[1..8].map(&:data).must_equal [2, 3, 4]
+    @list[1, 2].map(&:data).must_equal [2, 3]
+    @list[1, 3].map(&:data).must_equal [2, 3, 4]
+    @list[2, 8].map(&:data).must_equal [3, 4]
+  end
+
+  it '#[] changes element on given index' do
+    @list[2] = 11
+    @list[2].data.must_equal 11
+  end
+
+  it '#[] replaces elelment with elements on Array' do
+    @list[3] = [0, 0]
+    @list.to_a.must_equal [1, 2, 3, 0, 0]
+    @list.size.must_equal 5
+  end
+
+  it '#[] replaces elements when passed Array and count' do
+    @list[1, 2] = [0, 0]
+    @list.to_a.must_equal [1, 0, 0, 4]
+    @list.size.must_equal 4
+  end
+
+  it '#[] replaces element when passed Array and count on list tail' do
+    @list[1, 3] = [0, 0, 0]
+    @list.to_a.must_equal [1, 0, 0, 0]
+    @list.size.must_equal 4
+  end
+
+  it '#[] replaces element when passed Array and range' do
+    @list[1..2] = [0, 0]
+    @list.to_a.must_equal [1, 0, 0, 4]
+    @list.size.must_equal 4
+  end
+
+  it '#[] should raise error when count or range is invalid' do
+    proc { @list[1, 8] = [0, 0] }.must_raise ListError
+    proc { @list[1, -1] = [0, 0] }.must_raise ListError
+    proc { @list[1..-1] = [0, 0] }.must_raise ListError
+    proc { @list[1..90] = [0, 0] }.must_raise ListError
+    proc { @list[1, 4] = [0, 0] }.must_raise ListError
+  end
+
+  it 'replace element one with other' do
+    list = List.new(8, 9)
+    el = @list.at(2)
+    @list.replace(el, list)
+    @list.to_a.must_equal [1, 2, 8, 9, 4]
+    @list.size.must_equal 5
+    el = @list.at(0)
+    list = List.new(8, 9)
+    @list.replace(el, list)
+    @list.to_a.must_equal [8, 9, 2, 8, 9, 4]
+    @list.size.must_equal 6
+
+    list = List.new(8, 9)
+    el = @list.at(5)
+    @list.replace(el, list)
+    @list.to_a.must_equal [8, 9, 2, 8, 9, 8, 9]
+    @list.size.must_equal 7
+  end
+
+  it '#== returns true only if two lists are equal' do
+    @eq_list = List.new(1, 2, 3, 4)
+    @other_empty = List.new
+    assert @list == @eq_list
+    assert @eq_list == @list
+    refute @list == @empty_list
+    refute @list == @list2
+    assert @empty_list == @other_empty
+  end
+
+  it '#> returns true if first list is grater or longer than second' do
+    @smaller_list = List.new(1, 2, 2, 4)
+    assert @list > @smaller_list
+    @smaller_list2 = List.new(1, 2, 3)
+    assert @list > @smaller_list2
+  end
+
+  it '#< returns true if first list is smaller or shorter than second' do
+    @greater_list = List.new(1, 8, 3, 4)
+    assert @list < @greater_list
+    @greater_list2 = List.new(1, 2, 3, 4, 5)
+    assert @list < @greater_list2
+  end
 
-  it "#append should add element to the end of the list." do
+  it '#concat should join two lists into one' do
+    sum = @list.concat(@list2)
+    sum.to_a.must_equal [1, 2, 3, 4, 4, 5, 7]
+    assert sum == @list
+  end
+
+  it '#append should add element to the end of the list.' do
     x = 5
     @list.append(x)
     @list.length.must_equal 5
-    @list.last.must_be_same_as x 
+    @list.last.must_be_same_as x
   end
 
-  it "#prepend should add element at the beginning of the list." do
+  it '#unshift should add element at the beginning of the list.' do
     x = 0
-    @list.prepend(x)
+    @list.unshift(x)
     @list.length.must_equal 5
     @list.first.must_be_same_as x
   end
 
-  it "#remove should remove element from list." do
+  it '#remove should remove element from list.' do
     second = @list.head.next
+    third = second.next
+    forth = third.next
     @list.remove(second)
-    @list.to_a.must_equal [1,3,4]
+    @list.to_a.must_equal [1, 3, 4]
+    @list.remove(@list.head)
+    @list.to_a.must_equal [3, 4]
+    @list.remove(forth)
+    @list.to_a.must_equal [3]
+    @list.remove(third)
+    @list.to_a.must_equal []
   end
 
-  it "#insert_before should insert new element before another." do
-    second = @list.head.next
-    @list.insert_before(9,second)
-    @list.to_a.must_equal [1,9,2,3,4]
+  it '#pop should remove last list element.' do
+    last = @list.pop
+    last.must_equal 4
+    @list.last.must_equal 3
+    @list.to_a.must_equal [1, 2, 3]
+  end
 
-    @list.insert_before(8,@list.head)
-    @list.to_a.must_equal [8,1,9,2,3,4]
+  it '#insert_before should insert new element before another.' do
+    second = @list.head.next
+    @list.insert_before(9, second)
+    @list.to_a.must_equal [1, 9, 2, 3, 4]
 
-    @list.insert_before(7,@list.tail)
-    @list.to_a.must_equal [8,1,9,2,3,7,4]
+    @list.insert_before(8, @list.head)
+    @list.to_a.must_equal [8, 1, 9, 2, 3, 4]
 
-    proc { @list.insert_before(1,nil)}.must_raise  ListError
+    @list.insert_before(7, @list.tail)
+    @list.to_a.must_equal [8, 1, 9, 2, 3, 7, 4]
   end
 
-  it "#insert_after should insert new element after another." do
+  it '#insert_after should insert new element after another.' do
     second = @list.head.next
-    @list.insert_after(9,second)
-    @list.to_a.must_equal [1,2,9,3,4]
+    @list.insert_after(9, second)
+    @list.to_a.must_equal [1, 2, 9, 3, 4]
 
     tail = @list.tail
-    @list.insert_after(11,tail)
-    @list.to_a.must_equal [1,2,9,3,4,11]
+    @list.insert_after(11, tail)
+    @list.to_a.must_equal [1, 2, 9, 3, 4, 11]
   end
 
-
-  it "#head should point to first element of the list." do
-    @list.head.must_be_kind_of ListElement 
+  it '#head should point to first element of the list.' do
+    @list.head.must_be_kind_of ListElement
     @list2.head.must_be_kind_of ListElement
     @list.head.data.must_equal 1
     @list2.head.data.must_equal 4
   end
 
-  it "#tail sould point to last element of the list" do
-    @list.tail.must_be_kind_of ListElement 
+  it '#tail sould point to last element of the list' do
+    @list.tail.must_be_kind_of ListElement
     @list2.tail.must_be_kind_of ListElement
-    @list.tail.next.must_be_nil    
+    @list.tail.next.must_be_nil
     @list2.tail.next.must_be_nil
 
     @list.tail.data.must_equal 4
     @list2.tail.data.must_equal 7
   end
 
-  it "#first should return value of the first list element." do
+  it '#first should return value of the first list element.' do
     @list.first.must_equal 1
     @list2.first.must_equal 4
   end
 
-
-  it "#last should return value of the last list element." do
+  it '#last should return value of the last list element.' do
     @list.last.must_equal 4
     @list2.last.must_equal 7
   end
 
-  it "#zip? should check if two list are joined." do
+  it '#zip? should check if two list are joined.' do
     refute @list.zip?(@list2)
   end
 
-  it "#reverse! should reverse list" do
-    @list.reverse!.to_a.must_equal [4,3,2,1]
-    @list.reverse!.to_a.must_equal [1,2,3,4]
+  it '#reverse! should reverse list' do
+    @list.reverse!.to_a.must_equal [4, 3, 2, 1]
+    @list.reverse!.to_a.must_equal [1, 2, 3, 4]
     @list.reverse!.length.must_equal 4
   end
 
-  it "#merge should merge two list into one." do
-    @list2.merge(@list).to_a.must_equal [1,2,3,4,4,5,7]
-  end
-
-  it "#merge should be symetric operation." do
-    @list.merge(@list2).to_a.must_equal [1,2,3,4,4,5,7]
+  it '#looped? should check if list has cycle.' do
+    refute @list2.looped?
+    refute @list.looped?
   end
 
-
-  it "#orderize should order elements by evaluating block." do
-    not_sorted_list = List.from_array([3,-1,0,-8,2,0,1])
-    not_sorted_list.orderize{|elem| elem <=> 0}.to_a.must_equal [-1,-8,0,0,3,2,1]
+  it '#reverse_each should iterate list in reverse order.' do
+    arr = []
+    @list.reverse_each { |e| arr.push e.data }
+    arr.must_equal [4, 3, 2, 1]
   end
 
-  it "#remove! should remove all elements that occur on the other list." do
-    @list.remove!(@list2).to_a.must_equal [1,2,3]
-    @numbers.remove!(@even_numbers).to_a.must_equal [1,3,5,7,9]
-  end
-  
-  it "#remove! should remove all elements that occur on the other list#2." do
-    @list2.remove!(@list).to_a.must_equal [5,7]
+  it '#each_with_index should iterate list.' do
+    h = {}
+    @list.each_with_index { |e, i| h[i] = e.data }
+    h.must_equal(0 => 1, 1 => 2, 2 => 3, 3 => 4)
   end
 
-  it "#looped? should check if list has cycle." do
-    refute @list2.looped?
-    refute @list.looped?
+  it '#take returns frist n elements form list' do
+    @list.take(2).map(&:data).must_equal [1, 2]
   end
 
-  it "#each_with_index should iterate list." do
-    h = {}
-    @list.each_with_index{|e,i| h[i] = e.data}
-    h.must_equal({0 => 1, 1 => 2, 2 => 3, 3 => 4})
+  it '#to_s should print list in human friendly format.' do
+    @list.to_s.must_equal '1=2=3=4'
   end
 
-  it "should include Enumerable methods." do
-    @list.map{ |e| e.data }.must_equal [1,2,3,4]
-    @list.inject(0){ |mem, var| mem = mem + var.data }.must_equal 10
-    @list.find { |e| e.data == 1.0  }.data.must_equal 1
+  it 'should include Enumerable methods.' do
+    @list.map(&:data).must_equal [1, 2, 3, 4]
+    @list.inject(0) { |a, e| a + e.data }.must_equal 10
+    @list.find { |e| e.data == 1.0 }.data.must_equal 1
   end
 
-
-  describe "Zipped list" do
-
+  describe 'Zipped list' do
     before do
       last = @list.tail
-      @zipped = List.from_array([1,2])
+      @zipped = List.new(1, 2)
       @zipped.tail = last
     end
 
-    it "#zip? should return true" do
+    it '#zip? should return true' do
       assert @list.zip?(@zipped)
     end
-
-  end
-
-  if ENV['BENCH']
-    describe "performance" do
-    
-      before do
-        @arr = (1..10_000).to_a.sort_by{rand}
-
-        10000.times do |n|
-          @list.append 4
-        end
-      end
-
-
-      bench_performance_constant "#append should be const operation.", 0.999 do |n|
-        n.times do
-          @list.append 3
-        end
-      end
-
-      bench_performance_constant "#prepend should be const operation.", 0.999 do |n|
-        n.times do
-          @list.prepend 3
-        end
-      end
-
-      bench_performance_linear "#reverse! should be linear operation.", 0.999 do |n|
-        list =List.from_array(@arr[0..n])
-        list.reverse!
-      end
-
-    end
   end
-
 end
-