Exit Zen
183
:742
English
```c++ iterator insert(const value_type& obj); ```
54/500 · 50
183
:798
English
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. Returns:;; The `bool` component of the return type is `true` if an insert took place. + + If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, pointers and references, but only if the insert causes the load to be greater than the maximum load. + + A call of the form `insert(x)`, where `x` is equally convertible to both `const value_type&` and `const init_type&`, is not ambiguous and selects the `init_type` overload.
345/7540 · 754
183
:797
English
`position` is a suggestion to where the element should be inserted.
24/670 · 67
184
:273
English
Fix construction/destruction issue when using a {cpp}11 compiler with a
48/710 · 71
184
:814
English
Successively invokes `f` with const references to each of the elements in the table until `f` returns `false` or all the elements are visited.
54/1420 · 142
184
:592
English
image::benchmarks-concurrent_map/clang-arm64/Parallel workload.xlsx.500k, 0.5.png[width=250,window=_blank,link="_images/benchmarks-concurrent_map/clang-arm64/Parallel workload.xlsx.500k, 0.5.png"]
196/1960 · 196
:765
:765
English
---
3/100 · 3
184
:751
English
```c++ iterator insert(const value_type& obj); ```
54/500 · 50
184
:894
English
Parallel [c]visit_all
27/210 · 21
:770
:770
English
---
3/100 · 3
:821
:821
English
---
3/100 · 3
184
:837
English
```c++ template<class ExecutionPolicy, class F> void visit_all(ExecutionPolicy&& policy, F f); template<class ExecutionPolicy, class F> void visit_all(ExecutionPolicy&& policy, F f) const; template<class ExecutionPolicy, class F> void cvisit_all(ExecutionPolicy&& policy, F f) const; ```
362/2870 · 287
184
:871
English
Successively invokes `f` with references to each of the elements in the table until `f` returns `false` or all the elements are visited. Such references to the elements are const iff `*this` is const.
81/2000 · 200
:749
:749
English
---
3/100 · 3
:746
:746
English
Inserts `obj` in the container.
14/310 · 31
:807
:807
English
---
3/100 · 3
184
:800
English
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `args`. Returns:;; If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key. + + Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + If `args...` is of the form `k,v`, it delays constructing the whole object until it is certain that an element should be inserted, using only the `k` argument to check. This optimization happens when the map's `key_type` is move constructible or when the `k` argument is a `key_type`.
462/10830 · 1083
185
:274
English
{cpp}03 allocator ({svn-ticket-url}/7100[#7100^]).
64/500 · 50
185
:818
English
Returns:;; `false` iff `f` ever returns `false`.
41/480 · 48
185
:592
English
image::benchmarks-concurrent_map/clang-arm64/Parallel workload.xlsx.500k, 0.99.png[width=250,window=_blank,link="_images/benchmarks-concurrent_map/clang-arm64/Parallel workload.xlsx.500k, 0.99.png"]
198/1980 · 198