19 #define id_each idEach
26 if (argc == 0)
return Qnil;
27 if (argc == 1)
return argv[0];
31 #define ENUM_WANT_SVALUE() do { \
32 i = enum_values_pack(argc, argv); \
35 #define enum_yield rb_yield_values2
162 rb_warn(
"given block not used");
215 if (!
NIL_P(if_none)) {
281 rb_warn(
"given block not used");
568 switch (
rb_scan_args(argc, argv,
"02", &memo[0], &memo[1])) {
690 if (
NIL_P(params[1])) {
729 params[0] = params[1] =
Qnil;
772 #define SORT_BY_BUFSIZE 16
937 #define ENUMFUNC(name) rb_block_given_p() ? name##_iter_i : name##_i
939 #define DEFINE_ENUMFUNCS(name) \
940 static VALUE enum_##name##_func(VALUE result, VALUE *memo); \
943 name##_i(VALUE i, VALUE *memo, int argc, VALUE *argv) \
945 return enum_##name##_func(enum_values_pack(argc, argv), memo); \
949 name##_iter_i(VALUE i, VALUE *memo, int argc, VALUE *argv) \
951 return enum_##name##_func(enum_yield(argc, argv), memo); \
955 enum_##name##_func(VALUE result, VALUE *memo)
1034 else if (*memo ==
Qtrue) {
1579 if (memo.last_bv !=
Qundef)
1621 long n = (*(
VALUE *)memo)++;
1742 VALUE ary = memo[0];
1783 args[1] = (
VALUE)size;
1796 VALUE ary = memo[0];
1841 args[1] = (
VALUE)size;
1885 long n = memo->
u3.
cnt++;
1901 if (
NIL_P(result)) {
1948 if (
NIL_P(result)) {
1991 for (i=0; i<
argc; i++) {
2001 for (i=0; i<
argc; i++) {
2215 if (n <= 0)
return Qnil;
2221 if (len == 0)
return Qnil;
2222 while (n < 0 || 0 < --n) {
2223 for (i=0; i<
len; i++) {
2260 else if (
NIL_P(v) || v == separator) {
2305 if (!
NIL_P(arg.prev_elts))
2410 VALUE initial_state;
2448 if (
RTEST(header_p)) {
2480 if (!
NIL_P(arg.prev_elts))
2629 VALUE initial_state;
2661 #define rb_intern(str) rb_intern_const(str)