bitmap_element_def Struct Reference

#include <bitmap.h>

Collaboration diagram for bitmap_element_def:

Data Fields
struct bitmap_element_def *	next
struct bitmap_element_def *	prev
unsigned int	indx
BITMAP_WORD	bits [BITMAP_ELEMENT_WORDS]

---

Detailed Description

   Bitmap set element.  We use a linked list to hold only the bits that
   are set.  This allows for use to grow the bitset dynamically without
   having to realloc and copy a giant bit array.

   The free list is implemented as a list of lists.  There is one
   outer list connected together by prev fields.  Each element of that
   outer is an inner list (that may consist only of the outer list
   element) that are connected by the next fields.  The prev pointer
   is undefined for interior elements.  This allows
   bitmap_elt_clear_from to be implemented in unit time rather than
   linear in the number of elements to be freed.  

---

Field Documentation

BITMAP_WORD bitmap_element_def::bits[BITMAP_ELEMENT_WORDS]

Referenced by bitmap_and(), bitmap_and_into(), bitmap_bit_p(), bitmap_clear_bit(), bitmap_compl_and_into(), bitmap_elt_copy(), bitmap_elt_insert_after(), bitmap_equal_p(), and bitmap_popcount().

unsigned int bitmap_element_def::indx

Referenced by bitmap_and(), bitmap_and_compl_into(), bitmap_and_into(), bitmap_copy(), bitmap_element_free(), bitmap_elt_clear_from(), bitmap_elt_copy(), bitmap_elt_insert_after(), bitmap_equal_p(), and bitmap_intersect_p().

struct bitmap_element_def* bitmap_element_def::next

Referenced by bitmap_and(), bitmap_bit_p(), bitmap_copy(), bitmap_elt_insert_after(), bitmap_equal_p(), bitmap_intersect_p(), and bitmap_ior_and_compl_into().

struct bitmap_element_def* bitmap_element_def::prev

Referenced by bitmap_copy(), bitmap_elem_to_freelist(), and bitmap_elt_insert_after().

---

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

• bitmap.h