User avatar admin

Translation uploaded
Loading an unordered_multimap from an archive
Loading an从归档加载 unordered_multimap from an archive
06/05/2026
User avatar admin

Translation uploaded
---
---
:1509
06/05/2026
User avatar admin

Translation uploaded
Requires:;; `std::remove_const<key_type>::type` and `std::remove_const<mapped_type>::type` are serializable (XML serializable), and they do support Boost.Serialization `save_construct_data`/`load_construct_data` protocol (automatically suported by https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^] types).
Requires:;; 要求：`std::remove_const<key_type>::type` and和 `std::remove_const<mapped_type>::type` are serializable (XML serializable), and they do support必须是可序列化的（对于 XML 归档需支持 XML 序列化），并且它们必须支持 Boost.Serialization 的 `save_construct_data`/`load_construct_data` protocol (automatically suported by协议（该协议由满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^] types).可默认构造^] 的类型自动支持）。</mapped_type></key_type>
06/05/2026
User avatar admin

Translation uploaded
Saves all the elements of an `unordered_multimap` `x` to an archive (XML archive) `ar`.
Saves all the elements of an将 `unordered_multimap` 容器 `x` to an archive (XML archive)的所有元素保存到归档（XML 归档） `ar`. 中。
06/05/2026
User avatar admin

Translation uploaded
Saving an unordered_multimap to an archive
Saving an将 unordered_multimap to an archive保存到归档
06/05/2026
User avatar admin

Translation uploaded
``unordered_multimap``s can be archived/retrieved by means of link:../../../../../serialization/index.html[Boost.Serialization^] using the API provided by this library. Both regular and XML archives are supported.
``unordered_multimap``s can be archived/retrieved by means of 可以通过本库提供的 API，借助 link:../../../../../serialization/index.html[Boost.Serialization^] using the API provided by this library. Both regular and XML archives are supported.进行归档/恢复。支持常规归档和 XML 归档。
06/05/2026
User avatar admin

Translation uploaded
Serialization
Serialization序列化
06/05/2026
User avatar admin

Translation uploaded
Returns:;; The number of erased elements. Notes:;; Equivalent to: + + ```c++ auto original_size = c.size(); for (auto i = c.begin(), last = c.end(); i != last; ) { if (pred(*i)) { i = c.erase(i); } else { ++i; } } return original_size - c.size(); ``` + Note that the references passed to `pred` are non-const.
Returns:;; The number of erased elements. Notes:;; Equivalent to: + + 返回：被擦除的元素数量。 注意：等价于：
```c++ auto original_size = c.size(); for (auto i = c.begin(), last = c.end(); i != last; ) { if (pred(*i)) { i = c.erase(i); } else { ++i; } } }}return original_size - c.size();
``` + Note that the references passed to `pred` are non-const. 注意，传递给 `pred` 的引用是非常量的。
06/05/2026
User avatar admin

Translation uploaded
Traverses the container `c` and removes all elements for which the supplied predicate returns `true`.
Traverses the container `c` and removes all elements for which the supplied predicate returns遍历容器 `c`，并移除所有使给定谓词返回 `true`. 的元素。
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class K, class T, class H, class P, class A, class Predicate> typename unordered_multimap<K, T, H, P, A>::size_type erase_if(unordered_multimap<K, T, H, P, A>& c, Predicate pred); ```
```c++ template<class K,k,="" class T, class H, class P, class A, class P="" t,="" h,="" p,="" a,="" predicate=""> typename unordered_multimap<K, T, H, P, Ak, t,="" h,="" p,="" a="">::size_type erase_if(unordered_multimap<K, T, H, P, A>&k, t,="" h,="" p,="" a="">&amp; c, Predicate pred); ```</k,></k,></class>
06/05/2026
User avatar admin

Translation uploaded
erase_if
erase_if
06/05/2026
User avatar admin

Translation uploaded
---
---
:1463
06/05/2026
User avatar admin

Translation uploaded
Effects:;; `x.swap(y)` Throws:;; Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of `key_equal` or `hasher`. Notes:;; The exception specifications aren't quite the same as the C++11 standard, as the equality predicate and hash function are swapped using their copy constructors.
Effects:;; 效果：`x.swap(y)` Throws:;; Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of
抛出：除非 `key_equal` or或 `hasher`. Notes:;; The exception specifications aren't quite the same as the C++11 standard, as the equality predicate and hash function are swapped using their copy constructors. 的拷贝构造函数或拷贝赋值运算符抛出异常，否则不抛出任何异常。
注意：异常规范与 C++11 标准不完全相同，因为相等谓词和哈希函数是使用其拷贝构造函数进行交换的。
06/05/2026
User avatar admin

Translation uploaded
If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the containers' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior.
If如果 `Allocator::propagate_on_container_swap` is declared and被声明且 `Allocator::propagate_on_container_swap::value` is为 `true` then the containers' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior.，则交换容器的分配器。否则，使用不相等的分配器进行交换将导致未定义行为。
:1456
06/05/2026
User avatar admin

Translation uploaded
Swaps the contents of `x` and `y`.
Swaps the contents of `x` and `y`.交换 x 和 y 的内容。
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class Key, class T, class Hash, class Pred, class Alloc> void swap(unordered_multimap<Key, T, Hash, Pred, Alloc>& x, unordered_multimap<Key, T, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```
```c++ template<class Kkey,="" class T, class Hash, class Pred, class A="" t,="" hash,="" pred,="" alloc=""> void swap(unordered_multimap<Kkey, T, Hash, Pred, Alloc>&t,="" hash,="" pred,="" alloc="">&amp; x, unordered_multimap<Kkey, T, Hash, Pred, Alloc>&t,="" hash,="" pred,="" alloc="">&amp; y) noexcept(noexcept(x.swap(y))); ```</key,></key,></class>
06/05/2026
User avatar admin

Translation uploaded
Swap
Swap交换
06/05/2026
User avatar admin

Translation uploaded
---
---
:1444
06/05/2026
User avatar admin

Translation uploaded
Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.
Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.注意：如果两个容器不具有等价的相等谓词，则行为未定义。
:1442
06/05/2026
User avatar admin

Translation uploaded
Return `false` if `x.size() == y.size()` and for every equivalent key group in `x`, there is a group in `y` for the same key, which is a permutation (using `operator==` to compare the value types).
Return `false` if若 `x.size() == y.size()` and for every equivalent key group in `x`, there is a group in `y` for the same key, which is a permutation (using `operator==` to compare the value types).且对于 `x` 中的每个等价键组，在 `y` 中均存在一个具有相同键的组，并且该组是 `x` 中对应组的置换（使用 `operator==` 比较值类型），则返回 `false`。
06/05/2026

Search