#include <hash-table.h>
◆ iterator() [1/2]
◆ iterator() [2/2]
◆ operator!=()
◆ operator*()
◆ operator++()
◆ slide()
Slide down the iterator slots until an active entry is found.
References hash_table< Descriptor, Lazy, Allocator >::is_deleted(), hash_table< Descriptor, Lazy, Allocator >::is_empty(), hash_table< Descriptor, Lazy, Allocator >::iterator::m_limit, hash_table< Descriptor, Lazy, Allocator >::iterator::m_slot, and NULL.
Referenced by hash_table< Descriptor, Lazy, Allocator >::begin().
◆ m_limit
◆ m_slot
The documentation for this class was generated from the following file: