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
User avatar admin

Translation uploaded
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] into the container. Throws:;; When inserting a single element, 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.
Requires:;; 要求：`value_type` is需满足对容器而言的 https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] into the container. Throws:;; When inserting a single element, 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.可复制插入^] 要求。抛出：当插入单个元素时，若调用 `hasher` 以外的操作抛出异常，则函数无效果。说明：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。+ +指向元素的指针和引用永远不会失效。
06/05/2026
User avatar admin

Translation uploaded
Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.
Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.将元素范围插入容器中。仅当容器中不存在等价键的元素时，才会插入相应元素。
:911
06/05/2026
User avatar admin

Translation uploaded
```c++ void insert(std::initializer_list<value_type>); ```
```c++ void insert(std::initializer_list<value_type>); ```</value_type>
06/05/2026
User avatar admin

Translation uploaded
Insert Initializer List
Insert Initializer List初始化列表插入
06/05/2026
User avatar admin

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

Translation uploaded
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `*first`. Throws:;; When inserting a single element, 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.
Requires:;; 要求：`value_type` is需从 `*first` 处满足对 `X` 的 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `*first`. Throws:;; When inserting a single element, 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.可原位构造^] 要求。抛出：当插入单个元素时，若调用 `hasher` 以外的操作抛出异常，则函数无效果。说明：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。+ +指向元素的指针和引用永远不会失效。
06/05/2026
User avatar admin

Translation uploaded
Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.
Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.将元素范围插入容器中。仅当容器中不存在等价键的元素时，才会插入相应元素。
:895
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class InputIterator> void insert(InputIterator first, InputIterator last); ```
```c++ template<class IinputIiterator=""> void insert(InputIterator first, InputIterator last); ```</class>
06/05/2026
User avatar admin

Translation uploaded
Insert Iterator Range
Insert Iterator Range迭代器范围插入
06/05/2026
User avatar admin

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

Translation uploaded
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. 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. + + This 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.
Requires:;; 要求：`value_type` is需从 `k` 处满足对容器的 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. 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. + + This overload only participates in overload resolution if 可原位构造^] 要求。返回：若执行了插入，则迭代器指向新插入的元素；否则指向等价的元素。抛出：若调用 `hasher` 以外的操作抛出异常，则函数无效果。说明：标准对 hint 的含义表述相当模糊。但使用它的唯一实际方式，也是 Boost.Unordered 唯一支持的方式，是将其指向具有相同键的现有元素。+ +可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。+ +指向元素的指针和引用永远不会失效。+ +此重载仅在以下条件下参与重载决议：`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` 类型对象的开销。
06/05/2026
User avatar admin

Translation uploaded
`hint` is a suggestion to where the element should be inserted.
`hint` is a suggestion to where the element should be inserted.是插入元素位置的建议。
:874
06/05/2026
User avatar admin

Translation uploaded
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.
Inserts an element constructed from当且仅当容器中不存在等价键的元素时，插入一个由 `std::forward<Kk>(k)` in the container if and only if there is no element in the container with an equivalent key.构造的元素。</k>
:872
06/05/2026

Search