STL‐conforming forward iterator over hash‐table node lists.
Synopsis
Declared in <bslstl_hashtableiterator.h>
template<
class VALUE_TYPE,
class DIFFERENCE_TYPE>
class HashTableIterator;
Description
This class template implements an in‐core value‐semantic type that is an standard‐conforming forward iterator (see section 24.2.5 [forward.iterators]of the C++11 standard) over a list of bslalg::BidirectionalLink objects. A HashTableIterator object provides access to values of the (template parameter) VALUE_TYPE, stored in a hash table composed of bslalg::BidirectionalLink nodes. The (template parameter) DIFFERENCE_TYPE determines the standard mandated difference_type of the iterator, without requiring access to the allocator‐traits for the node.
Type Aliases
Name |
Description |
Iterator difference type. |
|
Standard iterator defined types [24.4.2]. |
|
This |
|
This |
|
This |
Member Functions
Name |
Description |
|
Constructors |
|
Destroy this object. |
Assign to this object the value of the specified |
|
Return the address of the node at this iterator's position. |
|
Return a reference to the value at this iterator's position. |
|
Advance this iterator to the next node in the list. |
|
Return the address of the value at this iterator's position. |
Non-Member Functions
Name |
Description |
Same as the preceding overload. |
|
Same as the preceding overload. |
|
Same as the preceding overload. |
|
Return |
|
Advance |
|
Same as the preceding overload. |
|
Same as the preceding overload. |
|
Same as the preceding overload. |
|
Return |
Created with MrDocs