archive/ruby
1
0
Fork 0
mirror of https://github.com/ruby/ruby.git synced 2025-09-16 09:04:05 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions 10

* array.c (rb_ary_repeated_permutation): new method added. a patch

Browse source 
from Makoto Kishimoto in [ruby-core:29267]   [ruby-core:28724]

* array.c (rb_ary_repeated_combination): ditto.

git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@27352 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
matz 2010-04-16 07:24:04 +00:00
parent 42b8a699ed
commit 38ae996706
3 changed files with 271 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

82
test/ruby/test_array.rb
View file

@ -814,6 +814,40 @@ class TestArray < Test::Unit::TestCase
assert_match(/reentered/, e.message)
end
def test_repeated_permutation_with_callcc
respond_to?(:callcc, true) or require 'continuation'
n = 1000
cont = nil
ary = [1,2,3]
begin
ary.repeated_permutation(2) {
callcc {|k| cont = k} unless cont
}
rescue => e
end
n -= 1
cont.call if 0 < n
assert_instance_of(RuntimeError, e)
assert_match(/reentered/, e.message)
end
def test_repeated_combination_with_callcc
respond_to?(:callcc, true) or require 'continuation'
n = 1000
cont = nil
ary = [1,2,3]
begin
ary.repeated_combination(2) {
callcc {|k| cont = k} unless cont
}
rescue => e
end
n -= 1
cont.call if 0 < n
assert_instance_of(RuntimeError, e)
assert_match(/reentered/, e.message)
end
def test_hash
a1 = @cls[ 'cat', 'dog' ]
a2 = @cls[ 'cat', 'dog' ]
@ -1504,6 +1538,54 @@ class TestArray < Test::Unit::TestCase
assert_equal(@cls[1, 2, 3, 4].permutation.to_a, b)
end
def test_repeated_permutation
a = @cls[1,2]
assert_equal(@cls[[]], a.repeated_permutation(0).to_a)
assert_equal(@cls[[1],[2]], a.repeated_permutation(1).to_a.sort)
assert_equal(@cls[[1,1],[1,2],[2,1],[2,2]],
a.repeated_permutation(2).to_a.sort)
assert_equal(@cls[[1,1,1],[1,1,2],[1,2,1],[1,2,2],
[2,1,1],[2,1,2],[2,2,1],[2,2,2]],
a.repeated_permutation(3).to_a.sort)
assert_equal(@cls[], a.repeated_permutation(-1).to_a)
assert_equal("abcde".each_char.to_a.repeated_permutation(5).sort,
"edcba".each_char.to_a.repeated_permutation(5).sort)
assert_equal(@cls[].repeated_permutation(0).to_a, @cls[[]])
assert_equal(@cls[].repeated_permutation(1).to_a, @cls[])
a = @cls[1, 2, 3, 4]
b = @cls[]
a.repeated_permutation(4) {|x| b << x; a.replace(@cls[9, 8, 7, 6]) }
assert_equal(@cls[9, 8, 7, 6], a)
assert_equal(@cls[1, 2, 3, 4].repeated_permutation(4).to_a, b)
end
def test_repeated_combination
a = @cls[1,2,3]
assert_equal(@cls[[]], a.repeated_combination(0).to_a)
assert_equal(@cls[[1],[2],[3]], a.repeated_combination(1).to_a.sort)
assert_equal(@cls[[1,1],[1,2],[1,3],[2,2],[2,3],[3,3]],
a.repeated_combination(2).to_a.sort)
assert_equal(@cls[[1,1,1],[1,1,2],[1,1,3],[1,2,2],[1,2,3],
[1,3,3],[2,2,2],[2,2,3],[2,3,3],[3,3,3]],
a.repeated_combination(3).to_a.sort)
assert_equal(@cls[[1,1,1,1],[1,1,1,2],[1,1,1,3],[1,1,2,2],[1,1,2,3],
[1,1,3,3],[1,2,2,2],[1,2,2,3],[1,2,3,3],[1,3,3,3],
[2,2,2,2],[2,2,2,3],[2,2,3,3],[2,3,3,3],[3,3,3,3]],
a.repeated_combination(4).to_a.sort)
assert_equal(@cls[], a.repeated_combination(-1).to_a)
assert_equal("abcde".each_char.to_a.repeated_combination(5).map{|a|a.sort}.sort,
"edcba".each_char.to_a.repeated_combination(5).map{|a|a.sort}.sort)
assert_equal(@cls[].repeated_combination(0).to_a, @cls[[]])
assert_equal(@cls[].repeated_combination(1).to_a, @cls[])
a = @cls[1, 2, 3, 4]
b = @cls[]
a.repeated_combination(4) {|x| b << x; a.replace(@cls[9, 8, 7, 6]) }
assert_equal(@cls[9, 8, 7, 6], a)
assert_equal(@cls[1, 2, 3, 4].repeated_combination(4).to_a, b)
end
def test_take
assert_equal([1,2,3], [1,2,3,4,5,0].take(3))
assert_raise(ArgumentError, '[ruby-dev:34123]') { [1,2].take(-1) }