User avatar admin

Translation uploaded
Insert Initializer List and Visit
Insert Initializer List and Visit初始化列表插入并访问
06/05/2026
User avatar admin

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

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

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

Translation uploaded
```c++ template<class InputIterator,class F1, class F2> size_type insert_and_visit(InputIterator first, InputIterator last, F1 f1, F2 f2); template<class InputIterator,class F1, class F2> size_type insert_and_cvisit(InputIterator first, InputIterator last, F1 f1, F2 f2); ```
```c++ template<class IinputIiterator,class F1, class F2="" f1,="" class="" f2=""> size_type insert_and_visit(InputIterator first, InputIterator last, F1 f1, F2 f2); template<class IinputIiterator,class F1, class F2="" f1,="" class="" f2=""> size_type insert_and_cvisit(InputIterator first, InputIterator last, F1 f1, F2 f2); ```</class></class>
06/05/2026
User avatar admin

Translation uploaded
Insert Iterator Range and Visit
Insert Iterator Range and Visit迭代器范围插入并访问
06/05/2026
User avatar admin

Translation uploaded
---
---
:1167
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:;; Invalidates pointers and references to elements if a rehashing is issued. + + These overloads only participate 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可由 `k` 进行 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:;; Invalidates pointers and references to elements if a rehashing is issued. + + These overloads only participate in overload resolution if构造。
返回值：;; 执行插入操作则返回 `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` 类型对象的开销。
:1160
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, and then invokes `f1` with a const reference to the newly created element. Otherwise, invokes `f2` with a const reference to the equivalent element.
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, and then invokes `f1` with a const reference to the newly created element. Otherwise, invokes `f2` with a const reference to the equivalent element.构造的元素插入容器，随后使用新建元素的常量引用调用`f1`；否则使用等价元素的常量引用调用`f2`。</k>
06/05/2026
User avatar admin

Translation uploaded
```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); ```
```c++ template<class K,k,="" class F1, class F2="" f1,="" f2=""> bool insert_and_visit(K&&amp;&amp; k, F1 f1, F2 f2); template<class K,k,="" class F1, class F2="" f1,="" f2=""> bool insert_and_cvisit(K&&amp;&amp; k, F1 f1, F2 f2); ```</class></class>
06/05/2026
User avatar admin

Translation uploaded
Transparent insert_and_[c]visit
Transparent insert_and_[c]visit透明 insert++_++and++_[++c++]++visit（透明插入并 ++[++c++]++ 访问）
06/05/2026
User avatar admin

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

Translation uploaded
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; Invalidates pointers and references to elements if a rehashing is issued.
Requires:要求：;; `value_type` is满足 https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; Invalidates pointers and references to elements if a rehashing is issued.。
返回值：;; 执行插入操作则返回 `true`。
并发特性：;; 对 `*this` 执行重哈希时会阻塞。
备注：;; 执行重哈希后，指向元素的指针和引用将会失效。
:1142
06/05/2026
User avatar admin

Translation uploaded
Inserts `obj` in the table if and only if there is no element in the table 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.
Inserts `obj` in the table if and only if there is no element in the table 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.当且仅当表中不存在键等价的元素时，将`obj`插入表中，随后使用新建元素的常量引用调用`f1`；否则使用等价元素的常量引用调用`f2`。
:1137
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class F1, class F2> bool insert_and_visit(value_type&& obj, F1 f1, F2 f2); template<class F1, class F2> bool insert_and_cvisit(value_type&& obj, F1 f1, F2 f2); ```
```c++ template<class Ff1,="" class F2="" f2=""> bool insert_and_visit(value_type&&amp;&amp; obj, F1 f1, F2 f2); template<class Ff1,="" class F2="" f2=""> bool insert_and_cvisit(value_type&&amp;&amp; obj, F1 f1, F2 f2); ```</class></class>
06/05/2026
User avatar admin

Translation uploaded
Move insert_and_[c]visit
Move移动 insert_and_[c]++_++and++_[++c++]++visit
06/05/2026
User avatar admin

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

Translation uploaded
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; Invalidates pointers and references to elements if a rehashing is issued.
Requires:前置要求：;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; Invalidates pointers and references to elements if a rehashing is issued.满足可复制插入要求。
返回值：;; 成功插入元素时返回 `true`。
并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。
注意：;; 若执行重哈希，将使指向元素的指针和引用失效。
:1124
06/05/2026
User avatar admin

Translation uploaded
Inserts `obj` in the table if and only if there is no element in the table 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.
Inserts `obj` in the table if and only if there is no element in the table 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.当且仅当哈希表中不存在等价键的元素时，将 `obj` 插入表中，随后以新创建元素的常量引用为参数调用函数 `f1`；否则，以等价元素的常量引用为参数调用函数 `f2`。
:1119
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class F1, class F2> bool insert_and_visit(const value_type& obj, F1 f1, F2 f2); template<class F1, class F2> bool insert_and_cvisit(const value_type& obj, F1 f1, F2 f2); ```
```c++ template<class Ff1,="" class F2="" f2=""> bool insert_and_visit(const value_type&amp; obj, F1 f1, F2 f2); template<class Ff1,="" class F2="" f2=""> bool insert_and_cvisit(const value_type&amp; obj, F1 f1, F2 f2); ```</class></class>
06/05/2026

Search