/
hash_to_array.c
80 lines (58 loc) · 1.56 KB
/
hash_to_array.c
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
#include <ruby/ruby.h>
#include <ruby/st.h>
static VALUE rb_cHashToArray;
static void
hash_to_array_mark(void *f) {
}
static void
hash_to_array_free(void *f) {
}
static VALUE
hash_to_array_init(VALUE obj) {
return Qnil;
}
static VALUE
hash_to_array_alloc(VALUE klass) {
return Data_Wrap_Struct(klass, hash_to_array_mark, hash_to_array_free, NULL);
}
static int
convert_keys_to_a(VALUE key, VALUE value, VALUE ary) {
if (key == Qundef) return ST_CONTINUE;
if (TYPE(value) == T_HASH) {
rb_hash_foreach(value, convert_keys_to_a, ary);
}
return rb_ary_push(ary, key);
}
static VALUE
hash_to_array_all_keys(VALUE obj, VALUE hash) {
VALUE ary;
ary = rb_ary_new();
rb_hash_foreach(hash, convert_keys_to_a, ary);
return ary;
}
static int
convert_values_to_a(VALUE key, VALUE value, VALUE ary) {
if (key == Qundef) return ST_CONTINUE;
if (TYPE(value) == T_HASH) {
rb_hash_foreach(value, convert_values_to_a, ary);
return ST_CONTINUE;
} else {
return rb_ary_push(ary, value);
}
}
static VALUE
hash_to_array_all_values(VALUE obj, VALUE hash) {
VALUE ary;
ary = rb_ary_new();
rb_hash_foreach(hash, convert_values_to_a, ary);
return ary;
}
void
Init_hash_to_array()
{
rb_cHashToArray = rb_define_class("HashToArray", rb_cObject);
rb_define_alloc_func(rb_cHashToArray, hash_to_array_alloc);
rb_define_method(rb_cHashToArray, "initialize", hash_to_array_init, 0);
rb_define_method(rb_cHashToArray, "all_keys", hash_to_array_all_keys, 1);
rb_define_method(rb_cHashToArray, "all_values", hash_to_array_all_values, 1);
}