RARRAY 66 array.c ptr = ALLOC_N(VALUE, RARRAY(ary)->len);
RARRAY 68 array.c RARRAY(ary)->aux.capa = RARRAY(ary)->len;
RARRAY 68 array.c RARRAY(ary)->aux.capa = RARRAY(ary)->len;
RARRAY 69 array.c MEMCPY(ptr, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 69 array.c MEMCPY(ptr, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 70 array.c RARRAY(ary)->ptr = ptr;
RARRAY 117 array.c RARRAY(ary)->ptr = ALLOC_N(VALUE, len);
RARRAY 118 array.c RARRAY(ary)->aux.capa = len;
RARRAY 162 array.c RARRAY(ary)->ptr[i] = va_arg(ar, VALUE);
RARRAY 166 array.c RARRAY(ary)->len = n;
RARRAY 179 array.c MEMCPY(RARRAY(ary)->ptr, elts, VALUE, n);
RARRAY 181 array.c RARRAY(ary)->len = n;
RARRAY 193 array.c RARRAY(ary)->ptr[0] = car;
RARRAY 194 array.c RARRAY(ary)->ptr[1] = cdr;
RARRAY 195 array.c RARRAY(ary)->len = 2;
RARRAY 220 array.c RARRAY(ary)->len = 0;
RARRAY 242 array.c if (len > RARRAY(ary)->aux.capa) {
RARRAY 243 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, len);
RARRAY 244 array.c RARRAY(ary)->aux.capa = len;
RARRAY 253 array.c RARRAY(ary)->ptr[i] = rb_yield(LONG2NUM(i));
RARRAY 254 array.c RARRAY(ary)->len = i + 1;
RARRAY 258 array.c memfill(RARRAY(ary)->ptr, len, val);
RARRAY 259 array.c RARRAY(ary)->len = len;
RARRAY 277 array.c RARRAY(ary)->ptr = ALLOC_N(VALUE, argc);
RARRAY 278 array.c MEMCPY(RARRAY(ary)->ptr, argv, VALUE, argc);
RARRAY 280 array.c RARRAY(ary)->len = RARRAY(ary)->aux.capa = argc;
RARRAY 280 array.c RARRAY(ary)->len = RARRAY(ary)->aux.capa = argc;
RARRAY 293 array.c idx += RARRAY(ary)->len;
RARRAY 296 array.c idx - RARRAY(ary)->len);
RARRAY 300 array.c if (idx >= RARRAY(ary)->aux.capa) {
RARRAY 301 array.c long new_capa = RARRAY(ary)->aux.capa / 2;
RARRAY 310 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, new_capa);
RARRAY 311 array.c RARRAY(ary)->aux.capa = new_capa;
RARRAY 313 array.c if (idx > RARRAY(ary)->len) {
RARRAY 314 array.c rb_mem_clear(RARRAY(ary)->ptr + RARRAY(ary)->len,
RARRAY 314 array.c rb_mem_clear(RARRAY(ary)->ptr + RARRAY(ary)->len,
RARRAY 315 array.c idx-RARRAY(ary)->len + 1);
RARRAY 318 array.c if (idx >= RARRAY(ary)->len) {
RARRAY 319 array.c RARRAY(ary)->len = idx + 1;
RARRAY 321 array.c RARRAY(ary)->ptr[idx] = val;
RARRAY 329 array.c rb_ary_store(ary, RARRAY(ary)->len, item);
RARRAY 353 array.c if (RARRAY(ary)->len == 0) return Qnil;
RARRAY 355 array.c RARRAY(ary)->len * 2 < RARRAY(ary)->aux.capa &&
RARRAY 355 array.c RARRAY(ary)->len * 2 < RARRAY(ary)->aux.capa &&
RARRAY 356 array.c RARRAY(ary)->aux.capa > ARY_DEFAULT_SIZE) {
RARRAY 357 array.c RARRAY(ary)->aux.capa = RARRAY(ary)->len * 2;
RARRAY 357 array.c RARRAY(ary)->aux.capa = RARRAY(ary)->len * 2;
RARRAY 358 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->aux.capa);
RARRAY 358 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->aux.capa);
RARRAY 360 array.c return RARRAY(ary)->ptr[--RARRAY(ary)->len];
RARRAY 360 array.c return RARRAY(ary)->ptr[--RARRAY(ary)->len];
RARRAY 371 array.c shared->len = RARRAY(ary)->len;
RARRAY 372 array.c shared->ptr = RARRAY(ary)->ptr;
RARRAY 373 array.c shared->aux.capa = RARRAY(ary)->aux.capa;
RARRAY 374 array.c RARRAY(ary)->aux.shared = (VALUE)shared;
RARRAY 386 array.c if (RARRAY(ary)->len == 0) return Qnil;
RARRAY 387 array.c top = RARRAY(ary)->ptr[0];
RARRAY 389 array.c RARRAY(ary)->ptr++; /* shift ptr */
RARRAY 390 array.c RARRAY(ary)->len--;
RARRAY 400 array.c if (RARRAY(ary)->len == RARRAY(ary)->aux.capa) {
RARRAY 400 array.c if (RARRAY(ary)->len == RARRAY(ary)->aux.capa) {
RARRAY 401 array.c long capa_inc = RARRAY(ary)->aux.capa / 2;
RARRAY 405 array.c RARRAY(ary)->aux.capa += capa_inc;
RARRAY 406 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->aux.capa);
RARRAY 406 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->aux.capa);
RARRAY 410 array.c MEMMOVE(RARRAY(ary)->ptr + 1, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 410 array.c MEMMOVE(RARRAY(ary)->ptr + 1, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 410 array.c MEMMOVE(RARRAY(ary)->ptr + 1, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 412 array.c RARRAY(ary)->len++;
RARRAY 413 array.c RARRAY(ary)->ptr[0] = item;
RARRAY 424 array.c long len = RARRAY(ary)->len;
RARRAY 434 array.c MEMMOVE(RARRAY(ary)->ptr + argc, RARRAY(ary)->ptr, VALUE, len);
RARRAY 434 array.c MEMMOVE(RARRAY(ary)->ptr + argc, RARRAY(ary)->ptr, VALUE, len);
RARRAY 435 array.c MEMCPY(RARRAY(ary)->ptr, argv, VALUE, argc);
RARRAY 445 array.c if (RARRAY(ary)->len == 0) return Qnil;
RARRAY 448 array.c offset += RARRAY(ary)->len;
RARRAY 450 array.c if (offset < 0 || RARRAY(ary)->len <= offset) {
RARRAY 454 array.c return RARRAY(ary)->ptr[offset];
RARRAY 464 array.c if (beg > RARRAY(ary)->len) return Qnil;
RARRAY 467 array.c if (beg + len > RARRAY(ary)->len) {
RARRAY 468 array.c len = RARRAY(ary)->len - beg;
RARRAY 477 array.c RARRAY(ary2)->ptr = RARRAY(ary)->ptr + beg;
RARRAY 477 array.c RARRAY(ary2)->ptr = RARRAY(ary)->ptr + beg;
RARRAY 478 array.c RARRAY(ary2)->len = len;
RARRAY 479 array.c RARRAY(ary2)->aux.shared = RARRAY(ary)->aux.shared;
RARRAY 479 array.c RARRAY(ary2)->aux.shared = RARRAY(ary)->aux.shared;
RARRAY 498 array.c beg += RARRAY(ary)->len;
RARRAY 511 array.c switch (rb_range_beg_len(arg, &beg, &len, RARRAY(ary)->len, 0)) {
RARRAY 533 array.c if (RARRAY(ary)->len == 0) return Qnil;
RARRAY 534 array.c return RARRAY(ary)->ptr[0];
RARRAY 541 array.c if (RARRAY(ary)->len == 0) return Qnil;
RARRAY 542 array.c return RARRAY(ary)->ptr[RARRAY(ary)->len-1];
RARRAY 542 array.c return RARRAY(ary)->ptr[RARRAY(ary)->len-1];
RARRAY 558 array.c idx += RARRAY(ary)->len;
RARRAY 560 array.c if (idx < 0 || RARRAY(ary)->len <= idx) {
RARRAY 572 array.c return RARRAY(ary)->ptr[idx];
RARRAY 582 array.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 583 array.c if (rb_equal(RARRAY(ary)->ptr[i], val))
RARRAY 594 array.c long i = RARRAY(ary)->len;
RARRAY 597 array.c if (rb_equal(RARRAY(ary)->ptr[i], val))
RARRAY 645 array.c rlen = RARRAY(rpl)->len;
RARRAY 649 array.c beg += RARRAY(ary)->len;
RARRAY 651 array.c beg -= RARRAY(ary)->len;
RARRAY 655 array.c if (beg + len > RARRAY(ary)->len) {
RARRAY 656 array.c len = RARRAY(ary)->len - beg;
RARRAY 660 array.c if (beg >= RARRAY(ary)->len) {
RARRAY 662 array.c if (len >= RARRAY(ary)->aux.capa) {
RARRAY 663 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, len);
RARRAY 664 array.c RARRAY(ary)->aux.capa = len;
RARRAY 666 array.c rb_mem_clear(RARRAY(ary)->ptr + RARRAY(ary)->len, beg - RARRAY(ary)->len);
RARRAY 666 array.c rb_mem_clear(RARRAY(ary)->ptr + RARRAY(ary)->len, beg - RARRAY(ary)->len);
RARRAY 666 array.c rb_mem_clear(RARRAY(ary)->ptr + RARRAY(ary)->len, beg - RARRAY(ary)->len);
RARRAY 667 array.c MEMCPY(RARRAY(ary)->ptr + beg, RARRAY(rpl)->ptr, VALUE, rlen);
RARRAY 667 array.c MEMCPY(RARRAY(ary)->ptr + beg, RARRAY(rpl)->ptr, VALUE, rlen);
RARRAY 668 array.c RARRAY(ary)->len = len;
RARRAY 673 array.c if (beg + len > RARRAY(ary)->len) {
RARRAY 674 array.c len = RARRAY(ary)->len - beg;
RARRAY 677 array.c alen = RARRAY(ary)->len + rlen - len;
RARRAY 678 array.c if (alen >= RARRAY(ary)->aux.capa) {
RARRAY 679 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, alen);
RARRAY 680 array.c RARRAY(ary)->aux.capa = alen;
RARRAY 684 array.c MEMMOVE(RARRAY(ary)->ptr + beg + rlen, RARRAY(ary)->ptr + beg + len,
RARRAY 684 array.c MEMMOVE(RARRAY(ary)->ptr + beg + rlen, RARRAY(ary)->ptr + beg + len,
RARRAY 685 array.c VALUE, RARRAY(ary)->len - (beg + len));
RARRAY 686 array.c RARRAY(ary)->len = alen;
RARRAY 688 array.c MEMMOVE(RARRAY(ary)->ptr + beg, RARRAY(rpl)->ptr, VALUE, rlen);
RARRAY 688 array.c MEMMOVE(RARRAY(ary)->ptr + beg, RARRAY(rpl)->ptr, VALUE, rlen);
RARRAY 711 array.c if (rb_range_beg_len(argv[0], &beg, &len, RARRAY(ary)->len, 1)) {
RARRAY 736 array.c pos = RARRAY(ary)->len;
RARRAY 752 array.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 753 array.c rb_yield(RARRAY(ary)->ptr[i]);
RARRAY 764 array.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 774 array.c long len = RARRAY(ary)->len;
RARRAY 777 array.c rb_yield(RARRAY(ary)->ptr[len]);
RARRAY 786 array.c return LONG2NUM(RARRAY(ary)->len);
RARRAY 793 array.c if (RARRAY(ary)->len == 0)
RARRAY 802 array.c VALUE dup = rb_ary_new2(RARRAY(ary)->len);
RARRAY 805 array.c MEMCPY(RARRAY(dup)->ptr, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 805 array.c MEMCPY(RARRAY(dup)->ptr, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 805 array.c MEMCPY(RARRAY(dup)->ptr, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 806 array.c RARRAY(dup)->len = RARRAY(ary)->len;
RARRAY 806 array.c RARRAY(dup)->len = RARRAY(ary)->len;
RARRAY 828 array.c if (RARRAY(ary)->len == 0) return rb_str_new(0, 0);
RARRAY 831 array.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 832 array.c if (TYPE(RARRAY(ary)->ptr[i]) == T_STRING) {
RARRAY 833 array.c len += RSTRING(RARRAY(ary)->ptr[i])->len;
RARRAY 841 array.c len += RSTRING(sep)->len * (RARRAY(ary)->len - 1);
RARRAY 844 array.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 845 array.c tmp = RARRAY(ary)->ptr[i];
RARRAY 892 array.c if (RARRAY(ary)->len == 0) return rb_str_new(0, 0);
RARRAY 968 array.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 969 array.c s = rb_inspect(RARRAY(ary)->ptr[i]);
RARRAY 983 array.c if (RARRAY(ary)->len == 0) return rb_str_new2("[]");
RARRAY 1003 array.c if (RARRAY(ary)->len <= 1) return ary;
RARRAY 1005 array.c p1 = RARRAY(ary)->ptr;
RARRAY 1006 array.c p2 = p1 + RARRAY(ary)->len - 1; /* points last item */
RARRAY 1021 array.c if (RARRAY(ary)->len <= 1) return Qnil;
RARRAY 1078 array.c qsort(RARRAY(ary)->ptr, RARRAY(ary)->len, sizeof(VALUE),
RARRAY 1078 array.c qsort(RARRAY(ary)->ptr, RARRAY(ary)->len, sizeof(VALUE),
RARRAY 1096 array.c if (RARRAY(ary)->len <= 1) return ary;
RARRAY 1120 array.c return rb_ary_new4(RARRAY(ary)->len, RARRAY(ary)->ptr);
RARRAY 1120 array.c return rb_ary_new4(RARRAY(ary)->len, RARRAY(ary)->ptr);
RARRAY 1123 array.c len = RARRAY(ary)->len;
RARRAY 1126 array.c rb_ary_push(collect, rb_yield(RARRAY(ary)->ptr[i]));
RARRAY 1138 array.c for (i = 0; i < RARRAY(ary)->len; i++) {
RARRAY 1139 array.c RARRAY(ary)->ptr[i] = rb_yield(RARRAY(ary)->ptr[i]);
RARRAY 1139 array.c RARRAY(ary)->ptr[i] = rb_yield(RARRAY(ary)->ptr[i]);
RARRAY 1157 array.c result = rb_ary_new2(RARRAY(ary)->len);
RARRAY 1158 array.c for (i = 0; i < RARRAY(ary)->len; i++) {
RARRAY 1159 array.c if (RTEST(rb_yield(RARRAY(ary)->ptr[i]))) {
RARRAY 1160 array.c rb_ary_push(result, RARRAY(ary)->ptr[i]);
RARRAY 1181 array.c for (i1 = i2 = 0; i1 < RARRAY(ary)->len; i1++) {
RARRAY 1182 array.c if (rb_equal(RARRAY(ary)->ptr[i1], item)) continue;
RARRAY 1184 array.c RARRAY(ary)->ptr[i2] = RARRAY(ary)->ptr[i1];
RARRAY 1184 array.c RARRAY(ary)->ptr[i2] = RARRAY(ary)->ptr[i1];
RARRAY 1188 array.c if (RARRAY(ary)->len == i2) {
RARRAY 1195 array.c RARRAY(ary)->len = i2;
RARRAY 1196 array.c if (i2 * 2 < RARRAY(ary)->aux.capa &&
RARRAY 1197 array.c RARRAY(ary)->aux.capa > ARY_DEFAULT_SIZE) {
RARRAY 1198 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, i2 * 2);
RARRAY 1199 array.c RARRAY(ary)->aux.capa = i2 * 2;
RARRAY 1210 array.c long i, len = RARRAY(ary)->len;
RARRAY 1220 array.c del = RARRAY(ary)->ptr[pos];
RARRAY 1222 array.c RARRAY(ary)->ptr[pos] = RARRAY(ary)->ptr[i];
RARRAY 1222 array.c RARRAY(ary)->ptr[pos] = RARRAY(ary)->ptr[i];
RARRAY 1224 array.c RARRAY(ary)->len = pos;
RARRAY 1251 array.c pos = RARRAY(ary)->len + pos;
RARRAY 1258 array.c if (!FIXNUM_P(arg1) && rb_range_beg_len(arg1, &pos, &len, RARRAY(ary)->len, 1)) {
RARRAY 1272 array.c for (i1 = i2 = 0; i1 < RARRAY(ary)->len; i1++) {
RARRAY 1273 array.c if (RTEST(rb_yield(RARRAY(ary)->ptr[i1]))) continue;
RARRAY 1275 array.c RARRAY(ary)->ptr[i2] = RARRAY(ary)->ptr[i1];
RARRAY 1275 array.c RARRAY(ary)->ptr[i2] = RARRAY(ary)->ptr[i1];
RARRAY 1279 array.c if (RARRAY(ary)->len == i2) return Qnil;
RARRAY 1280 array.c RARRAY(ary)->len = i2;
RARRAY 1310 array.c if (RARRAY(copy)->ptr && !FL_TEST(copy, ELTS_SHARED))
RARRAY 1311 array.c free(RARRAY(copy)->ptr);
RARRAY 1312 array.c RARRAY(copy)->ptr = RARRAY(orig)->ptr;
RARRAY 1312 array.c RARRAY(copy)->ptr = RARRAY(orig)->ptr;
RARRAY 1313 array.c RARRAY(copy)->len = RARRAY(orig)->len;
RARRAY 1313 array.c RARRAY(copy)->len = RARRAY(orig)->len;
RARRAY 1314 array.c RARRAY(copy)->aux.shared = RARRAY(orig)->aux.shared;
RARRAY 1314 array.c RARRAY(copy)->aux.shared = RARRAY(orig)->aux.shared;
RARRAY 1325 array.c RARRAY(ary)->len = 0;
RARRAY 1326 array.c if (ARY_DEFAULT_SIZE * 2 < RARRAY(ary)->aux.capa) {
RARRAY 1327 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, ARY_DEFAULT_SIZE * 2);
RARRAY 1328 array.c RARRAY(ary)->aux.capa = ARY_DEFAULT_SIZE * 2;
RARRAY 1355 array.c len = RARRAY(ary)->len;
RARRAY 1358 array.c if (rb_range_beg_len(arg1, &beg, &len, RARRAY(ary)->len, 1)) {
RARRAY 1365 array.c beg = RARRAY(ary)->len + beg;
RARRAY 1368 array.c len = NIL_P(arg2) ? RARRAY(ary)->len - beg : NUM2LONG(arg2);
RARRAY 1373 array.c if (end > RARRAY(ary)->len) {
RARRAY 1374 array.c if (end >= RARRAY(ary)->aux.capa) {
RARRAY 1375 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, end);
RARRAY 1376 array.c RARRAY(ary)->aux.capa = end;
RARRAY 1378 array.c if (beg > RARRAY(ary)->len) {
RARRAY 1379 array.c rb_mem_clear(RARRAY(ary)->ptr + RARRAY(ary)->len, end - RARRAY(ary)->len);
RARRAY 1379 array.c rb_mem_clear(RARRAY(ary)->ptr + RARRAY(ary)->len, end - RARRAY(ary)->len);
RARRAY 1379 array.c rb_mem_clear(RARRAY(ary)->ptr + RARRAY(ary)->len, end - RARRAY(ary)->len);
RARRAY 1381 array.c RARRAY(ary)->len = end;
RARRAY 1383 array.c p = RARRAY(ary)->ptr + beg;
RARRAY 1407 array.c len = RARRAY(x)->len + RARRAY(y)->len;
RARRAY 1407 array.c len = RARRAY(x)->len + RARRAY(y)->len;
RARRAY 1409 array.c MEMCPY(RARRAY(z)->ptr, RARRAY(x)->ptr, VALUE, RARRAY(x)->len);
RARRAY 1409 array.c MEMCPY(RARRAY(z)->ptr, RARRAY(x)->ptr, VALUE, RARRAY(x)->len);
RARRAY 1409 array.c MEMCPY(RARRAY(z)->ptr, RARRAY(x)->ptr, VALUE, RARRAY(x)->len);
RARRAY 1410 array.c MEMCPY(RARRAY(z)->ptr + RARRAY(x)->len, RARRAY(y)->ptr, VALUE, RARRAY(y)->len);
RARRAY 1410 array.c MEMCPY(RARRAY(z)->ptr + RARRAY(x)->len, RARRAY(y)->ptr, VALUE, RARRAY(y)->len);
RARRAY 1410 array.c MEMCPY(RARRAY(z)->ptr + RARRAY(x)->len, RARRAY(y)->ptr, VALUE, RARRAY(y)->len);
RARRAY 1410 array.c MEMCPY(RARRAY(z)->ptr + RARRAY(x)->len, RARRAY(y)->ptr, VALUE, RARRAY(y)->len);
RARRAY 1411 array.c RARRAY(z)->len = len;
RARRAY 1420 array.c if (RARRAY(y)->len > 0) {
RARRAY 1421 array.c rb_ary_update(x, RARRAY(x)->len, 0, y);
RARRAY 1441 array.c len *= RARRAY(ary)->len;
RARRAY 1444 array.c RARRAY(ary2)->len = len;
RARRAY 1446 array.c for (i=0; i<len; i+=RARRAY(ary)->len) {
RARRAY 1447 array.c MEMCPY(RARRAY(ary2)->ptr+i, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 1447 array.c MEMCPY(RARRAY(ary2)->ptr+i, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 1447 array.c MEMCPY(RARRAY(ary2)->ptr+i, RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 1460 array.c p = RARRAY(ary)->ptr;
RARRAY 1461 array.c pend = p + RARRAY(ary)->len;
RARRAY 1465 array.c RARRAY(*p)->len > 0 &&
RARRAY 1466 array.c rb_equal(RARRAY(*p)->ptr[0], key))
RARRAY 1479 array.c p = RARRAY(ary)->ptr;
RARRAY 1480 array.c pend = p + RARRAY(ary)->len;
RARRAY 1484 array.c && RARRAY(*p)->len > 1
RARRAY 1485 array.c && rb_equal(RARRAY(*p)->ptr[1], value))
RARRAY 1500 array.c if (RARRAY(ary1)->len != RARRAY(ary2)->len) return Qfalse;
RARRAY 1500 array.c if (RARRAY(ary1)->len != RARRAY(ary2)->len) return Qfalse;
RARRAY 1501 array.c for (i=0; i<RARRAY(ary1)->len; i++) {
RARRAY 1502 array.c if (!rb_equal(RARRAY(ary1)->ptr[i], RARRAY(ary2)->ptr[i]))
RARRAY 1502 array.c if (!rb_equal(RARRAY(ary1)->ptr[i], RARRAY(ary2)->ptr[i]))
RARRAY 1515 array.c if (RARRAY(ary1)->len != RARRAY(ary2)->len) return Qfalse;
RARRAY 1515 array.c if (RARRAY(ary1)->len != RARRAY(ary2)->len) return Qfalse;
RARRAY 1516 array.c for (i=0; i<RARRAY(ary1)->len; i++) {
RARRAY 1517 array.c if (!rb_eql(RARRAY(ary1)->ptr[i], RARRAY(ary2)->ptr[i]))
RARRAY 1517 array.c if (!rb_eql(RARRAY(ary1)->ptr[i], RARRAY(ary2)->ptr[i]))
RARRAY 1530 array.c h = RARRAY(ary)->len;
RARRAY 1531 array.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 1533 array.c n = rb_hash(RARRAY(ary)->ptr[i]);
RARRAY 1546 array.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 1547 array.c if (rb_equal(RARRAY(ary)->ptr[i], item)) {
RARRAY 1561 array.c len = RARRAY(ary1)->len;
RARRAY 1562 array.c if (len > RARRAY(ary2)->len) {
RARRAY 1563 array.c len = RARRAY(ary2)->len;
RARRAY 1566 array.c VALUE v = rb_funcall(RARRAY(ary1)->ptr[i], id_cmp, 1, RARRAY(ary2)->ptr[i]);
RARRAY 1566 array.c VALUE v = rb_funcall(RARRAY(ary1)->ptr[i], id_cmp, 1, RARRAY(ary2)->ptr[i]);
RARRAY 1571 array.c len = RARRAY(ary1)->len - RARRAY(ary2)->len;
RARRAY 1571 array.c len = RARRAY(ary1)->len - RARRAY(ary2)->len;
RARRAY 1586 array.c for (i=0; i<RARRAY(ary1)->len; i++) {
RARRAY 1587 array.c if (rb_ary_includes(ary2, RARRAY(ary1)->ptr[i])) continue;
RARRAY 1588 array.c if (rb_ary_includes(ary3, RARRAY(ary1)->ptr[i])) continue;
RARRAY 1589 array.c rb_ary_push(ary3, RARRAY(ary1)->ptr[i]);
RARRAY 1601 array.c for (i=0; i<RARRAY(ary1)->len; i++) {
RARRAY 1602 array.c rb_hash_aset(hash, RARRAY(ary1)->ptr[i], Qtrue);
RARRAY 1605 array.c for (i=0; i<RARRAY(ary2)->len; i++) {
RARRAY 1606 array.c rb_hash_aset(hash, RARRAY(ary2)->ptr[i], Qtrue);
RARRAY 1620 array.c ary3 = rb_ary_new2(RARRAY(ary1)->len < RARRAY(ary2)->len ?
RARRAY 1620 array.c ary3 = rb_ary_new2(RARRAY(ary1)->len < RARRAY(ary2)->len ?
RARRAY 1621 array.c RARRAY(ary1)->len : RARRAY(ary2)->len);
RARRAY 1621 array.c RARRAY(ary1)->len : RARRAY(ary2)->len);
RARRAY 1624 array.c for (i=0; i<RARRAY(ary1)->len; i++) {
RARRAY 1625 array.c VALUE v = RARRAY(ary1)->ptr[i];
RARRAY 1627 array.c rb_ary_push(ary3, RARRAY(ary1)->ptr[i]);
RARRAY 1643 array.c ary3 = rb_ary_new2(RARRAY(ary1)->len+RARRAY(ary2)->len);
RARRAY 1643 array.c ary3 = rb_ary_new2(RARRAY(ary1)->len+RARRAY(ary2)->len);
RARRAY 1646 array.c for (i=0; i<RARRAY(ary1)->len; i++) {
RARRAY 1647 array.c v = RARRAY(ary1)->ptr[i];
RARRAY 1649 array.c rb_ary_push(ary3, RARRAY(ary1)->ptr[i]);
RARRAY 1652 array.c for (i=0; i<RARRAY(ary2)->len; i++) {
RARRAY 1653 array.c v = RARRAY(ary2)->ptr[i];
RARRAY 1655 array.c rb_ary_push(ary3, RARRAY(ary2)->ptr[i]);
RARRAY 1672 array.c if (RARRAY(ary)->len == RHASH(hash)->tbl->num_entries) {
RARRAY 1675 array.c p = q = RARRAY(ary)->ptr;
RARRAY 1676 array.c end = p + RARRAY(ary)->len;
RARRAY 1684 array.c RARRAY(ary)->len = (q - RARRAY(ary)->ptr);
RARRAY 1684 array.c RARRAY(ary)->len = (q - RARRAY(ary)->ptr);
RARRAY 1705 array.c p = t = RARRAY(ary)->ptr;
RARRAY 1706 array.c end = p + RARRAY(ary)->len;
RARRAY 1712 array.c if (RARRAY(ary)->len == (p - RARRAY(ary)->ptr)) {
RARRAY 1712 array.c if (RARRAY(ary)->len == (p - RARRAY(ary)->ptr)) {
RARRAY 1715 array.c RARRAY(ary)->len = RARRAY(ary)->aux.capa = (p - RARRAY(ary)->ptr);
RARRAY 1715 array.c RARRAY(ary)->len = RARRAY(ary)->aux.capa = (p - RARRAY(ary)->ptr);
RARRAY 1715 array.c RARRAY(ary)->len = RARRAY(ary)->aux.capa = (p - RARRAY(ary)->ptr);
RARRAY 1716 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 1716 array.c REALLOC_N(RARRAY(ary)->ptr, VALUE, RARRAY(ary)->len);
RARRAY 1737 array.c p = RARRAY(ary)->ptr;
RARRAY 1738 array.c pend = p + RARRAY(ary)->len;
RARRAY 1755 array.c long n, lim = idx + RARRAY(ary2)->len;
RARRAY 1764 array.c if (TYPE(RARRAY(ary)->ptr[i]) == T_ARRAY) {
RARRAY 1765 array.c n = flatten(ary, i, RARRAY(ary)->ptr[i], memo);
RARRAY 1784 array.c while (i<RARRAY(ary)->len) {
RARRAY 1785 array.c VALUE ary2 = RARRAY(ary)->ptr[i];
RARRAY 539 class.c p = q = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len;
RARRAY 539 class.c p = q = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len;
RARRAY 547 class.c RARRAY(ary)->len = q - RARRAY(ary)->ptr;
RARRAY 547 class.c RARRAY(ary)->len = q - RARRAY(ary)->ptr;
RARRAY 611 class.c p = q = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len;
RARRAY 611 class.c p = q = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len;
RARRAY 619 class.c RARRAY(ary)->len = q - RARRAY(ary)->ptr;
RARRAY 619 class.c RARRAY(ary)->len = q - RARRAY(ary)->ptr;
RARRAY 266 enum.c retval = rb_funcall(RARRAY(*a)->ptr[0], id_cmp, 1, RARRAY(*b)->ptr[0]);
RARRAY 266 enum.c retval = rb_funcall(RARRAY(*a)->ptr[0], id_cmp, 1, RARRAY(*b)->ptr[0]);
RARRAY 277 enum.c ary = rb_ary_new2((TYPE(obj) == T_ARRAY) ? RARRAY(obj)->len : 2000);
RARRAY 279 enum.c if (RARRAY(ary)->len > 1) {
RARRAY 280 enum.c qsort(RARRAY(ary)->ptr, RARRAY(ary)->len, sizeof(VALUE), sort_by_cmp);
RARRAY 280 enum.c qsort(RARRAY(ary)->ptr, RARRAY(ary)->len, sizeof(VALUE), sort_by_cmp);
RARRAY 282 enum.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 283 enum.c VALUE e = RARRAY(ary)->ptr[i];
RARRAY 284 enum.c RARRAY(ary)->ptr[i] = RARRAY(e)->ptr[1];
RARRAY 284 enum.c RARRAY(ary)->ptr[i] = RARRAY(e)->ptr[1];
RARRAY 391 error.c for (i=0;i<RARRAY(bt)->len;i++) {
RARRAY 392 error.c if (TYPE(RARRAY(bt)->ptr[i]) != T_STRING) {
RARRAY 971 eval.c else if (RARRAY(errat)->len == 0) {
RARRAY 975 eval.c VALUE mesg = RARRAY(errat)->ptr[0];
RARRAY 1032 eval.c struct RArray *ep = RARRAY(errat);
RARRAY 1038 eval.c ep = RARRAY(errat);
RARRAY 1435 eval.c val = rb_funcall2(cmd, rb_intern("call"), RARRAY(arg)->len, RARRAY(arg)->ptr);
RARRAY 1435 eval.c val = rb_funcall2(cmd, rb_intern("call"), RARRAY(arg)->len, RARRAY(arg)->ptr);
RARRAY 1806 eval.c argc = RARRAY(args)->len;\
RARRAY 1808 eval.c MEMCPY(argv, RARRAY(args)->ptr, VALUE, argc);\
RARRAY 2146 eval.c if (RARRAY(v)->len > 1) return v;
RARRAY 2162 eval.c if (RARRAY(v)->len == 0) {
RARRAY 2165 eval.c if (RARRAY(v)->len == 1) {
RARRAY 2166 eval.c return RARRAY(v)->ptr[0];
RARRAY 2178 eval.c if (RARRAY(v)->len == 0) {
RARRAY 2181 eval.c if (RARRAY(v)->len == 1) {
RARRAY 2182 eval.c return RARRAY(v)->ptr[0];
RARRAY 2209 eval.c if (RARRAY(v)->len == 0) {
RARRAY 2212 eval.c if (RARRAY(v)->len == 1 && TYPE(RARRAY(v)->ptr[0]) != T_ARRAY) {
RARRAY 2212 eval.c if (RARRAY(v)->len == 1 && TYPE(RARRAY(v)->ptr[0]) != T_ARRAY) {
RARRAY 2213 eval.c return RARRAY(v)->ptr[0];
RARRAY 2355 eval.c for (i=0; i<RARRAY(v)->len; i++) {
RARRAY 2356 eval.c if (RTEST(RARRAY(v)->ptr[i])) {
RARRAY 2398 eval.c for (i=0; i<RARRAY(v)->len; i++) {
RARRAY 2399 eval.c if (RTEST(rb_funcall2(RARRAY(v)->ptr[i], eqq, 1, &val))){
RARRAY 3090 eval.c RARRAY(ary)->ptr[i++] = rb_eval(self, node->nd_head);
RARRAY 3091 eval.c RARRAY(ary)->len = i;
RARRAY 3797 eval.c if (pcall && RARRAY(val)->len != 0) {
RARRAY 3799 eval.c RARRAY(val)->len);
RARRAY 3803 eval.c if (TYPE(val) == T_ARRAY && RARRAY(val)->len != 0) {
RARRAY 3805 eval.c RARRAY(val)->len);
RARRAY 3930 eval.c len = RARRAY(val)->len;
RARRAY 3933 eval.c assign(self, list->nd_head, RARRAY(val)->ptr[i], pcall);
RARRAY 3942 eval.c assign(self, node->nd_args, rb_ary_new4(len-i, RARRAY(val)->ptr+i), pcall);
RARRAY 4040 eval.c RARRAY(args)->len, RARRAY(args)->ptr, 0);
RARRAY 4040 eval.c RARRAY(args)->len, RARRAY(args)->ptr, 0);
RARRAY 4772 eval.c argc = RARRAY(args)->len; /* Assigns LONG, but argc is INT */
RARRAY 4774 eval.c MEMCPY(argv, RARRAY(args)->ptr, VALUE, argc);
RARRAY 4951 eval.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 4952 eval.c printf("\tfrom %s\n", RSTRING(RARRAY(ary)->ptr[i])->ptr);
RARRAY 5112 eval.c err = rb_str_dup(RARRAY(errat)->ptr[0]);
RARRAY 5455 eval.c for (i = 0; i < RARRAY(rb_features)->len; ++i) {
RARRAY 5456 eval.c v = RARRAY(rb_features)->ptr[i];
RARRAY 7073 eval.c return method_call(RARRAY(args)->len, RARRAY(args)->ptr, method);
RARRAY 7073 eval.c return method_call(RARRAY(args)->len, RARRAY(args)->ptr, method);
RARRAY 8257 eval.c if (TYPE(oldbt) == T_ARRAY && RARRAY(oldbt)->len > 0) {
RARRAY 91 ext/Win32API/Win32API.c ptr = RARRAY(import)->ptr;
RARRAY 92 ext/Win32API/Win32API.c for (i = 0, len = RARRAY(import)->len; i < len; i++) {
RARRAY 200 ext/Win32API/Win32API.c nimport = RARRAY(obj_import)->len;
RARRAY 355 ext/dbm/dbm.c for (i = 0; i < RARRAY(ary)->len; i++) {
RARRAY 356 ext/dbm/dbm.c keystr = RARRAY(ary)->ptr[i];
RARRAY 364 ext/dbm/dbm.c if (n > 0) dbmp->di_size = n - RARRAY(ary)->len;
RARRAY 426 ext/dbm/dbm.c if (RARRAY(pair)->len < 2) {
RARRAY 429 ext/dbm/dbm.c fdbm_store(dbm, RARRAY(pair)->ptr[0], RARRAY(pair)->ptr[1]);
RARRAY 429 ext/dbm/dbm.c fdbm_store(dbm, RARRAY(pair)->ptr[0], RARRAY(pair)->ptr[1]);
RARRAY 232 ext/dl/dl.c len = RARRAY(v)->len;
RARRAY 260 ext/dl/dl.c len = RARRAY(v)->len;
RARRAY 288 ext/dl/dl.c len = RARRAY(v)->len;
RARRAY 317 ext/dl/dl.c len = RARRAY(v)->len;
RARRAY 346 ext/dl/dl.c len = RARRAY(v)->len;
RARRAY 375 ext/dl/dl.c len = RARRAY(v)->len;
RARRAY 404 ext/dl/dl.c len = RARRAY(v)->len;
RARRAY 450 ext/dl/dl.c len = RARRAY(v)->len;
RARRAY 551 ext/dl/ptr.c num = RARRAY(rest)->len;
RARRAY 450 ext/gdbm/gdbm.c for (i = 0; i < RARRAY(ary)->len; i++)
RARRAY 451 ext/gdbm/gdbm.c rb_gdbm_delete(obj, RARRAY(ary)->ptr[i]);
RARRAY 453 ext/gdbm/gdbm.c if (n > 0) dbmp->di_size = n - RARRAY(ary)->len;
RARRAY 531 ext/gdbm/gdbm.c if (RARRAY(pair)->len < 2) {
RARRAY 534 ext/gdbm/gdbm.c fgdbm_store(dbm, RARRAY(pair)->ptr[0], RARRAY(pair)->ptr[1]);
RARRAY 534 ext/gdbm/gdbm.c fgdbm_store(dbm, RARRAY(pair)->ptr[0], RARRAY(pair)->ptr[1]);
RARRAY 98 ext/racc/cparse/cparse.c ((0 <= idx && idx < RARRAY(s)->len) ? RARRAY(s)->ptr[idx] : Qnil)
RARRAY 98 ext/racc/cparse/cparse.c ((0 <= idx && idx < RARRAY(s)->len) ? RARRAY(s)->ptr[idx] : Qnil)
RARRAY 114 ext/racc/cparse/cparse.c if (len > RARRAY(stack)->len) len = RARRAY(stack)->len;
RARRAY 114 ext/racc/cparse/cparse.c if (len > RARRAY(stack)->len) len = RARRAY(stack)->len;
RARRAY 115 ext/racc/cparse/cparse.c return rb_ary_new4(len, RARRAY(stack)->ptr + RARRAY(stack)->len - len);
RARRAY 115 ext/racc/cparse/cparse.c return rb_ary_new4(len, RARRAY(stack)->ptr + RARRAY(stack)->len - len);
RARRAY 131 ext/racc/cparse/cparse.c #define PUSH(s, i) rb_ary_store(s, RARRAY(s)->len, i)
RARRAY 134 ext/racc/cparse/cparse.c ((RARRAY(s)->len > 0) ? RARRAY(s)->ptr[RARRAY(s)->len - 1] : Qnil)
RARRAY 134 ext/racc/cparse/cparse.c ((RARRAY(s)->len > 0) ? RARRAY(s)->ptr[RARRAY(s)->len - 1] : Qnil)
RARRAY 134 ext/racc/cparse/cparse.c ((RARRAY(s)->len > 0) ? RARRAY(s)->ptr[RARRAY(s)->len - 1] : Qnil)
RARRAY 341 ext/racc/cparse/cparse.c if (!(13 <= RARRAY(arg)->len && RARRAY(arg)->len <= 14))
RARRAY 341 ext/racc/cparse/cparse.c if (!(13 <= RARRAY(arg)->len && RARRAY(arg)->len <= 14))
RARRAY 342 ext/racc/cparse/cparse.c rb_raise(RaccBug, "[Racc Bug] wrong arg.size %ld", RARRAY(arg)->len);
RARRAY 343 ext/racc/cparse/cparse.c v->action_table = check_array(RARRAY(arg)->ptr[ 0]);
RARRAY 344 ext/racc/cparse/cparse.c v->action_check = check_array(RARRAY(arg)->ptr[ 1]);
RARRAY 345 ext/racc/cparse/cparse.c v->action_default = check_array(RARRAY(arg)->ptr[ 2]);
RARRAY 346 ext/racc/cparse/cparse.c v->action_pointer = check_array(RARRAY(arg)->ptr[ 3]);
RARRAY 347 ext/racc/cparse/cparse.c v->goto_table = check_array(RARRAY(arg)->ptr[ 4]);
RARRAY 348 ext/racc/cparse/cparse.c v->goto_check = check_array(RARRAY(arg)->ptr[ 5]);
RARRAY 349 ext/racc/cparse/cparse.c v->goto_default = check_array(RARRAY(arg)->ptr[ 6]);
RARRAY 350 ext/racc/cparse/cparse.c v->goto_pointer = check_array(RARRAY(arg)->ptr[ 7]);
RARRAY 351 ext/racc/cparse/cparse.c v->nt_base = check_num (RARRAY(arg)->ptr[ 8]);
RARRAY 352 ext/racc/cparse/cparse.c v->reduce_table = check_array(RARRAY(arg)->ptr[ 9]);
RARRAY 353 ext/racc/cparse/cparse.c v->token_table = check_hash (RARRAY(arg)->ptr[10]);
RARRAY 354 ext/racc/cparse/cparse.c v->shift_n = check_num (RARRAY(arg)->ptr[11]);
RARRAY 355 ext/racc/cparse/cparse.c v->reduce_n = check_num (RARRAY(arg)->ptr[12]);
RARRAY 356 ext/racc/cparse/cparse.c if (RARRAY(arg)->len > 13) {
RARRAY 357 ext/racc/cparse/cparse.c v->use_result_var = RTEST(RARRAY(arg)->ptr[13]);
RARRAY 399 ext/racc/cparse/cparse.c if (RARRAY(block_args)->len != 2) {
RARRAY 404 ext/racc/cparse/cparse.c RARRAY(block_args)->len);
RARRAY 543 ext/racc/cparse/cparse.c v->retval = RARRAY(v->vstack)->ptr[0];
RARRAY 603 ext/racc/cparse/cparse.c if (RARRAY(v->state)->len == 0) {
RARRAY 685 ext/racc/cparse/cparse.c reduce_len = RARRAY(v->reduce_table)->ptr[v->ruleno];
RARRAY 686 ext/racc/cparse/cparse.c reduce_to = RARRAY(v->reduce_table)->ptr[v->ruleno+1];
RARRAY 687 ext/racc/cparse/cparse.c method_id = RARRAY(v->reduce_table)->ptr[v->ruleno+2];
RARRAY 702 ext/racc/cparse/cparse.c tmp = RARRAY(tmp_v)->ptr[0];
RARRAY 705 ext/racc/cparse/cparse.c tmp = RARRAY(v->vstack)->ptr[ RARRAY(v->vstack)->len - len ];
RARRAY 705 ext/racc/cparse/cparse.c tmp = RARRAY(v->vstack)->ptr[ RARRAY(v->vstack)->len - len ];
RARRAY 734 ext/racc/cparse/cparse.c if (RARRAY(v->state)->len == 0)
RARRAY 127 ext/readline/readline.c matches = RARRAY(ary)->len;
RARRAY 132 ext/readline/readline.c temp = rb_obj_as_string(RARRAY(ary)->ptr[i]);
RARRAY 615 ext/readline/readline.c if (RARRAY(result)->len >= 2)
RARRAY 642 ext/readline/readline.c if (RARRAY(result)->len >= 2)
RARRAY 345 ext/sdbm/init.c for (i = 0; i < RARRAY(ary)->len; i++) {
RARRAY 346 ext/sdbm/init.c keystr = RARRAY(ary)->ptr[i];
RARRAY 354 ext/sdbm/init.c if (n > 0) dbmp->di_size = n - RARRAY(ary)->len;
RARRAY 418 ext/sdbm/init.c if (RARRAY(pair)->len < 2) {
RARRAY 421 ext/sdbm/init.c fsdbm_store(dbm, RARRAY(pair)->ptr[0], RARRAY(pair)->ptr[1]);
RARRAY 421 ext/sdbm/init.c fsdbm_store(dbm, RARRAY(pair)->ptr[0], RARRAY(pair)->ptr[1]);
RARRAY 2234 ext/socket/socket.c if (RARRAY(sa)->len == 3) {
RARRAY 2235 ext/socket/socket.c af = RARRAY(sa)->ptr[0];
RARRAY 2236 ext/socket/socket.c port = RARRAY(sa)->ptr[1];
RARRAY 2237 ext/socket/socket.c host = RARRAY(sa)->ptr[2];
RARRAY 2239 ext/socket/socket.c else if (RARRAY(sa)->len >= 4) {
RARRAY 2240 ext/socket/socket.c af = RARRAY(sa)->ptr[0];
RARRAY 2241 ext/socket/socket.c port = RARRAY(sa)->ptr[1];
RARRAY 2242 ext/socket/socket.c host = RARRAY(sa)->ptr[3];
RARRAY 2244 ext/socket/socket.c host = RARRAY(sa)->ptr[2];
RARRAY 2256 ext/socket/socket.c RARRAY(sa)->len);
RARRAY 640 ext/win32ole/win32ole.c psab[i].cElements = RARRAY(val1)->len;
RARRAY 1891 ext/win32ole/win32ole.c dispParams.cArgs = RARRAY(args)->len;
RARRAY 1922 ext/win32ole/win32ole.c rgsabound[0].cElements = RARRAY(param)->len;
RARRAY 4638 ext/win32ole/win32ole.c len = RARRAY(ary)->len;
RARRAY 4732 ext/win32ole/win32ole.c for(i = 0; i < RARRAY(ary)->len && (unsigned int) i < pdispparams->cArgs; i++) {
RARRAY 90 file.c struct RArray *args = RARRAY(vargs);
RARRAY 2475 file.c for (i=0;i<RARRAY(rb_load_path)->len;i++) {
RARRAY 2476 file.c VALUE str = RARRAY(rb_load_path)->ptr[i];
RARRAY 2535 file.c for (i=0;i<RARRAY(rb_load_path)->len;i++) {
RARRAY 2536 file.c VALUE str = RARRAY(rb_load_path)->ptr[i];
RARRAY 1410 gc.c for (i=0; i<RARRAY(finalizers)->len; i++) {
RARRAY 1411 gc.c args[0] = RARRAY(finalizers)->ptr[i];
RARRAY 1415 gc.c for (i=0; i<RARRAY(table)->len; i++) {
RARRAY 1416 gc.c args[0] = RARRAY(table)->ptr[i];
RARRAY 393 hash.c RARRAY(indexes)->ptr[i] = rb_hash_aref(hash, argv[i]);
RARRAY 394 hash.c RARRAY(indexes)->len++;
RARRAY 1318 hash.c ptr = RARRAY(keys)->ptr;
RARRAY 1319 hash.c len = RARRAY(keys)->len;
RARRAY 1541 hash.c RARRAY(indexes)->ptr[i] = rb_tainted_str_new2(v);
RARRAY 1544 hash.c RARRAY(indexes)->ptr[i] = Qnil;
RARRAY 1546 hash.c RARRAY(indexes)->len = i+1;
RARRAY 2482 io.c for (i=0; i<RARRAY(ary)->len; i++) {
RARRAY 2483 io.c tmp = RARRAY(ary)->ptr[i];
RARRAY 2807 io.c if (RARRAY(rb_argv)->len > 0) {
RARRAY 2823 io.c if (RARRAY(rb_argv)->len > 0) {
RARRAY 3083 io.c for (i=0; i<RARRAY(read)->len; i++) {
RARRAY 3084 io.c GetOpenFile(rb_io_get_io(RARRAY(read)->ptr[i]), fptr);
RARRAY 3104 io.c for (i=0; i<RARRAY(write)->len; i++) {
RARRAY 3105 io.c GetOpenFile(rb_io_get_io(RARRAY(write)->ptr[i]), fptr);
RARRAY 3121 io.c for (i=0; i<RARRAY(except)->len; i++) {
RARRAY 3122 io.c GetOpenFile(rb_io_get_io(RARRAY(except)->ptr[i]), fptr);
RARRAY 3150 io.c list = RARRAY(res)->ptr[0];
RARRAY 3151 io.c for (i=0; i< RARRAY(read)->len; i++) {
RARRAY 3152 io.c GetOpenFile(rb_io_get_io(RARRAY(read)->ptr[i]), fptr);
RARRAY 3155 io.c rb_ary_push(list, RARRAY(read)->ptr[i]);
RARRAY 3161 io.c list = RARRAY(res)->ptr[1];
RARRAY 3162 io.c for (i=0; i< RARRAY(write)->len; i++) {
RARRAY 3163 io.c GetOpenFile(rb_io_get_io(RARRAY(write)->ptr[i]), fptr);
RARRAY 3165 io.c rb_ary_push(list, RARRAY(write)->ptr[i]);
RARRAY 3168 io.c rb_ary_push(list, RARRAY(write)->ptr[i]);
RARRAY 3174 io.c list = RARRAY(res)->ptr[2];
RARRAY 3175 io.c for (i=0; i< RARRAY(except)->len; i++) {
RARRAY 3176 io.c GetOpenFile(rb_io_get_io(RARRAY(except)->ptr[i]), fptr);
RARRAY 3178 io.c rb_ary_push(list, RARRAY(except)->ptr[i]);
RARRAY 3181 io.c rb_ary_push(list, RARRAY(except)->ptr[i]);
RARRAY 469 marshal.c long len = RARRAY(obj)->len;
RARRAY 470 marshal.c VALUE *ptr = RARRAY(obj)->ptr;
RARRAY 513 marshal.c w_symbol(SYM2ID(RARRAY(mem)->ptr[i]), arg);
RARRAY 1036 marshal.c if (RARRAY(mem)->ptr[i] != ID2SYM(slot)) {
RARRAY 1040 marshal.c rb_id2name(SYM2ID(RARRAY(mem)->ptr[i])));
RARRAY 74 numeric.c if (TYPE(ary) != T_ARRAY || RARRAY(ary)->len != 2) {
RARRAY 78 numeric.c *x = RARRAY(ary)->ptr[0];
RARRAY 79 numeric.c *y = RARRAY(ary)->ptr[1];
RARRAY 352 pack.c items = RARRAY(ary)->len;
RARRAY 355 pack.c #define THISFROM RARRAY(ary)->ptr[idx]
RARRAY 356 pack.c #define NEXTFROM (items-- > 0 ? RARRAY(ary)->ptr[idx++] : (rb_raise(rb_eArgError, toofew),0))
RARRAY 863 pack.c c = NUM2INT(RARRAY(from)->ptr[1]) | 0x80; /* mod */
RARRAY 865 pack.c from = RARRAY(from)->ptr[0]; /* div */
RARRAY 1652 pack.c p = RARRAY(a)->ptr;
RARRAY 1653 pack.c pend = p + RARRAY(a)->len;
RARRAY 1694 pack.c p = RARRAY(a)->ptr;
RARRAY 1695 pack.c pend = p + RARRAY(a)->len;
RARRAY 690 process.c if (RARRAY(argv[0])->len != 2) {
RARRAY 693 process.c prog = RARRAY(argv[0])->ptr[0];
RARRAY 694 process.c argv[0] = RARRAY(argv[0])->ptr[1];
RARRAY 821 process.c if (RARRAY(argv[0])->len != 2) {
RARRAY 824 process.c argv[0] = RARRAY(argv[0])->ptr[0];
RARRAY 844 process.c if (RARRAY(argv[0])->len != 2) {
RARRAY 847 process.c argv[0] = RARRAY(argv[0])->ptr[0];
RARRAY 870 process.c if (RARRAY(argv[0])->len != 2) {
RARRAY 873 process.c prog = RARRAY(argv[0])->ptr[0];
RARRAY 874 process.c argv[0] = RARRAY(argv[0])->ptr[1];
RARRAY 895 process.c if (RARRAY(argv[0])->len != 2) {
RARRAY 898 process.c argv[0] = RARRAY(argv[0])->ptr[0];
RARRAY 921 process.c if (RARRAY(argv[0])->len != 2) {
RARRAY 924 process.c prog = RARRAY(argv[0])->ptr[0];
RARRAY 925 process.c argv[0] = RARRAY(argv[0])->ptr[1];
RARRAY 346 ruby.c n = RARRAY(rb_argv)->len;
RARRAY 347 ruby.c args = RARRAY(rb_argv)->ptr;
RARRAY 367 ruby.c n = RARRAY(rb_argv)->len - n;
RARRAY 389 string.c argv = ALLOCA_N(VALUE, RARRAY(arg)->len + 1);
RARRAY 391 string.c MEMCPY(argv+1, RARRAY(arg)->ptr, VALUE, RARRAY(arg)->len);
RARRAY 391 string.c MEMCPY(argv+1, RARRAY(arg)->ptr, VALUE, RARRAY(arg)->len);
RARRAY 392 string.c return rb_f_sprintf(RARRAY(arg)->len+1, argv);
RARRAY 2561 string.c while (RARRAY(result)->len > 0 &&
RARRAY 2562 string.c RSTRING(RARRAY(result)->ptr[RARRAY(result)->len-1])->len == 0)
RARRAY 2562 string.c RSTRING(RARRAY(result)->ptr[RARRAY(result)->len-1])->len == 0)
RARRAY 47 struct.c ary = rb_ary_new2(RARRAY(member)->len);
RARRAY 48 struct.c p = RARRAY(member)->ptr; pend = p + RARRAY(member)->len;
RARRAY 48 struct.c p = RARRAY(member)->ptr; pend = p + RARRAY(member)->len;
RARRAY 77 struct.c for (i=0; i<RARRAY(member)->len; i++) {
RARRAY 78 struct.c if (RARRAY(member)->ptr[i] == slot) {
RARRAY 138 struct.c for (i=0; i<RARRAY(member)->len; i++) {
RARRAY 139 struct.c slot = RARRAY(member)->ptr[i];
RARRAY 169 struct.c rb_iv_set(nstr, "__size__", LONG2NUM(RARRAY(member)->len));
RARRAY 176 struct.c for (i=0; i< RARRAY(member)->len; i++) {
RARRAY 177 struct.c ID id = SYM2ID(RARRAY(member)->ptr[i]);
RARRAY 237 struct.c for (i=0; i<RARRAY(rest)->len; i++) {
RARRAY 238 struct.c id = rb_to_id(RARRAY(rest)->ptr[i]);
RARRAY 239 struct.c RARRAY(rest)->ptr[i] = ID2SYM(id);
RARRAY 262 struct.c if (n < RARRAY(values)->len) {
RARRAY 265 struct.c MEMCPY(RSTRUCT(self)->ptr, RARRAY(values)->ptr, VALUE, RARRAY(values)->len);
RARRAY 265 struct.c MEMCPY(RSTRUCT(self)->ptr, RARRAY(values)->ptr, VALUE, RARRAY(values)->len);
RARRAY 266 struct.c if (n > RARRAY(values)->len) {
RARRAY 267 struct.c rb_mem_clear(RSTRUCT(self)->ptr+RARRAY(values)->len,
RARRAY 268 struct.c n-RARRAY(values)->len);
RARRAY 296 struct.c return rb_class_new_instance(RARRAY(values)->len, RARRAY(values)->ptr, klass);
RARRAY 296 struct.c return rb_class_new_instance(RARRAY(values)->len, RARRAY(values)->ptr, klass);
RARRAY 348 struct.c rb_yield(rb_assoc_new(RARRAY(member)->ptr[i], RSTRUCT(s)->ptr[i]));
RARRAY 388 struct.c slot = RARRAY(member)->ptr[i];
RARRAY 452 struct.c len = RARRAY(member)->len;
RARRAY 454 struct.c if (SYM2ID(RARRAY(member)->ptr[i]) == id) {
RARRAY 497 struct.c len = RARRAY(member)->len;
RARRAY 499 struct.c if (SYM2ID(RARRAY(member)->ptr[i]) == id) {