From ba59365db9283b23b1a2dd9b91dac7303c798326 Mon Sep 17 00:00:00 2001 From: marcandre Date: Tue, 6 Nov 2012 17:11:51 +0000 Subject: [PATCH] * array.c (rb_ary_repeated_combination): Support for repeated_combination.size [Feature #6636] git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@37504 b2dd03c8-39d4-4d8f-98ff-823fe69b080e --- array.c | 13 ++++++++++++- test/ruby/test_enumerator.rb | 5 +++++ 2 files changed, 17 insertions(+), 1 deletion(-) diff --git a/array.c b/array.c index 3eeafc86214753..03d26afdec66e1 100644 --- a/array.c +++ b/array.c @@ -4645,6 +4645,17 @@ rcombinate0(long n, long r, long *p, long index, long rest, VALUE values) } } +static VALUE +rb_ary_repeated_combination_size(VALUE ary, VALUE args) +{ + long n = RARRAY_LEN(ary); + long k = NUM2LONG(RARRAY_PTR(args)[0]); + if (k == 0) { + return LONG2FIX(1); + } + return binomial_coefficient(k, n + k - 1); +} + /* * call-seq: * ary.repeated_combination(n) { |c| block } -> ary @@ -4678,7 +4689,7 @@ rb_ary_repeated_combination(VALUE ary, VALUE num) long n, i, len; n = NUM2LONG(num); /* Combination size from argument */ - RETURN_ENUMERATOR(ary, 1, &num); /* Return Enumerator if no block */ + RETURN_SIZED_ENUMERATOR(ary, 1, &num, rb_ary_repeated_combination_size); /* Return enumerator if no block */ len = RARRAY_LEN(ary); if (n < 0) { /* yield nothing */ diff --git a/test/ruby/test_enumerator.rb b/test/ruby/test_enumerator.rb index 1c04a05bb0d6f5..93d46a6c2394ce 100644 --- a/test/ruby/test_enumerator.rb +++ b/test/ruby/test_enumerator.rb @@ -450,6 +450,11 @@ def test_size_for_array_combinatorics check_consistency_for_combinatorics(:repeated_permutation) assert_equal 291733167875766667063796853374976, (1..42).to_a.repeated_permutation(20).size # 42 ** 20 + + check_consistency_for_combinatorics(:repeated_combination) + assert_equal 28258808871162574166368460400, + (1..59).to_a.repeated_combination(42).size + # 1.upto(100).inject(:*) / 1.upto(42).inject(:*) / 1.upto(58).inject(:*) end end