algorithms 0.0.1 → 0.1.0

data/spec/queue_spec.rb

@@ -1,53 +1,61 @@
-require 'lib/algorithms'
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
 
-describe Containers::Queue do
+describe "empty queue" do
   before(:each) do
     @queue = Containers::Queue.new
   end
-  
-  describe "(empty)" do
-    it "should return nil when sent #get" do
-      @queue.get.should eql(nil)
-    end
 
-    it "should return a size of 1 when sent #put" do
-      @queue.put(1).size.should eql(1)
-    end
-    
-    it "should return nil when peeked" do
-      @queue.peek.should eql(nil)
-    end
-    
-    it "should return empty?" do
-      @queue.empty?.should eql(true)
-    end
+
+  it "should return nil when sent #pop" do
+    @queue.pop.should be_nil
   end
-  
-  describe "(non-empty)" do
-    before(:each) do
-      @queue.put(10)
-      @queue.put("10")
-    end
-    
-    it "should return first put object" do
-      @queue.get.should eql(10)
-    end
-    
-    it "should return the size" do
-      @queue.size.should eql(2)
-    end
-    
-    it "should not return empty?" do
-      @queue.empty?.should eql(false)
-    end
-    
-    it "should return nil after all gets" do
-      @queue.get
-      @queue.get
-      @queue.get.should eql(nil)
-      @queue.peek.should eql(nil)
+
+  it "should return a size of 1 when sent #push" do
+    @queue.push(1)
+    @queue.size.should eql(1)
+  end
+
+  it "should return nil when sent #next" do
+    @queue.next.should be_nil
+  end
+
+  it "should return empty?" do
+    @queue.empty?.should be_true
+  end
+end
+
+describe "non-empty queue" do
+  before(:each) do
+    @queue = Containers::Queue.new
+    @queue.push(10)
+    @queue.push("10")
+  end
+
+  it "should return first pushed object" do
+    @queue.pop.should eql(10)
+  end
+
+  it "should return the size" do
+    @queue.size.should eql(2)
+  end
+
+  it "should not return empty?" do
+    @queue.empty?.should be_false
+  end
+
+  it "should iterate in FIFO order" do
+    arr = []
+    @queue.each { |obj| arr << obj }
+    arr.should eql([10, "10"])
+  end
+
+  it "should return nil after all gets" do
+    2.times do
+      @queue.pop
     end
-    
+    @queue.pop.should be_nil
+    @queue.next.should be_nil
   end
-  
-end
+
+end

data/spec/rb_tree_map_spec.rb

@@ -0,0 +1,123 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+
+describe "empty rbtree", :shared => true do
+  it "should let you push stuff in" do
+    100.times { |x| @tree[x] = x }
+    @tree.size.should eql(100)
+  end
+
+  it "should be empty?" do
+    @tree.empty?.should be_true
+  end
+
+  it "should return 0 for height" do
+    @tree.height.should eql(0)
+  end
+
+  it "should return 0 for size" do
+    @tree.size.should eql(0)
+  end
+
+  it "should return nil for max and min" do
+    @tree.min.should be_nil
+    @tree.max.should be_nil
+    @tree.min_key.should be_nil
+    @tree.max_key.should be_nil
+  end
+
+  it "should not delete" do
+    @tree.delete(:non_existing).should be_nil
+  end
+end
+
+describe "non-empty rbtree", :shared => true do
+  before(:each) do
+    @num_items = 1000
+    @random_array = Array.new(@num_items) { rand(@num_items) }
+    @random_array.each { |x| @tree[x] = x }
+  end
+
+  it "should return correct size (uniqify items first)" do
+    @tree.should_not be_empty
+    @tree.size.should eql(@random_array.uniq.size)
+  end
+
+  it "should return correct max and min" do
+    @tree.min_key.should eql(@random_array.min)
+    @tree.max_key.should eql(@random_array.max)
+    @tree.min[0].should eql(@random_array.min)
+    @tree.max[0].should eql(@random_array.max)
+  end
+
+  it "should not #has_key? keys it doesn't have" do
+    @tree.has_key?(100000).should be_false
+  end
+
+  it "should #has_key? keys it does have" do
+    @tree.has_key?(@random_array[0]).should be_true
+  end
+
+  it "should remove all keys" do
+    ordered = []
+    @random_array.uniq.each do |key|
+      @tree.has_key?(key).should eql(true)
+      ordered << @tree.delete(key)
+      @tree.has_key?(key).should eql(false)
+    end
+    ordered.should eql(@random_array.uniq)
+  end
+
+  it "should delete_min keys correctly" do
+    ascending = []
+    ascending << @tree.delete_min until @tree.empty?
+    ascending.should eql(@random_array.uniq.sort)
+  end
+
+  it "should delete_max keys correctly" do
+    descending = []
+    descending << @tree.delete_max until @tree.empty?
+    descending.should eql(@random_array.uniq.sort.reverse)
+  end
+
+  it "should let you iterate with #each" do
+    counter = 0
+    sorted_array = @random_array.uniq.sort
+    @tree.each do |key, val|
+      key.should eql(sorted_array[counter])
+      counter += 1
+    end
+  end
+end
+
+describe "empty rbtreemap" do
+  before(:each) do
+    @tree = Containers::RubyRBTreeMap.new
+  end
+  it_should_behave_like "empty rbtree"
+end
+
+describe "full rbtreemap" do
+  before(:each) do
+    @tree = Containers::RubyRBTreeMap.new
+  end
+  it_should_behave_like "non-empty rbtree"
+end
+
+begin
+  Containers::CRBTreeMap
+  describe "empty crbtreemap" do
+    before(:each) do
+      @tree = Containers::CRBTreeMap.new
+    end
+    it_should_behave_like "empty rbtree"
+  end
+
+  describe "full crbtreemap" do
+    before(:each) do
+      @tree = Containers::CRBTreeMap.new
+    end
+    it_should_behave_like "non-empty rbtree"
+  end
+rescue Exception
+end

data/spec/search_spec.rb

@@ -0,0 +1,28 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+
+class String; include Algorithms::Search; end
+
+describe "search algorithms" do
+  it "should binary search sorted arrays" do
+    n = 1000
+    @rand_array = Array.new(n) { rand(n) }.sort
+    
+    Algorithms::Search.binary_search(@rand_array, @rand_array.first).should eql(@rand_array.first)
+    Algorithms::Search.binary_search(@rand_array, 999999).should be_nil
+    Algorithms::Search.binary_search(@rand_array, nil).should be_nil
+  end
+  
+  it "should use kmp_search to find substrings it has" do
+    string = "ABC ABCDAB ABCDABCDABDE"
+    Algorithms::Search.kmp_search(string, "ABCDABD").should eql(15)
+    Algorithms::Search.kmp_search(string, "ABCDEF").should be_nil
+    Algorithms::Search.kmp_search(string, nil).should be_nil
+    Algorithms::Search.kmp_search(string, "").should be_nil
+    Algorithms::Search.kmp_search(nil, "ABCD").should be_nil
+  end
+  
+  it "should let you include Search in String to enable instance methods" do
+    "ABC ABCDAB ABCDABCDABDE".kmp_search("ABCDABD").should eql(15)
+  end
+end

data/spec/sort_spec.rb

@@ -0,0 +1,28 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+include Algorithms
+
+describe "sort algorithms" do
+  before(:each) do
+    @sorts = %w(bubble_sort comb_sort selection_sort heapsort insertion_sort shell_sort quicksort mergesort)
+  end
+
+  it "should work for empty containers" do
+    empty_array = []
+    @sorts.each { |sort| Sort.send(sort, empty_array).should eql([]) }
+  end
+
+  it "should work for a container of size 1" do
+    one_array = [1]
+    @sorts.each { |sort| Sort.send(sort, one_array).should eql(one_array) }
+  end
+
+  it "should work for random arrays of numbers" do
+    n = 500
+    rand_array = Array.new(n) { rand(n) }
+    sorted_array = rand_array.sort
+
+    @sorts.each { |sort| Sort.send(sort, rand_array.dup).should eql(sorted_array) }
+  end    
+
+end

data/spec/splay_tree_map_spec.rb

@@ -0,0 +1,102 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+  
+describe "(empty splay)", :shared => true do
+  it "should let you push stuff in" do
+    100.times { |x| @tree[x] = x }
+    @tree.size.should eql(100)
+  end
+  
+  it "should return 0 for size" do
+    @tree.size.should eql(0)
+  end
+  
+  it "should return nil for #min and #max" do
+    @tree.min.should be_nil
+    @tree.max.should be_nil
+  end
+  
+  it "should return nil for #delete" do
+    @tree.delete(:non_existing).should be_nil
+  end
+end
+
+describe "(non-empty splay)", :shared => true do
+  before(:each) do
+    @num_items = 100
+    @random_array = []
+    @num_items.times { @random_array << rand(@num_items) }
+    @random_array.each { |x| @tree[x] = x }
+  end
+  
+  it "should return correct size (uniqify items first)" do
+    @tree.size.should eql(@random_array.uniq.size)
+  end
+  
+  it "should have correct height (worst case is when items are inserted in order, and height = num items inserted)" do
+    @tree.clear
+    10.times { |x| @tree[x] = x }
+    @tree.height.should eql(10)
+  end
+  
+  it "should return correct max and min keys" do
+    @tree.min[0].should eql(@random_array.min)
+    @tree.max[0].should eql(@random_array.max)
+  end
+  
+  it "should not #has_key? keys it doesn't have" do
+    @tree.has_key?(10000).should be_false
+  end
+  
+  it "should #has_key? keys it does have" do
+    @tree.has_key?(@random_array[0]).should be_true
+  end
+  
+  it "should remove any key" do
+    random_key = @random_array[rand(@num_items)]
+    @tree.has_key?(random_key).should be_true
+    @tree.delete(random_key).should eql(random_key)
+    @tree.has_key?(random_key).should be_false
+  end
+  
+  it "should let you iterate with #each" do
+    counter = 0
+    sorted_array = @random_array.uniq.sort
+    @tree.each do |key, val|
+      key.should eql(sorted_array[counter])
+      counter += 1
+    end
+  end
+end
+
+# describe Containers::CRBTreeMap do
+#   describe "empty" do
+#     before(:each) do
+#       @tree = Containers::CRBTreeMap.new
+#     end
+#     it_should_behave_like "(empty)"
+#   end
+#   
+#   describe "full" do
+#     before(:each) do
+#       @tree = Containers::CRBTreeMap.new
+#     end
+#     it_should_behave_like "(non-empty)"
+#   end
+# end
+
+# describe Containers::SplayTreeMap do
+  describe "empty splaytreemap" do
+    before(:each) do
+      @tree = Containers::SplayTreeMap.new
+    end
+    it_should_behave_like "(empty splay)"
+  end
+  
+  describe "full splaytreemap" do
+    before(:each) do
+      @tree = Containers::SplayTreeMap.new
+    end
+    it_should_behave_like "(non-empty splay)"
+  end
+# end

data/spec/stack_spec.rb

@@ -1,53 +1,60 @@
-require 'lib/algorithms'
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
 
-describe Containers::Stack do
+describe "empty stack" do
   before(:each) do
     @stack = Containers::Stack.new
   end
-  
-  describe "(empty)" do
-    it "should return nil when sent #pop" do
-      @stack.pop.should eql(nil)
-    end
-
-    it "should return a size of 1 when sent #push" do
-      @stack.push(1).size.should eql(1)
-    end
-    
-    it "should return nil when peeked" do
-      @stack.peek.should eql(nil)
-    end
-    
-    it "should return empty?" do
-      @stack.empty?.should eql(true)
-    end
-  end
-  
-  describe "(non-empty)" do
-    before(:each) do
-      @stack.push(10)
-      @stack.push("10")
-    end
-    
-    it "should return last pushed object" do
-      @stack.pop.should eql("10")
-    end
-    
-    it "should return the size" do
-      @stack.size.should eql(2)
-    end
-    
-    it "should not return empty?" do
-      @stack.empty?.should eql(false)
-    end
-    
-    it "should return nil after all pops" do
-      @stack.pop
-      @stack.pop
-      @stack.pop.should eql(nil)
-      @stack.peek.should eql(nil)
-    end
-    
-  end
-  
-end
+
+  it "should return nil when sent #pop" do
+    @stack.pop.should be_nil
+  end
+
+  it "should return a size of 1 when sent #push" do
+    @stack.push(1)
+    @stack.size.should eql(1)
+  end
+
+  it "should return nil when sent #next" do
+    @stack.next.should be_nil
+  end
+
+  it "should return empty?" do
+    @stack.empty?.should be_true
+  end
+end
+
+describe "non-empty stack" do
+  before(:each) do
+    @stack = Containers::Stack.new
+    @stack.push(10)
+    @stack.push("10")
+  end
+
+  it "should return last pushed object" do
+    @stack.pop.should eql("10")
+  end
+
+  it "should return the size" do
+    @stack.size.should eql(2)
+  end
+
+  it "should not return empty?" do
+    @stack.empty?.should be_false
+  end
+
+
+  it "should iterate in LIFO order" do
+    arr = []
+    @stack.each { |obj| arr << obj }
+    arr.should eql(["10", 10])
+  end
+
+  it "should return nil after all pops" do
+    @stack.pop
+    @stack.pop
+    @stack.pop.should be_nil
+    @stack.next.should be_nil
+  end
+
+end