ds 0.0.1

data/test/test_list_element.rb

@@ -0,0 +1,56 @@
+require 'help'
+
+describe "List Element" do
+
+  before do
+    @empty_el = ListElement.new
+    @el = ListElement.new(1)
+  end
+
+  describe "not initialized" do
+
+    before do
+      @empty_el = ListElement.new
+    end
+
+    it "should have no elements." do
+      @empty_el.data.must_be_nil
+    end
+
+    it "should be tail." do
+      assert @empty_el.tail?
+    end
+
+    it "#append should link element with another." do
+      @empty_el.append(2).must_be_instance_of ListElement
+      @empty_el.next.wont_be_nil
+      @empty_el.next.must_be_instance_of ListElement
+      @empty_el.next.data.must_equal 2
+    end
+  end
+
+
+  describe "initialized" do
+
+    before do
+      @el = ListElement.new(1)
+    end
+
+    it "should have one element" do
+      @el.data.must_equal 1
+    end
+
+    it "should be tail." do
+      assert @el.tail?
+    end
+
+    it "#append should link element with another." do
+      @el.append(2).must_be_instance_of ListElement
+      @el.next.wont_be_nil
+      @el.next.must_be_instance_of ListElement
+      @el.next.data.must_equal 2
+    end
+
+  end
+
+end

data/test/test_queue.rb

@@ -0,0 +1,110 @@
+require 'help'
+
+describe Queue do
+
+  describe "Empty Queue" do
+
+    before do
+      @empty_queue = Queue.new
+    end
+
+    it "should be empty." do
+      assert @empty_queue.empty?
+    end
+
+    it "should have zero elements." do
+      @empty_queue.length.must_equal 0
+    end
+  end
+
+
+  describe "Not empty queue" do
+
+    before do
+      @queue = Queue.new
+      @queue.enqueue 1
+      @queue.enqueue 2
+
+      @queue2 = Queue.create
+      @queue2.enqueue 1
+      @queue2.enqueue 2
+    end
+
+    it "should not be empty." do
+      refute @queue.empty?
+      @queue.length.must_equal 2
+
+      refute @queue2.empty?
+      @queue2.length.must_equal 2
+    end
+
+    it "#peek should return element from forehead of queue." do
+      @queue.peek.must_equal 1
+      @queue2.peek.must_equal 1
+    end
+
+
+    it "#enqueue and #push should add element to queue." do
+      @queue.enqueue 3
+      @queue.length.must_equal 3
+
+      @queue.push 3
+      @queue.length.must_equal 4
+
+      @queue2.enqueue 3
+      @queue2.length.must_equal 3
+
+      @queue2.push 3
+      @queue2.length.must_equal 4
+    end
+
+    it "#dequeue and #shift should remove element from queue." do
+      x = @queue.dequeue
+      @queue.length.must_equal 1
+      x.must_equal 1
+
+      x = @queue2.dequeue
+      @queue2.length.must_equal 1
+      x.must_equal 1
+    end
+
+
+    if ENV['BENCH']
+      describe "performance" do
+
+        before do
+          100000.times do |n|
+            @queue.push 4
+            @queue2.push 4
+          end
+        end
+
+
+        bench_performance_constant "#shift(array implementation) should be const operation.", 0.999 do |n|
+          n.times do
+            @queue.shift
+          end
+        end
+
+        bench_performance_constant "#shift(list implementation) should be const operation.", 0.999 do |n|
+          n.times do
+            @queue2.shift
+          end
+        end
+
+        bench_performance_constant "#push(array implementation) should be const operation.", 0.999 do |n|
+          n.times do
+            @queue.push 2
+          end
+        end
+
+        bench_performance_constant "#push(list implementation) should be const operation.", 0.999 do |n|
+          n.times do
+            @queue2.push 2
+          end
+        end
+      end
+
+    end
+  end
+end

data/test/test_ring.rb

@@ -0,0 +1,28 @@
+require 'help'
+
+describe "Cyclic List" do
+
+  before do
+    @ring = Ring.from_array([1,2,3,4,5,6,7])
+  end
+
+  it "#from_array should create ring from array." do
+    @ring.must_be_kind_of List
+    @ring.must_be_instance_of Ring
+    @ring.length.must_equal 7
+  end
+
+  it "should be looped." do
+    assert @ring.looped?
+  end
+
+  it "should has cycle." do
+    @ring.cycle_size.must_equal 7
+  end
+
+  it "#eliminate_by should remove elements by given offset until there is one element." do
+    @ring.eliminate_by(3).must_equal 4
+    @ring.eliminate_by(2).must_equal 1
+  end
+end
+

data/test/test_stack.rb

@@ -0,0 +1,87 @@
+require 'help'
+
+describe  Stack do
+
+  before do
+    @stack = Stack.new
+    @stack.push :first
+    @stack.push :second
+  end
+
+  describe "Empty stack" do
+
+    before do
+      @empty_stack = Stack.new
+    end
+
+    it "should be empty." do
+      assert @empty_stack.empty?
+      @empty_stack.size.must_equal 0
+    end
+
+    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 
+    end
+
+    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" do
+
+    it "should not be empty." do
+      refute @stack.empty?
+    end
+
+    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
+      @stack.size.must_equal 1
+      @stack.peek.must_equal :first
+    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
+
+    if ENV['BENCH']
+      describe "performance" do
+
+        before do
+          100000.times do |n|
+            @stack.push 4
+          end
+        end
+
+
+        bench_performance_constant "#pop should be const operation.", 0.999 do |n|
+          n.times do
+            @stack.pop
+          end
+        end
+
+        bench_performance_constant "#push should be const operation.", 0.999 do |n|
+          n.times do
+            @stack.push 3
+          end
+        end
+
+      end
+    end
+
+  end
+end
+

data/test/test_tree.rb

@@ -0,0 +1,48 @@
+require 'help'
+
+describe Tree do
+
+  before do
+    t = Tree.new(2)
+    c1 = t << 5
+    c2 = t << 8
+    t << 9
+
+    c1 << 4
+    c1 << 10
+    c2 << 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]
+  end
+
+  it "#height should return tree height." do
+    @tree.height.must_equal 3
+  end
+
+  it "#width should return tree width." do
+    @tree.width.must_equal 3
+  end
+
+  it "#leaf_count should return number of tree leaves." do
+    @tree.leaf_count.must_equal 4
+  end
+  
+  it "#get_leaves should return list of tree leaves." do
+    @tree.get_leaves.to_a.collect{ |e| e.data }.must_equal [4,10,3,9]
+  end
+
+  it "#lowest_height should return node which lies closest to the root." do
+    @tree.lowest_height.must_equal 9 
+  end
+
+  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

@@ -0,0 +1,69 @@
+require "help"
+
+describe TreeWalker 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)
+    end
+
+
+    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]
+    end
+  end
+
+  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)
+    end
+
+    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]
+    end
+
+    it "should traverse in postorder." do
+      @bin_walker.traverse(:postorder).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]
+    end
+
+    it "#summarize should transform tree." do
+      @bin_walker.summarize(:bottomup).to_a.must_equal [61,25,34,9,11,12,14]
+    end
+
+  end
+end
+
+
+

data/test/test_tri_matrix.rb

@@ -0,0 +1,22 @@
+require 'help'
+
+describe TriMatrix do
+
+  before do
+    @tri_matrix = TriMatrix.new
+    @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]
+  end
+
+  it "should store elements in array" do
+    @tri_matrix.to_a.must_equal [0,true,0,true]
+  end
+
+end
+
+

metadata

@@ -0,0 +1,184 @@
+--- !ruby/object:Gem::Specification 
+name: ds
+version: !ruby/object:Gem::Version 
+  hash: 29
+  prerelease: 
+  segments: 
+  - 0
+  - 0
+  - 1
+  version: 0.0.1
+platform: ruby
+authors: 
+- knife
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2011-09-07 00:00:00 Z
+dependencies: []
+
+description: Data structures (lists,stacks, trees, heaps, graphs..) in pure Ruby.
+email: 
+- satre@o2.pl
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- .gitignore
+- Gemfile
+- Rakefile
+- doc/Array.html
+- doc/DS.html
+- doc/DS/Array2D.html
+- doc/DS/BinaryHeap.html
+- doc/DS/BinarySearchTree.html
+- doc/DS/BinaryTree.html
+- doc/DS/CompleteBinaryTree.html
+- doc/DS/CyclicList.html
+- doc/DS/Digraph.html
+- doc/DS/Edge.html
+- doc/DS/ExpandableArray.html
+- doc/DS/Graph.html
+- doc/DS/GraphAsList.html
+- doc/DS/GraphAsMatrix.html
+- doc/DS/GraphAsTriMatrix.html
+- doc/DS/List.html
+- doc/DS/ListElement.html
+- doc/DS/Queue.html
+- doc/DS/Ring.html
+- doc/DS/Stack.html
+- doc/DS/Tree.html
+- doc/DS/TreeWalker.html
+- doc/DS/TriMatrix.html
+- doc/created.rid
+- doc/ds/graphs/digraph_rb.html
+- doc/ds/graphs/edge_rb.html
+- doc/ds/graphs/graph_as_list_rb.html
+- doc/ds/graphs/graph_as_matrix_rb.html
+- doc/ds/graphs/graph_as_tri_matrix_rb.html
+- doc/ds/graphs/graph_rb.html
+- doc/ds/lists/cyclic_list_rb.html
+- doc/ds/lists/list_element_rb.html
+- doc/ds/lists/list_rb.html
+- doc/ds/lists/ring_rb.html
+- doc/ds/matrixes/array_2d_rb.html
+- doc/ds/matrixes/expandable_array_rb.html
+- doc/ds/matrixes/tri_matrix_rb.html
+- doc/ds/queues/queue_rb.html
+- doc/ds/stacks/stack_rb.html
+- doc/ds/trees/binary_heap_rb.html
+- doc/ds/trees/binary_search_tree_rb.html
+- doc/ds/trees/binary_tree_rb.html
+- doc/ds/trees/complete_binary_tree_rb.html
+- doc/ds/trees/tree_rb.html
+- doc/ds/trees/tree_walker_rb.html
+- doc/ds/version_rb.html
+- doc/ds_rb.html
+- doc/ext/ext_rb.html
+- doc/images/brick.png
+- doc/images/brick_link.png
+- doc/images/bug.png
+- doc/images/bullet_black.png
+- doc/images/bullet_toggle_minus.png
+- doc/images/bullet_toggle_plus.png
+- doc/images/date.png
+- doc/images/find.png
+- doc/images/loadingAnimation.gif
+- doc/images/macFFBgHack.png
+- doc/images/package.png
+- doc/images/page_green.png
+- doc/images/page_white_text.png
+- doc/images/page_white_width.png
+- doc/images/plugin.png
+- doc/images/ruby.png
+- doc/images/tag_green.png
+- doc/images/wrench.png
+- doc/images/wrench_orange.png
+- doc/images/zoom.png
+- doc/index.html
+- doc/js/darkfish.js
+- doc/js/jquery.js
+- doc/js/quicksearch.js
+- doc/js/thickbox-compressed.js
+- doc/rdoc.css
+- ds.gemspec
+- lib/ds.rb
+- lib/ds/graphs/digraph.rb
+- lib/ds/graphs/edge.rb
+- lib/ds/graphs/graph.rb
+- lib/ds/graphs/graph_as_list.rb
+- lib/ds/graphs/graph_as_matrix.rb
+- lib/ds/graphs/graph_as_tri_matrix.rb
+- lib/ds/lists/cyclic_list.rb
+- lib/ds/lists/list.rb
+- lib/ds/lists/list_element.rb
+- lib/ds/lists/ring.rb
+- lib/ds/matrixes/array_2d.rb
+- lib/ds/matrixes/expandable_array.rb
+- lib/ds/matrixes/tri_matrix.rb
+- lib/ds/queues/queue.rb
+- lib/ds/stacks/stack.rb
+- lib/ds/trees/binary_heap.rb
+- lib/ds/trees/binary_search_tree.rb
+- lib/ds/trees/binary_tree.rb
+- lib/ds/trees/complete_binary_tree.rb
+- lib/ds/trees/tree.rb
+- lib/ds/trees/tree_walker.rb
+- lib/ds/version.rb
+- lib/ext/ext.rb
+- test/help.rb
+- test/test_array2d.rb
+- test/test_binary_heap.rb
+- test/test_binary_search_tree.rb
+- test/test_binary_tree.rb
+- test/test_complete_binary_tree.rb
+- test/test_digraph.rb
+- test/test_expandable_array.rb
+- test/test_graph.rb
+- test/test_list.rb
+- test/test_list_element.rb
+- test/test_queue.rb
+- test/test_ring.rb
+- test/test_stack.rb
+- test/test_tree.rb
+- test/test_tree_walker.rb
+- test/test_tri_matrix.rb
+homepage: ""
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: ds
+rubygems_version: 1.8.6
+signing_key: 
+specification_version: 3
+summary: Some common data structures.
+test_files: []
+