diff options
| author | matz <matz@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2007-10-01 14:46:07 +0000 |
|---|---|---|
| committer | matz <matz@b2dd03c8-39d4-4d8f-98ff-823fe69b080e> | 2007-10-01 14:46:07 +0000 |
| commit | 25ff7ef4c68ef7b6f53a8eb61ef4ec57142852b9 (patch) | |
| tree | 26c2ecff4ed2b78fd5a63eac3ecc1d9a5a82c59b /test/ruby/test_array.rb | |
| parent | 5838fff3341e6b4ebca956a6a96659eb5afb9859 (diff) | |
* array.c (rb_ary_combination): revisit #combination behavior.
suggested by David Flanagan.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@13588 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
Diffstat (limited to 'test/ruby/test_array.rb')
| -rw-r--r-- | test/ruby/test_array.rb | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/test/ruby/test_array.rb b/test/ruby/test_array.rb index 4d2b05304b..9ab3168d73 100644 --- a/test/ruby/test_array.rb +++ b/test/ruby/test_array.rb @@ -1178,7 +1178,7 @@ class TestArray < Test::Unit::TestCase end # def test_permutation -# assert_equal(@cls[], @cls[1,2,3].permutation(0).to_a) +# assert_equal(@cls[[]], @cls[1,2,3].permutation(0).to_a) # assert_equal(@cls[[1],[2],[3]], @cls[1,2,3].permutation(1).to_a) # assert_equal(@cls[[1,2],[1,3],[2,1],[2,3],[3,1],[3,2]], @cls[1,2,3].permutation(2).to_a) # assert_equal(@cls[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]], @cls[1,2,3].permutation(3).to_a) @@ -1186,7 +1186,7 @@ class TestArray < Test::Unit::TestCase # end def test_combination - assert_equal(@cls[], @cls[1,2,3,4].combination(0).to_a) + assert_equal(@cls[[]], @cls[1,2,3,4].combination(0).to_a) assert_equal(@cls[[1],[2],[3],[4]], @cls[1,2,3,4].combination(1).to_a) assert_equal(@cls[[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]], @cls[1,2,3,4].combination(2).to_a) assert_equal(@cls[[1,2,3],[1,2,4],[1,3,4],[2,3,4]], @cls[1,2,3,4].combination(3).to_a) |