User avatar admin

Translation uploaded
If `nh` is empty, has no effect.
If若 `nh` is empty, has no effect.为空节点，则此操作不产生任何效果。
:982
06/05/2026
User avatar admin

Translation uploaded
```c++ iterator insert(const_iterator hint, node_type&& nh); ```
```c++ iterator insert(const_iterator hint, node_type&&& nh); ```
06/05/2026
User avatar admin

Translation uploaded
Insert with Hint and `node_handle`
Insert with Hint and带提示和 `node_++_++handle` 的插入
06/05/2026
User avatar admin

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

Translation uploaded
Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty, returns an `insert_return_type` with: `inserted` equal to `false`, `position` equal to `end()` and `node` empty. + + Otherwise if there was already an element with an equivalent key, returns an `insert_return_type` with: `inserted` equal to `false`, `position` pointing to a matching element and `node` contains the node from `nh`. + + Otherwise if the insertion succeeded, returns an `insert_return_type` with: `inserted` equal to `true`, `position` pointing to the newly inserted element and `node` empty. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; 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. + + In C++17 this can be used to insert a node extracted from a compatible `unordered_multiset`, but that is not supported yet.
Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty, returns an要求：`nh` 为空或 `nh.get_allocator()` 与容器的分配器相等。返回：若 `nh` 为空，则返回一个 `insert_return_type` with: ，其中：`inserted` equal to为 `false`, ，`position` equal to等于 `end()` and ，`node` empty. + + Otherwise if there was already an element with an equivalent key, returns an为空。+ +否则若已存在等价的键，则返回一个 `insert_return_type` with: ，其中：`inserted` equal to为 `false`, ，`position` pointing to a matching element and `node` contains the node from `nh`. + + Otherwise if the insertion succeeded, returns an指向匹配的元素，`node` 包含 `nh` 中的节点。+ +否则若插入成功，则返回一个 `insert_return_type` with: ，其中：`inserted` equal to为 `true`, ，`position` pointing to the newly inserted element and `node` empty. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; 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. + + In C++17 this can be used to insert a node extracted from a compatible `unordered_multiset`, but that is not supported yet.指向新插入的元素，`node` 为空。抛出：若调用 `hasher` 以外的操作抛出异常，则函数无效果。说明：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。+ +指向元素的指针和引用永远不会失效。+ +在 C++17 中，该函数可用于插入从兼容的 `unordered_multiset` 中提取的节点，但该功能尚未支持。
06/05/2026
User avatar admin

Translation uploaded
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.否则，当且仅当容器中不存在等价键的元素时，才会插入 `nh` 所拥有的元素。
:959
06/05/2026
User avatar admin

Translation uploaded
If `nh` is empty, has no effect.
If若 `nh` is empty, has no effect.为空节点，则此操作不产生任何效果。
:957
06/05/2026
User avatar admin

Translation uploaded
```c++ insert_return_type insert(node_type&& nh); ```
```c++ insert_return_type insert(node_type&&& nh); ```
06/05/2026
User avatar admin

Translation uploaded
Insert with `node_handle`
Insert with通过 `node_++_++handle` 插入
06/05/2026
User avatar admin

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

Translation uploaded
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:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_multiset`, but that is not supported yet. + + 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.
Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`. Throws:;; Only throws an exception if it is thrown by返回：若找到元素，则返回拥有该元素的 `node_type`；否则返回空 `node_type`。抛出：仅当 `hasher` or或 `key_equal`. Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_multiset`, but that is not supported yet. + + The `template<class K>` overload only participates in overload resolution if 抛出异常时才会抛出异常。说明：在 C++17 中，通过此方法提取的节点可以插入到兼容的 `unordered_multiset` 中，但该功能尚未支持。+ +`template<class k="">` 重载仅在以下条件下参与重载决议：`Hash::is_transparent` and和 `Pred::is_transparent` are valid member typedefs and neither是有效的成员 typedef，且 `iterator` nor和 `const_iterator` are implicitly convertible from `K`. The library assumes that `Hash` is callable with both均不能从 `K` 隐式转换。库假定 `Hash` 可同时以 `K` and和 `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.调用，且 `Pred` 是透明的。这实现了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
06/05/2026
User avatar admin

Translation uploaded
Removes an element with key equivalent to `k`.
Removes an element with key equivalent to `k`.移除键等价于 `k` 的元素。
06/05/2026
User avatar admin

Translation uploaded
```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ```
```c++ node_type extract(const key_type&amp; k); template<class Kk=""> node_type extract(K&& k); ```amp;&amp; k); ```</class>
06/05/2026
User avatar admin

Translation uploaded
Extract by Value
Extract by Value通过键值提取元素
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; A `node_type` owning the element. Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_multiset`, but that is not supported yet.
Returns:;; A `node_type` owning the element. Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_multiset`, but that is not supported yet.返回：一个拥有该元素的 `node_type`。说明：在 C++17 中，通过此方法提取的节点可以插入到兼容的 `unordered_multiset` 中，但该功能尚未支持。
06/05/2026
User avatar admin

Translation uploaded
Removes the element pointed to by `position`.
Removes the element pointed to by移除由 `position`. 指向的元素。
06/05/2026
User avatar admin

Translation uploaded
```c++ node_type extract(const_iterator position); ```
```c++ node_type extract(const_iterator position); ```
06/05/2026
User avatar admin

Translation uploaded
Extract by Iterator
Extract by Iterator通过迭代器提取
06/05/2026
User avatar admin

Translation uploaded
---
---
:920
06/05/2026

Search