1 | /*
|
---|
2 | ** hash.c - Hash class
|
---|
3 | **
|
---|
4 | ** See Copyright Notice in mruby.h
|
---|
5 | */
|
---|
6 |
|
---|
7 | #include <mruby.h>
|
---|
8 | #include <mruby/array.h>
|
---|
9 | #include <mruby/class.h>
|
---|
10 | #include <mruby/hash.h>
|
---|
11 | #include <mruby/khash.h>
|
---|
12 | #include <mruby/string.h>
|
---|
13 | #include <mruby/variable.h>
|
---|
14 |
|
---|
15 | /* a function to get hash value of a float number */
|
---|
16 | mrb_int mrb_float_id(mrb_float f);
|
---|
17 |
|
---|
18 | static inline khint_t
|
---|
19 | mrb_hash_ht_hash_func(mrb_state *mrb, mrb_value key)
|
---|
20 | {
|
---|
21 | enum mrb_vtype t = mrb_type(key);
|
---|
22 | mrb_value hv;
|
---|
23 | const char *p;
|
---|
24 | mrb_int i, len;
|
---|
25 | khint_t h;
|
---|
26 |
|
---|
27 | switch (t) {
|
---|
28 | case MRB_TT_STRING:
|
---|
29 | p = RSTRING_PTR(key);
|
---|
30 | len = RSTRING_LEN(key);
|
---|
31 | h = 0;
|
---|
32 | for (i=0; i<len; i++) {
|
---|
33 | h = (h << 5) - h + *p++;
|
---|
34 | }
|
---|
35 | return h;
|
---|
36 |
|
---|
37 | case MRB_TT_SYMBOL:
|
---|
38 | h = (khint_t)mrb_symbol(key);
|
---|
39 | return kh_int_hash_func(mrb, h);
|
---|
40 |
|
---|
41 | case MRB_TT_FIXNUM:
|
---|
42 | h = (khint_t)mrb_float_id((mrb_float)mrb_fixnum(key));
|
---|
43 | return kh_int_hash_func(mrb, h);
|
---|
44 |
|
---|
45 | case MRB_TT_FLOAT:
|
---|
46 | h = (khint_t)mrb_float_id(mrb_float(key));
|
---|
47 | return kh_int_hash_func(mrb, h);
|
---|
48 |
|
---|
49 | default:
|
---|
50 | hv = mrb_funcall(mrb, key, "hash", 0);
|
---|
51 | h = (khint_t)t ^ mrb_fixnum(hv);
|
---|
52 | return kh_int_hash_func(mrb, h);
|
---|
53 | }
|
---|
54 | }
|
---|
55 |
|
---|
56 | static inline khint_t
|
---|
57 | mrb_hash_ht_hash_equal(mrb_state *mrb, mrb_value a, mrb_value b)
|
---|
58 | {
|
---|
59 | enum mrb_vtype t = mrb_type(a);
|
---|
60 |
|
---|
61 | switch (t) {
|
---|
62 | case MRB_TT_STRING:
|
---|
63 | return mrb_str_equal(mrb, a, b);
|
---|
64 |
|
---|
65 | case MRB_TT_SYMBOL:
|
---|
66 | if (mrb_type(b) != MRB_TT_SYMBOL) return FALSE;
|
---|
67 | return mrb_symbol(a) == mrb_symbol(b);
|
---|
68 |
|
---|
69 | case MRB_TT_FIXNUM:
|
---|
70 | switch (mrb_type(b)) {
|
---|
71 | case MRB_TT_FIXNUM:
|
---|
72 | return mrb_fixnum(a) == mrb_fixnum(b);
|
---|
73 | case MRB_TT_FLOAT:
|
---|
74 | return (mrb_float)mrb_fixnum(a) == mrb_float(b);
|
---|
75 | default:
|
---|
76 | return FALSE;
|
---|
77 | }
|
---|
78 |
|
---|
79 | case MRB_TT_FLOAT:
|
---|
80 | switch (mrb_type(b)) {
|
---|
81 | case MRB_TT_FIXNUM:
|
---|
82 | return mrb_float(a) == (mrb_float)mrb_fixnum(b);
|
---|
83 | case MRB_TT_FLOAT:
|
---|
84 | return mrb_float(a) == mrb_float(b);
|
---|
85 | default:
|
---|
86 | return FALSE;
|
---|
87 | }
|
---|
88 |
|
---|
89 | default:
|
---|
90 | return mrb_eql(mrb, a, b);
|
---|
91 | }
|
---|
92 | }
|
---|
93 |
|
---|
94 | KHASH_DEFINE (ht, mrb_value, mrb_hash_value, TRUE, mrb_hash_ht_hash_func, mrb_hash_ht_hash_equal)
|
---|
95 |
|
---|
96 | static void mrb_hash_modify(mrb_state *mrb, mrb_value hash);
|
---|
97 |
|
---|
98 | static inline mrb_value
|
---|
99 | mrb_hash_ht_key(mrb_state *mrb, mrb_value key)
|
---|
100 | {
|
---|
101 | if (mrb_string_p(key) && !MRB_FROZEN_P(mrb_str_ptr(key))) {
|
---|
102 | key = mrb_str_dup(mrb, key);
|
---|
103 | MRB_SET_FROZEN_FLAG(mrb_str_ptr(key));
|
---|
104 | }
|
---|
105 | return key;
|
---|
106 | }
|
---|
107 |
|
---|
108 | #define KEY(key) mrb_hash_ht_key(mrb, key)
|
---|
109 |
|
---|
110 | void
|
---|
111 | mrb_gc_mark_hash(mrb_state *mrb, struct RHash *hash)
|
---|
112 | {
|
---|
113 | khiter_t k;
|
---|
114 | khash_t(ht) *h = hash->ht;
|
---|
115 |
|
---|
116 | if (!h) return;
|
---|
117 | for (k = kh_begin(h); k != kh_end(h); k++) {
|
---|
118 | if (kh_exist(h, k)) {
|
---|
119 | mrb_value key = kh_key(h, k);
|
---|
120 | mrb_value val = kh_value(h, k).v;
|
---|
121 |
|
---|
122 | mrb_gc_mark_value(mrb, key);
|
---|
123 | mrb_gc_mark_value(mrb, val);
|
---|
124 | }
|
---|
125 | }
|
---|
126 | }
|
---|
127 |
|
---|
128 | size_t
|
---|
129 | mrb_gc_mark_hash_size(mrb_state *mrb, struct RHash *hash)
|
---|
130 | {
|
---|
131 | if (!hash->ht) return 0;
|
---|
132 | return kh_size(hash->ht)*2;
|
---|
133 | }
|
---|
134 |
|
---|
135 | void
|
---|
136 | mrb_gc_free_hash(mrb_state *mrb, struct RHash *hash)
|
---|
137 | {
|
---|
138 | if (hash->ht) kh_destroy(ht, mrb, hash->ht);
|
---|
139 | }
|
---|
140 |
|
---|
141 |
|
---|
142 | MRB_API mrb_value
|
---|
143 | mrb_hash_new_capa(mrb_state *mrb, mrb_int capa)
|
---|
144 | {
|
---|
145 | struct RHash *h;
|
---|
146 |
|
---|
147 | h = (struct RHash*)mrb_obj_alloc(mrb, MRB_TT_HASH, mrb->hash_class);
|
---|
148 | h->ht = kh_init(ht, mrb);
|
---|
149 | if (capa > 0) {
|
---|
150 | kh_resize(ht, mrb, h->ht, capa);
|
---|
151 | }
|
---|
152 | h->iv = 0;
|
---|
153 | return mrb_obj_value(h);
|
---|
154 | }
|
---|
155 |
|
---|
156 | MRB_API mrb_value
|
---|
157 | mrb_hash_new(mrb_state *mrb)
|
---|
158 | {
|
---|
159 | return mrb_hash_new_capa(mrb, 0);
|
---|
160 | }
|
---|
161 |
|
---|
162 | static mrb_value mrb_hash_default(mrb_state *mrb, mrb_value hash);
|
---|
163 | static mrb_value hash_default(mrb_state *mrb, mrb_value hash, mrb_value key);
|
---|
164 |
|
---|
165 | MRB_API mrb_value
|
---|
166 | mrb_hash_get(mrb_state *mrb, mrb_value hash, mrb_value key)
|
---|
167 | {
|
---|
168 | khash_t(ht) *h = RHASH_TBL(hash);
|
---|
169 | khiter_t k;
|
---|
170 | mrb_sym mid;
|
---|
171 |
|
---|
172 | if (h) {
|
---|
173 | k = kh_get(ht, mrb, h, key);
|
---|
174 | if (k != kh_end(h))
|
---|
175 | return kh_value(h, k).v;
|
---|
176 | }
|
---|
177 |
|
---|
178 | mid = mrb_intern_lit(mrb, "default");
|
---|
179 | if (mrb_func_basic_p(mrb, hash, mid, mrb_hash_default)) {
|
---|
180 | return hash_default(mrb, hash, key);
|
---|
181 | }
|
---|
182 | /* xxx mrb_funcall_tailcall(mrb, hash, "default", 1, key); */
|
---|
183 | return mrb_funcall_argv(mrb, hash, mid, 1, &key);
|
---|
184 | }
|
---|
185 |
|
---|
186 | MRB_API mrb_value
|
---|
187 | mrb_hash_fetch(mrb_state *mrb, mrb_value hash, mrb_value key, mrb_value def)
|
---|
188 | {
|
---|
189 | khash_t(ht) *h = RHASH_TBL(hash);
|
---|
190 | khiter_t k;
|
---|
191 |
|
---|
192 | if (h) {
|
---|
193 | k = kh_get(ht, mrb, h, key);
|
---|
194 | if (k != kh_end(h))
|
---|
195 | return kh_value(h, k).v;
|
---|
196 | }
|
---|
197 |
|
---|
198 | /* not found */
|
---|
199 | return def;
|
---|
200 | }
|
---|
201 |
|
---|
202 | MRB_API void
|
---|
203 | mrb_hash_set(mrb_state *mrb, mrb_value hash, mrb_value key, mrb_value val)
|
---|
204 | {
|
---|
205 | khash_t(ht) *h;
|
---|
206 | khiter_t k;
|
---|
207 | int r;
|
---|
208 |
|
---|
209 | mrb_hash_modify(mrb, hash);
|
---|
210 | h = RHASH_TBL(hash);
|
---|
211 |
|
---|
212 | if (!h) h = RHASH_TBL(hash) = kh_init(ht, mrb);
|
---|
213 | k = kh_put2(ht, mrb, h, key, &r);
|
---|
214 | kh_value(h, k).v = val;
|
---|
215 |
|
---|
216 | if (r != 0) {
|
---|
217 | /* expand */
|
---|
218 | int ai = mrb_gc_arena_save(mrb);
|
---|
219 | key = kh_key(h, k) = KEY(key);
|
---|
220 | mrb_gc_arena_restore(mrb, ai);
|
---|
221 | kh_value(h, k).n = kh_size(h)-1;
|
---|
222 | }
|
---|
223 |
|
---|
224 | mrb_field_write_barrier_value(mrb, (struct RBasic*)RHASH(hash), key);
|
---|
225 | mrb_field_write_barrier_value(mrb, (struct RBasic*)RHASH(hash), val);
|
---|
226 | return;
|
---|
227 | }
|
---|
228 |
|
---|
229 | static mrb_value
|
---|
230 | mrb_hash_dup(mrb_state *mrb, mrb_value hash)
|
---|
231 | {
|
---|
232 | struct RHash* ret;
|
---|
233 | khash_t(ht) *h, *ret_h;
|
---|
234 | khiter_t k, ret_k;
|
---|
235 | mrb_value ifnone, vret;
|
---|
236 |
|
---|
237 | h = RHASH_TBL(hash);
|
---|
238 | ret = (struct RHash*)mrb_obj_alloc(mrb, MRB_TT_HASH, mrb->hash_class);
|
---|
239 | ret->ht = kh_init(ht, mrb);
|
---|
240 |
|
---|
241 | if (h && kh_size(h) > 0) {
|
---|
242 | ret_h = ret->ht;
|
---|
243 |
|
---|
244 | for (k = kh_begin(h); k != kh_end(h); k++) {
|
---|
245 | if (kh_exist(h, k)) {
|
---|
246 | int ai = mrb_gc_arena_save(mrb);
|
---|
247 | ret_k = kh_put(ht, mrb, ret_h, KEY(kh_key(h, k)));
|
---|
248 | mrb_gc_arena_restore(mrb, ai);
|
---|
249 | kh_val(ret_h, ret_k).v = kh_val(h, k).v;
|
---|
250 | kh_val(ret_h, ret_k).n = kh_size(ret_h)-1;
|
---|
251 | }
|
---|
252 | }
|
---|
253 | }
|
---|
254 |
|
---|
255 | if (MRB_RHASH_DEFAULT_P(hash)) {
|
---|
256 | ret->flags |= MRB_HASH_DEFAULT;
|
---|
257 | }
|
---|
258 | if (MRB_RHASH_PROCDEFAULT_P(hash)) {
|
---|
259 | ret->flags |= MRB_HASH_PROC_DEFAULT;
|
---|
260 | }
|
---|
261 | vret = mrb_obj_value(ret);
|
---|
262 | ifnone = RHASH_IFNONE(hash);
|
---|
263 | if (!mrb_nil_p(ifnone)) {
|
---|
264 | mrb_iv_set(mrb, vret, mrb_intern_lit(mrb, "ifnone"), ifnone);
|
---|
265 | }
|
---|
266 | return vret;
|
---|
267 | }
|
---|
268 |
|
---|
269 | MRB_API mrb_value
|
---|
270 | mrb_check_hash_type(mrb_state *mrb, mrb_value hash)
|
---|
271 | {
|
---|
272 | return mrb_check_convert_type(mrb, hash, MRB_TT_HASH, "Hash", "to_hash");
|
---|
273 | }
|
---|
274 |
|
---|
275 | MRB_API khash_t(ht)*
|
---|
276 | mrb_hash_tbl(mrb_state *mrb, mrb_value hash)
|
---|
277 | {
|
---|
278 | khash_t(ht) *h = RHASH_TBL(hash);
|
---|
279 |
|
---|
280 | if (!h) {
|
---|
281 | return RHASH_TBL(hash) = kh_init(ht, mrb);
|
---|
282 | }
|
---|
283 | return h;
|
---|
284 | }
|
---|
285 |
|
---|
286 | static void
|
---|
287 | mrb_hash_modify(mrb_state *mrb, mrb_value hash)
|
---|
288 | {
|
---|
289 | if (MRB_FROZEN_P(mrb_hash_ptr(hash))) {
|
---|
290 | mrb_raise(mrb, E_RUNTIME_ERROR, "can't modify frozen hash");
|
---|
291 | }
|
---|
292 | mrb_hash_tbl(mrb, hash);
|
---|
293 | }
|
---|
294 |
|
---|
295 | /* 15.2.13.4.16 */
|
---|
296 | /*
|
---|
297 | * call-seq:
|
---|
298 | * Hash.new -> new_hash
|
---|
299 | * Hash.new(obj) -> new_hash
|
---|
300 | * Hash.new {|hash, key| block } -> new_hash
|
---|
301 | *
|
---|
302 | * Returns a new, empty hash. If this hash is subsequently accessed by
|
---|
303 | * a key that doesn't correspond to a hash entry, the value returned
|
---|
304 | * depends on the style of <code>new</code> used to create the hash. In
|
---|
305 | * the first form, the access returns <code>nil</code>. If
|
---|
306 | * <i>obj</i> is specified, this single object will be used for
|
---|
307 | * all <em>default values</em>. If a block is specified, it will be
|
---|
308 | * called with the hash object and the key, and should return the
|
---|
309 | * default value. It is the block's responsibility to store the value
|
---|
310 | * in the hash if required.
|
---|
311 | *
|
---|
312 | * h = Hash.new("Go Fish")
|
---|
313 | * h["a"] = 100
|
---|
314 | * h["b"] = 200
|
---|
315 | * h["a"] #=> 100
|
---|
316 | * h["c"] #=> "Go Fish"
|
---|
317 | * # The following alters the single default object
|
---|
318 | * h["c"].upcase! #=> "GO FISH"
|
---|
319 | * h["d"] #=> "GO FISH"
|
---|
320 | * h.keys #=> ["a", "b"]
|
---|
321 | *
|
---|
322 | * # While this creates a new default object each time
|
---|
323 | * h = Hash.new { |hash, key| hash[key] = "Go Fish: #{key}" }
|
---|
324 | * h["c"] #=> "Go Fish: c"
|
---|
325 | * h["c"].upcase! #=> "GO FISH: C"
|
---|
326 | * h["d"] #=> "Go Fish: d"
|
---|
327 | * h.keys #=> ["c", "d"]
|
---|
328 | *
|
---|
329 | */
|
---|
330 |
|
---|
331 | static mrb_value
|
---|
332 | mrb_hash_init(mrb_state *mrb, mrb_value hash)
|
---|
333 | {
|
---|
334 | mrb_value block, ifnone;
|
---|
335 | mrb_bool ifnone_p;
|
---|
336 |
|
---|
337 | ifnone = mrb_nil_value();
|
---|
338 | mrb_get_args(mrb, "&|o?", &block, &ifnone, &ifnone_p);
|
---|
339 | mrb_hash_modify(mrb, hash);
|
---|
340 | if (!mrb_nil_p(block)) {
|
---|
341 | if (ifnone_p) {
|
---|
342 | mrb_raise(mrb, E_ARGUMENT_ERROR, "wrong number of arguments");
|
---|
343 | }
|
---|
344 | RHASH(hash)->flags |= MRB_HASH_PROC_DEFAULT;
|
---|
345 | ifnone = block;
|
---|
346 | }
|
---|
347 | if (!mrb_nil_p(ifnone)) {
|
---|
348 | RHASH(hash)->flags |= MRB_HASH_DEFAULT;
|
---|
349 | mrb_iv_set(mrb, hash, mrb_intern_lit(mrb, "ifnone"), ifnone);
|
---|
350 | }
|
---|
351 | return hash;
|
---|
352 | }
|
---|
353 |
|
---|
354 | /* 15.2.13.4.2 */
|
---|
355 | /*
|
---|
356 | * call-seq:
|
---|
357 | * hsh[key] -> value
|
---|
358 | *
|
---|
359 | * Element Reference---Retrieves the <i>value</i> object corresponding
|
---|
360 | * to the <i>key</i> object. If not found, returns the default value (see
|
---|
361 | * <code>Hash::new</code> for details).
|
---|
362 | *
|
---|
363 | * h = { "a" => 100, "b" => 200 }
|
---|
364 | * h["a"] #=> 100
|
---|
365 | * h["c"] #=> nil
|
---|
366 | *
|
---|
367 | */
|
---|
368 | static mrb_value
|
---|
369 | mrb_hash_aget(mrb_state *mrb, mrb_value self)
|
---|
370 | {
|
---|
371 | mrb_value key;
|
---|
372 |
|
---|
373 | mrb_get_args(mrb, "o", &key);
|
---|
374 | return mrb_hash_get(mrb, self, key);
|
---|
375 | }
|
---|
376 |
|
---|
377 | static mrb_value
|
---|
378 | hash_default(mrb_state *mrb, mrb_value hash, mrb_value key)
|
---|
379 | {
|
---|
380 | if (MRB_RHASH_DEFAULT_P(hash)) {
|
---|
381 | if (MRB_RHASH_PROCDEFAULT_P(hash)) {
|
---|
382 | return mrb_funcall(mrb, RHASH_PROCDEFAULT(hash), "call", 2, hash, key);
|
---|
383 | }
|
---|
384 | else {
|
---|
385 | return RHASH_IFNONE(hash);
|
---|
386 | }
|
---|
387 | }
|
---|
388 | return mrb_nil_value();
|
---|
389 | }
|
---|
390 |
|
---|
391 | /* 15.2.13.4.5 */
|
---|
392 | /*
|
---|
393 | * call-seq:
|
---|
394 | * hsh.default(key=nil) -> obj
|
---|
395 | *
|
---|
396 | * Returns the default value, the value that would be returned by
|
---|
397 | * <i>hsh</i>[<i>key</i>] if <i>key</i> did not exist in <i>hsh</i>.
|
---|
398 | * See also <code>Hash::new</code> and <code>Hash#default=</code>.
|
---|
399 | *
|
---|
400 | * h = Hash.new #=> {}
|
---|
401 | * h.default #=> nil
|
---|
402 | * h.default(2) #=> nil
|
---|
403 | *
|
---|
404 | * h = Hash.new("cat") #=> {}
|
---|
405 | * h.default #=> "cat"
|
---|
406 | * h.default(2) #=> "cat"
|
---|
407 | *
|
---|
408 | * h = Hash.new {|h,k| h[k] = k.to_i*10} #=> {}
|
---|
409 | * h.default #=> nil
|
---|
410 | * h.default(2) #=> 20
|
---|
411 | */
|
---|
412 |
|
---|
413 | static mrb_value
|
---|
414 | mrb_hash_default(mrb_state *mrb, mrb_value hash)
|
---|
415 | {
|
---|
416 | mrb_value key;
|
---|
417 | mrb_bool given;
|
---|
418 |
|
---|
419 | mrb_get_args(mrb, "|o?", &key, &given);
|
---|
420 | if (MRB_RHASH_DEFAULT_P(hash)) {
|
---|
421 | if (MRB_RHASH_PROCDEFAULT_P(hash)) {
|
---|
422 | if (!given) return mrb_nil_value();
|
---|
423 | return mrb_funcall(mrb, RHASH_PROCDEFAULT(hash), "call", 2, hash, key);
|
---|
424 | }
|
---|
425 | else {
|
---|
426 | return RHASH_IFNONE(hash);
|
---|
427 | }
|
---|
428 | }
|
---|
429 | return mrb_nil_value();
|
---|
430 | }
|
---|
431 |
|
---|
432 | /* 15.2.13.4.6 */
|
---|
433 | /*
|
---|
434 | * call-seq:
|
---|
435 | * hsh.default = obj -> obj
|
---|
436 | *
|
---|
437 | * Sets the default value, the value returned for a key that does not
|
---|
438 | * exist in the hash. It is not possible to set the default to a
|
---|
439 | * <code>Proc</code> that will be executed on each key lookup.
|
---|
440 | *
|
---|
441 | * h = { "a" => 100, "b" => 200 }
|
---|
442 | * h.default = "Go fish"
|
---|
443 | * h["a"] #=> 100
|
---|
444 | * h["z"] #=> "Go fish"
|
---|
445 | * # This doesn't do what you might hope...
|
---|
446 | * h.default = proc do |hash, key|
|
---|
447 | * hash[key] = key + key
|
---|
448 | * end
|
---|
449 | * h[2] #=> #<Proc:0x401b3948@-:6>
|
---|
450 | * h["cat"] #=> #<Proc:0x401b3948@-:6>
|
---|
451 | */
|
---|
452 |
|
---|
453 | static mrb_value
|
---|
454 | mrb_hash_set_default(mrb_state *mrb, mrb_value hash)
|
---|
455 | {
|
---|
456 | mrb_value ifnone;
|
---|
457 |
|
---|
458 | mrb_get_args(mrb, "o", &ifnone);
|
---|
459 | mrb_hash_modify(mrb, hash);
|
---|
460 | mrb_iv_set(mrb, hash, mrb_intern_lit(mrb, "ifnone"), ifnone);
|
---|
461 | RHASH(hash)->flags &= ~MRB_HASH_PROC_DEFAULT;
|
---|
462 | if (!mrb_nil_p(ifnone)) {
|
---|
463 | RHASH(hash)->flags |= MRB_HASH_DEFAULT;
|
---|
464 | }
|
---|
465 | else {
|
---|
466 | RHASH(hash)->flags &= ~MRB_HASH_DEFAULT;
|
---|
467 | }
|
---|
468 | return ifnone;
|
---|
469 | }
|
---|
470 |
|
---|
471 | /* 15.2.13.4.7 */
|
---|
472 | /*
|
---|
473 | * call-seq:
|
---|
474 | * hsh.default_proc -> anObject
|
---|
475 | *
|
---|
476 | * If <code>Hash::new</code> was invoked with a block, return that
|
---|
477 | * block, otherwise return <code>nil</code>.
|
---|
478 | *
|
---|
479 | * h = Hash.new {|h,k| h[k] = k*k } #=> {}
|
---|
480 | * p = h.default_proc #=> #<Proc:0x401b3d08@-:1>
|
---|
481 | * a = [] #=> []
|
---|
482 | * p.call(a, 2)
|
---|
483 | * a #=> [nil, nil, 4]
|
---|
484 | */
|
---|
485 |
|
---|
486 |
|
---|
487 | static mrb_value
|
---|
488 | mrb_hash_default_proc(mrb_state *mrb, mrb_value hash)
|
---|
489 | {
|
---|
490 | if (MRB_RHASH_PROCDEFAULT_P(hash)) {
|
---|
491 | return RHASH_PROCDEFAULT(hash);
|
---|
492 | }
|
---|
493 | return mrb_nil_value();
|
---|
494 | }
|
---|
495 |
|
---|
496 | /*
|
---|
497 | * call-seq:
|
---|
498 | * hsh.default_proc = proc_obj -> proc_obj
|
---|
499 | *
|
---|
500 | * Sets the default proc to be executed on each key lookup.
|
---|
501 | *
|
---|
502 | * h.default_proc = proc do |hash, key|
|
---|
503 | * hash[key] = key + key
|
---|
504 | * end
|
---|
505 | * h[2] #=> 4
|
---|
506 | * h["cat"] #=> "catcat"
|
---|
507 | */
|
---|
508 |
|
---|
509 | static mrb_value
|
---|
510 | mrb_hash_set_default_proc(mrb_state *mrb, mrb_value hash)
|
---|
511 | {
|
---|
512 | mrb_value ifnone;
|
---|
513 |
|
---|
514 | mrb_get_args(mrb, "o", &ifnone);
|
---|
515 | mrb_hash_modify(mrb, hash);
|
---|
516 | mrb_iv_set(mrb, hash, mrb_intern_lit(mrb, "ifnone"), ifnone);
|
---|
517 | if (!mrb_nil_p(ifnone)) {
|
---|
518 | RHASH(hash)->flags |= MRB_HASH_PROC_DEFAULT;
|
---|
519 | RHASH(hash)->flags |= MRB_HASH_DEFAULT;
|
---|
520 | }
|
---|
521 | else {
|
---|
522 | RHASH(hash)->flags &= ~MRB_HASH_DEFAULT;
|
---|
523 | RHASH(hash)->flags &= ~MRB_HASH_PROC_DEFAULT;
|
---|
524 | }
|
---|
525 |
|
---|
526 | return ifnone;
|
---|
527 | }
|
---|
528 |
|
---|
529 | MRB_API mrb_value
|
---|
530 | mrb_hash_delete_key(mrb_state *mrb, mrb_value hash, mrb_value key)
|
---|
531 | {
|
---|
532 | khash_t(ht) *h = RHASH_TBL(hash);
|
---|
533 | khiter_t k;
|
---|
534 | mrb_value delVal;
|
---|
535 | mrb_int n;
|
---|
536 |
|
---|
537 | if (h) {
|
---|
538 | k = kh_get(ht, mrb, h, key);
|
---|
539 | if (k != kh_end(h)) {
|
---|
540 | delVal = kh_value(h, k).v;
|
---|
541 | n = kh_value(h, k).n;
|
---|
542 | kh_del(ht, mrb, h, k);
|
---|
543 | for (k = kh_begin(h); k != kh_end(h); k++) {
|
---|
544 | if (!kh_exist(h, k)) continue;
|
---|
545 | if (kh_value(h, k).n > n) kh_value(h, k).n--;
|
---|
546 | }
|
---|
547 | return delVal;
|
---|
548 | }
|
---|
549 | }
|
---|
550 |
|
---|
551 | /* not found */
|
---|
552 | return mrb_nil_value();
|
---|
553 | }
|
---|
554 |
|
---|
555 | /* 15.2.13.4.8 */
|
---|
556 | /*
|
---|
557 | * call-seq:
|
---|
558 | * hsh.delete(key) -> value
|
---|
559 | * hsh.delete(key) {| key | block } -> value
|
---|
560 | *
|
---|
561 | * Deletes and returns a key-value pair from <i>hsh</i> whose key is
|
---|
562 | * equal to <i>key</i>. If the key is not found, returns the
|
---|
563 | * <em>default value</em>. If the optional code block is given and the
|
---|
564 | * key is not found, pass in the key and return the result of
|
---|
565 | * <i>block</i>.
|
---|
566 | *
|
---|
567 | * h = { "a" => 100, "b" => 200 }
|
---|
568 | * h.delete("a") #=> 100
|
---|
569 | * h.delete("z") #=> nil
|
---|
570 | * h.delete("z") { |el| "#{el} not found" } #=> "z not found"
|
---|
571 | *
|
---|
572 | */
|
---|
573 | static mrb_value
|
---|
574 | mrb_hash_delete(mrb_state *mrb, mrb_value self)
|
---|
575 | {
|
---|
576 | mrb_value key;
|
---|
577 |
|
---|
578 | mrb_get_args(mrb, "o", &key);
|
---|
579 | mrb_hash_modify(mrb, self);
|
---|
580 | return mrb_hash_delete_key(mrb, self, key);
|
---|
581 | }
|
---|
582 |
|
---|
583 | /* 15.2.13.4.24 */
|
---|
584 | /*
|
---|
585 | * call-seq:
|
---|
586 | * hsh.shift -> anArray or obj
|
---|
587 | *
|
---|
588 | * Removes a key-value pair from <i>hsh</i> and returns it as the
|
---|
589 | * two-item array <code>[</code> <i>key, value</i> <code>]</code>, or
|
---|
590 | * the hash's default value if the hash is empty.
|
---|
591 | *
|
---|
592 | * h = { 1 => "a", 2 => "b", 3 => "c" }
|
---|
593 | * h.shift #=> [1, "a"]
|
---|
594 | * h #=> {2=>"b", 3=>"c"}
|
---|
595 | */
|
---|
596 |
|
---|
597 | static mrb_value
|
---|
598 | mrb_hash_shift(mrb_state *mrb, mrb_value hash)
|
---|
599 | {
|
---|
600 | khash_t(ht) *h = RHASH_TBL(hash);
|
---|
601 | khiter_t k;
|
---|
602 | mrb_value delKey, delVal;
|
---|
603 |
|
---|
604 | mrb_hash_modify(mrb, hash);
|
---|
605 | if (h && kh_size(h) > 0) {
|
---|
606 | for (k = kh_begin(h); k != kh_end(h); k++) {
|
---|
607 | if (!kh_exist(h, k)) continue;
|
---|
608 |
|
---|
609 | delKey = kh_key(h, k);
|
---|
610 | mrb_gc_protect(mrb, delKey);
|
---|
611 | delVal = mrb_hash_delete_key(mrb, hash, delKey);
|
---|
612 | mrb_gc_protect(mrb, delVal);
|
---|
613 |
|
---|
614 | return mrb_assoc_new(mrb, delKey, delVal);
|
---|
615 | }
|
---|
616 | }
|
---|
617 |
|
---|
618 | if (MRB_RHASH_DEFAULT_P(hash)) {
|
---|
619 | if (MRB_RHASH_PROCDEFAULT_P(hash)) {
|
---|
620 | return mrb_funcall(mrb, RHASH_PROCDEFAULT(hash), "call", 2, hash, mrb_nil_value());
|
---|
621 | }
|
---|
622 | else {
|
---|
623 | return RHASH_IFNONE(hash);
|
---|
624 | }
|
---|
625 | }
|
---|
626 | return mrb_nil_value();
|
---|
627 | }
|
---|
628 |
|
---|
629 | /* 15.2.13.4.4 */
|
---|
630 | /*
|
---|
631 | * call-seq:
|
---|
632 | * hsh.clear -> hsh
|
---|
633 | *
|
---|
634 | * Removes all key-value pairs from `hsh`.
|
---|
635 | *
|
---|
636 | * h = { "a" => 100, "b" => 200 } #=> {"a"=>100, "b"=>200}
|
---|
637 | * h.clear #=> {}
|
---|
638 | *
|
---|
639 | */
|
---|
640 |
|
---|
641 | MRB_API mrb_value
|
---|
642 | mrb_hash_clear(mrb_state *mrb, mrb_value hash)
|
---|
643 | {
|
---|
644 | khash_t(ht) *h = RHASH_TBL(hash);
|
---|
645 |
|
---|
646 | mrb_hash_modify(mrb, hash);
|
---|
647 | if (h) kh_clear(ht, mrb, h);
|
---|
648 | return hash;
|
---|
649 | }
|
---|
650 |
|
---|
651 | /* 15.2.13.4.3 */
|
---|
652 | /* 15.2.13.4.26 */
|
---|
653 | /*
|
---|
654 | * call-seq:
|
---|
655 | * hsh[key] = value -> value
|
---|
656 | * hsh.store(key, value) -> value
|
---|
657 | *
|
---|
658 | * Element Assignment---Associates the value given by
|
---|
659 | * <i>value</i> with the key given by <i>key</i>.
|
---|
660 | * <i>key</i> should not have its value changed while it is in
|
---|
661 | * use as a key (a <code>String</code> passed as a key will be
|
---|
662 | * duplicated and frozen).
|
---|
663 | *
|
---|
664 | * h = { "a" => 100, "b" => 200 }
|
---|
665 | * h["a"] = 9
|
---|
666 | * h["c"] = 4
|
---|
667 | * h #=> {"a"=>9, "b"=>200, "c"=>4}
|
---|
668 | *
|
---|
669 | */
|
---|
670 | static mrb_value
|
---|
671 | mrb_hash_aset(mrb_state *mrb, mrb_value self)
|
---|
672 | {
|
---|
673 | mrb_value key, val;
|
---|
674 |
|
---|
675 | mrb_get_args(mrb, "oo", &key, &val);
|
---|
676 | mrb_hash_set(mrb, self, key, val);
|
---|
677 | return val;
|
---|
678 | }
|
---|
679 |
|
---|
680 | /* 15.2.13.4.20 */
|
---|
681 | /* 15.2.13.4.25 */
|
---|
682 | /*
|
---|
683 | * call-seq:
|
---|
684 | * hsh.length -> fixnum
|
---|
685 | * hsh.size -> fixnum
|
---|
686 | *
|
---|
687 | * Returns the number of key-value pairs in the hash.
|
---|
688 | *
|
---|
689 | * h = { "d" => 100, "a" => 200, "v" => 300, "e" => 400 }
|
---|
690 | * h.length #=> 4
|
---|
691 | * h.delete("a") #=> 200
|
---|
692 | * h.length #=> 3
|
---|
693 | */
|
---|
694 | static mrb_value
|
---|
695 | mrb_hash_size_m(mrb_state *mrb, mrb_value self)
|
---|
696 | {
|
---|
697 | khash_t(ht) *h = RHASH_TBL(self);
|
---|
698 |
|
---|
699 | if (!h) return mrb_fixnum_value(0);
|
---|
700 | return mrb_fixnum_value(kh_size(h));
|
---|
701 | }
|
---|
702 |
|
---|
703 | /* 15.2.13.4.12 */
|
---|
704 | /*
|
---|
705 | * call-seq:
|
---|
706 | * hsh.empty? -> true or false
|
---|
707 | *
|
---|
708 | * Returns <code>true</code> if <i>hsh</i> contains no key-value pairs.
|
---|
709 | *
|
---|
710 | * {}.empty? #=> true
|
---|
711 | *
|
---|
712 | */
|
---|
713 | MRB_API mrb_value
|
---|
714 | mrb_hash_empty_p(mrb_state *mrb, mrb_value self)
|
---|
715 | {
|
---|
716 | khash_t(ht) *h = RHASH_TBL(self);
|
---|
717 |
|
---|
718 | if (h) return mrb_bool_value(kh_size(h) == 0);
|
---|
719 | return mrb_true_value();
|
---|
720 | }
|
---|
721 |
|
---|
722 | /* 15.2.13.4.29 (x)*/
|
---|
723 | /*
|
---|
724 | * call-seq:
|
---|
725 | * hsh.to_hash => hsh
|
---|
726 | *
|
---|
727 | * Returns +self+.
|
---|
728 | */
|
---|
729 |
|
---|
730 | static mrb_value
|
---|
731 | mrb_hash_to_hash(mrb_state *mrb, mrb_value hash)
|
---|
732 | {
|
---|
733 | return hash;
|
---|
734 | }
|
---|
735 |
|
---|
736 | /* 15.2.13.4.19 */
|
---|
737 | /*
|
---|
738 | * call-seq:
|
---|
739 | * hsh.keys -> array
|
---|
740 | *
|
---|
741 | * Returns a new array populated with the keys from this hash. See also
|
---|
742 | * <code>Hash#values</code>.
|
---|
743 | *
|
---|
744 | * h = { "a" => 100, "b" => 200, "c" => 300, "d" => 400 }
|
---|
745 | * h.keys #=> ["a", "b", "c", "d"]
|
---|
746 | *
|
---|
747 | */
|
---|
748 |
|
---|
749 | MRB_API mrb_value
|
---|
750 | mrb_hash_keys(mrb_state *mrb, mrb_value hash)
|
---|
751 | {
|
---|
752 | khash_t(ht) *h = RHASH_TBL(hash);
|
---|
753 | khiter_t k;
|
---|
754 | mrb_int end;
|
---|
755 | mrb_value ary;
|
---|
756 | mrb_value *p;
|
---|
757 |
|
---|
758 | if (!h || kh_size(h) == 0) return mrb_ary_new(mrb);
|
---|
759 | ary = mrb_ary_new_capa(mrb, kh_size(h));
|
---|
760 | end = kh_size(h)-1;
|
---|
761 | mrb_ary_set(mrb, ary, end, mrb_nil_value());
|
---|
762 | p = mrb_ary_ptr(ary)->ptr;
|
---|
763 | for (k = kh_begin(h); k != kh_end(h); k++) {
|
---|
764 | if (kh_exist(h, k)) {
|
---|
765 | mrb_value kv = kh_key(h, k);
|
---|
766 | mrb_hash_value hv = kh_value(h, k);
|
---|
767 |
|
---|
768 | if (hv.n <= end) {
|
---|
769 | p[hv.n] = kv;
|
---|
770 | }
|
---|
771 | else {
|
---|
772 | p[end] = kv;
|
---|
773 | }
|
---|
774 | }
|
---|
775 | }
|
---|
776 | return ary;
|
---|
777 | }
|
---|
778 |
|
---|
779 | /* 15.2.13.4.28 */
|
---|
780 | /*
|
---|
781 | * call-seq:
|
---|
782 | * hsh.values -> array
|
---|
783 | *
|
---|
784 | * Returns a new array populated with the values from <i>hsh</i>. See
|
---|
785 | * also <code>Hash#keys</code>.
|
---|
786 | *
|
---|
787 | * h = { "a" => 100, "b" => 200, "c" => 300 }
|
---|
788 | * h.values #=> [100, 200, 300]
|
---|
789 | *
|
---|
790 | */
|
---|
791 |
|
---|
792 | MRB_API mrb_value
|
---|
793 | mrb_hash_values(mrb_state *mrb, mrb_value hash)
|
---|
794 | {
|
---|
795 | khash_t(ht) *h = RHASH_TBL(hash);
|
---|
796 | khiter_t k;
|
---|
797 | mrb_value ary;
|
---|
798 |
|
---|
799 | if (!h) return mrb_ary_new(mrb);
|
---|
800 | ary = mrb_ary_new_capa(mrb, kh_size(h));
|
---|
801 | for (k = kh_begin(h); k != kh_end(h); k++) {
|
---|
802 | if (kh_exist(h, k)) {
|
---|
803 | mrb_hash_value hv = kh_value(h, k);
|
---|
804 |
|
---|
805 | mrb_ary_set(mrb, ary, hv.n, hv.v);
|
---|
806 | }
|
---|
807 | }
|
---|
808 | return ary;
|
---|
809 | }
|
---|
810 |
|
---|
811 | /* 15.2.13.4.13 */
|
---|
812 | /* 15.2.13.4.15 */
|
---|
813 | /* 15.2.13.4.18 */
|
---|
814 | /* 15.2.13.4.21 */
|
---|
815 | /*
|
---|
816 | * call-seq:
|
---|
817 | * hsh.has_key?(key) -> true or false
|
---|
818 | * hsh.include?(key) -> true or false
|
---|
819 | * hsh.key?(key) -> true or false
|
---|
820 | * hsh.member?(key) -> true or false
|
---|
821 | *
|
---|
822 | * Returns <code>true</code> if the given key is present in <i>hsh</i>.
|
---|
823 | *
|
---|
824 | * h = { "a" => 100, "b" => 200 }
|
---|
825 | * h.has_key?("a") #=> true
|
---|
826 | * h.has_key?("z") #=> false
|
---|
827 | *
|
---|
828 | */
|
---|
829 |
|
---|
830 | static mrb_value
|
---|
831 | mrb_hash_has_key(mrb_state *mrb, mrb_value hash)
|
---|
832 | {
|
---|
833 | mrb_value key;
|
---|
834 | khash_t(ht) *h;
|
---|
835 | khiter_t k;
|
---|
836 |
|
---|
837 | mrb_get_args(mrb, "o", &key);
|
---|
838 |
|
---|
839 | h = RHASH_TBL(hash);
|
---|
840 | if (h) {
|
---|
841 | k = kh_get(ht, mrb, h, key);
|
---|
842 | return mrb_bool_value(k != kh_end(h));
|
---|
843 | }
|
---|
844 | return mrb_false_value();
|
---|
845 | }
|
---|
846 |
|
---|
847 | /* 15.2.13.4.14 */
|
---|
848 | /* 15.2.13.4.27 */
|
---|
849 | /*
|
---|
850 | * call-seq:
|
---|
851 | * hsh.has_value?(value) -> true or false
|
---|
852 | * hsh.value?(value) -> true or false
|
---|
853 | *
|
---|
854 | * Returns <code>true</code> if the given value is present for some key
|
---|
855 | * in <i>hsh</i>.
|
---|
856 | *
|
---|
857 | * h = { "a" => 100, "b" => 200 }
|
---|
858 | * h.has_value?(100) #=> true
|
---|
859 | * h.has_value?(999) #=> false
|
---|
860 | */
|
---|
861 |
|
---|
862 | static mrb_value
|
---|
863 | mrb_hash_has_value(mrb_state *mrb, mrb_value hash)
|
---|
864 | {
|
---|
865 | mrb_value val;
|
---|
866 | khash_t(ht) *h;
|
---|
867 | khiter_t k;
|
---|
868 |
|
---|
869 | mrb_get_args(mrb, "o", &val);
|
---|
870 | h = RHASH_TBL(hash);
|
---|
871 |
|
---|
872 | if (h) {
|
---|
873 | for (k = kh_begin(h); k != kh_end(h); k++) {
|
---|
874 | if (!kh_exist(h, k)) continue;
|
---|
875 |
|
---|
876 | if (mrb_equal(mrb, kh_value(h, k).v, val)) {
|
---|
877 | return mrb_true_value();
|
---|
878 | }
|
---|
879 | }
|
---|
880 | }
|
---|
881 | return mrb_false_value();
|
---|
882 | }
|
---|
883 |
|
---|
884 | void
|
---|
885 | mrb_init_hash(mrb_state *mrb)
|
---|
886 | {
|
---|
887 | struct RClass *h;
|
---|
888 |
|
---|
889 | mrb->hash_class = h = mrb_define_class(mrb, "Hash", mrb->object_class); /* 15.2.13 */
|
---|
890 | MRB_SET_INSTANCE_TT(h, MRB_TT_HASH);
|
---|
891 |
|
---|
892 | mrb_define_method(mrb, h, "[]", mrb_hash_aget, MRB_ARGS_REQ(1)); /* 15.2.13.4.2 */
|
---|
893 | mrb_define_method(mrb, h, "[]=", mrb_hash_aset, MRB_ARGS_REQ(2)); /* 15.2.13.4.3 */
|
---|
894 | mrb_define_method(mrb, h, "clear", mrb_hash_clear, MRB_ARGS_NONE()); /* 15.2.13.4.4 */
|
---|
895 | mrb_define_method(mrb, h, "default", mrb_hash_default, MRB_ARGS_ANY()); /* 15.2.13.4.5 */
|
---|
896 | mrb_define_method(mrb, h, "default=", mrb_hash_set_default, MRB_ARGS_REQ(1)); /* 15.2.13.4.6 */
|
---|
897 | mrb_define_method(mrb, h, "default_proc", mrb_hash_default_proc,MRB_ARGS_NONE()); /* 15.2.13.4.7 */
|
---|
898 | mrb_define_method(mrb, h, "default_proc=", mrb_hash_set_default_proc,MRB_ARGS_REQ(1)); /* 15.2.13.4.7 */
|
---|
899 | mrb_define_method(mrb, h, "__delete", mrb_hash_delete, MRB_ARGS_REQ(1)); /* core of 15.2.13.4.8 */
|
---|
900 | mrb_define_method(mrb, h, "empty?", mrb_hash_empty_p, MRB_ARGS_NONE()); /* 15.2.13.4.12 */
|
---|
901 | mrb_define_method(mrb, h, "has_key?", mrb_hash_has_key, MRB_ARGS_REQ(1)); /* 15.2.13.4.13 */
|
---|
902 | mrb_define_method(mrb, h, "has_value?", mrb_hash_has_value, MRB_ARGS_REQ(1)); /* 15.2.13.4.14 */
|
---|
903 | mrb_define_method(mrb, h, "include?", mrb_hash_has_key, MRB_ARGS_REQ(1)); /* 15.2.13.4.15 */
|
---|
904 | mrb_define_method(mrb, h, "initialize", mrb_hash_init, MRB_ARGS_OPT(1)); /* 15.2.13.4.16 */
|
---|
905 | mrb_define_method(mrb, h, "key?", mrb_hash_has_key, MRB_ARGS_REQ(1)); /* 15.2.13.4.18 */
|
---|
906 | mrb_define_method(mrb, h, "keys", mrb_hash_keys, MRB_ARGS_NONE()); /* 15.2.13.4.19 */
|
---|
907 | mrb_define_method(mrb, h, "length", mrb_hash_size_m, MRB_ARGS_NONE()); /* 15.2.13.4.20 */
|
---|
908 | mrb_define_method(mrb, h, "member?", mrb_hash_has_key, MRB_ARGS_REQ(1)); /* 15.2.13.4.21 */
|
---|
909 | mrb_define_method(mrb, h, "shift", mrb_hash_shift, MRB_ARGS_NONE()); /* 15.2.13.4.24 */
|
---|
910 | mrb_define_method(mrb, h, "dup", mrb_hash_dup, MRB_ARGS_NONE());
|
---|
911 | mrb_define_method(mrb, h, "size", mrb_hash_size_m, MRB_ARGS_NONE()); /* 15.2.13.4.25 */
|
---|
912 | mrb_define_method(mrb, h, "store", mrb_hash_aset, MRB_ARGS_REQ(2)); /* 15.2.13.4.26 */
|
---|
913 | mrb_define_method(mrb, h, "value?", mrb_hash_has_value, MRB_ARGS_REQ(1)); /* 15.2.13.4.27 */
|
---|
914 | mrb_define_method(mrb, h, "values", mrb_hash_values, MRB_ARGS_NONE()); /* 15.2.13.4.28 */
|
---|
915 |
|
---|
916 | mrb_define_method(mrb, h, "to_hash", mrb_hash_to_hash, MRB_ARGS_NONE()); /* 15.2.13.4.29 (x)*/
|
---|
917 | }
|
---|