mirror of
https://github.com/ruby/ruby.git
synced 2025-09-15 16:44:01 +02:00
merge revision(s) 42040,42041,42047: [Backport #8654]
* array.c (rb_ary_count): iterate items appropriately. [Bug #8654] * array.c (rb_ary_count): check length to avoid SEGV while iterating. Remove other pointer loop when arg is given. * test/ruby/test_array.rb (test_count): add test for bug. [ruby-core:56072] [Bug #8654] * test/ruby/test_array.rb (test_count): add a test case for #count with an argument. See Bug #8654. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/branches/ruby_2_0_0@43228 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
parent
f4811c7e2b
commit
0a57e6c975
4 changed files with 49 additions and 8 deletions
15
array.c
15
array.c
|
@ -4113,27 +4113,28 @@ rb_ary_compact(VALUE ary)
|
|||
static VALUE
|
||||
rb_ary_count(int argc, VALUE *argv, VALUE ary)
|
||||
{
|
||||
long n = 0;
|
||||
long i, n = 0;
|
||||
|
||||
if (argc == 0) {
|
||||
VALUE *p, *pend;
|
||||
VALUE v;
|
||||
|
||||
if (!rb_block_given_p())
|
||||
return LONG2NUM(RARRAY_LEN(ary));
|
||||
|
||||
for (p = RARRAY_PTR(ary), pend = p + RARRAY_LEN(ary); p < pend; p++) {
|
||||
if (RTEST(rb_yield(*p))) n++;
|
||||
for (i = 0; i < RARRAY_LEN(ary); i++) {
|
||||
v = RARRAY_PTR(ary)[i];
|
||||
if (RTEST(rb_yield(v))) n++;
|
||||
}
|
||||
}
|
||||
else {
|
||||
VALUE obj, *p, *pend;
|
||||
VALUE obj;
|
||||
|
||||
rb_scan_args(argc, argv, "1", &obj);
|
||||
if (rb_block_given_p()) {
|
||||
rb_warn("given block not used");
|
||||
}
|
||||
for (p = RARRAY_PTR(ary), pend = p + RARRAY_LEN(ary); p < pend; p++) {
|
||||
if (rb_equal(*p, obj)) n++;
|
||||
for (i = 0; i < RARRAY_LEN(ary); i++) {
|
||||
if (rb_equal(RARRAY_PTR(ary)[i], obj)) n++;
|
||||
}
|
||||
}
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue