Exit Zen
5
:12
English
As a result of its using open addressing, the interface of `boost::unordered_node_set` deviates in a number of aspects from that of `boost::unordered_set`/`std::unordered_set`:
96/1760 · 176
5
:12
English
As a result of its using open addressing, the interface of `boost::unordered_node_map` deviates in a number of aspects from that of `boost::unordered_map`/`std::unordered_map`:
96/1760 · 176
5
:10
English
Even though it acts as a container, `boost::concurrent_node_set` does not model the standard C++ https://en.cppreference.com/w/cpp/named_req/Container[Container^] concept. In particular, iterators and associated operations (`begin`, `end`, etc.) are not provided. Element access is done through user-provided _visitation functions_ that are passed to `concurrent_node_set` operations where they are executed internally in a controlled fashion. Such visitation-based API allows for low-contention concurrent usage scenarios.
277/5230 · 523
5
:10
English
Even though it acts as a container, `boost::concurrent_flat_map` does not model the standard C++ https://en.cppreference.com/w/cpp/named_req/Container[Container^] concept. In particular, iterators and associated operations (`begin`, `end`, etc.) are not provided. Element access and modification are done through user-provided _visitation functions_ that are passed to `concurrent_flat_map` operations where they are executed internally in a controlled fashion. Such visitation-based API allows for low-contention concurrent usage scenarios.
253/5410 · 541
5
:14
English
As a result of its using open addressing, the interface of `boost::unordered_flat_set` deviates in a number of aspects from that of `boost::unordered_flat_set`/`std::unordered_flat_set`:
96/1860 · 186
:238
:238
English
---
3/100 · 3
5
:14
English
As a result of its using open addressing, the interface of `boost::unordered_flat_map` deviates in a number of aspects from that of `boost::unordered_map`/`std::unordered_map`:
114/1760 · 176
:280
:280
English
---
3/100 · 3
5
:41
English
__stats-summary-type__
8/220 · 22
6
:6
English
xref:hash_quality.adoc[]
24/240 · 24
6
:25
English
```cpp boost::unordered_map<std::string, int, hash::fnv_1a> dictionary; ```
96/750 · 75
6
:27
English
^h| ^h|*Node-based* ^h|*Flat*
21/290 · 29
6
:16
English
Deduction Guides
4/160 · 16
6
:22
English
Hash Post-mixing and the Avalanching Property
14/450 · 45
6
:41
English
can be in any order. For example, it might be:
19/460 · 46
6
:15
English
Added `pull(const_iterator)` to open-addressing containers. This operation
39/740 · 74
6
:12
English
To visualize Boost.Unordered containers in the Natvis framework in your project, simply add the file link:https://github.com/boostorg/unordered/blob/develop/extra/boost_unordered.natvis[/extra/boost_unordered.natvis] to your Visual Studio project as an "Existing Item".
203/2690 · 269
6
:12
English
Copyright (C) 2022-2025 Christian Mazakas
47/410 · 41
6
:10
English
An introduction to hash table implementations. Discusses the differences between closed-addressing and open-addressing approaches.
40/1300 · 130
6
:47
English
The first thing a new user of Boost.Unordered concurrent containers will notice is that these classes _do not provide iterators_ (which makes them technically not https://en.cppreference.com/w/cpp/named_req/Container[Containers^] in the C++ standard sense). The reason for this is that iterators are inherently thread-unsafe. Consider this hypothetical code:
164/3580 · 358