User avatar admin

Translation uploaded
If the insertion failed, `inserted` is false and `node` has the previous value of `nh`.
If the insertion failed,若插入操作失败，则 `inserted` is为 false and，且 `node` has the previous value of `nh`.保留 `nh` 的原值。
:1040
06/05/2026
User avatar admin

Translation uploaded
Otherwise if the insertion took place, `inserted` is true and `node` is empty.
Otherwise if the insertion took place,若插入操作成功，则 `inserted` is为 true and， 且 `node` is empty.为空。
:1039
06/05/2026
User avatar admin

Translation uploaded
If `nh` is empty, `inserted` is `false` and `node` is empty.
If若 `nh` is empty,为空，则 `inserted` is为 `false` and且 `node` is empty.为空。
:1038
06/05/2026
User avatar admin

Translation uploaded
Returns:;; An `insert_return_type` object constructed from `inserted` and `node`: +
Returns:;; An返回值：;; 由 `insert_return_type` object constructed from `inserted` and `node`: +ed` 和 `node` 构造的 `insert_return_type` 对象。
:1037
06/05/2026
User avatar admin

Translation uploaded
If `nh` is not empty, inserts the associated element in the table if and only if there is no element in the table with a key equivalent to `nh.value()`. `nh` is empty when the function returns.
If若 `nh` is not empty, inserts the associated element in the table if and only if there is no element in the table with a key equivalent to `nh.value()`. `nh` is empty when the function returns.非空，则当且仅当哈希表中不存在与 `nh.value()` 键等价的元素时，将其关联元素插入哈希表。函数返回时 `nh` 变为空。
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 Node
Insert Node节点插入
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; The number of elements inserted.
Returns:;; The number of elements inserted.返回值：;; 成功插入的元素个数。
:1024
06/05/2026
User avatar admin

Translation uploaded
Equivalent to [listing,subs="+macros,+quotes"]
Equivalent to等价于 [listing,subs="+macros,+quotes"]
:1017
06/05/2026
User avatar admin

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

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

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

Translation uploaded
Returns:;; The number of elements inserted.
Returns:;; The number of elements inserted.返回值：;; 成功插入的元素数量。
:1008
06/05/2026
User avatar admin

Translation uploaded
Equivalent to [listing,subs="+macros,+quotes"]
Equivalent to等价于 [listing,subs="+macros,+quotes"]
:1001
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class InputIterator> size_type insert(InputIterator first, InputIterator last); ```
```c++ template<class IinputIiterator=""> size_type 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
---
---
:994
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:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; This 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.
Requires:要求：;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; This overload only participates in overload resolution if可通过 `k` 原位构造。
返回值：;; 若成功插入元素则返回 `true`。
并发特性：;; 会阻塞当前对象 `*this` 的扩容重哈希操作。
注意：;; 仅当 `Hash::is_transparent` and和 `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both为合法成员别名时，该重载版本参与重载决议。库假定 `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
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>
06/05/2026

Search