10#if defined(__cplusplus)
19RUBY_SYMBOL_EXPORT_BEGIN
21#if SIZEOF_LONG == SIZEOF_VOIDP
22typedef unsigned long st_data_t;
23#elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
26# error ---->> st.c requires sizeof(void*) == sizeof(long) or sizeof(LONG_LONG) to be compiled. <<----
28#define ST_DATA_T_DEFINED
50typedef st_data_t st_index_t;
53#define MAX_ST_INDEX_VAL (~(st_index_t) 0)
55typedef int st_compare_func(st_data_t, st_data_t);
56typedef st_index_t st_hash_func(st_data_t);
58typedef char st_check_for_sizeof_st_index_t[SIZEOF_VOIDP == (int)
sizeof(st_index_t) ? 1 : -1];
59#define SIZEOF_ST_INDEX_T SIZEOF_VOIDP
62 int (*compare)(st_data_t, st_data_t);
63 st_index_t (*hash)(st_data_t);
66#define ST_INDEX_BITS (SIZEOF_ST_INDEX_T * CHAR_BIT)
68#if defined(HAVE_BUILTIN___BUILTIN_CHOOSE_EXPR) && defined(HAVE_BUILTIN___BUILTIN_TYPES_COMPATIBLE_P)
69# define ST_DATA_COMPATIBLE_P(type) \
70 __builtin_choose_expr(__builtin_types_compatible_p(type, st_data_t), 1, 0)
72# define ST_DATA_COMPATIBLE_P(type) 0
81 unsigned char entry_power, bin_power, size_ind;
83 unsigned int rebuilds_num;
86 st_index_t num_entries;
92 st_index_t entries_start, entries_bound;
97#define st_is_member(table,key) st_lookup((table),(key),(st_data_t *)0)
99enum st_retval {ST_CONTINUE, ST_STOP, ST_DELETE, ST_CHECK, ST_REPLACE};
101size_t rb_st_table_size(
const struct st_table *tbl);
102#define st_table_size rb_st_table_size
104#define st_init_table rb_st_init_table
106#define st_init_table_with_size rb_st_init_table_with_size
108#define st_init_existing_table_with_size rb_st_init_existing_table_with_size
110#define st_init_numtable rb_st_init_numtable
111st_table *rb_st_init_numtable_with_size(st_index_t);
112#define st_init_numtable_with_size rb_st_init_numtable_with_size
114#define st_init_strtable rb_st_init_strtable
115st_table *rb_st_init_strtable_with_size(st_index_t);
116#define st_init_strtable_with_size rb_st_init_strtable_with_size
117st_table *rb_st_init_strcasetable(
void);
118#define st_init_strcasetable rb_st_init_strcasetable
119st_table *rb_st_init_strcasetable_with_size(st_index_t);
120#define st_init_strcasetable_with_size rb_st_init_strcasetable_with_size
121int rb_st_delete(
st_table *, st_data_t *, st_data_t *);
122#define st_delete rb_st_delete
123int rb_st_delete_safe(
st_table *, st_data_t *, st_data_t *, st_data_t);
124#define st_delete_safe rb_st_delete_safe
125int rb_st_shift(
st_table *, st_data_t *, st_data_t *);
126#define st_shift rb_st_shift
127int rb_st_insert(
st_table *, st_data_t, st_data_t);
128#define st_insert rb_st_insert
129int rb_st_insert2(
st_table *, st_data_t, st_data_t, st_data_t (*)(st_data_t));
130#define st_insert2 rb_st_insert2
131int rb_st_lookup(
st_table *, st_data_t, st_data_t *);
132#define st_lookup rb_st_lookup
133int rb_st_get_key(
st_table *, st_data_t, st_data_t *);
134#define st_get_key rb_st_get_key
135typedef int st_update_callback_func(st_data_t *key, st_data_t *value, st_data_t arg,
int existing);
139int rb_st_update(
st_table *table, st_data_t key, st_update_callback_func *func, st_data_t arg);
140#define st_update rb_st_update
141typedef int st_foreach_callback_func(st_data_t, st_data_t, st_data_t);
142typedef int st_foreach_check_callback_func(st_data_t, st_data_t, st_data_t,
int);
143int rb_st_foreach_with_replace(
st_table *tab, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg);
144#define st_foreach_with_replace rb_st_foreach_with_replace
145int rb_st_foreach(
st_table *, st_foreach_callback_func *, st_data_t);
146#define st_foreach rb_st_foreach
147int rb_st_foreach_check(
st_table *, st_foreach_check_callback_func *, st_data_t, st_data_t);
148#define st_foreach_check rb_st_foreach_check
149st_index_t rb_st_keys(
st_table *table, st_data_t *keys, st_index_t size);
150#define st_keys rb_st_keys
151st_index_t rb_st_keys_check(
st_table *table, st_data_t *keys, st_index_t size, st_data_t never);
152#define st_keys_check rb_st_keys_check
153st_index_t rb_st_values(
st_table *table, st_data_t *values, st_index_t size);
154#define st_values rb_st_values
155st_index_t rb_st_values_check(
st_table *table, st_data_t *values, st_index_t size, st_data_t never);
156#define st_values_check rb_st_values_check
157void rb_st_add_direct(
st_table *, st_data_t, st_data_t);
158#define st_add_direct rb_st_add_direct
160#define st_free_table rb_st_free_table
161void rb_st_cleanup_safe(
st_table *, st_data_t);
162#define st_cleanup_safe rb_st_cleanup_safe
164#define st_clear rb_st_clear
166#define st_replace rb_st_replace
168#define st_copy rb_st_copy
169CONSTFUNC(
int rb_st_numcmp(st_data_t, st_data_t));
170#define st_numcmp rb_st_numcmp
171CONSTFUNC(st_index_t rb_st_numhash(st_data_t));
172#define st_numhash rb_st_numhash
173PUREFUNC(
int rb_st_locale_insensitive_strcasecmp(
const char *s1,
const char *s2));
174#define st_locale_insensitive_strcasecmp rb_st_locale_insensitive_strcasecmp
175PUREFUNC(
int rb_st_locale_insensitive_strncasecmp(
const char *s1,
const char *s2,
size_t n));
176#define st_locale_insensitive_strncasecmp rb_st_locale_insensitive_strncasecmp
177#define st_strcasecmp rb_st_locale_insensitive_strcasecmp
178#define st_strncasecmp rb_st_locale_insensitive_strncasecmp
179PUREFUNC(
size_t rb_st_memsize(
const st_table *));
180#define st_memsize rb_st_memsize
181PUREFUNC(st_index_t rb_st_hash(
const void *ptr,
size_t len, st_index_t h));
182#define st_hash rb_st_hash
183CONSTFUNC(st_index_t rb_st_hash_uint32(st_index_t h, uint32_t i));
184#define st_hash_uint32 rb_st_hash_uint32
185CONSTFUNC(st_index_t rb_st_hash_uint(st_index_t h, st_index_t i));
186#define st_hash_uint rb_st_hash_uint
187CONSTFUNC(st_index_t rb_st_hash_end(st_index_t h));
188#define st_hash_end rb_st_hash_end
189CONSTFUNC(st_index_t rb_st_hash_start(st_index_t h));
190#define st_hash_start(h) ((st_index_t)(h))
192void rb_hash_bulk_insert_into_st_table(
long,
const VALUE *,
VALUE);
194RUBY_SYMBOL_EXPORT_END
196#if defined(__cplusplus)
int len
Length of the buffer.
uintptr_t VALUE
Type that represents a Ruby object.