msgid "" msgstr "" "Project-Id-Version: Chinese (Simplified Han script) (Boost Unordered " "Translation (zh_Hans))\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2026-06-07 03:12+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: Chinese (Simplified Han script) \n" "Language: zh_Hans\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Plural-Forms: nplurals=1; plural=0;\n" "X-Generator: Weblate 2026.5\n" #: :1 #, safe-html, strict-same msgid "[#concurrent_flat_set]" msgstr "[#concurrent_flat_set]" #: :2 #, safe-html, strict-same msgid "Class Template concurrent_flat_set" msgstr "类模板 concurrent++_++flat++_++set" #: :4 #, safe-html, strict-same msgid ":idprefix: concurrent_flat_set_" msgstr ":idprefix: concurrent_flat_set_" #: :6 #, safe-html, strict-same msgid "" "`boost::concurrent_flat_set` — A hash table that stores unique values and " "allows for concurrent element insertion, erasure, lookup and access without " "external synchronization mechanisms." msgstr "" "`boost::concurrent++_++flat++_++set` —— 一种存储唯一值的哈希表，它支持并发的" "元素插入、删除、查找及访问操作，且无需外部同步机制。" #: :10 #, safe-html, strict-same msgid "" "Even though it acts as a container, `boost::concurrent_flat_set` does not " "model the standard C++ https://en.cppreference.com/w/cpp/named_req/" "Container[Container^] concept. In particular, iterators and associated " "operations (`begin`, `end`, etc.) are not provided. Element access is done " "through user-provided _visitation functions_ that are passed to " "`concurrent_flat_set` operations where they are executed internally in a " "controlled fashion. Such visitation-based API allows for low-contention " "concurrent usage scenarios." msgstr "" "尽管 `boost::concurrent++_++flat++_++set` 具备容器特性，但它并不符合 C{plus}" "{plus}标准中的 https://en.cppreference.com/w/cpp/named_req/Container[容器] 概" "念。具体而言，该容器未提供迭代器及相关操作（如 `begin` 、 `end` 等）。元素访" "问通过用户提供的__访问函数__实现，这些函数被传递至 " "`concurrent++_++flat++_++set` 操作中，并在其内部以受控方式执行。这种基于访问" "机制的 API 设计能够有效支持低争用的并发应用场景。" #: :17 #, safe-html, strict-same msgid "" "The internal data structure of `boost::concurrent_flat_set` is similar to " "that of `boost::unordered_flat_set`. As a result of its using open-" "addressing techniques, `value_type` must be move-constructible and pointer " "stability is not kept under rehashing." msgstr "" "`boost::concurrent++_++flat++_++set` 的内部数据结构类似于 " "`boost::unordered++_++flat++_++set` 。由于其采用开放寻址技术， " "`value++_++type` 必须满足可移动构造要求，且在重哈希过程中无法保持指针稳定性。" #: :21 #, safe-html, strict-same msgid "Synopsis" msgstr "概要" #: :279 #, safe-html, strict-same msgctxt ":279" msgid "---" msgstr "---" #: :281 #, safe-html, strict-same msgid "Description" msgstr "描述" #: :283 #, safe-html, strict-same msgid "*Template Parameters*" msgstr "*模板参数*" #: :286 #, safe-html, strict-same msgid "_Key_" msgstr "_键_" #: :286 #, safe-html, strict-same msgid "" "`Key` must be https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^] into the container" msgstr "Key 必须满足" #: :290 #, safe-html, strict-same msgid "" "and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the " "container." msgstr "" "https://en.cppreference.com/w/cpp/named_req/MoveInsertable[可移动插入] 到容器" "中的要求，且需满足从容器中 https://en.cppreference.com/w/cpp/named_req/" "Erasable[可擦除] 的要求。" #: :292 #, safe-html, strict-same msgid "_Hash_" msgstr "_Hash_" #: :292 #, safe-html, strict-same msgid "" "A unary function object type that acts a hash function for a `Key`. It takes " "a single argument of type `Key` and returns a value of type `std::size_t`." msgstr "" "一种为`Key`提供哈希功能的一元函数对象类型。它接受单个`Key`类型参数，并返" "回`std::size_t`类型的值。" #: :292 #, safe-html, strict-same msgid "_Pred_" msgstr "_Pred_" #: :292 #, safe-html, strict-same msgid "" "A binary function object that induces an equivalence relation on values of " "type `Key`. It takes two arguments of type `Key` and returns a value of type " "`bool`." msgstr "" "一种二元函数对象，用于在Key类型的值上构建等价关系。它接受两个Key类型的参数，" "并返回一个bool类型的值。" #: :292 #, safe-html, strict-same msgid "_Allocator_" msgstr "_Allocator_" #: :292 #, safe-html, strict-same msgid "An allocator whose value type is the same as the table's value type." msgstr "值类型与该表的值类型相同的分配器。" #: :300 #, safe-html, strict-same msgid "" "`std::allocator_traits::pointer` and " "`std::allocator_traits::const_pointer` must be convertible to/" "from `value_type*` and `const value_type*`, respectively." msgstr "" "`std::allocator_traits::pointer` 与 " "`std::allocator_traits::const_pointer` 必须分别可与 `value_type*` " "和 `const value_type*` 相互转换。" #: :305 #, safe-html, strict-same msgid "" "The elements of the table are held into an internal _bucket array_. An " "element is inserted into a bucket determined by its hash code, but if the " "bucket is already occupied (a _collision_), an available one in the vicinity " "of the original position is used." msgstr "" "容器的元素存储在内部的桶数组中。元素根据其哈希值被插入到对应的桶中，若该桶已" "被占用（即发生哈希冲突），则使用原位置附近的可用桶。" #: :309 #, safe-html, strict-same msgid "" "The size of the bucket array can be automatically increased by a call to " "`insert`/`emplace`, or as a result of calling `rehash`/`reserve`. The _load " "factor_ of the table (number of elements divided by number of buckets) is " "never greater than `max_load_factor()`, except possibly for small sizes " "where the implementation may decide to allow for higher loads." msgstr "" "调用 `insert`/`emplace` 或执行 `rehash`/`reserve` 操作时，桶数组的大小会自动" "扩容。容器的负载因子（元素数量除以桶数量）永远不会超过 `max_load_factor()`，" "仅在尺寸较小时，实现可能允许更高的负载因子。" #: :314 #, safe-html, strict-same msgid "" "If `link:../../../../../container_hash/doc/html/" "hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]::value` is " "`true`, the hash function is used as-is; otherwise, a bit-mixing post-" "processing stage is added to increase the quality of hashing at the expense " "of extra computational cost." msgstr "" "若 `link:../../../../../container_hash/doc/html/" "hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]::value` 为 " "`true`，则哈希函数直接使用；否则会添加一个位混合后处理阶段，以额外的计算开销" "为代价提升哈希质量。" #: :318 #, safe-html, strict-same msgctxt ":318" msgid "---" msgstr "---" #: :320 #, safe-html, strict-same msgid "Concurrency Requirements and Guarantees" msgstr "并发要求与保证" #: :322 #, safe-html, strict-same msgid "" "Concurrent invocations of `operator()` on the same const instance of `Hash` " "or `Pred` are required to not introduce data races. For `Alloc` being either " "`Allocator` or any allocator type rebound from `Allocator`, concurrent " "invocations of the following operations on the same instance `al` of `Alloc` " "are required to not introduce data races:" msgstr "" "要求对同一 `Hash` 或 `Pred` 常量实例并发调用 `operator()` 时不得引入数据竞争" "。对于 `Alloc` （即 `Allocator` 或其重绑定后的任意分配器类型），在同一实例 " "`al` 上并发调用以下操作时不得引入数据竞争：" #: :327 #, safe-html, strict-same msgid "Copy construction from `al` of an allocator rebound from `Alloc`" msgstr "通过从`Alloc`重新绑定的分配器以`al`进行拷贝构造" #: :328 #, safe-html, strict-same msgid "`std::allocator_traits::allocate`" msgstr "`std::allocator_traits::allocate`" #: :329 #, safe-html, strict-same msgid "`std::allocator_traits::deallocate`" msgstr "`std::allocator_traits::deallocate`" #: :330 #, safe-html, strict-same msgid "`std::allocator_traits::construct`" msgstr "`std::allocator_traits::construct`" #: :331 #, safe-html, strict-same msgid "`std::allocator_traits::destroy`" msgstr "`std::allocator_traits::destroy`" #: :333 #, safe-html, strict-same msgid "" "In general, these requirements on `Hash`, `Pred` and `Allocator` are met if " "these types are not stateful or if the operations only involve constant " "access to internal data members." msgstr "" "通常而言，若 `Hash` 、 `Pred` 和 `Allocator` 这些类型不包含状态，或其操作仅涉" "及对内部数据成员的常量访问，即可满足上述要求。" #: :336 #, safe-html, strict-same msgid "" "With the exception of destruction, concurrent invocations of any operation " "on the same instance of a `concurrent_flat_set` do not introduce data races " "— that is, they are thread-safe." msgstr "" "除析构操作外，对同一个 `concurrent++_++flat++_++set` 实例并发调用任何操作都不" "会引发数据竞争——即这些操作是线程安全的。" #: :339 #, safe-html, strict-same msgid "" "If an operation *op* is explicitly designated as _blocking on_ `x`, where " "`x` is an instance of a `boost::concurrent_flat_set`, prior blocking " "operations on `x` synchronize with *op*. So, blocking operations on the same " "`concurrent_flat_set` execute sequentially in a multithreaded scenario." msgstr "" "若操作 *op* 显式指定为__阻塞于__ 容器 `x` （其中 `x` 是 " "`boost::concurrent++_++flat++_++set` 的实例），则先前对 `x` 的阻塞操作将与 " "*op* 同步。因此，在多线程场景下，对同一 `concurrent++_++flat++_++set` 的阻塞" "操作将按顺序执行。" #: :343 #, safe-html, strict-same msgid "" "An operation is said to be _blocking on rehashing of_ ``__x__`` if it blocks " "on `x` only when an internal rehashing is issued." msgstr "" "若某个操作仅在触发内部重哈希时才会阻塞于 _`x`_，则称该操作__阻塞于 _`x`_ 的重" "哈希过程__。" #: :346 #, safe-html, strict-same msgid "" "When executed internally by a `boost::concurrent_flat_set`, the following " "operations by a user-provided visitation function on the element passed do " "not introduce data races:" msgstr "" "当由 `boost::concurrent++_++flat++_++set` 内部执行时，用户提供的访问函数对传" "入元素的以下操作不会引发数据竞争：" #: :349 #, safe-html, strict-same msgid "Read access to the element." msgstr "对元素的读取访问。" #: :350 #, safe-html, strict-same msgid "Non-mutable modification of the element." msgstr "对元素的非可变修改。" #: :351 #, safe-html, strict-same msgid "Mutable modification of the element:" msgstr "对元素的可变修改：" #: :352 #, safe-html, strict-same msgid "" "** Within a container function accepting two visitation functions, always " "for the first function. ** Within a non-const container function whose name " "does not contain `cvisit`, for the last (or only) visitation function." msgstr "" "** 在容器接受两个访问函数的操作中，此条件始终适用于第一个访问函数。 ** 在名称" "不包含 `cvisit` 的非常量容器函数中，此条件适用于最后一个（或唯一一个）访问函" "数。" #: :355 #, safe-html, strict-same msgid "" "Any `boost::concurrent_flat_set operation` that inserts or modifies an " "element `e` synchronizes with the internal invocation of a visitation " "function on `e`." msgstr "" "任何插入或修改元素 `e` 的 `boost::concurrent++_++flat++_++set` 操作都会与在 " "`e` 的内部调用的访问函数同步。" #: :358 #, safe-html, strict-same msgid "" "Visitation functions executed by a `boost::concurrent_flat_set` `x` are not " "allowed to invoke any operation on `x`; invoking operations on a different " "`boost::concurrent_flat_set` instance `y` is allowed only if concurrent " "outstanding operations on `y` do not access `x` directly or indirectly." msgstr "" "由 `boost::concurrent++_++flat++_++set` `x` 执行的访问函数不允许调用 `x` 上的" "任何操作；若并发未完成操作不直接或间接访问 `x` ，则允许调用不同 " "`boost::concurrent++_++flat++_++set` 实例 `y` 上的操作。" #: :362 #, safe-html, strict-same msgctxt ":362" msgid "---" msgstr "---" #: :364 #, safe-html, strict-same msgid "Configuration Macros" msgstr "配置宏" #: :366 #, safe-html, strict-same msgid "`BOOST_UNORDERED_DISABLE_REENTRANCY_CHECK`" msgstr "`BOOST++_++UNORDERED++_++DISABLE++_++REENTRANCY++_++CHECK`" #: :368 #, safe-html, strict-same msgid "" "In debug builds (more precisely, when link:../../../../../assert/doc/html/" "assert.html#boost_assert_is_void[`BOOST_ASSERT_IS_VOID`^] is not defined), " "__container reentrancies__ (illegaly invoking an operation on `m` from " "within a function visiting elements of `m`) are detected and signalled " "through `BOOST_ASSERT_MSG`. When run-time speed is a concern, the feature " "can be disabled by globally defining this macro." msgstr "" "在调试版本中（更准确地说，当未定义 link:../../../../../assert/doc/html/" "assert.html#boost_assert_is_void[`BOOST++_++ASSERT++_++IS++_++VOID`] 时），系" "统会检测__容器重入__行为（即在访问 `m` 元素的函数内部非法调用 `m` 上的操作）" "，并通过 `BOOST++_++ASSERT++_++MSG` 发出信号。若需关注运行时速度，可通过全局" "定义此宏来禁用该功能。" #: :375 #, safe-html, strict-same msgctxt ":375" msgid "---" msgstr "---" #: :377 #, safe-html, strict-same msgid "`BOOST_UNORDERED_ENABLE_STATS`" msgstr "`BOOST_UNORDERED_ENABLE_STATS`" #: :379 #, safe-html, strict-same msgid "" "Globally define this macro to enable xref:reference/" "stats.adoc#stats[statistics calculation] for the table. Note that this " "option decreases the overall performance of many operations." msgstr "" "全局定义此宏以启用容器的 xref:reference/stats.adoc#stats[统计计算] 功能。请注" "意，此选项会降低多数操作的总体性能。" #: :382 #, safe-html, strict-same msgctxt ":382" msgid "---" msgstr "---" #: :384 #, safe-html, strict-same msgid "Constants" msgstr "常量" #: :386 #, safe-html, strict-same msgid "```cpp static constexpr size_type bulk_visit_size; ```" msgstr "```cpp static constexpr size_type bulk_visit_size; ```" #: :390 #, safe-html, strict-same msgid "" "Chunk size internally used in xref:concurrent_flat_set_bulk_visit[bulk " "visit] operations." msgstr "xref:concurrent_flat_set_bulk_visit[批量访问]操作内部使用的块大小。" #: :392 #, safe-html, strict-same msgid "Constructors" msgstr "构造函数" #: :394 #, safe-html, strict-same msgid "Default Constructor" msgstr "默认构造函数" #: :395 #, safe-html, strict-same msgid "```c++ concurrent_flat_set(); ```" msgstr "```c++ concurrent_flat_set(); ```" #: :399 #, safe-html, strict-same msgid "" "Constructs an empty table using `hasher()` as the hash function, `key_equal()" "` as the key equality predicate and `allocator_type()` as the allocator." msgstr "" "构造一个空容器，使用`hasher()`作为哈希函数，`key_equal()`作为键相等谓词" "，`allocator_type()`作为分配器。" #: :403 #, safe-html, strict-same msgctxt ":403" msgid "" "Postconditions:;; `size() == 0` Requires:;; If the defaults are used, " "`hasher`, `key_equal` and `allocator_type` need to be https://" "en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^]." msgstr "" "后置条件：`size() == 0` 要求：若使用默认参数，则 `hasher`、`key_equal` 和 " "`allocator_type` 需满足 https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[可默认构造^] 要求。" #: :406 #, safe-html, strict-same msgctxt ":406" msgid "---" msgstr "---" #: :408 #, safe-html, strict-same msgid "Bucket Count Constructor" msgstr "桶数构造函数" #: :409 #, safe-html, strict-same msgid "" "```c++ explicit concurrent_flat_set(size_type n, const hasher& hf = hasher()" ", const key_equal& eql = key_equal(), const allocator_type& a = " "allocator_type()); ```" msgstr "" "```c++ explicit concurrent_flat_set(size_type n, const hasher& hf = " "hasher(), const key_equal& eql = key_equal(), const allocator_type& " "a = allocator_type()); ```" #: :416 #, safe-html, strict-same msgid "" "Constructs an empty table with at least `n` buckets, using `hf` as the hash " "function, `eql` as the key equality predicate, and `a` as the allocator." msgstr "" "构造一个拥有至少`n`个桶的空容器，使用`hf`作为哈希函数，`eql`作为键相等谓词" "，`a`作为分配器。" #: :420 #, safe-html, strict-same msgctxt ":420" msgid "" "Postconditions:;; `size() == 0` Requires:;; If the defaults are used, " "`hasher`, `key_equal` and `allocator_type` need to be https://" "en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^]." msgstr "" "后置条件：`size() == 0` \n" "要求：若使用默认参数，则 `hasher`、`key_equal` 和 `allocator_type` 需满足 " "https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构" "造^] 要求。" #: :423 #, safe-html, strict-same msgctxt ":423" msgid "---" msgstr "---" #: :425 #, safe-html, strict-same msgid "Iterator Range Constructor" msgstr "迭代器范围构造函数" #: :436 #, safe-html, strict-same msgid "" "Constructs an empty table with at least `n` buckets, using `hf` as the hash " "function, `eql` as the key equality predicate and `a` as the allocator, and " "inserts the elements from `[f, l)` into it." msgstr "" "构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数、 `eql` 作为键相等" "性谓词、 `a` 作为分配器，并将 `++[++f, l)` 范围内的元素插入其中。" #: :439 #, safe-html, strict-same msgctxt ":439" msgid "" "Requires:;; If the defaults are used, `hasher`, `key_equal` and " "`allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^]." msgstr "" "要求;; 若使用默认值，则 `hasher` 、 `key++_++equal` 和 `allocator++_++type` " "需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默" "认构造] 要求。" #: :441 #, safe-html, strict-same msgctxt ":441" msgid "---" msgstr "---" #: :443 #, safe-html, strict-same msgid "Copy Constructor" msgstr "复制构造函数" #: :444 #, safe-html, strict-same msgid "```c++ concurrent_flat_set(concurrent_flat_set const& other); ```" msgstr "```c++ concurrent_flat_set(concurrent_flat_set const& other); ```" #: :448 #, safe-html, strict-same msgid "" "The copy constructor. Copies the contained elements, hash function, " "predicate and allocator." msgstr "拷贝构造函数。拷贝容器内的元素、哈希函数、相等谓词及分配器。" #: :450 #, safe-html, strict-same msgid "" "If `Allocator::select_on_container_copy_construction` exists and has the " "right signature, the allocator will be constructed from its result." msgstr "" "若`Allocator::select_on_container_copy_construction`存在且签名正确，则分配器" "将根据其返回值构造。" #: :453 #, safe-html, strict-same msgid "" "Requires:;; `value_type` is copy constructible Concurrency:;; Blocking on " "`other`." msgstr "要求：`value_type` 可复制构造。并发：阻塞 `other`。" #: :456 #, safe-html, strict-same msgctxt ":456" msgid "---" msgstr "---" #: :458 #, safe-html, strict-same msgid "Move Constructor" msgstr "移动构造函数" #: :459 #, safe-html, strict-same msgid "```c++ concurrent_flat_set(concurrent_flat_set&& other); ```" msgstr "```c++ concurrent_flat_set(concurrent_flat_set&& other); ```" #: :463 #, safe-html, strict-same msgid "" "The move constructor. The internal bucket array of `other` is transferred " "directly to the new table. The hash function, predicate and allocator are " "moved-constructed from `other`. If statistics are " "xref:concurrent_flat_set_boost_unordered_enable_stats[enabled], transfers " "the internal statistical information from `other` and calls " "`other.reset_stats()`." msgstr "" "移动构造函数。`other` 的内部桶数组将直接转移至新容器。哈希函数、谓词及分配器" "均从 `other` 移动构造。若统计功能已通过 " "xref:concurrent_flat_set_boost_unordered_enable_stats[启用]，则从 `other` 转" "移内部统计信息并调用 `other.reset_stats()`。" #: :469 #, safe-html, strict-same msgctxt ":469" msgid "Concurrency:;; Blocking on `other`." msgstr "并发说明：;; 对 `other` 产生阻塞" #: :471 #, safe-html, strict-same msgctxt ":471" msgid "---" msgstr "---" #: :473 #, safe-html, strict-same msgid "Iterator Range Constructor with Allocator" msgstr "带分配器的迭代器范围构造函数" #: :474 #, safe-html, strict-same msgid "" "```c++ template concurrent_flat_set(InputIterator f, " "InputIterator l, const allocator_type& a); ```" msgstr "" "```c++ template concurrent_flat_set(InputIterator " "f, InputIterator l, const allocator_type& a); ```" #: :479 #, safe-html, strict-same msgid "" "Constructs an empty table using `a` as the allocator, with the default hash " "function and key equality predicate and inserts the elements from `[f, l)` " "into it." msgstr "" "构造一个以`a`为分配器、使用默认哈希函数与键相等谓词的空容器，并将`[f, l)`范围" "内的元素插入其中。" #: :482 #, safe-html, strict-same msgctxt ":482" msgid "" "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/" "cpp/named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "要求：`hasher`、`key_equal` 需满足 https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[可默认构造^] 要求。" #: :484 #, safe-html, strict-same msgctxt ":484" msgid "---" msgstr "---" #: :486 #, safe-html, strict-same msgid "Allocator Constructor" msgstr "分配器构造函数" #: :487 #, safe-html, strict-same msgid "```c++ explicit concurrent_flat_set(Allocator const& a); ```" msgstr "```c++ explicit concurrent_flat_set(Allocator const& a); ```" #: :491 #, safe-html, strict-same msgid "Constructs an empty table, using allocator `a`." msgstr "构造一个使用分配器`a`的空容器。" #: :493 #, safe-html, strict-same msgctxt ":493" msgid "---" msgstr "---" #: :495 #, safe-html, strict-same msgid "Copy Constructor with Allocator" msgstr "带分配器的复制构造函数" #: :496 #, safe-html, strict-same msgid "" "```c++ concurrent_flat_set(concurrent_flat_set const& other, Allocator " "const& a); ```" msgstr "" "```c++ concurrent_flat_set(concurrent_flat_set const& other, Allocator " "const& a); ```" #: :500 #, safe-html, strict-same msgid "" "Constructs a table, copying ``other``'s contained elements, hash function, " "and predicate, but using allocator `a`." msgstr "构造一个容器，复制 `other` 中的元素、哈希函数和谓词，但使用分配器 `a`。" #: :503 #, safe-html, strict-same msgctxt ":503" msgid "Concurrency:;; Blocking on `other`." msgstr "并发说明：;; 对 `other` 产生阻塞" #: :505 #, safe-html, strict-same msgctxt ":505" msgid "---" msgstr "---" #: :507 #, safe-html, strict-same msgid "Move Constructor with Allocator" msgstr "带分配器的移动构造函数" #: :508 #, safe-html, strict-same msgid "" "```c++ concurrent_flat_set(concurrent_flat_set&& other, Allocator const& a); " "```" msgstr "" "```c++ concurrent_flat_set(concurrent_flat_set&& other, Allocator " "const& a); ```" #: :512 #, safe-html, strict-same msgid "" "If `a == other.get_allocator()`, the elements of `other` are transferred " "directly to the new table; otherwise, elements are moved-constructed from " "those of `other`. The hash function and predicate are moved-constructed from " "`other`, and the allocator is copy-constructed from `a`. If statistics are " "xref:concurrent_flat_set_boost_unordered_enable_stats[enabled], transfers " "the internal statistical information from `other` iff `a == " "other.get_allocator()`, and always calls `other.reset_stats()`." msgstr "" "若`a == other.get_allocator()`，则`other`的元素将直接转移至新容器；否则，元素" "从`other`的元素移动构造而来。哈希函数与谓词从`other`移动构造，分配器从`a`拷贝" "构造。若统计功能已通过 " "xref:concurrent_flat_set_boost_unordered_enable_stats[enabled]，仅当`a == " "other.get_allocator()`时从`other`转移内部统计信息，且始终调" "用`other.reset_stats()`。" #: :520 #, safe-html, strict-same msgctxt ":520" msgid "Concurrency:;; Blocking on `other`." msgstr "并发说明：;; 对 `other` 产生阻塞" #: :522 #, safe-html, strict-same msgctxt ":522" msgid "---" msgstr "---" #: :524 #, safe-html, strict-same msgid "Move Constructor from unordered_flat_set" msgstr "从 unordered++_++flat++_++set 的移动构造函数" #: :526 #, safe-html, strict-same msgid "" "```c++ concurrent_flat_set(unordered_flat_set&& " "other); ```" msgstr "" "```c++ concurrent_flat_set(unordered_flat_set&& other); ```" #: :530 #, safe-html, strict-same msgid "" "Move construction from a xref:#unordered_flat_set[`unordered_flat_set`]. The " "internal bucket array of `other` is transferred directly to the new " "container. The hash function, predicate and allocator are moved-constructed " "from `other`. If statistics are " "xref:concurrent_flat_set_boost_unordered_enable_stats[enabled], transfers " "the internal statistical information from `other` and calls " "`other.reset_stats()`." msgstr "" "通过 xref:#unordered_flat_set[`unordered_flat_set`] 移动构造。`other` 的内部" "桶数组直接转移至新容器。哈希函数、谓词及分配器均从 `other` 移动构造。若统计功" "能已通过 xref:concurrent_flat_set_boost_unordered_enable_stats[enabled]，则" "从 `other` 转移内部统计信息并调用 `other.reset_stats()`。" #: :537 #, safe-html, strict-same msgid "Complexity:;; O(`bucket_count()`)" msgstr "Complexity:;; O(`bucket_count()`)" #: :539 #, safe-html, strict-same msgctxt ":539" msgid "---" msgstr "---" #: :541 #, safe-html, strict-same msgid "Initializer List Constructor" msgstr "初始化列表构造函数" #: :551 #, safe-html, strict-same msgid "" "Constructs an empty table with at least `n` buckets, using `hf` as the hash " "function, `eql` as the key equality predicate and `a`, and inserts the " "elements from `il` into it." msgstr "" "构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数、 `eql` 作为键相等" "性谓词、 `a` 作为分配器，并 `il` 中的元素插入其中。" #: :554 #, safe-html, strict-same msgctxt ":554" msgid "" "Requires:;; If the defaults are used, `hasher`, `key_equal` and " "`allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^]." msgstr "" "要求;; 若使用默认值，则 `hasher` 、 `key++_++equal` 和 `allocator++_++type` " "需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默" "认构造] 要求。" #: :556 #, safe-html, strict-same msgctxt ":556" msgid "---" msgstr "---" #: :558 #, safe-html, strict-same msgid "Bucket Count Constructor with Allocator" msgstr "带分配器的桶数构造函数" #: :559 #, safe-html, strict-same msgid "```c++ concurrent_flat_set(size_type n, allocator_type const& a); ```" msgstr "" "```c++ concurrent_flat_set(size_type n, allocator_type const& a); ```" #: :563 #, safe-html, strict-same msgid "" "Constructs an empty table with at least `n` buckets, using `hf` as the hash " "function, the default hash function and key equality predicate and `a` as " "the allocator." msgstr "" "构造一个至少包含 `n` 个桶的空容器，以 `hf` 作为哈希函数，使用默认键相等谓词，" "并以 `a` 作为分配器。" #: :566 #, safe-html, strict-same msgid "" "Postconditions:;; `size() == 0` Requires:;; `hasher` and `key_equal` need to " "be https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^]." msgstr "" "后置条件：`size() == 0` 要求：`hasher` 和 `key_equal` 需满足 https://" "en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^] 要求。" #: :569 #, safe-html, strict-same msgctxt ":569" msgid "---" msgstr "---" #: :571 #, safe-html, strict-same msgid "Bucket Count Constructor with Hasher and Allocator" msgstr "带哈希函数和分配器的桶数构造函数" #: :572 #, safe-html, strict-same msgid "" "```c++ concurrent_flat_set(size_type n, hasher const& hf, allocator_type " "const& a); ```" msgstr "" "```c++ concurrent_flat_set(size_type n, hasher const& hf, allocator_type " "const& a); ```" #: :576 #, safe-html, strict-same msgid "" "Constructs an empty table with at least `n` buckets, using `hf` as the hash " "function, the default key equality predicate and `a` as the allocator." msgstr "" "构造一个至少包含 `n` 个桶的空容器，以 `hf` 作为哈希函数，使用默认键相等谓词，" "并以 `a` 作为分配器。" #: :579 #, safe-html, strict-same msgid "" "Postconditions:;; `size() == 0` Requires:;; `key_equal` needs to be https://" "en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^]." msgstr "" "后置条件：`size() == 0` 要求：`key_equal` 需满足 https://en.cppreference.com/" "w/cpp/named_req/DefaultConstructible[可默认构造^] 要求。" #: :582 #, safe-html, strict-same msgctxt ":582" msgid "---" msgstr "---" #: :584 #, safe-html, strict-same msgid "Iterator Range Constructor with Bucket Count and Allocator" msgstr "带桶数和分配器的迭代器范围构造函数" #: :591 #, safe-html, strict-same msgid "" "Constructs an empty table with at least `n` buckets, using `a` as the " "allocator and default hash function and key equality predicate, and inserts " "the elements from `[f, l)` into it." msgstr "" "构造一个至少包含 `n` 个桶的空容器，使用 `a` 作为分配器以及默认的哈希函数和键" "相等性谓词，并将 `++[++f, l)` 范围内的元素插入其中。" #: :594 #, safe-html, strict-same msgctxt ":594" msgid "" "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/" "cpp/named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "要求;; `hasher` 和 `key++_++equal` 需满足 https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[可默认构造] 要求。" #: :596 #, safe-html, strict-same msgctxt ":596" msgid "---" msgstr "---" #: :598 #, safe-html, strict-same msgid "Iterator Range Constructor with Bucket Count and Hasher" msgstr "带桶数和哈希函数的迭代器范围构造函数" #: :606 #, safe-html, strict-same msgid "" "Constructs an empty table with at least `n` buckets, using `hf` as the hash " "function, `a` as the allocator, with the default key equality predicate, and " "inserts the elements from `[f, l)` into it." msgstr "" "构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数、 `a` 作为分配器以" "及默认的键相等性谓词，并将 `++[++f, l)` 范围内的元素插入其中。" #: :609 #, safe-html, strict-same msgctxt ":609" msgid "" "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "要求;; `key++_++equal` 需满足 https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[可默认构造] 要求。" #: :611 #, safe-html, strict-same msgctxt ":611" msgid "---" msgstr "---" #: :613 #, safe-html, strict-same msgid "initializer_list Constructor with Allocator" msgstr "带分配器的初始化列表构造函数" #: :615 #, safe-html, strict-same msgid "" "```c++ concurrent_flat_set(std::initializer_list il, const " "allocator_type& a); ```" msgstr "" "```c++ concurrent_flat_set(std::initializer_list il, const " "allocator_type& a); ```" #: :619 #, safe-html, strict-same msgid "" "Constructs an empty table using `a` and default hash function and key " "equality predicate, and inserts the elements from `il` into it." msgstr "" "构造一个使用分配器`a`、默认哈希函数和键相等谓词的空容器，并将`il`中的元素插入" "其中。" #: :622 #, safe-html, strict-same msgctxt ":622" msgid "" "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/" "w/cpp/named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "要求：`hasher` 和 `key_equal` 需满足 https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[可默认构造^] 要求。" #: :624 #, safe-html, strict-same msgctxt ":624" msgid "---" msgstr "---" #: :626 #, safe-html, strict-same msgid "initializer_list Constructor with Bucket Count and Allocator" msgstr "带桶数和分配器的初始化列表构造函数" #: :628 #, safe-html, strict-same msgid "" "```c++ concurrent_flat_set(std::initializer_list il, size_type " "n, const allocator_type& a); ```" msgstr "" "```c++ concurrent_flat_set(std::initializer_list il, size_type " "n, const allocator_type& a); ```" #: :632 #, safe-html, strict-same msgid "" "Constructs an empty table with at least `n` buckets, using `a` and default " "hash function and key equality predicate, and inserts the elements from `il` " "into it." msgstr "" "构造一个至少包含 `n` 个桶的空容器，使用分配器 `a` 以及默认哈希函数和键相等谓" "词，并将 `il` 中的元素插入其中。" #: :635 #, safe-html, strict-same msgctxt ":635" msgid "" "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/" "w/cpp/named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "要求：`hasher` 和 `key_equal` 需满足 https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[可默认构造^] 要求。" #: :637 #, safe-html, strict-same msgctxt ":637" msgid "---" msgstr "---" #: :639 #, safe-html, strict-same msgid "initializer_list Constructor with Bucket Count and Hasher and Allocator" msgstr "带桶数、哈希函数和分配器的初始化列表构造函数" #: :641 #, safe-html, strict-same msgid "" "```c++ concurrent_flat_set(std::initializer_list il, size_type " "n, const hasher& hf, const allocator_type& a); ```" msgstr "" "```c++ concurrent_flat_set(std::initializer_list il, size_type " "n, const hasher& hf, const allocator_type& a); ```" #: :646 #, safe-html, strict-same msgid "" "Constructs an empty table with at least `n` buckets, using `hf` as the hash " "function, `a` as the allocator and default key equality predicate,and " "inserts the elements from `il` into it." msgstr "" "构造一个至少包含 `n` 个桶的空容器，以 `hf` 作为哈希函数、`a` 作为分配器，使用" "默认键相等谓词，并将 `il` 中的元素插入其中。" #: :649 #, safe-html, strict-same msgctxt ":649" msgid "" "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "要求：`key_equal` 需满足 https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[可默认构造^] 要求。" #: :651 #, safe-html, strict-same msgctxt ":651" msgid "---" msgstr "---" #: :653 #, safe-html, strict-same msgid "Destructor" msgstr "析构函数" #: :655 #, safe-html, strict-same msgid "```c++ ~concurrent_flat_set(); ```" msgstr "```c++ ~concurrent_flat_set(); ```" #: :660 #, safe-html, strict-same msgid "" "Note:;; The destructor is applied to every element, and all memory is " "deallocated" msgstr "注意：;; 析构函数会作用于所有元素，且所有内存都会被释放" #: :662 #, safe-html, strict-same msgctxt ":662" msgid "---" msgstr "---" #: :664 #, safe-html, strict-same msgid "Assignment" msgstr "赋值操作" #: :666 #, safe-html, strict-same msgid "Copy Assignment" msgstr "复制赋值" #: :668 #, safe-html, strict-same msgid "" "```c++ concurrent_flat_set& operator=(concurrent_flat_set const& other); ```" msgstr "" "```c++ concurrent_flat_set& operator=(concurrent_flat_set const& " "other); ```" #: :672 #, safe-html, strict-same msgid "" "The assignment operator. Destroys previously existing elements, copy-assigns " "the hash function and predicate from `other`, copy-assigns the allocator " "from `other` if `Alloc::propagate_on_container_copy_assignment` exists and " "`Alloc::propagate_on_container_copy_assignment::value` is `true`, and " "finally inserts copies of the elements of `other`." msgstr "" "赋值运算符。销毁先前已存在的元素，从 `other` 拷贝赋值哈希函数和谓词；若 " "`Alloc::propagate_on_container_copy_assignment` 存在且其值为 `true`，则从 " "`other` 拷贝赋值分配器；最后插入 `other` 元素的副本。" #: :677 #, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^] Concurrency:;; Blocking on `*this` and " "`other`." msgstr "" "要求：`value_type` 需满足 https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[可复制插入^] 要求。并发：阻塞 `*this` 和 `other`。" #: :680 #, safe-html, strict-same msgctxt ":680" msgid "---" msgstr "---" #: :682 #, safe-html, strict-same msgid "Move Assignment" msgstr "移动赋值" #: :683 #, safe-html, strict-same msgid "" "```c++ concurrent_flat_set& operator=(concurrent_flat_set&& other) noexcept" "(boost::allocator_traits::is_always_equal::value || " "boost::allocator_traits" "::propagate_on_container_move_assignment::value); ``` The move assignment " "operator. Destroys previously existing elements, swaps the hash function and " "predicate from `other`, and move-assigns the allocator from `other` if " "`Alloc::propagate_on_container_move_assignment` exists and " "`Alloc::propagate_on_container_move_assignment::value` is `true`. If at this " "point the allocator is equal to `other.get_allocator()`, the internal bucket " "array of `other` is transferred directly to `*this`; otherwise, inserts move-" "constructed copies of the elements of `other`. If statistics are " "xref:concurrent_flat_set_boost_unordered_enable_stats[enabled], transfers " "the internal statistical information from `other` iff the final allocator is " "equal to `other.get_allocator()`, and always calls `other.reset_stats()`." msgstr "" "```c++ concurrent_flat_set& operator=(concurrent_flat_set&& " "other) noexcept(boost::allocator_traits::is_always_equal::value " "|| boost::allocator_traits" "::propagate_on_container_move_assignment::value); ```\n" "移动赋值运算符。销毁先前已存在的元素，交换当前对象与 other 的哈希函数和谓词；" "若 Alloc::propagate_on_container_move_assignment 存在且其值为 true，则从 " "other 移动赋值分配器。若此时分配器与 other.get_allocator() 相等，other 的内部" "桶数组将直接转移给 *this；否则，插入由 other 元素移动构造的副本。若统计功能已" "通过 xref:concurrent_flat_set_boost_unordered_enable_stats [enabled]，仅当最" "终分配器与 other.get_allocator() 相等时，从 other 转移内部统计信息，且始终调" "用 other.reset_stats()。" #: :697 #, safe-html, strict-same msgid "Concurrency:;; Blocking on `*this` and `other`." msgstr "并发特性：;; 阻塞 `*this` 与 `other`" #: :699 #, safe-html, strict-same msgctxt ":699" msgid "---" msgstr "---" #: :701 #, safe-html, strict-same msgid "Initializer List Assignment" msgstr "初始化列表赋值" #: :702 #, safe-html, strict-same msgid "" "```c++ concurrent_flat_set& operator=(std::initializer_list il); " "```" msgstr "" "```c++ concurrent_flat_set& operator=(std::initializer_list " "il); ```" #: :706 #, safe-html, strict-same msgid "" "Assign from values in initializer list. All previously existing elements are " "destroyed." msgstr "通过初始化列表中的值进行赋值。先前存在的所有元素都会被销毁。" #: :709 #, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^] Concurrency:;; Blocking on `*this`." msgstr "" "前置要求：;; `value_type` 需满足 https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]\n" "并发特性：;; 阻塞 `*this`" #: :712 #, safe-html, strict-same msgctxt ":712" msgid "---" msgstr "---" #: :714 #, safe-html, strict-same msgid "Visitation" msgstr "访问操作" #: :716 #, safe-html, strict-same msgid "[c]visit" msgstr "[c]visit" #: :718 #, safe-html, strict-same msgid "" "```c++ template size_t visit(const key_type& k, F f); " "template size_t visit(const key_type& k, F f) const; template size_t cvisit(const key_type& k, F f) const; template " "size_t visit(const K& k, F f); template size_t visit(const " "K& k, F f) const; template size_t cvisit(const K& k, F f) " "const; ```" msgstr "" "```c++ template size_t visit(const key_type& k, F f); " "template size_t visit(const key_type& k, F f) const; " "template size_t cvisit(const key_type& k, F f) const; " "template size_t visit(const K& k, F f); " "template size_t visit(const K& k, F f) " "const; template size_t cvisit(const K& " "k, F f) const; ```" #: :727 #, safe-html, strict-same msgid "" "If an element `x` exists with key equivalent to `k`, invokes `f` with a " "const reference to `x`." msgstr "若存在键与 `k` 等价的元素 `x`，则以指向 `x` 的常量引用调用函数 `f`。" #: :730 #, safe-html, strict-same msgid "" "Returns:;; The number of elements visited (0 or 1). Notes:;; The " "`template` 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." msgstr "" "返回值：;; 访问到的元素数量（0 或 1）。\n" "注意：;; 仅当 `Hash::is_transparent` 与 `Pred::is_transparent` 为合法成员别名" "时，`template` 重载版本才会参与重载决议。库" "假定 `Hash` 可同时接收 `K` 与 `Key` 类型调用，且 `Pred` 是透明的。这支持异构" "查找，避免了实例化 `Key` 类型对象的开销。" #: :733 #, safe-html, strict-same msgctxt ":733" msgid "---" msgstr "---" #: :735 #, safe-html, strict-same msgid "Bulk visit" msgstr "批量访问" #: :737 #, safe-html, strict-same msgid "" "```c++ template size_t visit(FwdIterator first, " "FwdIterator last, F f); template size_t visit" "(FwdIterator first, FwdIterator last, F f) const; template size_t cvisit(FwdIterator first, FwdIterator last, F " "f) const; ```" msgstr "" "```c++ template size_t visit" "(FwdIterator first, FwdIterator last, F f); template size_t visit(FwdIterator first, FwdIterator last, F f) " "const; template size_t cvisit" "(FwdIterator first, FwdIterator last, F f) const; ```" #: :746 #, safe-html, strict-same msgid "" "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`." msgstr "" "对范围 `[first, last)` 中的每个元素 `k`，若容器中存在键与 `k` 等价的元素 " "`x`，则以指向 `x` 的常量引用调用函数 `f`。" #: :750 #, safe-html, strict-same msgid "" "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." msgstr "" "尽管功能上等同于对每个键单独调用 `[c]visit`，但得益于内部的流式优化，批量访问" "通常性能更高。建议当 `std::distance(first,last)` 至少达到 `bulk_visit_size` " "时使用批量访问以获得性能提升；超过该大小后，性能不会进一步提升。" #: :759 #, safe-html, strict-same msgid "" "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::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." msgstr "" "前置要求：;; `FwdIterator` 是一个传统前向迭代器（C++11 至 C++17），或满足 " "`std::forward_iterator` 要求（C++20 及更高版本）。\n" "对于 `K = std::iterator_traits::value_type`，要么 `K` 是 " "`key_type`，要么 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成" "员别名。\n" "在后一种情况下，库假定 `Hash` 可同时接收 `K` 与 `Key` 类型调用，且 `Pred` 是" "透明的。这支持异构查找，避免了实例化 `Key` 类型对象的开销。\n" "返回值：;; 访问到的元素数量。" #: :768 #, safe-html, strict-same msgctxt ":768" msgid "---" msgstr "---" #: :770 #, safe-html, strict-same msgid "[c]visit_all" msgstr "[c]visit_all" #: :772 #, safe-html, strict-same msgid "" "```c++ template size_t visit_all(F f); template size_t " "visit_all(F f) const; template size_t cvisit_all(F f) const; ```" msgstr "" "```c++ template size_t visit_all(F f); template " "size_t visit_all(F f) const; template size_t cvisit_all(F f) " "const; ```" #: :778 #, safe-html, strict-same msgid "" "Successively invokes `f` with const references to each of the elements in " "the table." msgstr "依次以指向哈希表中每个元素的常量引用调用函数 `f`。" #: :781 #, safe-html, strict-same msgid "Returns:;; The number of elements visited." msgstr "返回值：;; 访问到的元素总数。" #: :783 #, safe-html, strict-same msgctxt ":783" msgid "---" msgstr "---" #: :785 #, safe-html, strict-same msgid "Parallel [c]visit_all" msgstr "并行 [c]visit_all" #: :787 #, safe-html, strict-same msgid "" "```c++ template void visit_all" "(ExecutionPolicy&& policy, F f); template " "void visit_all(ExecutionPolicy&& policy, F f) const; template void cvisit_all(ExecutionPolicy&& policy, F f) " "const; ```" msgstr "" "```c++ template void visit_all" "(ExecutionPolicy&& policy, F f); template void visit_all" "(ExecutionPolicy&& policy, F f) const; template void cvisit_all" "(ExecutionPolicy&& policy, F f) const; ```" #: :793 #, safe-html, strict-same msgid "" "Invokes `f` with const references to each of the elements in the table. " "Execution is parallelized according to the semantics of the execution policy " "specified." msgstr "" "以指向哈希表中每个元素的常量引用调用函数 `f`。执行过程会根据指定执行策略的语" "义进行并行化。" #: :797 #, safe-html, strict-same msgid "" "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>` is " "`true`. + + Unsequenced execution policies are not allowed." msgstr "" "抛出异常：;; 根据所使用执行策略的异常处理机制，若 `f` 内部抛出异常，则可能调" "用 `std::terminate`。\n" "注意：;; 仅在支持 C++17 并行算法的编译器中可用。\n" "仅当 `std::is_execution_policy_v>` " "为 `true` 时，这些重载版本才会参与重载决议。\n" "不允许使用无序执行策略。" #: :804 #, safe-html, strict-same msgctxt ":804" msgid "---" msgstr "---" #: :806 #, safe-html, strict-same msgid "[c]visit_while" msgstr "[c]visit_while" #: :808 #, safe-html, strict-same msgid "" "```c++ template bool visit_while(F f); template bool " "visit_while(F f) const; template bool cvisit_while(F f) const; ```" msgstr "" "```c++ template bool visit_while(F f); template " "bool visit_while(F f) const; template bool cvisit_while(F f) " "const; ```" #: :814 #, safe-html, strict-same msgid "" "Successively invokes `f` with const references to each of the elements in " "the table until `f` returns `false` or all the elements are visited." msgstr "" "依次以指向哈希表中每个元素的常量引用调用函数 `f`，直到 `f` 返回 `false` 或遍" "历完所有元素。" #: :818 #, safe-html, strict-same msgid "Returns:;; `false` iff `f` ever returns `false`." msgstr "返回值：;; 当且仅当 `f` 返回过 `false` 时，返回 `false`。" #: :820 #, safe-html, strict-same msgctxt ":820" msgid "---" msgstr "---" #: :822 #, safe-html, strict-same msgid "Parallel [c]visit_while" msgstr "并行 ++[++c++]++visit++_++while" #: :824 #, safe-html, strict-same msgid "" "```c++ template bool visit_while" "(ExecutionPolicy&& policy, F f); template " "bool visit_while(ExecutionPolicy&& policy, F f) const; template bool cvisit_while(ExecutionPolicy&& policy, F f) " "const; ```" msgstr "" "```c++ template bool " "visit_while(ExecutionPolicy&& policy, F f); template bool visit_while" "(ExecutionPolicy&& policy, F f) const; template bool cvisit_while" "(ExecutionPolicy&& policy, F f) const; ```" #: :830 #, safe-html, strict-same msgid "" "Invokes `f` with const references to each of the elements in the table until " "`f` returns `false` or all the elements are visited. Execution is " "parallelized according to the semantics of the execution policy specified." msgstr "" "以指向哈希表中每个元素的常量引用调用函数 `f`，直到 `f` 返回 `false` 或遍历完" "所有元素。执行过程会根据指定执行策略的语义进行并行化。" #: :835 #, safe-html, strict-same msgid "" "Returns:;; `false` iff `f` ever returns `false`. 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>` is " "`true`. + + Unsequenced execution policies are not allowed. + + " "Parallelization implies that execution does not necessary finish as soon as " "`f` returns `false`, and as a result `f` may be invoked with further " "elements for which the return value is also `false`." msgstr "" "返回值：;; 当且仅当 `f` 返回过 `false` 时，返回 `false`。\n" "抛出异常：;; 根据所使用执行策略的异常处理机制，若 `f` 内部抛出异常，则可能调" "用 `std::terminate`。\n" "注意：;; 仅在支持 C++17 并行算法的编译器中可用。\n" "仅当 `std::is_execution_policy_v>` " "为 `true` 时，这些重载版本才会参与重载决议。\n" "不允许使用无序执行策略。\n" "并行化意味着执行流程不会在 `f` 返回 `false` 时立即终止，因此 `f` 可能还会被后" "续元素调用并同样返回 `false`。" #: :846 #, safe-html, strict-same msgctxt ":846" msgid "---" msgstr "---" #: :848 #, safe-html, strict-same msgid "Size and Capacity" msgstr "大小与容量" #: :850 #, safe-html, strict-same msgid "empty" msgstr "空" #: :852 #, safe-html, strict-same msgid "```c++ [[nodiscard]] bool empty() const noexcept; ```" msgstr "```c++ [[nodiscard]] bool empty() const noexcept; ```" #: :857 #, safe-html, strict-same msgid "Returns:;; `size() == 0`" msgstr "返回值：;; `size() == 0`" #: :859 #, safe-html, strict-same msgctxt ":859" msgid "---" msgstr "---" #: :861 #, safe-html, strict-same msgid "size" msgstr "大小" #: :863 #, safe-html, strict-same msgid "```c++ size_type size() const noexcept; ```" msgstr "```c++ size_type size() const noexcept; ```" #: :868 #, safe-html, strict-same msgid "Returns:;; The number of elements in the table." msgstr "返回值：;; 哈希表中的元素总数。" #: :871 #, safe-html, strict-same msgid "" "Notes:;; In the presence of concurrent insertion operations, the value " "returned may not accurately reflect the true size of the table right after " "execution." msgstr "" "注意：;; 在存在并发插入操作时，返回的值可能无法准确反映函数执行后哈希表的真实" "大小。" #: :874 #, safe-html, strict-same msgctxt ":874" msgid "---" msgstr "---" #: :876 #, safe-html, strict-same msgid "max_size" msgstr "max_size" #: :878 #, safe-html, strict-same msgid "```c++ size_type max_size() const noexcept; ```" msgstr "```c++ size_type max_size() const noexcept; ```" #: :883 #, safe-html, strict-same msgid "Returns:;; `size()` of the largest possible table." msgstr "返回值：;; 哈希表能容纳的最大元素数量（最大容量）。" #: :885 #, safe-html, strict-same msgctxt ":885" msgid "---" msgstr "---" #: :887 #, safe-html, strict-same msgid "Modifiers" msgstr "修改器" #: :889 #, safe-html, strict-same msgid "emplace" msgstr "原地构造" #: :890 #, safe-html, strict-same msgid "```c++ template bool emplace(Args&&... args); ```" msgstr "" "```c++ template bool emplace(Args&&... args); " "```" #: :894 #, safe-html, strict-same msgid "" "Inserts an object, constructed with the arguments `args`, in the table if " "and only if there is no element in the table with an equivalent key." msgstr "" "当且仅当哈希表中不存在等价键的元素时，才会使用参数 `args` 构造对象并插入到哈" "希表中。" #: :897 #, safe-html, strict-same msgid "" "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." msgstr "" "前置要求：;; `value_type` 可由参数 `args` 构造。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。\n" "注意：;; 若执行重哈希，将使指向元素的指针和引用失效。" #: :902 #, safe-html, strict-same msgctxt ":902" msgid "---" msgstr "---" #: :904 #, safe-html, strict-same msgid "Copy Insert" msgstr "复制插入" #: :905 #, safe-html, strict-same msgid "```c++ bool insert(const value_type& obj); ```" msgstr "```c++ bool insert(const value_type& obj); ```" #: :909 #, safe-html, strict-same msgctxt ":909" msgid "" "Inserts `obj` in the table if and only if there is no element in the table " "with an equivalent key." msgstr "当且仅当哈希表中不存在等价键的元素时，才将 `obj` 插入到哈希表中。" #: :912 #, safe-html, strict-same msgctxt ":912" msgid "" "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." msgstr "" "前置要求：;; `value_type` 满足可复制插入要求。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。\n" "注意：;; 若执行重哈希，将使指向元素的指针和引用失效。" #: :917 #, safe-html, strict-same msgctxt ":917" msgid "---" msgstr "---" #: :919 #, safe-html, strict-same msgid "Move Insert" msgstr "移动插入" #: :920 #, safe-html, strict-same msgid "```c++ bool insert(value_type&& obj); ```" msgstr "```c++ bool insert(value_type&& obj); ```" #: :924 #, safe-html, strict-same msgctxt ":924" msgid "" "Inserts `obj` in the table if and only if there is no element in the table " "with an equivalent key." msgstr "当且仅当哈希表中不存在等价键的元素时，才将 `obj` 插入到哈希表中。" #: :927 #, safe-html, strict-same msgid "" "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." msgstr "" "前置要求：;; `value_type` 满足可移动插入要求。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。\n" "注意：;; 若执行重哈希，将使指向元素的指针和引用失效。" #: :932 #, safe-html, strict-same msgctxt ":932" msgid "---" msgstr "---" #: :934 #, safe-html, strict-same msgid "Transparent Insert" msgstr "透明插入" #: :935 #, safe-html, strict-same msgid "```c++ template bool insert(K&& k); ```" msgstr "```c++ template bool insert(K&& k); ```" #: :939 #, safe-html, strict-same msgid "" "Inserts an element constructed from `std::forward(k)` in the container if " "and only if there is no element in the container with an equivalent key." msgstr "" "当且仅当容器中不存在等价键的元素时，才会使用 `std::forward(k)` 构造元素并" "插入到容器中。" #: :942 #, safe-html, strict-same msgid "" "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. + + This overload only participates 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." msgstr "" "前置要求：;; `value_type` 可通过 `k` 原位构造。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。\n" "注意：;; 若执行重哈希，将使指向元素的指针和引用失效。\n" "仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员别名时，该" "重载版本才参与重载决议。\n" "库假定 `Hash` 可同时接收 `K` 与 `Key` 类型调用，且 `Pred` 是透明的。这支持异" "构查找，避免实例化 `Key` 类型对象的开销。" #: :949 #, safe-html, strict-same msgctxt ":949" msgid "---" msgstr "---" #: :951 #, safe-html, strict-same msgid "Insert Iterator Range" msgstr "迭代器范围插入" #: :952 #, safe-html, strict-same msgid "" "```c++ template size_type insert(InputIterator first, " "InputIterator last); ```" msgstr "" "```c++ template size_type insert(InputIterator " "first, InputIterator last); ```" #: :956 #, safe-html, strict-same msgctxt ":956" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等效于 [listing,subs=\"+macros,+quotes\"]" #: :963 #, safe-html, strict-same msgctxt ":963" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 成功插入的元素数量。" #: :965 #, safe-html, strict-same msgctxt ":965" msgid "---" msgstr "---" #: :967 #, safe-html, strict-same msgid "Insert Initializer List" msgstr "初始化列表插入" #: :968 #, safe-html, strict-same msgid "```c++ size_type insert(std::initializer_list il); ```" msgstr "" "```c++ size_type insert(std::initializer_list il); ```" #: :972 #, safe-html, strict-same msgctxt ":972" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等效于 [listing,subs=\"+macros,+quotes\"]" #: :979 #, safe-html, strict-same msgctxt ":979" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 成功插入的元素数量。" #: :981 #, safe-html, strict-same msgctxt ":981" msgid "---" msgstr "---" #: :983 #, safe-html, strict-same msgid "emplace_or_[c]visit" msgstr "emplace_or_[c]visit" #: :984 #, safe-html, strict-same msgid "" "```c++ template bool emplace_or_visit(Args&&... " "args, F&& f); template bool emplace_or_cvisit" "(Args&&... args, F&& f); ```" msgstr "" "```c++ template bool emplace_or_visit" "(Args&&... args, F&& f); template bool emplace_or_cvisit(Args&&... args, " "F&& f); ```" #: :989 #, safe-html, strict-same msgid "" "Inserts an object, constructed with the arguments `args`, in the table if " "there is no element in the table with an equivalent key. Otherwise, invokes " "`f` with a const reference to the equivalent element." msgstr "" "若哈希表中不存在等价键的元素，则使用参数 `args` 构造对象并插入表中；否则，以" "等价元素的常量引用为参数调用函数 `f`。" #: :993 #, safe-html, strict-same msgid "" "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 a parameter `f` after a variadic parameter pack." msgstr "" "前置要求：;; `value_type` 可由参数 `args` 构造。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。\n" "注意：;; 若执行重哈希，将使指向元素的指针和引用失效。\n" "该接口仅为说明性设计，因为 C++ 不允许在可变参数包之后声明参数 `f`。" #: :1000 #, safe-html, strict-same msgctxt ":1000" msgid "---" msgstr "---" #: :1002 #, safe-html, strict-same msgid "Copy insert_or_[c]visit" msgstr "复制 insert++_++or++_[++c++]++visit" #: :1003 #, safe-html, strict-same msgid "" "```c++ template bool insert_or_visit(const value_type& obj, F f); " "template bool insert_or_cvisit(const value_type& obj, F f); ```" msgstr "" "```c++ template bool insert_or_visit(const value_type& " "obj, F f); template bool insert_or_cvisit(const " "value_type& obj, F f); ```" #: :1008 #, safe-html, strict-same msgctxt ":1008" msgid "" "Inserts `obj` in the table if and only if there is no element in the table " "with an equivalent key. Otherwise, invokes `f` with a const reference to the " "equivalent element." msgstr "" "当且仅当哈希表中不存在等价键的元素时，才将 `obj` 插入表中；否则，以等价元素的" "常量引用为参数调用函数 `f`。" #: :1012 #, safe-html, strict-same msgctxt ":1012" msgid "" "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." msgstr "" "前置要求：;; `value_type` 满足可复制插入要求。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。\n" "注意：;; 若执行重哈希，将使指向元素的指针和引用失效。" #: :1017 #, safe-html, strict-same msgctxt ":1017" msgid "---" msgstr "---" #: :1019 #, safe-html, strict-same msgid "Move insert_or_[c]visit" msgstr "移动 insert++_++or++_[++c++]++visit" #: :1020 #, safe-html, strict-same msgid "" "```c++ template bool insert_or_visit(value_type&& obj, F f); " "template bool insert_or_cvisit(value_type&& obj, F f); ```" msgstr "" "```c++ template bool insert_or_visit(value_type&& obj, " "F f); template bool insert_or_cvisit(value_type&& obj, " "F f); ```" #: :1025 #, safe-html, strict-same msgctxt ":1025" msgid "" "Inserts `obj` in the table if and only if there is no element in the table " "with an equivalent key. Otherwise, invokes `f` with a const reference to the " "equivalent element." msgstr "" "当且仅当哈希表中不存在等价键的元素时，才将 `obj` 插入表中；否则，以等价元素的" "常量引用为参数调用函数 `f`。" #: :1029 #, safe-html, strict-same msgctxt ":1029" msgid "" "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." msgstr "" "前置要求：;; `value_type` 满足可移动插入要求。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。\n" "注意：;; 若执行重哈希，将使指向元素的指针和引用失效。" #: :1034 #, safe-html, strict-same msgctxt ":1034" msgid "---" msgstr "---" #: :1036 #, safe-html, strict-same msgid "Transparent insert_or_[c]visit" msgstr "透明 insert++_++or++_[++c++]++visit" #: :1037 #, safe-html, strict-same msgid "" "```c++ template bool insert_or_visit(K&& k, F f); " "template bool insert_or_cvisit(K&& k, F f); ```" msgstr "" "```c++ template bool insert_or_visit" "(K&& k, F f); template bool " "insert_or_cvisit(K&& k, F f); ```" #: :1042 #, safe-html, strict-same msgid "" "Inserts an element constructed from `std::forward(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." msgstr "" "当且仅当容器中不存在等价键的元素时，才会使用 `std::forward(k)` 构造元素并" "插入容器；否则，以等价元素的常量引用为参数调用函数 `f`。" #: :1046 #, safe-html, strict-same msgctxt ":1046" msgid "" "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." msgstr "" "前置要求：;; `value_type` 可通过 `k` 原位构造。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。\n" "注意：;; 若执行重哈希，将使指向元素的指针和引用失效。\n" "仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员别名时，该" "组重载才参与重载决议。\n" "库假定 `Hash` 可同时接收 `K` 与 `Key` 类型调用，且 `Pred` 是透明的。这支持异" "构查找，避免实例化 `Key` 类型对象的开销。" #: :1053 #, safe-html, strict-same msgctxt ":1053" msgid "---" msgstr "---" #: :1055 #, safe-html, strict-same msgid "Insert Iterator Range or Visit" msgstr "迭代器范围插入或访问" #: :1056 #, safe-html, strict-same msgid "" "```c++ template size_type insert_or_visit" "(InputIterator first, InputIterator last, F f); template size_type insert_or_cvisit(InputIterator first, " "InputIterator last, F f); ```" msgstr "" "```c++ template size_type " "insert_or_visit(InputIterator first, InputIterator last, F f); " "template size_type insert_or_cvisit" "(InputIterator first, InputIterator last, F f); ```" #: :1063 #, safe-html, strict-same msgctxt ":1063" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等效于 [listing,subs=\"+macros,+quotes\"]" #: :1070 #, safe-html, strict-same msgctxt ":1070" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 成功插入的元素数量。" #: :1072 #, safe-html, strict-same msgctxt ":1072" msgid "---" msgstr "---" #: :1074 #, safe-html, strict-same msgid "Insert Initializer List or Visit" msgstr "初始化列表插入或访问" #: :1075 #, safe-html, strict-same msgid "" "```c++ template size_type insert_or_visit" "(std::initializer_list il, F f); template size_type " "insert_or_cvisit(std::initializer_list il, F f); ```" msgstr "" "```c++ template size_type insert_or_visit" "(std::initializer_list il, F f); template " "size_type insert_or_cvisit(std::initializer_list il, F f); ```" #: :1080 #, safe-html, strict-same msgctxt ":1080" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等效于 [listing,subs=\"+macros,+quotes\"]" #: :1087 #, safe-html, strict-same msgctxt ":1087" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 成功插入的元素数量。" #: :1089 #, safe-html, strict-same msgctxt ":1089" msgid "---" msgstr "---" #: :1091 #, safe-html, strict-same msgid "emplace_and_[c]visit" msgstr "emplace_and_[c]visit" #: :1092 #, safe-html, strict-same msgid "" "```c++ template bool emplace_and_visit" "(Args&&... args, F1&& f1, F2&& f2); template bool emplace_and_cvisit(Args&&... args, F1&& f1, F2&& f2); ```" msgstr "" "```c++ template bool " "emplace_and_visit(Args&&... args, F1&& f1, F2&& f2); " "template bool " "emplace_and_cvisit(Args&&... args, F1&& f1, F2&& f2)" "; ```" #: :1099 #, safe-html, strict-same msgid "" "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." msgstr "" "若哈希表中不存在等价键的元素，则使用参数 `args` 构造对象并插入表中，随后以新" "创建元素的常量引用为参数调用函数 `f1`；否则，以等价元素的常量引用为参数调用函" "数 `f2`。" #: :1104 #, safe-html, strict-same msgid "" "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." msgstr "" "前置要求：;; `value_type` 可由参数 `args` 构造。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。\n" "注意：;; 若执行重哈希，将使指向元素的指针和引用失效。\n" "该接口仅为说明性设计，因为 C++ 不允许在可变参数包之后声明参数 `f1` 和 `f2`。" #: :1111 #, safe-html, strict-same msgctxt ":1111" msgid "---" msgstr "---" #: :1113 #, safe-html, strict-same msgid "Copy insert_and_[c]visit" msgstr "复制 insert++_++and++_[++c++]++visit" #: :1114 #, safe-html, strict-same msgid "" "```c++ template bool insert_and_visit(const value_type& " "obj, F1 f1, F2 f2); template bool insert_and_cvisit" "(const value_type& obj, F1 f1, F2 f2); ```" msgstr "" "```c++ template bool insert_and_visit" "(const value_type& obj, F1 f1, F2 f2); template bool insert_and_cvisit(const value_type& obj, F1 f1, " "F2 f2); ```" #: :1119 #, safe-html, strict-same msgctxt ":1119" msgid "" "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." msgstr "" "当且仅当哈希表中不存在等价键的元素时，将 `obj` 插入表中，随后以新创建元素的常" "量引用为参数调用函数 `f1`；否则，以等价元素的常量引用为参数调用函数 `f2`。" #: :1124 #, safe-html, strict-same msgctxt ":1124" msgid "" "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." msgstr "" "前置要求：;; `value_type` 满足可复制插入要求。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。\n" "注意：;; 若执行重哈希，将使指向元素的指针和引用失效。" #: :1129 #, safe-html, strict-same msgctxt ":1129" msgid "---" msgstr "---" #: :1131 #, safe-html, strict-same msgid "Move insert_and_[c]visit" msgstr "移动 insert++_++and++_[++c++]++visit" #: :1132 #, safe-html, strict-same msgid "" "```c++ template bool insert_and_visit(value_type&& obj, " "F1 f1, F2 f2); template bool insert_and_cvisit" "(value_type&& obj, F1 f1, F2 f2); ```" msgstr "" "```c++ template bool insert_and_visit" "(value_type&& obj, F1 f1, F2 f2); template bool insert_and_cvisit(value_type&& obj, F1 f1, F2 f2); " "```" #: :1137 #, safe-html, strict-same msgctxt ":1137" msgid "" "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." msgstr "" "当且仅当表中不存在键等价的元素时，将`obj`插入表中，随后使用新建元素的常量引用" "调用`f1`；否则使用等价元素的常量引用调用`f2`。" #: :1142 #, safe-html, strict-same msgctxt ":1142" msgid "" "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." msgstr "" "要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]。\n" "返回值：;; 执行插入操作则返回 `true`。\n" "并发特性：;; 对 `*this` 执行重哈希时会阻塞。\n" "备注：;; 执行重哈希后，指向元素的指针和引用将会失效。" #: :1147 #, safe-html, strict-same msgctxt ":1147" msgid "---" msgstr "---" #: :1149 #, safe-html, strict-same msgid "Transparent insert_and_[c]visit" msgstr "透明 insert++_++and++_[++c++]++visit（透明插入并 ++[++c++]++ 访问）" #: :1150 #, safe-html, strict-same msgid "" "```c++ template bool insert_and_visit(K&& k, F1 " "f1, F2 f2); template bool insert_and_cvisit(K&& " "k, F1 f1, F2 f2); ```" msgstr "" "```c++ template bool " "insert_and_visit(K&& k, F1 f1, F2 f2); template bool insert_and_cvisit(K&& k, F1 f1, F2 " "f2); ```" #: :1155 #, safe-html, strict-same msgid "" "Inserts an element constructed from `std::forward(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." msgstr "" "当且仅当容器中不存在键等价的元素时，将通过`std::forward(k)`构造的元素插入" "容器，随后使用新建元素的常量引用调用`f1`；否则使用等价元素的常量引用调" "用`f2`。" #: :1160 #, safe-html, strict-same msgctxt ":1160" msgid "" "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." msgstr "" "要求：;; `value_type` 可由 `k` 进行 https://en.cppreference.com/w/cpp/" "named_req/EmplaceConstructible[EmplaceConstructible^] 构造。\n" "返回值：;; 执行插入操作则返回 `true`。\n" "并发特性：;; 对 `*this` 执行重哈希时会阻塞。\n" "备注：;; 执行重哈希后，指向元素的指针和引用将会失效。\n" "\n" "这些重载仅当 `Hash::is_transparent` 与 `Pred::is_transparent` 为合法成员类型" "别名时才参与重载决议。标准库假定 `Hash` 可同时接受 `K` 与 `Key` 类型调用，且 " "`Pred` 是透明的。这实现了异构查找，避免了实例化 `Key` 类型对象的开销。" #: :1167 #, safe-html, strict-same msgctxt ":1167" msgid "---" msgstr "---" #: :1169 #, safe-html, strict-same msgid "Insert Iterator Range and Visit" msgstr "迭代器范围插入并访问" #: :1170 #, safe-html, strict-same msgid "" "```c++ template size_type " "insert_and_visit(InputIterator first, InputIterator last, F1 f1, F2 f2); " "template size_type insert_and_cvisit" "(InputIterator first, InputIterator last, F1 f1, F2 f2); ```" msgstr "" "```c++ template " "size_type insert_and_visit(InputIterator first, InputIterator last, F1 f1, " "F2 f2); template " "size_type insert_and_cvisit(InputIterator first, InputIterator last, F1 f1, " "F2 f2); ```" #: :1177 #, safe-html, strict-same msgctxt ":1177" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等效于 [listing,subs=\"+macros,+quotes\"]" #: :1184 #, safe-html, strict-same msgctxt ":1184" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 插入的元素数量。" #: :1186 #, safe-html, strict-same msgctxt ":1186" msgid "---" msgstr "---" #: :1188 #, safe-html, strict-same msgid "Insert Initializer List and Visit" msgstr "初始化列表插入并访问" #: :1189 #, safe-html, strict-same msgid "" "```c++ template size_type insert_and_visit" "(std::initializer_list il, F1 f1, F2 f2); template size_type insert_and_cvisit(std::initializer_list il, " "F1 f1, F2 f2); ```" msgstr "" "```c++ template size_type insert_and_visit" "(std::initializer_list il, F1 f1, F2 f2); template size_type insert_and_cvisit" "(std::initializer_list il, F1 f1, F2 f2); ```" #: :1196 #, safe-html, strict-same msgctxt ":1196" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等效于 [listing,subs=\"+macros,+quotes\"]" #: :1203 #, safe-html, strict-same msgctxt ":1203" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 插入的元素数量。" #: :1205 #, safe-html, strict-same msgctxt ":1205" msgid "---" msgstr "---" #: :1207 #, safe-html, strict-same msgid "erase" msgstr "擦除" #: :1208 #, safe-html, strict-same msgid "" "```c++ size_type erase(const key_type& k); template size_type erase" "(const K& k); ```" msgstr "" "```c++ size_type erase(const key_type& k); template " "size_type erase(const K& k); ```" #: :1213 #, safe-html, strict-same msgid "Erases the element with key equivalent to `k` if it exists." msgstr "若存在键与`k`等价的元素，则将其删除。" #: :1216 #, safe-html, strict-same msgid "" "Returns:;; The number of elements erased (0 or 1). Throws:;; Only throws an " "exception if it is thrown by `hasher` or `key_equal`. Notes:;; The " "`template` overload only participates 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." msgstr "" "返回值：;; 删除的元素数量（0 或 1）。\n" "抛出：;; 仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出异常。\n" "备注：;; `template` 重载仅当 `Hash::is_transparent` 和 " "`Pred::is_transparent` 为合法成员类型别名时才参与重载决议。标准库假定 `Hash` " "可同时接受 `K` 与 `Key` 类型调用，且 `Pred` 是透明的。这实现了异构查找，避免" "了实例化 `Key` 类型对象的开销。" #: :1220 #, safe-html, strict-same msgctxt ":1220" msgid "---" msgstr "---" #: :1222 #, safe-html, strict-same msgid "erase_if by Key" msgstr "通过键进行条件擦除" #: :1223 #, safe-html, strict-same msgid "" "```c++ template size_type erase_if(const key_type& k, F f); " "template size_type erase_if(const K& k, F f); ```" msgstr "" "```c++ template size_type erase_if(const key_type& k, F f)" "; template size_type erase_if(const K& " "k, F f); ```" #: :1228 #, safe-html, strict-same msgid "" "Erases the element `x` with key equivalent to `k` if it exists and `f(x)` is " "`true`." msgstr "若键与`k`等价的元素存在且`f(x)`为`true`，则删除该元素`x`。" #: :1231 #, safe-html, strict-same msgid "" "Returns:;; The number of elements erased (0 or 1). Throws:;; Only throws an " "exception if it is thrown by `hasher`, `key_equal` or `f`. Notes:;; The " "`template` overload only participates in overload " "resolution if " "`std::is_execution_policy_v>` is " "`false`. + + The `template` overload only participates 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." msgstr "" "返回值：;; 删除的元素数量（0 或 1）。\n" "抛出：;; 仅当 `hasher`、`key_equal` 或 `f` 抛出异常时才会抛出异常。\n" "备注：;; 仅当 " "`std::is_execution_policy_v>` 为 " "`false` 时，`template` 重载才参与重载决议" "。\n" "\n" "仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 为合法成员类型别名时" "，`template` 重载才参与重载决议。标准库假定 " "`Hash` 可同时接受 `K` 与 `Key` 类型调用，且 `Pred` 是透明的。这实现了异构查找" "，避免了实例化 `Key` 类型对象的开销。" #: :1237 #, safe-html, strict-same msgctxt ":1237" msgid "---" msgstr "---" #: :1239 #, safe-html, strict-same msgctxt ":1239" msgid "erase_if" msgstr "erase++_++if" #: :1240 #, safe-html, strict-same msgid "```c++ template size_type erase_if(F f); ```" msgstr "```c++ template size_type erase_if(F f); ```" #: :1244 #, safe-html, strict-same msgid "" "Successively invokes `f` with references to each of the elements in the " "table, and erases those for which `f` returns `true`." msgstr "依次以表中每个元素的引用调用`f`，并删除`f`返回`true`的元素。" #: :1247 #, safe-html, strict-same msgid "" "Returns:;; The number of elements erased. Throws:;; Only throws an exception " "if it is thrown by `f`." msgstr "" "返回值：;; 删除的元素数量。\n" "抛出：;; 仅当 `f` 抛出异常时才会抛出异常。" #: :1250 #, safe-html, strict-same msgctxt ":1250" msgid "---" msgstr "---" #: :1252 #, safe-html, strict-same msgid "Parallel erase_if" msgstr "并行条件擦除" #: :1253 #, safe-html, strict-same msgid "" "```c++ template void erase_if" "(ExecutionPolicy&& policy, F f); ```" msgstr "" "```c++ template void erase_if" "(ExecutionPolicy&& policy, F f); ```" #: :1257 #, safe-html, strict-same msgid "" "Invokes `f` with references to each of the elements in the table, and erases " "those for which `f` returns `true`. Execution is parallelized according to " "the semantics of the execution policy specified." msgstr "" "以表中每个元素的引用调用`f`，并删除`f`返回`true`的元素。执行过程将根据指定执" "行策略的语义进行并行化。" #: :1261 #, safe-html, strict-same msgid "" "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. + " "+ This overload only participates in overload resolution if " "`std::is_execution_policy_v>` is " "`true`. + + Unsequenced execution policies are not allowed." msgstr "" "抛出：;; 根据所使用执行策略的异常处理机制，若`f`内抛出异常，则可能调" "用`std::terminate`。\n" "备注：;; 仅在支持C++17并行算法的编译器中可用。\n" "\n" "该重载仅当`std::is_execution_policy_v" ">`为`true`时才参与重载决议。\n" "\n" "不允许使用无顺序执行策略。" #: :1268 #, safe-html, strict-same msgctxt ":1268" msgid "---" msgstr "---" #: :1270 #, safe-html, strict-same msgid "swap" msgstr "交换" #: :1271 #, safe-html, strict-same msgid "" "```c++ void swap(concurrent_flat_set& other) noexcept" "(boost::allocator_traits::is_always_equal::value || " "boost::allocator_traits::propagate_on_container_swap::value); ```" msgstr "" "```c++ void swap(concurrent_flat_set& other) noexcept" "(boost::allocator_traits::is_always_equal::value || " "boost::allocator_traits::propagate_on_container_swap::value); " "```" #: :1277 #, safe-html, strict-same msgid "Swaps the contents of the table with the parameter." msgstr "交换当前表与参数表的内容。" #: :1279 #, safe-html, strict-same msgid "" "If `Allocator::propagate_on_container_swap` is declared and " "`Allocator::propagate_on_container_swap::value` is `true` then the tables' " "allocators are swapped. Otherwise, swapping with unequal allocators results " "in undefined behavior." msgstr "" "若`Allocator::propagate_on_container_swap`已声明" "且`Allocator::propagate_on_container_swap::value`为`true`，则交换两个表的分配" "器。否则，使用不相等的分配器进行交换会导致未定义行为。" #: :1282 #, safe-html, strict-same msgid "" "Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping. " "Concurrency:;; Blocking on `*this` and `other`." msgstr "" "抛出：;; 除非`key_equal`或`hasher`在交换时抛出异常，否则不抛出任何异常。\n" "并发：;; 阻塞`*this`和`other`。" #: :1285 #, safe-html, strict-same msgctxt ":1285" msgid "---" msgstr "---" #: :1287 #, safe-html, strict-same msgid "clear" msgstr "清空" #: :1288 #, safe-html, strict-same msgid "```c++ void clear() noexcept; ```" msgstr "```c++ void clear() noexcept; ```" #: :1292 #, safe-html, strict-same msgid "Erases all elements in the table." msgstr "清空表中的所有元素。" #: :1295 #, safe-html, strict-same msgid "" "Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * " "bucket_count()` Concurrency:;; Blocking on `*this`." msgstr "" "后置条件：;; `size() == 0`，`max_load() >= max_load_factor() * " "bucket_count()`\n" "并发：;; 阻塞`*this`。" #: :1298 #, safe-html, strict-same msgctxt ":1298" msgid "---" msgstr "---" #: :1300 #, safe-html, strict-same msgid "merge" msgstr "合并" #: :1301 #, safe-html, strict-same msgid "" "```c++ template size_type merge(concurrent_flat_set& source); template size_type merge" "(concurrent_flat_set&& source); ```" msgstr "" "```c++ template size_type merge" "(concurrent_flat_set& source); " "template size_type merge" "(concurrent_flat_set&& source)" "; ```" #: :1308 #, safe-html, strict-same msgid "" "Move-inserts all the elements from `source` whose key is not already present " "in `*this`, and erases them from `source`." msgstr "" "将`source`中所有键尚未存在于`*this`中的元素移动插入，并从`source`中删除这些元" "素。" #: :1311 #, safe-html, strict-same msgid "" "Returns:;; The number of elements inserted. Concurrency:;; Blocking on " "`*this` and `source`." msgstr "" "返回值：;; 插入的元素数量。\n" "并发：;; 阻塞`*this`和`source`。" #: :1314 #, safe-html, strict-same msgctxt ":1314" msgid "---" msgstr "---" #: :1316 #, safe-html, strict-same msgid "Observers" msgstr "观察器" #: :1318 #, safe-html, strict-same msgid "get_allocator" msgstr "get_allocator" #: :1319 #, safe-html, strict-same msgid "``` allocator_type get_allocator() const noexcept; ```" msgstr "``` allocator_type get_allocator() const noexcept; ```" #: :1324 #, safe-html, strict-same msgid "Returns:;; The table's allocator." msgstr "返回值：;; 表的分配器。" #: :1326 #, safe-html, strict-same msgctxt ":1326" msgid "---" msgstr "---" #: :1328 #, safe-html, strict-same msgid "hash_function" msgstr "哈希函数" #: :1329 #, safe-html, strict-same msgid "``` hasher hash_function() const; ```" msgstr "``` hasher hash_function() const; ```" #: :1334 #, safe-html, strict-same msgid "Returns:;; The table's hash function." msgstr "返回值：;; 表的哈希函数。" #: :1336 #, safe-html, strict-same msgctxt ":1336" msgid "---" msgstr "---" #: :1338 #, safe-html, strict-same msgid "key_eq" msgstr "key_eq" #: :1339 #, safe-html, strict-same msgid "``` key_equal key_eq() const; ```" msgstr "``` key_equal key_eq() const; ```" #: :1344 #, safe-html, strict-same msgid "Returns:;; The table's key equality predicate." msgstr "返回值：;; 表的键相等性断言。" #: :1346 #, safe-html, strict-same msgctxt ":1346" msgid "---" msgstr "---" #: :1348 #, safe-html, strict-same msgid "Set Operations" msgstr "集合操作" #: :1350 #, safe-html, strict-same msgid "count" msgstr "count" #: :1351 #, safe-html, strict-same msgid "" "```c++ size_type count(const key_type& k) const; template " "size_type count(const K& k) const; ```" msgstr "" "```c++ size_type count(const key_type& k) const; template size_type count(const K& k) const; ```" #: :1358 #, safe-html, strict-same msgid "" "Returns:;; The number of elements with key equivalent to `k` (0 or 1). " "Notes:;; The `template` overload only participates 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. + + In " "the presence of concurrent insertion operations, the value returned may not " "accurately reflect the true state of the table right after execution." msgstr "" "返回值：;; 键与`k`等价的元素数量（0 或 1）。\n" "备注：;; `template` 重载仅当 `Hash::is_transparent` 和 " "`Pred::is_transparent` 为合法成员类型别名时才参与重载决议。标准库假定 `Hash` " "可同时接受 `K` 与 `Key` 类型调用，且 `Pred` 是透明的。这实现了异构查找，避免" "了实例化 `Key` 类型对象的开销。\n" "\n" "在存在并发插入操作时，返回的值可能无法准确反映执行后表的真实状态。" #: :1364 #, safe-html, strict-same msgctxt ":1364" msgid "---" msgstr "---" #: :1366 #, safe-html, strict-same msgid "contains" msgstr "包含" #: :1367 #, safe-html, strict-same msgid "" "```c++ bool contains(const key_type& k) const; template " "bool contains(const K& k) const; ```" msgstr "" "```c++ bool contains(const key_type& k) const; " "template bool contains(const K& k) const; ```" #: :1374 #, safe-html, strict-same msgid "" "Returns:;; A boolean indicating whether or not there is an element with key " "equal to `k` in the table. Notes:;; The `template` overload only " "participates 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. + + In the presence of concurrent insertion " "operations, the value returned may not accurately reflect the true state of " "the table right after execution." msgstr "" "返回值：;; 布尔值，表示表中是否存在键与`k`相等的元素。\n" "备注：;; `template` 重载仅当 `Hash::is_transparent` 和 " "`Pred::is_transparent` 为合法成员类型别名时才参与重载决议。标准库假定 `Hash` " "可同时接受 `K` 与 `Key` 类型调用，且 `Pred` 是透明的。这实现了异构查找，避免" "了实例化 `Key` 类型对象的开销。\n" "在存在并发插入操作时，返回的值可能无法准确反映执行后表的真实状态。" #: :1380 #, safe-html, strict-same msgctxt ":1380" msgid "---" msgstr "---" #: :1381 #, safe-html, strict-same msgid "Bucket Interface" msgstr "桶接口" #: :1383 #, safe-html, strict-same msgid "bucket_count" msgstr "bucket_count" #: :1384 #, safe-html, strict-same msgid "```c++ size_type bucket_count() const noexcept; ```" msgstr "```c++ size_type bucket_count() const noexcept; ```" #: :1389 #, safe-html, strict-same msgid "Returns:;; The size of the bucket array." msgstr "返回值：;; 哈希桶数组的大小。" #: :1391 #, safe-html, strict-same msgctxt ":1391" msgid "---" msgstr "---" #: :1393 #, safe-html, strict-same msgid "Hash Policy" msgstr "哈希策略" #: :1395 #, safe-html, strict-same msgid "load_factor" msgstr "负载因子" #: :1396 #, safe-html, strict-same msgid "```c++ float load_factor() const noexcept; ```" msgstr "```c++ float load_factor() const noexcept; ```" #: :1401 #, safe-html, strict-same msgid "" "Returns:;; `static_cast(size())/static_cast(bucket_count())`, " "or `0` if `bucket_count() == 0`." msgstr "" "返回值：;; `static_cast(size()) / static_cast(bucket_count())" "`；若`bucket_count() == 0`，则返回`0`。" #: :1403 #, safe-html, strict-same msgctxt ":1403" msgid "---" msgstr "---" #: :1405 #, safe-html, strict-same msgid "max_load_factor" msgstr "max_load_factor" #: :1407 #, safe-html, strict-same msgid "```c++ float max_load_factor() const noexcept; ```" msgstr "```c++ float max_load_factor() const noexcept; ```" #: :1412 #, safe-html, strict-same msgid "Returns:;; Returns the table's maximum load factor." msgstr "返回值：;; 返回哈希表的最大负载因子。" #: :1414 #, safe-html, strict-same msgctxt ":1414" msgid "---" msgstr "---" #: :1416 #, safe-html, strict-same msgid "Set max_load_factor" msgstr "设置最大负载因子" #: :1417 #, safe-html, strict-same msgid "```c++ void max_load_factor(float z); ```" msgstr "```c++ void max_load_factor(float z); ```" #: :1422 #, safe-html, strict-same msgid "" "Effects:;; Does nothing, as the user is not allowed to change this " "parameter. Kept for compatibility with `boost::unordered_set`." msgstr "" "效果：;; 不执行任何操作，因为不允许用户修改此参数。保留该函数是为了与 " "`boost::unordered_set` 保持兼容。" #: :1424 #, safe-html, strict-same msgctxt ":1424" msgid "---" msgstr "---" #: :1427 #, safe-html, strict-same msgid "max_load" msgstr "max_load（最大负载）" #: :1429 #, safe-html, strict-same msgid "```c++ size_type max_load() const noexcept; ```" msgstr "```c++ size_type max_load() const noexcept; ```" #: :1434 #, safe-html, strict-same msgid "" "Returns:;; The maximum number of elements the table can hold without " "rehashing, assuming that no further elements will be erased. Note:;; After " "construction, rehash or clearance, the table's maximum load is at least " "`max_load_factor() * bucket_count()`. This number may decrease on erasure " "under high-load conditions. + + In the presence of concurrent insertion " "operations, the value returned may not accurately reflect the true state of " "the table right after execution." msgstr "" "返回值：;; 哈希表在不进行重哈希的前提下可容纳的最大元素数量（假设不会再删除任" "何元素）。\n" "备注：;; 构造完成、重哈希或清空后，哈希表的最大负载至少为 `max_load_factor() " "* bucket_count()`。在高负载条件下执行删除操作后，该数值可能会降低。\n" "在存在并发插入操作时，返回的值可能无法准确反映执行后哈希表的真实状态。" #: :1441 #, safe-html, strict-same msgctxt ":1441" msgid "---" msgstr "---" #: :1443 #, safe-html, strict-same msgid "rehash" msgstr "重哈希" #: :1444 #, safe-html, strict-same msgid "```c++ void rehash(size_type n); ```" msgstr "```c++ void rehash(size_type n); ```" #: :1448 #, safe-html, strict-same msgid "" "Changes if necessary the size of the bucket array so that there are at least " "`n` buckets, and so that the load factor is less than or equal to the " "maximum load factor. When applicable, this will either grow or shrink the " "`bucket_count()` associated with the table." msgstr "" "效果：;; 必要时调整哈希桶数组的大小，使桶数量至少为 `n`，且负载因子小于等于最" "大负载因子。\n" "适用情况下，该操作会**增大或缩小**哈希表的桶数量（`bucket_count()`）。" #: :1450 #, safe-html, strict-same msgid "" "When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array." msgstr "当 `size() == 0` 时，`rehash(0)` 会释放底层的哈希桶数组内存。" #: :1452 #, safe-html, strict-same msgctxt ":1452" msgid "" "Invalidates pointers and references to elements, and changes the order of " "elements." msgstr "会使指向元素的指针和引用失效，并改变元素的存储顺序。" #: :1455 #, safe-html, strict-same msgid "" "Throws:;; The function has no effect if an exception is thrown, unless it is " "thrown by the table's hash function or comparison function. Concurrency:;; " "Blocking on `*this`. ---" msgstr "" "抛出：;; 若抛出异常，函数无任何效果（哈希函数或比较函数抛出的异常除外）。\n" "并发：;; 阻塞`*this`。\n" "---" #: :1459 #, safe-html, strict-same msgid "reserve" msgstr "保留" #: :1460 #, safe-html, strict-same msgid "```c++ void reserve(size_type n); ```" msgstr "```c++ void reserve(size_type n); ```" #: :1464 #, safe-html, strict-same msgid "Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`." msgstr "等价于 `a.rehash(ceil(n / a.max_load_factor()))`。" #: :1466 #, safe-html, strict-same msgid "" "Similar to `rehash`, this function can be used to grow or shrink the number " "of buckets in the table." msgstr "与 `rehash` 功能类似，该函数可用于**增加或减少**哈希表中的桶数量。" #: :1468 #, safe-html, strict-same msgctxt ":1468" msgid "" "Invalidates pointers and references to elements, and changes the order of " "elements." msgstr "会使指向元素的指针和引用失效，并改变元素的存储顺序。" #: :1471 #, safe-html, strict-same msgid "" "Throws:;; The function has no effect if an exception is thrown, unless it is " "thrown by the table's hash function or comparison function. Concurrency:;; " "Blocking on `*this`." msgstr "" "抛出：;; 若抛出异常，函数不会产生任何效果（哈希表的哈希函数或比较函数抛出的异" "常除外）。\n" "并发：;; 阻塞`*this`。" #: :1474 #, safe-html, strict-same msgctxt ":1474" msgid "---" msgstr "---" #: :1476 #, safe-html, strict-same msgid "Statistics" msgstr "统计信息" #: :1478 #, safe-html, strict-same msgid "get_stats" msgstr "get_stats" #: :1479 #, safe-html, strict-same msgid "```c++ stats get_stats() const; ```" msgstr "```c++ stats get_stats() const; ```" #: :1484 #, safe-html, strict-same msgid "" "Returns:;; A statistical description of the insertion and lookup operations " "performed by the table so far. Notes:;; Only available if xref:reference/" "stats.adoc#stats[statistics calculation] is " "xref:concurrent_flat_set_boost_unordered_enable_stats[enabled]." msgstr "" "返回值：;; 该哈希表迄今为止执行的插入与查找操作的统计信息。\n" "备注：;; 仅当 xref:reference/stats.adoc#stats[统计计算] 被 " "xref:concurrent_flat_set_boost_unordered_enable_stats[启用] 时，本接口方可使" "用。" #: :1487 #, safe-html, strict-same msgctxt ":1487" msgid "---" msgstr "---" #: :1489 #, safe-html, strict-same msgid "reset_stats" msgstr "reset_stats" #: :1490 #, safe-html, strict-same msgid "```c++ void reset_stats() noexcept; ```" msgstr "```c++ void reset_stats() noexcept; ```" #: :1495 #, safe-html, strict-same msgid "" "Effects:;; Sets to zero the internal statistics kept by the table. Notes:;; " "Only available if xref:reference/stats.adoc#stats[statistics calculation] is " "xref:concurrent_flat_set_boost_unordered_enable_stats[enabled]." msgstr "" "效果：;; 将哈希表内部统计数据置零。\n" "备注：;; 仅当 xref:reference/stats.adoc#stats[统计计算] 被 " "xref:concurrent_flat_set_boost_unordered_enable_stats[启用] 时，本接口方可使" "用。" #: :1498 #, safe-html, strict-same msgctxt ":1498" msgid "---" msgstr "---" #: :1500 #, safe-html, strict-same msgid "Deduction Guides" msgstr "推导指引" #: :1501 #, safe-html, strict-same msgid "" "A deduction guide will not participate in overload resolution if any of the " "following are true:" msgstr "如果以下任何一条件为真，则推导指引将不参与重载决议：" #: :1503 #, safe-html, strict-same msgid "" "- It has an `InputIterator` template parameter and a type that does not " "qualify as an input iterator is deduced for that parameter. - It has an " "`Allocator` template parameter and a type that does not qualify as an " "allocator is deduced for that parameter. - It has a `Hash` template " "parameter and an integral type or a type that qualifies as an allocator is " "deduced for that parameter. - It has a `Pred` template parameter and a type " "that qualifies as an allocator is deduced for that parameter." msgstr "" "- 该推导指引包含 `InputIterator` 模板参数，且为此参数推导出的类型不符合输入迭" "代器的要求。 - 该推导指引包含 `Allocator` 模板参数，且为该参数推导出的类型不" "符合分配器要求。 - 该推导指引包含 `Hash` 模板参数，且为该参数推导出的类型为整" "型或符合分配器要求。 - 该推导指引包含 `Pred` 模板参数，且为该参数推导出的类型" "符合分配器要求。" #: :1508 #, safe-html, strict-same msgid "" "A `size_­type` parameter type in a deduction guide refers to the `size_­type` " "member type of the container type deduced by the deduction guide. Its " "default value coincides with the default value of the constructor selected." msgstr "" "推导指引中的 `size++_++type` 参数类型，指向由该推导指引所推导容器类型的 " "`size++_++type` 成员类型。其默认值与所选构造函数的默认值一致。" #: :1512 #, safe-html, strict-same msgid "__iter-value-type__" msgstr "_iter-value-type_" #: :1520 #, safe-html, strict-same msgid "Equality Comparisons" msgstr "相等性比较" #: :1522 #, safe-html, strict-same msgid "operator" msgstr "operator" #: :1523 #, safe-html, strict-same msgid "" "```c++ template bool " "operator==(const concurrent_flat_set& x, const " "concurrent_flat_set& y); ```" msgstr "" "```c++ template " "bool operator==(const concurrent_flat_set& x, const concurrent_flat_set& y); ```" #: :1529 #, safe-html, strict-same msgid "" "Returns `true` if `x.size() == y.size()` and for every element in `x`, there " "is an element in `y` with the same key, with an equal value (using " "`operator==` to compare the value types)." msgstr "" "若 x.size() == y.size()，且对于 x 中的每个元素，y 中均存在一个具有相同键、值" "相等（使用 operator== 比较值类型）的元素，则返回 true。" #: :1532 #, safe-html, strict-same msgctxt ":1532" msgid "" "Concurrency:;; Blocking on `x` and `y`. Notes:;; Behavior is undefined if " "the two tables don't have equivalent equality predicates." msgstr "" "并发：;; 对`x`和`y`进行阻塞。\n" "备注：;; 若两个哈希表的相等判断谓词不一致，行为未定义。" #: :1535 #, safe-html, strict-same msgctxt ":1535" msgid "---" msgstr "---" #: :1537 #, safe-html, strict-same msgid "operator!" msgstr "operator!" #: :1538 #, safe-html, strict-same msgid "" "```c++ template bool " "operator!=(const concurrent_flat_set& x, const " "concurrent_flat_set& y); ```" msgstr "" "```c++ template " "bool operator!=(const concurrent_flat_set& x, const concurrent_flat_set& y); ```" #: :1544 #, safe-html, strict-same msgid "" "Returns `false` if `x.size() == y.size()` and for every element in `x`, " "there is an element in `y` with the same key, with an equal value (using " "`operator==` to compare the value types)." msgstr "" "若 x.size() == y.size()，且对于 x 中的每个元素，y 中均存在一个具有相同键、值" "相等（使用 operator== 比较值类型）的元素，则返回 false。" #: :1547 #, safe-html, strict-same msgctxt ":1547" msgid "" "Concurrency:;; Blocking on `x` and `y`. Notes:;; Behavior is undefined if " "the two tables don't have equivalent equality predicates." msgstr "" "并发：;; 阻塞`x`与`y`。\n" "备注：;; 若两个哈希表的相等谓词不兼容，行为未定义。" #: :1550 #, safe-html, strict-same msgctxt ":1550" msgid "---" msgstr "---" #: :1552 #, safe-html, strict-same msgid "Swap" msgstr "交换" #: :1553 #, safe-html, strict-same msgid "" "```c++ template void swap" "(concurrent_flat_set& x, concurrent_flat_set& y) noexcept(noexcept(x.swap(y))); ```" msgstr "" "```c++ template " "void swap(concurrent_flat_set& x, " "concurrent_flat_set& y) noexcept" "(noexcept(x.swap(y))); ```" #: :1560 #, safe-html, strict-same msgctxt ":1560" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等价于 [listing,subs=\"+macros,+quotes\"]" #: :1566 #, safe-html, strict-same msgctxt ":1566" msgid "---" msgstr "---" #: :1568 #, safe-html, strict-same msgctxt ":1568" msgid "erase_if" msgstr "erase_if" #: :1569 #, safe-html, strict-same msgid "" "```c++ template " "typename concurrent_flat_set::size_type erase_if" "(concurrent_flat_set& c, Predicate pred); ```" msgstr "" "```c++ template typename concurrent_flat_set" "::size_type erase_if(concurrent_flat_set& c, " "Predicate pred); ```" #: :1575 #, safe-html, strict-same msgctxt ":1575" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等价于 [listing,subs=\"+macros,+quotes\"]" #: :1581 #, safe-html, strict-same msgid "Serialization" msgstr "序列化" #: :1583 #, safe-html, strict-same msgid "" "``concurrent_flat_set``s can be archived/retrieved by means of link:../../../" "../../serialization/index.html[Boost.Serialization^] using the API provided " "by this library. Both regular and XML archives are supported." msgstr "" "可通过本库提供的 API ，借助 link:../../../../../serialization/" "index.html[Boost.Serialization] 实现档归档/检索 " "`concurrent++_++flat++_++set` 。同时支持常规格式与 XML 格式的归档文件。" #: :1587 #, safe-html, strict-same msgid "Saving an concurrent_flat_set to an archive" msgstr "将 concurrent++_++flat++_++set 保存到归档" #: :1589 #, safe-html, strict-same msgid "" "Saves all the elements of a `concurrent_flat_set` `x` to an archive (XML " "archive) `ar`." msgstr "" "将 `concurrent++_++flat++_++set` 容器 `x` 的所有元素保存到归档（XML 归档） " "`ar` 中。" #: :1592 #, safe-html, strict-same msgid "" "Requires:;; `value_type` is serializable (XML serializable), and it supports " "Boost.Serialization `save_construct_data`/`load_construct_data` protocol " "(automatically suported by https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^] types). Concurrency:;; Blocking " "on `x`." msgstr "" "要求;; `value++_++type` 必须可序列化（支持 XML 序列化），且需要支持 " "Boost.Serialization 的 `save++_++construct++_++data` / " "`load++_++construct++_++data` 协议（该协议自动支持满足 https://" "en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造] 要求的类" "型）。 并发性;; 阻塞于 `x` 。" #: :1598 #, safe-html, strict-same msgctxt ":1598" msgid "---" msgstr "---" #: :1600 #, safe-html, strict-same msgid "Loading an concurrent_flat_set from an archive" msgstr "从归档加载 concurrent++_++flat++_++set" #: :1602 #, safe-html, strict-same msgid "" "Deletes all preexisting elements of a `concurrent_flat_set` `x` and inserts " "from an archive (XML archive) `ar` restored copies of the elements of the " "original `concurrent_flat_set` `other` saved to the storage read by `ar`." msgstr "" "删除 `concurrent++_++flat++_++set` 容器 `x` 中的所有现有元素，并从归档 `ar` " "（XML格式归档）中读取原始 `concurrent++_++flat++_++set` 容器 `other` 保存的元" "素副本并插入到 `x` 。" #: :1607 #, safe-html, strict-same msgid "" "Requires:;; `x.key_equal()` is functionally equivalent to `other.key_equal()" "`. Concurrency:;; Blocking on `x`." msgstr "" "要求;; `x.key++_++equal()` 需要在功能上等价于 `other.key++_++equal()` 。 并发" "性;; 阻塞于 `x` 。"