avl_tree 1.1.2 → 1.1.3

data/lib/avl_tree.rb

@@ -57,6 +57,8 @@ class AVLTree
         @value = value
       when 1
         @right = @right.insert(key, value)
+      else
+        raise TypeError, "cannot compare #{key} and #{@key} with <=>"
       end
       rotate
     end
@@ -70,6 +72,8 @@ class AVLTree
         @value
       when 1
         @right.retrieve(key)
+      else
+        nil
       end
     end
 
@@ -84,6 +88,8 @@ class AVLTree
       when 1
         deleted, @right = @right.delete(key)
         [deleted, self.rotate]
+      else
+        raise TypeError, "cannot compare #{key} and #{@key} with <=>"
       end
     end
 

data/lib/red_black_tree.rb

@@ -77,6 +77,8 @@ class RedBlackTree
         if black? and @left.black? and @right.red? and !@right.children_both_black?
           ret = rebalance_for_right_insert
         end
+      else
+        raise TypeError, "cannot compare #{key} and #{@key} with <=>"
       end
       ret.pullup_red
     end
@@ -90,6 +92,8 @@ class RedBlackTree
         @value
       when 1
         @right.retrieve(key)
+      else
+        nil
       end
     end
 
@@ -110,6 +114,8 @@ class RedBlackTree
         if rebalance
           ret, rebalance = rebalance_for_right_delete
         end
+      else
+        raise TypeError, "cannot compare #{key} and #{@key} with <=>"
       end
       [deleted, ret, rebalance]
     end

data/test/test_avl_tree.rb

@@ -155,6 +155,15 @@ class TestAVLTree < Test::Unit::TestCase
     assert_equal 6, h.size
   end
 
+  def test_different_type
+    h = AVLTree.new
+    h['a'] = 1
+    assert_raise(TypeError) do
+      h[3.3] = 2
+    end
+    assert_nil h[3.3]
+  end
+
   def test_delete_leaf
     h = AVLTree.new
     h['b'] = 1
@@ -307,6 +316,17 @@ class TestAVLTree < Test::Unit::TestCase
     assert_equal 5, h.dump_tree.split($/).size
   end
 
+  def test_delete_different_type
+    h = AVLTree.new
+    h['a'] = 1
+    h['abc'] = 2
+    h['bb'] = 3
+
+    assert_raise(TypeError) do
+      h.delete(3.3)
+    end
+  end
+
   def test_each
     h = AVLTree.new
     s = { 'aa' => 1, 'ab' => 2, 'bb' => 3, 'bc' => 4, 'a' => 5, 'abc' => 6 }

data/test/test_red_black_tree.rb

@@ -169,6 +169,15 @@ class TestRedBlackTree < Test::Unit::TestCase
     assert_equal 6, h.size
   end
 
+  def test_different_type
+    h = RedBlackTree.new
+    h['a'] = 1
+    assert_raise(TypeError) do
+      h[3.3] = 2
+    end
+    assert_nil h[3.3]
+  end
+
   def test_delete_leaf
     h = RedBlackTree.new
     h['b'] = 1
@@ -457,6 +466,17 @@ class TestRedBlackTree < Test::Unit::TestCase
     assert_equal '(f (c (b a) (d - e)) (i (g - h) (k j)))', h.dump_sexp
   end
 
+  def test_delete_different_type
+    h = RedBlackTree.new
+    h['a'] = 1
+    h['abc'] = 2
+    h['bb'] = 3
+
+    assert_raise(TypeError) do
+      h.delete(3.3)
+    end
+  end
+
   def test_each
     h = RedBlackTree.new
     s = { 'aa' => 1, 'ab' => 2, 'bb' => 3, 'bc' => 4, 'a' => 5, 'abc' => 6 }

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: avl_tree
 version: !ruby/object:Gem::Version
-  version: 1.1.2
+  version: 1.1.3
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-03-27 00:00:00.000000000 Z
+date: 2012-05-09 00:00:00.000000000 Z
 dependencies: []
 description: 
 email: nahi@ruby-lang.org
@@ -38,15 +38,21 @@ required_ruby_version: !ruby/object:Gem::Requirement
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
+      segments:
+      - 0
+      hash: -4094052252433988634
 required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
   requirements:
   - - ! '>='
     - !ruby/object:Gem::Version
       version: '0'
+      segments:
+      - 0
+      hash: -4094052252433988634
 requirements: []
 rubyforge_project: 
-rubygems_version: 1.8.11
+rubygems_version: 1.8.23
 signing_key: 
 specification_version: 3
 summary: AVL tree and Red-black tree in Ruby