#include <hash-table.h>
◆ iterator() [1/2]
template<typename Descriptor ,
bool Lazy = false, template< typename Type > class Allocator = xcallocator>
hash_table< Descriptor, Lazy, Allocator >::iterator::iterator |
( |
| ) |
|
|
inline |
◆ iterator() [2/2]
template<typename Descriptor ,
bool Lazy = false, template< typename Type > class Allocator = xcallocator>
◆ operator!=()
template<typename Descriptor ,
bool Lazy = false, template< typename Type > class Allocator = xcallocator>
◆ operator*()
template<typename Descriptor ,
bool Lazy = false, template< typename Type > class Allocator = xcallocator>
◆ operator++()
template<typename Descriptor ,
bool Lazy, template< typename Type > class Allocator>
◆ slide()
template<typename Descriptor ,
bool Lazy, template< typename Type > class Allocator>
void hash_table< Descriptor, Lazy, Allocator >::iterator::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
template<typename Descriptor ,
bool Lazy = false, template< typename Type > class Allocator = xcallocator>
◆ m_slot
template<typename Descriptor ,
bool Lazy = false, template< typename Type > class Allocator = xcallocator>
The documentation for this class was generated from the following file: