Exit Zen
10
:254
English
_T_
3/100 · 3
10
:351
English
*Template Parameters*
6/210 · 21
10
:32
English
This unusually laid out data structure is chosen to make iteration of the entire container efficient by inter-connecting all of the nodes into a singly-linked list. One might also notice that buckets point to the node _before_ the start of the bucket's elements. This is done so that removing elements from the list can be done efficiently without introducing the need for a doubly-linked list. Unfortunately, this data structure introduces a guaranteed extra indirection. For example, to access the first element of a bucket, something like this must be done:
138/5600 · 560
10
:12
English
xref:reference/unordered_set.adoc[Class Template +++<code style="color: inherit;">+++unordered_set+++</code>+++]
101/1120 · 112
10
:242
English
Description
2/110 · 11
10
:288
English
Description
2/110 · 11
10
:300
English
*Template Parameters*
6/210 · 21
10
:333
English
*Template Parameters*
6/210 · 21
10
:237
English
Description
2/110 · 11
10
:245
English
_Hash_
6/100 · 6
10
:284
English
Description
2/110 · 11
10
:287
English
_T_
3/100 · 3
10
:53
English
For successful (element found) or unsuccessful (not found) lookup, provides the number of operations performed by a container and statistics on the associated __probe length__ (number of xref:structures.adoc#structures_open_addressing_containers[bucket groups] accessed) and number of element comparisons per operation.
134/3190 · 319
11
:11
English
xref:rationale.adoc[]
25/210 · 21
11
:51
English
for(std::string::const_iterator it = x.begin(); it != x.end(); ++it) { boost::hash_combine(seed, std::toupper(*it, locale)); }
126/1260 · 126
11
:54
English
for unordered associative containers and feature one of the fastest implementations in the market within the technical constraints imposed by the required standard interface.
27/1740 · 174
11
:47
English
This feature has been retained for backwards compatibility with previous versions of Boost.Unordered: users are encouraged to update their code to use `std::piecewise_construct` and ``std::tuple``s instead.
92/2060 · 206
11
:75
English
The `stats` object provides the following information:
19/540 · 54
11
:70
English
In a similar manner to using `reserve` for ``vector``s, it can be a good idea to call `reserve` before inserting a large number of elements. This will get the expensive rehashing out of the way and let you store iterators, safe in the knowledge that they won't be invalidated. If you are inserting `n` elements into container `x`, you could first call:
125/3520 · 352
11
:24
English
Added concurrent, node-based containers `boost::concurrent_node_map` and `boost::concurrent_node_set`.
73/1020 · 102