algorithms 0.2.0 → 0.3.0

data/spec/kd_tree_spec.rb

@@ -1,4 +1,34 @@
 $: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
 require 'algorithms'
 
-# TODO: KD Tree Spec
+describe Containers::KDTree do
+  it "should work for a documented example" do
+    kdtree = 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 = 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,27 @@
+$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
+require 'algorithms'
+
+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 = Containers::CRBTreeMap.new
+    @splaytree = 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

data/spec/splay_tree_map_spec.rb

@@ -19,6 +19,10 @@ describe "empty splaytree", :shared => true do
   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
 
 describe "non-empty splaytree", :shared => true do

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: algorithms
 version: !ruby/object:Gem::Version 
-  version: 0.2.0
+  version: 0.3.0
 platform: ruby
 authors: 
 - Kanwei Li
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2009-03-29 00:00:00 -04:00
+date: 2009-11-16 00:00:00 -05:00
 default_executable: 
 dependencies: []
 
@@ -22,15 +22,16 @@ extensions:
 - ext/containers/rbtree_map/extconf.rb
 - ext/containers/splaytree_map/extconf.rb
 extra_rdoc_files: 
+- README.markdown
 - ext/containers/deque/deque.c
 - ext/containers/deque/extconf.rb
 - ext/containers/rbtree_map/extconf.rb
 - ext/containers/rbtree_map/rbtree.c
 - ext/containers/splaytree_map/extconf.rb
 - ext/containers/splaytree_map/splaytree.c
+- lib/algorithms.rb
 - lib/algorithms/search.rb
 - lib/algorithms/sort.rb
-- lib/algorithms.rb
 - lib/containers/deque.rb
 - lib/containers/heap.rb
 - lib/containers/kd_tree.rb
@@ -41,8 +42,11 @@ extra_rdoc_files:
 - lib/containers/stack.rb
 - lib/containers/suffix_array.rb
 - lib/containers/trie.rb
-- README.markdown
 files: 
+- History.txt
+- Manifest
+- README.markdown
+- Rakefile
 - algorithms.gemspec
 - benchmarks/deque.rb
 - benchmarks/sorts.rb
@@ -53,10 +57,9 @@ files:
 - ext/containers/rbtree_map/rbtree.c
 - ext/containers/splaytree_map/extconf.rb
 - ext/containers/splaytree_map/splaytree.c
-- History.txt
+- lib/algorithms.rb
 - lib/algorithms/search.rb
 - lib/algorithms/sort.rb
-- lib/algorithms.rb
 - lib/containers/deque.rb
 - lib/containers/heap.rb
 - lib/containers/kd_tree.rb
@@ -67,16 +70,15 @@ files:
 - lib/containers/stack.rb
 - lib/containers/suffix_array.rb
 - lib/containers/trie.rb
-- Manifest
-- Rakefile
-- README.markdown
 - spec/deque_gc_mark_spec.rb
 - spec/deque_spec.rb
 - spec/heap_spec.rb
+- spec/kd_expected_out.txt
+- spec/kd_test_in.txt
 - spec/kd_tree_spec.rb
+- spec/map_gc_mark_spec.rb
 - spec/priority_queue_spec.rb
 - spec/queue_spec.rb
-- spec/rb_tree_map_gc_mark_spec.rb
 - spec/rb_tree_map_spec.rb
 - spec/search_spec.rb
 - spec/sort_spec.rb

data/spec/rb_tree_map_gc_mark_spec.rb

@@ -1,25 +0,0 @@
-$: << File.join(File.expand_path(File.dirname(__FILE__)), '..', 'lib')
-require 'algorithms'
-
-if defined? Containers::CRBTreeMap
-  describe "CRBTreeMap" 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
-      @tree = Containers::CRBTreeMap.new
-      100.times { |x| @tree[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(100)
-      ObjectSpace.each_object(anon_val_class) { |x| count += 1 }
-      count.should eql(200)
-    end
-  end
-end