Exit Zen
282
:1155
English
Removes an element with key equivalent to `k`.
17/460 · 46
283
:443
English
modularization and hopefully make it easier to track Release subversion.
13/720 · 72
283
:1150
English
```c++ template<class K, class F1, class F2> bool insert_and_visit(K&& k, F1 f1, F2 f2); template<class K, class F1, class F2> bool insert_and_cvisit(K&& k, F1 f1, F2 f2); ```
219/1750 · 175
283
:1104
English
```c++ void clear() noexcept; ```
33/330 · 33
283
:1072
English
Erases all elements in the container.
11/370 · 37
283
:1213
English
```c++ template<class... Args, class F1, class F2> bool emplace_and_visit(Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool emplace_and_cvisit(Args&&... args, F1&& f1, F2&& f2); ```
297/2150 · 215
283
:1068
English
Transfers all the element nodes from `source` whose key is not already present in `*this`.
37/900 · 90
:1168
:1168
English
---
3/100 · 3
283
:1150
English
```c++ template<class F> insert_return_type insert_or_visit(node_type&& nh, F f); template<class F> insert_return_type insert_or_cvisit(node_type&& nh, F f); ```
199/1610 · 161
283
:1239
English
```c++ template<class... Args> bool try_emplace(const key_type& k, Args&&... args); template<class... Args> bool try_emplace(key_type&& k, Args&&... args); template<class K, class... Args> bool try_emplace(K&& k, Args&&... args); ```
322/2330 · 233
283
:1046
English
```c++ std::pair<iterator, iterator> equal_range(const key_type& k); std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const; template<class K> std::pair<iterator, iterator> equal_range(const K& k); template<class K> std::pair<const_iterator, const_iterator> equal_range(const K& k) const; ```
454/3440 · 344
283
:1066
English
Iterators to non-transferred elements in `source` remain valid.
28/630 · 63
:1150
:1150
English
---
3/100 · 3
283
:1158
English
Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; A node extracted using this method can be inserted into a compatible `unordered_multimap`. + + The `template<class K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. 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.
379/7070 · 707
284
:445
English
Release 1.36.0
9/140 · 14
284
:1155
English
Inserts an element constructed from `std::forward<K>(k)` in the container if and only if there is no element in the container with an equivalent key, and then invokes `f1` with a const reference to the newly created element. Otherwise, invokes `f2` with a const reference to the equivalent element.
95/2980 · 298
284
:1108
English
Erases all elements in the container.
11/370 · 37
284
:1075
English
Postconditions:;; `size() == 0` Throws:;; Never throws an exception.
31/680 · 68
284
:1220
English
Inserts an object, constructed with the arguments `args`, in the table if there is no element in the table with an equivalent key, 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 `emplace_and_cvisit` is used.
112/3350 · 335
284
:1071
English
Requires:;; `this\->get_allocator() == source.get_allocator()`. Notes:;; Invalidates iterators to the elements transferred. If the resulting size of `*this` is greater than its original maximum load, invalidates all iterators associated to `*this`.
126/2480 · 248