User avatar admin

Translation uploaded
```c++ template<class ExecutionPolicy, class F> bool visit_while(ExecutionPolicy&& policy, F f); template<class ExecutionPolicy, class F> bool visit_while(ExecutionPolicy&& policy, F f) const; template<class ExecutionPolicy, class F> bool cvisit_while(ExecutionPolicy&& policy, F f) const; ```
```c++ template<class EexecutionPpolicy,="" class F="" f=""> bool visit_while(ExecutionPolicy&&amp;&amp; policy, F f); template<class EexecutionPpolicy,="" class F="" f=""> bool visit_while(ExecutionPolicy&&amp;&amp; policy, F f) const; template<class EexecutionPpolicy,="" class F="" f=""> bool cvisit_while(ExecutionPolicy&&amp;&amp; policy, F f) const; ```</class></class></class>
06/05/2026
User avatar admin

Translation uploaded
Parallel [c]visit_while
Parallel [c]visit_并行 ++[++c++]++visit++_++while
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; `false` iff `f` ever returns `false`.
Returns:;; `false` iff `f` ever returns返回值：;; 当且仅当 `f` 曾返回 `false` 时，返回 `false`.。
06/05/2026
User avatar admin

Translation uploaded
Successively invokes `f` with references to each of the elements in the table until `f` returns `false` or all the elements are visited. Such references to the elements are const iff `*this` is const.
Successively invokes `f` with references to each of the elements in the table until `f` returns `false` or all the elements are visited. Such references to the elements are const iff `*this` is const.依次以哈希表中每个元素的引用调用函数 `f`，直到 `f` 返回 `false` 或遍历完所有元素。当且仅当 `*this` 为常量时，元素的引用为常量引用。
06/05/2026
User avatar admin

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

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

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

Translation uploaded
Throws:;; Depending on the exception handling mechanism of the execution policy used, may call `std::terminate` if an exception is thrown within `f`. Notes:;; Only available in compilers supporting C++17 parallel algorithms. + + These overloads only participate in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `true`. + + Unsequenced execution policies are not allowed.
Throws:;; Depending on the exception handling mechanism of the execution policy used, may call `std::terminate` if an exception is thrown within `f`. Notes:;; Only available in compilers supporting C++17 parallel algorithms. + + These overloads only participate in overload resolution if抛出异常：;; 依据所使用执行策略的异常处理机制，若 `f` 内部抛出异常，则可能调用 `std::terminate`。
注意：;; 仅在支持 C++17 并行算法的编译器中可用。
仅当 `std::is_execution_policy_v<std::remove_cvref_t<EexecutionPpolicy>>` is `true`. + + Unsequenced &gt;` 为 `true` 时，这些重载版本才参与重载决议。
不允许使用无序执行策略。</std::remove_cvref_t<execution policies are not allowed.y>
06/05/2026
User avatar admin

Translation uploaded
Invokes `f` with references to each of the elements in the table. Such references are const iff `*this` is const. Execution is parallelized according to the semantics of the execution policy specified.
Invokes `f` with references to each of the elements in the table. Such references are const iff `*this` is const. Execution is parallelized according to the semantics of the execution policy specified.以表中每个元素的引用调用函数 `f`。当且仅当 `*this` 为常量时，该引用为常量引用。执行过程将根据指定执行策略的语义进行并行化处理。
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class ExecutionPolicy, class F> void visit_all(ExecutionPolicy&& policy, F f); template<class ExecutionPolicy, class F> void visit_all(ExecutionPolicy&& policy, F f) const; template<class ExecutionPolicy, class F> void cvisit_all(ExecutionPolicy&& policy, F f) const; ```
```c++ template<class EexecutionPpolicy,="" class F="" f=""> void visit_all(ExecutionPolicy&&amp;&amp; policy, F f); template<class EexecutionPpolicy,="" class F="" f=""> void visit_all(ExecutionPolicy&&amp;&amp; policy, F f) const; template<class EexecutionPpolicy,="" class F="" f=""> void cvisit_all(ExecutionPolicy&&amp;&amp; policy, F f) const; ```</class></class></class>
06/05/2026
User avatar admin

Translation uploaded
Parallel [c]visit_all
Parallel [c]visit_并行 ++[++c++]++visit++_++all
06/05/2026
User avatar admin

Translation uploaded
---
---
:892
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 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` 为常量时，该引用为常量引用。
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
---
---
:876
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），或满足 C++20 及之后标准的 `std::forward_iterator` 概念。
对于 `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_node_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_node_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_node_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_node_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

Search