12 #include "ruby/internal/config.h"
23 #include "internal/array.h"
24 #include "internal/compar.h"
25 #include "internal/enum.h"
26 #include "internal/enumerator.h"
27 #include "internal/error.h"
28 #include "internal/numeric.h"
29 #include "internal/range.h"
32 static ID id_beg, id_end, id_excl;
34 #define id_succ idSucc
41 #define RANGE_SET_BEG(r, v) (RSTRUCT_SET(r, 0, v))
42 #define RANGE_SET_END(r, v) (RSTRUCT_SET(r, 1, v))
43 #define RANGE_SET_EXCL(r, v) (RSTRUCT_SET(r, 2, v))
45 #define EXCL(r) RTEST(RANGE_EXCL(r))
58 RANGE_SET_EXCL(range, exclude_end);
59 RANGE_SET_BEG(range, beg);
60 RANGE_SET_END(range, end);
72 range_init(range, beg, end, RBOOL(exclude_end));
77 range_modify(
VALUE range)
79 rb_check_frozen(range);
81 if (RANGE_EXCL(range) !=
Qnil) {
82 rb_name_err_raise(
"'initialize' called twice", range,
ID2SYM(idInitialize));
102 range_initialize(
int argc,
VALUE *argv,
VALUE range)
104 VALUE beg, end, flags;
108 range_init(range, beg, end, RBOOL(
RTEST(flags)));
114 range_initialize_copy(
VALUE range,
VALUE orig)
117 rb_struct_init_copy(range, orig);
134 range_exclude_end_p(
VALUE range)
136 return RBOOL(EXCL(range));
140 recursive_equal(
VALUE range,
VALUE obj,
int recur)
142 if (recur)
return Qtrue;
143 if (!
rb_equal(RANGE_BEG(range), RANGE_BEG(obj)))
145 if (!
rb_equal(RANGE_END(range), RANGE_END(obj)))
148 return RBOOL(EXCL(range) == EXCL(obj));
210 recursive_eql(
VALUE range,
VALUE obj,
int recur)
212 if (recur)
return Qtrue;
213 if (!
rb_eql(RANGE_BEG(range), RANGE_BEG(obj)))
215 if (!
rb_eql(RANGE_END(range), RANGE_END(obj)))
218 return RBOOL(EXCL(range) == EXCL(obj));
273 range_hash(
VALUE range)
275 st_index_t hash = EXCL(range);
293 VALUE b = RANGE_BEG(range);
294 VALUE e = RANGE_END(range);
298 while (r_less(v, e) < 0) {
299 if ((*func)(v, arg))
break;
304 while ((c = r_less(v, e)) <= 0) {
305 if ((*func)(v, arg))
break;
316 step_i_iter(
VALUE arg)
326 if (iter[0] !=
INT2FIX(0))
return false;
334 if (step_i_iter(arg)) {
343 if (step_i_iter(arg)) {
350 discrete_object_p(
VALUE obj)
356 linear_object_p(
VALUE obj)
373 check_step_domain(
VALUE step)
393 VALUE b = RANGE_BEG(range), e = RANGE_END(range);
400 return ruby_num_interval_step_size(b, e, step, EXCL(range));
484 range_step(
int argc,
VALUE *argv,
VALUE range)
489 b = RANGE_BEG(range);
490 e = RANGE_END(range);
503 if (b_num_p || !
NIL_P(str_b) || !
NIL_P(sym_b) || (
NIL_P(b) && e_num_p))
519 if (step_num_p && ((b_num_p && (
NIL_P(e) || e_num_p)) || (
NIL_P(b) && e_num_p))) {
521 range_step_size, b, e, step, EXCL(range));
572 else if (b_num_p && step_num_p && ruby_float_step(b, e, step, EXCL(range), TRUE)) {
581 rb_str_upto_endless_each(str_b, step_i, (
VALUE)iter);
584 rb_str_upto_each(str_b, e, EXCL(range), step_i, (
VALUE)iter);
592 rb_str_upto_endless_each(sym_b, sym_step_i, (
VALUE)iter);
595 rb_str_upto_each(sym_b,
rb_sym2str(e), EXCL(range), sym_step_i, (
VALUE)iter);
600 if (b_num_p && step_num_p && r_less(step,
INT2FIX(0)) < 0) {
603 for (; r_less(e, v) < 0; v =
rb_funcall(v, id_plus, 1, step))
607 for (; (c = r_less(e, v)) <= 0; v =
rb_funcall(v, id_plus, 1, step)) {
621 if (r_less(b,
rb_funcall(b, id_plus, 1, step)) == dir) {
623 for (; r_less(v, e) == dir; v =
rb_funcall(v, id_plus, 1, step))
627 for (; (c = r_less(v, e)) == dir || c == 0; v =
rb_funcall(v, id_plus, 1, step)) {
667 return range_step(1, &step, range);
670 #if SIZEOF_DOUBLE == 8 && defined(HAVE_INT64_T)
677 int64_as_double_to_num(int64_t i)
679 union int64_double convert;
691 double_as_int64(
double d)
693 union int64_double convert;
695 return d < 0 ? -convert.i : convert.i;
700 is_integer_p(
VALUE v)
710 return RTEST(is_int) && !UNDEF_P(is_int);
714 bsearch_integer_range(
VALUE beg,
VALUE end,
int excl)
719 #define BSEARCH_CHECK(expr) \
721 VALUE val = (expr); \
722 VALUE v = rb_yield(val); \
724 if (v == INT2FIX(0)) return val; \
725 smaller = (SIGNED_VALUE)v < 0; \
727 else if (v == Qtrue) { \
731 else if (!RTEST(v)) { \
734 else if (rb_obj_is_kind_of(v, rb_cNumeric)) { \
735 int cmp = rb_cmpint(rb_funcall(v, id_cmp, 1, INT2FIX(0)), v, INT2FIX(0)); \
736 if (!cmp) return val; \
740 rb_raise(rb_eTypeError, "wrong argument type %"PRIsVALUE \
741 " (must be numeric, true, false or nil)", \
786 range_bsearch(
VALUE range)
811 #define BSEARCH(conv, excl) \
813 RETURN_ENUMERATOR(range, 0, 0); \
814 if (!(excl)) high++; \
816 while (low + 1 < high) { \
817 mid = ((high < 0) == (low < 0)) ? low + ((high - low) / 2) \
818 : (low + high) / 2; \
819 BSEARCH_CHECK(conv(mid)); \
830 #define BSEARCH_FIXNUM(beg, end, excl) \
832 long low = FIX2LONG(beg); \
833 long high = FIX2LONG(end); \
835 BSEARCH(INT2FIX, (excl)); \
838 beg = RANGE_BEG(range);
839 end = RANGE_END(range);
842 BSEARCH_FIXNUM(beg, end, EXCL(range));
844 #if SIZEOF_DOUBLE == 8 && defined(HAVE_INT64_T)
849 BSEARCH(int64_as_double_to_num, EXCL(range));
852 else if (is_integer_p(beg) && is_integer_p(end)) {
854 return bsearch_integer_range(beg, end, EXCL(range));
856 else if (is_integer_p(beg) &&
NIL_P(end)) {
864 BSEARCH_FIXNUM(beg, mid,
false);
867 return bsearch_integer_range(beg, mid,
false);
874 else if (
NIL_P(beg) && is_integer_p(end)) {
882 BSEARCH_FIXNUM(mid, end,
false);
885 return bsearch_integer_range(mid, end,
false);
933 range_size(
VALUE range)
935 VALUE b = RANGE_BEG(range), e = RANGE_END(range);
939 return ruby_num_interval_step_size(b, e,
INT2FIX(1), EXCL(range));
946 if (!discrete_object_p(b)) {
968 range_to_a(
VALUE range)
970 if (
NIL_P(RANGE_END(range))) {
979 return range_size(range);
984 range_each_bignum_endless(
VALUE beg)
994 range_each_fixnum_endless(
VALUE beg)
1007 long lim =
FIX2LONG(end) + !EXCL(range);
1008 for (
long i =
FIX2LONG(beg); i < lim; i++) {
1032 range_each(
VALUE range)
1039 beg = RANGE_BEG(range);
1040 end = RANGE_END(range);
1043 range_each_fixnum_endless(beg);
1046 return range_each_fixnum_loop(beg, end, range);
1055 if (
NIL_P(end)) range_each_fixnum_endless(beg);
1056 if (
FIXNUM_P(end))
return range_each_fixnum_loop(beg, end, range);
1059 if (
NIL_P(end)) range_each_bignum_endless(beg);
1093 rb_str_upto_endless_each(beg, sym_each_i, 0);
1096 rb_str_upto_each(beg,
rb_sym2str(end), EXCL(range), sym_each_i, 0);
1104 rb_str_upto_each(tmp, end, EXCL(range), each_i, 0);
1107 rb_str_upto_endless_each(tmp, each_i, 0);
1111 if (!discrete_object_p(beg)) {
1116 range_each_func(range, each_i, 0);
1127 range_reverse_each_bignum_beginless(
VALUE end)
1138 range_reverse_each_bignum(
VALUE beg,
VALUE end)
1151 range_reverse_each_positive_bignum_section(
VALUE beg,
VALUE end)
1161 range_reverse_each_bignum(beg, end);
1165 range_reverse_each_fixnum_section(
VALUE beg,
VALUE end)
1183 for (
long i = e; i >= b; --i) {
1189 range_reverse_each_negative_bignum_section(
VALUE beg,
VALUE end)
1198 range_reverse_each_bignum_beginless(end);
1203 range_reverse_each_bignum(beg, end);
1226 range_reverse_each(
VALUE range)
1230 VALUE beg = RANGE_BEG(range);
1231 VALUE end = RANGE_END(range);
1232 int excl = EXCL(range);
1243 end = rb_int_minus(end,
INT2FIX(1));
1246 range_reverse_each_fixnum_section(beg, end);
1250 end = rb_int_minus(end,
INT2FIX(1));
1252 range_reverse_each_positive_bignum_section(beg, end);
1253 range_reverse_each_fixnum_section(beg, end);
1254 range_reverse_each_negative_bignum_section(beg, end);
1276 range_begin(
VALUE range)
1278 return RANGE_BEG(range);
1297 range_end(
VALUE range)
1299 return RANGE_END(range);
1341 range_first(
int argc,
VALUE *argv,
VALUE range)
1345 if (
NIL_P(RANGE_BEG(range))) {
1348 if (argc == 0)
return RANGE_BEG(range);
1359 rb_int_range_last(
int argc,
VALUE *argv,
VALUE range)
1369 b = RANGE_BEG(range);
1370 e = RANGE_END(range);
1375 len_1 = rb_int_minus(e, b);
1377 e = rb_int_minus(e, ONE);
1381 len = rb_int_plus(len_1, ONE);
1384 if (FIXNUM_ZERO_P(
len) || rb_num_negative_p(
len)) {
1401 b = rb_int_minus(e, nv);
1403 b = rb_int_plus(b, ONE);
1447 range_last(
int argc,
VALUE *argv,
VALUE range)
1451 if (
NIL_P(RANGE_END(range))) {
1454 if (argc == 0)
return RANGE_END(range);
1456 b = RANGE_BEG(range);
1457 e = RANGE_END(range);
1460 return rb_int_range_last(argc, argv, range);
1462 return rb_ary_last(argc, argv,
rb_Array(range));
1548 range_min(
int argc,
VALUE *argv,
VALUE range)
1550 if (
NIL_P(RANGE_BEG(range))) {
1555 if (
NIL_P(RANGE_END(range))) {
1560 else if (argc != 0) {
1561 return range_first(argc, argv, range);
1564 VALUE b = RANGE_BEG(range);
1565 VALUE e = RANGE_END(range);
1566 int c =
NIL_P(e) ? -1 : OPTIMIZED_CMP(b, e);
1568 if (c > 0 || (c == 0 && EXCL(range)))
1656 range_max(
int argc,
VALUE *argv,
VALUE range)
1658 VALUE e = RANGE_END(range);
1661 if (
NIL_P(RANGE_END(range))) {
1665 VALUE b = RANGE_BEG(range);
1674 int c =
NIL_P(b) ? -1 : OPTIMIZED_CMP(b, e);
1682 if (c == 0)
return Qnil;
1742 range_minmax(
VALUE range)
1760 b = RANGE_BEG(range);
1761 e = RANGE_END(range);
1770 if (UNDEF_P(b))
return (
int)
Qfalse;
1772 if (UNDEF_P(e))
return (
int)
Qfalse;
1774 if (UNDEF_P(x))
return (
int)
Qfalse;
1806 rb_range_component_beg_len(
VALUE b,
VALUE e,
int excl,
1807 long *begp,
long *lenp,
long len,
int err)
1813 if (
NIL_P(e)) excl = 0;
1823 if (err == 0 || err == 2) {
1850 VALUE res = rb_range_component_beg_len(b, e, excl, begp, lenp,
len, err);
1851 if (
NIL_P(res) && err) {
1880 range_to_s(
VALUE range)
1894 inspect_range(
VALUE range,
VALUE dummy,
int recur)
1899 return rb_str_new2(EXCL(range) ?
"(... ... ...)" :
"(... .. ...)");
1901 if (!
NIL_P(RANGE_BEG(range)) ||
NIL_P(RANGE_END(range))) {
1908 if (
NIL_P(RANGE_BEG(range)) || !
NIL_P(RANGE_END(range))) {
1939 range_inspect(
VALUE range)
1989 return r_cover_p(range, RANGE_BEG(range), RANGE_END(range), val);
2025 VALUE ret = range_include_internal(range, val);
2026 if (!UNDEF_P(ret))
return ret;
2047 if (linear_object_p(val))
return Qtrue;
2058 range_include_internal(
VALUE range,
VALUE val)
2060 VALUE beg = RANGE_BEG(range);
2061 VALUE end = RANGE_END(range);
2063 linear_object_p(beg) || linear_object_p(end);
2065 if (nv || range_integer_edge_p(beg, end)) {
2066 return r_cover_p(range, beg, end, val);
2068 else if (range_string_range_p(beg, end)) {
2069 return rb_str_include_range_p(beg, end, val, RANGE_EXCL(range));
2072 return range_include_fallback(beg, end, val);
2209 beg = RANGE_BEG(range);
2210 end = RANGE_END(range);
2213 return RBOOL(r_cover_range_p(range, beg, end, val));
2215 return r_cover_p(range, beg, end, val);
2227 VALUE val_beg, val_end, val_max;
2230 val_beg = RANGE_BEG(val);
2231 val_end = RANGE_END(val);
2233 if (!
NIL_P(end) &&
NIL_P(val_end))
return FALSE;
2234 if (!
NIL_P(beg) &&
NIL_P(val_beg))
return FALSE;
2235 if (!
NIL_P(val_beg) && !
NIL_P(val_end) && r_less(val_beg, val_end) > (EXCL(val) ? -1 : 0))
return FALSE;
2236 if (!
NIL_P(val_beg) && !r_cover_p(range, beg, end, val_beg))
return FALSE;
2241 if (
NIL_P(r_cmp_end))
return FALSE;
2242 cmp_end =
rb_cmpint(r_cmp_end, end, val_end);
2245 cmp_end = r_less(end, val_end);
2249 if (EXCL(range) == EXCL(val)) {
2250 return cmp_end >= 0;
2252 else if (EXCL(range)) {
2255 else if (cmp_end >= 0) {
2260 if (
NIL_P(val_max))
return FALSE;
2262 return r_less(end, val_max) >= 0;
2268 if (
NIL_P(beg) || r_less(beg, val) <= 0) {
2269 int excl = EXCL(range);
2270 if (
NIL_P(end) || r_less(val, end) <= -excl)
2277 range_dumper(
VALUE range)
2290 VALUE beg, end, excl;
2296 range_modify(range);
2301 range_init(range, beg, end, RBOOL(
RTEST(excl)));
2307 range_alloc(
VALUE klass)
2346 range_count(
int argc,
VALUE *argv,
VALUE range)
2359 VALUE beg = RANGE_BEG(range), end = RANGE_END(range);
2366 if (is_integer_p(beg)) {
2367 VALUE size = range_size(range);
2377 empty_region_p(
VALUE beg,
VALUE end,
int excl)
2379 if (
NIL_P(beg))
return false;
2380 if (
NIL_P(end))
return false;
2381 int less = r_less(beg, end);
2383 if (less > 0)
return true;
2384 if (excl && less == 0)
return true;
2464 VALUE self_beg = RANGE_BEG(range);
2465 VALUE self_end = RANGE_END(range);
2466 int self_excl = EXCL(range);
2467 VALUE other_beg = RANGE_BEG(other);
2468 VALUE other_end = RANGE_END(other);
2469 int other_excl = EXCL(other);
2471 if (empty_region_p(self_beg, other_end, other_excl))
return Qfalse;
2472 if (empty_region_p(other_beg, self_end, self_excl))
return Qfalse;
2482 return RBOOL(!
NIL_P(cmp));
2485 if (empty_region_p(self_beg, self_end, self_excl))
return Qfalse;
2486 if (empty_region_p(other_beg, other_end, other_excl))
return Qfalse;
2738 "Range", rb_cObject, range_alloc,
2739 "begin",
"end",
"excl", NULL);
#define RUBY_ASSERT(...)
Asserts that the given expression is truthy if and only if RUBY_DEBUG is truthy.
#define RB_LIKELY(x)
Asserts that the given Boolean expression likely holds.
void rb_include_module(VALUE klass, VALUE module)
Includes a module to a class.
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 rb_str_new2
Old name of rb_str_new_cstr.
#define RB_INTEGER_TYPE_P
Old name of rb_integer_type_p.
#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 UNREACHABLE
Old name of RBIMPL_UNREACHABLE.
#define T_FLOAT
Old name of RUBY_T_FLOAT.
#define ID2SYM
Old name of RB_ID2SYM.
#define T_BIGNUM
Old name of RUBY_T_BIGNUM.
#define SPECIAL_CONST_P
Old name of RB_SPECIAL_CONST_P.
#define FIXNUM_FLAG
Old name of RUBY_FIXNUM_FLAG.
#define CLASS_OF
Old name of rb_class_of.
#define FIXABLE
Old name of RB_FIXABLE.
#define LONG2FIX
Old name of RB_INT2FIX.
#define ASSUME
Old name of RBIMPL_ASSUME.
#define LONG2NUM
Old name of RB_LONG2NUM.
#define FIXNUM_MIN
Old name of RUBY_FIXNUM_MIN.
#define FLONUM_P
Old name of RB_FLONUM_P.
#define Qtrue
Old name of RUBY_Qtrue.
#define ST2FIX
Old name of RB_ST2FIX.
#define FIXNUM_MAX
Old name of RUBY_FIXNUM_MAX.
#define Qnil
Old name of RUBY_Qnil.
#define Qfalse
Old name of RUBY_Qfalse.
#define FIX2LONG
Old name of RB_FIX2LONG.
#define T_OBJECT
Old name of RUBY_T_OBJECT.
#define NIL_P
Old name of RB_NIL_P.
#define POSFIXABLE
Old name of RB_POSFIXABLE.
#define DBL2NUM
Old name of rb_float_new.
#define BUILTIN_TYPE
Old name of RB_BUILTIN_TYPE.
#define NUM2LONG
Old name of RB_NUM2LONG.
#define FIXNUM_P
Old name of RB_FIXNUM_P.
#define CONST_ID
Old name of RUBY_CONST_ID.
#define rb_ary_new2
Old name of rb_ary_new_capa.
#define SYMBOL_P
Old name of RB_SYMBOL_P.
void rb_raise(VALUE exc, const char *fmt,...)
Exception entry point.
VALUE rb_rescue2(VALUE(*b_proc)(VALUE), VALUE data1, VALUE(*r_proc)(VALUE, VALUE), VALUE data2,...)
An equivalent of rescue clause.
void rb_iter_break(void)
Breaks from a block.
VALUE rb_eRangeError
RangeError exception.
VALUE rb_eTypeError
TypeError exception.
VALUE rb_eArgError
ArgumentError exception.
VALUE rb_cTime
Time class.
VALUE rb_Float(VALUE val)
This is the logic behind Kernel#Float.
VALUE rb_obj_alloc(VALUE klass)
Allocates an instance of the given class.
VALUE rb_mEnumerable
Enumerable module.
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_Array(VALUE val)
This is the logic behind Kernel#Array.
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.
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_check_to_integer(VALUE val, const char *mid)
Identical to rb_check_convert_type(), except the return value type is fixed to rb_cInteger.
VALUE rb_to_int(VALUE val)
Identical to rb_check_to_int(), except it raises in case of conversion mismatch.
#define RUBY_FIXNUM_MAX
Maximum possible value that a fixnum can represent.
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.
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_push(VALUE ary, VALUE elem)
Special case of rb_ary_cat() that it adds only one element.
VALUE rb_assoc_new(VALUE car, VALUE cdr)
Identical to rb_ary_new_from_values(), except it expects exactly two parameters.
VALUE rb_big_minus(VALUE x, VALUE y)
Performs subtraction of the passed two objects.
VALUE rb_big_plus(VALUE x, VALUE y)
Performs addition of the passed two objects.
VALUE rb_big_cmp(VALUE lhs, VALUE rhs)
Compares the passed two bignums.
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,...
#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.
static int rb_check_arity(int argc, int min, int max)
Ensures that the passed integer is in the passed range.
ID rb_frame_this_func(void)
Queries the name of the Ruby level method that is calling this function.
VALUE rb_hash(VALUE obj)
Calculates a message authentication code of the passed object.
int rb_range_values(VALUE range, VALUE *begp, VALUE *endp, int *exclp)
Deconstructs a range into its components.
VALUE rb_range_new(VALUE beg, VALUE end, int excl)
Creates a new Range.
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_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_cat(VALUE dst, const char *src, long srclen)
Destructively appends the passed contents to the string.
st_index_t rb_hash_start(st_index_t i)
Starts a series of hashing.
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_intern(VALUE str)
Identical to rb_to_symbol(), except it assumes the receiver being an instance of RString.
VALUE rb_obj_as_string(VALUE obj)
Try converting an object to its stringised representation using its to_s method, if any.
VALUE rb_struct_define_without_accessor(const char *name, VALUE super, rb_alloc_func_t func,...)
Identical to rb_struct_define(), except it does not define accessor methods.
VALUE rb_struct_alloc_noinit(VALUE klass)
Allocates an instance of the given class.
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,...
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_name(VALUE obj)
Queries the name of the given object's class.
int rb_respond_to(VALUE obj, ID mid)
Queries if the object responds to the method.
int rb_method_basic_definition_p(VALUE klass, ID mid)
Well...
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.
static ID rb_intern_const(const char *str)
This is a "tiny optimisation" over rb_intern().
ID rb_intern(const char *name)
Finds or creates a symbol of the given name.
VALUE rb_sym2str(VALUE id)
Identical to rb_id2str(), except it takes an instance of rb_cSymbol rather than an ID.
RBIMPL_ATTR_NORETURN() void rb_eof_error(void)
Utility function to raise rb_eEOFError.
int len
Length of the buffer.
#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(VALUE val)
Yields the block.
void rb_marshal_define_compat(VALUE newclass, VALUE oldclass, VALUE(*dumper)(VALUE), VALUE(*loader)(VALUE, VALUE))
Marshal format compatibility layer.
#define RARRAY_AREF(a, i)
#define RBASIC(obj)
Convenient casting macro.
#define RBIGNUM_SIGN
Just another name of rb_big_sign.
static bool RBIGNUM_NEGATIVE_P(VALUE b)
Checks if the bignum is negative.
static bool RBIGNUM_POSITIVE_P(VALUE b)
Checks if the bignum is positive.
const char * rb_obj_classname(VALUE obj)
Queries the name of the class of the passed object.
#define RTEST
This is an old name of RB_TEST.
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 bool rb_integer_type_p(VALUE obj)
Queries if the object is an instance of rb_cInteger.
static bool RB_TYPE_P(VALUE obj, enum ruby_value_type t)
Queries if the given object is of given type.