kotovalexarian-likes-github/ruby--ruby
1
0
Fork 0
mirror of https://github.com/ruby/ruby.git synced 2022-11-09 12:17:21 -05:00
Code Releases Activity

test_prime.rb: descriptive assertions

Browse source 
* test/test_prime.rb: use more descriptive assertions for better
  failure meessages, instead of simple assert.

git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@50893 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
nobu 2015-06-14 12:13:04 +00:00
parent 3093ffab83
commit 0b2f4ab07e
1 changed files with 32 additions and 32 deletions
Download patch file Download diff file Expand all files Collapse all files

64
test/test_prime.rb
View file

@ -36,31 +36,31 @@ class TestPrime < Test::Unit::TestCase
end end
# Prime number theorem # Prime number theorem
assert primes.length >= max/Math.log(max) assert_operator primes.length, :>=, max/Math.log(max)
delta = 0.05 delta = 0.05
li = (2..max).step(delta).inject(0){|sum,x| sum + delta/Math.log(x)} li = (2..max).step(delta).inject(0){|sum,x| sum + delta/Math.log(x)}
assert primes.length <= li assert_operator primes.length, :<=, li
end end
end end
def test_each_without_block def test_each_without_block
enum = Prime.each enum = Prime.each
assert enum.respond_to?(:each) assert_respond_to(enum, :each)
assert enum.kind_of?(Enumerable) assert_kind_of(Enumerable, enum)
assert enum.respond_to?(:with_index) assert_respond_to(enum, :with_index)
assert enum.respond_to?(:next) assert_respond_to(enum, :next)
assert enum.respond_to?(:succ) assert_respond_to(enum, :succ)
assert enum.respond_to?(:rewind) assert_respond_to(enum, :rewind)
end end
def test_instance_without_block def test_instance_without_block
enum = Prime.instance.each enum = Prime.instance.each
assert enum.respond_to?(:each) assert_respond_to(enum, :each)
assert enum.kind_of?(Enumerable) assert_kind_of(Enumerable, enum)
assert enum.respond_to?(:with_index) assert_respond_to(enum, :with_index)
assert enum.respond_to?(:next) assert_respond_to(enum, :next)
assert enum.respond_to?(:succ) assert_respond_to(enum, :succ)
assert enum.respond_to?(:rewind) assert_respond_to(enum, :rewind)
end end
def test_new def test_new
@ -114,8 +114,8 @@ class TestPrime < Test::Unit::TestCase
end end
def test_default_instance_does_not_have_compatibility_methods def test_default_instance_does_not_have_compatibility_methods
assert !Prime.instance.respond_to?(:succ) assert_not_respond_to(Prime.instance, :succ)
assert !Prime.instance.respond_to?(:next) assert_not_respond_to(Prime.instance, :next)
end end
class TestInteger < Test::Unit::TestCase class TestInteger < Test::Unit::TestCase
@ -135,36 +135,36 @@ class TestPrime < Test::Unit::TestCase
def test_prime? def test_prime?
# zero and unit # zero and unit
assert !0.prime? assert_not_predicate(0, :prime?)
assert !1.prime? assert_not_predicate(1, :prime?)
# small primes # small primes
assert 2.prime? assert_predicate(2, :prime?)
assert 3.prime? assert_predicate(3, :prime?)
# squared prime # squared prime
assert !4.prime? assert_not_predicate(4, :prime?)
assert !9.prime? assert_not_predicate(9, :prime?)
# mersenne numbers # mersenne numbers
assert((2**31-1).prime?) assert_predicate((2**31-1), :prime?)
assert !(2**32-1).prime? assert_not_predicate((2**32-1), :prime?)
# fermat numbers # fermat numbers
assert((2**(2**4)+1).prime?) assert_predicate((2**(2**4)+1), :prime?)
assert !(2**(2**5)+1).prime? # Euler! assert_not_predicate((2**(2**5)+1), :prime?) # Euler!
# large composite # large composite
assert !((2**13-1) * (2**17-1)).prime? assert_not_predicate(((2**13-1) * (2**17-1)), :prime?)
# factorial # factorial
assert !(2...100).inject(&:*).prime? assert_not_predicate((2...100).inject(&:*), :prime?)
# negative # negative
assert !-1.prime? assert_not_predicate(-1, :prime?)
assert !-2.prime? assert_not_predicate(-2, :prime?)
assert !-3.prime? assert_not_predicate(-3, :prime?)
assert !-4.prime? assert_not_predicate(-4, :prime?)
end end
end end