25 #define numberof(array) (int)(sizeof(array) / sizeof((array)[0]))
31 #define ARY_DEFAULT_SIZE 16
32 #define ARY_MAX_SIZE (LONG_MAX / (int)sizeof(VALUE))
50 # define ARY_SHARED_P(ary) \
51 (assert(!FL_TEST((ary), ELTS_SHARED) || !FL_TEST((ary), RARRAY_EMBED_FLAG)), \
52 FL_TEST((ary),ELTS_SHARED)!=0)
53 # define ARY_EMBED_P(ary) \
54 (assert(!FL_TEST((ary), ELTS_SHARED) || !FL_TEST((ary), RARRAY_EMBED_FLAG)), \
55 FL_TEST((ary), RARRAY_EMBED_FLAG)!=0)
57 #define ARY_HEAP_PTR(a) (assert(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.ptr)
58 #define ARY_HEAP_LEN(a) (assert(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.len)
59 #define ARY_EMBED_PTR(a) (assert(ARY_EMBED_P(a)), RARRAY(a)->as.ary)
60 #define ARY_EMBED_LEN(a) \
61 (assert(ARY_EMBED_P(a)), \
62 (long)((RBASIC(a)->flags >> RARRAY_EMBED_LEN_SHIFT) & \
63 (RARRAY_EMBED_LEN_MASK >> RARRAY_EMBED_LEN_SHIFT)))
65 #define ARY_OWNS_HEAP_P(a) (!FL_TEST((a), ELTS_SHARED|RARRAY_EMBED_FLAG))
66 #define FL_SET_EMBED(a) do { \
67 assert(!ARY_SHARED_P(a)); \
68 assert(!OBJ_FROZEN(a)); \
69 FL_SET((a), RARRAY_EMBED_FLAG); \
71 #define FL_UNSET_EMBED(ary) FL_UNSET((ary), RARRAY_EMBED_FLAG|RARRAY_EMBED_LEN_MASK)
72 #define FL_SET_SHARED(ary) do { \
73 assert(!ARY_EMBED_P(ary)); \
74 FL_SET((ary), ELTS_SHARED); \
76 #define FL_UNSET_SHARED(ary) FL_UNSET((ary), ELTS_SHARED)
78 #define ARY_SET_PTR(ary, p) do { \
79 assert(!ARY_EMBED_P(ary)); \
80 assert(!OBJ_FROZEN(ary)); \
81 RARRAY(ary)->as.heap.ptr = (p); \
83 #define ARY_SET_EMBED_LEN(ary, n) do { \
85 assert(ARY_EMBED_P(ary)); \
86 assert(!OBJ_FROZEN(ary)); \
87 RBASIC(ary)->flags &= ~RARRAY_EMBED_LEN_MASK; \
88 RBASIC(ary)->flags |= (tmp_n) << RARRAY_EMBED_LEN_SHIFT; \
90 #define ARY_SET_HEAP_LEN(ary, n) do { \
91 assert(!ARY_EMBED_P(ary)); \
92 RARRAY(ary)->as.heap.len = (n); \
94 #define ARY_SET_LEN(ary, n) do { \
95 if (ARY_EMBED_P(ary)) { \
96 ARY_SET_EMBED_LEN((ary), (n)); \
99 ARY_SET_HEAP_LEN((ary), (n)); \
101 assert(RARRAY_LEN(ary) == (n)); \
103 #define ARY_INCREASE_PTR(ary, n) do { \
104 assert(!ARY_EMBED_P(ary)); \
105 assert(!OBJ_FROZEN(ary)); \
106 RARRAY(ary)->as.heap.ptr += (n); \
108 #define ARY_INCREASE_LEN(ary, n) do { \
109 assert(!OBJ_FROZEN(ary)); \
110 if (ARY_EMBED_P(ary)) { \
111 ARY_SET_EMBED_LEN((ary), RARRAY_LEN(ary)+(n)); \
114 RARRAY(ary)->as.heap.len += (n); \
118 #define ARY_CAPA(ary) (ARY_EMBED_P(ary) ? RARRAY_EMBED_LEN_MAX : \
119 ARY_SHARED_ROOT_P(ary) ? RARRAY_LEN(ary) : RARRAY(ary)->as.heap.aux.capa)
120 #define ARY_SET_CAPA(ary, n) do { \
121 assert(!ARY_EMBED_P(ary)); \
122 assert(!ARY_SHARED_P(ary)); \
123 assert(!OBJ_FROZEN(ary)); \
124 RARRAY(ary)->as.heap.aux.capa = (n); \
127 #define ARY_SHARED(ary) (assert(ARY_SHARED_P(ary)), RARRAY(ary)->as.heap.aux.shared)
128 #define ARY_SET_SHARED(ary, value) do { \
129 assert(!ARY_EMBED_P(ary)); \
130 assert(ARY_SHARED_P(ary)); \
131 assert(ARY_SHARED_ROOT_P(value)); \
132 RARRAY(ary)->as.heap.aux.shared = (value); \
134 #define RARRAY_SHARED_ROOT_FLAG FL_USER5
135 #define ARY_SHARED_ROOT_P(ary) (FL_TEST((ary), RARRAY_SHARED_ROOT_FLAG))
136 #define ARY_SHARED_NUM(ary) \
137 (assert(ARY_SHARED_ROOT_P(ary)), RARRAY(ary)->as.heap.aux.capa)
138 #define ARY_SET_SHARED_NUM(ary, value) do { \
139 assert(ARY_SHARED_ROOT_P(ary)); \
140 RARRAY(ary)->as.heap.aux.capa = (value); \
142 #define FL_SET_SHARED_ROOT(ary) do { \
143 assert(!ARY_EMBED_P(ary)); \
144 FL_SET((ary), RARRAY_SHARED_ROOT_FLAG); \
171 if (len > capacity) len = capacity;
356 for (i=0; i<
n; i++) {
397 return RARRAY(ary)->as.heap.aux.capa *
sizeof(
VALUE);
440 return (
VALUE)shared;
599 rb_warn(
"block supersedes default value argument");
601 for (i=0; i<
len; i++) {
626 if (argc > 0 && argv) {
925 if (argc == 0)
return ary;
949 if (offset < 0 ||
RARRAY_LEN(ary) <= offset) {
970 if (beg < 0 || len < 0)
return Qnil;
976 if (len == 0)
return ary_new(klass, 0);
1146 if (block_given && argc == 2) {
1147 rb_warn(
"block supersedes default value argument");
1155 if (block_given)
return rb_yield(pos);
1204 rb_warn(
"given block not used");
1252 rb_warn(
"given block not used");
1268 if (!
NIL_P(tmp))
return tmp;
1345 if (len == olen)
return ary;
1407 long offset, beg,
len;
1457 if (argc == 1)
return ary;
1622 int *first = (
int *)arg[3];
1640 for (i=0; i<max; i++) {
1642 if (i > 0 && !
NIL_P(sep))
1656 if (i > 0 && !
NIL_P(sep))
1660 switch (
TYPE(val)) {
1678 args[3] = (
VALUE)first;
1709 int untrust =
FALSE;
1724 if (
NIL_P(tmp) || tmp != val) {
1866 ary_reverse(p1, p2);
1883 rb_ary_reverse_bang(
VALUE ary)
1899 rb_ary_reverse_m(
VALUE ary)
1907 do *p2-- = *p1++;
while (--len > 0);
1914 rotate_count(
long cnt,
long len)
1916 return (cnt < 0) ? (len - (~cnt %
len) - 1) : (cnt %
len);
1920 rb_ary_rotate(
VALUE ary,
long cnt)
1928 if (len > 0 && (cnt = rotate_count(cnt, len)) > 0) {
1930 if (cnt < len) ary_reverse(ptr + cnt, ptr + len);
1931 if (--cnt > 0) ary_reverse(ptr, ptr + cnt);
1932 if (len > 0) ary_reverse(ptr, ptr + len);
1965 rb_ary_rotate(ary, n);
1985 rb_ary_rotate_m(
int argc,
VALUE *argv,
VALUE ary)
1999 cnt = rotate_count(cnt, len);
2010 struct ary_sort_data {
2022 #define STRING_P(s) (TYPE(s) == T_STRING && CLASS_OF(s) == rb_cString)
2024 #define SORT_OPTIMIZABLE_BIT(type) (1U << TOKEN_PASTE(sort_opt_,type))
2025 #define SORT_OPTIMIZABLE(data, type) \
2026 (((data)->opt_inited & SORT_OPTIMIZABLE_BIT(type)) ? \
2027 ((data)->opt_methods & SORT_OPTIMIZABLE_BIT(type)) : \
2028 (((data)->opt_inited |= SORT_OPTIMIZABLE_BIT(type)), \
2029 rb_method_basic_definition_p(TOKEN_PASTE(rb_c,type), id_cmp) && \
2030 ((data)->opt_methods |= SORT_OPTIMIZABLE_BIT(type))))
2064 if ((
long)a > (
long)
b)
return 1;
2065 if ((
long)a < (
long)b)
return -1;
2102 struct ary_sort_data data;
2106 data.opt_methods = 0;
2107 data.opt_inited = 0;
2279 long beg,
len,
i, j;
2281 for (i=0; i<
argc; i++) {
2293 for (j=0; j<
len; j++) {
2379 for (i1 = i2 = 0; i1 <
RARRAY_LEN(ary); i1++) {
2442 for (i1 = i2 = 0; i1 <
RARRAY_LEN(ary); i1++) {
2479 if (pos >= len)
return Qnil;
2482 if (pos < 0)
return Qnil;
2537 long pos,
len, orig_len;
2544 if (len < 0)
return Qnil;
2548 if (pos < 0)
return Qnil;
2550 else if (orig_len < pos)
return Qnil;
2551 if (orig_len < pos + len) {
2552 len = orig_len - pos;
2571 goto delete_pos_len;
2662 return rejected_ary;
2742 for (i=0; i<
argc; i++) {
2753 for (j=0; j<
argc; j++) {
2756 if (
NIL_P(result)) {
2780 long elen = -1, alen,
i, j;
2785 for (i=0; i<alen; i++) {
2790 for (j=0; j<elen; j++) {
2798 for (j=0; j<elen; j++) {
2822 if (copy == orig)
return copy;
2914 VALUE item, arg1, arg2;
2915 long beg = 0,
end = 0, len = 0;
2917 int block_p =
FALSE;
2941 if (beg < 0) beg = 0;
2966 for (i=beg; i<
end; i++) {
3076 while (t <= len/2) {
3160 if (recur)
return Qtrue;
3185 if (ary1 == ary2)
return Qtrue;
3201 if (recur)
return Qtrue;
3220 if (ary1 == ary2)
return Qtrue;
3293 if (recur)
return Qundef;
3298 for (i=0; i<
len; i++) {
3335 if (ary1 == ary2)
return INT2FIX(0);
3339 if (len == 0)
return INT2FIX(0);
3340 if (len > 0)
return INT2FIX(1);
3395 if (
RHASH(hash)->ntbl) {
3397 RHASH(hash)->ntbl = 0;
3713 rb_warn(
"given block not used");
3852 #define OPTHASH_GIVEN_P(opts) \
3853 (argc > 0 && !NIL_P((opts) = rb_check_hash_type(argv[argc-1])) && (--argc, 1))
3856 #define RAND_UPTO(max) (long)(rb_random_real(randgen)*(max))
3953 if (len == 0)
return Qnil;
3960 i = (
long)(x * len);
3967 if (n > len) n =
len;
3969 for (i = 0; i <
n; ++
i) {
3975 if (n > len) n =
len;
3980 i = (
long)(rnds[0] * len);
3983 i = (
long)(rnds[0] * len);
3984 j = (
long)(rnds[1] * (len-1));
3988 i = (
long)(rnds[0] * len);
3989 j = (
long)(rnds[1] * (len-1));
3990 k = (
long)(rnds[2] * (len-2));
3993 if (j >= i) l =
i, g = ++j;
3994 if (k >= l && (++k >= g)) ++k;
4001 sorted[0] = idx[0] = (
long)(rnds[0] * len);
4002 for (i=1; i<
n; i++) {
4003 k = (
long)(rnds[i] * --len);
4004 for (j = 0; j <
i; ++j) {
4005 if (k < sorted[j])
break;
4008 memmove(&sorted[j+1], &sorted[j],
sizeof(sorted[0])*(i-j));
4009 sorted[j] = idx[
i] = k;
4013 for (i=0; i<
n; i++) {
4014 ptr_result[
i] = ptr[idx[
i]];
4020 RBASIC(result)->klass = 0;
4023 for (i=0; i<
n; i++) {
4026 ptr_result[j] = ptr_result[
i];
4070 if (n <= 0)
return Qnil;
4073 while (
RARRAY_LEN(ary) > 0 && (n < 0 || 0 < n--)) {
4081 #define tmpbuf(n, size) rb_str_tmp_new((n)*(size))
4082 #define tmpbuf_discard(s) (rb_str_resize((s), 0L), RBASIC(s)->klass = rb_cString)
4083 #define tmpary(n) rb_ary_tmp_new(n)
4084 #define tmpary_discard(a) (ary_discard(a), RBASIC(a)->klass = rb_cArray)
4102 for (i = 0; i <
n; i++) {
4119 for (j = 0; j <
r; j++) result_array[j] = values_array[p[j]];
4167 if (r < 0 || n < r) {
4228 if (n < 0 || len < n) {
4235 for (i = 0; i <
len; i++) {
4250 for (lev++; lev <
n; lev++) {
4251 chosen[lev] =
RARRAY_PTR(ary)[stack[lev+1] = stack[lev]+1];
4258 if (lev == 0)
goto done;
4260 }
while (stack[lev+1]+n == len+lev+1);
4285 for (i = 0; i <
n; i++) {
4298 for (j = 0; j <
r; j++) result_array[j] = values_array[p[j]];
4368 for (; index <
n; ++
index) {
4378 for (j = 0; j <
r; ++j) result_array[j] = values_array[p[j]];
4429 for (i = 0; i <
len; i++) {
4433 else if (len == 0) {
4487 for (i = 1; i <
n; i++) arrays[i] =
Qnil;
4488 for (i = 1; i <
n; i++) arrays[i] =
to_ary(argv[i-1]);
4491 for (i = 0; i <
n; i++) counters[i] = 0;
4496 for (i = 0; i <
n; i++) {
4503 for (i = 0; i <
n; i++) {
4504 long k =
RARRAY_LEN(arrays[i]), l = resultlen;
4510 if (resultlen < k || resultlen < l || resultlen / k != l) {
4520 for (j = 0; j <
n; j++) {
4545 while (counters[m] ==
RARRAY_LEN(arrays[m])) {
4548 if (--m < 0)
goto done;
4674 #define rb_intern(str) rb_intern_const(str)
static VALUE rb_ary_transpose(VALUE ary)
#define RSTRING_LEN(string)
static long NUM2LONG(VALUE x)
static VALUE recursive_cmp(VALUE ary1, VALUE ary2, int recur)
VALUE rb_ary_unshift(VALUE ary, VALUE item)
static void ary_join_1(VALUE obj, VALUE ary, VALUE sep, long i, VALUE result, int *first)
static VALUE ary_reject(VALUE orig, VALUE result)
VALUE rb_ary_pop(VALUE ary)
VALUE rb_ary_new4(long n, const VALUE *elts)
VALUE rb_ary_entry(VALUE ary, long offset)
static VALUE rb_ary_keep_if(VALUE ary)
void rb_enc_copy(VALUE obj1, VALUE obj2)
VALUE rb_ary_freeze(VALUE ary)
static VALUE rb_ary_times(VALUE ary, VALUE times)
static VALUE rb_ary_drop_while(VALUE ary)
static VALUE rb_ary_s_create(int argc, VALUE *argv, VALUE klass)
static VALUE rb_ary_at(VALUE ary, VALUE pos)
#define ARY_SET_EMBED_LEN(ary, n)
VALUE rb_yield_values(int n,...)
static void rb_ary_splice(VALUE ary, long beg, long len, VALUE rpl)
void rb_define_singleton_method(VALUE obj, const char *name, VALUE(*func)(ANYARGS), int argc)
Defines a singleton method for obj.
VALUE rb_exec_recursive_outer(VALUE(*)(VALUE, VALUE, int), VALUE, VALUE)
static VALUE rb_ary_combination(VALUE ary, VALUE num)
VALUE rb_ary_reverse(VALUE)
VALUE rb_ary_sort(VALUE ary)
VALUE rb_ary_subseq(VALUE ary, long beg, long len)
static VALUE rb_ary_sample(int argc, VALUE *argv, VALUE ary)
static VALUE rb_ary_compact(VALUE ary)
VALUE rb_ary_delete_at(VALUE ary, long pos)
SSL_METHOD *(* func)(void)
rb_hash_aset(CALLBACK_TABLE, id_num, cmd)
st_index_t rb_hash_end(st_index_t)
static VALUE take_items(VALUE obj, long n)
VALUE rb_ary_shift(VALUE ary)
static VALUE rb_ary_reverse_each(VALUE ary)
#define FL_UNSET_SHARED(ary)
#define rb_block_call(arg1, arg2, arg3, arg4, arg5, arg6)
VALUE rb_ary_each(VALUE array)
RUBY_EXTERN VALUE rb_cRandom
static VALUE rb_ary_frozen_p(VALUE ary)
VALUE rb_ary_last(int argc, VALUE *argv, VALUE ary)
#define ARY_SET_CAPA(ary, n)
void rb_mem_clear(register VALUE *mem, register long size)
static void permute0(long n, long r, long *p, long index, char *used, VALUE values)
VALUE rb_ary_push(VALUE ary, VALUE item)
VALUE rb_str_buf_new2(const char *)
static VALUE ary_make_partial(VALUE ary, VALUE klass, long offset, long len)
#define ARY_OWNS_HEAP_P(a)
VALUE rb_ary_rassoc(VALUE ary, VALUE value)
VALUE rb_ary_tmp_new(long capa)
static VALUE rb_ary_take_while(VALUE ary)
#define RSTRING_PTR(string)
static void ary_join_0(VALUE ary, VALUE sep, long max, VALUE result)
void rb_raise(VALUE exc, const char *fmt,...)
static VALUE rb_ary_unshift_m(int argc, VALUE *argv, VALUE ary)
static VALUE rb_ary_reject_bang(VALUE ary)
VALUE rb_enc_associate(VALUE obj, rb_encoding *enc)
VALUE rb_ary_clear(VALUE ary)
#define FL_SET_SHARED_ROOT(ary)
VALUE rb_convert_type(VALUE, int, const char *, const char *)
VALUE rb_exec_recursive(VALUE(*)(VALUE, VALUE, int), VALUE, VALUE)
void rb_define_alloc_func(VALUE, rb_alloc_func_t)
static int sort_2(const void *ap, const void *bp, void *dummy)
#define RARRAY_LEN(ARRAY)
VALUE rb_ary_new3(long n,...)
void rb_include_module(VALUE klass, VALUE module)
#define ARY_SHARED_ROOT_P(ary)
#define ARY_SHARED_NUM(ary)
VALUE rb_range_beg_len(VALUE, long *, long *, long, int)
int rb_str_cmp(VALUE, VALUE)
static VALUE take_i(VALUE val, VALUE *args, int argc, VALUE *argv)
static VALUE rb_ary_slice_bang(int argc, VALUE *argv, VALUE ary)
static VALUE rb_ary_reject(VALUE ary)
#define ARY_SHARED_P(ary)
static VALUE rb_ary_each_index(VALUE ary)
VALUE rb_str_buf_append(VALUE, VALUE)
int rb_cmpint(VALUE val, VALUE a, VALUE b)
static VALUE rb_ary_fetch(int argc, VALUE *argv, VALUE ary)
static VALUE rb_ary_delete_at_m(VALUE ary, VALUE pos)
void rb_gc_force_recycle(VALUE p)
static VALUE rb_class_of(VALUE obj)
static void rb_ary_unshare(VALUE ary)
RUBY_EXTERN void * memmove(void *, const void *, size_t)
static VALUE rb_ary_join_m(int argc, VALUE *argv, VALUE ary)
static VALUE rb_ary_first(int argc, VALUE *argv, VALUE ary)
static VALUE rb_ary_count(int argc, VALUE *argv, VALUE ary)
static VALUE rb_ary_sort_by_bang(VALUE ary)
#define OPTHASH_GIVEN_P(opts)
static VALUE rb_ary_aset(int argc, VALUE *argv, VALUE ary)
VALUE rb_ary_assoc(VALUE ary, VALUE key)
static VALUE rb_ary_elt(VALUE ary, long offset)
#define MEMZERO(p, type, n)
static VALUE rb_ary_inspect(VALUE ary)
static VALUE rb_ary_compact_bang(VALUE ary)
static VALUE rb_ary_select(VALUE ary)
#define tmpbuf_discard(s)
void rb_ary_free(VALUE ary)
int rb_block_given_p(void)
static VALUE ary_make_shared_copy(VALUE ary)
static VALUE sort_by_i(VALUE i)
RUBY_EXTERN VALUE rb_cObject
static VALUE rb_ary_or(VALUE ary1, VALUE ary2)
VALUE rb_exec_recursive_paired(VALUE(*)(VALUE, VALUE, int), VALUE, VALUE, VALUE)
static VALUE ary_alloc(VALUE klass)
#define tmpary_discard(a)
VALUE rb_ary_replace(VALUE copy, VALUE orig)
VALUE rb_obj_as_string(VALUE)
VALUE rb_str_buf_cat2(VALUE, const char *)
static VALUE rb_ary_zip(int argc, VALUE *argv, VALUE ary)
static VALUE to_ary(VALUE ary)
VALUE rb_ary_to_s(VALUE ary)
VALUE rb_define_class(const char *name, VALUE super)
Defines a top-level class.
#define FL_SET_SHARED(ary)
static VALUE rb_ary_product(int argc, VALUE *argv, VALUE ary)
static VALUE rb_ary_insert(int argc, VALUE *argv, VALUE ary)
void rb_ary_store(VALUE ary, long idx, VALUE val)
static VALUE rb_ary_permutation(int argc, VALUE *argv, VALUE ary)
#define NEWOBJ(obj, type)
static VALUE rb_ary_shuffle_bang(int argc, VALUE *argv, VALUE ary)
static void ary_discard(VALUE ary)
static void rcombinate0(long n, long r, long *p, long index, long rest, VALUE values)
static VALUE rb_ary_uniq_bang(VALUE ary)
static VALUE ary_take_first_or_last(int argc, VALUE *argv, VALUE ary, enum ary_take_pos_flags last)
static VALUE recursive_join(VALUE obj, VALUE argp, int recur)
static VALUE rb_ary_take(VALUE obj, VALUE n)
static VALUE rb_ary_select_bang(VALUE ary)
#define RUBY_FUNC_EXPORTED
#define MEMCPY(p1, p2, type, n)
double rb_random_real(VALUE rnd)
static VALUE inspect_ary(VALUE ary, VALUE dummy, int recur)
static VALUE rb_ary_collect(VALUE ary)
static VALUE rb_ary_hash(VALUE ary)
VALUE rb_ary_to_ary(VALUE obj)
void rb_define_alias(VALUE klass, const char *name1, const char *name2)
Defines an alias of a method.
#define REALLOC_N(var, type, n)
static VALUE rb_ary_rindex(int argc, VALUE *argv, VALUE ary)
static void ary_resize_capa(VALUE ary, long capacity)
#define RB_GC_GUARD(object)
void rb_ary_modify(VALUE ary)
VALUE rb_ary_delete(VALUE ary, VALUE item)
#define MEMMOVE(p1, p2, type, n)
static int sort_1(const void *ap, const void *bp, void *dummy)
int rb_scan_args(int argc, const VALUE *argv, const char *fmt,...)
static VALUE rb_ary_to_ary_m(VALUE ary)
VALUE rb_assoc_new(VALUE car, VALUE cdr)
VALUE rb_get_values_at(VALUE obj, long olen, int argc, VALUE *argv, VALUE(*func)(VALUE, long))
rb_encoding * rb_usascii_encoding(void)
static VALUE ary_make_hash(VALUE ary)
static VALUE rb_ary_delete_if(VALUE ary)
#define ARY_SET_LEN(ary, n)
void ruby_qsort(void *, const size_t, const size_t, int(*)(const void *, const void *, void *), void *)
#define ARY_SET_PTR(ary, p)
#define FL_UNSET_EMBED(ary)
#define RARRAY_EMBED_FLAG
#define RARRAY_EMBED_LEN_MASK
static VALUE ary_make_substitution(VALUE ary)
static VALUE rb_ary_values_at(int argc, VALUE *argv, VALUE ary)
static VALUE rb_ary_drop(VALUE ary, VALUE n)
static VALUE rb_ary_collect_bang(VALUE ary)
RUBY_FUNC_EXPORTED size_t rb_ary_memsize(VALUE ary)
static void memfill(register VALUE *mem, register long size, register VALUE val)
register unsigned int len
static VALUE rb_ary_increment_share(VALUE shared)
static VALUE ary_add_hash(VALUE hash, VALUE ary)
static void rpermute0(long n, long r, long *p, long index, VALUE values)
static VALUE rb_ary_diff(VALUE ary1, VALUE ary2)
static VALUE ary_tmp_hash_new(void)
static VALUE rb_ary_index(int argc, VALUE *argv, VALUE ary)
int rb_respond_to(VALUE, ID)
static VALUE rb_ary_push_1(VALUE ary, VALUE item)
static VALUE rb_ary_shift_m(int argc, VALUE *argv, VALUE ary)
#define SORT_OPTIMIZABLE(data, type)
static VALUE flatten(VALUE ary, int level, int *modified)
VALUE rb_ary_resize(VALUE ary, long len)
expands or shrinks ary to len elements.
VALUE rb_usascii_str_new2(const char *)
static VALUE rb_ary_flatten_bang(int argc, VALUE *argv, VALUE ary)
VALUE rb_equal(VALUE, VALUE)
#define ARY_SET_HEAP_LEN(ary, n)
static VALUE rb_ary_fill(int argc, VALUE *argv, VALUE ary)
VALUE rb_hash_lookup2(VALUE hash, VALUE key, VALUE def)
static VALUE recursive_equal(VALUE ary1, VALUE ary2, int recur)
static void rb_ary_modify_check(VALUE ary)
VALUE rb_check_convert_type(VALUE, int, const char *, const char *)
VALUE rb_ary_plus(VALUE x, VALUE y)
static VALUE rb_ary_s_try_convert(VALUE dummy, VALUE ary)
static void ary_double_capa(VALUE ary, long min)
VALUE rb_check_array_type(VALUE ary)
static VALUE rb_ary_to_a(VALUE ary)
VALUE rb_check_string_type(VALUE)
VALUE rb_ary_includes(VALUE ary, VALUE item)
#define ARY_INCREASE_PTR(ary, n)
static VALUE rb_ary_equal(VALUE ary1, VALUE ary2)
static int push_value(st_data_t key, st_data_t val, st_data_t ary)
st_index_t rb_hash_uint(st_index_t, st_index_t)
#define ARY_INCREASE_LEN(ary, n)
static VALUE sort_reentered(VALUE ary)
static VALUE ary_make_hash_by(VALUE ary)
VALUE rb_ary_sort_bang(VALUE ary)
static void rb_ary_set_shared(VALUE ary, VALUE shared)
static VALUE rb_ary_length(VALUE ary)
VALUE rb_ary_dup(VALUE ary)
#define RARRAY_EMBED_LEN_MAX
static VALUE rb_ary_repeated_combination(VALUE ary, VALUE num)
VALUE rb_ary_concat(VALUE x, VALUE y)
#define RETURN_ENUMERATOR(obj, argc, argv)
VALUE rb_ary_join(VALUE ary, VALUE sep)
VALUE rb_ary_new2(long capa)
static VALUE rb_ary_repeated_permutation(VALUE ary, VALUE num)
#define ARY_SET_SHARED_NUM(ary, value)
#define ARY_SET_SHARED(ary, value)
static VALUE rb_ary_empty_p(VALUE ary)
static void ary_recycle_hash(VALUE hash)
static VALUE ary_make_shared(VALUE ary)
static VALUE recursive_eql(VALUE ary1, VALUE ary2, int recur)
#define assert(condition)
static VALUE rb_ary_flatten(int argc, VALUE *argv, VALUE ary)
static VALUE ary_add_hash_by(VALUE hash, VALUE ary)
return rb_funcall(q->proc, ID_call, 0)
static VALUE ary_reject_bang(VALUE ary)
static VALUE rb_ary_initialize(int argc, VALUE *argv, VALUE ary)
static VALUE rb_ary_cycle(int argc, VALUE *argv, VALUE ary)
static VALUE recursive_hash(VALUE ary, VALUE dummy, int recur)
void rb_warning(const char *fmt,...)
#define rb_check_frozen(obj)
static void rb_ary_decrement_share(VALUE shared)
VALUE rb_obj_freeze(VALUE)
VALUE rb_ary_cmp(VALUE ary1, VALUE ary2)
static VALUE rb_ary_eql(VALUE ary1, VALUE ary2)
static VALUE rb_ary_uniq(VALUE ary)
VALUE rb_ary_resurrect(VALUE ary)
VALUE rb_str_buf_new(long)
VALUE rb_usascii_str_new(const char *, long)
static VALUE ary_new(VALUE klass, long capa)
#define OBJSETUP(obj, c, t)
static VALUE rb_ary_pop_m(int argc, VALUE *argv, VALUE ary)
void rb_define_method(VALUE klass, const char *name, VALUE(*func)(ANYARGS), int argc)
void rb_warn(const char *fmt,...)
static VALUE rb_ary_and(VALUE ary1, VALUE ary2)
static VALUE rb_ary_shuffle(int argc, VALUE *argv, VALUE ary)
st_index_t rb_hash_start(st_index_t)
static VALUE rb_ary_push_m(int argc, VALUE *argv, VALUE ary)
VALUE rb_usascii_str_new_cstr(const char *)
VALUE rb_ary_aref(int argc, VALUE *argv, VALUE ary)
static void rb_ary_unshare_safe(VALUE ary)
VALUE rb_obj_class(VALUE)