User avatar admin

Translation uploaded
Returns:;; The number of elements visited.
Returns:;; The number of elements visited.返回值：访问到的元素数量。
06/05/2026
User avatar admin

Translation uploaded
Successively invokes `f` with references to each of the elements in the table. Such references are const iff `*this` is const.
Successively invokes `f` with references to each of the elements in the table. Such references are const iff `*this` is const.依次以表中每个元素的引用调用函数 f。
当且仅当当前容器 *this 为常量（const）时，该引用为常量引用。
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class F> size_t visit_all(F f); template<class F> size_t visit_all(F f) const; template<class F> size_t cvisit_all(F f) const; ```
```c++ template<class Ff=""> size_t visit_all(F f); template<class Ff=""> size_t visit_all(F f) const; template<class Ff=""> size_t cvisit_all(F f) const; ```</class></class></class>
06/05/2026
User avatar admin

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

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

Translation uploaded
Requires:;; `FwdIterator` is a https://en.cppreference.com/w/cpp/named_req/ForwardIterator[LegacyForwardIterator^] ({cpp}11 to {cpp}17), or satisfies https://en.cppreference.com/w/cpp/iterator/forward_iterator[std::forward_iterator^] ({cpp}20 and later). For `K` = `std::iterator_traits<FwdIterator>::value_type`, either `K` is `key_type` or else `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. In the latter case, 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:;; The number of elements visited.
Requires:;; 要求：`FwdIterator` is a需满足 https://en.cppreference.com/w/cpp/named_req/ForwardIterator[LegacyForwardIterator^] (遗留向前迭代器^] 要求（{cpp}11 to至 {cpp}17), or satisfies），或满足 https://en.cppreference.com/w/cpp/iterator/forward_iterator[`std::forward_iterator`^] (要求（{cpp}20 and later). For及更高版本）。对于 `K` = `std::iterator_traits<FwdIfwditerator>::value_type`, either，要么 `K` is是 `key_type` or else，要么 `Hash::is_transparent` and和 `Pred::is_transparent` are valid member typedefs. In the latter case, the library assumes that `Hash` is callable with both是有效的成员 typedef。在后一种情况下，库假定 `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. Returns:;; The number of elements visited.调用，且 `Pred` 是透明的。该机制支持异构查找，从而避免实例化 `Key` 类型的开销。返回：被访问的元素数量。</fwditerator>
06/05/2026
User avatar admin

Translation uploaded
Although functionally equivalent to individually invoking xref:concurrent_flat_map_cvisit[`[c\]visit`] for each key, bulk visitation performs generally faster due to internal streamlining optimizations. It is advisable that `std::distance(first,last)` be at least xref:#concurrent_flat_map_constants[`bulk_visit_size`] to enjoy a performance gain: beyond this size, performance is not expected to increase further.
Although functionally equivalent to individually invoking xref:concurrent_flat_map_cvisit[`尽管功能上等价于对每个键单独调用 [c\]visit`] for each key, bulk visitation performs generally faster due to internal streamlining optimizations. It is advisable that `std::distance(first,last)` be at least xref:#concurrent_flat_map_constants[`bulk_visit_size`] to enjoy a performance gain: beyond this size, performance is not expected to increase further.，但批量访问因内部流线型优化，通常性能更高。
建议 std::distance(first,last) 至少达到 bulk_visit_size 阈值时再使用，以获得性能提升；超过该大小后，性能不会进一步提升。
06/05/2026
User avatar admin

Translation uploaded
For each element `k` in the range [`first`, `last`), if there is an element `x` in the container with key equivalent to `k`, invokes `f` with a reference to `x`. Such reference is const iff `*this` is const.
For each element `k` in the range对范围 [`first`, `last`), if there is an element `x` in the container with key equivalent to `k`, invokes `f` with a reference to `x`. Such reference is const iff `*this` is const.) 中的每个键 k：
如果容器中存在键与 k 等价的元素 x，则以 x 的引用调用函数 f。
当且仅当当前容器 *this 为常量（const）时，该引用为常量引用。
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class FwdIterator, class F> size_t visit(FwdIterator first, FwdIterator last, F f); template<class FwdIterator, class F> size_t visit(FwdIterator first, FwdIterator last, F f) const; template<class FwdIterator, class F> size_t cvisit(FwdIterator first, FwdIterator last, F f) const; ```
```c++ template<class FwdIfwditerator,="" class F="" f=""> size_t visit(FwdIterator first, FwdIterator last, F f); template<class FwdIfwditerator,="" class F="" f=""> size_t visit(FwdIterator first, FwdIterator last, F f) const; template<class FwdIfwditerator,="" class F="" f=""> size_t cvisit(FwdIterator first, FwdIterator last, F f) const; ```</class></class></class>
06/05/2026
User avatar admin

Translation uploaded
Bulk visit
Bulk visit批量访问
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; The number of elements visited (0 or 1). Notes:;; The `template<class K, class F>` 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.
Returns:;; The number of elements visited (0 or 1). Notes:;; The `返回值：访问过的元素数量（0 或 1）。
注意：template<class K,k,="" class F>` overloads only participate in overload resolution if `="" f=""> 形式的重载仅在 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. 为合法成员别名时才参与重载决议。
库假定 Hash 可同时用于 K 类型与 Key 类型，且 Pred 是透明的。
这支持异构查找，避免了实例化 Key 类型对象带来的开销。</class>
06/05/2026
User avatar admin

Translation uploaded
If an element `x` exists with key equivalent to `k`, invokes `f` with a reference to `x`. Such reference is const iff `*this` is const.
If an element `x` exists with key equivalent to `k`, invokes `f` with a reference to `x`. Such reference is const iff `*this` is const.若存在键与 k 等价的元素 x，则以 x 的引用调用函数 f。
当且仅当当前容器 *this 为常量（const）时，该引用为常量引用。
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class F> size_t visit(const key_type& k, F f); template<class F> size_t visit(const key_type& k, F f) const; template<class F> size_t cvisit(const key_type& k, F f) const; template<class K, class F> size_t visit(const K& k, F f); template<class K, class F> size_t visit(const K& k, F f) const; template<class K, class F> size_t cvisit(const K& k, F f) const; ```
```c++ template<class Ff=""> size_t visit(const key_type&amp; k, F f); template<class Ff=""> size_t visit(const key_type&amp; k, F f) const; template<class Ff=""> size_t cvisit(const key_type&amp; k, F f) const; template<class K,k,="" class F="" f=""> size_t visit(const K&amp; k, F f); template<class K,k,="" class F="" f=""> size_t visit(const K&amp; k, F f) const; template<class K,k,="" class F="" f=""> size_t cvisit(const K&amp; k, F f) const; ```</class></class></class></class></class></class>
06/05/2026
User avatar admin

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

Translation uploaded
Visitation
Visitation访问操作
06/05/2026
User avatar admin

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

Translation uploaded
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] Concurrency:;; Blocking on `*this`.
Requires:;; 要求：`value_type` is需满足 https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] Concurrency:;; Blocking on可复制插入^] 要求。并发：阻塞 `*this`.。
06/05/2026
User avatar admin

Translation uploaded
Assign from values in initializer list. All previously existing elements are destroyed.
Assign from values in initializer list. All previously existing elements are destroyed.并发：阻塞于 *this 和 other。
从初始化列表赋值。销毁所有先前存在的元素。
06/05/2026
User avatar admin

Translation uploaded
```c++ concurrent_flat_map& operator=(std::initializer_list<value_type> il); ```
```c++ concurrent_flat_map&amp; operator=(std::initializer_list<value_type> il); ```</value_type>
06/05/2026

Search