pointer_set_t Struct Reference

#include <pointer-set.h>

Inheritance diagram for pointer_set_t:

Data Fields
size_t	log_slots
size_t	n_slots
size_t	n_elements
const void **	slots

---

Detailed Description

A pointer set is represented as a simple open-addressing hash
   table.  Simplifications: The hash code is based on the value of the
   pointer, not what it points to.  The number of buckets is always a
   power of 2.  Null pointers are a reserved value.  Deletion is not
   supported (yet).  There is no mechanism for user control of hash
   function, equality comparison, initial size, or resizing policy.   

---

Field Documentation

size_t pointer_set_t::log_slots

Referenced by pointer_map_create(), pointer_map_insert(), pointer_set_create(), pointer_set_insert(), and pointer_set_lookup().

size_t pointer_set_t::n_elements

Referenced by pointer_map_create(), pointer_map_insert(), pointer_set_create(), and pointer_set_insert().

size_t pointer_set_t::n_slots

Referenced by pointer_map_create(), pointer_map_insert(), pointer_map_traverse(), pointer_set_create(), pointer_set_insert(), pointer_set_lookup(), and pointer_set_traverse().

const void** pointer_set_t::slots

Referenced by pointer_map_create(), pointer_map_destroy(), pointer_map_insert(), pointer_map_traverse(), pointer_set_create(), pointer_set_destroy(), pointer_set_insert(), pointer_set_lookup(), and pointer_set_traverse().

---

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

• pointer-set.h