Xiqual 0.9.1

typedef struct HashTable

Non-resizing hash table.

ulong size

Number of buckets.

ulong load

Maximum number of elements per bucket.

ulong count

Number of elements right now

ulong nodesize

Size of nodes.

struct HashNode **buckets

The actual hash array

Documentation

Non-resizing hash table. Better make sure you allocate enough space for all the data you need, or use the forthcoming extension called "hash carousels".

ulong size

Number of buckets. A bucket holds approximately the number of nodes specified by load on creation. This is not a real guarantee, though, as the hashing algorithm can't guarantee complete useless in hashes.

ulong load

Maximum number of elements per bucket. When the average elements per bucket reaches this number, the hash table is definitely full.

The current implementation refuses to add nodes beyond this point.

ulong count

Number of elements right now

ulong nodesize

Size of nodes. This allows you to have custom nodes - the only requirement is that the first fields are the same as the HashNode structure.

struct HashNode **buckets

The actual hash array Each bucket is a pointer to one or more hash nodes. Specify load to set an approximate maximum.

See Also:

hash_new(), HashNode

Alphabetic index