14#include "debug_counter.h"
17#include "internal/array.h"
18#include "internal/compar.h"
19#include "internal/enum.h"
20#include "internal/gc.h"
21#include "internal/hash.h"
22#include "internal/numeric.h"
23#include "internal/object.h"
24#include "internal/proc.h"
25#include "internal/rational.h"
26#include "internal/vm.h"
39#include "ruby_assert.h"
42VALUE rb_cArray_empty_frozen;
71#define ARY_DEFAULT_SIZE 16
72#define ARY_MAX_SIZE (LONG_MAX / (int)sizeof(VALUE))
73#define SMALL_ARRAY_LEN 16
77should_be_T_ARRAY(
VALUE ary)
82#define ARY_HEAP_PTR(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.ptr)
83#define ARY_HEAP_LEN(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.len)
84#define ARY_HEAP_CAPA(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RUBY_ASSERT(!ARY_SHARED_ROOT_P(a)), \
85 RARRAY(a)->as.heap.aux.capa)
87#define ARY_EMBED_PTR(a) (RUBY_ASSERT(ARY_EMBED_P(a)), RARRAY(a)->as.ary)
88#define ARY_EMBED_LEN(a) \
89 (RUBY_ASSERT(ARY_EMBED_P(a)), \
90 (long)((RBASIC(a)->flags >> RARRAY_EMBED_LEN_SHIFT) & \
91 (RARRAY_EMBED_LEN_MASK >> RARRAY_EMBED_LEN_SHIFT)))
92#define ARY_HEAP_SIZE(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RUBY_ASSERT(ARY_OWNS_HEAP_P(a)), ARY_CAPA(a) * sizeof(VALUE))
94#define ARY_OWNS_HEAP_P(a) (RUBY_ASSERT(should_be_T_ARRAY((VALUE)(a))), \
95 !FL_TEST_RAW((a), RARRAY_SHARED_FLAG|RARRAY_EMBED_FLAG))
97#define FL_SET_EMBED(a) do { \
98 RUBY_ASSERT(!ARY_SHARED_P(a)); \
99 FL_SET((a), RARRAY_EMBED_FLAG); \
103#define FL_UNSET_EMBED(ary) FL_UNSET((ary), RARRAY_EMBED_FLAG|RARRAY_EMBED_LEN_MASK)
104#define FL_SET_SHARED(ary) do { \
105 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
106 FL_SET((ary), RARRAY_SHARED_FLAG); \
108#define FL_UNSET_SHARED(ary) FL_UNSET((ary), RARRAY_SHARED_FLAG)
110#define ARY_SET_PTR(ary, p) do { \
111 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
112 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
113 RARRAY(ary)->as.heap.ptr = (p); \
115#define ARY_SET_EMBED_LEN(ary, n) do { \
117 RUBY_ASSERT(ARY_EMBED_P(ary)); \
118 RBASIC(ary)->flags &= ~RARRAY_EMBED_LEN_MASK; \
119 RBASIC(ary)->flags |= (tmp_n) << RARRAY_EMBED_LEN_SHIFT; \
121#define ARY_SET_HEAP_LEN(ary, n) do { \
122 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
123 RARRAY(ary)->as.heap.len = (n); \
125#define ARY_SET_LEN(ary, n) do { \
126 if (ARY_EMBED_P(ary)) { \
127 ARY_SET_EMBED_LEN((ary), (n)); \
130 ARY_SET_HEAP_LEN((ary), (n)); \
132 RUBY_ASSERT(RARRAY_LEN(ary) == (n)); \
134#define ARY_INCREASE_PTR(ary, n) do { \
135 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
136 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
137 RARRAY(ary)->as.heap.ptr += (n); \
139#define ARY_INCREASE_LEN(ary, n) do { \
140 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
141 if (ARY_EMBED_P(ary)) { \
142 ARY_SET_EMBED_LEN((ary), RARRAY_LEN(ary)+(n)); \
145 RARRAY(ary)->as.heap.len += (n); \
149#define ARY_CAPA(ary) (ARY_EMBED_P(ary) ? ary_embed_capa(ary) : \
150 ARY_SHARED_ROOT_P(ary) ? RARRAY_LEN(ary) : ARY_HEAP_CAPA(ary))
151#define ARY_SET_CAPA(ary, n) do { \
152 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
153 RUBY_ASSERT(!ARY_SHARED_P(ary)); \
154 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
155 RARRAY(ary)->as.heap.aux.capa = (n); \
158#define ARY_SHARED_ROOT_OCCUPIED(ary) (!OBJ_FROZEN(ary) && ARY_SHARED_ROOT_REFCNT(ary) == 1)
159#define ARY_SET_SHARED_ROOT_REFCNT(ary, value) do { \
160 RUBY_ASSERT(ARY_SHARED_ROOT_P(ary)); \
161 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
162 RUBY_ASSERT((value) >= 0); \
163 RARRAY(ary)->as.heap.aux.capa = (value); \
165#define FL_SET_SHARED_ROOT(ary) do { \
166 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
167 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
168 FL_SET((ary), RARRAY_SHARED_ROOT_FLAG); \
182ary_embed_capa(
VALUE ary)
184 size_t size = rb_gc_obj_slot_size(ary) - offsetof(
struct RArray, as.
ary);
186 return size /
sizeof(
VALUE);
190ary_embed_size(
long capa)
196ary_embeddable_p(
long capa)
198 return rb_gc_size_allocatable_p(ary_embed_size(
capa));
202rb_ary_embeddable_p(
VALUE ary)
212 return !(ARY_SHARED_ROOT_P(ary) ||
OBJ_FROZEN(ary) || ARY_SHARED_P(ary));
216rb_ary_size_as_embedded(
VALUE ary)
220 if (ARY_EMBED_P(ary)) {
221 real_size = ary_embed_size(ARY_EMBED_LEN(ary));
223 else if (rb_ary_embeddable_p(ary)) {
224 real_size = ary_embed_size(ARY_HEAP_CAPA(ary));
227 real_size =
sizeof(
struct RArray);
234#define ary_verify(ary) ary_verify_(ary, __FILE__, __LINE__)
237ary_verify_(
VALUE ary,
const char *file,
int line)
241 if (ARY_SHARED_P(
ary)) {
250 else if (ARY_EMBED_P(
ary)) {
259 for (i=0; i<
len; i++) {
268#define ary_verify(ary) ((void)0)
297ary_mem_clear(
VALUE ary,
long beg,
long size)
305memfill(
register VALUE *mem,
register long size,
register VALUE val)
316 memfill(
ptr + beg, size, val);
326 if (argc > (
int)(128/
sizeof(
VALUE)) ) {
327 rb_gc_writebarrier_remember(buff_owner_ary);
335 for (i=0; i<argc; i++) {
345 ary_memcpy0(
ary, beg, argc, argv,
ary);
349ary_heap_alloc_buffer(
size_t capa)
357 ruby_sized_xfree((
void *)
ptr, size);
363 ary_heap_free_ptr(
ary, ARY_HEAP_PTR(
ary), ARY_HEAP_SIZE(
ary));
367ary_heap_realloc(
VALUE ary,
size_t new_capa)
380 if (!ARY_EMBED_P(
ary)) {
381 const VALUE *buf = ARY_HEAP_PTR(
ary);
382 long len = ARY_HEAP_LEN(
ary);
385 ARY_SET_EMBED_LEN(
ary,
len);
394ary_resize_capa(
VALUE ary,
long capacity)
400 if (capacity > ary_embed_capa(
ary)) {
401 size_t new_capa = capacity;
402 if (ARY_EMBED_P(
ary)) {
403 long len = ARY_EMBED_LEN(
ary);
404 VALUE *
ptr = ary_heap_alloc_buffer(capacity);
409 ARY_SET_HEAP_LEN(
ary,
len);
412 new_capa = ary_heap_realloc(
ary, capacity);
414 ARY_SET_CAPA(
ary, new_capa);
417 if (!ARY_EMBED_P(
ary)) {
418 long len = ARY_HEAP_LEN(
ary);
419 long old_capa = ARY_HEAP_CAPA(
ary);
422 if (
len > capacity)
len = capacity;
424 ary_heap_free_ptr(
ary,
ptr, old_capa);
437 long capacity = ARY_HEAP_LEN(
ary);
438 long old_capa = ARY_HEAP_CAPA(
ary);
441 if (old_capa > capacity) {
442 size_t new_capa = ary_heap_realloc(
ary, capacity);
443 ARY_SET_CAPA(
ary, new_capa);
452 long new_capa = ARY_CAPA(
ary) / 2;
454 if (new_capa < ARY_DEFAULT_SIZE) {
455 new_capa = ARY_DEFAULT_SIZE;
457 if (new_capa >= ARY_MAX_SIZE - min) {
458 new_capa = (ARY_MAX_SIZE - min) / 2;
461 ary_resize_capa(
ary, new_capa);
480 FL_UNSET_SHARED(
ary);
486 if (ARY_OWNS_HEAP_P(
ary)) {
489 else if (ARY_SHARED_P(
ary)) {
494 ARY_SET_EMBED_LEN(
ary, 0);
519 RB_DEBUG_COUNTER_INC(obj_ary_shared_create);
527 rb_check_frozen(
ary);
534 if (ARY_SHARED_P(
ary)) {
540 if (
len <= ary_embed_capa(
ary)) {
542 FL_UNSET_SHARED(
ary);
546 ARY_SET_EMBED_LEN(
ary,
len);
550 FL_UNSET_SHARED(
ary);
552 ARY_SET_CAPA(
ary, shared_len);
567 rb_gc_writebarrier_remember(
ary);
575 rb_ary_modify_check(
ary);
576 rb_ary_cancel_sharing(
ary);
580ary_ensure_room_for_push(
VALUE ary,
long add_len)
583 long new_len = old_len + add_len;
586 if (old_len > ARY_MAX_SIZE - add_len) {
589 if (ARY_SHARED_P(
ary)) {
590 if (new_len > ary_embed_capa(
ary)) {
594 rb_ary_modify_check(
ary);
605 ary_double_capa(
ary, new_len);
616 rb_ary_modify_check(
ary);
619 if (new_len >
capa) {
620 ary_double_capa(
ary, new_len);
651 if (!ARY_EMBED_P(
ary) && !ARY_SHARED_P(
ary) && !ARY_SHARED_ROOT_P(
ary)) {
652 ary_shrink_capa(
ary);
668 if (!ARY_EMBED_P(ary1) && ARY_SHARED_P(ary1) &&
669 !ARY_EMBED_P(ary2) && ARY_SHARED_P(ary2) &&
670 ARY_SHARED_ROOT(ary1) == ARY_SHARED_ROOT(ary2) &&
671 ARY_HEAP_LEN(ary1) == ARY_HEAP_LEN(ary2)) {
680 size_t size = ary_embed_size(
capa);
693ary_alloc_heap(
VALUE klass)
697 sizeof(struct
RArray), 0);
702empty_ary_alloc(
VALUE klass)
704 RUBY_DTRACE_CREATE_HOOK(ARRAY, 0);
705 return ary_alloc_embed(klass, 0);
716 rb_raise(rb_eArgError,
"negative array size (or size too big)");
718 if (
capa > ARY_MAX_SIZE) {
719 rb_raise(rb_eArgError,
"array size too big");
722 RUBY_DTRACE_CREATE_HOOK(ARRAY,
capa);
724 if (ary_embeddable_p(
capa)) {
725 ary = ary_alloc_embed(klass,
capa);
728 ary = ary_alloc_heap(klass);
732 ARY_SET_PTR(
ary, ary_heap_alloc_buffer(
capa));
733 ARY_SET_HEAP_LEN(
ary, 0);
752(rb_ary_new_from_args)(
long n, ...)
761 for (i=0; i<n; i++) {
771rb_ary_tmp_new_from_values(
VALUE klass,
long n,
const VALUE *elts)
775 ary = ary_new(klass, n);
777 ary_memcpy(
ary, 0, n, elts);
787 return rb_ary_tmp_new_from_values(
rb_cArray, n, elts);
793 size_t size = ary_embed_size(
capa);
810 sizeof(struct
RArray), ec);
820 rb_raise(rb_eArgError,
"negative array size (or size too big)");
822 if (
capa > ARY_MAX_SIZE) {
823 rb_raise(rb_eArgError,
"array size too big");
826 RUBY_DTRACE_CREATE_HOOK(ARRAY,
capa);
828 if (ary_embeddable_p(
capa)) {
829 ary = ec_ary_alloc_embed(ec, klass,
capa);
832 ary = ec_ary_alloc_heap(ec, klass);
836 ARY_SET_PTR(
ary, ary_heap_alloc_buffer(
capa));
837 ARY_SET_HEAP_LEN(
ary, 0);
850 ary_memcpy(
ary, 0, n, elts);
865rb_ary_hidden_new_fill(
long capa)
876 if (ARY_OWNS_HEAP_P(
ary)) {
877 if (USE_DEBUG_COUNTER &&
878 !ARY_SHARED_ROOT_P(
ary) &&
880 RB_DEBUG_COUNTER_INC(obj_ary_extracapa);
883 RB_DEBUG_COUNTER_INC(obj_ary_ptr);
887 RB_DEBUG_COUNTER_INC(obj_ary_embed);
890 if (ARY_SHARED_P(
ary)) {
891 RB_DEBUG_COUNTER_INC(obj_ary_shared);
893 if (ARY_SHARED_ROOT_P(
ary) && ARY_SHARED_ROOT_OCCUPIED(
ary)) {
894 RB_DEBUG_COUNTER_INC(obj_ary_shared_root_occupied);
898static VALUE fake_ary_flags;
901init_fake_ary_flags(
void)
903 struct RArray fake_ary = {0};
911rb_setup_fake_ary(
struct RArray *fake_ary,
const VALUE *list,
long len)
914 RBASIC_CLEAR_CLASS((
VALUE)fake_ary);
920 return (
VALUE)fake_ary;
926 if (ARY_OWNS_HEAP_P(
ary)) {
927 return ARY_CAPA(
ary) *
sizeof(
VALUE);
939 if (ARY_SHARED_P(
ary)) {
940 return ARY_SHARED_ROOT(
ary);
942 else if (ARY_SHARED_ROOT_P(
ary)) {
954 VALUE shared = ary_alloc_heap(0);
955 FL_SET_SHARED_ROOT(shared);
957 if (ARY_EMBED_P(
ary)) {
959 ARY_SET_PTR(shared,
ptr);
963 ARY_SET_HEAP_LEN(
ary,
len);
970 ARY_SET_LEN(shared,
capa);
972 rb_ary_set_shared(
ary, shared);
986 if (ary_embeddable_p(
len)) {
991 ARY_SET_EMBED_LEN(subst,
len);
995 return rb_ary_increment_share(ary_make_shared(
ary));
1008 return rb_convert_type_with_id(
ary,
T_ARRAY,
"Array", idTo_ary);
1010#define to_ary rb_to_array_type
1015 return rb_check_convert_type_with_id(
ary,
T_ARRAY,
"Array", idTo_ary);
1021 return rb_check_convert_type_with_id(
ary,
T_ARRAY,
"Array", idTo_a);
1027 return rb_convert_type_with_id(
ary,
T_ARRAY,
"Array", idTo_a);
1056rb_ary_s_new(
int argc,
VALUE *argv,
VALUE klass)
1062 if (argc > 0 &&
FIXNUM_P(argv[0])) {
1064 if (size < 0) size = 0;
1067 ary = ary_new(klass, size);
1146 if (argc == 1 && !
FIXNUM_P(size)) {
1157 rb_raise(rb_eArgError,
"negative array size");
1159 if (
len > ARY_MAX_SIZE) {
1160 rb_raise(rb_eArgError,
"array size too big");
1164 ary_resize_capa(
ary,
len);
1169 rb_warn(
"block supersedes default value argument");
1171 for (i=0; i<
len; i++) {
1173 ARY_SET_LEN(
ary, i + 1);
1177 ary_memfill(
ary, 0,
len, val);
1194rb_ary_s_create(
int argc,
VALUE *argv,
VALUE klass)
1197 if (argc > 0 && argv) {
1198 ary_memcpy(
ary, 0, argc, argv);
1199 ARY_SET_LEN(
ary, argc);
1213 rb_raise(
rb_eIndexError,
"index %ld too small for array; minimum: %ld",
1217 else if (idx >= ARY_MAX_SIZE) {
1222 if (idx >= ARY_CAPA(
ary)) {
1223 ary_double_capa(
ary, idx);
1230 ARY_SET_LEN(
ary, idx + 1);
1232 ARY_SET(
ary, idx, val);
1242 VALUE result = ary_alloc_heap(klass);
1243 size_t embed_capa = ary_embed_capa(result);
1244 if ((
size_t)
len <= embed_capa) {
1245 FL_SET_EMBED(result);
1247 ARY_SET_EMBED_LEN(result,
len);
1250 VALUE shared = ary_make_shared(
ary);
1255 FL_UNSET_EMBED(result);
1259 rb_ary_set_shared(result, shared);
1261 ARY_INCREASE_PTR(result, offset);
1262 ARY_SET_LEN(result,
len);
1272ary_make_partial_step(
VALUE ary,
VALUE klass,
long offset,
long len,
long step)
1279 const long orig_len =
len;
1281 if (step > 0 && step >=
len) {
1282 VALUE result = ary_new(klass, 1);
1287 ARY_SET_EMBED_LEN(result, 1);
1290 else if (step < 0 && step < -
len) {
1294 long ustep = (step < 0) ? -step : step;
1295 len = roomof(
len, ustep);
1298 long j = offset + ((step > 0) ? 0 : (orig_len - 1));
1300 VALUE result = ary_new(klass,
len);
1301 if (ARY_EMBED_P(result)) {
1305 for (i = 0; i <
len; ++i) {
1309 ARY_SET_EMBED_LEN(result,
len);
1315 for (i = 0; i <
len; ++i) {
1320 ARY_SET_LEN(result,
len);
1332enum ary_take_pos_flags
1339ary_take_first_or_last_n(
VALUE ary,
long n,
enum ary_take_pos_flags last)
1348 rb_raise(rb_eArgError,
"negative array size");
1357ary_take_first_or_last(
int argc,
const VALUE *argv,
VALUE ary,
enum ary_take_pos_flags last)
1364 return ary_take_first_or_last_n(
ary,
NUM2LONG(argv[0]), last);
1386 VALUE target_ary = ary_ensure_room_for_push(
ary, 1);
1390 ARY_SET_LEN(
ary, idx + 1);
1399 VALUE target_ary = ary_ensure_room_for_push(
ary,
len);
1400 ary_memcpy0(
ary, oldlen,
len, argv, target_ary);
1401 ARY_SET_LEN(
ary, oldlen +
len);
1433 rb_ary_modify_check(
ary);
1435 if (n == 0)
return Qnil;
1436 if (ARY_OWNS_HEAP_P(
ary) &&
1437 n * 3 < ARY_CAPA(
ary) &&
1438 ARY_CAPA(
ary) > ARY_DEFAULT_SIZE)
1440 ary_resize_capa(
ary, n * 2);
1445 ARY_SET_LEN(
ary, n - 1);
1489 rb_ary_modify_check(
ary);
1490 result = ary_take_first_or_last(argc, argv,
ary, ARY_TAKE_LAST);
1503 rb_ary_modify_check(
ary);
1509 rb_ary_behead(
ary, 1);
1562 rb_ary_modify_check(
ary);
1563 result = ary_take_first_or_last(argc, argv,
ary, ARY_TAKE_FIRST);
1565 rb_ary_behead(
ary,n);
1577 rb_ary_modify_check(
ary);
1579 if (!ARY_SHARED_P(
ary)) {
1584 ARY_INCREASE_LEN(
ary, -n);
1589 ary_mem_clear(
ary, 0, n);
1590 ary_make_shared(
ary);
1592 else if (ARY_SHARED_ROOT_OCCUPIED(ARY_SHARED_ROOT(
ary))) {
1593 ary_mem_clear(
ary, 0, n);
1596 ARY_INCREASE_PTR(
ary, n);
1597 ARY_INCREASE_LEN(
ary, -n);
1606 if (head - sharedp < argc) {
1607 long room =
capa -
len - argc;
1611 head = sharedp + argc + room;
1613 ARY_SET_PTR(
ary, head - argc);
1617 return ARY_SHARED_ROOT(
ary);
1621ary_modify_for_unshift(
VALUE ary,
int argc)
1624 long new_len =
len + argc;
1626 const VALUE *head, *sharedp;
1630 if (
capa - (
capa >> 6) <= new_len) {
1631 ary_double_capa(
ary, new_len);
1635 if (new_len > ARY_DEFAULT_SIZE * 4 && !ARY_EMBED_P(
ary)) {
1640 ary_make_shared(
ary);
1643 return make_room_for_unshift(
ary, head, (
void *)sharedp, argc,
capa,
len);
1657ary_ensure_room_for_unshift(
VALUE ary,
int argc)
1660 long new_len =
len + argc;
1662 if (
len > ARY_MAX_SIZE - argc) {
1665 else if (! ARY_SHARED_P(
ary)) {
1666 return ary_modify_for_unshift(
ary, argc);
1673 return ary_modify_for_unshift(
ary, argc);
1675 else if (new_len >
capa) {
1676 return ary_modify_for_unshift(
ary, argc);
1682 rb_ary_modify_check(
ary);
1683 return make_room_for_unshift(
ary, head, sharedp, argc,
capa,
len);
1709 rb_ary_modify_check(
ary);
1713 target_ary = ary_ensure_room_for_unshift(
ary, argc);
1714 ary_memcpy0(
ary, 0, argc, argv, target_ary);
1715 ARY_SET_LEN(
ary,
len + argc);
1722 return rb_ary_unshift_m(1, &item,
ary);
1731 if (offset < 0 ||
len <= offset) {
1740 return rb_ary_entry_internal(
ary, offset);
1744rb_ary_subseq_step(
VALUE ary,
long beg,
long len,
long step)
1749 if (beg > alen)
return Qnil;
1750 if (beg < 0 ||
len < 0)
return Qnil;
1752 if (alen <
len || alen < beg +
len) {
1756 if (
len == 0)
return ary_new(klass, 0);
1758 rb_raise(rb_eArgError,
"slice step cannot be zero");
1760 return ary_make_partial(
ary, klass, beg,
len);
1762 return ary_make_partial_step(
ary, klass, beg,
len, step);
1768 return rb_ary_subseq_step(
ary, beg,
len, 1);
1900 return rb_ary_aref2(
ary, argv[0], argv[1]);
1902 return rb_ary_aref1(
ary, argv[0]);
1919 long beg,
len, step;
1926 switch (rb_arithmetic_sequence_beg_len_step(arg, &beg, &
len, &step,
RARRAY_LEN(
ary), 0)) {
1932 return rb_ary_subseq_step(
ary, beg,
len, step);
1977 return ary_take_first_or_last(argc, argv,
ary, ARY_TAKE_FIRST);
1983ary_first(
VALUE self)
1999 return ary_last(
ary);
2002 return ary_take_first_or_last(argc, argv,
ary, ARY_TAKE_LAST);
2055 if (block_given && argc == 2) {
2056 rb_warn(
"block supersedes default value argument");
2064 if (block_given)
return rb_yield(pos);
2066 rb_raise(
rb_eIndexError,
"index %ld outside of array bounds: %ld...%ld",
2126 rb_warn(
"given block not used");
2184 rb_warn(
"given block not used");
2202 if (!
NIL_P(tmp))
return tmp;
2217 rb_raise(
rb_eIndexError,
"index %ld too small for array; minimum: %ld",
2221 if (olen <
len || olen < beg +
len) {
2227 rofs = (rptr >= optr && rptr < optr + olen) ? rptr - optr : -1;
2232 if (beg > ARY_MAX_SIZE - rlen) {
2235 target_ary = ary_ensure_room_for_push(
ary, rlen-
len);
2237 ary_mem_clear(
ary, olen, beg - olen);
2240 ary_memcpy0(
ary, beg, rlen, rptr, target_ary);
2247 if (olen -
len > ARY_MAX_SIZE - rlen) {
2251 alen = olen + rlen -
len;
2252 if (alen >= ARY_CAPA(
ary)) {
2253 ary_double_capa(
ary, alen);
2260 ARY_SET_LEN(
ary, alen);
2264 rb_gc_writebarrier_remember(
ary);
2286 rb_ary_modify_check(
ary);
2287 if (ARY_SHARED_P(
ary)) {
2291 rb_bug(
"probable buffer overflow: %ld for %ld",
len,
capa);
2303 if (
len == olen)
return ary;
2304 if (
len > ARY_MAX_SIZE) {
2308 if (
len > ARY_CAPA(
ary)) {
2309 ary_double_capa(
ary,
len);
2311 ary_mem_clear(
ary, olen,
len - olen);
2314 else if (ARY_EMBED_P(
ary)) {
2315 ARY_SET_EMBED_LEN(
ary,
len);
2317 else if (
len <= ary_embed_capa(
ary)) {
2319 long ptr_capa = ARY_HEAP_SIZE(
ary);
2320 bool is_malloc_ptr = !ARY_SHARED_P(
ary);
2325 ARY_SET_EMBED_LEN(
ary,
len);
2327 if (is_malloc_ptr) ruby_sized_xfree((
void *)
ptr, ptr_capa);
2330 if (olen >
len + ARY_DEFAULT_SIZE) {
2331 size_t new_capa = ary_heap_realloc(
ary,
len);
2332 ARY_SET_CAPA(
ary, new_capa);
2334 ARY_SET_HEAP_LEN(
ary,
len);
2503 long offset, beg,
len;
2506 rb_ary_modify_check(
ary);
2510 return ary_aset_by_rb_ary_splice(
ary, beg,
len, argv[2]);
2514 return ary_aset_by_rb_ary_store(
ary, offset, argv[1]);
2518 return ary_aset_by_rb_ary_splice(
ary, beg,
len, argv[1]);
2522 return ary_aset_by_rb_ary_store(
ary, offset, argv[1]);
2567 rb_ary_modify_check(
ary);
2569 if (argc == 1)
return ary;
2576 rb_raise(
rb_eIndexError,
"index %ld too small for array; minimum: %ld",
2581 rb_ary_splice(
ary, pos, 0, argv + 1, argc - 1);
2591 return rb_ary_length(
ary);
2783 ARY_SET_LEN(dup,
len);
2801recursive_join(
VALUE obj,
VALUE argp,
int recur)
2806 VALUE result = arg[2];
2807 int *first = (
int *)arg[3];
2810 rb_raise(rb_eArgError,
"recursive array join");
2813 ary_join_1(obj,
ary, sep, 0, result, first);
2825 for (i=0; i<max; i++) {
2828 if (i > 0 && !
NIL_P(sep))
2836ary_join_1_str(
VALUE dst,
VALUE src,
int *first)
2840 rb_enc_copy(dst, src);
2849 rb_raise(rb_eArgError,
"recursive array join");
2858 args[3] = (
VALUE)first;
2869 if (i > 0 && !
NIL_P(sep))
2874 ary_join_1_str(result, val, first);
2877 ary_join_1_ary(val,
ary, sep, result, val, first);
2880 ary_join_1_str(result, tmp, first);
2883 ary_join_1_ary(val,
ary, sep, result, tmp, first);
2895 VALUE val, tmp, result;
2907 if (
NIL_P(tmp) || tmp != val) {
2912 rb_enc_associate(result, rb_usascii_encoding());
2913 i = ary_join_0(
ary, sep, i, result);
2915 ary_join_1(
ary,
ary, sep, i, result, &first);
2919 len += RSTRING_LEN(tmp);
2985 else rb_enc_copy(str, s);
3016 return rb_ary_inspect(
ary);
3080 const VALUE e = rb_ary_elt(
ary, i);
3081 const VALUE elt = block_given ? rb_yield_force_blockarg(e) : e;
3083 if (
NIL_P(key_value_pair)) {
3084 rb_raise(
rb_eTypeError,
"wrong element type %"PRIsVALUE
" at %ld (expected array)",
3088 rb_raise(rb_eArgError,
"wrong array length at %ld (expected 2, was %ld)",
3129 ary_reverse(p1, p2);
3175 do *p2-- = *p1++;
while (--
len > 0);
3182rotate_count(
long cnt,
long len)
3184 return (cnt < 0) ? (
len - (~cnt %
len) - 1) : (cnt %
len);
3195 else if (cnt ==
len - 1) {
3203 if (--cnt > 0) ary_reverse(
ptr,
ptr + cnt);
3215 if (
len > 1 && (cnt = rotate_count(cnt,
len)) > 0) {
3307 cnt = rotate_count(cnt,
len);
3310 ary_memcpy(rotated, 0,
len,
ptr + cnt);
3311 ary_memcpy(rotated,
len, cnt,
ptr);
3317struct ary_sort_data {
3323sort_reentered(
VALUE ary)
3325 if (
RBASIC(ary)->klass) {
3332sort_returned(
struct ary_sort_data *data)
3337 sort_reentered(data->ary);
3341sort_1(
const void *ap,
const void *bp,
void *dummy)
3343 struct ary_sort_data *data = dummy;
3344 VALUE retval = sort_reentered(data->ary);
3352 n = rb_cmpint(retval, a, b);
3353 sort_returned(data);
3358sort_2(
const void *ap,
const void *bp,
void *dummy)
3360 struct ary_sort_data *data = dummy;
3361 VALUE retval = sort_reentered(data->ary);
3366 if ((
long)a > (long)b)
return 1;
3367 if ((
long)a < (long)b)
return -1;
3370 if (STRING_P(a) && STRING_P(b) && CMP_OPTIMIZABLE(STRING)) {
3374 return rb_float_cmp(a, b);
3377 retval = rb_funcallv(a, id_cmp, 1, &b);
3378 n = rb_cmpint(retval, a, b);
3379 sort_returned(data);
3400 VALUE tmp = ary_make_substitution(ary);
3401 struct ary_sort_data data;
3403 RBASIC_CLEAR_CLASS(tmp);
3405 data.receiver = ary;
3411 if (ARY_EMBED_P(tmp)) {
3412 if (ARY_SHARED_P(ary)) {
3413 rb_ary_unshare(ary);
3416 if (ARY_EMBED_LEN(tmp) > ARY_CAPA(ary)) {
3417 ary_resize_capa(ary, ARY_EMBED_LEN(tmp));
3419 ary_memcpy(ary, 0, ARY_EMBED_LEN(tmp), ARY_EMBED_PTR(tmp));
3420 ARY_SET_LEN(ary, ARY_EMBED_LEN(tmp));
3423 if (!ARY_EMBED_P(ary) && ARY_HEAP_PTR(ary) == ARY_HEAP_PTR(tmp)) {
3424 FL_UNSET_SHARED(ary);
3429 if (ARY_EMBED_P(ary)) {
3430 FL_UNSET_EMBED(ary);
3432 else if (ARY_SHARED_P(ary)) {
3434 rb_ary_unshare(ary);
3439 ARY_SET_PTR(ary, ARY_HEAP_PTR(tmp));
3440 ARY_SET_HEAP_LEN(ary,
len);
3441 ARY_SET_CAPA(ary, ARY_HEAP_LEN(tmp));
3445 ARY_SET_EMBED_LEN(tmp, 0);
3513rb_ary_bsearch(
VALUE ary)
3515 VALUE index_result = rb_ary_bsearch_index(ary);
3520 return index_result;
3537rb_ary_bsearch_index(
VALUE ary)
3540 int smaller = 0, satisfied = 0;
3544 while (low < high) {
3545 mid = low + ((high - low) / 2);
3552 else if (v ==
Qtrue) {
3556 else if (!
RTEST(v)) {
3561 switch (rb_cmpint(rb_funcallv(v, id_cmp, 1, &zero), v, zero)) {
3563 case 1: smaller = 0;
break;
3564 case -1: smaller = 1;
3569 " (must be numeric, true, false or nil)",
3579 if (!satisfied)
return Qnil;
3613rb_ary_sort_by_bang(
VALUE ary)
3620 sorted =
rb_block_call(ary, rb_intern(
"sort_by"), 0, 0, sort_by_i, 0);
3648rb_ary_collect(
VALUE ary)
3683rb_ary_collect_bang(
VALUE ary)
3699 long beg,
len, i, j;
3701 for (i=0; i<argc; i++) {
3708 long end = olen < beg+
len ? olen : beg+
len;
3709 for (j = beg; j < end; j++) {
3732 const long end = beg +
len;
3856rb_ary_values_at(
int argc,
VALUE *argv,
VALUE ary)
3860 for (i = 0; i < argc; ++i) {
3861 append_values_at_single(result, ary, olen, argv[i]);
3889rb_ary_select(
VALUE ary)
3904struct select_bang_arg {
3910select_bang_i(
VALUE a)
3912 volatile struct select_bang_arg *arg = (
void *)a;
3913 VALUE ary = arg->ary;
3916 for (i1 = i2 = 0; i1 <
RARRAY_LEN(ary); arg->len[0] = ++i1) {
3924 return (i1 == i2) ?
Qnil : ary;
3928select_bang_ensure(
VALUE a)
3930 volatile struct select_bang_arg *arg = (
void *)a;
3931 VALUE ary = arg->ary;
3933 long i1 = arg->len[0], i2 = arg->len[1];
3935 if (i2 <
len && i2 < i1) {
3944 ARY_SET_LEN(ary, i2 + tail);
3972rb_ary_select_bang(
VALUE ary)
3974 struct select_bang_arg args;
3980 args.len[0] = args.len[1] = 0;
4001rb_ary_keep_if(
VALUE ary)
4004 rb_ary_select_bang(ary);
4009ary_resize_smaller(
VALUE ary,
long len)
4013 ARY_SET_LEN(ary,
len);
4014 if (
len * 2 < ARY_CAPA(ary) &&
4015 ARY_CAPA(ary) > ARY_DEFAULT_SIZE) {
4016 ary_resize_capa(ary,
len * 2);
4064 for (i1 = i2 = 0; i1 <
RARRAY_LEN(ary); i1++) {
4083 ary_resize_smaller(ary, i2);
4094 for (i1 = i2 = 0; i1 <
RARRAY_LEN(ary); i1++) {
4109 ary_resize_smaller(ary, i2);
4121 if (pos < 0)
return Qnil;
4129 ARY_INCREASE_LEN(ary, -1);
4169ary_slice_bang_by_rb_ary_splice(
VALUE ary,
long pos,
long len)
4176 else if (pos < -orig_len) {
4182 else if (orig_len < pos) {
4185 if (orig_len < pos +
len) {
4186 len = orig_len - pos;
4193 rb_ary_splice(ary, pos,
len, 0, 0);
4291rb_ary_slice_bang(
int argc,
VALUE *argv,
VALUE ary)
4296 rb_ary_modify_check(ary);
4303 return ary_slice_bang_by_rb_ary_splice(ary, pos,
len);
4310 return ary_slice_bang_by_rb_ary_splice(ary, pos,
len);
4339reject_bang_i(
VALUE a)
4341 volatile struct select_bang_arg *arg = (
void *)a;
4342 VALUE ary = arg->ary;
4345 for (i1 = i2 = 0; i1 <
RARRAY_LEN(ary); arg->len[0] = ++i1) {
4353 return (i1 == i2) ?
Qnil : ary;
4357ary_reject_bang(
VALUE ary)
4359 struct select_bang_arg args;
4360 rb_ary_modify_check(ary);
4362 args.len[0] = args.len[1] = 0;
4387rb_ary_reject_bang(
VALUE ary)
4391 return ary_reject_bang(ary);
4412rb_ary_reject(
VALUE ary)
4418 ary_reject(ary, rejected_ary);
4419 return rejected_ary;
4440rb_ary_delete_if(
VALUE ary)
4444 ary_reject_bang(ary);
4459take_items(
VALUE obj,
long n)
4464 if (n == 0)
return result;
4467 args[0] = result; args[1] = (
VALUE)n;
4468 if (UNDEF_P(rb_check_block_call(obj, idEach, 0, 0, take_i, (
VALUE)args)))
4469 rb_raise(
rb_eTypeError,
"wrong argument type %"PRIsVALUE
" (must respond to :each)",
4575 for (i=0; i<argc; i++) {
4576 argv[i] = take_items(argv[i],
len);
4580 int arity = rb_block_arity();
4589 for (j=0; j<argc; j++) {
4590 tmp[j+1] = rb_ary_elt(argv[j], i);
4602 for (j=0; j<argc; j++) {
4612 for (i=0; i<
len; i++) {
4616 for (j=0; j<argc; j++) {
4642rb_ary_transpose(
VALUE ary)
4644 long elen = -1, alen, i, j;
4645 VALUE tmp, result = 0;
4649 for (i=0; i<alen; i++) {
4650 tmp = to_ary(rb_ary_elt(ary, i));
4654 for (j=0; j<elen; j++) {
4659 rb_raise(
rb_eIndexError,
"element size differs (%ld should be %ld)",
4662 for (j=0; j<elen; j++) {
4663 rb_ary_store(rb_ary_elt(result, j), i, rb_ary_elt(tmp, j));
4687 rb_ary_modify_check(copy);
4688 orig = to_ary(orig);
4689 if (copy == orig)
return copy;
4694 if (
RARRAY_LEN(orig) <= ary_embed_capa(copy)) {
4701 else if (ARY_EMBED_P(orig)) {
4702 long len = ARY_EMBED_LEN(orig);
4703 VALUE *ptr = ary_heap_alloc_buffer(
len);
4705 FL_UNSET_EMBED(copy);
4706 ARY_SET_PTR(copy, ptr);
4707 ARY_SET_LEN(copy,
len);
4708 ARY_SET_CAPA(copy,
len);
4717 VALUE shared_root = ary_make_shared(orig);
4718 FL_UNSET_EMBED(copy);
4719 ARY_SET_PTR(copy, ARY_HEAP_PTR(orig));
4720 ARY_SET_LEN(copy, ARY_HEAP_LEN(orig));
4721 rb_ary_set_shared(copy, shared_root);
4742 rb_ary_modify_check(ary);
4743 if (ARY_SHARED_P(ary)) {
4744 rb_ary_unshare(ary);
4746 ARY_SET_EMBED_LEN(ary, 0);
4749 ARY_SET_LEN(ary, 0);
4750 if (ARY_DEFAULT_SIZE * 2 < ARY_CAPA(ary)) {
4751 ary_resize_capa(ary, ARY_DEFAULT_SIZE * 2);
4942 long beg = 0, end = 0,
len = 0;
4965 if (beg < 0) beg = 0;
4974 if (beg >= ARY_MAX_SIZE ||
len > ARY_MAX_SIZE - beg) {
4975 rb_raise(rb_eArgError,
"argument too big");
4979 if (end >= ARY_CAPA(ary)) {
4980 ary_resize_capa(ary, end);
4983 ARY_SET_LEN(ary, end);
4986 if (UNDEF_P(item)) {
4990 for (i=beg; i<end; i++) {
4997 ary_memfill(ary, beg,
len, item);
5019 long len, xlen, ylen;
5029 ARY_SET_LEN(z,
len);
5058rb_ary_concat_multi(
int argc,
VALUE *argv,
VALUE ary)
5060 rb_ary_modify_check(ary);
5065 else if (argc > 1) {
5068 for (i = 0; i < argc; i++) {
5071 ary_append(ary, args);
5081 return ary_append(x, to_ary(y));
5120 rb_raise(rb_eArgError,
"negative argument");
5123 rb_raise(rb_eArgError,
"argument too big");
5128 ARY_SET_LEN(ary2,
len);
5133 ary_memcpy(ary2, 0, t, ptr);
5134 while (t <=
len/2) {
5211recursive_equal(
VALUE ary1,
VALUE ary2,
int recur)
5214 const VALUE *p1, *p2;
5216 if (recur)
return Qtrue;
5223 for (i = 0; i < len1; i++) {
5271 if (ary1 == ary2)
return Qtrue;
5284recursive_eql(
VALUE ary1,
VALUE ary2,
int recur)
5288 if (recur)
return Qtrue;
5290 if (!
rb_eql(rb_ary_elt(ary1, i), rb_ary_elt(ary2, i)))
5318 if (ary1 == ary2)
return Qtrue;
5326ary_hash_values(
long len,
const VALUE *elements,
const VALUE ary)
5334 for (i=0; i<
len; i++) {
5335 n = rb_hash(elements[i]);
5347rb_ary_hash_values(
long len,
const VALUE *elements)
5349 return ary_hash_values(
len, elements, 0);
5368rb_ary_hash(
VALUE ary)
5419recursive_cmp(
VALUE ary1,
VALUE ary2,
int recur)
5423 if (recur)
return Qundef;
5428 for (i=0; i<
len; i++) {
5429 VALUE e1 = rb_ary_elt(ary1, i), e2 = rb_ary_elt(ary2, i);
5430 VALUE v = rb_funcallv(e1, id_cmp, 1, &e2);
5484 if (ary1 == ary2)
return INT2FIX(0);
5486 if (!UNDEF_P(v))
return v;
5500 rb_hash_add_new_element(hash, elt, elt);
5506ary_tmp_hash_new(
VALUE ary)
5509 VALUE hash = rb_hash_new_with_size(size);
5511 RBASIC_CLEAR_CLASS(hash);
5516ary_make_hash(
VALUE ary)
5518 VALUE hash = ary_tmp_hash_new(ary);
5519 return ary_add_hash(hash, ary);
5529 rb_hash_add_new_element(hash, k, v);
5535ary_make_hash_by(
VALUE ary)
5537 VALUE hash = ary_tmp_hash_new(ary);
5538 return ary_add_hash_by(hash, ary);
5566 ary2 = to_ary(ary2);
5567 if (
RARRAY_LEN(ary2) == 0) {
return ary_make_shared_copy(ary1); }
5572 VALUE elt = rb_ary_elt(ary1, i);
5573 if (rb_ary_includes_by_eql(ary2, elt))
continue;
5579 hash = ary_make_hash(ary2);
5581 if (rb_hash_stlike_lookup(hash,
RARRAY_AREF(ary1, i), NULL))
continue;
5608rb_ary_difference_multi(
int argc,
VALUE *argv,
VALUE ary)
5613 bool *is_hash =
ALLOCV_N(
bool, t0, argc);
5617 for (i = 0; i < argc; i++) {
5618 argv[i] = to_ary(argv[i]);
5619 is_hash[i] = (length > SMALL_ARRAY_LEN &&
RARRAY_LEN(argv[i]) > SMALL_ARRAY_LEN);
5620 if (is_hash[i]) argv[i] = ary_make_hash(argv[i]);
5625 VALUE elt = rb_ary_elt(ary, i);
5626 for (j = 0; j < argc; j++) {
5628 if (rb_hash_stlike_lookup(argv[j], elt, NULL))
5632 if (rb_ary_includes_by_eql(argv[j], elt))
break;
5671 VALUE hash, ary3, v;
5675 ary2 = to_ary(ary2);
5682 if (!rb_ary_includes_by_eql(ary2, v))
continue;
5683 if (rb_ary_includes_by_eql(ary3, v))
continue;
5689 hash = ary_make_hash(ary2);
5694 if (rb_hash_stlike_delete(hash, &vv, 0)) {
5724rb_ary_intersection_multi(
int argc,
VALUE *argv,
VALUE ary)
5729 for (i = 0; i < argc; i++) {
5730 result = rb_ary_and(result, argv[i]);
5737ary_hash_orset(st_data_t *key, st_data_t *value, st_data_t arg,
int existing)
5739 if (existing)
return ST_STOP;
5740 *key = *value = (
VALUE)arg;
5749 VALUE elt = rb_ary_elt(ary, i);
5750 if (rb_ary_includes_by_eql(ary_union, elt))
continue;
5761 if (!rb_hash_stlike_update(hash, (st_data_t)elt, ary_hash_orset, (st_data_t)elt)) {
5787 ary2 = to_ary(ary2);
5790 rb_ary_union(ary3, ary1);
5791 rb_ary_union(ary3, ary2);
5795 hash = ary_make_hash(ary1);
5796 rb_ary_union_hash(hash, ary2);
5798 return rb_hash_values(hash);
5825rb_ary_union_multi(
int argc,
VALUE *argv,
VALUE ary)
5832 for (i = 0; i < argc; i++) {
5833 argv[i] = to_ary(argv[i]);
5837 if (sum <= SMALL_ARRAY_LEN) {
5840 rb_ary_union(ary_union, ary);
5841 for (i = 0; i < argc; i++) rb_ary_union(ary_union, argv[i]);
5846 hash = ary_make_hash(ary);
5847 for (i = 0; i < argc; i++) rb_ary_union_hash(hash, argv[i]);
5849 return rb_hash_values(hash);
5869 VALUE hash, v, result, shorter, longer;
5873 ary2 = to_ary(ary2);
5879 if (rb_ary_includes_by_eql(ary2, v))
return Qtrue;
5891 hash = ary_make_hash(shorter);
5897 if (rb_hash_stlike_lookup(hash, vv, 0)) {
5907ary_max_generic(
VALUE ary,
long i,
VALUE vmax)
5915 if (rb_cmpint(rb_funcallv(vmax, id_cmp, 1, &v), vmax, v) < 0) {
5924ary_max_opt_fixnum(
VALUE ary,
long i,
VALUE vmax)
5931 for (; i < n; ++i) {
5935 if ((
long)vmax < (
long)v) {
5940 return ary_max_generic(ary, i, vmax);
5948ary_max_opt_float(
VALUE ary,
long i,
VALUE vmax)
5955 for (; i < n; ++i) {
5959 if (rb_float_cmp(vmax, v) < 0) {
5964 return ary_max_generic(ary, i, vmax);
5972ary_max_opt_string(
VALUE ary,
long i,
VALUE vmax)
5979 for (; i < n; ++i) {
5988 return ary_max_generic(ary, i, vmax);
6051 return rb_nmin_run(ary, num, 0, 1, 1);
6057 if (UNDEF_P(result) || rb_cmpint(
rb_yield_values(2, v, result), v, result) > 0) {
6065 if (
FIXNUM_P(result) && CMP_OPTIMIZABLE(INTEGER)) {
6066 return ary_max_opt_fixnum(ary, 1, result);
6068 else if (STRING_P(result) && CMP_OPTIMIZABLE(STRING)) {
6069 return ary_max_opt_string(ary, 1, result);
6072 return ary_max_opt_float(ary, 1, result);
6075 return ary_max_generic(ary, 1, result);
6079 if (UNDEF_P(result))
return Qnil;
6084ary_min_generic(
VALUE ary,
long i,
VALUE vmin)
6092 if (rb_cmpint(rb_funcallv(vmin, id_cmp, 1, &v), vmin, v) > 0) {
6101ary_min_opt_fixnum(
VALUE ary,
long i,
VALUE vmin)
6108 for (; i < n; ++i) {
6112 if ((
long)vmin > (
long)a) {
6117 return ary_min_generic(ary, i, vmin);
6125ary_min_opt_float(
VALUE ary,
long i,
VALUE vmin)
6132 for (; i < n; ++i) {
6136 if (rb_float_cmp(vmin, a) > 0) {
6141 return ary_min_generic(ary, i, vmin);
6149ary_min_opt_string(
VALUE ary,
long i,
VALUE vmin)
6156 for (; i < n; ++i) {
6165 return ary_min_generic(ary, i, vmin);
6228 return rb_nmin_run(ary, num, 0, 0, 1);
6234 if (UNDEF_P(result) || rb_cmpint(
rb_yield_values(2, v, result), v, result) < 0) {
6242 if (
FIXNUM_P(result) && CMP_OPTIMIZABLE(INTEGER)) {
6243 return ary_min_opt_fixnum(ary, 1, result);
6245 else if (STRING_P(result) && CMP_OPTIMIZABLE(STRING)) {
6246 return ary_min_opt_string(ary, 1, result);
6249 return ary_min_opt_float(ary, 1, result);
6252 return ary_min_generic(ary, 1, result);
6256 if (UNDEF_P(result))
return Qnil;
6283rb_ary_minmax(
VALUE ary)
6288 return rb_assoc_new(rb_ary_min(0, 0, ary), rb_ary_max(0, 0, ary));
6292push_value(st_data_t key, st_data_t val, st_data_t ary)
6326rb_ary_uniq_bang(
VALUE ary)
6331 rb_ary_modify_check(ary);
6335 hash = ary_make_hash_by(ary);
6337 hash = ary_make_hash(ary);
6343 rb_ary_modify_check(ary);
6344 ARY_SET_LEN(ary, 0);
6345 if (ARY_SHARED_P(ary)) {
6346 rb_ary_unshare(ary);
6349 ary_resize_capa(ary, hash_size);
6382rb_ary_uniq(
VALUE ary)
6391 hash = ary_make_hash_by(ary);
6392 uniq = rb_hash_values(hash);
6395 hash = ary_make_hash(ary);
6396 uniq = rb_hash_values(hash);
6419rb_ary_compact_bang(
VALUE ary)
6436 ary_resize_smaller(ary, n);
6456rb_ary_compact(
VALUE ary)
6459 rb_ary_compact_bang(ary);
6491rb_ary_count(
int argc,
VALUE *argv,
VALUE ary)
6507 VALUE obj = argv[0];
6510 rb_warn(
"given block not used");
6521flatten(
VALUE ary,
int level)
6524 VALUE stack, result, tmp = 0, elt;
6540 ARY_SET_LEN(result, i);
6542 stack = ary_new(0, ARY_DEFAULT_SIZE);
6548 rb_hash_aset(memo, ary,
Qtrue);
6549 rb_hash_aset(memo, tmp,
Qtrue);
6558 if (level >= 0 &&
RARRAY_LEN(stack) / 2 >= level) {
6563 if (
RBASIC(result)->klass) {
6565 rb_hash_clear(memo);
6574 if (rb_hash_aref(memo, tmp) ==
Qtrue) {
6575 rb_hash_clear(memo);
6576 rb_raise(rb_eArgError,
"tried to flatten recursive array");
6578 rb_hash_aset(memo, tmp,
Qtrue);
6590 rb_hash_delete(memo, ary);
6598 rb_hash_clear(memo);
6641rb_ary_flatten_bang(
int argc,
VALUE *argv,
VALUE ary)
6643 int mod = 0, level = -1;
6647 rb_ary_modify_check(ary);
6649 if (level == 0)
return Qnil;
6651 result = flatten(ary, level);
6652 if (result == ary) {
6657 if (mod) ARY_SET_EMBED_LEN(result, 0);
6698rb_ary_flatten(
int argc,
VALUE *argv,
VALUE ary)
6705 if (level == 0)
return ary_make_shared_copy(ary);
6708 result = flatten(ary, level);
6709 if (result == ary) {
6710 result = ary_make_shared_copy(ary);
6716#define RAND_UPTO(max) (long)rb_random_ulong_limited((randgen), (max)-1)
6727 long j = RAND_UPTO(i);
6744 rb_ary_shuffle_bang(ec, ary, randgen);
6753 .flags = RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_FREE_IMMEDIATELY
6760 long n,
len, i, j, k, idx[10];
6761 long rnds[numberof(idx)];
6762 long memo_threshold;
6771 return rb_ary_elt(ary, i);
6774 if (n < 0) rb_raise(rb_eArgError,
"negative sample number");
6776 if (n <= numberof(idx)) {
6777 for (i = 0; i < n; ++i) {
6778 rnds[i] = RAND_UPTO(
len - i);
6783 if (
len < k && n <= numberof(idx)) {
6784 for (i = 0; i < n; ++i) {
6794 return rb_ary_new_from_args(1,
RARRAY_AREF(ary, i));
6806 if (j >= i) l = i, g = ++j;
6807 if (k >= l && (++k >= g)) ++k;
6816 if (n <= numberof(idx)) {
6817 long sorted[numberof(idx)];
6818 sorted[0] = idx[0] = rnds[0];
6819 for (i=1; i<n; i++) {
6821 for (j = 0; j < i; ++j) {
6822 if (k < sorted[j])
break;
6825 memmove(&sorted[j+1], &sorted[j],
sizeof(sorted[0])*(i-j));
6826 sorted[j] = idx[i] = k;
6830 for (i=0; i<n; i++) {
6835 else if (n <= memo_threshold / 2) {
6838 st_table *memo = st_init_numtable_with_size(n);
6842 for (i=0; i<n; i++) {
6843 long r = RAND_UPTO(
len-i) + i;
6845 if (r > max_idx) max_idx = r;
6848 if (
len <= max_idx) n = 0;
6849 else if (n >
len) n =
len;
6851 for (i=0; i<n; i++) {
6852 long j2 = j = ptr_result[i];
6855 if (st_lookup(memo, (st_data_t)i, &value)) i2 = (
long)value;
6856 if (st_lookup(memo, (st_data_t)j, &value)) j2 = (
long)value;
6857 st_insert(memo, (st_data_t)j, (st_data_t)i2);
6858 ptr_result[i] = ptr_ary[j2];
6863 st_free_table(memo);
6868 RBASIC_CLEAR_CLASS(result);
6871 for (i=0; i<n; i++) {
6872 j = RAND_UPTO(
len-i) + i;
6874 ptr_result[j] = ptr_result[i];
6878 RBASIC_SET_CLASS_RAW(result,
rb_cArray);
6880 ARY_SET_LEN(result, n);
6908 if (mul <= 0)
return INT2FIX(0);
6910 return rb_fix_mul_fix(rb_ary_length(self), n);
6947rb_ary_cycle(
int argc,
VALUE *argv,
VALUE ary)
6954 if (argc == 0 ||
NIL_P(argv[0])) {
6959 if (n <= 0)
return Qnil;
6962 while (
RARRAY_LEN(ary) > 0 && (n < 0 || 0 < n--)) {
6976yield_indexed_values(
const VALUE values,
const long r,
const long *
const p)
6981 for (i = 0; i < r; i++) ARY_SET(result, i,
RARRAY_AREF(values, p[i]));
6982 ARY_SET_LEN(result, r);
6984 return !
RBASIC(values)->klass;
7000permute0(
const long n,
const long r,
long *
const p,
char *
const used,
const VALUE values)
7002 long i = 0, index = 0;
7005 const char *
const unused = memchr(&used[i], 0, n-i);
7020 for (i = 0; i < n; ++i) {
7021 if (used[i])
continue;
7023 if (!yield_indexed_values(values, r, p)) {
7039descending_factorial(
long from,
long how_many)
7044 while (--how_many > 0) {
7046 cnt = rb_int_mul(cnt,
LONG2FIX(v));
7056binomial_coefficient(
long comb,
long size)
7060 if (comb > size-comb) {
7066 else if (comb == 0) {
7070 for (i = 1; i < comb; ++i) {
7071 r = rb_int_mul(r,
LONG2FIX(size - i));
7072 r = rb_int_idiv(r,
LONG2FIX(i + 1));
7083 return descending_factorial(n, k);
7129rb_ary_permutation(
int argc,
VALUE *argv,
VALUE ary)
7139 if (r < 0 || n < r) {
7152 long *p =
ALLOCV_N(
long, t0, r+roomof(n,
sizeof(
long)));
7153 char *used = (
char*)(p + r);
7154 VALUE ary0 = ary_make_shared_copy(ary);
7155 RBASIC_CLEAR_CLASS(ary0);
7159 permute0(n, r, p, used, ary0);
7167combinate0(
const long len,
const long n,
long *
const stack,
const VALUE values)
7174 for (lev++; lev < n; lev++) {
7175 stack[lev+1] = stack[lev]+1;
7177 if (!yield_indexed_values(values, n, stack+1)) {
7181 if (lev == 0)
return;
7183 }
while (stack[lev+1]+n ==
len+lev+1);
7193 return binomial_coefficient(k, n);
7248 if (n < 0 ||
len < n) {
7260 VALUE ary0 = ary_make_shared_copy(ary);
7262 long *stack =
ALLOCV_N(
long, t0, n+1);
7264 RBASIC_CLEAR_CLASS(ary0);
7265 combinate0(
len, n, stack, ary0);
7285rpermute0(
const long n,
const long r,
long *
const p,
const VALUE values)
7287 long i = 0, index = 0;
7291 if (++index < r-1) {
7295 for (i = 0; i < n; ++i) {
7297 if (!yield_indexed_values(values, r, p)) {
7302 if (index <= 0)
return;
7303 }
while ((i = ++p[--index]) >= n);
7361rb_ary_repeated_permutation(
VALUE ary,
VALUE num)
7383 VALUE ary0 = ary_make_shared_copy(ary);
7384 RBASIC_CLEAR_CLASS(ary0);
7386 rpermute0(n, r, p, ary0);
7394rcombinate0(
const long n,
const long r,
long *
const p,
const long rest,
const VALUE values)
7396 long i = 0, index = 0;
7400 if (++index < r-1) {
7404 for (; i < n; ++i) {
7406 if (!yield_indexed_values(values, r, p)) {
7411 if (index <= 0)
return;
7412 }
while ((i = ++p[--index]) >= n);
7424 return binomial_coefficient(k, n + k - 1);
7467rb_ary_repeated_combination(
VALUE ary,
VALUE num)
7485 else if (
len == 0) {
7491 VALUE ary0 = ary_make_shared_copy(ary);
7492 RBASIC_CLEAR_CLASS(ary0);
7494 rcombinate0(
len, n, p, n, ary0);
7555rb_ary_product(
int argc,
VALUE *argv,
VALUE ary)
7561 int *counters =
ALLOCV_N(
int, t1, n);
7566 RBASIC_CLEAR_CLASS(t0);
7571 for (i = 1; i < n; i++) arrays[i] =
Qnil;
7572 for (i = 1; i < n; i++) arrays[i] = to_ary(argv[i-1]);
7575 for (i = 0; i < n; i++) counters[i] = 0;
7580 for (i = 0; i < n; i++) {
7582 arrays[i] = ary_make_shared_copy(arrays[i]);
7587 for (i = 0; i < n; i++) {
7593 if (MUL_OVERFLOW_LONG_P(resultlen, k))
7603 for (j = 0; j < n; j++) {
7608 if (
NIL_P(result)) {
7609 FL_SET(t0, RARRAY_SHARED_ROOT_FLAG);
7611 if (!
FL_TEST(t0, RARRAY_SHARED_ROOT_FLAG)) {
7615 FL_UNSET(t0, RARRAY_SHARED_ROOT_FLAG);
7628 while (counters[m] ==
RARRAY_LEN(arrays[m])) {
7631 if (--m < 0)
goto done;
7639 return NIL_P(result) ? ary : result;
7665 rb_raise(rb_eArgError,
"attempt to take negative size");
7692rb_ary_take_while(
VALUE ary)
7700 return rb_ary_take(ary,
LONG2FIX(i));
7728 rb_raise(rb_eArgError,
"attempt to drop negative size");
7755rb_ary_drop_while(
VALUE ary)
7763 return rb_ary_drop(ary,
LONG2FIX(i));
7806rb_ary_any_p(
int argc,
VALUE *argv,
VALUE ary)
7814 rb_warn(
"given block not used");
7821 for (i = 0; i <
len; ++i) {
7873rb_ary_all_p(
int argc,
VALUE *argv,
VALUE ary)
7881 rb_warn(
"given block not used");
7888 for (i = 0; i <
len; ++i) {
7934rb_ary_none_p(
int argc,
VALUE *argv,
VALUE ary)
7942 rb_warn(
"given block not used");
7949 for (i = 0; i <
len; ++i) {
7998rb_ary_one_p(
int argc,
VALUE *argv,
VALUE ary)
8007 rb_warn(
"given block not used");
8011 if (result)
return Qfalse;
8017 for (i = 0; i <
len; ++i) {
8019 if (result)
return Qfalse;
8027 if (result)
return Qfalse;
8059 self = rb_ary_at(self, *argv);
8060 if (!--argc)
return self;
8062 return rb_obj_dig(argc, argv, self,
Qnil);
8066finish_exact_sum(
long n,
VALUE r,
VALUE v,
int z)
8071 v = rb_rational_plus(r, v);
8139 goto init_is_a_value;
8153 else if (RB_BIGNUM_TYPE_P(e))
8154 v = rb_big_plus(e, v);
8159 r = rb_rational_plus(r, e);
8164 v = finish_exact_sum(n, r, v, argc!=0);
8168 v = finish_exact_sum(n, r, v, i!=0);
8180 goto has_float_value;
8190 else if (RB_BIGNUM_TYPE_P(e))
8197 if (isnan(f))
continue;
8203 if (isinf(f) && signbit(x) != signbit(f))
8209 if (isinf(f))
continue;
8212 if (fabs(f) >= fabs(x))
8225 goto has_some_value;
8239rb_ary_deconstruct(
VALUE ary)
8750 fake_ary_flags = init_fake_ary_flags();
8877 rb_vm_register_global_object(rb_cArray_empty_frozen);
8880#include "array.rbinc"
#define RUBY_ASSERT_ALWAYS(expr,...)
A variant of RUBY_ASSERT that does not interface with RUBY_DEBUG.
#define RBIMPL_ASSERT_OR_ASSUME(...)
This is either RUBY_ASSERT or RBIMPL_ASSUME, depending on RUBY_DEBUG.
#define RUBY_ASSERT(...)
Asserts that the given expression is truthy if and only if RUBY_DEBUG is truthy.
#define rb_define_method(klass, mid, func, arity)
Defines klass#mid.
#define rb_define_singleton_method(klass, mid, func, arity)
Defines klass.mid.
void rb_include_module(VALUE klass, VALUE module)
Includes a module to a class.
VALUE rb_define_class(const char *name, VALUE super)
Defines a top-level class.
void rb_define_alias(VALUE klass, const char *name1, const char *name2)
Defines an alias of a method.
int rb_scan_args(int argc, const VALUE *argv, const char *fmt,...)
Retrieves argument from argc and argv to given VALUE references according to the format string.
int rb_block_given_p(void)
Determines if the current method is given a block.
#define FL_UNSET_RAW
Old name of RB_FL_UNSET_RAW.
#define rb_str_buf_cat2
Old name of rb_usascii_str_new_cstr.
#define RFLOAT_VALUE
Old name of rb_float_value.
#define T_STRING
Old name of RUBY_T_STRING.
#define Qundef
Old name of RUBY_Qundef.
#define INT2FIX
Old name of RB_INT2FIX.
#define OBJ_FROZEN
Old name of RB_OBJ_FROZEN.
#define rb_str_buf_new2
Old name of rb_str_buf_new_cstr.
#define OBJ_FREEZE
Old name of RB_OBJ_FREEZE.
#define rb_ary_new4
Old name of rb_ary_new_from_values.
#define FIXABLE
Old name of RB_FIXABLE.
#define LONG2FIX
Old name of RB_INT2FIX.
#define T_RATIONAL
Old name of RUBY_T_RATIONAL.
#define ALLOC_N
Old name of RB_ALLOC_N.
#define NUM2DBL
Old name of rb_num2dbl.
#define FL_SET
Old name of RB_FL_SET.
#define rb_ary_new3
Old name of rb_ary_new_from_args.
#define LONG2NUM
Old name of RB_LONG2NUM.
#define rb_usascii_str_new2
Old name of rb_usascii_str_new_cstr.
#define Qtrue
Old name of RUBY_Qtrue.
#define ST2FIX
Old name of RB_ST2FIX.
#define NUM2INT
Old name of RB_NUM2INT.
#define Qnil
Old name of RUBY_Qnil.
#define Qfalse
Old name of RUBY_Qfalse.
#define FIX2LONG
Old name of RB_FIX2LONG.
#define T_ARRAY
Old name of RUBY_T_ARRAY.
#define NIL_P
Old name of RB_NIL_P.
#define ALLOCV_N
Old name of RB_ALLOCV_N.
#define FL_WB_PROTECTED
Old name of RUBY_FL_WB_PROTECTED.
#define DBL2NUM
Old name of rb_float_new.
#define FL_TEST
Old name of RB_FL_TEST.
#define NUM2LONG
Old name of RB_NUM2LONG.
#define FL_UNSET
Old name of RB_FL_UNSET.
#define FIXNUM_P
Old name of RB_FIXNUM_P.
#define rb_ary_new2
Old name of rb_ary_new_capa.
#define FL_SET_RAW
Old name of RB_FL_SET_RAW.
#define ALLOCV_END
Old name of RB_ALLOCV_END.
void rb_category_warn(rb_warning_category_t category, const char *fmt,...)
Identical to rb_category_warning(), except it reports unless $VERBOSE is nil.
void rb_iter_break(void)
Breaks from a block.
VALUE rb_eFrozenError
FrozenError exception.
VALUE rb_eRangeError
RangeError exception.
VALUE rb_eTypeError
TypeError exception.
VALUE rb_eRuntimeError
RuntimeError exception.
void rb_warn(const char *fmt,...)
Identical to rb_warning(), except it reports unless $VERBOSE is nil.
VALUE rb_eIndexError
IndexError exception.
void rb_warning(const char *fmt,...)
Issues a warning.
@ RB_WARN_CATEGORY_DEPRECATED
Warning is for deprecated features.
VALUE rb_cArray
Array class.
VALUE rb_mEnumerable
Enumerable module.
VALUE rb_obj_hide(VALUE obj)
Make the object invisible from Ruby code.
VALUE rb_class_new_instance_pass_kw(int argc, const VALUE *argv, VALUE klass)
Identical to rb_class_new_instance(), except it passes the passed keywords if any to the #initialize ...
VALUE rb_obj_frozen_p(VALUE obj)
Just calls RB_OBJ_FROZEN() inside.
int rb_eql(VALUE lhs, VALUE rhs)
Checks for equality of the passed objects, in terms of Object#eql?.
VALUE rb_cNumeric
Numeric class.
VALUE rb_cRandom
Random class.
VALUE rb_obj_class(VALUE obj)
Queries the class of an object.
VALUE rb_inspect(VALUE obj)
Generates a human-readable textual representation of the given object.
double rb_num2dbl(VALUE num)
Converts an instance of rb_cNumeric into C's double.
VALUE rb_equal(VALUE lhs, VALUE rhs)
This function is an optimised version of calling #==.
VALUE rb_obj_is_kind_of(VALUE obj, VALUE klass)
Queries if the given object is an instance (of possibly descendants) of the given class.
VALUE rb_obj_freeze(VALUE obj)
Just calls rb_obj_freeze_inline() inside.
#define RB_OBJ_WRITTEN(old, oldv, young)
Identical to RB_OBJ_WRITE(), except it doesn't write any values, but only a WB declaration.
#define RB_OBJ_WRITE(old, slot, young)
Declaration of a "back" pointer.
VALUE rb_funcall(VALUE recv, ID mid, int n,...)
Calls a method.
VALUE rb_call_super(int argc, const VALUE *argv)
This resembles ruby's super.
#define RGENGC_WB_PROTECTED_ARRAY
This is a compile-time flag to enable/disable write barrier for struct RArray.
VALUE rb_ary_rotate(VALUE ary, long rot)
Destructively rotates the passed array in-place to towards its end.
VALUE rb_ary_new_from_values(long n, const VALUE *elts)
Identical to rb_ary_new_from_args(), except how objects are passed.
VALUE rb_ary_cmp(VALUE lhs, VALUE rhs)
Recursively compares each elements of the two arrays one-by-one using <=>.
VALUE rb_ary_rassoc(VALUE alist, VALUE key)
Identical to rb_ary_assoc(), except it scans the passed array from the opposite direction.
VALUE rb_ary_concat(VALUE lhs, VALUE rhs)
Destructively appends the contents of latter into the end of former.
VALUE rb_ary_assoc(VALUE alist, VALUE key)
Looks up the passed key, assuming the passed array is an alist.
VALUE rb_ary_reverse(VALUE ary)
Destructively reverses the passed array in-place.
VALUE rb_ary_shared_with_p(VALUE lhs, VALUE rhs)
Queries if the passed two arrays share the same backend storage.
VALUE rb_ary_shift(VALUE ary)
Destructively deletes an element from the beginning of the passed array and returns what was deleted.
VALUE rb_ary_sort(VALUE ary)
Creates a copy of the passed array, whose elements are sorted according to their <=> result.
VALUE rb_ary_resurrect(VALUE ary)
I guess there is no use case of this function in extension libraries, but this is a routine identical...
VALUE rb_ary_dup(VALUE ary)
Duplicates an array.
VALUE rb_ary_includes(VALUE ary, VALUE elem)
Queries if the passed array has the passed entry.
VALUE rb_ary_aref(int argc, const VALUE *argv, VALUE ary)
Queries element(s) of an array.
VALUE rb_get_values_at(VALUE obj, long olen, int argc, const VALUE *argv, VALUE(*func)(VALUE obj, long oidx))
This was a generalisation of Array#values_at, Struct#values_at, and MatchData#values_at.
void rb_ary_free(VALUE ary)
Destroys the given array for no reason.
VALUE rb_ary_each(VALUE ary)
Iteratively yields each element of the passed array to the implicitly passed block if any.
VALUE rb_ary_delete_at(VALUE ary, long pos)
Destructively removes an element which resides at the specific index of the passed array.
VALUE rb_ary_plus(VALUE lhs, VALUE rhs)
Creates a new array, concatenating the former to the latter.
VALUE rb_ary_cat(VALUE ary, const VALUE *train, long len)
Destructively appends multiple elements at the end of the array.
void rb_ary_modify(VALUE ary)
Declares that the array is about to be modified.
VALUE rb_ary_replace(VALUE copy, VALUE orig)
Replaces the contents of the former object with the contents of the latter.
VALUE rb_check_array_type(VALUE obj)
Try converting an object to its array representation using its to_ary method, if any.
VALUE rb_ary_to_ary(VALUE obj)
Force converts an object to an array.
VALUE rb_ary_new(void)
Allocates a new, empty array.
VALUE rb_ary_new_capa(long capa)
Identical to rb_ary_new(), except it additionally specifies how many rooms of objects it should alloc...
VALUE rb_ary_resize(VALUE ary, long len)
Expands or shrinks the passed array to the passed length.
VALUE rb_ary_pop(VALUE ary)
Destructively deletes an element from the end of the passed array and returns what was deleted.
VALUE rb_ary_hidden_new(long capa)
Allocates a hidden (no class) empty array.
VALUE rb_ary_clear(VALUE ary)
Destructively removes everything form an array.
VALUE rb_ary_subseq(VALUE ary, long beg, long len)
Obtains a part of the passed array.
VALUE rb_ary_push(VALUE ary, VALUE elem)
Special case of rb_ary_cat() that it adds only one element.
VALUE rb_ary_freeze(VALUE obj)
Freeze an array, preventing further modifications.
VALUE rb_ary_to_s(VALUE ary)
Converts an array into a human-readable string.
VALUE rb_ary_entry(VALUE ary, long off)
Queries an element of an array.
VALUE rb_ary_sort_bang(VALUE ary)
Destructively sorts the passed array in-place, according to each elements' <=> result.
VALUE rb_assoc_new(VALUE car, VALUE cdr)
Identical to rb_ary_new_from_values(), except it expects exactly two parameters.
void rb_mem_clear(VALUE *buf, long len)
Fills the memory region with a series of RUBY_Qnil.
VALUE rb_ary_delete(VALUE ary, VALUE elem)
Destructively removes elements from the passed array, so that there would be no elements inside that ...
VALUE rb_ary_join(VALUE ary, VALUE sep)
Recursively stringises the elements of the passed array, flattens that result, then joins the sequenc...
void rb_ary_store(VALUE ary, long key, VALUE val)
Destructively stores the passed value to the passed array's passed index.
#define RETURN_SIZED_ENUMERATOR(obj, argc, argv, size_fn)
This roughly resembles return enum_for(__callee__) unless block_given?.
#define RETURN_ENUMERATOR(obj, argc, argv)
Identical to RETURN_SIZED_ENUMERATOR(), except its size is unknown.
#define UNLIMITED_ARGUMENTS
This macro is used in conjunction with rb_check_arity().
static int rb_check_arity(int argc, int min, int max)
Ensures that the passed integer is in the passed range.
VALUE rb_output_fs
The field separator character for outputs, or the $,.
VALUE rb_int_positive_pow(long x, unsigned long y)
Raises the passed x to the power of y.
VALUE rb_range_beg_len(VALUE range, long *begp, long *lenp, long len, int err)
Deconstructs a numerical range.
#define rb_hash_uint(h, i)
Just another name of st_hash_uint.
#define rb_hash_end(h)
Just another name of st_hash_end.
#define rb_str_new(str, len)
Allocates an instance of rb_cString.
#define rb_usascii_str_new(str, len)
Identical to rb_str_new, except it generates a string of "US ASCII" encoding.
#define rb_usascii_str_new_cstr(str)
Identical to rb_str_new_cstr, except it generates a string of "US ASCII" encoding.
VALUE rb_str_buf_append(VALUE dst, VALUE src)
Identical to rb_str_cat_cstr(), except it takes Ruby's string instead of C's.
void rb_str_set_len(VALUE str, long len)
Overwrites the length of the string.
st_index_t rb_hash_start(st_index_t i)
Starts a series of hashing.
int rb_str_cmp(VALUE lhs, VALUE rhs)
Compares two strings, as in strcmp(3).
VALUE rb_check_string_type(VALUE obj)
Try converting an object to its stringised representation using its to_str method,...
VALUE rb_str_buf_new(long capa)
Allocates a "string buffer".
VALUE rb_obj_as_string(VALUE obj)
Try converting an object to its stringised representation using its to_s method, if any.
VALUE rb_exec_recursive(VALUE(*f)(VALUE g, VALUE h, int r), VALUE g, VALUE h)
"Recursion" API entry point.
VALUE rb_exec_recursive_paired(VALUE(*f)(VALUE g, VALUE h, int r), VALUE g, VALUE p, VALUE h)
Identical to rb_exec_recursive(), except it checks for the recursion on the ordered pair of { g,...
int rb_respond_to(VALUE obj, ID mid)
Queries if the object responds to the method.
void rb_define_alloc_func(VALUE klass, rb_alloc_func_t func)
Sets the allocator function of a class.
int capa
Designed capacity of the buffer.
int len
Length of the buffer.
void ruby_qsort(void *, const size_t, const size_t, int(*)(const void *, const void *, void *), void *)
Reentrant implementation of quick sort.
#define RB_BLOCK_CALL_FUNC_ARGLIST(yielded_arg, callback_arg)
Shim for block function parameters.
VALUE rb_yield_values(int n,...)
Identical to rb_yield(), except it takes variadic number of parameters and pass them to the block.
VALUE rb_yield_values2(int n, const VALUE *argv)
Identical to rb_yield_values(), except it takes the parameters as a C array instead of variadic argum...
VALUE rb_yield(VALUE val)
Yields the block.
#define RBIMPL_ATTR_MAYBE_UNUSED()
Wraps (or simulates) [[maybe_unused]]
#define MEMCPY(p1, p2, type, n)
Handy macro to call memcpy.
#define MEMZERO(p, type, n)
Handy macro to erase a region of memory.
#define RB_GC_GUARD(v)
Prevents premature destruction of local objects.
#define MEMMOVE(p1, p2, type, n)
Handy macro to call memmove.
VALUE rb_block_call(VALUE q, ID w, int e, const VALUE *r, type *t, VALUE y)
Call a method with a block.
void rb_hash_foreach(VALUE q, int_type *w, VALUE e)
Iteration over the given hash.
VALUE rb_ensure(type *q, VALUE w, type *e, VALUE r)
An equivalent of ensure clause.
#define RARRAY_LEN
Just another name of rb_array_len.
#define RARRAY(obj)
Convenient casting macro.
static void RARRAY_ASET(VALUE ary, long i, VALUE v)
Assigns an object in an array.
#define RARRAY_PTR_USE(ary, ptr_name, expr)
Declares a section of code where raw pointers are used.
static VALUE * RARRAY_PTR(VALUE ary)
Wild use of a C pointer.
#define RARRAY_AREF(a, i)
#define RARRAY_CONST_PTR
Just another name of rb_array_const_ptr.
#define RBASIC(obj)
Convenient casting macro.
void(* RUBY_DATA_FUNC)(void *)
This is the type of callbacks registered to RData.
#define RHASH_SIZE(h)
Queries the size of the hash.
#define StringValue(v)
Ensures that the parameter object is a String.
#define RTYPEDDATA_DATA(v)
Convenient getter macro.
#define TypedData_Wrap_Struct(klass, data_type, sval)
Converts sval, a pointer to your struct, into a Ruby object.
#define RB_PASS_CALLED_KEYWORDS
Pass keywords if current method is called with keywords, useful for argument delegation.
#define RTEST
This is an old name of RB_TEST.
union RArray::@45 as
Array's specific fields.
struct RBasic basic
Basic part, including flags and class.
struct RArray::@45::@46 heap
Arrays that use separated memory region for elements use this pattern.
const VALUE shared_root
Parent of the array.
const VALUE ary[1]
Embedded elements.
long capa
Capacity of *ptr.
long len
Number of elements of the array.
union RArray::@45::@46::@47 aux
Auxiliary info.
const VALUE * ptr
Pointer to the C array that holds the elements of the array.
VALUE flags
Per-object flags.
This is the struct that holds necessary info for a struct.
const char * wrap_struct_name
Name of structs of this kind.
intptr_t SIGNED_VALUE
A signed integer type that has the same width with VALUE.
uintptr_t VALUE
Type that represents a Ruby object.
static bool RB_FLOAT_TYPE_P(VALUE obj)
Queries if the object is an instance of rb_cFloat.
static bool RB_TYPE_P(VALUE obj, enum ruby_value_type t)
Queries if the given object is of given type.