User avatar admin

Translation uploaded
Copy insert_and_[c]visit
Copy复制 insert_and_[c]++_++and++_[++c++]++visit
06/05/2026
User avatar admin

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

Translation uploaded
Requires:;; `value_type` is constructible from `args`. 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. + + The interface is exposition only, as C++ does not allow to declare parameters `f1` and `f2` after a variadic parameter pack.
Requires:前置要求：;; `value_type` is constructible from `args`. 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. + + The interface is exposition only, as C++ does not allow to declare parameters可由参数 `args` 构造。
返回值：;; 成功插入元素时返回 `true`。
并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。
注意：;; 若执行重哈希，将使指向元素的指针和引用失效。
该接口仅为说明性设计，因为 C++ 不允许在可变参数包之后声明参数 `f1` and和 `f2` after a variadic parameter pack.。
06/05/2026
User avatar admin

Translation uploaded
Inserts an object, constructed with the arguments `args`, in the table 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 an object, constructed with the arguments `args`, in the table 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.若哈希表中不存在等价键的元素，则使用参数 `args` 构造对象并插入表中，随后以新创建元素的常量引用为参数调用函数 `f1`；否则，以等价元素的常量引用为参数调用函数 `f2`。
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class... Args, class F1, class F2> bool emplace_and_visit(Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool emplace_and_cvisit(Args&&... args, F1&& f1, F2&& f2); ```
```c++ template<class... Aargs,="" class F1, class F2="" f1,="" f2=""> bool emplace_and_visit(Args&&amp;&amp;... args, F1&& f1, F2&&amp;&amp; f1, F2&amp;&amp; f2); template<class... Aargs,="" class F1, class F2="" f1,="" f2=""> bool emplace_and_cvisit(Args&&amp;&amp;... args, F1&& f1, F2&& f2); ```amp;&amp; f1, F2&amp;&amp; f2); ```</class...></class...>
06/05/2026
User avatar admin

Translation uploaded
emplace_and_[c]visit
emplace_and_[c]visit
06/05/2026
User avatar admin

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

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

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

Translation uploaded
```c++ template<class F> size_type insert_or_visit(std::initializer_list<value_type> il, F f); template<class F> size_type insert_or_cvisit(std::initializer_list<value_type> il, F f); ```
```c++ template<class Ff=""> size_type insert_or_visit(std::initializer_list<value_type> il, F f); template<class Ff=""> size_type insert_or_cvisit(std::initializer_list<value_type> il, F f); ```</value_type></class></value_type></class>
06/05/2026
User avatar admin

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

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

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

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

Translation uploaded
```c++ template<class InputIterator,class F> size_type insert_or_visit(InputIterator first, InputIterator last, F f); template<class InputIterator,class F> size_type insert_or_cvisit(InputIterator first, InputIterator last, F f); ```
```c++ template<class IinputIiterator,class F="" f=""> size_type insert_or_visit(InputIterator first, InputIterator last, F f); template<class IinputIiterator,class F="" f=""> size_type insert_or_cvisit(InputIterator first, InputIterator last, F f); ```</class></class>
06/05/2026
User avatar admin

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

Translation uploaded
---
---
:1053
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 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可通过 `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` 类型对象的开销。
:1046
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. Otherwise, invokes `f` 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. Otherwise, invokes `f` with a const reference to the equivalent element.构造元素并插入容器；否则，以等价元素的常量引用为参数调用函数 `f`。</k>
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class K, class F> bool insert_or_visit(K&& k, F f); template<class K, class F> bool insert_or_cvisit(K&& k, F f); ```
```c++ template<class K,k,="" class F="" f=""> bool insert_or_visit(K&&amp;&amp; k, F f); template<class K,k,="" class F="" f=""> bool insert_or_cvisit(K&&amp;&amp; k, F f); ```</class></class>
06/05/2026

Search