#include "internal.h"
#include "ruby/util.h"
#include "id.h"
#include "symbol.h"
#include <assert.h>
Go to the source code of this file.
◆ DEFINE_ENUMFUNCS
#define DEFINE_ENUMFUNCS |
( |
|
name | ) |
|
Value:\
static VALUE \
{ \
} \
\
static VALUE \
{ \
} \
\
static VALUE \
#define RB_BLOCK_CALL_FUNC_ARGLIST(yielded_arg, callback_arg)
VALUE rb_yield_values2(int n, const VALUE *argv)
VALUE rb_enum_values_pack(int argc, const VALUE *argv)
Definition at line 1155 of file enum.c.
◆ dont_recycle_block_arg
#define dont_recycle_block_arg |
( |
|
arity | ) |
((arity) == 1 || (arity) < 0) |
◆ ENUM_WANT_SVALUE
#define ENUM_WANT_SVALUE |
( |
| ) |
|
Value:do { \
} while (0)
VALUE rb_enum_values_pack(int argc, const VALUE *argv)
Definition at line 39 of file enum.c.
◆ ENUMFUNC
◆ GETPTR
#define GETPTR |
( |
|
i | ) |
(beg+(i)*eltsize) |
◆ id_call
◆ id_cmp
◆ id_each
◆ id_eqq
◆ id_lshift
◆ id_size
◆ rb_cmpint
#define rb_cmpint |
( |
|
cmp, |
|
|
|
a, |
|
|
|
b |
|
) |
| rb_cmpint(cmpint_reenter_check(data, (cmp)), a, b) |
◆ rb_intern
◆ SORT_BY_BUFSIZE
#define SORT_BY_BUFSIZE 16 |
◆ SWAP
Value:do { \
VALUE tmp[2]; \
} while (0)
◆ UPDATE_MEMO [1/2]
◆ UPDATE_MEMO [2/2]
◆ DEFINE_ENUMFUNCS() [1/4]
◆ DEFINE_ENUMFUNCS() [2/4]
◆ DEFINE_ENUMFUNCS() [3/4]
◆ DEFINE_ENUMFUNCS() [4/4]
DEFINE_ENUMFUNCS |
( |
none |
| ) |
|
◆ Init_Enumerable()
void Init_Enumerable |
( |
void |
| ) |
|
◆ rb_enum_values_pack()
◆ rb_nmin_run()
◆ rb_mEnumerable