27 #define numberof(array) (int)(sizeof(array) / sizeof((array)[0])) 33 #define ARY_DEFAULT_SIZE 16 34 #define ARY_MAX_SIZE (LONG_MAX / (int)sizeof(VALUE)) 52 # define ARY_SHARED_P(ary) \ 53 (assert(!FL_TEST((ary), ELTS_SHARED) || !FL_TEST((ary), RARRAY_EMBED_FLAG)), \ 54 FL_TEST((ary),ELTS_SHARED)!=0) 55 # define ARY_EMBED_P(ary) \ 56 (assert(!FL_TEST((ary), ELTS_SHARED) || !FL_TEST((ary), RARRAY_EMBED_FLAG)), \ 57 FL_TEST((ary), RARRAY_EMBED_FLAG)!=0) 59 #define ARY_HEAP_PTR(a) (assert(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.ptr) 60 #define ARY_HEAP_LEN(a) (assert(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.len) 61 #define ARY_EMBED_PTR(a) (assert(ARY_EMBED_P(a)), RARRAY(a)->as.ary) 62 #define ARY_EMBED_LEN(a) \ 63 (assert(ARY_EMBED_P(a)), \ 64 (long)((RBASIC(a)->flags >> RARRAY_EMBED_LEN_SHIFT) & \ 65 (RARRAY_EMBED_LEN_MASK >> RARRAY_EMBED_LEN_SHIFT))) 67 #define ARY_OWNS_HEAP_P(a) (!FL_TEST((a), ELTS_SHARED|RARRAY_EMBED_FLAG)) 68 #define FL_SET_EMBED(a) do { \ 69 assert(!ARY_SHARED_P(a)); \ 70 FL_SET((a), RARRAY_EMBED_FLAG); \ 72 #define FL_UNSET_EMBED(ary) FL_UNSET((ary), RARRAY_EMBED_FLAG|RARRAY_EMBED_LEN_MASK) 73 #define FL_SET_SHARED(ary) do { \ 74 assert(!ARY_EMBED_P(ary)); \ 75 FL_SET((ary), ELTS_SHARED); \ 77 #define FL_UNSET_SHARED(ary) FL_UNSET((ary), ELTS_SHARED) 79 #define ARY_SET_PTR(ary, p) do { \ 80 assert(!ARY_EMBED_P(ary)); \ 81 assert(!OBJ_FROZEN(ary)); \ 82 RARRAY(ary)->as.heap.ptr = (p); \ 84 #define ARY_SET_EMBED_LEN(ary, n) do { \ 86 assert(ARY_EMBED_P(ary)); \ 87 assert(!OBJ_FROZEN(ary)); \ 88 RBASIC(ary)->flags &= ~RARRAY_EMBED_LEN_MASK; \ 89 RBASIC(ary)->flags |= (tmp_n) << RARRAY_EMBED_LEN_SHIFT; \ 91 #define ARY_SET_HEAP_LEN(ary, n) do { \ 92 assert(!ARY_EMBED_P(ary)); \ 93 RARRAY(ary)->as.heap.len = (n); \ 95 #define ARY_SET_LEN(ary, n) do { \ 96 if (ARY_EMBED_P(ary)) { \ 97 ARY_SET_EMBED_LEN((ary), (n)); \ 100 ARY_SET_HEAP_LEN((ary), (n)); \ 102 assert(RARRAY_LEN(ary) == (n)); \ 104 #define ARY_INCREASE_PTR(ary, n) do { \ 105 assert(!ARY_EMBED_P(ary)); \ 106 assert(!OBJ_FROZEN(ary)); \ 107 RARRAY(ary)->as.heap.ptr += (n); \ 109 #define ARY_INCREASE_LEN(ary, n) do { \ 110 assert(!OBJ_FROZEN(ary)); \ 111 if (ARY_EMBED_P(ary)) { \ 112 ARY_SET_EMBED_LEN((ary), RARRAY_LEN(ary)+(n)); \ 115 RARRAY(ary)->as.heap.len += (n); \ 119 #define ARY_CAPA(ary) (ARY_EMBED_P(ary) ? RARRAY_EMBED_LEN_MAX : \ 120 ARY_SHARED_ROOT_P(ary) ? RARRAY_LEN(ary) : RARRAY(ary)->as.heap.aux.capa) 121 #define ARY_SET_CAPA(ary, n) do { \ 122 assert(!ARY_EMBED_P(ary)); \ 123 assert(!ARY_SHARED_P(ary)); \ 124 assert(!OBJ_FROZEN(ary)); \ 125 RARRAY(ary)->as.heap.aux.capa = (n); \ 128 #define ARY_SHARED(ary) (assert(ARY_SHARED_P(ary)), RARRAY(ary)->as.heap.aux.shared) 129 #define ARY_SET_SHARED(ary, value) do { \ 130 assert(!ARY_EMBED_P(ary)); \ 131 assert(ARY_SHARED_P(ary)); \ 132 assert(ARY_SHARED_ROOT_P(value)); \ 133 RARRAY(ary)->as.heap.aux.shared = (value); \ 135 #define RARRAY_SHARED_ROOT_FLAG FL_USER5 136 #define ARY_SHARED_ROOT_P(ary) (FL_TEST((ary), RARRAY_SHARED_ROOT_FLAG)) 137 #define ARY_SHARED_NUM(ary) \ 138 (assert(ARY_SHARED_ROOT_P(ary)), RARRAY(ary)->as.heap.aux.capa) 139 #define ARY_SET_SHARED_NUM(ary, value) do { \ 140 assert(ARY_SHARED_ROOT_P(ary)); \ 141 RARRAY(ary)->as.heap.aux.capa = (value); \ 143 #define FL_SET_SHARED_ROOT(ary) do { \ 144 assert(!ARY_EMBED_P(ary)); \ 145 FL_SET((ary), RARRAY_SHARED_ROOT_FLAG); \ 172 if (len > capacity) len = capacity;
304 if (new_len > capa - (capa >> 6)) {
314 if (new_len > capa) {
362 RARRAY(ary1)->as.heap.aux.shared ==
RARRAY(ary2)->as.heap.aux.shared &&
363 RARRAY(ary1)->as.heap.len ==
RARRAY(ary2)->as.heap.len) {
441 for (
i=0;
i<n;
i++) {
482 return RARRAY(ary)->as.heap.aux.capa *
sizeof(
VALUE);
525 return (
VALUE)shared;
684 rb_warn(
"block supersedes default value argument");
686 for (
i=0;
i<len;
i++) {
997 long new_len = len +
argc;
1007 goto makeroom_if_need;
1013 if (capa - (capa >> 6) <= new_len) {
1029 room = capa - new_len;
1081 if (offset < 0 ||
RARRAY_LEN(ary) <= offset) {
1102 if (beg < 0 || len < 0)
return Qnil;
1108 if (len == 0)
return ary_new(klass, 0);
1288 if (block_given &&
argc == 2) {
1289 rb_warn(
"block supersedes default value argument");
1297 if (block_given)
return rb_yield(pos);
1349 rb_warn(
"given block not used");
1400 rb_warn(
"given block not used");
1416 if (!
NIL_P(tmp))
return tmp;
1486 if (len > (capa = (
long)
ARY_CAPA(ary))) {
1487 rb_bug(
"probable buffer overflow: %ld for %ld", len, capa);
1507 if (len == olen)
return ary;
1576 long offset, beg, len;
1624 if (
argc == 1)
return ary;
1661 volatile VALUE ary = array;
1791 int *first = (
int *)arg[3];
1811 if (
i > 0 && !
NIL_P(sep))
1825 if (
i > 0 && !
NIL_P(sep))
1878 int untrust =
FALSE;
2080 do *p2-- = *p1++;
while (--len > 0);
2089 return (
cnt < 0) ? (len - (~
cnt % len) - 1) : (
cnt % len);
2164 VALUE rotated, *ptr, *ptr2;
2199 #define STRING_P(s) (RB_TYPE_P((s), T_STRING) && CLASS_OF(s) == rb_cString) 2201 #define SORT_OPTIMIZABLE_BIT(type) (1U << TOKEN_PASTE(sort_opt_,type)) 2202 #define SORT_OPTIMIZABLE(data, type) \ 2203 (((data)->opt_inited & SORT_OPTIMIZABLE_BIT(type)) ? \ 2204 ((data)->opt_methods & SORT_OPTIMIZABLE_BIT(type)) : \ 2205 (((data)->opt_inited |= SORT_OPTIMIZABLE_BIT(type)), \ 2206 rb_method_basic_definition_p(TOKEN_PASTE(rb_c,type), id_cmp) && \ 2207 ((data)->opt_methods |= SORT_OPTIMIZABLE_BIT(type)))) 2212 if (
RBASIC(ary)->klass) {
2241 if ((
long)a > (long)b)
return 1;
2242 if ((
long)a < (long)b)
return -1;
2425 int smaller = 0, satisfied = 0;
2429 while (low < high) {
2430 mid = low + ((high - low) / 2);
2447 case 1: smaller = 1;
break;
2448 case -1: smaller = 0;
2453 " (must be numeric, true, false or nil)",
2464 if (!satisfied)
return Qnil;
2571 long beg, len,
i, j;
2580 long end = olen < beg+len ? olen : beg+len;
2581 for (j = beg; j < end; j++) {
2806 if (pos >= len)
return Qnil;
2809 if (pos < 0)
return Qnil;
2867 long pos, len, orig_len;
2874 if (len < 0)
return Qnil;
2878 if (pos < 0)
return Qnil;
2880 else if (orig_len < pos)
return Qnil;
2881 if (orig_len < pos + len) {
2882 len = orig_len - pos;
2901 goto delete_pos_len;
2992 return rejected_ary;
3089 for (j=0; j<
argc; j++) {
3118 long elen = -1, alen,
i, j;
3123 for (
i=0;
i<alen;
i++) {
3128 for (j=0; j<elen; j++) {
3136 for (j=0; j<elen; j++) {
3160 if (copy == orig)
return copy;
3257 VALUE item, arg1, arg2;
3258 long beg = 0, end = 0, len = 0;
3260 int block_p =
FALSE;
3284 if (beg < 0) beg = 0;
3309 for (
i=beg;
i<end;
i++) {
3401 VALUE ary2, tmp, *ptr, *ptr2;
3430 while (t <= len/2) {
3525 for (
i = 0;
i < len1;
i++) {
3563 if (ary1 == ary2)
return Qtrue;
3598 if (ary1 == ary2)
return Qtrue;
3677 for (
i=0;
i<len;
i++) {
3719 if (ary1 == ary2)
return INT2FIX(0);
3723 if (len == 0)
return INT2FIX(0);
3724 if (len > 0)
return INT2FIX(1);
4123 rb_warn(
"given block not used");
4268 #define OPTHASH_GIVEN_P(opts) \ 4269 (argc > 0 && !NIL_P((opts) = rb_check_hash_type(argv[argc-1])) && (--argc, 1)) 4272 #define RAND_UPTO(max) (long)rb_random_ulong_limited((randgen), (max)-1) 4366 long n, len,
i, j, k, idx[10];
4375 if (len == 0)
return Qnil;
4389 if (n > len) n = len;
4391 for (
i = 0;
i < n; ++
i) {
4400 for (
i = 0;
i < n; ++
i) {
4401 if (rnds[
i] >= len) {
4407 if (n > len) n = len;
4425 if (j >=
i) l =
i, g = ++j;
4426 if (k >= l && (++k >= g)) ++k;
4433 sorted[0] = idx[0] = rnds[0];
4434 for (
i=1;
i<n;
i++) {
4436 for (j = 0; j <
i; ++j) {
4437 if (k < sorted[j])
break;
4440 memmove(&sorted[j+1], &sorted[j],
sizeof(sorted[0])*(
i-j));
4441 sorted[j] = idx[
i] = k;
4445 for (
i=0;
i<n;
i++) {
4446 ptr_result[
i] = ptr[idx[
i]];
4455 for (
i=0;
i<n;
i++) {
4458 ptr_result[j] = ptr_result[
i];
4517 if (n <= 0)
return Qnil;
4528 #define tmpbuf(n, size) rb_str_tmp_new((n)*(size)) 4529 #define tmpbuf_discard(s) (rb_str_resize((s), 0L), RBASIC(s)->klass = rb_cString) 4530 #define tmpary(n) rb_ary_tmp_new(n) 4531 #define tmpary_discard(a) (ary_discard(a), RBASIC(a)->klass = rb_cArray) 4546 for (
i = 0;
i < r;
i++) result_array[
i] = values_array[
p[
i]];
4549 return !
RBASIC(values)->klass;
4570 for (
i = 0;
i < n;
i++) {
4596 while (how_many-- > 0) {
4605 if (comb >
size-comb) {
4662 if (r < 0 || n < r) {
4733 if (n < 0 || len < n) {
4740 for (
i = 0;
i < len;
i++) {
4747 long *stack =
ALLOCV_N(
long, t0, n+1);
4754 for (lev++; lev < n; lev++) {
4755 stack[lev+1] = stack[lev]+1;
4761 if (lev == 0)
goto done;
4763 }
while (stack[lev+1]+n == len+lev+1);
4789 for (
i = 0;
i < n;
i++) {
4875 for (; index < n; ++index) {
4940 for (
i = 0;
i < len;
i++) {
4944 else if (len == 0) {
4999 for (
i = 1;
i < n;
i++) arrays[
i] =
Qnil;
5003 for (
i = 0;
i < n;
i++) counters[
i] = 0;
5008 for (
i = 0;
i < n;
i++) {
5015 for (
i = 0;
i < n;
i++) {
5031 for (j = 0; j < n; j++) {
5056 while (counters[m] ==
RARRAY_LEN(arrays[m])) {
5059 if (--m < 0)
goto done;
5422 #define rb_intern(str) rb_intern_const(str) static VALUE rb_ary_transpose(VALUE ary)
static void ary_reverse(VALUE *p1, VALUE *p2)
#define RUBY_DTRACE_ARRAY_CREATE(arg0, arg1, arg2)
static VALUE recursive_cmp(VALUE ary1, VALUE ary2, int recur)
VALUE rb_ary_unshift(VALUE ary, VALUE item)
static void ary_ensure_room_for_push(VALUE ary, long add_len)
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)
void rb_bug(const char *fmt,...)
static VALUE rb_ary_keep_if(VALUE ary)
void rb_enc_copy(VALUE obj1, VALUE obj2)
static VALUE rb_ary_cycle_size(VALUE self, VALUE args)
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)
static int max(int a, int b)
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_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)
int st_insert(st_table *, st_data_t, st_data_t)
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)
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)
static VALUE rb_ary_reverse_m(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)
SSL_METHOD *(* func)(void)
void st_free_table(st_table *)
#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)
VALUE rb_ary_shared_with_p(VALUE ary1, VALUE ary2)
VALUE rb_funcall(VALUE, ID, int,...)
Calls a method.
static void ary_ensure_room_for_unshift(VALUE ary, int argc)
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)
static VALUE rb_ary_repeated_combination_size(VALUE ary, VALUE args)
VALUE rb_enc_associate(VALUE obj, rb_encoding *enc)
VALUE rb_ary_clear(VALUE ary)
#define FL_SET_SHARED_ROOT(ary)
#define MUL_OVERFLOW_LONG_P(a, b)
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)
VALUE rb_obj_is_kind_of(VALUE, VALUE)
static int sort_2(const void *ap, const void *bp, void *dummy)
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)
VALUE rb_ary_rotate(VALUE ary, long cnt)
VALUE rb_block_call(VALUE, ID, int, VALUE *, VALUE(*)(ANYARGS), VALUE)
#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_reverse_bang(VALUE ary)
VALUE rb_check_block_call(VALUE, ID, int, VALUE *, VALUE(*)(ANYARGS), VALUE)
const char * rb_obj_classname(VALUE)
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)
#define NEWOBJ_OF(obj, type, klass, flags)
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)
#define RUBY_DTRACE_ARRAY_CREATE_ENABLED()
#define RB_TYPE_P(obj, type)
static VALUE rb_ary_aset(int argc, VALUE *argv, VALUE ary)
VALUE rb_ary_assoc(VALUE ary, VALUE key)
static VALUE rb_ary_repeated_permutation_size(VALUE ary, VALUE args)
static VALUE rb_ary_elt(VALUE ary, long offset)
int st_lookup(st_table *, st_data_t, st_data_t *)
#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)
VALUE rb_ary_cat(VALUE ary, const VALUE *ptr, long len)
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)
static VALUE binomial_coefficient(long comb, long size)
VALUE rb_define_class(const char *name, VALUE super)
Defines a top-level class.
#define FL_SET_SHARED(ary)
int st_delete(st_table *, st_data_t *, st_data_t *)
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)
static void ary_resize_smaller(VALUE ary, long len)
rb_atomic_t cnt[RUBY_NSIG]
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)
#define ALLOCV_N(type, v, n)
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)
static VALUE inspect_ary(VALUE ary, VALUE dummy, int recur)
static VALUE descending_factorial(long from, long how_many)
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)
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 RETURN_SIZED_ENUMERATOR(obj, argc, argv, size_fn)
#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 empty_ary_alloc(VALUE klass)
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)
static void shift(struct cparse_params *v, long act, VALUE tok, VALUE val)
RUBY_EXTERN VALUE rb_cNumeric
st_table * st_init_numtable(void)
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_shift_m(int argc, VALUE *argv, VALUE ary)
#define SORT_OPTIMIZABLE(data, type)
static VALUE flatten(VALUE ary, int level, int *modified)
static VALUE rb_ary_combination_size(VALUE ary, VALUE args)
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 int yield_indexed_values(const VALUE values, const long r, const long *const p)
static VALUE rb_ary_fill(int argc, VALUE *argv, VALUE ary)
VALUE rb_hash_lookup2(VALUE hash, VALUE key, VALUE def)
#define rb_check_arity(argc, min, max)
#define UNLIMITED_ARGUMENTS
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)
static VALUE rb_ary_rotate_m(int argc, VALUE *argv, VALUE ary)
VALUE rb_check_array_type(VALUE ary)
static VALUE rb_ary_permutation_size(VALUE ary, VALUE args)
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 long rotate_count(long cnt, long len)
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)
static unsigned int hash(const char *str, unsigned int len)
#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 VALUE rb_ary_rotate_bang(int argc, VALUE *argv, 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)
VALUE rb_ary_reverse(VALUE ary)
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)
VALUE rb_hash_aset(VALUE, VALUE, VALUE)
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)
int st_foreach(st_table *, int(*)(ANYARGS), st_data_t)
void rb_ary_delete_same(VALUE ary, VALUE item)
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)
void rb_ary_set_len(VALUE ary, long len)
VALUE rb_obj_class(VALUE)
static VALUE rb_ary_bsearch(VALUE ary)