_cp_hashtable_entry Struct Reference
[Cp_hashtable]

#include <hashtable.h>

Data Fields
void *	key
void *	value
unsigned long	hashcode
_cp_hashtable_entry *	next

---

Detailed Description

Internal object that implements a key, value pair plus linked list.

Entries which are stored under the same index in the hashtable are stored in a linked list. The algorithm of the hashtable has to ensure that the lists do not get too long.

Definition at line 225 of file hashtable.h.

---

Field Documentation

unsigned long _cp_hashtable_entry::hashcode

save calculated hash-code of the key Definition at line 229 of file hashtable.h. Referenced by cp_hashtable_resize_nosync().

void* _cp_hashtable_entry::key

key (original) needed for comparisons Definition at line 227 of file hashtable.h. Referenced by cp_hashtable_get_keys().

struct _cp_hashtable_entry* _cp_hashtable_entry::next

link to next entry Definition at line 230 of file hashtable.h. Referenced by cp_hashtable_destroy(), cp_hashtable_destroy_custom(), cp_hashtable_get_keys(), cp_hashtable_get_values(), cp_hashtable_remove_all(), cp_hashtable_remove_internal(), cp_hashtable_resize_nosync(), and lookup_internal().

void* _cp_hashtable_entry::value

the item value being stored Definition at line 228 of file hashtable.h. Referenced by cp_hashtable_get_values(), cp_hashtable_put_by_option(), and cp_hashtable_remove_internal().

---

The documentation for this struct was generated from the following file:

• hashtable.h

---