KHash

template<class T, class Hash, class Eq = std::equal_to<T>, typename khint_t = uint32_t>

class KHash (

T

hashfn

khint_t = uint32_t

) {

khint_t capacity(void );

khint_t size(void );

khint_t begin(void );

khint_t end(void );

void exist(khint_t x);

T at(khint_t x);

khint_t get(T key);

int resize(khint_t new_n_buckets);

khint_t site;

khint_t last;

khint_t mask;

khint_t step;

}

Destructor

~this ~this(): Undocumented in source.

Members

Functions

at T at(khint_t x): return bucket contents at integer offset by reference
begin khint_t begin(void ): zero
capacity khint_t capacity(void ): capacity (number of buckets)
end khint_t end(void ): same as capacity / n.buckets
exist void exist(khint_t x): does object exist at this integer offset?
get khint_t get(T key): get integer offset of value for key
resize int resize(khint_t new_n_buckets): resize the hash table
size khint_t size(void ): actual size (num objects)

Variables

i khint_t i;: Undocumented in source.
k khint_t k;
last khint_t last;
mask khint_t mask;
site khint_t site;
step khint_t step;: Undocumented in source.
x khint_t x;: Undocumented in source.

Meta

Source

See Implementation

intervaltree khash classes

KHash

functions