hsh___list Struct Reference

Structure for storing a number of data packets of size sizeof(void*). More...

Data Fields
int	count
	Count of entries.
void *	entries [HASH__LIST_MAX]
	Array of pointers.

---

Detailed Description

Structure for storing a number of data packets of size sizeof(void*).

Definition at line 473 of file hash_ops.c.

---

Field Documentation

int hsh___list::count

Count of entries.

If we put the overflow flag/count at the end, the structure is not runtime-resizeable. If we put it at the start, it will always need alignment for the pointers behind. So we can just store the count ... a single bit wouldn't need fewer bytes.

If count>HASH__LIST_MAX, this entry is considered "overflown".

Definition at line 484 of file hash_ops.c.

Referenced by hsh__insert_pointer(), and hsh__list_get().

void* hsh___list::entries[HASH__LIST_MAX]

Array of pointers.

Definition at line 486 of file hash_ops.c.

Referenced by hsh__insert_pointer(), and hsh__list_get().

---

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

• hash_ops.c