Exit Zen
336
:1331
English
```c++ template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>&& source); ```
554/3860 · 386
:1326
:1326
English
---
3/100 · 3
:1269
:1269
English
---
3/100 · 3
:1232
:1232
English
---
3/100 · 3
337
:1419
English
```c++ template<class... Args, class F1, class F2> bool try_emplace_and_visit(const key_type& k, Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool try_emplace_and_cvisit(const key_type& k, Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool try_emplace_and_visit(key_type&& k, Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool try_emplace_and_cvisit(key_type&& k, Args&&... args, F1&& f1, F2&& f2); template<class K, class... Args, class F1, class F2> bool try_emplace_and_visit(K&& k, Args&&... args, F1&& f1, F2&& f2); template<class K, class... Args, class F1, class F2> bool try_emplace_and_cvisit(K&& k, Args&&... args, F1&& f1, F2&& f2); ```
1039/7470 · 747
337
:1222
English
Returns:;; The maximum number of elements the container can hold without rehashing, assuming that no further elements will be erased. Note:;; After construction, rehash or clearance, the container's maximum load is at least `max_load_factor() * bucket_count()`. This number may decrease on erasure under high-load conditions.
132/3250 · 325
:1315
:1315
English
---
3/100 · 3
337
:1325
English
Erases the element `x` with key equivalent to `k` if it exists and `f(x)` is `true`.
45/840 · 84
337
:1448
English
Returns:;; The number of elements erased. Throws:;; Only throws an exception if it is thrown by `f`.
38/1000 · 100
337
:1198
English
operator
8/100 · 8
337
:1229
English
```c++ local_iterator end(size_type n); const_local_iterator end(size_type n) const; ```
88/880 · 88
337
:1311
English
max_load_factor
31/150 · 15
337
:1342
English
Attempt to "merge" two containers by iterating `source` and extracting any node in `source` that is not contained in `*this` and then inserting it into `*this`.
82/1600 · 160
338
:1328
English
hash_function
4/130 · 13
338
:1271
English
bucket_size
3/110 · 11
338
:1234
English
bucket_size
3/110 · 11
338
:1434
English
Inserts an element constructed from `k` and `args` into the table if there is no existing element with key `k` contained within it, and then invokes `f1` with a non-const reference to the newly created element. Otherwise, invokes `f2` with a reference to the equivalent element; such reference is const iff a `*_cvisit` overload is used.
114/3370 · 337
:1226
:1226
English
---
3/100 · 3
338
:1317
English
count
5/100 · 5
338
:1328
English
Returns:;; The number of elements erased (0 or 1). Throws:;; Only throws an exception if it is thrown by `hasher`, `key_equal` or `f`. Notes:;; The `template<class K, class F>` overload only participates in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `false`. + + The `template<class K, class F>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.
465/6790 · 679