stakach-algorithms 1.0.6 → 1.0.7

data/spec/kd_tree_spec.rb

@@ -0,0 +1,33 @@
+require 'helper'
+
+describe Algorithms::Containers::KDTree do
+  it "should work for a documented example" do
+    kdtree = Algorithms::Containers::KDTree.new( {0 => [4, 3], 1 => [3, 0], 2 => [-1, 2], 3 => [6, 4],
+                                     4 => [3, -5], 5 => [-2, -5] })
+    closest_2 = kdtree.find_nearest([0, 0], 2)
+    closest_2.should eql([[5, 2], [9, 1]])
+  end
+  
+  it "should work for real-life example from facebook puzzle" do
+    points = {}
+    input = File.open(File.join(File.dirname(__FILE__), 'kd_test_in.txt'), 'r')
+
+    # Populate points hash
+    input.each_line do |line|
+      break if line.empty?
+      n, x, y = line.split(/\s+/)
+      points[n.to_i] = [x.to_f, y.to_f]
+    end
+
+    out = ""
+    kdtree = Algorithms::Containers::KDTree.new(points)
+    points.sort{ |(k1, v1), (k2, v2)| k1 <=> k2 }.each { |id, point|
+      nearest_4 = kdtree.find_nearest(point, 4)
+      out << "#{id} #{nearest_4[1..-1].collect{ |n| n[1] }.join(',')}\n"
+    }
+    
+    expected = File.read(File.join(File.dirname(__FILE__), 'kd_expected_out.txt'))
+    expected.should eql(out)
+  end
+  
+end

data/spec/map_gc_mark_spec.rb

@@ -0,0 +1,28 @@
+require 'helper'
+
+if RUBY_VERSION < "1.9"
+describe "map gc mark test" do
+  it "should mark ruby object references" do
+    anon_key_class = Class.new do
+      attr :value
+      def initialize(x); @value = x; end
+      def <=>(other); value <=> other.value; end
+    end
+    anon_val_class = Class.new
+    @rbtree = Algorithms::Containers::CRBTreeMap.new
+    @splaytree = Algorithms::Containers::CSplayTreeMap.new
+    100.times { |x| 
+      @rbtree[anon_key_class.new(x)] = anon_val_class.new
+      @splaytree[anon_key_class.new(x)] = anon_val_class.new
+    }
+    # Mark and sweep
+    ObjectSpace.garbage_collect
+    # Check if any instances were swept
+    count = 0
+    ObjectSpace.each_object(anon_key_class) { |x| count += 1 }
+    count.should eql(200)
+    ObjectSpace.each_object(anon_val_class) { |x| count += 1 }
+    count.should eql(400)
+  end
+end
+end

data/spec/priority_queue_spec.rb

@@ -0,0 +1,74 @@
+require 'helper'
+
+describe Algorithms::Containers::PriorityQueue do
+  before(:each) do
+    @q = Algorithms::Containers::PriorityQueue.new
+  end
+  
+  describe "(empty priority queue)" do
+    it "should return 0 for size and be empty" do
+      @q.size.should eql(0)
+      @q.should be_empty
+    end
+    
+    it "should not return anything" do
+      @q.next.should be_nil
+      @q.pop.should be_nil
+      @q.delete(1).should be_nil
+      @q.has_priority?(1).should be_false
+    end
+    
+    it "should give the correct size when adding items" do
+      20.times do |i|
+        @q.size.should eql(i)
+        @q.push(i, i)
+      end
+      10.times do |i|
+        @q.size.should eql(20-i)
+        @q.pop
+      end
+      10.times do |i|
+        @q.size.should eql(i+10)
+        @q.push(i, i)
+      end
+      @q.delete(5)
+      @q.size.should eql(19)
+    end
+  end
+  
+  describe "(non-empty priority queue)" do
+    before(:each) do
+      @q.push("Alaska", 50)
+      @q.push("Delaware", 30)
+      @q.push("Georgia", 35)
+    end
+    
+    it "should next/pop the highest priority" do
+      @q.next.should eql("Alaska")
+      @q.size.should eql(3)
+      @q.pop.should eql("Alaska")
+      @q.size.should eql(2)
+    end
+    
+    it "should not be empty" do
+      @q.should_not be_empty
+    end
+    
+    it "should has_priority? priorities it has" do
+      @q.has_priority?(50).should be_true
+      @q.has_priority?(10).should be_false
+    end      
+    
+    it "should return nil after popping everything" do
+      3.times do 
+        @q.pop
+      end
+      @q.pop.should be_nil
+    end
+    
+    it "should delete things it has and not things it doesn't" do
+      @q.delete(50).should eql("Alaska")
+      @q.delete(10).should eql(nil)
+    end
+  end
+end

data/spec/queue_spec.rb

@@ -0,0 +1,60 @@
+require 'helper'
+
+describe "empty queue" do
+  before(:each) do
+    @queue = Algorithms::Containers::Queue.new
+  end
+
+
+  it "should return nil when sent #pop" do
+    @queue.pop.should be_nil
+  end
+
+  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 = Algorithms::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

data/spec/rb_tree_map_spec.rb

@@ -0,0 +1,122 @@
+require 'helper'
+
+shared_examples "empty rbtree" 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
+
+shared_examples "non-empty rbtree" 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,27 @@
+require 'helper'
+
+class String; include Algorithms::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::Algorithms::Search.binary_search(@rand_array, @rand_array.first).should eql(@rand_array.first)
+    Algorithms::Algorithms::Search.binary_search(@rand_array, 999999).should be_nil
+    Algorithms::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::Algorithms::Search.kmp_search(string, "ABCDABD").should eql(15)
+    Algorithms::Algorithms::Search.kmp_search(string, "ABCDEF").should be_nil
+    Algorithms::Algorithms::Search.kmp_search(string, nil).should be_nil
+    Algorithms::Algorithms::Search.kmp_search(string, "").should be_nil
+    Algorithms::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,26 @@
+require 'helper'
+
+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| Algorithms::Algorithms::Sort.send(sort, empty_array).should eql([]) }
+  end
+
+  it "should work for a container of size 1" do
+    one_array = [1]
+    @sorts.each { |sort| Algorithms::Algorithms::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| Algorithms::Algorithms::Sort.send(sort, rand_array.dup).should eql(sorted_array) }
+  end    
+
+end

data/spec/splay_tree_map_spec.rb

@@ -0,0 +1,105 @@
+require 'helper'
+  
+shared_examples "empty splaytree" 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
+  
+  it "should return nil for #get" do
+    @tree[4235].should be_nil
+  end
+end
+
+shared_examples "non-empty splaytree" 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 "empty splaytreemap" do
+  before(:each) do
+    @tree = Containers::RubySplayTreeMap.new
+  end
+  it_should_behave_like "empty splaytree"
+end
+
+describe "full splaytreemap" do
+  before(:each) do
+    @tree = Containers::RubySplayTreeMap.new
+  end
+  it_should_behave_like "non-empty splaytree"
+end
+
+begin
+  Containers::CSplayTreeMap
+  describe "empty csplaytreemap" do
+    before(:each) do
+      @tree = Containers::CSplayTreeMap.new
+    end
+    it_should_behave_like "empty splaytree"
+  end
+
+  describe "full csplaytreemap" do
+    before(:each) do
+      @tree = Containers::CSplayTreeMap.new
+    end
+    it_should_behave_like "non-empty splaytree"
+  end
+rescue Exception
+end