ruby-106/ruby/array.c

970  *     args = [ "-m", "-q", "filename" ]
971  *     args.shift     #=> "-m"
972  *     args           #=> ["-q", "filename"]
974  *     args = [ "-m", "-q", "filename" ]
975  *     args.shift(2)  #=> ["-m", "-q"]
976  *     args           #=> ["filename"]
1854 		VALUE args[4];
1856 		args[0] = val;
1857 		args[1] = sep;
1858 		args[2] = result;
1859 		args[3] = (VALUE)first;
1860 		rb_exec_recursive(recursive_join, obj, (VALUE)args);
2927 ary_reject(VALUE orig, VALUE result)
2931     for (i = 0; i < RARRAY_LEN(orig); i++) {
2932 	VALUE v = RARRAY_PTR(orig)[i];
3034 take_i(VALUE val, VALUE *args, int argc, VALUE *argv)
3036     if (args[1]-- == 0) rb_iter_break();
3038     rb_ary_push(args[0], val);
3046     VALUE args[2];
3050     args[0] = result; args[1] = (VALUE)n;
3051     if (rb_check_block_call(obj, idEach, 0, 0, take_i, (VALUE)args) == Qundef)
3168 rb_ary_replace(VALUE copy, VALUE orig)
3171     orig = to_ary(orig);
3172     if (copy == orig) return copy;
3174     if (RARRAY_LEN(orig) <= RARRAY_EMBED_LEN_MAX) {
3186         ptr = RARRAY_PTR(orig);
3187         MEMCPY(RARRAY_PTR(copy), ptr, VALUE, RARRAY_LEN(orig));
3191         ARY_SET_LEN(copy, RARRAY_LEN(orig));
3194         VALUE shared = ary_make_shared(orig);
3202         ARY_SET_PTR(copy, RARRAY_PTR(orig));
3203         ARY_SET_LEN(copy, RARRAY_LEN(orig));
4480 rb_ary_cycle_size(VALUE self, VALUE args)
4484     if (args && (RARRAY_LEN(args) > 0)) {
4485 	n = RARRAY_PTR(args)[0];
4617 rb_ary_permutation_size(VALUE ary, VALUE args)
4620     long k = (args && (RARRAY_LEN(args) > 0)) ? NUM2LONG(RARRAY_PTR(args)[0]) : n;
4694 rb_ary_combination_size(VALUE ary, VALUE args)
4697     long k = NUM2LONG(RARRAY_PTR(args)[0]);
4817 rb_ary_repeated_permutation_size(VALUE ary, VALUE args)
4820     long k = NUM2LONG(RARRAY_PTR(args)[0]);
4910 rb_ary_repeated_combination_size(VALUE ary, VALUE args)
4913     long k = NUM2LONG(RARRAY_PTR(args)[0]);