#include <bslalg_hashtablebucket.h>
◆ BSLMF_NESTED_TRAIT_DECLARATION()
◆ countElements()
std::size_t bslalg::HashTableBucket::countElements |
( |
| ) |
const |
◆ end()
Return the next node after the end of this bucket, or 0 if 0 == last()
, so the range to traverse to traverse all nodes in the bucket is always [ first(), end() )
regardless of whether the bucket is empty.
◆ first()
Return the address of the first element in this hash bucket, or a null pointer value if the bucket is empty.
◆ last()
Return the address of the last element in this hash bucket, or a null pointer value if the bucket is empty.
◆ reset()
void bslalg::HashTableBucket::reset |
( |
| ) |
|
|
inline |
◆ setFirst()
Set the first
element of this bucket to the specified node
. The behavior is undefined unless node
is an element from the same bidirectional list as the last
element in this bucket, and node
either precedes last
in that list, or is the same node, or this bucket is empty and node
has a null pointer value.
◆ setFirstAndLast()
Set first
and last
to the specified values. Behavior is undefined unless unless first == last
, or unless first
and last
are links from the same list, where first
precedes last
in the list. Note that first
and last
may both have a null pointer value, indicating an empty bucket.
◆ setLast()
Set the last
element of this bucket to the specified node
. The behavior is undefined unless node
is an element from the same bidirectional list as the first
element in this bucket, and node
either follows first
in that list, or is the same node, or this bucket is empty and node
has a null pointer value.
◆ d_first_p
◆ d_last_p
The documentation for this struct was generated from the following file: