9#include "internal/bits.h"
10#include "internal/error.h"
11#include "internal/hash.h"
12#include "internal/proc.h"
13#include "internal/sanitizers.h"
14#include "internal/set_table.h"
15#include "internal/symbol.h"
16#include "internal/variable.h"
17#include "ruby_assert.h"
30#include "internal/gc.h"
36 union {
double d; st_index_t i;} u;
41static const uint64_t prime1 = ((uint64_t)0x2e0bb864 << 32) | 0xe9ea7df5;
42static const uint32_t prime2 = 0x830fcab9;
45mult_and_mix(uint64_t m1, uint64_t m2)
47#if defined HAVE_UINT128_T
48 uint128_t r = (uint128_t) m1 * (uint128_t) m2;
49 return (uint64_t) (r >> 64) ^ (uint64_t) r;
51 uint64_t hm1 = m1 >> 32, hm2 = m2 >> 32;
52 uint64_t lm1 = m1, lm2 = m2;
53 uint64_t v64_128 = hm1 * hm2;
54 uint64_t v32_96 = hm1 * lm2 + lm1 * hm2;
55 uint64_t v1_32 = lm1 * lm2;
57 return (v64_128 + (v32_96 >> 32)) ^ ((v32_96 << 32) + v1_32);
62key64_hash(uint64_t key, uint32_t seed)
64 return mult_and_mix(key + seed, prime1);
68#define set_index_hash(index) key64_hash(rb_hash_start(index), prime2)
71set_ident_hash(st_data_t n)
80 n ^= dbl_to_index(rb_float_value(n));
84 return (st_index_t)set_index_hash((st_index_t)n);
100static ID id_each_entry;
104static ID id_set_iter_lev;
106#define RSET_INITIALIZED FL_USER1
107#define RSET_LEV_MASK (FL_USER13 | FL_USER14 | FL_USER15 | \
108 FL_USER16 | FL_USER17 | FL_USER18 | FL_USER19)
109#define RSET_LEV_SHIFT (FL_USHIFT + 13)
110#define RSET_LEV_MAX 127
112#define SET_ASSERT(expr) RUBY_ASSERT_MESG_WHEN(SET_DEBUG, expr, #expr)
114#define RSET_SIZE(set) set_table_size(RSET_TABLE(set))
115#define RSET_EMPTY(set) (RSET_SIZE(set) == 0)
116#define RSET_SIZE_NUM(set) SIZET2NUM(RSET_SIZE(set))
117#define RSET_IS_MEMBER(sobj, item) set_table_lookup(RSET_TABLE(set), (st_data_t)(item))
118#define RSET_COMPARE_BY_IDENTITY(set) (RSET_TABLE(set)->type == &identhash)
125mark_key(st_data_t key, st_data_t data)
127 rb_gc_mark_movable((
VALUE)key);
136 if (sobj->table.entries) set_table_foreach(&sobj->table, mark_key, 0);
142 free((&sobj->table)->bins);
143 free((&sobj->table)->entries);
150 set_free_embedded(sobj);
151 memset(&sobj->table, 0,
sizeof(sobj->table));
155set_size(
const void *ptr)
159 return (
unsigned long)set_memsize(&sobj->table) -
sizeof(sobj->table);
163set_foreach_replace(st_data_t key, st_data_t argp,
int error)
165 if (rb_gc_location((
VALUE)key) != (
VALUE)key) {
173set_replace_ref(st_data_t *key, st_data_t argp,
int existing)
175 if (rb_gc_location((
VALUE)*key) != (
VALUE)*key) {
176 *key = rb_gc_location((
VALUE)*key);
183set_update_references(
void *ptr)
186 set_foreach_with_replace(&sobj->table, set_foreach_replace, set_replace_ref, 0);
195 .dcompact = set_update_references,
197 .flags = RUBY_TYPED_EMBEDDABLE | RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_FROZEN_SHAREABLE
209iter_lev_in_ivar(
VALUE set)
214 SET_ASSERT(lev >= 0);
215 return (
unsigned long)lev;
221iter_lev_in_ivar_set(
VALUE set,
unsigned long lev)
223 SET_ASSERT(lev >= RSET_LEV_MAX);
225 rb_ivar_set_internal(set, id_set_iter_lev,
LONG2FIX((
long)lev));
228static inline unsigned long
229iter_lev_in_flags(
VALUE set)
231 return (
unsigned long)((
RBASIC(set)->flags >> RSET_LEV_SHIFT) & RSET_LEV_MAX);
235iter_lev_in_flags_set(
VALUE set,
unsigned long lev)
237 SET_ASSERT(lev <= RSET_LEV_MAX);
238 RBASIC(set)->flags = ((
RBASIC(set)->flags & ~RSET_LEV_MASK) | ((
VALUE)lev << RSET_LEV_SHIFT));
242set_iterating_p(
VALUE set)
244 return iter_lev_in_flags(set) > 0;
248set_iter_lev_inc(
VALUE set)
250 unsigned long lev = iter_lev_in_flags(set);
251 if (lev == RSET_LEV_MAX) {
252 lev = iter_lev_in_ivar(set) + 1;
259 iter_lev_in_flags_set(set, lev);
260 if (lev < RSET_LEV_MAX)
return;
262 iter_lev_in_ivar_set(set, lev);
266set_iter_lev_dec(
VALUE set)
268 unsigned long lev = iter_lev_in_flags(set);
269 if (lev == RSET_LEV_MAX) {
270 lev = iter_lev_in_ivar(set);
271 if (lev > RSET_LEV_MAX) {
272 iter_lev_in_ivar_set(set, lev-1);
275 rb_attr_delete(set, id_set_iter_lev);
280 iter_lev_in_flags_set(set, lev - 1);
284set_foreach_ensure(
VALUE set)
286 set_iter_lev_dec(set);
294 set_foreach_func *func;
299set_iter_status_check(
int status)
301 if (status == ST_CONTINUE) {
309set_foreach_iter(st_data_t key, st_data_t argp,
int error)
313 if (error)
return ST_STOP;
316 int status = (*arg->func)((
VALUE)key, arg->arg);
318 if (RSET_TABLE(arg->set) != tbl) {
322 return set_iter_status_check(status);
326set_foreach_call(
VALUE arg)
330 ret = set_foreach_check(RSET_TABLE(set), set_foreach_iter,
331 (st_data_t)arg, (st_data_t)
Qundef);
339set_iter(
VALUE set, set_foreach_func *func,
VALUE farg)
349 set_foreach_call((
VALUE)&arg);
352 set_iter_lev_inc(set);
353 rb_ensure(set_foreach_call, (
VALUE)&arg, set_foreach_ensure, set);
357NORETURN(
static void no_new_item(
void));
361 rb_raise(
rb_eRuntimeError,
"can't add a new item into set during iteration");
365set_compact_after_delete(
VALUE set)
367 if (!set_iterating_p(set)) {
368 set_compact_table(RSET_TABLE(set));
376 key = rb_hash_key_str(key);
377 if (key_addr) *key_addr = key;
379 int ret = set_insert(tab, (st_data_t)key);
387 return set_table_insert_wb(RSET_TABLE(set), set, key, key_addr);
391set_alloc_with_size(
VALUE klass, st_index_t size)
397 set_init_table_with_size(&sobj->table, &objhash, size);
404set_s_alloc(
VALUE klass)
406 return set_alloc_with_size(klass, 0);
417set_s_create(
int argc,
VALUE *argv,
VALUE klass)
419 VALUE set = set_alloc_with_size(klass, argc);
423 for (i=0; i < argc; i++) {
424 set_table_insert_wb(table, set, argv[i], NULL);
434 rb_raise(rb_eArgError,
"value must be a set");
439enum_method_id(
VALUE other)
442 return id_each_entry;
448 rb_raise(rb_eArgError,
"value must be enumerable");
455 return RSET_SIZE_NUM(set);
462 set_insert_wb(set, element, &element);
470 set_insert_wb(set, element, &element);
493set_i_initialize(
int argc,
VALUE *argv,
VALUE set)
495 if (
RBASIC(set)->flags & RSET_INITIALIZED) {
498 RBASIC(set)->flags |= RSET_INITIALIZED;
503 if (argc > 0 && (other = argv[0]) !=
Qnil) {
510 if (block_given) key =
rb_yield(key);
511 set_table_insert_wb(into, set, key, NULL);
515 ID id_size = rb_intern(
"size");
519 rb_raise(rb_eArgError,
"cannot initialize Set from an object with infinite size");
524 rb_block_given_p() ? set_initialize_with_block : set_initialize_without_block,
536 if (set == other)
return set;
538 if (set_iterating_p(set)) {
545 set_free_embedded(sobj);
546 set_copy(&sobj->table, RSET_TABLE(other));
547 rb_gc_writebarrier_remember(set);
553set_inspect_i(st_data_t key, st_data_t arg)
557 if (args[1] ==
Qtrue) {
575 str = rb_sprintf(
"%"PRIsVALUE
"[...]", klass_name);
579 str = rb_sprintf(
"%"PRIsVALUE
"[", klass_name);
581 set_iter(set, set_inspect_i, (st_data_t)args);
603set_i_inspect(
VALUE set)
609set_to_a_i(st_data_t key, st_data_t arg)
627 st_index_t size = RSET_SIZE(set);
630 if (size == 0)
return ary;
632 if (ST_DATA_COMPATIBLE_P(
VALUE)) {
634 size = set_keys(RSET_TABLE(set), ptr, size);
636 rb_gc_writebarrier_remember(ary);
637 rb_ary_set_len(ary, size);
640 set_iter(set, set_to_a_i, (st_data_t)ary);
666 rb_warn_deprecated(
"passing arguments to Set#to_set", NULL);
706 rb_check_frozen(set);
707 if (set_iterating_p(set)) {
708 if (!set_table_lookup(RSET_TABLE(set), (st_data_t)item)) {
713 set_insert_wb(set, item, NULL);
732 rb_check_frozen(set);
733 if (set_iterating_p(set)) {
734 if (!set_table_lookup(RSET_TABLE(set), (st_data_t)item)) {
740 return set_insert_wb(set, item, NULL) ?
Qnil : set;
754 rb_check_frozen(set);
755 if (set_table_delete(RSET_TABLE(set), (st_data_t *)&item)) {
756 set_compact_after_delete(set);
771 rb_check_frozen(set);
772 if (set_table_delete(RSET_TABLE(set), (st_data_t *)&item)) {
773 set_compact_after_delete(set);
780set_delete_if_i(st_data_t key, st_data_t dummy)
794set_i_delete_if(
VALUE set)
797 rb_check_frozen(set);
798 set_iter(set, set_delete_if_i, 0);
799 set_compact_after_delete(set);
812set_i_reject(
VALUE set)
815 rb_check_frozen(set);
818 size_t n = set_table_size(table);
819 set_iter(set, set_delete_if_i, 0);
821 if (n == set_table_size(table))
return Qnil;
823 set_compact_after_delete(set);
828set_classify_i(st_data_t key, st_data_t tmp)
831 VALUE hash = args[0];
833 VALUE set = rb_hash_lookup2(hash, hash_key,
Qundef);
835 set = set_s_alloc(args[1]);
836 rb_hash_aset(hash, hash_key, set);
862set_i_classify(
VALUE set)
866 args[0] = rb_hash_new();
868 set_iter(set, set_classify_i, (st_data_t)args);
874set_divide_union_find_root(
long *uf_parents,
long index,
long *tmp_array)
876 long root = uf_parents[index];
877 long update_size = 0;
878 while (root != index) {
879 tmp_array[update_size++] = index;
881 root = uf_parents[index];
883 for (
long j = 0; j < update_size; j++) {
884 long idx = tmp_array[j];
885 uf_parents[idx] = root;
891set_divide_union_find_merge(
long *uf_parents,
long i,
long j,
long *tmp_array)
893 long root_i = set_divide_union_find_root(uf_parents, i, tmp_array);
894 long root_j = set_divide_union_find_root(uf_parents, j, tmp_array);
895 if (root_i != root_j) uf_parents[root_j] = root_i;
899set_divide_arity2(
VALUE set)
902 long size, *uf_parents, *tmp_array;
904 VALUE items = set_i_to_a(set);
907 tmp_array =
ALLOCV_N(
long, tmp, size);
908 uf_parents =
ALLOCV_N(
long, uf, size);
909 for (
long i = 0; i < size; i++) {
912 for (
long i = 0; i < size - 1; i++) {
914 for (
long j = i + 1; j < size; j++) {
918 set_divide_union_find_merge(uf_parents, i, j, tmp_array);
923 VALUE hash = rb_hash_new();
924 for (
long i = 0; i < size; i++) {
926 long root = set_divide_union_find_root(uf_parents, i, tmp_array);
929 set = set_s_create(0, 0, set_class);
930 rb_hash_aset(hash,
LONG2FIX(root), set);
931 set_i_add(final_set, set);
940static void set_merge_enum_into(
VALUE set,
VALUE arg);
966set_i_divide(
VALUE set)
970 if (rb_block_arity() == 2) {
971 return set_divide_arity2(set);
974 VALUE values = rb_hash_values(set_i_classify(set));
976 set_merge_enum_into(set, values);
981set_clear_i(st_data_t key, st_data_t dummy)
997set_i_clear(
VALUE set)
999 rb_check_frozen(set);
1000 if (RSET_SIZE(set) == 0)
return set;
1001 if (set_iterating_p(set)) {
1002 set_iter(set, set_clear_i, 0);
1005 set_table_clear(RSET_TABLE(set));
1006 set_compact_after_delete(set);
1018set_intersection_i(st_data_t key, st_data_t tmp)
1021 if (set_table_lookup(data->other, key)) {
1022 set_table_insert_wb(data->into, data->set, key, NULL);
1031 set_intersection_i((st_data_t)i, (st_data_t)data);
1050 set_table *ntable = RSET_TABLE(new_set);
1054 if (set_table_size(stable) >= set_table_size(otable)) {
1065 set_iter(set, set_intersection_i, (st_data_t)&data);
1073 rb_block_call(other, enum_method_id(other), 0, 0, set_intersection_block, (
VALUE)&data);
1106 return RBOOL(RSET_IS_MEMBER(set, item));
1115set_merge_i(st_data_t key, st_data_t data)
1118 set_table_insert_wb(args->into, args->set, key, NULL);
1125 VALUE element = key;
1126 set_insert_wb(set, element, &element);
1136 .into = RSET_TABLE(set)
1138 set_iter(arg, set_merge_i, (st_data_t)&args);
1144 set_table_insert_wb(into, set,
RARRAY_AREF(arg, i), NULL);
1163 rb_raise(rb_eArgError,
"no keywords accepted");
1166 if (set_iterating_p(set)) {
1170 rb_check_frozen(set);
1174 for (i=0; i < argc; i++) {
1175 set_merge_enum_into(set, argv[i]);
1184 rb_check_frozen(set);
1190 size_t size = set_table_size(old);
1192 set_table *
new = set_init_table_with_size(NULL,
type, size);
1197 set_iter(set, set_merge_i, (st_data_t)&args);
1198 set_free_embedded(sobj);
1199 memcpy(&sobj->table,
new,
sizeof(*
new));
1203 sobj->table.type =
type;
1216set_i_compare_by_identity(
VALUE set)
1218 if (RSET_COMPARE_BY_IDENTITY(set))
return set;
1220 if (set_iterating_p(set)) {
1224 return set_reset_table_with_type(set, &identhash);
1235set_i_compare_by_identity_p(
VALUE set)
1237 return RBOOL(RSET_COMPARE_BY_IDENTITY(set));
1247set_i_size(
VALUE set)
1249 return RSET_SIZE_NUM(set);
1259set_i_empty(
VALUE set)
1261 return RBOOL(RSET_EMPTY(set));
1265set_xor_i(st_data_t key, st_data_t data)
1270 if (set_table_insert_wb(table, set, element, &element)) {
1271 set_table_delete(table, &element);
1296 set_merge_enum_into(new_set, other);
1298 set_iter(set, set_xor_i, (st_data_t)new_set);
1316 set_merge_enum_into(set, other);
1321set_remove_i(st_data_t key, st_data_t from)
1323 set_table_delete((
struct set_table *)from, (st_data_t *)&key);
1330 rb_check_frozen(set);
1331 set_table_delete(RSET_TABLE(set), (st_data_t *)&key);
1339 set_iter(arg, set_remove_i, (st_data_t)RSET_TABLE(set));
1356 rb_check_frozen(set);
1357 set_remove_enum_from(set, other);
1374 return set_i_subtract(
rb_obj_dup(set), other);
1378set_each_i(st_data_t key, st_data_t dummy)
1394set_i_each(
VALUE set)
1397 set_iter(set, set_each_i, 0);
1402set_collect_i(st_data_t key, st_data_t data)
1417set_i_collect(
VALUE set)
1420 rb_check_frozen(set);
1423 set_iter(set, set_collect_i, (st_data_t)new_set);
1424 set_i_initialize_copy(set, new_set);
1430set_keep_if_i(st_data_t key, st_data_t into)
1433 set_table_delete((
set_table *)into, &key);
1447set_i_keep_if(
VALUE set)
1450 rb_check_frozen(set);
1452 set_iter(set, set_keep_if_i, (st_data_t)RSET_TABLE(set));
1466set_i_select(
VALUE set)
1469 rb_check_frozen(set);
1472 size_t n = set_table_size(table);
1473 set_iter(set, set_keep_if_i, (st_data_t)table);
1475 return (n == set_table_size(table)) ?
Qnil : set;
1492 rb_check_frozen(set);
1495 set_i_initialize_copy(set, other);
1498 if (set_iterating_p(set)) {
1503 enum_method_id(other);
1505 set_table_clear(RSET_TABLE(set));
1506 set_merge_enum_into(set, other);
1520set_i_reset(
VALUE set)
1522 if (set_iterating_p(set)) {
1526 return set_reset_table_with_type(set, RSET_TABLE(set)->
type);
1532set_flatten_merge_i(st_data_t item, st_data_t arg)
1535 VALUE set = args[0];
1537 VALUE e_id = rb_obj_id(item);
1538 VALUE hash = args[2];
1539 switch(rb_hash_aref(hash, e_id)) {
1543 rb_raise(rb_eArgError,
"tried to flatten recursive Set");
1548 rb_hash_aset(hash, e_id,
Qtrue);
1549 set_flatten_merge(set, item, hash);
1550 rb_hash_aset(hash, e_id,
Qfalse);
1553 set_i_add(set, item);
1561 VALUE args[3] = {set, from, hash};
1562 set_iter(from, set_flatten_merge_i, (st_data_t)args);
1573set_i_flatten(
VALUE set)
1576 set_flatten_merge(new_set, set, rb_hash_new());
1581set_contains_set_i(st_data_t item, st_data_t arg)
1584 *(
bool *)arg =
true;
1598set_i_flatten_bang(
VALUE set)
1600 bool contains_set =
false;
1601 set_iter(set, set_contains_set_i, (st_data_t)&contains_set);
1602 if (!contains_set)
return Qnil;
1603 rb_check_frozen(set);
1604 return set_i_replace(set, set_i_flatten(set));
1613set_le_i(st_data_t key, st_data_t arg)
1616 if (set_table_lookup(data->table, key))
return ST_CONTINUE;
1625 .table = RSET_TABLE(other),
1628 set_iter(set, set_le_i, (st_data_t)&data);
1642 if (RSET_SIZE(set) >= RSET_SIZE(other))
return Qfalse;
1643 return set_le(set, other);
1656 if (RSET_SIZE(set) > RSET_SIZE(other))
return Qfalse;
1657 return set_le(set, other);
1670 if (RSET_SIZE(set) <= RSET_SIZE(other))
return Qfalse;
1671 return set_le(other, set);
1684 if (RSET_SIZE(set) < RSET_SIZE(other))
return Qfalse;
1685 return set_le(other, set);
1689set_intersect_i(st_data_t key, st_data_t arg)
1692 if (set_table_lookup((
set_table *)args[0], key)) {
1715 size_t set_size = RSET_SIZE(set);
1716 size_t other_size = RSET_SIZE(other);
1721 if (set_size < other_size) {
1723 args[0] = (
VALUE)RSET_TABLE(other);
1727 args[0] = (
VALUE)RSET_TABLE(set);
1729 set_iter(iter_arg, set_intersect_i, (st_data_t)args);
1736 rb_raise(rb_eArgError,
"value must be enumerable");
1755 return RBOOL(!
RTEST(set_i_intersect(set, other)));
1770 size_t set_size = RSET_SIZE(set);
1771 size_t other_size = RSET_SIZE(other);
1773 if (set_size < other_size) {
1774 if (set_le(set, other) ==
Qtrue) {
1778 else if (set_size > other_size) {
1779 if (set_le(other, set) ==
Qtrue) {
1783 else if (set_le(set, other) ==
Qtrue) {
1797set_eql_i(st_data_t item, st_data_t arg)
1801 if (!set_table_lookup(RSET_TABLE(data->set), item)) {
1809set_recursive_eql(
VALUE set,
VALUE dt,
int recur)
1811 if (recur)
return Qtrue;
1813 data->result =
Qtrue;
1814 set_iter(set, set_eql_i, dt);
1815 return data->result;
1828 if (set == other)
return Qtrue;
1832 size_t ssize = set_table_size(stable);
1833 size_t osize = set_table_size(otable);
1835 if (ssize != osize)
return Qfalse;
1836 if (ssize == 0 && osize == 0)
return Qtrue;
1837 if (stable->type != otable->type)
return Qfalse;
1845set_hash_i(st_data_t item, st_data_t(arg))
1847 st_index_t *hval = (st_index_t *)arg;
1848 st_index_t ival = rb_hash(item);
1849 *hval ^= rb_st_hash(&ival,
sizeof(st_index_t), 0);
1860set_i_hash(
VALUE set)
1862 st_index_t size = RSET_SIZE(set);
1863 st_index_t hval = rb_st_hash_start(size);
1866 set_iter(set, set_hash_i, (
VALUE)&hval);
1868 hval = rb_st_hash_end(hval);
1874set_to_hash_i(st_data_t key, st_data_t arg)
1881set_i_to_h(
VALUE set)
1883 st_index_t size = RSET_SIZE(set);
1885 if (RSET_COMPARE_BY_IDENTITY(set)) {
1886 hash = rb_ident_hash_new_with_size(size);
1889 hash = rb_hash_new_with_size(size);
1891 rb_hash_set_default(hash,
Qfalse);
1893 if (size == 0)
return hash;
1895 set_iter(set, set_to_hash_i, (st_data_t)hash);
1900compat_dumper(
VALUE set)
1908set_i_from_hash_i(st_data_t key, st_data_t val, st_data_t set)
1921 if (rb_hash_compare_by_id_p(hash)) set_i_compare_by_identity(set);
1922 rb_hash_stlike_foreach(hash, set_i_from_hash_i, (st_data_t)set);
1929 return set_i_from_hash(self,
rb_ivar_get(a, id_i_hash));
1937 set_iter(set, func, arg);
1943 return set_alloc_with_size(
rb_cSet, 0);
1949 return set_alloc_with_size(
rb_cSet, (st_index_t)
capa);
1955 return RSET_IS_MEMBER(set, element);
1961 return set_i_add_p(set, element) !=
Qnil;
1967 return set_i_clear(set);
1973 return set_i_delete_p(set, element) !=
Qnil;
1979 return RSET_SIZE(set);
2201 id_set_iter_lev = rb_make_internal_id();
#define rb_define_method(klass, mid, func, arity)
Defines klass#mid.
#define rb_define_singleton_method(klass, mid, func, arity)
Defines klass.mid.
static bool RB_OBJ_FROZEN(VALUE obj)
Checks if an object is frozen.
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.
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 rb_str_buf_cat2
Old name of rb_usascii_str_new_cstr.
#define RFLOAT_VALUE
Old name of rb_float_value.
#define Qundef
Old name of RUBY_Qundef.
#define T_FLOAT
Old name of RUBY_T_FLOAT.
#define CLASS_OF
Old name of rb_class_of.
#define LONG2FIX
Old name of RB_INT2FIX.
#define T_HASH
Old name of RUBY_T_HASH.
#define FLONUM_P
Old name of RB_FLONUM_P.
#define Qtrue
Old name of RUBY_Qtrue.
#define ST2FIX
Old name of RB_ST2FIX.
#define INT2NUM
Old name of RB_INT2NUM.
#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 ALLOCV_N
Old name of RB_ALLOCV_N.
#define POSFIXABLE
Old name of RB_POSFIXABLE.
#define FIXNUM_P
Old name of RB_FIXNUM_P.
#define ALLOCV_END
Old name of RB_ALLOCV_END.
VALUE rb_eRuntimeError
RuntimeError exception.
VALUE rb_class_new_instance(int argc, const VALUE *argv, VALUE klass)
Allocates, then initialises an instance of the given class.
VALUE rb_mEnumerable
Enumerable module.
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_obj_is_instance_of(VALUE obj, VALUE klass)
Queries if the given object is a direct instance of the given class.
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_cString
String class.
#define RB_OBJ_WRITTEN(old, oldv, young)
Identical to RB_OBJ_WRITE(), except it doesn't write any values, but only a WB declaration.
VALUE rb_str_export_to_enc(VALUE obj, rb_encoding *enc)
Identical to rb_str_export(), except it additionally takes an encoding.
VALUE rb_funcall_passing_block(VALUE recv, ID mid, int argc, const VALUE *argv)
Identical to rb_funcallv_public(), except you can pass the passed block.
VALUE rb_funcall(VALUE recv, ID mid, int n,...)
Calls a method.
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_ary_freeze(VALUE obj)
Freeze an array, preventing further modifications.
VALUE rb_ary_join(VALUE ary, VALUE sep)
Recursively stringises the elements of the passed array, flattens that result, then joins the sequenc...
#define RETURN_SIZED_ENUMERATOR(obj, argc, argv, size_fn)
This roughly resembles return enum_for(__callee__) unless block_given?.
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.
#define rb_hash_uint(h, i)
Just another name of st_hash_uint.
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.
VALUE rb_str_buf_cat_ascii(VALUE dst, const char *src)
Identical to rb_str_cat_cstr(), except it additionally assumes the source string be a NUL terminated ...
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_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_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().
int capa
Designed capacity 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(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.
VALUE rb_block_call(VALUE q, ID w, int e, const VALUE *r, type *t, VALUE y)
Call a method with a block.
VALUE type(ANYARGS)
ANYARGS-ed function type.
VALUE rb_ensure(type *q, VALUE w, type *e, VALUE r)
An equivalent of ensure clause.
#define RARRAY_LEN
Just another name of rb_array_len.
#define RARRAY_PTR_USE(ary, ptr_name, expr)
Declares a section of code where raw pointers are used.
#define RARRAY_AREF(a, i)
#define RBASIC(obj)
Convenient casting macro.
#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...
size_t rb_set_size(VALUE set)
Returns the number of elements in the set.
VALUE rb_set_clear(VALUE set)
Removes all entries from set.
bool rb_set_delete(VALUE set, VALUE element)
Removes the element from from set.
bool rb_set_add(VALUE set, VALUE element)
Adds element to set.
void rb_set_foreach(VALUE set, int(*func)(VALUE element, VALUE arg), VALUE arg)
Iterates over a set.
bool rb_set_lookup(VALUE set, VALUE element)
Whether the set contains the given element.
VALUE rb_set_new(void)
Creates a new, empty set object.
VALUE rb_set_new_capa(size_t capa)
Identical to rb_set_new(), except it additionally specifies how many elements it is expected to conta...
#define RTEST
This is an old name of RB_TEST.
This is the struct that holds necessary info for a struct.
const char * wrap_struct_name
Name of structs of this kind.
uintptr_t ID
Type that represents a Ruby identifier such as a variable name.
uintptr_t VALUE
Type that represents a Ruby object.
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.