itree 0.1.1 → 0.1.2

data/lib/itree/tree.rb

@@ -227,7 +227,7 @@ module Intervals
 			elsif diff > 0
 				if locNode.left
 					heightDelta,removed = removeNode(locNode.left,delNode)
-					if heightDelta
+					if heightDelta != 0
 						locNode.balance = locNode.balance + 1
 						if locNode.balance == 0
 							return -1,removed
@@ -273,7 +273,7 @@ module Intervals
 			elsif diff < 0
 				if locNode.right
 					heightDelta,removed = removeNode(locNode.right,delNode)
-					if heightDelta
+					if heightDelta != 0
 						locNode.balance = locNode.balance - 1
 						if locNode.balance == 0
 							return 1,removed

data/lib/itree/version.rb

@@ -1,3 +1,3 @@
 module Intervals
-  VERSION = "0.1.1"
+  VERSION = "0.1.2"
 end

data/spec/tree_spec.rb

@@ -139,7 +139,46 @@ describe Intervals::Tree do
 			tree.insert(51,101)
 		end
 
+		it { tree.remove(0,25).should be true }
+		it { tree.remove(0,24).should be false }
+
+		context "two ranges removed" do
+			before(:each) do
+				tree.remove(100,200)
+				tree.remove(50,100)
+			end
 
+			it { tree.stab(23).length.should eq 1 }
+			it "returns a single range" do
+				results = tree.stab(23).map{|n| n.scores }.sort{|a,b| a[0] <=> b[0]}
+				results[0].should eq [0,25]
+			end
+
+			it { tree.stab(40).length.should eq 1 }
+			it "returns a single range" do
+				results = tree.stab(40).map{|n| n.scores }.sort{|a,b| a[0] <=> b[0]}
+				results[0].should eq [25,50]
+			end
+
+			it { tree.stab(77).length.should eq 2 }
+			it "returns two ranges" do
+				results = tree.stab(77).map{|n| n.scores }.sort{|a,b| a[0] <=> b[0]}
+				results[0].should eq [51,101]
+				results[1].should eq [75,125]
+			end
+
+			it { tree.stab(175).length.should eq 1 }
+			it "returns a single range" do
+				results = tree.stab(175).map{|n| n.scores }.sort{|a,b| a[0] <=> b[0]}
+				results[0].should eq [150,250]
+			end
+
+			it { tree.stab(350).length.should eq 1 }
+			it "returns a single range" do
+				results = tree.stab(350).map{|n| n.scores }.sort{|a,b| a[0] <=> b[0]}
+				results[0].should eq [300,400]
+			end
+		end
 	end
 
 	describe "#stab" do
@@ -153,13 +192,8 @@ describe Intervals::Tree do
 			tree.insert(75,125)
 			tree.insert(25,50)
 			tree.insert(0,25)
-			tree.insert(51,101)
-			tree.remove(100,200)
-			tree.remove(50,100)
 		end
 
-		it { tree.remove(0,25).should be true }
-		it { tree.remove(0,24).should be false }
 
 		it { tree.stab(23).length.should eq 1 }
 		it "returns a single range" do
@@ -176,14 +210,15 @@ describe Intervals::Tree do
 		it { tree.stab(77).length.should eq 2 }
 		it "returns two ranges" do
 			results = tree.stab(77).map{|n| n.scores }.sort{|a,b| a[0] <=> b[0]}
-			results[0].should eq [51,101]
+			results[0].should eq [50,100]
 			results[1].should eq [75,125]
 		end
 
-		it { tree.stab(175).length.should eq 1 }
-		it "returns a single range" do
+		it { tree.stab(175).length.should eq 2 }
+		it "returns a two ranges" do
 			results = tree.stab(175).map{|n| n.scores }.sort{|a,b| a[0] <=> b[0]}
-			results[0].should eq [150,250]
+			results[0].should eq [100,200]
+			results[1].should eq [150,250]
 		end
 
 		it { tree.stab(350).length.should eq 1 }

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: itree
 version: !ruby/object:Gem::Version
-  version: 0.1.1
+  version: 0.1.2
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-07-17 00:00:00.000000000 Z
+date: 2013-07-19 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec