ds 0.0.4 → 0.0.6

data/test/test_stack.rb

@@ -1,85 +1,81 @@
 require 'help'
 
-describe  Stack do
-
+describe Stack do
   before do
-    @stack = Stack.new
-    @stack.push :first
-    @stack.push :second
+    @stack = Stack.new(:first, :second)
   end
 
-  describe "Empty stack" do
-
+  describe 'Empty stack' do
     before do
       @empty_stack = Stack.new
     end
 
-    it "should be empty." do
+    it 'should be empty.' do
       assert @empty_stack.empty?
       @empty_stack.size.must_equal 0
     end
 
-    it "#pop should retrun nil." do
+    it '#pop should retrun nil.' do
       @empty_stack.pop.must_be_nil
     end
 
-    it "#peek should return nil." do
-      @empty_stack.peek.must_be_nil 
+    it '#peek should return nil.' do
+      @empty_stack.peek.must_be_nil
     end
 
-    it "#push should change stack size." do
+    it '#push should change stack size.' do
       @empty_stack.push :first
       refute @empty_stack.empty?
       @empty_stack.size.must_equal 1
     end
   end
 
+  describe 'Not empty stack implemented as List' do
+    before do
+      @stack = Stack.create(:first, :second)
+    end
 
-  describe "Not empty stack" do
-
-    it "should not be empty." do
+    it 'should not be empty.' do
       refute @stack.empty?
     end
 
-    it "#peek should return element from the top of the stack." do
+    it '#peek should return element from the top of the stack.' do
       @stack.peek.must_equal :second
     end
 
-    it "#pop should remove element form the top of the stack." do
-      @stack.pop
+    it '#pop should remove element form the top of the stack.' do
+      last = @stack.pop
+      last.must_equal :second
       @stack.size.must_equal 1
       @stack.peek.must_equal :first
     end
 
-    it "#push should insert element to the top of the stack." do
+    it '#push should insert element to the top of the stack.' do
       @stack.push(:third)
       @stack.peek.must_equal :third
       @stack.size.must_equal 3
     end
+  end
 
-    if ENV['BENCH']
-      describe "performance" do
-
-        before do
-          100000.times do |n|
-            @stack.push 4
-          end
-        end
+  describe 'Not empty stack implemented as Array' do
+    it 'should not be empty.' do
+      refute @stack.empty?
+    end
 
-        bench_performance_constant "#pop should be const operation.", 0.999 do |n|
-          n.times do
-            @stack.pop
-          end
-        end
+    it '#peek should return element from the top of the stack.' do
+      @stack.peek.must_equal :second
+    end
 
-        bench_performance_constant "#push should be const operation.", 0.999 do |n|
-          n.times do
-            @stack.push 3
-          end
-        end
+    it '#pop should remove element form the top of the stack.' do
+      @stack.pop
+      @stack.size.must_equal 1
+      @stack.peek.must_equal :first
+    end
 
-      end
+    it '#push should insert element to the top of the stack.' do
+      @stack.push(:third)
+      @stack.peek.must_equal :third
+      @stack.size.must_equal 3
     end
   end
 end
-

data/test/test_tree.rb

@@ -1,71 +1,84 @@
 require 'help'
 
 describe Tree do
-
   before do
     t = Tree.new(2)
-    c1 = t << 5
-    c2 = t << 8
-    t << 9
+    @child1 = t << 5
+    @child2 = t << 8
+    @child3 = t << 9
 
-    c1 << 4
-    c1 << 10
-    c2 << 3
+    @grand1 = @child1 << 4
+    @grand2 = @child1 << 10
+    @grand3 = @child2 << 3
 
     @tree = t
   end
-    
-  it "#to_a should return tree converted to array." do
-    @tree.to_a.must_equal [2,5,8,9,4,10,3]
+
+  it '#to_a should return tree converted to array.' do
+    @tree.to_a.must_equal [2, 5, 8, 9, 4, 10, 3]
   end
 
-  it "<< should add new subtree to tree." do
+  it '<< should add new subtree to tree.' do
     subtree = @tree << 7
     subtree.must_be_kind_of Tree
     @tree.children.size.must_equal 4
   end
 
-  it "#leaf? should check if node is a leaf." do
+  it '#parent should return node parent' do
+    @child1.parent.must_equal @tree
+    @child2.parent.must_equal @tree
+    @grand1.parent.must_equal @child1
+    @grand3.parent.must_equal @child2
+  end
+
+  it '#sibblings should return node sibblings' do
+    @child1.sibblings.must_equal [@child2, @child3]
+    @child2.sibblings.must_equal [@child1, @child3]
+    @grand1.sibblings.must_equal [@grand2]
+    @grand3.sibblings.must_equal []
+  end
+
+  it '#leaf? should check if node is a leaf.' do
     refute @tree.leaf?
     assert @tree.children.last.leaf?
   end
 
-  it "#get_leaves should return list of tree leaves." do
+  it '#children returns node child nodes.' do
+    @tree.children.map(&:data).must_equal([5, 8, 9])
+  end
+
+  it '#get_leaves should return list of tree leaves.' do
     leaves = @tree.get_leaves
     leaves.must_be_kind_of List
-    leaves.to_a.collect{ |e| e.data }.must_equal [4,10,3,9]
+    leaves.to_a.collect(&:data).must_equal [4, 10, 3, 9]
   end
 
-  it "#leaf_count should return number of tree leaves." do
+  it '#leaf_count should return number of tree leaves.' do
     @tree.leaf_count.must_equal 4
   end
 
-  it "#levels should return number of nodes on each tree level." do
-    @tree.levels.must_equal 1 => 1, 2 => 3, 3 => 3  
+  it '#levels should return number of nodes on each tree level.' do
+    @tree.levels.must_equal 1 => 1, 2 => 3, 3 => 3
   end
 
-
-  it "#height should return tree height." do
+  it '#height should return tree height.' do
     @tree.height.must_equal 3
   end
 
-  it "Tree.h should return subtree height." do
+  it 'Tree.h should return subtree height.' do
     Tree.h(@tree.children.last).must_equal 1
   end
 
-  it "#width should return tree width." do
+  it '#width should return tree width.' do
     @tree.width.must_equal 3
   end
 
-    
-   it "#lowest_height should return node which lies closest to the root." do
-    @tree.lowest_height.data.must_equal 9 
+  it '#lowest_height should return node which lies closest to the root.' do
+    @tree.lowest_height.data.must_equal 9
   end
 
-  it "#mirror! should mirror tree." do
-     @tree.mirror!
-     @tree.to_a.must_equal [2,9,8,5,3,10,4]
+  it '#mirror! should mirror tree.' do
+    @tree.mirror!
+    @tree.to_a.must_equal [2, 9, 8, 5, 3, 10, 4]
   end
-
 end
-

data/test/test_tree_walker.rb

@@ -1,91 +1,66 @@
-require "help"
+require 'help'
 
 describe TreeWalker do
-
-  describe "traversing Tree" do
-    
+  describe 'traversing Tree' do
     before do
-     
       t = Tree.new(2)
       c1 = t << 5
       c2 = t << 8
       t << 9
-
       c1 << 4
       c1 << 10
       c2 << 3
 
       @tree = t
-
-      @walker =  TreeWalker.new(@tree)
+      @walker = TreeWalker.new(@tree)
     end
 
-
-    it "#traverse without arguments should traverse tree in BFS order." do
-      @walker.traverse.must_equal [2,5,8,9,4,10,3]
+    it '#traverse without arguments should traverse tree in BFS order.' do
+      @walker.traverse.must_equal [2, 5, 8, 9, 4, 10, 3]
     end
 
-    it "should traverse in BFS order." do
-      @walker.traverse(:bfs).must_equal [2,5,8,9,4,10,3]
-    end
-
-    it "#summarize should transform tree." do
-      @walker.summarize(:topdown).to_a.must_equal [2,7,10,11,11,17,13]
+    it 'should traverse in BFS order.' do
+      @walker.traverse(:bfs).must_equal [2, 5, 8, 9, 4, 10, 3]
     end
   end
 
-  describe "traversing Binary Tree" do
-    
+  describe 'traversing Binary Tree' do
     before do
       @bin_tree = BinaryTree.new
-      [2,5,8,9,11,12,14].each{|x| @bin_tree.insert(x)}
-      @bin_walker =  TreeWalker.new(@bin_tree)
+      [2, 5, 8, 9, 11, 12, 14].each { |x| @bin_tree.insert(x) }
+      @bin_walker = TreeWalker.new(@bin_tree)
     end
 
-    it "#traverse without arguments should traverse tree in BFS order." do
-      @bin_walker.traverse.must_equal [2,5,8,9,11,12,14]
+    it '#traverse without arguments should traverse tree in BFS order.' do
+      @bin_walker.traverse.must_equal [2, 5, 8, 9, 11, 12, 14]
     end
 
-    it "should traverse in BFS order." do
-      @bin_walker.traverse(:bfs).must_equal [2,5,8,9,11,12,14]
-
+    it 'should traverse in BFS order.' do
+      @bin_walker.traverse(:bfs).must_equal [2, 5, 8, 9, 11, 12, 14]
     end
 
-    it "should traverse in preorder." do
-      @bin_walker.traverse(:preorder).must_equal  [2,5,9,11,8,12,14]
+    it 'should traverse in preorder.' do
+      @bin_walker.traverse(:preorder).must_equal [2, 5, 9, 11, 8, 12, 14]
 
       arr = []
-      @bin_walker.traverse(:preorder){|t| arr << t.data}
-      arr.must_equal  [2,5,9,11,8,12,14]
+      @bin_walker.traverse(:preorder) { |t| arr << t.data }
+      arr.must_equal [2, 5, 9, 11, 8, 12, 14]
     end
 
-
-    it "should traverse in postorder." do
-      @bin_walker.traverse(:postorder).must_equal  [9,11,5,12,14,8,2]
+    it 'should traverse in postorder.' do
+      @bin_walker.traverse(:postorder).must_equal [9, 11, 5, 12, 14, 8, 2]
 
       arr = []
-      @bin_walker.traverse(:postorder){|t| arr << t.data}
-      arr.must_equal  [9,11,5,12,14,8,2]
+      @bin_walker.traverse(:postorder) { |t| arr << t.data }
+      arr.must_equal [9, 11, 5, 12, 14, 8, 2]
     end
 
-    it "should traverse in inorder." do
-      @bin_walker.traverse(:inorder).must_equal [9,5,11,2,12,8,14]
-      
-      arr = []
-      @bin_walker.traverse(:inorder){|t| arr << t.data}
-      arr.must_equal   [9,5,11,2,12,8,14]
-    end
-
-    it "#summarize should transform tree." do
-      @bin_walker.summarize(:bottomup).to_a.must_equal [61,25,34,9,11,12,14]
-    end
+    it 'should traverse in inorder.' do
+      @bin_walker.traverse(:inorder).must_equal [9, 5, 11, 2, 12, 8, 14]
 
-    it "recalculate! should change values of tree nodes." do
-      @bin_walker.summarize(:inorder).to_a.must_equal [2,5,10,9,16,14,24]
+      arr = []
+      @bin_walker.traverse(:inorder) { |t| arr << t.data }
+      arr.must_equal [9, 5, 11, 2, 12, 8, 14]
     end
-
   end
 end
-
-
-

data/test/test_tri_matrix.rb

@@ -1,22 +1,17 @@
 require 'help'
 
 describe TriMatrix do
-
   before do
     @tri_matrix = TriMatrix.new
-    @tri_matrix[0,1] = true
-    @tri_matrix[0,2] = true
+    @tri_matrix[0, 1] = true
+    @tri_matrix[0, 2] = true
   end
 
-
-  it "[x,y] should be same as [y,x]" do
-    @tri_matrix[0,1].must_be_same_as @tri_matrix[1,0]
+  it '[x,y] should be same as [y,x]' do
+    @tri_matrix[0, 1].must_be_same_as @tri_matrix[1, 0]
   end
 
-  it "should store elements in array" do
-    @tri_matrix.to_a.must_equal [0,true,0,true]
+  it 'should store elements in array' do
+    @tri_matrix.to_a.must_equal [0, true, 0, true]
   end
-
 end
-
-

data/test/test_trie.rb

@@ -1,32 +1,74 @@
 require 'help'
 
 describe Trie do
-
   before do
     @trie = Trie.new
     @dict = Trie.new
-    @dict.insert("hello")
+    @dict.insert('hello')
+  end
+
+  it '#insert should add new string to trie.' do
+    @trie.insert('thing')
+    assert @trie.find('thing')
+
+    @trie.insert('think')
+    assert @trie.find('thing')
+
+    @trie.insert('math')
+    assert @trie.find('math')
   end
 
-  it "#insert should add new string to trie." do
-    @trie.insert("thing");
-    assert @trie.find("thing")
-    
-    @trie.insert("think")
-    assert @trie.find("thing")
-    
-    @trie.insert("math")
-    assert @trie.find("math")
-    
+  it 'has hash like accessors' do
+    @trie['thing'] = 'one'
+    assert_equal @trie['thing'], 'one'
   end
 
-  it "should not find not added word." do
-    @dict.find("blah").must_be_nil
+  it '#find should not find not added word.' do
+    @dict.find('blah').must_be_nil
   end
 
-  it "should raise error if character is not in trie alphabet." do
-    proc {@dict.find("m%$r")}.must_raise ArgumentError
-    proc {@dict.insert("m%$r")}.must_raise ArgumentError
+  it '#delete removes word from tree' do
+    @dict.insert('he')
+    @dict.insert('help')
+    @dict.delete('hello')
+    refute @dict.find('hello')
+    refute @dict.find('hellp')
+    refute @dict.find('hel')
+    assert @dict.find('he')
+    assert @dict.find('help')
   end
 
+  it '#each iterates through trie' do
+    @dict.insert('he')
+    @dict.insert('help')
+    assert_equal @dict.map { |n| n }, %w(he hello help)
+    assert_equal @dict.map { |k, v| [k, v] }, [['he', true], ['hello', true], ['help', true]]
+  end
+
+  it '#with_prefix returns words with matching prefix' do
+    @dict.insert('help')
+    @dict.insert('him')
+    assert_equal @dict.with_prefix('he'), %w(hello help)
+
+    arr = []
+    @dict.with_prefix('he') { |n| arr << n }
+    assert_equal arr, %w(hello help)
+
+    assert_equal @dict.with_prefix('yeti'), []
+  end
+
+  it '#to_h converts tree to Hash' do
+    @dict.to_h.must_equal 'hello' => true
+  end
+
+  it '#alphabet= sets Trie alphabet' do
+    @trie = Trie.new
+    @trie.alphabet = %w(a b c d)
+    proc { @trie.insert('thing') }.must_raise ArgumentError
+  end
+
+  it 'should raise error if character is not in trie alphabet.' do
+    proc { @dict.find('m%$r') }.must_raise ArgumentError
+    proc { @dict.insert('m%$r') }.must_raise ArgumentError
+  end
 end