1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
use crate::rubysys::{
libc::uintptr_t,
types::{c_char, c_int, c_long, c_void, size_t, CallbackMutPtr, CallbackPtr, Value},
};
#[cfg_attr(rutie_dllimport, link(name = "rutie_ruby"))]
extern "C" {
// VALUE
// rb_hash_aref(VALUE hash, VALUE key)
pub fn rb_hash_aref(hash: Value, key: Value) -> Value;
// VALUE
// rb_hash_aset(VALUE hash, VALUE key, VALUE val)
pub fn rb_hash_aset(hash: Value, key: Value, value: Value) -> Value;
// VALUE
// rb_hash_clear(VALUE hash)
pub fn rb_hash_clear(hash: Value) -> Value;
// VALUE
// rb_hash_delete(VALUE hash, VALUE key)
pub fn rb_hash_delete(hash: Value, key: Value) -> Value;
// VALUE
// rb_hash_dup(VALUE hash)
pub fn rb_hash_dup(hash: Value) -> Value;
// void
// rb_hash_foreach(VALUE hash, int (*func)(ANYARGS), VALUE farg)
pub fn rb_hash_foreach(hash: Value, callback: CallbackPtr, pass: CallbackMutPtr);
// VALUE
// rb_hash_new(void)
pub fn rb_hash_new() -> Value;
// VALUE
// rb_hash_new_capa(long capa)
pub fn rb_hash_new_capa(capa: c_long) -> Value;
// VALUE
// rb_hash_size(VALUE hash)
pub fn rb_hash_size(hash: Value) -> Value;
// VALUE
// rb_hash_freeze(VALUE hash)
pub fn rb_hash_freeze(hash: Value) -> Value;
// VALUE
// rb_check_hash_type(VALUE hash)
pub fn rb_check_hash_type(object: Value) -> Value;
// VALUE
// rb_hash_delete_if(VALUE hash)
//
// Needs a Ruby block.
pub fn rb_hash_delete_if(hash: Value) -> Value;
// VALUE
// rb_hash_fetch(VALUE hash, VALUE key)
//
// Raises `KeyError` when `key` is missing.
pub fn rb_hash_fetch(hash: Value, key: Value) -> Value;
// VALUE
// rb_hash_lookup(VALUE hash, VALUE key)
pub fn rb_hash_lookup(hash: Value, key: Value) -> Value;
// VALUE
// rb_hash_lookup2(VALUE hash, VALUE key, VALUE def)
//
// Returns `def` when `key` is missing; the hash's default is not used.
pub fn rb_hash_lookup2(hash: Value, key: Value, default: Value) -> Value;
// VALUE
// rb_hash_set_ifnone(VALUE hash, VALUE ifnone)
//
// Does not check frozen state nor clear a default proc; prefer `default=`.
pub fn rb_hash_set_ifnone(hash: Value, ifnone: Value) -> Value;
// VALUE
// rb_hash_update_by(VALUE hash1, VALUE hash2, rb_hash_update_func *func)
//
// With a null `func`, values from `hash2` overwrite.
pub fn rb_hash_update_by(hash: Value, other: Value, func: CallbackPtr) -> Value;
}
// int (*func)(st_data_t key, st_data_t val, st_data_t arg), the
// `st_foreach_callback_func` of `rb_st_foreach_safe`.
pub type StForeachCallback =
extern "C" fn(key: uintptr_t, value: uintptr_t, arg: uintptr_t) -> c_int;
#[cfg_attr(rutie_dllimport, link(name = "rutie_ruby"))]
extern "C" {
// VALUE
// rb_env_clear(void)
//
// `ENV.clear`: removes every environment variable of the process.
pub fn rb_env_clear() -> Value;
// void
// rb_hash_bulk_insert(long argc, const VALUE *argv, VALUE hash)
//
// `argv` holds `argc / 2` key, value pairs (`argc` must be even). The
// hash is not checked for being frozen.
pub fn rb_hash_bulk_insert(argc: c_long, argv: *const Value, hash: Value);
// void
// rb_st_foreach_safe(struct st_table *st, st_foreach_callback_func *func, st_data_t arg)
pub fn rb_st_foreach_safe(table: *mut c_void, func: StForeachCallback, arg: uintptr_t);
// size_t
// rb_hash_size_num(VALUE hash)
pub fn rb_hash_size_num(hash: Value) -> size_t;
// struct st_table *
// rb_hash_tbl(VALUE hash, const char *file, int line)
//
// The hash's `st_table`, converting a small (array) table first.
pub fn rb_hash_tbl(hash: Value, file: *const c_char, line: c_int) -> *mut c_void;
}