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"
38 #include "ruby_assert.h"
41 VALUE rb_cArray_empty_frozen;
70 #define ARY_DEFAULT_SIZE 16
71 #define ARY_MAX_SIZE (LONG_MAX / (int)sizeof(VALUE))
72 #define SMALL_ARRAY_LEN 16
76 should_be_T_ARRAY(
VALUE ary)
81 #define ARY_HEAP_PTR(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.ptr)
82 #define ARY_HEAP_LEN(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RARRAY(a)->as.heap.len)
83 #define ARY_HEAP_CAPA(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RUBY_ASSERT(!ARY_SHARED_ROOT_P(a)), \
84 RARRAY(a)->as.heap.aux.capa)
86 #define ARY_EMBED_PTR(a) (RUBY_ASSERT(ARY_EMBED_P(a)), RARRAY(a)->as.ary)
87 #define ARY_EMBED_LEN(a) \
88 (RUBY_ASSERT(ARY_EMBED_P(a)), \
89 (long)((RBASIC(a)->flags >> RARRAY_EMBED_LEN_SHIFT) & \
90 (RARRAY_EMBED_LEN_MASK >> RARRAY_EMBED_LEN_SHIFT)))
91 #define ARY_HEAP_SIZE(a) (RUBY_ASSERT(!ARY_EMBED_P(a)), RUBY_ASSERT(ARY_OWNS_HEAP_P(a)), ARY_CAPA(a) * sizeof(VALUE))
93 #define ARY_OWNS_HEAP_P(a) (RUBY_ASSERT(should_be_T_ARRAY((VALUE)(a))), \
94 !FL_TEST_RAW((a), RARRAY_SHARED_FLAG|RARRAY_EMBED_FLAG))
96 #define FL_SET_EMBED(a) do { \
97 RUBY_ASSERT(!ARY_SHARED_P(a)); \
98 FL_SET((a), RARRAY_EMBED_FLAG); \
102 #define FL_UNSET_EMBED(ary) FL_UNSET((ary), RARRAY_EMBED_FLAG|RARRAY_EMBED_LEN_MASK)
103 #define FL_SET_SHARED(ary) do { \
104 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
105 FL_SET((ary), RARRAY_SHARED_FLAG); \
107 #define FL_UNSET_SHARED(ary) FL_UNSET((ary), RARRAY_SHARED_FLAG)
109 #define ARY_SET_PTR(ary, p) do { \
110 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
111 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
112 RARRAY(ary)->as.heap.ptr = (p); \
114 #define ARY_SET_EMBED_LEN(ary, n) do { \
116 RUBY_ASSERT(ARY_EMBED_P(ary)); \
117 RBASIC(ary)->flags &= ~RARRAY_EMBED_LEN_MASK; \
118 RBASIC(ary)->flags |= (tmp_n) << RARRAY_EMBED_LEN_SHIFT; \
120 #define ARY_SET_HEAP_LEN(ary, n) do { \
121 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
122 RARRAY(ary)->as.heap.len = (n); \
124 #define ARY_SET_LEN(ary, n) do { \
125 if (ARY_EMBED_P(ary)) { \
126 ARY_SET_EMBED_LEN((ary), (n)); \
129 ARY_SET_HEAP_LEN((ary), (n)); \
131 RUBY_ASSERT(RARRAY_LEN(ary) == (n)); \
133 #define ARY_INCREASE_PTR(ary, n) do { \
134 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
135 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
136 RARRAY(ary)->as.heap.ptr += (n); \
138 #define ARY_INCREASE_LEN(ary, n) do { \
139 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
140 if (ARY_EMBED_P(ary)) { \
141 ARY_SET_EMBED_LEN((ary), RARRAY_LEN(ary)+(n)); \
144 RARRAY(ary)->as.heap.len += (n); \
148 #define ARY_CAPA(ary) (ARY_EMBED_P(ary) ? ary_embed_capa(ary) : \
149 ARY_SHARED_ROOT_P(ary) ? RARRAY_LEN(ary) : ARY_HEAP_CAPA(ary))
150 #define ARY_SET_CAPA(ary, n) do { \
151 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
152 RUBY_ASSERT(!ARY_SHARED_P(ary)); \
153 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
154 RARRAY(ary)->as.heap.aux.capa = (n); \
157 #define ARY_SHARED_ROOT_OCCUPIED(ary) (!OBJ_FROZEN(ary) && ARY_SHARED_ROOT_REFCNT(ary) == 1)
158 #define ARY_SET_SHARED_ROOT_REFCNT(ary, value) do { \
159 RUBY_ASSERT(ARY_SHARED_ROOT_P(ary)); \
160 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
161 RUBY_ASSERT((value) >= 0); \
162 RARRAY(ary)->as.heap.aux.capa = (value); \
164 #define FL_SET_SHARED_ROOT(ary) do { \
165 RUBY_ASSERT(!OBJ_FROZEN(ary)); \
166 RUBY_ASSERT(!ARY_EMBED_P(ary)); \
167 FL_SET((ary), RARRAY_SHARED_ROOT_FLAG); \
181 ary_embed_capa(
VALUE ary)
183 size_t size = rb_gc_obj_slot_size(ary) - offsetof(
struct RArray, as.
ary);
185 return size /
sizeof(
VALUE);
189 ary_embed_size(
long capa)
195 ary_embeddable_p(
long capa)
197 return rb_gc_size_allocatable_p(ary_embed_size(
capa));
201 rb_ary_embeddable_p(
VALUE ary)
211 return !(ARY_SHARED_ROOT_P(ary) ||
OBJ_FROZEN(ary) || ARY_SHARED_P(ary));
215 rb_ary_size_as_embedded(
VALUE ary)
219 if (ARY_EMBED_P(ary)) {
220 real_size = ary_embed_size(ARY_EMBED_LEN(ary));
222 else if (rb_ary_embeddable_p(ary)) {
223 real_size = ary_embed_size(ARY_HEAP_CAPA(ary));
226 real_size =
sizeof(
struct RArray);
233 #define ary_verify(ary) ary_verify_(ary, __FILE__, __LINE__)
236 ary_verify_(
VALUE ary,
const char *file,
int line)
240 if (ARY_SHARED_P(
ary)) {
249 else if (ARY_EMBED_P(
ary)) {
258 for (i=0; i<
len; i++) {
273 #define ary_verify(ary) ((void)0)
302 ary_mem_clear(
VALUE ary,
long beg,
long size)
310 memfill(
register VALUE *mem,
register long size,
register VALUE val)
321 memfill(
ptr + beg, size, val);
331 if (argc > (
int)(128/
sizeof(
VALUE)) ) {
332 rb_gc_writebarrier_remember(buff_owner_ary);
340 for (i=0; i<argc; i++) {
348 ary_memcpy(
VALUE ary,
long beg,
long argc,
const VALUE *argv)
350 ary_memcpy0(
ary, beg, argc, argv,
ary);
354 ary_heap_alloc_buffer(
size_t capa)
362 ruby_sized_xfree((
void *)
ptr, size);
368 ary_heap_free_ptr(
ary, ARY_HEAP_PTR(
ary), ARY_HEAP_SIZE(
ary));
372 ary_heap_realloc(
VALUE ary,
size_t new_capa)
385 if (!ARY_EMBED_P(
ary)) {
386 const VALUE *buf = ARY_HEAP_PTR(
ary);
387 long len = ARY_HEAP_LEN(
ary);
390 ARY_SET_EMBED_LEN(
ary,
len);
399 ary_resize_capa(
VALUE ary,
long capacity)
405 if (capacity > ary_embed_capa(
ary)) {
406 size_t new_capa = capacity;
407 if (ARY_EMBED_P(
ary)) {
408 long len = ARY_EMBED_LEN(
ary);
409 VALUE *
ptr = ary_heap_alloc_buffer(capacity);
414 ARY_SET_HEAP_LEN(
ary,
len);
417 new_capa = ary_heap_realloc(
ary, capacity);
419 ARY_SET_CAPA(
ary, new_capa);
422 if (!ARY_EMBED_P(
ary)) {
423 long len = ARY_HEAP_LEN(
ary);
424 long old_capa = ARY_HEAP_CAPA(
ary);
427 if (
len > capacity)
len = capacity;
429 ary_heap_free_ptr(
ary,
ptr, old_capa);
442 long capacity = ARY_HEAP_LEN(
ary);
443 long old_capa = ARY_HEAP_CAPA(
ary);
446 if (old_capa > capacity) {
447 size_t new_capa = ary_heap_realloc(
ary, capacity);
448 ARY_SET_CAPA(
ary, new_capa);
455 ary_double_capa(
VALUE ary,
long min)
457 long new_capa = ARY_CAPA(
ary) / 2;
459 if (new_capa < ARY_DEFAULT_SIZE) {
460 new_capa = ARY_DEFAULT_SIZE;
462 if (new_capa >= ARY_MAX_SIZE - min) {
463 new_capa = (ARY_MAX_SIZE - min) / 2;
466 ary_resize_capa(
ary, new_capa);
485 FL_UNSET_SHARED(
ary);
491 if (ARY_OWNS_HEAP_P(
ary)) {
494 else if (ARY_SHARED_P(
ary)) {
499 ARY_SET_EMBED_LEN(
ary, 0);
524 RB_DEBUG_COUNTER_INC(obj_ary_shared_create);
530 rb_check_frozen(
ary);
537 if (ARY_SHARED_P(
ary)) {
543 if (
len <= ary_embed_capa(
ary)) {
545 FL_UNSET_SHARED(
ary);
549 ARY_SET_EMBED_LEN(
ary,
len);
553 FL_UNSET_SHARED(
ary);
555 ARY_SET_CAPA(
ary, shared_len);
570 rb_gc_writebarrier_remember(
ary);
578 rb_ary_modify_check(
ary);
579 rb_ary_cancel_sharing(
ary);
583 ary_ensure_room_for_push(
VALUE ary,
long add_len)
586 long new_len = old_len + add_len;
589 if (old_len > ARY_MAX_SIZE - add_len) {
592 if (ARY_SHARED_P(
ary)) {
593 if (new_len > ary_embed_capa(
ary)) {
597 rb_ary_modify_check(
ary);
608 ary_double_capa(
ary, new_len);
619 rb_ary_modify_check(
ary);
622 if (new_len >
capa) {
623 ary_double_capa(
ary, new_len);
654 if (!ARY_EMBED_P(
ary) && !ARY_SHARED_P(
ary) && !ARY_SHARED_ROOT_P(
ary)) {
655 ary_shrink_capa(
ary);
671 if (!ARY_EMBED_P(ary1) && ARY_SHARED_P(ary1) &&
672 !ARY_EMBED_P(ary2) && ARY_SHARED_P(ary2) &&
673 ARY_SHARED_ROOT(ary1) == ARY_SHARED_ROOT(ary2) &&
674 ARY_HEAP_LEN(ary1) == ARY_HEAP_LEN(ary2)) {
683 size_t size = ary_embed_size(
capa);
696 ary_alloc_heap(
VALUE klass)
700 sizeof(
struct RArray), 0);
705 empty_ary_alloc(
VALUE klass)
707 RUBY_DTRACE_CREATE_HOOK(ARRAY, 0);
708 return ary_alloc_embed(klass, 0);
719 if (
capa > ARY_MAX_SIZE) {
723 RUBY_DTRACE_CREATE_HOOK(ARRAY,
capa);
725 if (ary_embeddable_p(
capa)) {
726 ary = ary_alloc_embed(klass,
capa);
729 ary = ary_alloc_heap(klass);
733 ARY_SET_PTR(
ary, ary_heap_alloc_buffer(
capa));
734 ARY_SET_HEAP_LEN(
ary, 0);
762 for (i=0; i<n; i++) {
772 rb_ary_tmp_new_from_values(
VALUE klass,
long n,
const VALUE *elts)
776 ary = ary_new(klass, n);
778 ary_memcpy(
ary, 0, n, elts);
788 return rb_ary_tmp_new_from_values(
rb_cArray, n, elts);
794 size_t size = ary_embed_size(
capa);
811 sizeof(
struct RArray), ec);
823 if (
capa > ARY_MAX_SIZE) {
827 RUBY_DTRACE_CREATE_HOOK(ARRAY,
capa);
829 if (ary_embeddable_p(
capa)) {
830 ary = ec_ary_alloc_embed(ec, klass,
capa);
833 ary = ec_ary_alloc_heap(ec, klass);
837 ARY_SET_PTR(
ary, ary_heap_alloc_buffer(
capa));
838 ARY_SET_HEAP_LEN(
ary, 0);
851 ary_memcpy(
ary, 0, n, elts);
866 rb_ary_hidden_new_fill(
long capa)
877 if (ARY_OWNS_HEAP_P(
ary)) {
878 if (USE_DEBUG_COUNTER &&
879 !ARY_SHARED_ROOT_P(
ary) &&
881 RB_DEBUG_COUNTER_INC(obj_ary_extracapa);
884 RB_DEBUG_COUNTER_INC(obj_ary_ptr);
888 RB_DEBUG_COUNTER_INC(obj_ary_embed);
891 if (ARY_SHARED_P(
ary)) {
892 RB_DEBUG_COUNTER_INC(obj_ary_shared);
894 if (ARY_SHARED_ROOT_P(
ary) && ARY_SHARED_ROOT_OCCUPIED(
ary)) {
895 RB_DEBUG_COUNTER_INC(obj_ary_shared_root_occupied);
899 static VALUE fake_ary_flags;
902 init_fake_ary_flags(
void)
904 struct RArray fake_ary = {0};
912 rb_setup_fake_ary(
struct RArray *fake_ary,
const VALUE *list,
long len)
915 RBASIC_CLEAR_CLASS((
VALUE)fake_ary);
918 fake_ary->
as.
heap.ptr = list;
921 return (
VALUE)fake_ary;
927 if (ARY_OWNS_HEAP_P(
ary)) {
928 return ARY_CAPA(
ary) *
sizeof(
VALUE);
940 if (ARY_SHARED_P(
ary)) {
941 return ARY_SHARED_ROOT(
ary);
943 else if (ARY_SHARED_ROOT_P(
ary)) {
955 VALUE shared = ary_alloc_heap(0);
956 FL_SET_SHARED_ROOT(shared);
958 if (ARY_EMBED_P(
ary)) {
960 ARY_SET_PTR(shared,
ptr);
964 ARY_SET_HEAP_LEN(
ary,
len);
971 ARY_SET_LEN(shared,
capa);
973 rb_ary_set_shared(
ary, shared);
987 if (ary_embeddable_p(
len)) {
992 ARY_SET_EMBED_LEN(subst,
len);
996 return rb_ary_increment_share(ary_make_shared(
ary));
1009 return rb_convert_type_with_id(
ary,
T_ARRAY,
"Array", idTo_ary);
1011 #define to_ary rb_to_array_type
1016 return rb_check_convert_type_with_id(
ary,
T_ARRAY,
"Array", idTo_ary);
1022 return rb_check_convert_type_with_id(
ary,
T_ARRAY,
"Array", idTo_a);
1028 return rb_convert_type_with_id(
ary,
T_ARRAY,
"Array", idTo_a);
1057 rb_ary_s_new(
int argc,
VALUE *argv,
VALUE klass)
1063 if (argc > 0 &&
FIXNUM_P(argv[0])) {
1065 if (size < 0) size = 0;
1068 ary = ary_new(klass, size);
1147 if (argc == 1 && !
FIXNUM_P(size)) {
1160 if (
len > ARY_MAX_SIZE) {
1165 ary_resize_capa(
ary,
len);
1170 rb_warn(
"block supersedes default value argument");
1172 for (i=0; i<
len; i++) {
1174 ARY_SET_LEN(
ary, i + 1);
1178 ary_memfill(
ary, 0,
len, val);
1195 rb_ary_s_create(
int argc,
VALUE *argv,
VALUE klass)
1198 if (argc > 0 && argv) {
1199 ary_memcpy(
ary, 0, argc, argv);
1200 ARY_SET_LEN(
ary, argc);
1218 else if (idx >= ARY_MAX_SIZE) {
1223 if (idx >= ARY_CAPA(
ary)) {
1224 ary_double_capa(
ary, idx);
1231 ARY_SET_LEN(
ary, idx + 1);
1233 ARY_SET(
ary, idx, val);
1243 VALUE result = ary_alloc_heap(klass);
1244 size_t embed_capa = ary_embed_capa(result);
1245 if ((
size_t)
len <= embed_capa) {
1246 FL_SET_EMBED(result);
1248 ARY_SET_EMBED_LEN(result,
len);
1251 VALUE shared = ary_make_shared(
ary);
1256 FL_UNSET_EMBED(result);
1260 rb_ary_set_shared(result, shared);
1262 ARY_INCREASE_PTR(result, offset);
1263 ARY_SET_LEN(result,
len);
1273 ary_make_partial_step(
VALUE ary,
VALUE klass,
long offset,
long len,
long step)
1280 const long orig_len =
len;
1282 if (step > 0 && step >=
len) {
1283 VALUE result = ary_new(klass, 1);
1288 ARY_SET_EMBED_LEN(result, 1);
1291 else if (step < 0 && step < -
len) {
1295 long ustep = (step < 0) ? -step : step;
1296 len = roomof(
len, ustep);
1299 long j = offset + ((step > 0) ? 0 : (orig_len - 1));
1301 VALUE result = ary_new(klass,
len);
1302 if (ARY_EMBED_P(result)) {
1306 for (i = 0; i <
len; ++i) {
1310 ARY_SET_EMBED_LEN(result,
len);
1316 for (i = 0; i <
len; ++i) {
1321 ARY_SET_LEN(result,
len);
1333 enum ary_take_pos_flags
1340 ary_take_first_or_last_n(
VALUE ary,
long n,
enum ary_take_pos_flags last)
1358 ary_take_first_or_last(
int argc,
const VALUE *argv,
VALUE ary,
enum ary_take_pos_flags last)
1365 return ary_take_first_or_last_n(
ary,
NUM2LONG(argv[0]), last);
1387 VALUE target_ary = ary_ensure_room_for_push(
ary, 1);
1391 ARY_SET_LEN(
ary, idx + 1);
1400 VALUE target_ary = ary_ensure_room_for_push(
ary,
len);
1401 ary_memcpy0(
ary, oldlen,
len, argv, target_ary);
1402 ARY_SET_LEN(
ary, oldlen +
len);
1434 rb_ary_modify_check(
ary);
1436 if (n == 0)
return Qnil;
1437 if (ARY_OWNS_HEAP_P(
ary) &&
1438 n * 3 < ARY_CAPA(
ary) &&
1439 ARY_CAPA(
ary) > ARY_DEFAULT_SIZE)
1441 ary_resize_capa(
ary, n * 2);
1444 ARY_SET_LEN(
ary, n);
1488 rb_ary_modify_check(
ary);
1489 result = ary_take_first_or_last(argc, argv,
ary, ARY_TAKE_LAST);
1502 rb_ary_modify_check(
ary);
1508 rb_ary_behead(
ary, 1);
1561 rb_ary_modify_check(
ary);
1562 result = ary_take_first_or_last(argc, argv,
ary, ARY_TAKE_FIRST);
1564 rb_ary_behead(
ary,n);
1576 rb_ary_modify_check(
ary);
1578 if (!ARY_SHARED_P(
ary)) {
1583 ARY_INCREASE_LEN(
ary, -n);
1588 ary_mem_clear(
ary, 0, n);
1589 ary_make_shared(
ary);
1591 else if (ARY_SHARED_ROOT_OCCUPIED(ARY_SHARED_ROOT(
ary))) {
1592 ary_mem_clear(
ary, 0, n);
1595 ARY_INCREASE_PTR(
ary, n);
1596 ARY_INCREASE_LEN(
ary, -n);
1605 if (head - sharedp < argc) {
1606 long room =
capa -
len - argc;
1610 head = sharedp + argc + room;
1612 ARY_SET_PTR(
ary, head - argc);
1616 return ARY_SHARED_ROOT(
ary);
1620 ary_modify_for_unshift(
VALUE ary,
int argc)
1623 long new_len =
len + argc;
1625 const VALUE *head, *sharedp;
1629 if (
capa - (
capa >> 6) <= new_len) {
1630 ary_double_capa(
ary, new_len);
1634 if (new_len > ARY_DEFAULT_SIZE * 4 && !ARY_EMBED_P(
ary)) {
1639 ary_make_shared(
ary);
1642 return make_room_for_unshift(
ary, head, (
void *)sharedp, argc,
capa,
len);
1656 ary_ensure_room_for_unshift(
VALUE ary,
int argc)
1659 long new_len =
len + argc;
1661 if (
len > ARY_MAX_SIZE - argc) {
1664 else if (! ARY_SHARED_P(
ary)) {
1665 return ary_modify_for_unshift(
ary, argc);
1672 return ary_modify_for_unshift(
ary, argc);
1674 else if (new_len >
capa) {
1675 return ary_modify_for_unshift(
ary, argc);
1681 rb_ary_modify_check(
ary);
1682 return make_room_for_unshift(
ary, head, sharedp, argc,
capa,
len);
1708 rb_ary_modify_check(
ary);
1712 target_ary = ary_ensure_room_for_unshift(
ary, argc);
1713 ary_memcpy0(
ary, 0, argc, argv, target_ary);
1714 ARY_SET_LEN(
ary,
len + argc);
1721 return rb_ary_unshift_m(1, &item,
ary);
1730 if (offset < 0 ||
len <= offset) {
1739 return rb_ary_entry_internal(
ary, offset);
1743 rb_ary_subseq_step(
VALUE ary,
long beg,
long len,
long step)
1748 if (beg > alen)
return Qnil;
1749 if (beg < 0 ||
len < 0)
return Qnil;
1751 if (alen <
len || alen < beg +
len) {
1755 if (
len == 0)
return ary_new(klass, 0);
1759 return ary_make_partial(
ary, klass, beg,
len);
1761 return ary_make_partial_step(
ary, klass, beg,
len, step);
1767 return rb_ary_subseq_step(
ary, beg,
len, 1);
1899 return rb_ary_aref2(
ary, argv[0], argv[1]);
1901 return rb_ary_aref1(
ary, argv[0]);
1918 long beg,
len, step;
1931 return rb_ary_subseq_step(
ary, beg,
len, step);
1976 return ary_take_first_or_last(argc, argv,
ary, ARY_TAKE_FIRST);
1982 ary_first(
VALUE self)
1988 ary_last(
VALUE self)
1998 return ary_last(
ary);
2001 return ary_take_first_or_last(argc, argv,
ary, ARY_TAKE_LAST);
2054 if (block_given && argc == 2) {
2055 rb_warn(
"block supersedes default value argument");
2063 if (block_given)
return rb_yield(pos);
2125 rb_warn(
"given block not used");
2183 rb_warn(
"given block not used");
2201 if (!
NIL_P(tmp))
return tmp;
2220 if (olen <
len || olen < beg +
len) {
2226 rofs = (rptr >= optr && rptr < optr + olen) ? rptr - optr : -1;
2231 if (beg > ARY_MAX_SIZE - rlen) {
2234 target_ary = ary_ensure_room_for_push(
ary, rlen-
len);
2236 ary_mem_clear(
ary, olen, beg - olen);
2239 ary_memcpy0(
ary, beg, rlen, rptr, target_ary);
2246 if (olen -
len > ARY_MAX_SIZE - rlen) {
2250 alen = olen + rlen -
len;
2251 if (alen >= ARY_CAPA(
ary)) {
2252 ary_double_capa(
ary, alen);
2259 ARY_SET_LEN(
ary, alen);
2263 rb_gc_writebarrier_remember(
ary);
2285 rb_ary_modify_check(
ary);
2286 if (ARY_SHARED_P(
ary)) {
2302 if (
len == olen)
return ary;
2303 if (
len > ARY_MAX_SIZE) {
2307 if (
len >= ARY_CAPA(
ary)) {
2308 ary_double_capa(
ary,
len);
2310 ary_mem_clear(
ary, olen,
len - olen);
2313 else if (ARY_EMBED_P(
ary)) {
2314 ARY_SET_EMBED_LEN(
ary,
len);
2316 else if (
len <= ary_embed_capa(
ary)) {
2318 long ptr_capa = ARY_HEAP_SIZE(
ary);
2319 bool is_malloc_ptr = !ARY_SHARED_P(
ary);
2324 ARY_SET_EMBED_LEN(
ary,
len);
2326 if (is_malloc_ptr) ruby_sized_xfree((
void *)
ptr, ptr_capa);
2329 if (olen >
len + ARY_DEFAULT_SIZE) {
2330 size_t new_capa = ary_heap_realloc(
ary,
len);
2331 ARY_SET_CAPA(
ary, new_capa);
2333 ARY_SET_HEAP_LEN(
ary,
len);
2502 long offset, beg,
len;
2505 rb_ary_modify_check(
ary);
2509 return ary_aset_by_rb_ary_splice(
ary, beg,
len, argv[2]);
2513 return ary_aset_by_rb_ary_store(
ary, offset, argv[1]);
2517 return ary_aset_by_rb_ary_splice(
ary, beg,
len, argv[1]);
2521 return ary_aset_by_rb_ary_store(
ary, offset, argv[1]);
2566 rb_ary_modify_check(
ary);
2568 if (argc == 1)
return ary;
2580 rb_ary_splice(
ary, pos, 0, argv + 1, argc - 1);
2590 return rb_ary_length(
ary);
2782 ARY_SET_LEN(dup,
len);
2800 recursive_join(
VALUE obj,
VALUE argp,
int recur)
2805 VALUE result = arg[2];
2806 int *first = (
int *)arg[3];
2812 ary_join_1(obj,
ary, sep, 0, result, first);
2824 for (i=0; i<max; i++) {
2827 if (i > 0 && !
NIL_P(sep))
2835 ary_join_1_str(
VALUE dst,
VALUE src,
int *first)
2857 args[3] = (
VALUE)first;
2868 if (i > 0 && !
NIL_P(sep))
2873 ary_join_1_str(result, val, first);
2876 ary_join_1_ary(val,
ary, sep, result, val, first);
2879 ary_join_1_str(result, tmp, first);
2882 ary_join_1_ary(val,
ary, sep, result, tmp, first);
2894 VALUE val, tmp, result;
2906 if (
NIL_P(tmp) || tmp != val) {
2912 i = ary_join_0(
ary, sep, i, result);
2914 ary_join_1(
ary,
ary, sep, i, result, &first);
3015 return rb_ary_inspect(
ary);
3079 const VALUE e = rb_ary_elt(
ary, i);
3080 const VALUE elt = block_given ? rb_yield_force_blockarg(e) : e;
3082 if (
NIL_P(key_value_pair)) {
3128 ary_reverse(p1, p2);
3174 do *p2-- = *p1++;
while (--
len > 0);
3181 rotate_count(
long cnt,
long len)
3183 return (cnt < 0) ? (
len - (~cnt %
len) - 1) : (cnt %
len);
3194 else if (cnt ==
len - 1) {
3202 if (--cnt > 0) ary_reverse(
ptr,
ptr + cnt);
3214 if (
len > 1 && (cnt = rotate_count(cnt,
len)) > 0) {
3306 cnt = rotate_count(cnt,
len);
3309 ary_memcpy(rotated, 0,
len,
ptr + cnt);
3310 ary_memcpy(rotated,
len, cnt,
ptr);
3322 sort_reentered(
VALUE ary)
3324 if (
RBASIC(ary)->klass) {
3336 sort_reentered(data->ary);
3340 sort_1(
const void *ap,
const void *bp,
void *dummy)
3343 VALUE retval = sort_reentered(data->ary);
3352 sort_returned(data);
3357 sort_2(
const void *ap,
const void *bp,
void *dummy)
3360 VALUE retval = sort_reentered(data->ary);
3365 if ((
long)a > (long)b)
return 1;
3366 if ((
long)a < (long)b)
return -1;
3369 if (STRING_P(a) && STRING_P(b) && CMP_OPTIMIZABLE(STRING)) {
3373 return rb_float_cmp(a, b);
3378 sort_returned(data);
3399 VALUE tmp = ary_make_substitution(ary);
3402 RBASIC_CLEAR_CLASS(tmp);
3404 data.receiver = ary;
3410 if (ARY_EMBED_P(tmp)) {
3411 if (ARY_SHARED_P(ary)) {
3412 rb_ary_unshare(ary);
3415 if (ARY_EMBED_LEN(tmp) > ARY_CAPA(ary)) {
3416 ary_resize_capa(ary, ARY_EMBED_LEN(tmp));
3418 ary_memcpy(ary, 0, ARY_EMBED_LEN(tmp), ARY_EMBED_PTR(tmp));
3419 ARY_SET_LEN(ary, ARY_EMBED_LEN(tmp));
3422 if (!ARY_EMBED_P(ary) && ARY_HEAP_PTR(ary) == ARY_HEAP_PTR(tmp)) {
3423 FL_UNSET_SHARED(ary);
3428 if (ARY_EMBED_P(ary)) {
3429 FL_UNSET_EMBED(ary);
3431 else if (ARY_SHARED_P(ary)) {
3433 rb_ary_unshare(ary);
3438 ARY_SET_PTR(ary, ARY_HEAP_PTR(tmp));
3439 ARY_SET_HEAP_LEN(ary,
len);
3440 ARY_SET_CAPA(ary, ARY_HEAP_LEN(tmp));
3445 ARY_SET_EMBED_LEN(tmp, 0);
3494 static VALUE rb_ary_bsearch_index(
VALUE ary);
3510 rb_ary_bsearch(
VALUE ary)
3512 VALUE index_result = rb_ary_bsearch_index(ary);
3517 return index_result;
3534 rb_ary_bsearch_index(
VALUE ary)
3537 int smaller = 0, satisfied = 0;
3541 while (low < high) {
3542 mid = low + ((high - low) / 2);
3549 else if (v ==
Qtrue) {
3553 else if (!
RTEST(v)) {
3560 case 1: smaller = 0;
break;
3561 case -1: smaller = 1;
3566 " (must be numeric, true, false or nil)",
3576 if (!satisfied)
return Qnil;
3610 rb_ary_sort_by_bang(
VALUE ary)
3643 rb_ary_collect(
VALUE ary)
3678 rb_ary_collect_bang(
VALUE ary)
3694 long beg,
len, i, j;
3696 for (i=0; i<argc; i++) {
3703 long end = olen < beg+
len ? olen : beg+
len;
3704 for (j = beg; j < end; j++) {
3717 append_values_at_single(
VALUE result,
VALUE ary,
long olen,
VALUE idx)
3727 const long end = beg +
len;
3851 rb_ary_values_at(
int argc,
VALUE *argv,
VALUE ary)
3855 for (i = 0; i < argc; ++i) {
3856 append_values_at_single(result, ary, olen, argv[i]);
3884 rb_ary_select(
VALUE ary)
3905 select_bang_i(
VALUE a)
3908 VALUE ary = arg->ary;
3911 for (i1 = i2 = 0; i1 <
RARRAY_LEN(ary); arg->len[0] = ++i1) {
3919 return (i1 == i2) ?
Qnil : ary;
3923 select_bang_ensure(
VALUE a)
3926 VALUE ary = arg->ary;
3928 long i1 = arg->len[0], i2 = arg->len[1];
3930 if (i2 <
len && i2 < i1) {
3939 ARY_SET_LEN(ary, i2 + tail);
3967 rb_ary_select_bang(
VALUE ary)
3975 args.len[0] = args.len[1] = 0;
3996 rb_ary_keep_if(
VALUE ary)
3999 rb_ary_select_bang(ary);
4004 ary_resize_smaller(
VALUE ary,
long len)
4008 ARY_SET_LEN(ary,
len);
4009 if (
len * 2 < ARY_CAPA(ary) &&
4010 ARY_CAPA(ary) > ARY_DEFAULT_SIZE) {
4011 ary_resize_capa(ary,
len * 2);
4059 for (i1 = i2 = 0; i1 <
RARRAY_LEN(ary); i1++) {
4078 ary_resize_smaller(ary, i2);
4089 for (i1 = i2 = 0; i1 <
RARRAY_LEN(ary); i1++) {
4104 ary_resize_smaller(ary, i2);
4116 if (pos < 0)
return Qnil;
4124 ARY_INCREASE_LEN(ary, -1);
4164 ary_slice_bang_by_rb_ary_splice(
VALUE ary,
long pos,
long len)
4171 else if (pos < -orig_len) {
4177 else if (orig_len < pos) {
4180 if (orig_len < pos +
len) {
4181 len = orig_len - pos;
4188 rb_ary_splice(ary, pos,
len, 0, 0);
4286 rb_ary_slice_bang(
int argc,
VALUE *argv,
VALUE ary)
4291 rb_ary_modify_check(ary);
4298 return ary_slice_bang_by_rb_ary_splice(ary, pos,
len);
4305 return ary_slice_bang_by_rb_ary_splice(ary, pos,
len);
4334 reject_bang_i(
VALUE a)
4337 VALUE ary = arg->ary;
4340 for (i1 = i2 = 0; i1 <
RARRAY_LEN(ary); arg->len[0] = ++i1) {
4348 return (i1 == i2) ?
Qnil : ary;
4352 ary_reject_bang(
VALUE ary)
4355 rb_ary_modify_check(ary);
4357 args.len[0] = args.len[1] = 0;
4382 rb_ary_reject_bang(
VALUE ary)
4386 return ary_reject_bang(ary);
4407 rb_ary_reject(
VALUE ary)
4413 ary_reject(ary, rejected_ary);
4414 return rejected_ary;
4435 rb_ary_delete_if(
VALUE ary)
4439 ary_reject_bang(ary);
4454 take_items(
VALUE obj,
long n)
4459 if (n == 0)
return result;
4462 args[0] = result; args[1] = (
VALUE)n;
4463 if (UNDEF_P(rb_check_block_call(obj, idEach, 0, 0, take_i, (
VALUE)args)))
4570 for (i=0; i<argc; i++) {
4571 argv[i] = take_items(argv[i],
len);
4575 int arity = rb_block_arity();
4584 for (j=0; j<argc; j++) {
4585 tmp[j+1] = rb_ary_elt(argv[j], i);
4597 for (j=0; j<argc; j++) {
4607 for (i=0; i<
len; i++) {
4611 for (j=0; j<argc; j++) {
4637 rb_ary_transpose(
VALUE ary)
4639 long elen = -1, alen, i, j;
4640 VALUE tmp, result = 0;
4644 for (i=0; i<alen; i++) {
4645 tmp = to_ary(rb_ary_elt(ary, i));
4649 for (j=0; j<elen; j++) {
4657 for (j=0; j<elen; j++) {
4658 rb_ary_store(rb_ary_elt(result, j), i, rb_ary_elt(tmp, j));
4682 rb_ary_modify_check(copy);
4683 orig = to_ary(orig);
4684 if (copy == orig)
return copy;
4689 if (
RARRAY_LEN(orig) <= ary_embed_capa(copy)) {
4696 else if (ARY_EMBED_P(orig)) {
4697 long len = ARY_EMBED_LEN(orig);
4700 FL_UNSET_EMBED(copy);
4701 ARY_SET_PTR(copy,
ptr);
4702 ARY_SET_LEN(copy,
len);
4703 ARY_SET_CAPA(copy,
len);
4712 VALUE shared_root = ary_make_shared(orig);
4713 FL_UNSET_EMBED(copy);
4714 ARY_SET_PTR(copy, ARY_HEAP_PTR(orig));
4715 ARY_SET_LEN(copy, ARY_HEAP_LEN(orig));
4716 rb_ary_set_shared(copy, shared_root);
4737 rb_ary_modify_check(ary);
4738 if (ARY_SHARED_P(ary)) {
4739 rb_ary_unshare(ary);
4741 ARY_SET_EMBED_LEN(ary, 0);
4744 ARY_SET_LEN(ary, 0);
4745 if (ARY_DEFAULT_SIZE * 2 < ARY_CAPA(ary)) {
4746 ary_resize_capa(ary, ARY_DEFAULT_SIZE * 2);
4934 rb_ary_fill(
int argc,
VALUE *argv,
VALUE ary)
4937 long beg = 0, end = 0,
len = 0;
4960 if (beg < 0) beg = 0;
4969 if (beg >= ARY_MAX_SIZE ||
len > ARY_MAX_SIZE - beg) {
4974 if (end >= ARY_CAPA(ary)) {
4975 ary_resize_capa(ary, end);
4978 ARY_SET_LEN(ary, end);
4981 if (UNDEF_P(item)) {
4985 for (i=beg; i<end; i++) {
4992 ary_memfill(ary, beg,
len, item);
5014 long len, xlen, ylen;
5024 ARY_SET_LEN(z,
len);
5053 rb_ary_concat_multi(
int argc,
VALUE *argv,
VALUE ary)
5055 rb_ary_modify_check(ary);
5060 else if (argc > 1) {
5063 for (i = 0; i < argc; i++) {
5066 ary_append(ary, args);
5076 return ary_append(x, to_ary(y));
5123 ARY_SET_LEN(ary2,
len);
5128 ary_memcpy(ary2, 0, t,
ptr);
5129 while (t <=
len/2) {
5206 recursive_equal(
VALUE ary1,
VALUE ary2,
int recur)
5209 const VALUE *p1, *p2;
5211 if (recur)
return Qtrue;
5218 for (i = 0; i < len1; i++) {
5266 if (ary1 == ary2)
return Qtrue;
5279 recursive_eql(
VALUE ary1,
VALUE ary2,
int recur)
5283 if (recur)
return Qtrue;
5285 if (!
rb_eql(rb_ary_elt(ary1, i), rb_ary_elt(ary2, i)))
5313 if (ary1 == ary2)
return Qtrue;
5321 rb_ary_hash_values(
long len,
const VALUE *elements)
5329 for (i=0; i<
len; i++) {
5353 rb_ary_hash(
VALUE ary)
5388 rb_ary_includes_by_eql(
VALUE ary,
VALUE item)
5403 recursive_cmp(
VALUE ary1,
VALUE ary2,
int recur)
5407 if (recur)
return Qundef;
5412 for (i=0; i<
len; i++) {
5413 VALUE e1 = rb_ary_elt(ary1, i), e2 = rb_ary_elt(ary2, i);
5468 if (ary1 == ary2)
return INT2FIX(0);
5470 if (!UNDEF_P(v))
return v;
5484 rb_hash_add_new_element(hash, elt, elt);
5490 ary_tmp_hash_new(
VALUE ary)
5493 VALUE hash = rb_hash_new_with_size(size);
5495 RBASIC_CLEAR_CLASS(hash);
5500 ary_make_hash(
VALUE ary)
5502 VALUE hash = ary_tmp_hash_new(ary);
5503 return ary_add_hash(hash, ary);
5513 rb_hash_add_new_element(hash, k, v);
5519 ary_make_hash_by(
VALUE ary)
5521 VALUE hash = ary_tmp_hash_new(ary);
5522 return ary_add_hash_by(hash, ary);
5550 ary2 = to_ary(ary2);
5551 if (
RARRAY_LEN(ary2) == 0) {
return ary_make_shared_copy(ary1); }
5556 VALUE elt = rb_ary_elt(ary1, i);
5557 if (rb_ary_includes_by_eql(ary2, elt))
continue;
5563 hash = ary_make_hash(ary2);
5565 if (rb_hash_stlike_lookup(hash,
RARRAY_AREF(ary1, i), NULL))
continue;
5592 rb_ary_difference_multi(
int argc,
VALUE *argv,
VALUE ary)
5597 bool *is_hash =
ALLOCV_N(
bool, t0, argc);
5601 for (i = 0; i < argc; i++) {
5602 argv[i] = to_ary(argv[i]);
5603 is_hash[i] = (length > SMALL_ARRAY_LEN &&
RARRAY_LEN(argv[i]) > SMALL_ARRAY_LEN);
5604 if (is_hash[i]) argv[i] = ary_make_hash(argv[i]);
5609 VALUE elt = rb_ary_elt(ary, i);
5610 for (j = 0; j < argc; j++) {
5612 if (rb_hash_stlike_lookup(argv[j],
RARRAY_AREF(ary, i), NULL))
5616 if (rb_ary_includes_by_eql(argv[j], elt))
break;
5655 VALUE hash, ary3, v;
5659 ary2 = to_ary(ary2);
5666 if (!rb_ary_includes_by_eql(ary2, v))
continue;
5667 if (rb_ary_includes_by_eql(ary3, v))
continue;
5673 hash = ary_make_hash(ary2);
5678 if (rb_hash_stlike_delete(hash, &vv, 0)) {
5708 rb_ary_intersection_multi(
int argc,
VALUE *argv,
VALUE ary)
5713 for (i = 0; i < argc; i++) {
5714 result = rb_ary_and(result, argv[i]);
5721 ary_hash_orset(st_data_t *key, st_data_t *value, st_data_t arg,
int existing)
5723 if (existing)
return ST_STOP;
5724 *key = *value = (
VALUE)arg;
5733 VALUE elt = rb_ary_elt(ary, i);
5734 if (rb_ary_includes_by_eql(ary_union, elt))
continue;
5745 if (!rb_hash_stlike_update(hash, (st_data_t)elt, ary_hash_orset, (st_data_t)elt)) {
5771 ary2 = to_ary(ary2);
5774 rb_ary_union(ary3, ary1);
5775 rb_ary_union(ary3, ary2);
5779 hash = ary_make_hash(ary1);
5780 rb_ary_union_hash(hash, ary2);
5782 return rb_hash_values(hash);
5809 rb_ary_union_multi(
int argc,
VALUE *argv,
VALUE ary)
5816 for (i = 0; i < argc; i++) {
5817 argv[i] = to_ary(argv[i]);
5821 if (sum <= SMALL_ARRAY_LEN) {
5824 rb_ary_union(ary_union, ary);
5825 for (i = 0; i < argc; i++) rb_ary_union(ary_union, argv[i]);
5830 hash = ary_make_hash(ary);
5831 for (i = 0; i < argc; i++) rb_ary_union_hash(hash, argv[i]);
5833 return rb_hash_values(hash);
5853 VALUE hash, v, result, shorter, longer;
5857 ary2 = to_ary(ary2);
5863 if (rb_ary_includes_by_eql(ary2, v))
return Qtrue;
5875 hash = ary_make_hash(shorter);
5881 if (rb_hash_stlike_lookup(hash, vv, 0)) {
5891 ary_max_generic(
VALUE ary,
long i,
VALUE vmax)
5908 ary_max_opt_fixnum(
VALUE ary,
long i,
VALUE vmax)
5915 for (; i < n; ++i) {
5919 if ((
long)vmax < (
long)v) {
5924 return ary_max_generic(ary, i, vmax);
5932 ary_max_opt_float(
VALUE ary,
long i,
VALUE vmax)
5939 for (; i < n; ++i) {
5943 if (rb_float_cmp(vmax, v) < 0) {
5948 return ary_max_generic(ary, i, vmax);
5956 ary_max_opt_string(
VALUE ary,
long i,
VALUE vmax)
5963 for (; i < n; ++i) {
5972 return ary_max_generic(ary, i, vmax);
6035 return rb_nmin_run(ary, num, 0, 1, 1);
6049 if (
FIXNUM_P(result) && CMP_OPTIMIZABLE(INTEGER)) {
6050 return ary_max_opt_fixnum(ary, 1, result);
6052 else if (STRING_P(result) && CMP_OPTIMIZABLE(STRING)) {
6053 return ary_max_opt_string(ary, 1, result);
6056 return ary_max_opt_float(ary, 1, result);
6059 return ary_max_generic(ary, 1, result);
6063 if (UNDEF_P(result))
return Qnil;
6068 ary_min_generic(
VALUE ary,
long i,
VALUE vmin)
6085 ary_min_opt_fixnum(
VALUE ary,
long i,
VALUE vmin)
6092 for (; i < n; ++i) {
6096 if ((
long)vmin > (
long)a) {
6101 return ary_min_generic(ary, i, vmin);
6109 ary_min_opt_float(
VALUE ary,
long i,
VALUE vmin)
6116 for (; i < n; ++i) {
6120 if (rb_float_cmp(vmin, a) > 0) {
6125 return ary_min_generic(ary, i, vmin);
6133 ary_min_opt_string(
VALUE ary,
long i,
VALUE vmin)
6140 for (; i < n; ++i) {
6149 return ary_min_generic(ary, i, vmin);
6212 return rb_nmin_run(ary, num, 0, 0, 1);
6226 if (
FIXNUM_P(result) && CMP_OPTIMIZABLE(INTEGER)) {
6227 return ary_min_opt_fixnum(ary, 1, result);
6229 else if (STRING_P(result) && CMP_OPTIMIZABLE(STRING)) {
6230 return ary_min_opt_string(ary, 1, result);
6233 return ary_min_opt_float(ary, 1, result);
6236 return ary_min_generic(ary, 1, result);
6240 if (UNDEF_P(result))
return Qnil;
6267 rb_ary_minmax(
VALUE ary)
6272 return rb_assoc_new(rb_ary_min(0, 0, ary), rb_ary_max(0, 0, ary));
6276 push_value(st_data_t key, st_data_t val, st_data_t ary)
6310 rb_ary_uniq_bang(
VALUE ary)
6315 rb_ary_modify_check(ary);
6319 hash = ary_make_hash_by(ary);
6321 hash = ary_make_hash(ary);
6327 rb_ary_modify_check(ary);
6328 ARY_SET_LEN(ary, 0);
6329 if (ARY_SHARED_P(ary)) {
6330 rb_ary_unshare(ary);
6333 ary_resize_capa(ary, hash_size);
6366 rb_ary_uniq(
VALUE ary)
6375 hash = ary_make_hash_by(ary);
6376 uniq = rb_hash_values(hash);
6379 hash = ary_make_hash(ary);
6380 uniq = rb_hash_values(hash);
6403 rb_ary_compact_bang(
VALUE ary)
6420 ary_resize_smaller(ary, n);
6440 rb_ary_compact(
VALUE ary)
6443 rb_ary_compact_bang(ary);
6475 rb_ary_count(
int argc,
VALUE *argv,
VALUE ary)
6491 VALUE obj = argv[0];
6494 rb_warn(
"given block not used");
6505 flatten(
VALUE ary,
int level)
6508 VALUE stack, result, tmp = 0, elt;
6524 ARY_SET_LEN(result, i);
6526 stack = ary_new(0, ARY_DEFAULT_SIZE);
6542 if (level >= 0 &&
RARRAY_LEN(stack) / 2 >= level) {
6547 if (
RBASIC(result)->klass) {
6625 rb_ary_flatten_bang(
int argc,
VALUE *argv,
VALUE ary)
6627 int mod = 0, level = -1;
6631 rb_ary_modify_check(ary);
6633 if (level == 0)
return Qnil;
6635 result = flatten(ary, level);
6636 if (result == ary) {
6641 if (mod) ARY_SET_EMBED_LEN(result, 0);
6682 rb_ary_flatten(
int argc,
VALUE *argv,
VALUE ary)
6689 if (level == 0)
return ary_make_shared_copy(ary);
6692 result = flatten(ary, level);
6693 if (result == ary) {
6694 result = ary_make_shared_copy(ary);
6700 #define RAND_UPTO(max) (long)rb_random_ulong_limited((randgen), (max)-1)
6711 long j = RAND_UPTO(i);
6728 rb_ary_shuffle_bang(ec, ary, randgen);
6737 .flags = RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_FREE_IMMEDIATELY
6744 long n,
len, i, j, k, idx[10];
6745 long rnds[numberof(idx)];
6746 long memo_threshold;
6755 return rb_ary_elt(ary, i);
6760 if (n <= numberof(idx)) {
6761 for (i = 0; i < n; ++i) {
6762 rnds[i] = RAND_UPTO(
len - i);
6767 if (
len < k && n <= numberof(idx)) {
6768 for (i = 0; i < n; ++i) {
6790 if (j >= i) l = i, g = ++j;
6791 if (k >= l && (++k >= g)) ++k;
6800 if (n <= numberof(idx)) {
6801 long sorted[numberof(idx)];
6802 sorted[0] = idx[0] = rnds[0];
6803 for (i=1; i<n; i++) {
6805 for (j = 0; j < i; ++j) {
6806 if (k < sorted[j])
break;
6809 memmove(&sorted[j+1], &sorted[j],
sizeof(sorted[0])*(i-j));
6810 sorted[j] = idx[i] = k;
6814 for (i=0; i<n; i++) {
6819 else if (n <= memo_threshold / 2) {
6822 st_table *memo = st_init_numtable_with_size(n);
6826 for (i=0; i<n; i++) {
6827 long r = RAND_UPTO(
len-i) + i;
6829 if (r > max_idx) max_idx = r;
6832 if (
len <= max_idx) n = 0;
6833 else if (n >
len) n =
len;
6835 for (i=0; i<n; i++) {
6836 long j2 = j = ptr_result[i];
6839 if (st_lookup(memo, (st_data_t)i, &value)) i2 = (
long)value;
6840 if (st_lookup(memo, (st_data_t)j, &value)) j2 = (
long)value;
6841 st_insert(memo, (st_data_t)j, (st_data_t)i2);
6842 ptr_result[i] = ptr_ary[j2];
6847 st_free_table(memo);
6852 RBASIC_CLEAR_CLASS(result);
6855 for (i=0; i<n; i++) {
6856 j = RAND_UPTO(
len-i) + i;
6858 ptr_result[j] = ptr_result[i];
6862 RBASIC_SET_CLASS_RAW(result,
rb_cArray);
6864 ARY_SET_LEN(result, n);
6892 if (mul <= 0)
return INT2FIX(0);
6894 return rb_fix_mul_fix(rb_ary_length(
self), n);
6931 rb_ary_cycle(
int argc,
VALUE *argv,
VALUE ary)
6938 if (argc == 0 ||
NIL_P(argv[0])) {
6943 if (n <= 0)
return Qnil;
6946 while (
RARRAY_LEN(ary) > 0 && (n < 0 || 0 < n--)) {
6960 yield_indexed_values(
const VALUE values,
const long r,
const long *
const p)
6965 for (i = 0; i < r; i++) ARY_SET(result, i,
RARRAY_AREF(values, p[i]));
6966 ARY_SET_LEN(result, r);
6968 return !
RBASIC(values)->klass;
6984 permute0(
const long n,
const long r,
long *
const p,
char *
const used,
const VALUE values)
6986 long i = 0, index = 0;
6989 const char *
const unused = memchr(&used[i], 0, n-i);
7004 for (i = 0; i < n; ++i) {
7005 if (used[i])
continue;
7007 if (!yield_indexed_values(values, r, p)) {
7023 descending_factorial(
long from,
long how_many)
7028 while (--how_many > 0) {
7030 cnt = rb_int_mul(cnt,
LONG2FIX(v));
7040 binomial_coefficient(
long comb,
long size)
7044 if (comb > size-comb) {
7050 else if (comb == 0) {
7054 for (i = 1; i < comb; ++i) {
7055 r = rb_int_mul(r,
LONG2FIX(size - i));
7056 r = rb_int_idiv(r,
LONG2FIX(i + 1));
7067 return descending_factorial(n, k);
7113 rb_ary_permutation(
int argc,
VALUE *argv,
VALUE ary)
7123 if (r < 0 || n < r) {
7136 long *p =
ALLOCV_N(
long, t0, r+roomof(n,
sizeof(
long)));
7137 char *used = (
char*)(p + r);
7138 VALUE ary0 = ary_make_shared_copy(ary);
7139 RBASIC_CLEAR_CLASS(ary0);
7143 permute0(n, r, p, used, ary0);
7151 combinate0(
const long len,
const long n,
long *
const stack,
const VALUE values)
7158 for (lev++; lev < n; lev++) {
7159 stack[lev+1] = stack[lev]+1;
7161 if (!yield_indexed_values(values, n, stack+1)) {
7165 if (lev == 0)
return;
7167 }
while (stack[lev+1]+n ==
len+lev+1);
7177 return binomial_coefficient(k, n);
7232 if (n < 0 ||
len < n) {
7244 VALUE ary0 = ary_make_shared_copy(ary);
7246 long *stack =
ALLOCV_N(
long, t0, n+1);
7248 RBASIC_CLEAR_CLASS(ary0);
7249 combinate0(
len, n, stack, ary0);
7269 rpermute0(
const long n,
const long r,
long *
const p,
const VALUE values)
7271 long i = 0, index = 0;
7275 if (++index < r-1) {
7279 for (i = 0; i < n; ++i) {
7281 if (!yield_indexed_values(values, r, p)) {
7286 if (index <= 0)
return;
7287 }
while ((i = ++p[--index]) >= n);
7345 rb_ary_repeated_permutation(
VALUE ary,
VALUE num)
7367 VALUE ary0 = ary_make_shared_copy(ary);
7368 RBASIC_CLEAR_CLASS(ary0);
7370 rpermute0(n, r, p, ary0);
7378 rcombinate0(
const long n,
const long r,
long *
const p,
const long rest,
const VALUE values)
7380 long i = 0, index = 0;
7384 if (++index < r-1) {
7388 for (; i < n; ++i) {
7390 if (!yield_indexed_values(values, r, p)) {
7395 if (index <= 0)
return;
7396 }
while ((i = ++p[--index]) >= n);
7408 return binomial_coefficient(k, n + k - 1);
7451 rb_ary_repeated_combination(
VALUE ary,
VALUE num)
7469 else if (
len == 0) {
7475 VALUE ary0 = ary_make_shared_copy(ary);
7476 RBASIC_CLEAR_CLASS(ary0);
7478 rcombinate0(
len, n, p, n, ary0);
7539 rb_ary_product(
int argc,
VALUE *argv,
VALUE ary)
7545 int *counters =
ALLOCV_N(
int, t1, n);
7550 RBASIC_CLEAR_CLASS(t0);
7555 for (i = 1; i < n; i++) arrays[i] =
Qnil;
7556 for (i = 1; i < n; i++) arrays[i] = to_ary(argv[i-1]);
7559 for (i = 0; i < n; i++) counters[i] = 0;
7564 for (i = 0; i < n; i++) {
7566 arrays[i] = ary_make_shared_copy(arrays[i]);
7571 for (i = 0; i < n; i++) {
7577 if (MUL_OVERFLOW_LONG_P(resultlen, k))
7587 for (j = 0; j < n; j++) {
7592 if (
NIL_P(result)) {
7593 FL_SET(t0, RARRAY_SHARED_ROOT_FLAG);
7595 if (!
FL_TEST(t0, RARRAY_SHARED_ROOT_FLAG)) {
7599 FL_UNSET(t0, RARRAY_SHARED_ROOT_FLAG);
7612 while (counters[m] ==
RARRAY_LEN(arrays[m])) {
7615 if (--m < 0)
goto done;
7623 return NIL_P(result) ? ary : result;
7676 rb_ary_take_while(
VALUE ary)
7684 return rb_ary_take(ary,
LONG2FIX(i));
7739 rb_ary_drop_while(
VALUE ary)
7747 return rb_ary_drop(ary,
LONG2FIX(i));
7790 rb_ary_any_p(
int argc,
VALUE *argv,
VALUE ary)
7798 rb_warn(
"given block not used");
7805 for (i = 0; i <
len; ++i) {
7857 rb_ary_all_p(
int argc,
VALUE *argv,
VALUE ary)
7865 rb_warn(
"given block not used");
7872 for (i = 0; i <
len; ++i) {
7918 rb_ary_none_p(
int argc,
VALUE *argv,
VALUE ary)
7926 rb_warn(
"given block not used");
7933 for (i = 0; i <
len; ++i) {
7982 rb_ary_one_p(
int argc,
VALUE *argv,
VALUE ary)
7991 rb_warn(
"given block not used");
7995 if (result)
return Qfalse;
8001 for (i = 0; i <
len; ++i) {
8003 if (result)
return Qfalse;
8011 if (result)
return Qfalse;
8040 rb_ary_dig(
int argc,
VALUE *argv,
VALUE self)
8043 self = rb_ary_at(
self, *argv);
8044 if (!--argc)
return self;
8046 return rb_obj_dig(argc, argv,
self,
Qnil);
8050 finish_exact_sum(
long n,
VALUE r,
VALUE v,
int z)
8055 v = rb_rational_plus(r, v);
8123 goto init_is_a_value;
8137 else if (RB_BIGNUM_TYPE_P(e))
8143 r = rb_rational_plus(r, e);
8148 v = finish_exact_sum(n, r, v, argc!=0);
8152 v = finish_exact_sum(n, r, v, i!=0);
8164 goto has_float_value;
8174 else if (RB_BIGNUM_TYPE_P(e))
8181 if (isnan(f))
continue;
8187 if (isinf(f) && signbit(x) != signbit(f))
8193 if (isinf(f))
continue;
8196 if (fabs(f) >= fabs(x))
8209 goto has_some_value;
8223 rb_ary_deconstruct(
VALUE ary)
8734 fake_ary_flags = init_fake_ary_flags();
8861 rb_vm_register_global_object(rb_cArray_empty_frozen);
8864 #include "array.rbinc"
#define RUBY_ASSERT_ALWAYS(expr,...)
A variant of RUBY_ASSERT that does not interface with RUBY_DEBUG.
#define RUBY_ASSERT(...)
Asserts that the given expression is truthy if and only if RUBY_DEBUG is truthy.
#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.
void rb_define_method(VALUE klass, const char *name, VALUE(*func)(ANYARGS), int argc)
Defines a method.
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 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 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 FL_FREEZE
Old name of RUBY_FL_FREEZE.
#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_raise(VALUE exc, const char *fmt,...)
Exception entry point.
void rb_bug(const char *fmt,...)
Interpreter panic switch.
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_eArgError
ArgumentError exception.
VALUE rb_eIndexError
IndexError exception.
VALUE rb_ensure(VALUE(*b_proc)(VALUE), VALUE data1, VALUE(*e_proc)(VALUE), VALUE data2)
An equivalent to ensure clause.
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_enc_associate(VALUE obj, rb_encoding *enc)
Identical to rb_enc_associate_index(), except it takes an encoding itself instead of its index.
rb_encoding * rb_usascii_encoding(void)
Queries the encoding that represents US-ASCII.
void rb_enc_copy(VALUE dst, VALUE src)
Destructively copies the encoding of the latter object to that of former one.
VALUE rb_funcall(VALUE recv, ID mid, int n,...)
Calls a method.
VALUE rb_funcallv(VALUE recv, ID mid, int argc, const VALUE *argv)
Identical to rb_funcall(), except it takes the method arguments as a C array.
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.
Defines RBIMPL_HAS_BUILTIN.
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_unshift(VALUE ary, VALUE elem)
Destructively prepends the passed item at the beginning 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_new_from_args(long n,...)
Constructs an array from the passed objects.
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.
VALUE rb_big_plus(VALUE x, VALUE y)
Performs addition of the passed two objects.
double rb_big2dbl(VALUE x)
Converts a bignum into C's double.
int rb_cmpint(VALUE val, VALUE a, VALUE b)
Canonicalises the passed val, which is the return value of a <=> b, into C's {-1, 0,...
VALUE rb_arithmetic_sequence_beg_len_step(VALUE as, long *begp, long *lenp, long *stepp, long len, int err)
Identical to rb_range_beg_len(), except it takes an instance of Enumerator::ArithmericSequence.
#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.
void rb_obj_call_init_kw(VALUE, int, const VALUE *, int)
Identical to rb_obj_call_init(), except you can specify how to handle the last element of the given a...
void rb_hash_foreach(VALUE hash, int(*func)(VALUE key, VALUE val, VALUE arg), VALUE arg)
Iterates over a hash.
VALUE rb_hash_delete(VALUE hash, VALUE key)
Deletes the passed key from the passed hash table, if any.
VALUE rb_hash_aref(VALUE hash, VALUE key)
Queries the given key in the given hash table.
VALUE rb_hash_aset(VALUE hash, VALUE key, VALUE val)
Inserts or replaces ("upsert"s) the objects into the given hash table.
VALUE rb_hash(VALUE obj)
Calculates a message authentication code of the passed object.
VALUE rb_hash_clear(VALUE hash)
Swipes everything out of the passed hash table.
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.
VALUE rb_usascii_str_new(const char *ptr, long len)
Identical to rb_str_new(), except it generates a string of "US ASCII" encoding.
VALUE rb_usascii_str_new_cstr(const char *ptr)
Identical to rb_str_new_cstr(), except it generates a string of "US ASCII" encoding.
VALUE rb_str_buf_cat2(VALUE, const char *)
Just another name of rb_str_cat_cstr.
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_str_new(const char *ptr, long len)
Allocates an instance of rb_cString.
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.
ID rb_intern(const char *name)
Finds or creates a symbol of the given name.
int capa
Designed capacity of the buffer.
char * ptr
Pointer to the underlying memory region, of at least capa bytes.
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_block_call(VALUE obj, ID mid, int argc, const VALUE *argv, rb_block_call_func_t proc, VALUE data2)
Identical to rb_funcallv(), except it additionally passes a function as a block.
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.
static VALUE * RARRAY_PTR(VALUE ary)
Wild use of a C pointer.
#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.
#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.
static long RSTRING_LEN(VALUE str)
Queries the length of the 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.
struct RArray::@43::@44 heap
Arrays that use separated memory region for elements use this pattern.
struct RBasic basic
Basic part, including flags and class.
const VALUE shared_root
Parent of the array.
const VALUE ary[1]
Embedded elements.
union RArray::@43 as
Array's specific fields.
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.