khint_t 35 khash.h typedef khint_t khiter_t; khint_t 49 khash.h static inline khint_t __ac_X31_hash_string(const char *s) khint_t 51 khash.h khint_t h = (khint_t)*s; khint_t 52 khash.h if (h) for (++s ; *s; ++s) h = (h << 5) - h + (khint_t)*s; khint_t 63 khash.h khint_t n_buckets, size, n_occupied, upper_bound; \ khint_t 73 khash.h extern khint_t kh_get_##name(const kh_##name##_t *h, khkey_t key); \ khint_t 74 khash.h extern int kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets); \ khint_t 75 khash.h extern khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret); \ khint_t 76 khash.h extern void kh_del_##name(kh_##name##_t *h, khint_t x); khint_t 97 khash.h SCOPE khint_t kh_get_##name(const kh_##name##_t *h, khkey_t key) \ khint_t 100 khash.h khint_t k, i, last, mask, step = 0; \ khint_t 111 khash.h SCOPE int kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets) \ khint_t 114 khash.h khint_t j = 1; \ khint_t 118 khash.h if (h->size >= (khint_t)(new_n_buckets * __ac_HASH_UPPER + 0.5)) j = 0; /* requested size is too small */ \ khint_t 136 khash.h khint_t new_mask; \ khint_t 141 khash.h khint_t k, i, step = 0; \ khint_t 166 khash.h h->upper_bound = (khint_t)(h->n_buckets * __ac_HASH_UPPER + 0.5); \ khint_t 170 khash.h SCOPE khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret) \ khint_t 172 khash.h khint_t x; \ khint_t 183 khash.h khint_t k, i, site, last, mask = h->n_buckets - 1, step = 0; \ khint_t 212 khash.h SCOPE void kh_del_##name(kh_##name##_t *h, khint_t x) \ khint_t 268 khash.h #define kh_begin(h) (khint_t)(0) khint_t 298 khash.h #define kh_foreach(h, kvar, vvar, code) { khint_t __i; \ khint_t 312 khash.h #define kh_foreach_value(h, vvar, code) { khint_t __i; \