dkam/decisiontree
1
0
Fork 0
mirror of https://github.com/dkam/decisiontree.git synced 2025-12-28 15:14:52 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

fix deprecation warnings

Browse Source
This commit is contained in:
Ilya Grigorik
2015-11-23 16:38:37 -08:00
parent 4811a510ef
commit 7b034dc5bc
1 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
spec/id3_spec.rb
View File

@@ -12,8 +12,8 @@ describe describe DecisionTree::ID3Tree do
end end
Given(:tree) { DecisionTree::ID3Tree.new(labels, data, 1, :discrete) } Given(:tree) { DecisionTree::ID3Tree.new(labels, data, 1, :discrete) }
When { tree.train } When { tree.train }
Then { tree.predict([1,0]).should == 1 } Then { expect(tree.predict([1,0])).to eq 1 }
Then { tree.predict([0,1]).should == 0 } Then { expect(tree.predict([0,1])).to eq 0 }
end end
describe "discrete attributes" do describe "discrete attributes" do
@@ -28,8 +28,8 @@ describe describe DecisionTree::ID3Tree do
end end
Given(:tree) { DecisionTree::ID3Tree.new(labels, data, "not angry", :discrete) } Given(:tree) { DecisionTree::ID3Tree.new(labels, data, "not angry", :discrete) }
When { tree.train } When { tree.train }
Then { tree.predict(["yes", "red"]).should == "angry" } Then { expect(tree.predict(["yes", "red"])).to eq "angry" }
Then { tree.predict(["no", "red"]).should == "not angry" } Then { expect(tree.predict(["no", "red"])).to eq "not angry" }
end end
describe "discrete attributes" do describe "discrete attributes" do
@@ -48,8 +48,8 @@ describe describe DecisionTree::ID3Tree do
end end
Given(:tree) { DecisionTree::ID3Tree.new(labels, data, "not angry", :continuous) } Given(:tree) { DecisionTree::ID3Tree.new(labels, data, "not angry", :continuous) }
When { tree.train } When { tree.train }
Then { tree.predict([7, 7]).should == "angry" } Then { expect(tree.predict([7, 7])).to eq "angry" }
Then { tree.predict([2, 3]).should == "not angry" } Then { expect(tree.predict([2, 3])).to eq "not angry" }
end end
describe "a mixture" do describe "a mixture" do
@@ -68,8 +68,8 @@ describe describe DecisionTree::ID3Tree do
end end
Given(:tree) { DecisionTree::ID3Tree.new(labels, data, "not angry", color: :discrete, hunger: :continuous) } Given(:tree) { DecisionTree::ID3Tree.new(labels, data, "not angry", color: :discrete, hunger: :continuous) }
When { tree.train } When { tree.train }
Then { tree.predict([7, "red"]).should == "angry" } Then { expect(tree.predict([7, "red"])).to eq "angry" }
Then { tree.predict([2, "blue"]).should == "not angry" } Then { expect(tree.predict([2, "blue"])).to eq "not angry" }
end end
describe "infinite recursion case" do describe "infinite recursion case" do
@@ -84,7 +84,7 @@ describe describe DecisionTree::ID3Tree do
end end
Given(:tree) { DecisionTree::ID3Tree.new(labels, data, "RED", :discrete) } Given(:tree) { DecisionTree::ID3Tree.new(labels, data, "RED", :discrete) }
When { tree.train } When { tree.train }
Then { tree.predict(["a1","b0","c0"]).should == "RED" } Then { expect(tree.predict(["a1","b0","c0"])).to eq "RED" }
end end
describe "numerical labels case" do describe "numerical labels case" do
@@ -100,7 +100,7 @@ describe describe DecisionTree::ID3Tree do
Given(:tree) { DecisionTree::ID3Tree.new labels, data, nil, :discrete } Given(:tree) { DecisionTree::ID3Tree.new labels, data, nil, :discrete }
When { tree.train } When { tree.train }
Then { Then {
lambda { tree.predict([1, 1]) }.should_not raise_error expect { tree.predict([1, 1]) }.to_not raise_error
} }
end end