15#include "ruby/internal/config.h"
23#include "internal/class.h"
24#include "internal/enumerator.h"
25#include "internal/error.h"
26#include "internal/hash.h"
27#include "internal/imemo.h"
28#include "internal/numeric.h"
29#include "internal/range.h"
30#include "internal/rational.h"
164static VALUE rb_cLazy;
165static ID id_rewind, id_to_enum, id_each_entry;
166static ID id_next, id_result, id_receiver, id_arguments, id_memo, id_method, id_force;
167static VALUE sym_each, sym_yield;
169static VALUE lazy_use_super_method;
171extern ID ruby_static_id_cause;
173#define id_call idCall
174#define id_cause ruby_static_id_cause
175#define id_each idEach
177#define id_initialize idInitialize
178#define id_size idSize
197RUBY_REFERENCES(enumerator_refs) = {
210static VALUE rb_cGenerator, rb_cYielder, rb_cEnumProducer;
230 lazyenum_proc_func *proc;
231 lazyenum_size_func *size;
232 lazyenum_precheck_func *precheck;
244static VALUE rb_cEnumChain;
251static VALUE rb_cEnumProduct;
262 RUBY_REFS_LIST_PTR(enumerator_refs),
267 0, NULL, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_DECL_MARKING | RUBY_TYPED_EMBEDDABLE
271enumerator_ptr(
VALUE obj)
276 if (!ptr || UNDEF_P(ptr->obj)) {
277 rb_raise(rb_eArgError,
"uninitialized enumerator");
283proc_entry_mark_and_move(
void *p)
286 rb_gc_mark_and_move(&ptr->proc);
287 rb_gc_mark_and_move(&ptr->memo);
293 proc_entry_mark_and_move,
296 proc_entry_mark_and_move,
298 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE
381 enumerator = rb_enumeratorize_with_size(obj, meth, argc, argv, 0);
389enumerator_allocate(
VALUE klass)
405 rb_check_frozen(enum_obj);
409 rb_raise(rb_eArgError,
"unallocated enumerator");
421 ptr->size_fn = size_fn;
422 ptr->kw_splat = kw_splat;
428convert_to_feasible_size_value(
VALUE obj)
470enumerator_initialize(
int argc,
VALUE *argv,
VALUE obj)
473 VALUE recv = generator_init(generator_allocate(rb_cGenerator), iter);
475 VALUE size = convert_to_feasible_size_value(arg0);
477 return enumerator_init(obj, recv, sym_each, 0, 0, 0, size,
false);
487 ptr0 = enumerator_ptr(orig);
496 rb_raise(rb_eArgError,
"unallocated enumerator");
500 ptr1->meth = ptr0->meth;
506 ptr1->size_fn = ptr0->size_fn;
517 return rb_enumeratorize_with_size(obj, meth, argc, argv, 0);
521static int lazy_precheck(
VALUE procs);
529 base_class = rb_cLazy;
532 obj = enumerator_init(enumerator_allocate(
rb_cEnumerator), obj, sym_each, 0, 0, 0,
Qnil,
false);
535 return enumerator_init(enumerator_allocate(base_class),
536 obj, meth, argc, argv, size_fn,
Qnil, kw_splat);
542 return rb_enumeratorize_with_size_kw(obj, meth, argc, argv, size_fn,
rb_keyword_given_p());
549 const VALUE *argv = 0;
550 const struct enumerator *e = enumerator_ptr(obj);
553 VALUE args = e->args;
603enumerator_each(
int argc,
VALUE *argv,
VALUE obj)
610#if SIZEOF_INT < SIZEOF_LONG
626 if (!lazy_precheck(e->procs))
return Qnil;
628 return enumerator_block_call(obj, 0, obj);
634 struct MEMO *memo = (
struct MEMO *)m;
635 VALUE idx = memo->v1;
636 MEMO_V1_SET(memo, rb_int_succ(idx));
645enumerator_size(
VALUE obj);
650 return enumerator_size(obj);
666enumerator_with_index(
int argc,
VALUE *argv,
VALUE obj)
673 return enumerator_block_call(obj, enumerator_with_index_i, (
VALUE)MEMO_NEW(memo, 0, 0));
687enumerator_each_with_index(
VALUE obj)
689 return enumerator_with_index(0, NULL, obj);
734 enumerator_block_call(obj, enumerator_with_object_i, memo);
745 rb_fiber_yield(1, &args);
746 if (!UNDEF_P(e->feedvalue)) {
747 feedvalue = e->feedvalue;
763 return rb_fiber_yield(1, &nil);
769 VALUE curr = rb_fiber_current();
781 VALUE exc = e->stop_exc;
782 VALUE result = rb_attr_get(exc, id_result);
783 VALUE mesg = rb_attr_get(exc, idMesg);
791 curr = rb_fiber_current();
793 if (!e->fib || !rb_fiber_alive_p(e->fib)) {
797 vs = rb_fiber_resume(e->fib, 1, &curr);
854enumerator_next_values(
VALUE obj)
859 rb_check_frozen(obj);
861 if (!UNDEF_P(e->lookahead)) {
867 return get_next_values(obj, e);
871ary2sv(
VALUE args,
int dup)
911enumerator_next(
VALUE obj)
913 VALUE vs = enumerator_next_values(obj);
914 return ary2sv(vs, 0);
918enumerator_peek_values(
VALUE obj)
922 rb_check_frozen(obj);
924 if (UNDEF_P(e->lookahead)) {
925 RB_OBJ_WRITE(obj, &e->lookahead, get_next_values(obj, e));
962enumerator_peek_values_m(
VALUE obj)
964 return rb_ary_dup(enumerator_peek_values(obj));
992enumerator_peek(
VALUE obj)
994 VALUE vs = enumerator_peek_values(obj);
995 return ary2sv(vs, 1);
1049 rb_check_frozen(obj);
1051 if (!UNDEF_P(e->feedvalue)) {
1069enumerator_rewind(
VALUE obj)
1073 rb_check_frozen(obj);
1089inspect_enumerator(
VALUE obj,
VALUE dummy,
int recur)
1092 VALUE eobj, str, cname;
1098 if (!e || UNDEF_P(e->obj)) {
1099 return rb_sprintf(
"#<%"PRIsVALUE
": uninitialized>",
rb_class_path(cname));
1103 str = rb_sprintf(
"#<%"PRIsVALUE
": ...>",
rb_class_path(cname));
1110 eobj = generator_ptr(e->obj)->obj;
1116 str = rb_sprintf(
"#<%"PRIsVALUE
": %+"PRIsVALUE
">",
rb_class_path(cname), eobj);
1119 str = rb_sprintf(
"#<%"PRIsVALUE
": %"PRIsVALUE, cname, str);
1120 append_method(
RARRAY_AREF(e->procs, i), str, e->meth, e->args);
1126 eobj = rb_attr_get(obj, id_receiver);
1132 str = rb_sprintf(
"#<%"PRIsVALUE
": %+"PRIsVALUE,
rb_class_path(cname), eobj);
1133 append_method(obj, str, e->meth, e->args);
1143 if (
SYMBOL_P(key))
return ST_CONTINUE;
1144 *(
int *)arg = FALSE;
1152 rb_str_catf(str,
"% "PRIsVALUE
": %"PRIsVALUE
", ", key, val);
1159 VALUE method, eargs;
1161 method = rb_attr_get(obj, id_method);
1163 if (!
NIL_P(method)) {
1168 method = rb_id2str(default_method);
1174 eargs = rb_attr_get(obj, id_arguments);
1176 eargs = default_args;
1190 if (all_key) kwds = argv[--argc];
1194 VALUE arg = *argv++;
1218enumerator_inspect(
VALUE obj)
1235enumerator_size(
VALUE obj)
1239 const VALUE *argv = NULL;
1243 struct generator *g = generator_ptr(e->obj);
1249 struct proc_entry *entry = proc_entry_ptr(proc);
1250 lazyenum_size_func *size_fn = entry->fn->size;
1254 receiver = (*size_fn)(proc, receiver);
1260 return (*e->size_fn)(e->obj, e->args, obj);
1267 if (!UNDEF_P(size))
return size;
1275yielder_mark_and_move(
void *p)
1278 rb_gc_mark_and_move(&ptr->proc);
1284 yielder_mark_and_move,
1287 yielder_mark_and_move,
1289 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE
1293yielder_ptr(
VALUE obj)
1298 if (!ptr || UNDEF_P(ptr->proc)) {
1299 rb_raise(rb_eArgError,
"uninitialized yielder");
1306yielder_allocate(
VALUE klass)
1325 rb_raise(rb_eArgError,
"unallocated yielder");
1335yielder_initialize(
VALUE obj)
1346 struct yielder *ptr = yielder_ptr(obj);
1355 struct yielder *ptr = yielder_ptr(obj);
1375yielder_to_proc(
VALUE obj)
1391 return yielder_init(yielder_allocate(rb_cYielder),
rb_proc_new(yielder_yield_i, 0));
1398generator_mark_and_move(
void *p)
1401 rb_gc_mark_and_move(&ptr->proc);
1402 rb_gc_mark_and_move(&ptr->obj);
1408 generator_mark_and_move,
1411 generator_mark_and_move,
1413 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE
1417generator_ptr(
VALUE obj)
1422 if (!ptr || UNDEF_P(ptr->proc)) {
1423 rb_raise(rb_eArgError,
"uninitialized generator");
1430generator_allocate(
VALUE klass)
1446 rb_check_frozen(obj);
1450 rb_raise(rb_eArgError,
"unallocated generator");
1460generator_initialize(
int argc,
VALUE *argv,
VALUE obj)
1474 "wrong argument type %"PRIsVALUE
" (expected Proc)",
1478 rb_warn(
"given block not used");
1482 return generator_init(obj, proc);
1493 ptr0 = generator_ptr(orig);
1498 rb_raise(rb_eArgError,
"unallocated generator");
1508generator_each(
int argc,
VALUE *argv,
VALUE obj)
1510 struct generator *ptr = generator_ptr(obj);
1523enum_size(
VALUE self)
1526 return UNDEF_P(r) ?
Qnil : r;
1532 return enum_size(self);
1535#define lazy_receiver_size lazy_map_size
1566 rb_block_call(m, id_each, argc-1, argv+1, lazy_init_iterator, val);
1570#define memo_value v2
1571#define memo_flags u3.state
1572#define LAZY_MEMO_BREAK 1
1573#define LAZY_MEMO_PACKED 2
1574#define LAZY_MEMO_BREAK_P(memo) ((memo)->memo_flags & LAZY_MEMO_BREAK)
1575#define LAZY_MEMO_PACKED_P(memo) ((memo)->memo_flags & LAZY_MEMO_PACKED)
1576#define LAZY_MEMO_SET_BREAK(memo) ((memo)->memo_flags |= LAZY_MEMO_BREAK)
1577#define LAZY_MEMO_RESET_BREAK(memo) ((memo)->memo_flags &= ~LAZY_MEMO_BREAK)
1578#define LAZY_MEMO_SET_VALUE(memo, value) MEMO_V2_SET(memo, value)
1579#define LAZY_MEMO_SET_PACKED(memo) ((memo)->memo_flags |= LAZY_MEMO_PACKED)
1580#define LAZY_MEMO_RESET_PACKED(memo) ((memo)->memo_flags &= ~LAZY_MEMO_PACKED)
1582#define LAZY_NEED_BLOCK(func) \
1583 if (!rb_block_given_p()) { \
1584 rb_raise(rb_eArgError, "tried to call lazy " #func " without a block"); \
1595 struct MEMO *result;
1597 result = MEMO_NEW(m, rb_enum_values_pack(argc, argv),
1598 argc > 1 ? LAZY_MEMO_PACKED : 0);
1599 return lazy_yielder_result(result,
yielder, procs_array, memos, 0);
1603lazy_yielder_yield(
struct MEMO *result,
long memo_index,
int argc,
const VALUE *argv)
1605 VALUE m = result->v1;
1609 LAZY_MEMO_SET_VALUE(result, rb_enum_values_pack(argc, argv));
1611 LAZY_MEMO_SET_PACKED(result);
1613 LAZY_MEMO_RESET_PACKED(result);
1614 return lazy_yielder_result(result,
yielder, procs_array, memos, memo_index);
1624 struct proc_entry *entry = proc_entry_ptr(proc);
1625 if (!(*entry->fn->proc)(proc, result, memos, i)) {
1634 if (LAZY_MEMO_BREAK_P(result)) {
1637 return result->memo_value;
1660 struct generator *old_gen_ptr = generator_ptr(e->obj);
1661 obj = old_gen_ptr->obj;
1667 generator = generator_allocate(rb_cGenerator);
1679lazy_precheck(
VALUE procs)
1682 long num_procs =
RARRAY_LEN(procs), i = num_procs;
1685 struct proc_entry *entry = proc_entry_ptr(proc);
1686 lazyenum_precheck_func *precheck = entry->fn->precheck;
1687 if (precheck && !precheck(proc))
return FALSE;
1784lazy_initialize(
int argc,
VALUE *argv,
VALUE self)
1790 LAZY_NEED_BLOCK(
new);
1795 generator = generator_allocate(rb_cGenerator);
1797 enumerator_init(self,
generator, sym_each, 0, 0, 0, size, 0);
1813lazy_to_a(
VALUE self)
1821 ID id = rb_frame_this_func();
1837 lazy_set_args(lazy, args);
1838 e->size_fn = size_fn;
1849 VALUE new_generator;
1854 &proc_entry_data_type, entry);
1861 lazy_set_args(entry_obj, memo);
1864 new_generator = lazy_generator_init(obj, new_procs);
1867 new_obj = enumerator_init_copy(enumerator_allocate(rb_cLazy), obj);
1868 new_e = RTYPEDDATA_GET_DATA(new_obj);
1877 new_e->meth = id_each;
1915enumerable_lazy(
VALUE obj)
1926 return enumerator_init(enumerator_allocate(rb_cLazy),
1927 obj, meth, argc, argv, size_fn,
Qnil, kw_splat);
1954lazy_to_enum(
int argc,
VALUE *argv,
VALUE self)
1956 VALUE lazy, meth = sym_each, super_meth;
1962 if (
RTEST((super_meth = rb_hash_aref(lazy_use_super_method, meth)))) {
1975 return enum_size(self);
1986lazy_eager(
VALUE self)
1989 self, sym_each, 0, 0, lazy_eager_size,
Qnil, 0);
2004 const VALUE *argv = &result->memo_value;
2005 if (LAZY_MEMO_PACKED_P(result)) {
2006 const VALUE args = *argv;
2017 LAZY_MEMO_SET_VALUE(result, value);
2018 LAZY_MEMO_RESET_PACKED(result);
2029 lazy_map_proc, lazy_map_size,
2048 LAZY_NEED_BLOCK(map);
2049 return lazy_add_method(obj, 0, 0,
Qnil,
Qnil, &lazy_map_funcs);
2053 struct MEMO *result;
2062 return lazy_yielder_yield(arg->result, arg->index, argc, argv);
2070 const long proc_index = memo_index + 1;
2071 int break_p = LAZY_MEMO_BREAK_P(result);
2077 struct flat_map_i_arg arg = {.result = result, .index = proc_index};
2078 LAZY_MEMO_RESET_BREAK(result);
2080 if (break_p) LAZY_MEMO_SET_BREAK(result);
2086 LAZY_MEMO_RESET_BREAK(result);
2089 lazy_yielder_yield(result, proc_index, 1, &argv);
2091 if (break_p) LAZY_MEMO_SET_BREAK(result);
2095 LAZY_MEMO_SET_VALUE(result, value);
2096 LAZY_MEMO_RESET_PACKED(result);
2101 lazy_flat_map_proc, 0,
2128lazy_flat_map(
VALUE obj)
2130 LAZY_NEED_BLOCK(flat_map);
2131 return lazy_add_method(obj, 0, 0,
Qnil,
Qnil, &lazy_flat_map_funcs);
2138 if (!
RTEST(chain))
return 0;
2143 lazy_select_proc, 0,
2155lazy_select(
VALUE obj)
2157 LAZY_NEED_BLOCK(select);
2158 return lazy_add_method(obj, 0, 0,
Qnil,
Qnil, &lazy_select_funcs);
2165 if (!
RTEST(value))
return 0;
2166 LAZY_MEMO_SET_VALUE(result, value);
2167 LAZY_MEMO_RESET_PACKED(result);
2172 lazy_filter_map_proc, 0,
2186lazy_filter_map(
VALUE obj)
2188 LAZY_NEED_BLOCK(filter_map);
2189 return lazy_add_method(obj, 0, 0,
Qnil,
Qnil, &lazy_filter_map_funcs);
2196 if (
RTEST(chain))
return 0;
2201 lazy_reject_proc, 0,
2212lazy_reject(
VALUE obj)
2214 LAZY_NEED_BLOCK(reject);
2215 return lazy_add_method(obj, 0, 0,
Qnil,
Qnil, &lazy_reject_funcs);
2223 if (!
RTEST(chain))
return 0;
2231 VALUE value, chain =
rb_funcall(entry->memo, id_eqq, 1, result->memo_value);
2233 if (!
RTEST(chain))
return 0;
2235 LAZY_MEMO_SET_VALUE(result, value);
2236 LAZY_MEMO_RESET_PACKED(result);
2242 lazy_grep_iter_proc, 0,
2261 &lazy_grep_iter_funcs : &lazy_grep_funcs;
2262 return lazy_add_method(obj, 0, 0, pattern,
rb_ary_new3(1, pattern), funcs);
2270 if (
RTEST(chain))
return 0;
2278 VALUE value, chain =
rb_funcall(entry->memo, id_eqq, 1, result->memo_value);
2280 if (
RTEST(chain))
return 0;
2282 LAZY_MEMO_SET_VALUE(result, value);
2283 LAZY_MEMO_RESET_PACKED(result);
2289 lazy_grep_v_iter_proc, 0,
2293 lazy_grep_v_proc, 0,
2308 &lazy_grep_v_iter_funcs : &lazy_grep_v_funcs;
2309 return lazy_add_method(obj, 0, 0, pattern,
rb_ary_new3(1, pattern), funcs);
2328 VALUE ary, arrays = entry->memo;
2337 LAZY_MEMO_SET_VALUE(result, ary);
2347 VALUE zip_args = entry->memo;
2366 LAZY_MEMO_SET_VALUE(result, ary);
2371 {lazy_zip_func, lazy_receiver_size,},
2372 {lazy_zip_arrays_func, lazy_receiver_size,},
2395 for (i = 0; i < argc; i++) {
2398 for (; i < argc; i++) {
2400 rb_raise(
rb_eTypeError,
"wrong argument type %"PRIsVALUE
" (must respond to :each)",
2405 funcs = &lazy_zip_funcs[0];
2411 return lazy_add_method(obj, 0, 0, ary, ary, funcs);
2426 if (--remain == 0) LAZY_MEMO_SET_BREAK(result);
2444 return entry->memo !=
INT2FIX(0);
2448 lazy_take_proc, lazy_take_size, lazy_take_precheck,
2464 rb_raise(rb_eArgError,
"attempt to take negative size");
2469 return lazy_add_method(obj, 0, 0, n,
rb_ary_new3(1, n), &lazy_take_funcs);
2477 LAZY_MEMO_SET_BREAK(result);
2484 lazy_take_while_proc, 0,
2495lazy_take_while(
VALUE obj)
2497 LAZY_NEED_BLOCK(take_while);
2498 return lazy_add_method(obj, 0, 0,
Qnil,
Qnil, &lazy_take_while_funcs);
2505 if (
NIL_P(receiver))
2535 lazy_drop_proc, lazy_drop_size,
2554 rb_raise(rb_eArgError,
"attempt to drop negative size");
2557 return lazy_add_method(obj, 2, argv, n,
rb_ary_new3(1, n), &lazy_drop_funcs);
2572 if (
RTEST(drop))
return 0;
2579 lazy_drop_while_proc, 0,
2590lazy_drop_while(
VALUE obj)
2592 LAZY_NEED_BLOCK(drop_while);
2593 return lazy_add_method(obj, 0, 0,
Qfalse,
Qnil, &lazy_drop_while_funcs);
2597lazy_uniq_check(
VALUE chain,
VALUE memos,
long memo_index)
2606 return rb_hash_add_new_element(hash, chain,
Qfalse);
2612 if (lazy_uniq_check(result->memo_value, memos, memo_index))
return 0;
2621 if (lazy_uniq_check(chain, memos, memo_index))
return 0;
2626 lazy_uniq_iter_proc, 0,
2646 return lazy_add_method(obj, 0, 0,
Qnil,
Qnil, funcs);
2652 if (
NIL_P(result->memo_value))
return 0;
2657 lazy_compact_proc, 0,
2668lazy_compact(
VALUE obj)
2670 return lazy_add_method(obj, 0, 0,
Qnil,
Qnil, &lazy_compact_funcs);
2684 argv[0] = result->memo_value;
2688 LAZY_MEMO_RESET_PACKED(result);
2692 LAZY_MEMO_SET_PACKED(result);
2699lazy_with_index_size(
VALUE proc,
VALUE receiver)
2705 lazy_with_index_proc, lazy_with_index_size,
2726lazy_with_index(
int argc,
VALUE *argv,
VALUE obj)
2746lazy_chunk(
VALUE self)
2757lazy_chunk_while(
VALUE self)
2769lazy_slice_after(
VALUE self)
2781lazy_slice_before(
VALUE self)
2792lazy_slice_when(
VALUE self)
2864stop_result(
VALUE self)
2866 return rb_attr_get(self, id_result);
2874producer_mark_and_move(
void *p)
2877 rb_gc_mark_and_move(&ptr->init);
2878 rb_gc_mark_and_move(&ptr->proc);
2881#define producer_free RUBY_TYPED_DEFAULT_FREE
2884producer_memsize(
const void *p)
2892 producer_mark_and_move,
2895 producer_mark_and_move,
2897 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE
2901producer_ptr(
VALUE obj)
2906 if (!ptr || UNDEF_P(ptr->proc)) {
2907 rb_raise(rb_eArgError,
"uninitialized producer");
2914producer_allocate(
VALUE klass)
2934 rb_raise(rb_eArgError,
"unallocated producer");
2946 return rb_attr_get(exc, id_result);
2949NORETURN(
static VALUE producer_each_i(
VALUE obj));
2952producer_each_i(
VALUE obj)
2955 VALUE init, proc, curr;
2957 ptr = producer_ptr(obj);
2961 if (UNDEF_P(init)) {
2979producer_each(
VALUE obj)
3028enumerator_s_produce(
int argc,
VALUE *argv,
VALUE klass)
3054enum_chain_mark_and_move(
void *p)
3057 rb_gc_mark_and_move(&ptr->enums);
3060#define enum_chain_free RUBY_TYPED_DEFAULT_FREE
3063enum_chain_memsize(
const void *p)
3071 enum_chain_mark_and_move,
3074 enum_chain_mark_and_move,
3076 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
3080enum_chain_ptr(
VALUE obj)
3085 if (!ptr || UNDEF_P(ptr->enums)) {
3086 rb_raise(rb_eArgError,
"uninitialized chain");
3093enum_chain_allocate(
VALUE klass)
3121 rb_check_frozen(obj);
3124 if (!ptr) rb_raise(rb_eArgError,
"unallocated chain");
3133new_enum_chain(
VALUE enums)
3136 VALUE obj = enum_chain_initialize(enum_chain_allocate(rb_cEnumChain), enums);
3140 return enumerable_lazy(obj);
3154 ptr0 = enum_chain_ptr(orig);
3158 if (!ptr1) rb_raise(rb_eArgError,
"unallocated chain");
3160 ptr1->enums = ptr0->enums;
3161 ptr1->pos = ptr0->pos;
3167enum_chain_total_size(
VALUE enums)
3198enum_chain_size(
VALUE obj)
3200 return enum_chain_total_size(enum_chain_ptr(obj)->enums);
3206 return enum_chain_size(obj);
3228enum_chain_each(
int argc,
VALUE *argv,
VALUE obj)
3236 objptr = enum_chain_ptr(obj);
3237 enums = objptr->enums;
3257enum_chain_rewind(
VALUE obj)
3259 struct enum_chain *objptr = enum_chain_ptr(obj);
3260 VALUE enums = objptr->enums;
3263 for (i = objptr->pos; 0 <= i && i <
RARRAY_LEN(enums); objptr->pos = --i) {
3271inspect_enum_chain(
VALUE obj,
VALUE dummy,
int recur)
3278 if (!ptr || UNDEF_P(ptr->enums)) {
3279 return rb_sprintf(
"#<%"PRIsVALUE
": uninitialized>",
rb_class_path(klass));
3283 return rb_sprintf(
"#<%"PRIsVALUE
": ...>",
rb_class_path(klass));
3286 return rb_sprintf(
"#<%"PRIsVALUE
": %+"PRIsVALUE
">",
rb_class_path(klass), ptr->enums);
3296enum_chain_inspect(
VALUE obj)
3316 return new_enum_chain(enums);
3332 return new_enum_chain(rb_ary_new_from_args(2, obj, eobj));
3369enum_product_mark_and_move(
void *p)
3372 rb_gc_mark_and_move(&ptr->enums);
3375#define enum_product_free RUBY_TYPED_DEFAULT_FREE
3378enum_product_memsize(
const void *p)
3386 enum_product_mark_and_move,
3388 enum_product_memsize,
3389 enum_product_mark_and_move,
3391 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
3395enum_product_ptr(
VALUE obj)
3400 if (!ptr || UNDEF_P(ptr->enums)) {
3401 rb_raise(rb_eArgError,
"uninitialized product");
3408enum_product_allocate(
VALUE klass)
3431enum_product_initialize(
int argc,
VALUE *argv,
VALUE obj)
3439 rb_exc_raise(rb_keyword_error_new(
"unknown", rb_hash_keys(options)));
3442 rb_check_frozen(obj);
3445 if (!ptr) rb_raise(rb_eArgError,
"unallocated product");
3459 ptr0 = enum_product_ptr(orig);
3463 if (!ptr1) rb_raise(rb_eArgError,
"unallocated product");
3465 ptr1->enums = ptr0->enums;
3471enum_product_total_size(
VALUE enums)
3511enum_product_size(
VALUE obj)
3513 return enum_product_total_size(enum_product_ptr(obj)->enums);
3519 return enum_product_size(obj);
3536 pstate->argv[pstate->index++] = value;
3538 VALUE val = product_each(pstate->obj, pstate);
3547 VALUE enums = ptr->enums;
3549 if (pstate->index < pstate->argc) {
3574 return product_each(obj, &state);
3590enum_product_each(
VALUE obj)
3606enum_product_rewind(
VALUE obj)
3609 VALUE enums = ptr->enums;
3620inspect_enum_product(
VALUE obj,
VALUE dummy,
int recur)
3627 if (!ptr || UNDEF_P(ptr->enums)) {
3628 return rb_sprintf(
"#<%"PRIsVALUE
": uninitialized>",
rb_class_path(klass));
3632 return rb_sprintf(
"#<%"PRIsVALUE
": ...>",
rb_class_path(klass));
3635 return rb_sprintf(
"#<%"PRIsVALUE
": %+"PRIsVALUE
">",
rb_class_path(klass), ptr->enums);
3645enum_product_inspect(
VALUE obj)
3667enumerator_s_product(
int argc,
VALUE *argv,
VALUE klass)
3671 rb_scan_args(argc, argv,
"*:&", &enums, &options, &block);
3674 rb_exc_raise(rb_keyword_error_new(
"unknown", rb_hash_keys(options)));
3677 VALUE obj = enum_product_initialize(argc, argv, enum_product_allocate(rb_cEnumProduct));
3679 if (!
NIL_P(block)) {
3680 enum_product_run(obj, block);
3695RUBY_REFERENCES(arith_seq_refs) = {
3713 "arithmetic_sequence",
3715 RUBY_REFS_LIST_PTR(arith_seq_refs),
3720 .parent = &enumerator_data_type,
3721 .
flags = RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_DECL_MARKING | RUBY_TYPED_EMBEDDABLE
3725arith_seq_allocate(
VALUE klass)
3731 ptr->enumerator.obj =
Qundef;
3753 VALUE aseq = enumerator_init(arith_seq_allocate(rb_cArithSeq),
3761 ptr->exclude_end = excl;
3773arith_seq_begin(
VALUE self)
3786arith_seq_end(
VALUE self)
3800arith_seq_step(
VALUE self)
3813arith_seq_exclude_end(
VALUE self)
3817 return RBOOL(ptr->exclude_end);
3821arith_seq_exclude_end_p(
VALUE self)
3825 return ptr->exclude_end;
3832 component->
begin = arith_seq_begin(obj);
3833 component->
end = arith_seq_end(obj);
3834 component->
step = arith_seq_step(obj);
3835 component->
exclude_end = arith_seq_exclude_end_p(obj);
3847rb_arithmetic_sequence_beg_len_step(
VALUE obj,
long *begp,
long *lenp,
long *stepp,
long len,
int err)
3849 RBIMPL_NONNULL_ARG(begp);
3850 RBIMPL_NONNULL_ARG(lenp);
3851 RBIMPL_NONNULL_ARG(stepp);
3854 if (!rb_arithmetic_sequence_extract(obj, &aseq)) {
3874 if (err == 0 && (step < -1 || step > 1)) {
3901 rb_raise(rb_eArgError,
"attempt to take negative size");
3907 b = arith_seq_begin(self);
3908 e = arith_seq_end(self);
3909 s = arith_seq_step(self);
3910 x = arith_seq_exclude_end_p(self);
3924 b = rb_big_plus(b, s);
3942 while (n > 0 && i < end) {
3944 if (i + unit < i)
break;
3955 while (n > 0 && i > end) {
3957 if (i + unit > i)
break;
3969 double end =
NIL_P(e) ? (unit < 0 ? -1 : 1)*HUGE_VAL :
NUM2DBL(e);
3970 double len = ruby_float_step_size(beg, end, unit, x);
3985 else if (unit == 0) {
3988 for (i = 0; i <
len; ++i) {
3994 for (i = 0; i < n; ++i) {
3995 double d = i*unit+beg;
3996 if (unit >= 0 ? end < d : d < end) d = end;
4020arith_seq_first(
int argc,
VALUE *argv,
VALUE self)
4026 b = arith_seq_begin(self);
4027 e = arith_seq_end(self);
4028 s = arith_seq_step(self);
4046 return arith_seq_take(self, argv[0]);
4053 return rb_int_plus(a, b);
4056 return rb_float_plus(a, b);
4059 return rb_rational_plus(a, b);
4062 return rb_funcallv(a,
'+', 1, &b);
4070 return rb_int_minus(a, b);
4073 return rb_float_minus(a, b);
4076 return rb_rational_minus(a, b);
4079 return rb_funcallv(a,
'-', 1, &b);
4087 return rb_int_mul(a, b);
4090 return rb_float_mul(a, b);
4093 return rb_rational_mul(a, b);
4096 return rb_funcallv(a,
'*', 1, &b);
4105 q = rb_int_idiv(a, b);
4108 q = rb_float_div(a, b);
4111 q = rb_rational_div(a, b);
4114 q = rb_funcallv(a, idDiv, 1, &b);
4121 return rb_float_floor(q, 0);
4124 return rb_rational_floor(q, 0);
4140arith_seq_last(
int argc,
VALUE *argv,
VALUE self)
4142 VALUE b, e, s, len_1,
len, last, nv, ary;
4143 int last_is_adjusted;
4146 e = arith_seq_end(self);
4149 "cannot get the last element of endless arithmetic sequence");
4152 b = arith_seq_begin(self);
4153 s = arith_seq_step(self);
4155 len_1 = num_idiv(num_minus(e, b), s);
4156 if (rb_num_negative_int_p(len_1)) {
4163 last = num_plus(b, num_mul(s, len_1));
4164 if ((last_is_adjusted = arith_seq_exclude_end_p(self) &&
rb_equal(last, e))) {
4165 last = num_minus(last, s);
4172 if (last_is_adjusted) {
4188 rb_raise(rb_eArgError,
"negative array size");
4192 b = rb_int_minus(last, rb_int_mul(s, nv));
4194 b = rb_int_plus(b, s);
4209arith_seq_inspect(
VALUE self)
4212 VALUE eobj, str, eargs;
4217 eobj = rb_attr_get(self, id_receiver);
4223 str = rb_sprintf(
"(%s%"PRIsVALUE
"%s.", range_p ?
"(" :
"", eobj, range_p ?
")" :
"");
4227 eargs = rb_attr_get(eobj, id_arguments);
4243 if (all_key) kwds = argv[--argc];
4247 VALUE arg = *argv++;
4279 if (!
rb_equal(arith_seq_begin(self), arith_seq_begin(other))) {
4283 if (!
rb_equal(arith_seq_end(self), arith_seq_end(other))) {
4287 if (!
rb_equal(arith_seq_step(self), arith_seq_step(other))) {
4291 if (arith_seq_exclude_end_p(self) != arith_seq_exclude_end_p(other)) {
4309arith_seq_hash(
VALUE self)
4315 v = rb_hash(arith_seq_begin(self));
4317 v = rb_hash(arith_seq_end(self));
4319 v = rb_hash(arith_seq_step(self));
4326#define NUM_GE(x, y) RTEST(rb_num_coerce_relop((x), (y), idGE))
4341arith_seq_each(
VALUE self)
4343 VALUE c, e, s, len_1, last;
4348 c = arith_seq_begin(self);
4349 e = arith_seq_end(self);
4350 s = arith_seq_step(self);
4351 x = arith_seq_exclude_end_p(self);
4360 c = rb_int_plus(c, s);
4374 len_1 = num_idiv(num_minus(e, c), s);
4375 last = num_plus(c, num_mul(s, len_1));
4377 last = num_minus(last, s);
4380 if (rb_num_negative_int_p(s)) {
4381 while (NUM_GE(c, last)) {
4387 while (NUM_GE(last, c)) {
4404arith_seq_size(
VALUE self)
4409 b = arith_seq_begin(self);
4410 e = arith_seq_end(self);
4411 s = arith_seq_step(self);
4412 x = arith_seq_exclude_end_p(self);
4418 if (rb_num_negative_int_p(s)) {
4430 if (isinf(n))
return DBL2NUM(n);
4432 return rb_dbl2big(n);
4447 len_1 = rb_int_idiv(rb_int_minus(e, b), s);
4448 if (rb_num_negative_int_p(len_1)) {
4452 last = rb_int_plus(b, rb_int_mul(s, len_1));
4463#define sym(name) ID2SYM(rb_intern_const(name))
4465InitVM_Enumerator(
void)
4501 rb_define_alias(rb_cLazy,
"_enumerable_collect_concat",
"collect_concat");
4517 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_map"));
4518 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_collect"));
4519 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_flat_map"));
4520 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_collect_concat"));
4521 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_select"));
4522 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_find_all"));
4523 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_filter"));
4524 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_filter_map"));
4525 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_reject"));
4526 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_grep"));
4527 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_grep_v"));
4528 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_zip"));
4529 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_take"));
4530 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_take_while"));
4531 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_drop"));
4532 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_drop_while"));
4533 rb_funcall(rb_cLazy, id_private, 1, sym(
"_enumerable_uniq"));
4565 lazy_use_super_method = rb_hash_new_with_size(18);
4566 rb_hash_aset(lazy_use_super_method, sym(
"map"), sym(
"_enumerable_map"));
4567 rb_hash_aset(lazy_use_super_method, sym(
"collect"), sym(
"_enumerable_collect"));
4568 rb_hash_aset(lazy_use_super_method, sym(
"flat_map"), sym(
"_enumerable_flat_map"));
4569 rb_hash_aset(lazy_use_super_method, sym(
"collect_concat"), sym(
"_enumerable_collect_concat"));
4570 rb_hash_aset(lazy_use_super_method, sym(
"select"), sym(
"_enumerable_select"));
4571 rb_hash_aset(lazy_use_super_method, sym(
"find_all"), sym(
"_enumerable_find_all"));
4572 rb_hash_aset(lazy_use_super_method, sym(
"filter"), sym(
"_enumerable_filter"));
4573 rb_hash_aset(lazy_use_super_method, sym(
"filter_map"), sym(
"_enumerable_filter_map"));
4574 rb_hash_aset(lazy_use_super_method, sym(
"reject"), sym(
"_enumerable_reject"));
4575 rb_hash_aset(lazy_use_super_method, sym(
"grep"), sym(
"_enumerable_grep"));
4576 rb_hash_aset(lazy_use_super_method, sym(
"grep_v"), sym(
"_enumerable_grep_v"));
4577 rb_hash_aset(lazy_use_super_method, sym(
"zip"), sym(
"_enumerable_zip"));
4578 rb_hash_aset(lazy_use_super_method, sym(
"take"), sym(
"_enumerable_take"));
4579 rb_hash_aset(lazy_use_super_method, sym(
"take_while"), sym(
"_enumerable_take_while"));
4580 rb_hash_aset(lazy_use_super_method, sym(
"drop"), sym(
"_enumerable_drop"));
4581 rb_hash_aset(lazy_use_super_method, sym(
"drop_while"), sym(
"_enumerable_drop_while"));
4582 rb_hash_aset(lazy_use_super_method, sym(
"uniq"), sym(
"_enumerable_uniq"));
4583 rb_hash_aset(lazy_use_super_method, sym(
"with_index"), sym(
"_enumerable_with_index"));
4585 rb_vm_register_global_object(lazy_use_super_method);
4605 rb_define_method(rb_cGenerator,
"initialize_copy", generator_init_copy, 1);
4626 rb_define_method(rb_cEnumChain,
"initialize_copy", enum_chain_init_copy, 1);
4640 rb_define_method(rb_cEnumProduct,
"initialize", enum_product_initialize, -1);
4641 rb_define_method(rb_cEnumProduct,
"initialize_copy", enum_product_init_copy, 1);
4676Init_Enumerator(
void)
4688 sym_each =
ID2SYM(id_each);
#define rb_define_method(klass, mid, func, arity)
Defines klass#mid.
#define rb_define_singleton_method(klass, mid, func, arity)
Defines klass.mid.
#define rb_define_private_method(klass, mid, func, arity)
Defines klass#mid and makes it private.
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.
VALUE rb_define_class_under(VALUE outer, const char *name, VALUE super)
Defines a class under the namespace of outer.
void rb_define_alias(VALUE klass, const char *name1, const char *name2)
Defines an alias of a method.
void rb_need_block(void)
Declares that the current method needs a block.
void rb_undef_method(VALUE klass, const char *name)
Defines an undef 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_keyword_given_p(void)
Determines if the current method is given a keyword argument.
int rb_block_given_p(void)
Determines if the current method is given a block.
#define T_COMPLEX
Old name of RUBY_T_COMPLEX.
#define RB_INTEGER_TYPE_P
Old name of rb_integer_type_p.
#define rb_str_buf_cat2
Old name of rb_usascii_str_new_cstr.
#define OBJ_INIT_COPY(obj, orig)
Old name of RB_OBJ_INIT_COPY.
#define RFLOAT_VALUE
Old name of rb_float_value.
#define Qundef
Old name of RUBY_Qundef.
#define INT2FIX
Old name of RB_INT2FIX.
#define T_FLOAT
Old name of RUBY_T_FLOAT.
#define ID2SYM
Old name of RB_ID2SYM.
#define UNREACHABLE_RETURN
Old name of RBIMPL_UNREACHABLE_RETURN.
#define CLASS_OF
Old name of rb_class_of.
#define rb_ary_new4
Old name of rb_ary_new_from_values.
#define FIXABLE
Old name of RB_FIXABLE.
#define rb_exc_new2
Old name of rb_exc_new_cstr.
#define LONG2FIX
Old name of RB_INT2FIX.
#define T_RATIONAL
Old name of RUBY_T_RATIONAL.
#define T_HASH
Old name of RUBY_T_HASH.
#define NUM2DBL
Old name of rb_num2dbl.
#define rb_ary_new3
Old name of rb_ary_new_from_args.
#define LONG2NUM
Old name of RB_LONG2NUM.
#define Qtrue
Old name of RUBY_Qtrue.
#define ST2FIX
Old name of RB_ST2FIX.
#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 POSFIXABLE
Old name of RB_POSFIXABLE.
#define T_SYMBOL
Old name of RUBY_T_SYMBOL.
#define DBL2NUM
Old name of rb_float_new.
#define NUM2LONG
Old name of RB_NUM2LONG.
#define FIXNUM_P
Old name of RB_FIXNUM_P.
#define rb_ary_new2
Old name of rb_ary_new_capa.
#define ALLOCV_END
Old name of RB_ALLOCV_END.
#define SYMBOL_P
Old name of RB_SYMBOL_P.
void rb_exc_raise(VALUE mesg)
Raises an exception in the current thread.
void rb_iter_break(void)
Breaks from a block.
VALUE rb_eRangeError
RangeError exception.
VALUE rb_eTypeError
TypeError exception.
VALUE rb_eRuntimeError
RuntimeError exception.
VALUE rb_eStopIteration
StopIteration exception.
void rb_warn(const char *fmt,...)
Identical to rb_warning(), except it reports unless $VERBOSE is nil.
VALUE rb_exc_new_str(VALUE etype, VALUE str)
Identical to rb_exc_new_cstr(), except it takes a Ruby's string instead of C's.
VALUE rb_eIndexError
IndexError exception.
VALUE rb_mKernel
Kernel module.
VALUE rb_mEnumerable
Enumerable module.
VALUE rb_cEnumerator
Enumerator class.
VALUE rb_obj_hide(VALUE obj)
Make the object invisible from Ruby code.
VALUE rb_cNumeric
Numeric class.
VALUE rb_obj_class(VALUE obj)
Queries the class of an object.
VALUE rb_obj_dup(VALUE obj)
Duplicates the given object.
VALUE rb_inspect(VALUE obj)
Generates a human-readable textual representation of the given object.
VALUE rb_cRange
Range class.
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.
VALUE rb_to_int(VALUE val)
Identical to rb_check_to_int(), except it raises in case of conversion mismatch.
#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_funcall_with_block(VALUE recv, ID mid, int argc, const VALUE *argv, VALUE procval)
Identical to rb_funcallv_public(), except you can pass a block.
VALUE rb_call_super(int argc, const VALUE *argv)
This resembles ruby's super.
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_dup(VALUE ary)
Duplicates an array.
VALUE rb_ary_cat(VALUE ary, const VALUE *train, long len)
Destructively appends multiple elements at the end of the array.
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_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_hidden_new(long capa)
Allocates a hidden (no class) empty 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_entry(VALUE ary, long off)
Queries an element of an array.
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?.
VALUE rb_enumerator_size_func(VALUE recv, VALUE argv, VALUE eobj)
This is the type of functions that rb_enumeratorize_with_size() expects.
static int rb_check_arity(int argc, int min, int max)
Ensures that the passed integer is in the passed range.
void rb_provide(const char *feature)
Declares that the given feature is already provided by someone else.
VALUE rb_num_coerce_cmp(VALUE lhs, VALUE rhs, ID op)
Identical to rb_num_coerce_bin(), except for return values.
VALUE rb_obj_method(VALUE recv, VALUE mid)
Creates a method object.
VALUE rb_block_proc(void)
Constructs a Proc object from implicitly passed components.
VALUE rb_proc_call_with_block(VALUE recv, int argc, const VALUE *argv, VALUE proc)
Identical to rb_proc_call(), except you can additionally pass another proc object,...
VALUE rb_proc_call_kw(VALUE recv, VALUE args, int kw_splat)
Identical to rb_proc_call(), except you can specify how to handle the last element of the given array...
VALUE rb_obj_is_proc(VALUE recv)
Queries if the given object is a proc.
int rb_range_values(VALUE range, VALUE *begp, VALUE *endp, int *exclp)
Deconstructs a range into its components.
#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_str_append(VALUE dst, VALUE src)
Identical to rb_str_buf_append(), except it converts the right hand side before concatenating.
VALUE rb_str_dup(VALUE str)
Duplicates a string.
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.
VALUE rb_exec_recursive(VALUE(*f)(VALUE g, VALUE h, int r), VALUE g, VALUE h)
"Recursion" API entry point.
VALUE rb_ivar_set(VALUE obj, ID name, VALUE val)
Identical to rb_iv_set(), except it accepts the name as an ID instead of a C string.
VALUE rb_ivar_get(VALUE obj, ID name)
Identical to rb_iv_get(), except it accepts the name as an ID instead of a C string.
VALUE rb_class_path(VALUE mod)
Identical to rb_mod_name(), except it returns #<Class: ...> style inspection for anonymous modules.
int rb_respond_to(VALUE obj, ID mid)
Queries if the object responds to the method.
void rb_undef_alloc_func(VALUE klass)
Deletes the allocator function of a class.
VALUE rb_check_funcall(VALUE recv, ID mid, int argc, const VALUE *argv)
Identical to rb_funcallv(), except it returns RUBY_Qundef instead of raising rb_eNoMethodError.
VALUE rb_check_funcall_kw(VALUE recv, ID mid, int argc, const VALUE *argv, int kw_splat)
Identical to rb_check_funcall(), except you can specify how to handle the last element of the given a...
void rb_define_alloc_func(VALUE klass, rb_alloc_func_t func)
Sets the allocator function of a class.
static ID rb_intern_const(const char *str)
This is a "tiny optimisation" over rb_intern().
VALUE rb_sym2str(VALUE symbol)
Obtain a frozen string representation of a symbol (not including the leading colon).
int len
Length of the buffer.
#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.
VALUE rb_yield_values_kw(int n, const VALUE *argv, int kw_splat)
Identical to rb_yield_values2(), except you can specify how to handle the last element of the given a...
VALUE rb_block_call_func(RB_BLOCK_CALL_FUNC_ARGLIST(yielded_arg, callback_arg))
This is the type of a function that the interpreter expect for C-backended blocks.
VALUE rb_block_call_kw(VALUE obj, ID mid, int argc, const VALUE *argv, rb_block_call_func_t proc, VALUE data2, int kw_splat)
Identical to rb_funcallv_kw(), except it additionally passes a function as a block.
#define rb_long2int
Just another name of rb_long2int_inline.
#define MEMCPY(p1, p2, type, n)
Handy macro to call memcpy.
#define ALLOCA_N(type, n)
#define RB_GC_GUARD(v)
Prevents premature destruction of local objects.
VALUE rb_block_call(VALUE q, ID w, int e, const VALUE *r, type *t, VALUE y)
Call a method with a block.
VALUE rb_proc_new(type *q, VALUE w)
Creates a rb_cProc instance.
VALUE rb_fiber_new(type *q, VALUE w)
Creates a rb_cFiber instance.
void rb_hash_foreach(VALUE q, int_type *w, VALUE e)
Iteration over the given hash.
VALUE rb_rescue2(type *q, VALUE w, type *e, VALUE r,...)
An equivalent of rescue clause.
#define RARRAY_LEN
Just another name of rb_array_len.
static int RARRAY_LENINT(VALUE ary)
Identical to rb_array_len(), except it differs for the return type.
#define RARRAY_AREF(a, i)
#define RARRAY_CONST_PTR
Just another name of rb_array_const_ptr.
#define RHASH_EMPTY_P(h)
Checks if the hash is empty.
#define RUBY_TYPED_DEFAULT_FREE
This is a value you can set to rb_data_type_struct::dfree.
#define TypedData_Get_Struct(obj, type, data_type, sval)
Obtains a C struct from inside of a wrapper Ruby object.
#define TypedData_Make_Struct(klass, type, data_type, sval)
Identical to TypedData_Wrap_Struct, except it allocates a new data region internally instead of takin...
#define InitVM(ext)
This macro is for internal use.
#define RB_PASS_CALLED_KEYWORDS
Pass keywords if current method is called with keywords, useful for argument delegation.
#define RB_NO_KEYWORDS
Do not pass keywords.
#define RTEST
This is an old name of RB_TEST.
#define _(args)
This was a transition path from K&R to ANSI.
Decomposed Enumerator::ArithmeicSequence.
int exclude_end
Whether the endpoint is open or closed.
VALUE end
"Right" or "highest" endpoint of the sequence.
VALUE step
Step between a sequence.
VALUE begin
"Left" or "lowest" endpoint of the sequence.
This is the struct that holds necessary info for a struct.
VALUE flags
Type-specific behavioural characteristics.
uintptr_t ID
Type that represents a Ruby identifier such as a variable name.
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 void Check_Type(VALUE v, enum ruby_value_type t)
Identical to RB_TYPE_P(), except it raises exceptions on predication failure.
static bool RB_TYPE_P(VALUE obj, enum ruby_value_type t)
Queries if the given object is of given type.