User avatar admin

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

Translation uploaded
---
---
:783
06/05/2026
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 const references to each of the elements in the table.
Successively invokes `f` with const references to each of the elements in the table.依次以指向哈希表中每个元素的常量引用调用函数 `f`。
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
---
---
:768
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是一个传统前向迭代器（C++11 至 C++17），或满足 `std::forward_iterator` 要求（C++20 及更高版本）。
对于 `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是有效的成员别名。
在后一种情况下，库假定 `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_set_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_set_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_set_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_set_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 const reference to `x`.
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 const reference to `x`.)` 中的每个元素 `k`，若容器中存在键与 `k` 等价的元素 `x`，则以指向 `x` 的常量引用调用函数 `f`。
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
---
---
:733
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 `template<class K, class F>` overloads only participate in overload resolution if返回值：;; 访问到的元素数量（0 或 1）。
注意：;; 仅当 `Hash::is_transparent` and与 `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both为合法成员别名时，`template<class k,="" class="" f="">` 重载版本才会参与重载决议。库假定 `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` 类型对象的开销。</class>
06/05/2026
User avatar admin

Translation uploaded
If an element `x` exists with key equivalent to `k`, invokes `f` with a const reference to `x`.
If an element `x` exists with key equivalent to `k`, invokes `f` with a const reference to `x`.若存在键与 `k` 等价的元素 `x`，则以指向 `x` 的常量引用调用函数 `f`。
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
---
---
:712
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

Search