1*8e3b1ab2SBaptiste Daroussin /* The MIT License
2*8e3b1ab2SBaptiste Daroussin
3*8e3b1ab2SBaptiste Daroussin Copyright (c) 2008, 2009, 2011 by Attractive Chaos <attractor@live.co.uk>
4*8e3b1ab2SBaptiste Daroussin
5*8e3b1ab2SBaptiste Daroussin Permission is hereby granted, free of charge, to any person obtaining
6*8e3b1ab2SBaptiste Daroussin a copy of this software and associated documentation files (the
7*8e3b1ab2SBaptiste Daroussin "Software"), to deal in the Software without restriction, including
8*8e3b1ab2SBaptiste Daroussin without limitation the rights to use, copy, modify, merge, publish,
9*8e3b1ab2SBaptiste Daroussin distribute, sublicense, and/or sell copies of the Software, and to
10*8e3b1ab2SBaptiste Daroussin permit persons to whom the Software is furnished to do so, subject to
11*8e3b1ab2SBaptiste Daroussin the following conditions:
12*8e3b1ab2SBaptiste Daroussin
13*8e3b1ab2SBaptiste Daroussin The above copyright notice and this permission notice shall be
14*8e3b1ab2SBaptiste Daroussin included in all copies or substantial portions of the Software.
15*8e3b1ab2SBaptiste Daroussin
16*8e3b1ab2SBaptiste Daroussin THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
17*8e3b1ab2SBaptiste Daroussin EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
18*8e3b1ab2SBaptiste Daroussin MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
19*8e3b1ab2SBaptiste Daroussin NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
20*8e3b1ab2SBaptiste Daroussin BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
21*8e3b1ab2SBaptiste Daroussin ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
22*8e3b1ab2SBaptiste Daroussin CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
23*8e3b1ab2SBaptiste Daroussin SOFTWARE.
24*8e3b1ab2SBaptiste Daroussin */
25*8e3b1ab2SBaptiste Daroussin
26*8e3b1ab2SBaptiste Daroussin /*
27*8e3b1ab2SBaptiste Daroussin An example:
28*8e3b1ab2SBaptiste Daroussin
29*8e3b1ab2SBaptiste Daroussin #include "khash.h"
30*8e3b1ab2SBaptiste Daroussin KHASH_MAP_INIT_INT(32, char)
31*8e3b1ab2SBaptiste Daroussin int main() {
32*8e3b1ab2SBaptiste Daroussin int ret, is_missing;
33*8e3b1ab2SBaptiste Daroussin khiter_t k;
34*8e3b1ab2SBaptiste Daroussin khash_t(32) *h = kh_init(32);
35*8e3b1ab2SBaptiste Daroussin k = kh_put(32, h, 5, &ret);
36*8e3b1ab2SBaptiste Daroussin kh_value(h, k) = 10;
37*8e3b1ab2SBaptiste Daroussin k = kh_get(32, h, 10);
38*8e3b1ab2SBaptiste Daroussin is_missing = (k == kh_end(h));
39*8e3b1ab2SBaptiste Daroussin k = kh_get(32, h, 5);
40*8e3b1ab2SBaptiste Daroussin kh_del(32, h, k);
41*8e3b1ab2SBaptiste Daroussin for (k = kh_begin(h); k != kh_end(h); ++k)
42*8e3b1ab2SBaptiste Daroussin if (kh_exist(h, k)) kh_value(h, k) = 1;
43*8e3b1ab2SBaptiste Daroussin kh_destroy(32, h);
44*8e3b1ab2SBaptiste Daroussin return 0;
45*8e3b1ab2SBaptiste Daroussin }
46*8e3b1ab2SBaptiste Daroussin */
47*8e3b1ab2SBaptiste Daroussin
48*8e3b1ab2SBaptiste Daroussin /*
49*8e3b1ab2SBaptiste Daroussin 2013-05-02 (0.2.8):
50*8e3b1ab2SBaptiste Daroussin
51*8e3b1ab2SBaptiste Daroussin * Use quadratic probing. When the capacity is power of 2, stepping function
52*8e3b1ab2SBaptiste Daroussin i*(i+1)/2 guarantees to traverse each bucket. It is better than double
53*8e3b1ab2SBaptiste Daroussin hashing on cache performance and is more robust than linear probing.
54*8e3b1ab2SBaptiste Daroussin
55*8e3b1ab2SBaptiste Daroussin In theory, double hashing should be more robust than quadratic probing.
56*8e3b1ab2SBaptiste Daroussin However, my implementation is probably not for large hash tables, because
57*8e3b1ab2SBaptiste Daroussin the second hash function is closely tied to the first hash function,
58*8e3b1ab2SBaptiste Daroussin which reduce the effectiveness of double hashing.
59*8e3b1ab2SBaptiste Daroussin
60*8e3b1ab2SBaptiste Daroussin Reference: http://research.cs.vt.edu/AVresearch/hashing/quadratic.php
61*8e3b1ab2SBaptiste Daroussin
62*8e3b1ab2SBaptiste Daroussin 2011-12-29 (0.2.7):
63*8e3b1ab2SBaptiste Daroussin
64*8e3b1ab2SBaptiste Daroussin * Minor code clean up; no actual effect.
65*8e3b1ab2SBaptiste Daroussin
66*8e3b1ab2SBaptiste Daroussin 2011-09-16 (0.2.6):
67*8e3b1ab2SBaptiste Daroussin
68*8e3b1ab2SBaptiste Daroussin * The capacity is a power of 2. This seems to dramatically improve the
69*8e3b1ab2SBaptiste Daroussin speed for simple keys. Thank Zilong Tan for the suggestion. Reference:
70*8e3b1ab2SBaptiste Daroussin
71*8e3b1ab2SBaptiste Daroussin - http://code.google.com/p/ulib/
72*8e3b1ab2SBaptiste Daroussin - http://nothings.org/computer/judy/
73*8e3b1ab2SBaptiste Daroussin
74*8e3b1ab2SBaptiste Daroussin * Allow to optionally use linear probing which usually has better
75*8e3b1ab2SBaptiste Daroussin performance for random input. Double hashing is still the default as it
76*8e3b1ab2SBaptiste Daroussin is more robust to certain non-random input.
77*8e3b1ab2SBaptiste Daroussin
78*8e3b1ab2SBaptiste Daroussin * Added Wang's integer hash function (not used by default). This hash
79*8e3b1ab2SBaptiste Daroussin function is more robust to certain non-random input.
80*8e3b1ab2SBaptiste Daroussin
81*8e3b1ab2SBaptiste Daroussin 2011-02-14 (0.2.5):
82*8e3b1ab2SBaptiste Daroussin
83*8e3b1ab2SBaptiste Daroussin * Allow to declare global functions.
84*8e3b1ab2SBaptiste Daroussin
85*8e3b1ab2SBaptiste Daroussin 2009-09-26 (0.2.4):
86*8e3b1ab2SBaptiste Daroussin
87*8e3b1ab2SBaptiste Daroussin * Improve portability
88*8e3b1ab2SBaptiste Daroussin
89*8e3b1ab2SBaptiste Daroussin 2008-09-19 (0.2.3):
90*8e3b1ab2SBaptiste Daroussin
91*8e3b1ab2SBaptiste Daroussin * Corrected the example
92*8e3b1ab2SBaptiste Daroussin * Improved interfaces
93*8e3b1ab2SBaptiste Daroussin
94*8e3b1ab2SBaptiste Daroussin 2008-09-11 (0.2.2):
95*8e3b1ab2SBaptiste Daroussin
96*8e3b1ab2SBaptiste Daroussin * Improved speed a little in kh_put()
97*8e3b1ab2SBaptiste Daroussin
98*8e3b1ab2SBaptiste Daroussin 2008-09-10 (0.2.1):
99*8e3b1ab2SBaptiste Daroussin
100*8e3b1ab2SBaptiste Daroussin * Added kh_clear()
101*8e3b1ab2SBaptiste Daroussin * Fixed a compiling error
102*8e3b1ab2SBaptiste Daroussin
103*8e3b1ab2SBaptiste Daroussin 2008-09-02 (0.2.0):
104*8e3b1ab2SBaptiste Daroussin
105*8e3b1ab2SBaptiste Daroussin * Changed to token concatenation which increases flexibility.
106*8e3b1ab2SBaptiste Daroussin
107*8e3b1ab2SBaptiste Daroussin 2008-08-31 (0.1.2):
108*8e3b1ab2SBaptiste Daroussin
109*8e3b1ab2SBaptiste Daroussin * Fixed a bug in kh_get(), which has not been tested previously.
110*8e3b1ab2SBaptiste Daroussin
111*8e3b1ab2SBaptiste Daroussin 2008-08-31 (0.1.1):
112*8e3b1ab2SBaptiste Daroussin
113*8e3b1ab2SBaptiste Daroussin * Added destructor
114*8e3b1ab2SBaptiste Daroussin */
115*8e3b1ab2SBaptiste Daroussin
116*8e3b1ab2SBaptiste Daroussin
117*8e3b1ab2SBaptiste Daroussin #ifndef __AC_KHASH_H
118*8e3b1ab2SBaptiste Daroussin #define __AC_KHASH_H
119*8e3b1ab2SBaptiste Daroussin
120*8e3b1ab2SBaptiste Daroussin /*!
121*8e3b1ab2SBaptiste Daroussin @header
122*8e3b1ab2SBaptiste Daroussin
123*8e3b1ab2SBaptiste Daroussin Generic hash table library.
124*8e3b1ab2SBaptiste Daroussin */
125*8e3b1ab2SBaptiste Daroussin
126*8e3b1ab2SBaptiste Daroussin #define AC_VERSION_KHASH_H "0.2.8"
127*8e3b1ab2SBaptiste Daroussin
128*8e3b1ab2SBaptiste Daroussin #include <stdlib.h>
129*8e3b1ab2SBaptiste Daroussin #include <string.h>
130*8e3b1ab2SBaptiste Daroussin #include <limits.h>
131*8e3b1ab2SBaptiste Daroussin
132*8e3b1ab2SBaptiste Daroussin /* compiler specific configuration */
133*8e3b1ab2SBaptiste Daroussin
134*8e3b1ab2SBaptiste Daroussin #if UINT_MAX == 0xffffffffu
135*8e3b1ab2SBaptiste Daroussin typedef unsigned int khint32_t;
136*8e3b1ab2SBaptiste Daroussin #elif ULONG_MAX == 0xffffffffu
137*8e3b1ab2SBaptiste Daroussin typedef unsigned long khint32_t;
138*8e3b1ab2SBaptiste Daroussin #endif
139*8e3b1ab2SBaptiste Daroussin
140*8e3b1ab2SBaptiste Daroussin #if ULONG_MAX == ULLONG_MAX
141*8e3b1ab2SBaptiste Daroussin typedef unsigned long khint64_t;
142*8e3b1ab2SBaptiste Daroussin #else
143*8e3b1ab2SBaptiste Daroussin typedef unsigned long long khint64_t;
144*8e3b1ab2SBaptiste Daroussin #endif
145*8e3b1ab2SBaptiste Daroussin
146*8e3b1ab2SBaptiste Daroussin #ifndef kh_inline
147*8e3b1ab2SBaptiste Daroussin #ifdef _MSC_VER
148*8e3b1ab2SBaptiste Daroussin #define kh_inline __inline
149*8e3b1ab2SBaptiste Daroussin #else
150*8e3b1ab2SBaptiste Daroussin #define kh_inline inline
151*8e3b1ab2SBaptiste Daroussin #endif
152*8e3b1ab2SBaptiste Daroussin #endif /* kh_inline */
153*8e3b1ab2SBaptiste Daroussin
154*8e3b1ab2SBaptiste Daroussin #ifndef kh_unused
155*8e3b1ab2SBaptiste Daroussin # ifdef __GNUC__
156*8e3b1ab2SBaptiste Daroussin # define kh_unused(x) __attribute__((__unused__)) x
157*8e3b1ab2SBaptiste Daroussin # else
158*8e3b1ab2SBaptiste Daroussin # define kh_unused(x) x
159*8e3b1ab2SBaptiste Daroussin # endif
160*8e3b1ab2SBaptiste Daroussin #endif
161*8e3b1ab2SBaptiste Daroussin
162*8e3b1ab2SBaptiste Daroussin typedef khint32_t khint_t;
163*8e3b1ab2SBaptiste Daroussin typedef khint_t khiter_t;
164*8e3b1ab2SBaptiste Daroussin
165*8e3b1ab2SBaptiste Daroussin #define __ac_isempty(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&2)
166*8e3b1ab2SBaptiste Daroussin #define __ac_isdel(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&1)
167*8e3b1ab2SBaptiste Daroussin #define __ac_iseither(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&3)
168*8e3b1ab2SBaptiste Daroussin #define __ac_set_isdel_false(flag, i) (flag[i>>4]&=~(1ul<<((i&0xfU)<<1)))
169*8e3b1ab2SBaptiste Daroussin #define __ac_set_isempty_false(flag, i) (flag[i>>4]&=~(2ul<<((i&0xfU)<<1)))
170*8e3b1ab2SBaptiste Daroussin #define __ac_set_isboth_false(flag, i) (flag[i>>4]&=~(3ul<<((i&0xfU)<<1)))
171*8e3b1ab2SBaptiste Daroussin #define __ac_set_isdel_true(flag, i) (flag[i>>4]|=1ul<<((i&0xfU)<<1))
172*8e3b1ab2SBaptiste Daroussin
173*8e3b1ab2SBaptiste Daroussin #define __ac_fsize(m) ((m) < 16? 1 : (m)>>4)
174*8e3b1ab2SBaptiste Daroussin
175*8e3b1ab2SBaptiste Daroussin #ifndef kroundup32
176*8e3b1ab2SBaptiste Daroussin #define kroundup32(x) (--(x), (x)|=(x)>>1, (x)|=(x)>>2, (x)|=(x)>>4, (x)|=(x)>>8, (x)|=(x)>>16, ++(x))
177*8e3b1ab2SBaptiste Daroussin #endif
178*8e3b1ab2SBaptiste Daroussin
179*8e3b1ab2SBaptiste Daroussin #ifndef kcalloc
180*8e3b1ab2SBaptiste Daroussin #define kcalloc(N,Z) calloc(N,Z)
181*8e3b1ab2SBaptiste Daroussin #endif
182*8e3b1ab2SBaptiste Daroussin #ifndef kmalloc
183*8e3b1ab2SBaptiste Daroussin #define kmalloc(Z) malloc(Z)
184*8e3b1ab2SBaptiste Daroussin #endif
185*8e3b1ab2SBaptiste Daroussin #ifndef krealloc
186*8e3b1ab2SBaptiste Daroussin #define krealloc(P,Z) realloc(P,Z)
187*8e3b1ab2SBaptiste Daroussin #endif
188*8e3b1ab2SBaptiste Daroussin #ifndef kfree
189*8e3b1ab2SBaptiste Daroussin #define kfree(P) free(P)
190*8e3b1ab2SBaptiste Daroussin #endif
191*8e3b1ab2SBaptiste Daroussin
192*8e3b1ab2SBaptiste Daroussin static const double __ac_HASH_UPPER = 0.77;
193*8e3b1ab2SBaptiste Daroussin
194*8e3b1ab2SBaptiste Daroussin #define __KHASH_TYPE(name, khkey_t, khval_t) \
195*8e3b1ab2SBaptiste Daroussin typedef struct kh_##name##_s { \
196*8e3b1ab2SBaptiste Daroussin khint_t n_buckets, size, n_occupied, upper_bound; \
197*8e3b1ab2SBaptiste Daroussin khint32_t *flags; \
198*8e3b1ab2SBaptiste Daroussin khkey_t *keys; \
199*8e3b1ab2SBaptiste Daroussin khval_t *vals; \
200*8e3b1ab2SBaptiste Daroussin } kh_##name##_t;
201*8e3b1ab2SBaptiste Daroussin
202*8e3b1ab2SBaptiste Daroussin #define __KHASH_PROTOTYPES(name, khkey_t, khval_t) \
203*8e3b1ab2SBaptiste Daroussin extern kh_##name##_t * kh_init_##name(void); \
204*8e3b1ab2SBaptiste Daroussin extern void kh_destroy_##name(kh_##name##_t *h); \
205*8e3b1ab2SBaptiste Daroussin extern void kh_clear_##name(kh_##name##_t *h); \
206*8e3b1ab2SBaptiste Daroussin extern khint_t kh_get_##name(const kh_##name##_t *h, khkey_t key); \
207*8e3b1ab2SBaptiste Daroussin extern int kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets); \
208*8e3b1ab2SBaptiste Daroussin extern khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret); \
209*8e3b1ab2SBaptiste Daroussin extern void kh_del_##name(kh_##name##_t *h, khint_t x);
210*8e3b1ab2SBaptiste Daroussin
211*8e3b1ab2SBaptiste Daroussin #define __KHASH_IMPL(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
212*8e3b1ab2SBaptiste Daroussin SCOPE kh_##name##_t *kh_init_##name(void) { \
213*8e3b1ab2SBaptiste Daroussin return (kh_##name##_t*)kcalloc(1, sizeof(kh_##name##_t)); \
214*8e3b1ab2SBaptiste Daroussin } \
215*8e3b1ab2SBaptiste Daroussin SCOPE void kh_destroy_##name(kh_##name##_t *h) \
216*8e3b1ab2SBaptiste Daroussin { \
217*8e3b1ab2SBaptiste Daroussin if (h) { \
218*8e3b1ab2SBaptiste Daroussin kfree((void *)h->keys); kfree(h->flags); \
219*8e3b1ab2SBaptiste Daroussin kfree((void *)h->vals); \
220*8e3b1ab2SBaptiste Daroussin kfree(h); \
221*8e3b1ab2SBaptiste Daroussin } \
222*8e3b1ab2SBaptiste Daroussin } \
223*8e3b1ab2SBaptiste Daroussin SCOPE void kh_unused(kh_clear_##name)(kh_##name##_t *h) \
224*8e3b1ab2SBaptiste Daroussin { \
225*8e3b1ab2SBaptiste Daroussin if (h && h->flags) { \
226*8e3b1ab2SBaptiste Daroussin memset(h->flags, 0xaa, __ac_fsize(h->n_buckets) * sizeof(khint32_t)); \
227*8e3b1ab2SBaptiste Daroussin h->size = h->n_occupied = 0; \
228*8e3b1ab2SBaptiste Daroussin } \
229*8e3b1ab2SBaptiste Daroussin } \
230*8e3b1ab2SBaptiste Daroussin SCOPE khint_t kh_get_##name(const kh_##name##_t *h, khkey_t key) \
231*8e3b1ab2SBaptiste Daroussin { \
232*8e3b1ab2SBaptiste Daroussin if (h->n_buckets) { \
233*8e3b1ab2SBaptiste Daroussin khint_t k, i, last, mask, step = 0; \
234*8e3b1ab2SBaptiste Daroussin mask = h->n_buckets - 1; \
235*8e3b1ab2SBaptiste Daroussin k = __hash_func(key); i = k & mask; \
236*8e3b1ab2SBaptiste Daroussin last = i; \
237*8e3b1ab2SBaptiste Daroussin while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \
238*8e3b1ab2SBaptiste Daroussin i = (i + (++step)) & mask; \
239*8e3b1ab2SBaptiste Daroussin if (i == last) return h->n_buckets; \
240*8e3b1ab2SBaptiste Daroussin } \
241*8e3b1ab2SBaptiste Daroussin return __ac_iseither(h->flags, i)? h->n_buckets : i; \
242*8e3b1ab2SBaptiste Daroussin } else return 0; \
243*8e3b1ab2SBaptiste Daroussin } \
244*8e3b1ab2SBaptiste Daroussin SCOPE int kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets) \
245*8e3b1ab2SBaptiste Daroussin { /* This function uses 0.25*n_buckets bytes of working space instead of [sizeof(key_t+val_t)+.25]*n_buckets. */ \
246*8e3b1ab2SBaptiste Daroussin khint32_t *new_flags = 0; \
247*8e3b1ab2SBaptiste Daroussin khint_t j = 1; \
248*8e3b1ab2SBaptiste Daroussin { \
249*8e3b1ab2SBaptiste Daroussin kroundup32(new_n_buckets); \
250*8e3b1ab2SBaptiste Daroussin if (new_n_buckets < 4) new_n_buckets = 4; \
251*8e3b1ab2SBaptiste Daroussin if (h->size >= (khint_t)(new_n_buckets * __ac_HASH_UPPER + 0.5)) j = 0; /* requested size is too small */ \
252*8e3b1ab2SBaptiste Daroussin else { /* hash table size to be changed (shrink or expand); rehash */ \
253*8e3b1ab2SBaptiste Daroussin new_flags = (khint32_t*)kmalloc(__ac_fsize(new_n_buckets) * sizeof(khint32_t)); \
254*8e3b1ab2SBaptiste Daroussin if (!new_flags) return -1; \
255*8e3b1ab2SBaptiste Daroussin memset(new_flags, 0xaa, __ac_fsize(new_n_buckets) * sizeof(khint32_t)); \
256*8e3b1ab2SBaptiste Daroussin if (h->n_buckets < new_n_buckets) { /* expand */ \
257*8e3b1ab2SBaptiste Daroussin khkey_t *new_keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
258*8e3b1ab2SBaptiste Daroussin if (!new_keys) { kfree(new_flags); return -1; } \
259*8e3b1ab2SBaptiste Daroussin h->keys = new_keys; \
260*8e3b1ab2SBaptiste Daroussin if (kh_is_map) { \
261*8e3b1ab2SBaptiste Daroussin khval_t *new_vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
262*8e3b1ab2SBaptiste Daroussin if (!new_vals) { kfree(new_flags); return -1; } \
263*8e3b1ab2SBaptiste Daroussin h->vals = new_vals; \
264*8e3b1ab2SBaptiste Daroussin } \
265*8e3b1ab2SBaptiste Daroussin } /* otherwise shrink */ \
266*8e3b1ab2SBaptiste Daroussin } \
267*8e3b1ab2SBaptiste Daroussin } \
268*8e3b1ab2SBaptiste Daroussin if (j) { /* rehashing is needed */ \
269*8e3b1ab2SBaptiste Daroussin for (j = 0; j != h->n_buckets; ++j) { \
270*8e3b1ab2SBaptiste Daroussin if (__ac_iseither(h->flags, j) == 0) { \
271*8e3b1ab2SBaptiste Daroussin khkey_t key = h->keys[j]; \
272*8e3b1ab2SBaptiste Daroussin khval_t val; \
273*8e3b1ab2SBaptiste Daroussin khint_t new_mask; \
274*8e3b1ab2SBaptiste Daroussin new_mask = new_n_buckets - 1; \
275*8e3b1ab2SBaptiste Daroussin if (kh_is_map) val = h->vals[j]; \
276*8e3b1ab2SBaptiste Daroussin __ac_set_isdel_true(h->flags, j); \
277*8e3b1ab2SBaptiste Daroussin while (1) { /* kick-out process; sort of like in Cuckoo hashing */ \
278*8e3b1ab2SBaptiste Daroussin khint_t k, i, step = 0; \
279*8e3b1ab2SBaptiste Daroussin k = __hash_func(key); \
280*8e3b1ab2SBaptiste Daroussin i = k & new_mask; \
281*8e3b1ab2SBaptiste Daroussin while (!__ac_isempty(new_flags, i)) i = (i + (++step)) & new_mask; \
282*8e3b1ab2SBaptiste Daroussin __ac_set_isempty_false(new_flags, i); \
283*8e3b1ab2SBaptiste Daroussin if (i < h->n_buckets && __ac_iseither(h->flags, i) == 0) { /* kick out the existing element */ \
284*8e3b1ab2SBaptiste Daroussin { khkey_t tmp = h->keys[i]; h->keys[i] = key; key = tmp; } \
285*8e3b1ab2SBaptiste Daroussin if (kh_is_map) { khval_t tmp = h->vals[i]; h->vals[i] = val; val = tmp; } \
286*8e3b1ab2SBaptiste Daroussin __ac_set_isdel_true(h->flags, i); /* mark it as deleted in the old hash table */ \
287*8e3b1ab2SBaptiste Daroussin } else { /* write the element and jump out of the loop */ \
288*8e3b1ab2SBaptiste Daroussin h->keys[i] = key; \
289*8e3b1ab2SBaptiste Daroussin if (kh_is_map) h->vals[i] = val; \
290*8e3b1ab2SBaptiste Daroussin break; \
291*8e3b1ab2SBaptiste Daroussin } \
292*8e3b1ab2SBaptiste Daroussin } \
293*8e3b1ab2SBaptiste Daroussin } \
294*8e3b1ab2SBaptiste Daroussin } \
295*8e3b1ab2SBaptiste Daroussin if (h->n_buckets > new_n_buckets) { /* shrink the hash table */ \
296*8e3b1ab2SBaptiste Daroussin h->keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
297*8e3b1ab2SBaptiste Daroussin if (kh_is_map) h->vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
298*8e3b1ab2SBaptiste Daroussin } \
299*8e3b1ab2SBaptiste Daroussin kfree(h->flags); /* free the working space */ \
300*8e3b1ab2SBaptiste Daroussin h->flags = new_flags; \
301*8e3b1ab2SBaptiste Daroussin h->n_buckets = new_n_buckets; \
302*8e3b1ab2SBaptiste Daroussin h->n_occupied = h->size; \
303*8e3b1ab2SBaptiste Daroussin h->upper_bound = (khint_t)(h->n_buckets * __ac_HASH_UPPER + 0.5); \
304*8e3b1ab2SBaptiste Daroussin } \
305*8e3b1ab2SBaptiste Daroussin return 0; \
306*8e3b1ab2SBaptiste Daroussin } \
307*8e3b1ab2SBaptiste Daroussin SCOPE khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret) \
308*8e3b1ab2SBaptiste Daroussin { \
309*8e3b1ab2SBaptiste Daroussin khint_t x; \
310*8e3b1ab2SBaptiste Daroussin if (h->n_occupied >= h->upper_bound) { /* update the hash table */ \
311*8e3b1ab2SBaptiste Daroussin if (h->n_buckets > (h->size<<1)) { \
312*8e3b1ab2SBaptiste Daroussin if (kh_resize_##name(h, h->n_buckets - 1) < 0) { /* clear "deleted" elements */ \
313*8e3b1ab2SBaptiste Daroussin *ret = -1; return h->n_buckets; \
314*8e3b1ab2SBaptiste Daroussin } \
315*8e3b1ab2SBaptiste Daroussin } else if (kh_resize_##name(h, h->n_buckets + 1) < 0) { /* expand the hash table */ \
316*8e3b1ab2SBaptiste Daroussin *ret = -1; return h->n_buckets; \
317*8e3b1ab2SBaptiste Daroussin } \
318*8e3b1ab2SBaptiste Daroussin } /* TODO: to implement automatically shrinking; resize() already support shrinking */ \
319*8e3b1ab2SBaptiste Daroussin { \
320*8e3b1ab2SBaptiste Daroussin khint_t k, i, site, last, mask = h->n_buckets - 1, step = 0; \
321*8e3b1ab2SBaptiste Daroussin x = site = h->n_buckets; k = __hash_func(key); i = k & mask; \
322*8e3b1ab2SBaptiste Daroussin if (__ac_isempty(h->flags, i)) x = i; /* for speed up */ \
323*8e3b1ab2SBaptiste Daroussin else { \
324*8e3b1ab2SBaptiste Daroussin last = i; \
325*8e3b1ab2SBaptiste Daroussin while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \
326*8e3b1ab2SBaptiste Daroussin if (__ac_isdel(h->flags, i)) site = i; \
327*8e3b1ab2SBaptiste Daroussin i = (i + (++step)) & mask; \
328*8e3b1ab2SBaptiste Daroussin if (i == last) { x = site; break; } \
329*8e3b1ab2SBaptiste Daroussin } \
330*8e3b1ab2SBaptiste Daroussin if (x == h->n_buckets) { \
331*8e3b1ab2SBaptiste Daroussin if (__ac_isempty(h->flags, i) && site != h->n_buckets) x = site; \
332*8e3b1ab2SBaptiste Daroussin else x = i; \
333*8e3b1ab2SBaptiste Daroussin } \
334*8e3b1ab2SBaptiste Daroussin } \
335*8e3b1ab2SBaptiste Daroussin } \
336*8e3b1ab2SBaptiste Daroussin if (__ac_isempty(h->flags, x)) { /* not present at all */ \
337*8e3b1ab2SBaptiste Daroussin h->keys[x] = key; \
338*8e3b1ab2SBaptiste Daroussin __ac_set_isboth_false(h->flags, x); \
339*8e3b1ab2SBaptiste Daroussin ++h->size; ++h->n_occupied; \
340*8e3b1ab2SBaptiste Daroussin *ret = 1; \
341*8e3b1ab2SBaptiste Daroussin } else if (__ac_isdel(h->flags, x)) { /* deleted */ \
342*8e3b1ab2SBaptiste Daroussin h->keys[x] = key; \
343*8e3b1ab2SBaptiste Daroussin __ac_set_isboth_false(h->flags, x); \
344*8e3b1ab2SBaptiste Daroussin ++h->size; \
345*8e3b1ab2SBaptiste Daroussin *ret = 2; \
346*8e3b1ab2SBaptiste Daroussin } else *ret = 0; /* Don't touch h->keys[x] if present and not deleted */ \
347*8e3b1ab2SBaptiste Daroussin return x; \
348*8e3b1ab2SBaptiste Daroussin } \
349*8e3b1ab2SBaptiste Daroussin SCOPE void kh_del_##name(kh_##name##_t *h, khint_t x) \
350*8e3b1ab2SBaptiste Daroussin { \
351*8e3b1ab2SBaptiste Daroussin if (x != h->n_buckets && !__ac_iseither(h->flags, x)) { \
352*8e3b1ab2SBaptiste Daroussin __ac_set_isdel_true(h->flags, x); \
353*8e3b1ab2SBaptiste Daroussin --h->size; \
354*8e3b1ab2SBaptiste Daroussin } \
355*8e3b1ab2SBaptiste Daroussin }
356*8e3b1ab2SBaptiste Daroussin
357*8e3b1ab2SBaptiste Daroussin #define KHASH_DECLARE(name, khkey_t, khval_t) \
358*8e3b1ab2SBaptiste Daroussin __KHASH_TYPE(name, khkey_t, khval_t) \
359*8e3b1ab2SBaptiste Daroussin __KHASH_PROTOTYPES(name, khkey_t, khval_t)
360*8e3b1ab2SBaptiste Daroussin
361*8e3b1ab2SBaptiste Daroussin #define KHASH_INIT2(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
362*8e3b1ab2SBaptiste Daroussin __KHASH_TYPE(name, khkey_t, khval_t) \
363*8e3b1ab2SBaptiste Daroussin __KHASH_IMPL(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal)
364*8e3b1ab2SBaptiste Daroussin
365*8e3b1ab2SBaptiste Daroussin #define KHASH_INIT(name, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
366*8e3b1ab2SBaptiste Daroussin KHASH_INIT2(name, static kh_inline, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal)
367*8e3b1ab2SBaptiste Daroussin
368*8e3b1ab2SBaptiste Daroussin /* --- BEGIN OF HASH FUNCTIONS --- */
369*8e3b1ab2SBaptiste Daroussin
370*8e3b1ab2SBaptiste Daroussin /*! @function
371*8e3b1ab2SBaptiste Daroussin @abstract Integer hash function
372*8e3b1ab2SBaptiste Daroussin @param key The integer [khint32_t]
373*8e3b1ab2SBaptiste Daroussin @return The hash value [khint_t]
374*8e3b1ab2SBaptiste Daroussin */
375*8e3b1ab2SBaptiste Daroussin #define kh_int_hash_func(key) (khint32_t)(key)
376*8e3b1ab2SBaptiste Daroussin /*! @function
377*8e3b1ab2SBaptiste Daroussin @abstract Integer comparison function
378*8e3b1ab2SBaptiste Daroussin */
379*8e3b1ab2SBaptiste Daroussin #define kh_int_hash_equal(a, b) ((a) == (b))
380*8e3b1ab2SBaptiste Daroussin /*! @function
381*8e3b1ab2SBaptiste Daroussin @abstract 64-bit integer hash function
382*8e3b1ab2SBaptiste Daroussin @param key The integer [khint64_t]
383*8e3b1ab2SBaptiste Daroussin @return The hash value [khint_t]
384*8e3b1ab2SBaptiste Daroussin */
385*8e3b1ab2SBaptiste Daroussin #define kh_int64_hash_func(key) (khint32_t)((key)>>33^(key)^(key)<<11)
386*8e3b1ab2SBaptiste Daroussin /*! @function
387*8e3b1ab2SBaptiste Daroussin @abstract 64-bit integer comparison function
388*8e3b1ab2SBaptiste Daroussin */
389*8e3b1ab2SBaptiste Daroussin #define kh_int64_hash_equal(a, b) ((a) == (b))
390*8e3b1ab2SBaptiste Daroussin /*! @function
391*8e3b1ab2SBaptiste Daroussin @abstract const char* hash function
392*8e3b1ab2SBaptiste Daroussin @param s Pointer to a null terminated string
393*8e3b1ab2SBaptiste Daroussin @return The hash value
394*8e3b1ab2SBaptiste Daroussin */
__ac_X31_hash_string(const char * s)395*8e3b1ab2SBaptiste Daroussin static kh_inline khint_t __ac_X31_hash_string(const char *s)
396*8e3b1ab2SBaptiste Daroussin {
397*8e3b1ab2SBaptiste Daroussin khint_t h = (khint_t)*s;
398*8e3b1ab2SBaptiste Daroussin if (h) for (++s ; *s; ++s) h = (h << 5) - h + (khint_t)*s;
399*8e3b1ab2SBaptiste Daroussin return h;
400*8e3b1ab2SBaptiste Daroussin }
401*8e3b1ab2SBaptiste Daroussin /*! @function
402*8e3b1ab2SBaptiste Daroussin @abstract Another interface to const char* hash function
403*8e3b1ab2SBaptiste Daroussin @param key Pointer to a null terminated string [const char*]
404*8e3b1ab2SBaptiste Daroussin @return The hash value [khint_t]
405*8e3b1ab2SBaptiste Daroussin */
406*8e3b1ab2SBaptiste Daroussin #define kh_str_hash_func(key) __ac_X31_hash_string(key)
407*8e3b1ab2SBaptiste Daroussin /*! @function
408*8e3b1ab2SBaptiste Daroussin @abstract Const char* comparison function
409*8e3b1ab2SBaptiste Daroussin */
410*8e3b1ab2SBaptiste Daroussin #define kh_str_hash_equal(a, b) (strcmp(a, b) == 0)
411*8e3b1ab2SBaptiste Daroussin
__ac_Wang_hash(khint_t key)412*8e3b1ab2SBaptiste Daroussin static kh_inline khint_t __ac_Wang_hash(khint_t key)
413*8e3b1ab2SBaptiste Daroussin {
414*8e3b1ab2SBaptiste Daroussin key += ~(key << 15);
415*8e3b1ab2SBaptiste Daroussin key ^= (key >> 10);
416*8e3b1ab2SBaptiste Daroussin key += (key << 3);
417*8e3b1ab2SBaptiste Daroussin key ^= (key >> 6);
418*8e3b1ab2SBaptiste Daroussin key += ~(key << 11);
419*8e3b1ab2SBaptiste Daroussin key ^= (key >> 16);
420*8e3b1ab2SBaptiste Daroussin return key;
421*8e3b1ab2SBaptiste Daroussin }
422*8e3b1ab2SBaptiste Daroussin #define kh_int_hash_func2(k) __ac_Wang_hash((khint_t)key)
423*8e3b1ab2SBaptiste Daroussin
424*8e3b1ab2SBaptiste Daroussin /* --- END OF HASH FUNCTIONS --- */
425*8e3b1ab2SBaptiste Daroussin
426*8e3b1ab2SBaptiste Daroussin /* Other convenient macros... */
427*8e3b1ab2SBaptiste Daroussin
428*8e3b1ab2SBaptiste Daroussin /*!
429*8e3b1ab2SBaptiste Daroussin @abstract Type of the hash table.
430*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
431*8e3b1ab2SBaptiste Daroussin */
432*8e3b1ab2SBaptiste Daroussin #define khash_t(name) kh_##name##_t
433*8e3b1ab2SBaptiste Daroussin
434*8e3b1ab2SBaptiste Daroussin /*! @function
435*8e3b1ab2SBaptiste Daroussin @abstract Initiate a hash table.
436*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
437*8e3b1ab2SBaptiste Daroussin @return Pointer to the hash table [khash_t(name)*]
438*8e3b1ab2SBaptiste Daroussin */
439*8e3b1ab2SBaptiste Daroussin #define kh_init(name) kh_init_##name()
440*8e3b1ab2SBaptiste Daroussin
441*8e3b1ab2SBaptiste Daroussin /*! @function
442*8e3b1ab2SBaptiste Daroussin @abstract Destroy a hash table.
443*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
444*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
445*8e3b1ab2SBaptiste Daroussin */
446*8e3b1ab2SBaptiste Daroussin #define kh_destroy(name, h) kh_destroy_##name(h)
447*8e3b1ab2SBaptiste Daroussin
448*8e3b1ab2SBaptiste Daroussin /*! @function
449*8e3b1ab2SBaptiste Daroussin @abstract Reset a hash table without deallocating memory.
450*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
451*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
452*8e3b1ab2SBaptiste Daroussin */
453*8e3b1ab2SBaptiste Daroussin #define kh_clear(name, h) kh_clear_##name(h)
454*8e3b1ab2SBaptiste Daroussin
455*8e3b1ab2SBaptiste Daroussin /*! @function
456*8e3b1ab2SBaptiste Daroussin @abstract Resize a hash table.
457*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
458*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
459*8e3b1ab2SBaptiste Daroussin @param s New size [khint_t]
460*8e3b1ab2SBaptiste Daroussin */
461*8e3b1ab2SBaptiste Daroussin #define kh_resize(name, h, s) kh_resize_##name(h, s)
462*8e3b1ab2SBaptiste Daroussin
463*8e3b1ab2SBaptiste Daroussin /*! @function
464*8e3b1ab2SBaptiste Daroussin @abstract Insert a key to the hash table.
465*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
466*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
467*8e3b1ab2SBaptiste Daroussin @param k Key [type of keys]
468*8e3b1ab2SBaptiste Daroussin @param r Extra return code: -1 if the operation failed;
469*8e3b1ab2SBaptiste Daroussin 0 if the key is present in the hash table;
470*8e3b1ab2SBaptiste Daroussin 1 if the bucket is empty (never used); 2 if the element in
471*8e3b1ab2SBaptiste Daroussin the bucket has been deleted [int*]
472*8e3b1ab2SBaptiste Daroussin @return Iterator to the inserted element [khint_t]
473*8e3b1ab2SBaptiste Daroussin */
474*8e3b1ab2SBaptiste Daroussin #define kh_put(name, h, k, r) kh_put_##name(h, k, r)
475*8e3b1ab2SBaptiste Daroussin
476*8e3b1ab2SBaptiste Daroussin /*! @function
477*8e3b1ab2SBaptiste Daroussin @abstract Retrieve a key from the hash table.
478*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
479*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
480*8e3b1ab2SBaptiste Daroussin @param k Key [type of keys]
481*8e3b1ab2SBaptiste Daroussin @return Iterator to the found element, or kh_end(h) if the element is absent [khint_t]
482*8e3b1ab2SBaptiste Daroussin */
483*8e3b1ab2SBaptiste Daroussin #define kh_get(name, h, k) kh_get_##name(h, k)
484*8e3b1ab2SBaptiste Daroussin
485*8e3b1ab2SBaptiste Daroussin /*! @function
486*8e3b1ab2SBaptiste Daroussin @abstract Remove a key from the hash table.
487*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
488*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
489*8e3b1ab2SBaptiste Daroussin @param k Iterator to the element to be deleted [khint_t]
490*8e3b1ab2SBaptiste Daroussin */
491*8e3b1ab2SBaptiste Daroussin #define kh_del(name, h, k) kh_del_##name(h, k)
492*8e3b1ab2SBaptiste Daroussin
493*8e3b1ab2SBaptiste Daroussin /*! @function
494*8e3b1ab2SBaptiste Daroussin @abstract Test whether a bucket contains data.
495*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
496*8e3b1ab2SBaptiste Daroussin @param x Iterator to the bucket [khint_t]
497*8e3b1ab2SBaptiste Daroussin @return 1 if containing data; 0 otherwise [int]
498*8e3b1ab2SBaptiste Daroussin */
499*8e3b1ab2SBaptiste Daroussin #define kh_exist(h, x) (!__ac_iseither((h)->flags, (x)))
500*8e3b1ab2SBaptiste Daroussin
501*8e3b1ab2SBaptiste Daroussin /*! @function
502*8e3b1ab2SBaptiste Daroussin @abstract Get key given an iterator
503*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
504*8e3b1ab2SBaptiste Daroussin @param x Iterator to the bucket [khint_t]
505*8e3b1ab2SBaptiste Daroussin @return Key [type of keys]
506*8e3b1ab2SBaptiste Daroussin */
507*8e3b1ab2SBaptiste Daroussin #define kh_key(h, x) ((h)->keys[x])
508*8e3b1ab2SBaptiste Daroussin
509*8e3b1ab2SBaptiste Daroussin /*! @function
510*8e3b1ab2SBaptiste Daroussin @abstract Get value given an iterator
511*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
512*8e3b1ab2SBaptiste Daroussin @param x Iterator to the bucket [khint_t]
513*8e3b1ab2SBaptiste Daroussin @return Value [type of values]
514*8e3b1ab2SBaptiste Daroussin @discussion For hash sets, calling this results in segfault.
515*8e3b1ab2SBaptiste Daroussin */
516*8e3b1ab2SBaptiste Daroussin #define kh_val(h, x) ((h)->vals[x])
517*8e3b1ab2SBaptiste Daroussin
518*8e3b1ab2SBaptiste Daroussin /*! @function
519*8e3b1ab2SBaptiste Daroussin @abstract Alias of kh_val()
520*8e3b1ab2SBaptiste Daroussin */
521*8e3b1ab2SBaptiste Daroussin #define kh_value(h, x) ((h)->vals[x])
522*8e3b1ab2SBaptiste Daroussin
523*8e3b1ab2SBaptiste Daroussin /*! @function
524*8e3b1ab2SBaptiste Daroussin @abstract Get the start iterator
525*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
526*8e3b1ab2SBaptiste Daroussin @return The start iterator [khint_t]
527*8e3b1ab2SBaptiste Daroussin */
528*8e3b1ab2SBaptiste Daroussin #define kh_begin(h) (khint_t)(0)
529*8e3b1ab2SBaptiste Daroussin
530*8e3b1ab2SBaptiste Daroussin /*! @function
531*8e3b1ab2SBaptiste Daroussin @abstract Get the end iterator
532*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
533*8e3b1ab2SBaptiste Daroussin @return The end iterator [khint_t]
534*8e3b1ab2SBaptiste Daroussin */
535*8e3b1ab2SBaptiste Daroussin #define kh_end(h) ((h)->n_buckets)
536*8e3b1ab2SBaptiste Daroussin
537*8e3b1ab2SBaptiste Daroussin /*! @function
538*8e3b1ab2SBaptiste Daroussin @abstract Get the number of elements in the hash table
539*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
540*8e3b1ab2SBaptiste Daroussin @return Number of elements in the hash table [khint_t]
541*8e3b1ab2SBaptiste Daroussin */
542*8e3b1ab2SBaptiste Daroussin #define kh_size(h) ((h)->size)
543*8e3b1ab2SBaptiste Daroussin
544*8e3b1ab2SBaptiste Daroussin /*! @function
545*8e3b1ab2SBaptiste Daroussin @abstract Get the number of buckets in the hash table
546*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
547*8e3b1ab2SBaptiste Daroussin @return Number of buckets in the hash table [khint_t]
548*8e3b1ab2SBaptiste Daroussin */
549*8e3b1ab2SBaptiste Daroussin #define kh_n_buckets(h) ((h)->n_buckets)
550*8e3b1ab2SBaptiste Daroussin
551*8e3b1ab2SBaptiste Daroussin /*! @function
552*8e3b1ab2SBaptiste Daroussin @abstract Iterate over the entries in the hash table
553*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
554*8e3b1ab2SBaptiste Daroussin @param kvar Variable to which key will be assigned
555*8e3b1ab2SBaptiste Daroussin @param vvar Variable to which value will be assigned
556*8e3b1ab2SBaptiste Daroussin @param code Block of code to execute
557*8e3b1ab2SBaptiste Daroussin */
558*8e3b1ab2SBaptiste Daroussin #define kh_foreach(h, kvar, vvar, code) { khint_t __i; \
559*8e3b1ab2SBaptiste Daroussin for (__i = kh_begin(h); __i != kh_end(h); ++__i) { \
560*8e3b1ab2SBaptiste Daroussin if (!kh_exist(h,__i)) continue; \
561*8e3b1ab2SBaptiste Daroussin (kvar) = kh_key(h,__i); \
562*8e3b1ab2SBaptiste Daroussin (vvar) = kh_val(h,__i); \
563*8e3b1ab2SBaptiste Daroussin code; \
564*8e3b1ab2SBaptiste Daroussin } }
565*8e3b1ab2SBaptiste Daroussin
566*8e3b1ab2SBaptiste Daroussin /*! @function
567*8e3b1ab2SBaptiste Daroussin @abstract Iterate over the values in the hash table
568*8e3b1ab2SBaptiste Daroussin @param h Pointer to the hash table [khash_t(name)*]
569*8e3b1ab2SBaptiste Daroussin @param vvar Variable to which value will be assigned
570*8e3b1ab2SBaptiste Daroussin @param code Block of code to execute
571*8e3b1ab2SBaptiste Daroussin */
572*8e3b1ab2SBaptiste Daroussin #define kh_foreach_value(h, vvar, code) { khint_t __i; \
573*8e3b1ab2SBaptiste Daroussin for (__i = kh_begin(h); __i != kh_end(h); ++__i) { \
574*8e3b1ab2SBaptiste Daroussin if (!kh_exist(h,__i)) continue; \
575*8e3b1ab2SBaptiste Daroussin (vvar) = kh_val(h,__i); \
576*8e3b1ab2SBaptiste Daroussin code; \
577*8e3b1ab2SBaptiste Daroussin } }
578*8e3b1ab2SBaptiste Daroussin
579*8e3b1ab2SBaptiste Daroussin /* More conenient interfaces */
580*8e3b1ab2SBaptiste Daroussin
581*8e3b1ab2SBaptiste Daroussin /*! @function
582*8e3b1ab2SBaptiste Daroussin @abstract Instantiate a hash set containing integer keys
583*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
584*8e3b1ab2SBaptiste Daroussin */
585*8e3b1ab2SBaptiste Daroussin #define KHASH_SET_INIT_INT(name) \
586*8e3b1ab2SBaptiste Daroussin KHASH_INIT(name, khint32_t, char, 0, kh_int_hash_func, kh_int_hash_equal)
587*8e3b1ab2SBaptiste Daroussin
588*8e3b1ab2SBaptiste Daroussin /*! @function
589*8e3b1ab2SBaptiste Daroussin @abstract Instantiate a hash map containing integer keys
590*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
591*8e3b1ab2SBaptiste Daroussin @param khval_t Type of values [type]
592*8e3b1ab2SBaptiste Daroussin */
593*8e3b1ab2SBaptiste Daroussin #define KHASH_MAP_INIT_INT(name, khval_t) \
594*8e3b1ab2SBaptiste Daroussin KHASH_INIT(name, khint32_t, khval_t, 1, kh_int_hash_func, kh_int_hash_equal)
595*8e3b1ab2SBaptiste Daroussin
596*8e3b1ab2SBaptiste Daroussin /*! @function
597*8e3b1ab2SBaptiste Daroussin @abstract Instantiate a hash map containing 64-bit integer keys
598*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
599*8e3b1ab2SBaptiste Daroussin */
600*8e3b1ab2SBaptiste Daroussin #define KHASH_SET_INIT_INT64(name) \
601*8e3b1ab2SBaptiste Daroussin KHASH_INIT(name, khint64_t, char, 0, kh_int64_hash_func, kh_int64_hash_equal)
602*8e3b1ab2SBaptiste Daroussin
603*8e3b1ab2SBaptiste Daroussin /*! @function
604*8e3b1ab2SBaptiste Daroussin @abstract Instantiate a hash map containing 64-bit integer keys
605*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
606*8e3b1ab2SBaptiste Daroussin @param khval_t Type of values [type]
607*8e3b1ab2SBaptiste Daroussin */
608*8e3b1ab2SBaptiste Daroussin #define KHASH_MAP_INIT_INT64(name, khval_t) \
609*8e3b1ab2SBaptiste Daroussin KHASH_INIT(name, khint64_t, khval_t, 1, kh_int64_hash_func, kh_int64_hash_equal)
610*8e3b1ab2SBaptiste Daroussin
611*8e3b1ab2SBaptiste Daroussin typedef const char *kh_cstr_t;
612*8e3b1ab2SBaptiste Daroussin /*! @function
613*8e3b1ab2SBaptiste Daroussin @abstract Instantiate a hash map containing const char* keys
614*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
615*8e3b1ab2SBaptiste Daroussin */
616*8e3b1ab2SBaptiste Daroussin #define KHASH_SET_INIT_STR(name) \
617*8e3b1ab2SBaptiste Daroussin KHASH_INIT(name, kh_cstr_t, char, 0, kh_str_hash_func, kh_str_hash_equal)
618*8e3b1ab2SBaptiste Daroussin
619*8e3b1ab2SBaptiste Daroussin /*! @function
620*8e3b1ab2SBaptiste Daroussin @abstract Instantiate a hash map containing const char* keys
621*8e3b1ab2SBaptiste Daroussin @param name Name of the hash table [symbol]
622*8e3b1ab2SBaptiste Daroussin @param khval_t Type of values [type]
623*8e3b1ab2SBaptiste Daroussin */
624*8e3b1ab2SBaptiste Daroussin #define KHASH_MAP_INIT_STR(name, khval_t) \
625*8e3b1ab2SBaptiste Daroussin KHASH_INIT(name, kh_cstr_t, khval_t, 1, kh_str_hash_func, kh_str_hash_equal)
626*8e3b1ab2SBaptiste Daroussin
627*8e3b1ab2SBaptiste Daroussin #endif /* __AC_KHASH_H */
628