spec/integration/axiom/function/predicate/inclusion/optimize_spec.rb in axiom-optimizer-0.1.0 vs spec/integration/axiom/function/predicate/inclusion/optimize_spec.rb in axiom-optimizer-0.1.1

- old
+ new

@@ -3,37 +3,37 @@ require 'spec_helper' describe Function::Predicate::Inclusion, '#optimize' do subject { object.optimize } - let(:left) { Attribute::Integer.new(:id, :size => 1..2**31-1) } - let(:object) { described_class.new(left, right) } + let(:left) { Attribute::Integer.new(:id, size: 1..2**31 - 1) } + let(:object) { described_class.new(left, right) } context 'right is a Range' do context 'that is inclusive' do context 'and empty' do let(:right) { 1..0 } - it { should equal(Function::Proposition::Contradiction.instance) } + it { should be(Function::Proposition::Contradiction.instance) } it_should_behave_like 'an optimize method' end context 'and not empty' do let(:right) { 1..10 } - it { should equal(object) } + it { should be(object) } it_should_behave_like 'an optimize method' end end context 'that is exclusive' do context 'and empty' do let(:right) { 1...1 } - it { should equal(Function::Proposition::Contradiction.instance) } + it { should be(Function::Proposition::Contradiction.instance) } it_should_behave_like 'an optimize method' end context 'and not empty' do @@ -49,85 +49,85 @@ context 'using an attribute that is not comparable' do let(:left) { Attribute::String.new(:string) } let(:right) { 'a'..'z' } - it { should equal(Function::Proposition::Contradiction.instance) } + it { should be(Function::Proposition::Contradiction.instance) } it_should_behave_like 'an optimize method' end context 'that is greater than the left range' do let(:right) { 2**31..2**31 } - it { should equal(Function::Proposition::Contradiction.instance) } + it { should be(Function::Proposition::Contradiction.instance) } it_should_behave_like 'an optimize method' end context 'that is less than the left range' do let(:right) { -1..-1 } - it { should equal(Function::Proposition::Contradiction.instance) } + it { should be(Function::Proposition::Contradiction.instance) } it_should_behave_like 'an optimize method' end end context 'right is an Enumerable' do context 'that is empty' do let(:right) { [] } - it { should equal(Function::Proposition::Contradiction.instance) } + it { should be(Function::Proposition::Contradiction.instance) } it_should_behave_like 'an optimize method' end context 'that is empty after filtering invalid entries' do - let(:right) { [ 'a' ] } + let(:right) { ['a'] } - it { should equal(Function::Proposition::Contradiction.instance) } + it { should be(Function::Proposition::Contradiction.instance) } it_should_behave_like 'an optimize method' end context 'that is not empty after filtering invalid entries' do - let(:right) { [ 'a', 1, 2 ] } + let(:right) { ['a', 1, 2] } - it { should eql(left.include([ 1, 2 ])) } + it { should eql(left.include([1, 2])) } it_should_behave_like 'an optimize method' end context 'that has duplicate entries' do - let(:right) { [ 1, 2, 2 ] } + let(:right) { [1, 2, 2] } - it { should eql(left.include([ 1, 2 ])) } + it { should eql(left.include([1, 2])) } it_should_behave_like 'an optimize method' end context 'that has one entry' do - let(:right) { [ 1 ] } + let(:right) { [1] } it { should eql(left.eq(1)) } it_should_behave_like 'an optimize method' end context 'that has unsorted entries' do - let(:right) { [ 2, 1 ] } + let(:right) { [2, 1] } - it { should eql(left.include([ 1, 2 ])) } + it { should eql(left.include([1, 2])) } it_should_behave_like 'an optimize method' end end context 'right is a nil' do let(:right) { nil } - it { should equal(Function::Proposition::Contradiction.instance) } + it { should be(Function::Proposition::Contradiction.instance) } it_should_behave_like 'an optimize method' end end