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 04:07+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_node_map]" msgstr "[#concurrent_node_map]" #: :2 #, safe-html, strict-same msgid "Class Template concurrent_node_map" msgstr "类模板 concurrent++_++node++_++map" #: :4 #, safe-html, strict-same msgid ":idprefix: concurrent_node_map_" msgstr ":idprefix: concurrent_node_map_" #: :6 #, safe-html, strict-same msgid "" "`boost::concurrent_node_map` — A node-based hash table that associates " "unique keys with another value and allows for concurrent element insertion, " "erasure, lookup and access without external synchronization mechanisms." msgstr "" "`boost::concurrent++_++node++_++map` —— 一种基于节点的哈希表，用于建立唯一键" "与对应值的关联，并支持在无外部同步机制的情况下并发执行元素插入、擦除、查找和" "访问操作。" #: :10 #, safe-html, strict-same msgid "" "Even though it acts as a container, `boost::concurrent_node_map` 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 and " "modification are done through user-provided _visitation functions_ that are " "passed to `concurrent_node_map` operations where they are executed " "internally in a controlled fashion. Such visitation-based API allows for low-" "contention concurrent usage scenarios." msgstr "" "尽管 `boost::concurrent++_++node++_++map` 的行为类似于容器，但它并不符合标准 " "C{plus}{plus} 的 https://en.cppreference.com/w/cpp/named_req/Container[容器] " "概念模型。具体而言，它不提供迭代器及相关操作（如 `begin` 、 `end` 等）。元素" "的访问和修改通过用户提供的__访问函数__来实现，这些函数被传递至 " "`concurrent++_++node++_++map` 的操作中，并在其内部以受控方式执行。这种基于访" "问的 API 设计能够支持低争用的并发应用场景。" #: :17 #, safe-html, strict-same msgid "" "The internal data structure of `boost::concurrent_node_map` is similar to " "that of `boost::unordered_node_map`. Unlike `boost::concurrent_flat_map`, " "pointer stability and node handling functionalities are provided, at the " "expense of potentially lower performance." msgstr "" "`boost::concurrent++_++node++_++map` 的内部数据结构与 " "`boost::unordered++_++node++_++map` 类似。与 " "`boost::concurrent++_++flat++_++map` 不同，它提供了指针稳定性和节点处理功能，" "但代价是可能带来性能上的损失。" #: :21 #, safe-html, strict-same msgid "Synopsis" msgstr "概要" #: :347 #, safe-html, strict-same msgctxt ":347" msgid "---" msgstr "---" #: :349 #, safe-html, strict-same msgid "Description" msgstr "描述" #: :351 #, safe-html, strict-same msgid "*Template Parameters*" msgstr "*模板参数*" #: :354 #, safe-html, strict-same msgid "_Key_" msgstr "_键_" #: :358 #, safe-html, strict-same msgid "" "into the table from any `std::pair` object convertible to it, and it also " "must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from " "the table." msgstr "" "`std::pair` 对象 https://en.cppreference.com/w/cpp/named_req/" "EmplaceConstructible[原地构造] 到容器中，并且必须支持从容器中 https://" "en.cppreference.com/w/cpp/named_req/Erasable[擦除] 。" #: :361 #, safe-html, strict-same msgid "_T_" msgstr "_T_" #: :361 #, safe-html, strict-same msgid "_Hash_" msgstr "_Hash_" #: :361 #, 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`" #: :361 #, safe-html, strict-same msgid "_Pred_" msgstr "_Pred_" #: :361 #, 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类型的值。" #: :361 #, safe-html, strict-same msgid "_Allocator_" msgstr "_Allocator_" #: :361 #, safe-html, strict-same msgid "An allocator whose value type is the same as the table's value type." msgstr "值类型与该表的值类型一致的分配器。" #: :371 #, safe-html, strict-same msgid "" "Allocators using https://en.cppreference.com/w/cpp/named_req/" "Allocator#Fancy_pointers[fancy pointers] are supported." msgstr "" "支持使用 https://en.cppreference.com/w/cpp/named_req/" "Allocator#Fancy_pointers[花式指针] 的分配器。" #: :375 #, safe-html, strict-same msgid "" "The element nodes of the table are held into an internal _bucket array_. An " "node is inserted into a bucket determined by the hash code of its element, " "but if the bucket is already occupied (a _collision_), an available one in " "the vicinity of the original position is used." msgstr "" "哈希表的元素节点存储在内部**桶数组**中。节点会根据其元素的哈希值插入到对应的" "桶中；若该桶已被占用（即发生**哈希冲突**），则使用原位置附近的可用桶。" #: :379 #, 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()`，仅在尺寸极小时，实现可能允许更高的负载。" #: :384 #, 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`，则直接使用原哈希函数；否则会添加一个比特混合后处理阶段，以额外计算开" "销为代价提升哈希质量。" #: :388 #, safe-html, strict-same msgctxt ":388" msgid "---" msgstr "---" #: :390 #, safe-html, strict-same msgid "Concurrency Requirements and Guarantees" msgstr "并发要求与保证" #: :392 #, 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` 上并发调用以下操作时不得引入数据竞争：" #: :397 #, safe-html, strict-same msgid "Copy construction from `al` of an allocator rebound from `Alloc`" msgstr "从 `al` 复制构造重新绑定的分配器" #: :398 #, safe-html, strict-same msgid "`std::allocator_traits::allocate`" msgstr "`std::allocator_traits::allocate`" #: :399 #, safe-html, strict-same msgid "`std::allocator_traits::deallocate`" msgstr "`std::allocator_traits::deallocate`" #: :400 #, safe-html, strict-same msgid "`std::allocator_traits::construct`" msgstr "`std::allocator_traits::construct`" #: :401 #, safe-html, strict-same msgid "`std::allocator_traits::destroy`" msgstr "`std::allocator_traits::destroy`" #: :403 #, 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` 这些类型不包含状态，或其操作仅涉" "及对内部数据成员的常量访问，即可满足上述要求。" #: :406 #, safe-html, strict-same msgid "" "With the exception of destruction, concurrent invocations of any operation " "on the same instance of a `concurrent_node_map` do not introduce data races " "— that is, they are thread-safe." msgstr "" "除析构操作外，对同一个 `concurrent++_++node++_++map` 实例并发调用任何操作都不" "会引入数据竞争——即这些操作是线程安全的。" #: :409 #, 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_node_map`, prior blocking " "operations on `x` synchronize with *op*. So, blocking operations on the same " "`concurrent_node_map` execute sequentially in a multithreaded scenario." msgstr "" "如果某个操作 *op* 被显式指定为__阻塞于__ `x` （其中 `x` 是 " "`boost::concurrent++_++node++_++map` 的实例），则先前对 `x` 的阻塞操作将与 " "*op* 同步。因此，在多线程场景中，对同一 `concurrent++_++node++_++map` 的阻塞" "操作将按顺序执行。" #: :413 #, 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`_ 的重" "哈希过程__。" #: :416 #, safe-html, strict-same msgid "" "When executed internally by a `boost::concurrent_node_map`, the following " "operations by a user-provided visitation function on the element passed do " "not introduce data races:" msgstr "" "当由 `boost::concurrent++_++node++_++map` 在内部执行时，用户提供的访问函数对" "传递的元素执行以下操作不会引入数据竞争：" #: :419 #, safe-html, strict-same msgid "Read access to the element." msgstr "对元素的读取访问。" #: :420 #, safe-html, strict-same msgid "Non-mutable modification of the element." msgstr "对元素的非可变修改。" #: :421 #, safe-html, strict-same msgid "Mutable modification of the element:" msgstr "对元素的可变修改：" #: :422 #, 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` 的非常量容器函数中，此条件适用于最后一个（或唯一一个）访问函" "数。" #: :425 #, safe-html, strict-same msgid "" "Any `boost::concurrent_node_map operation` that inserts or modifies an " "element `e` synchronizes with the internal invocation of a visitation " "function on `e`." msgstr "" "任何插入或修改元素 `e` 的 `boost::concurrent++_++node++_++map 操作 ` 都会与" "对 `e` 执行的内部访问函数的调用同步。" #: :428 #, safe-html, strict-same msgid "" "Visitation functions executed by a `boost::concurrent_node_map` `x` are not " "allowed to invoke any operation on `x`; invoking operations on a different " "`boost::concurrent_node_map` instance `y` is allowed only if concurrent " "outstanding operations on `y` do not access `x` directly or indirectly." msgstr "" "由 `boost::concurrent++_++node++_++map` 实例 `x` 执行的访问函数不允许调用 " "`x` 上的任何操作；仅当对另一 `boost::concurrent++_++node++_++map` 实例 `y` 的" "并发未完成操作不会直接或间接访问 `x` 时，才会允许调用 `y` 上的操作。" #: :432 #, safe-html, strict-same msgctxt ":432" msgid "---" msgstr "---" #: :434 #, safe-html, strict-same msgid "Configuration Macros" msgstr "配置宏" #: :436 #, safe-html, strict-same msgid "`BOOST_UNORDERED_DISABLE_REENTRANCY_CHECK`" msgstr "`BOOST_UNORDERED_DISABLE_REENTRANCY_CHECK`" #: :438 #, 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` 发出信号。若需关注运行时速度，可通过全局" "定义此宏来禁用该功能。" #: :445 #, safe-html, strict-same msgctxt ":445" msgid "---" msgstr "---" #: :447 #, safe-html, strict-same msgid "`BOOST_UNORDERED_ENABLE_STATS`" msgstr "`BOOST_UNORDERED_ENABLE_STATS`" #: :449 #, 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[统计计算] 功能。请注" "意，此选项会降低多数操作的总体性能。" #: :452 #, safe-html, strict-same msgctxt ":452" msgid "---" msgstr "---" #: :454 #, safe-html, strict-same msgid "Typedefs" msgstr "类型定义" #: :461 #, safe-html, strict-same msgid "" "A class for holding extracted table elements, modelling https://" "en.cppreference.com/w/cpp/container/node_handle[NodeHandle]." msgstr "" "用于保存提取的表元素的类，建模为 https://en.cppreference.com/w/cpp/container/" "node_handle[NodeHandle] 。" #: :464 #, safe-html, strict-same msgctxt ":464" msgid "---" msgstr "---" #: :471 #, safe-html, strict-same msgid "A specialization of an internal class template:" msgstr "内部类模板的特化：" #: :483 #, safe-html, strict-same msgid "with `NodeType` = `node_type`." msgstr "其中 `NodeType` = `node++_++type` 。" #: :485 #, safe-html, strict-same msgctxt ":485" msgid "---" msgstr "---" #: :487 #, safe-html, strict-same msgid "Constants" msgstr "常量" #: :489 #, safe-html, strict-same msgid "```cpp static constexpr size_type bulk_visit_size; ```" msgstr "```cpp static constexpr size_type bulk_visit_size; ```" #: :493 #, safe-html, strict-same msgid "" "Chunk size internally used in xref:concurrent_node_map_bulk_visit[bulk " "visit] operations." msgstr "内部用于 xref:concurrent_node_map_bulk_visit[批量访问] 操作的块大小。" #: :495 #, safe-html, strict-same msgctxt ":495" msgid "---" msgstr "---" #: :497 #, safe-html, strict-same msgid "Constructors" msgstr "构造函数" #: :499 #, safe-html, strict-same msgid "Default Constructor" msgstr "默认构造函数" #: :500 #, safe-html, strict-same msgid "```c++ concurrent_node_map(); ```" msgstr "```c++ concurrent_node_map(); ```" #: :504 #, 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()` 作为分配器。" #: :508 #, safe-html, strict-same msgctxt ":508" 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[默认可构" "造]。" #: :511 #, safe-html, strict-same msgctxt ":511" msgid "---" msgstr "---" #: :513 #, safe-html, strict-same msgid "Bucket Count Constructor" msgstr "桶数构造函数" #: :514 #, safe-html, strict-same msgid "" "```c++ explicit concurrent_node_map(size_type n, const hasher& hf = hasher()" ", const key_equal& eql = key_equal(), const allocator_type& a = " "allocator_type()); ```" msgstr "" "```c++ explicit concurrent_node_map(size_type n, const hasher& hf = " "hasher(), const key_equal& eql = key_equal(), const allocator_type& " "a = allocator_type()); ```" #: :521 #, 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` 作为分配器。" #: :525 #, safe-html, strict-same msgctxt ":525" 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[默认可构" "造]。" #: :528 #, safe-html, strict-same msgctxt ":528" msgid "---" msgstr "---" #: :530 #, safe-html, strict-same msgid "Iterator Range Constructor" msgstr "迭代器范围构造函数" #: :541 #, 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)` 范围内的元素插入其中。" #: :544 #, safe-html, strict-same msgctxt ":544" 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[可默" "认构造] 要求。" #: :546 #, safe-html, strict-same msgctxt ":546" msgid "---" msgstr "---" #: :548 #, safe-html, strict-same msgid "Copy Constructor" msgstr "复制构造函数" #: :549 #, safe-html, strict-same msgid "```c++ concurrent_node_map(concurrent_node_map const& other); ```" msgstr "```c++ concurrent_node_map(concurrent_node_map const& other); ```" #: :553 #, safe-html, strict-same msgid "" "The copy constructor. Copies the contained elements, hash function, " "predicate and allocator." msgstr "**复制构造函数**。复制容器内元素、哈希函数、谓词及分配器。" #: :555 #, 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` 存在且签名正确，则分配" "器将由其返回值构造。" #: :558 #, safe-html, strict-same msgid "" "Requires:;; `value_type` is copy constructible Concurrency:;; Blocking on " "`other`." msgstr "" "要求：;; `value_type` 是可复制构造的\n" "并发：;; 阻塞 `other`" #: :561 #, safe-html, strict-same msgctxt ":561" msgid "---" msgstr "---" #: :563 #, safe-html, strict-same msgid "Move Constructor" msgstr "移动构造函数" #: :564 #, safe-html, strict-same msgid "```c++ concurrent_node_map(concurrent_node_map&& other); ```" msgstr "```c++ concurrent_node_map(concurrent_node_map&& other); ```" #: :568 #, 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_node_map_boost_unordered_enable_stats[enabled], transfers " "the internal statistical information from `other` and calls " "`other.reset_stats()`." msgstr "" "移动构造函数。将 `other` 的内部桶数组直接转移到新哈希表中。哈希函数、谓词和分" "配器均从 `other` 移动构造而来。若启用了 " "xref:concurrent_node_map_boost_unordered_enable_stats[统计功能]，则从 " "`other` 转移内部统计信息，并调用 `other.reset_stats()`。" #: :574 #, safe-html, strict-same msgctxt ":574" msgid "Concurrency:;; Blocking on `other`." msgstr "并发：;; 阻塞 `other`。" #: :576 #, safe-html, strict-same msgctxt ":576" msgid "---" msgstr "---" #: :578 #, safe-html, strict-same msgid "Iterator Range Constructor with Allocator" msgstr "带分配器的迭代器范围构造函数" #: :579 #, safe-html, strict-same msgid "" "```c++ template concurrent_node_map(InputIterator f, " "InputIterator l, const allocator_type& a); ```" msgstr "" "```c++ template concurrent_node_map(InputIterator " "f, InputIterator l, const allocator_type& a); ```" #: :584 #, 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)" "` 范围内的元素插入其中。" #: :587 #, safe-html, strict-same msgctxt ":587" 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[默认可构造]。" #: :589 #, safe-html, strict-same msgctxt ":589" msgid "---" msgstr "---" #: :591 #, safe-html, strict-same msgid "Allocator Constructor" msgstr "分配器构造函数" #: :592 #, safe-html, strict-same msgid "```c++ explicit concurrent_node_map(Allocator const& a); ```" msgstr "```c++ explicit concurrent_node_map(Allocator const& a); ```" #: :596 #, safe-html, strict-same msgid "Constructs an empty table, using allocator `a`." msgstr "构造一个空哈希表，使用分配器 `a`。" #: :598 #, safe-html, strict-same msgctxt ":598" msgid "---" msgstr "---" #: :600 #, safe-html, strict-same msgid "Copy Constructor with Allocator" msgstr "带分配器的复制构造函数" #: :601 #, safe-html, strict-same msgid "" "```c++ concurrent_node_map(concurrent_node_map const& other, Allocator " "const& a); ```" msgstr "" "```c++ concurrent_node_map(concurrent_node_map const& other, Allocator " "const& a); ```" #: :605 #, safe-html, strict-same msgid "" "Constructs a table, copying ``other``'s contained elements, hash function, " "and predicate, but using allocator `a`." msgstr "构造一个哈希表，复制 `other` 的容器元素、哈希函数和谓词，但使用分配器 `a`。" #: :608 #, safe-html, strict-same msgctxt ":608" msgid "Concurrency:;; Blocking on `other`." msgstr "并发：;; 阻塞 `other`。" #: :610 #, safe-html, strict-same msgctxt ":610" msgid "---" msgstr "---" #: :612 #, safe-html, strict-same msgid "Move Constructor with Allocator" msgstr "带分配器的移动构造函数" #: :613 #, safe-html, strict-same msgid "" "```c++ concurrent_node_map(concurrent_node_map&& other, Allocator const& a); " "```" msgstr "" "```c++ concurrent_node_map(concurrent_node_map&& other, Allocator " "const& a); ```" #: :617 #, 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_node_map_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` 复制构造而来。\n" "若启用了 xref:concurrent_node_map_boost_unordered_enable_stats[统计功能]，仅" "当 `a == other.get_allocator()` 时从 `other` 转移内部统计信息，且始终调用 " "`other.reset_stats()`。" #: :625 #, safe-html, strict-same msgctxt ":625" msgid "Concurrency:;; Blocking on `other`." msgstr "并发：;; 阻塞 `other`。" #: :627 #, safe-html, strict-same msgctxt ":627" msgid "---" msgstr "---" #: :629 #, safe-html, strict-same msgid "Move Constructor from unordered_node_map" msgstr "基于 unordered_node_map 的移动构造函数" #: :631 #, safe-html, strict-same msgid "" "```c++ concurrent_node_map(unordered_node_map" "&& other); ```" msgstr "" "```c++ concurrent_node_map(unordered_node_map&& other); ```" #: :635 #, safe-html, strict-same msgid "" "Move construction from a xref:#unordered_node_map[`unordered_node_map`]. 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_node_map_boost_unordered_enable_stats[enabled], transfers " "the internal statistical information from `other` and calls " "`other.reset_stats()`." msgstr "" "通过 xref:#unordered_node_map[`unordered_node_map`] 进行移动构造。将 `other` " "的内部桶数组直接转移到新容器中。哈希函数、谓词和分配器均从 `other` 移动构造而" "来。若启用了 xref:concurrent_node_map_boost_unordered_enable_stats[统计功" "能]，则从 `other` 转移内部统计信息，并调用 `other.reset_stats()`。" #: :642 #, safe-html, strict-same msgid "Complexity:;; O(`bucket_count()`)" msgstr "复杂度：;; O(`bucket_count()`)" #: :644 #, safe-html, strict-same msgctxt ":644" msgid "---" msgstr "---" #: :646 #, safe-html, strict-same msgid "Initializer List Constructor" msgstr "初始化列表构造函数" #: :656 #, 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` 中的元素插入其中。" #: :659 #, safe-html, strict-same msgctxt ":659" 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[可默" "认构造] 要求。" #: :661 #, safe-html, strict-same msgctxt ":661" msgid "---" msgstr "---" #: :663 #, safe-html, strict-same msgid "Bucket Count Constructor with Allocator" msgstr "带分配器的桶数构造函数" #: :664 #, safe-html, strict-same msgid "```c++ concurrent_node_map(size_type n, allocator_type const& a); ```" msgstr "" "```c++ concurrent_node_map(size_type n, allocator_type const& a); ```" #: :668 #, 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` 作为分配器。" #: :671 #, 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`\n" "要求：;; `hasher` 和 `key_equal` 必须满足 https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[默认可构造]。" #: :674 #, safe-html, strict-same msgctxt ":674" msgid "---" msgstr "---" #: :676 #, safe-html, strict-same msgid "Bucket Count Constructor with Hasher and Allocator" msgstr "带哈希函数和分配器的桶数构造函数" #: :677 #, safe-html, strict-same msgid "" "```c++ concurrent_node_map(size_type n, hasher const& hf, allocator_type " "const& a); ```" msgstr "" "```c++ concurrent_node_map(size_type n, hasher const& hf, allocator_type " "const& a); ```" #: :681 #, 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` 作为分配器。" #: :684 #, 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`\n" "要求：;; `key_equal` 必须满足 https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[默认可构造]。" #: :687 #, safe-html, strict-same msgctxt ":687" msgid "---" msgstr "---" #: :689 #, safe-html, strict-same msgid "Iterator Range Constructor with Bucket Count and Allocator" msgstr "带桶数和分配器的迭代器范围构造函数" #: :696 #, 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)` 范围内的元素插入其中。" #: :699 #, safe-html, strict-same msgctxt ":699" 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[可默认构造] 要求。" #: :701 #, safe-html, strict-same msgctxt ":701" msgid "---" msgstr "---" #: :703 #, safe-html, strict-same msgid "Iterator Range Constructor with Bucket Count and Hasher" msgstr "带桶数和哈希函数的迭代器范围构造函数" #: :711 #, 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)` 范围内的元素插入其中。" #: :714 #, safe-html, strict-same msgctxt ":714" 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[可默认构造] 要求。" #: :716 #, safe-html, strict-same msgctxt ":716" msgid "---" msgstr "---" #: :718 #, safe-html, strict-same msgid "initializer_list Constructor with Allocator" msgstr "带分配器的初始化列表构造函数" #: :720 #, safe-html, strict-same msgid "" "```c++ concurrent_node_map(std::initializer_list il, const " "allocator_type& a); ```" msgstr "" "```c++ concurrent_node_map(std::initializer_list il, const " "allocator_type& a); ```" #: :724 #, 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` 中" "的元素插入其中。" #: :727 #, safe-html, strict-same msgctxt ":727" msgid "" "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/" "w/cpp/named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/" "w/cpp/named_req/DefaultConstructible[DefaultConstructible^]." #: :729 #, safe-html, strict-same msgctxt ":729" msgid "---" msgstr "---" #: :731 #, safe-html, strict-same msgid "initializer_list Constructor with Bucket Count and Allocator" msgstr "带桶数和分配器的初始化列表构造函数" #: :733 #, safe-html, strict-same msgid "" "```c++ concurrent_node_map(std::initializer_list il, size_type " "n, const allocator_type& a); ```" msgstr "" "```c++ concurrent_node_map(std::initializer_list il, size_type " "n, const allocator_type& a); ```" #: :737 #, 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` 中的元素插入其中。" #: :740 #, safe-html, strict-same msgctxt ":740" 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[默认可构造]。" #: :742 #, safe-html, strict-same msgctxt ":742" msgid "---" msgstr "---" #: :744 #, safe-html, strict-same msgid "initializer_list Constructor with Bucket Count and Hasher and Allocator" msgstr "带桶数、哈希函数和分配器的初始化列表构造函数" #: :746 #, safe-html, strict-same msgid "" "```c++ concurrent_node_map(std::initializer_list il, size_type " "n, const hasher& hf, const allocator_type& a); ```" msgstr "" "```c++ concurrent_node_map(std::initializer_list il, size_type " "n, const hasher& hf, const allocator_type& a); ```" #: :751 #, 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` 中的元素插入其中。" #: :754 #, safe-html, strict-same msgctxt ":754" 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[默认可构造]。" #: :756 #, safe-html, strict-same msgctxt ":756" msgid "---" msgstr "---" #: :758 #, safe-html, strict-same msgid "Destructor" msgstr "析构函数" #: :760 #, safe-html, strict-same msgid "```c++ ~concurrent_node_map(); ```" msgstr "```c++ ~concurrent_node_map(); ```" #: :765 #, safe-html, strict-same msgid "" "Note:;; The destructor is applied to every element, and all memory is " "deallocated" msgstr "注意：;; 析构函数会作用于所有元素，且所有内存都会被释放" #: :767 #, safe-html, strict-same msgctxt ":767" msgid "---" msgstr "---" #: :769 #, safe-html, strict-same msgid "Assignment" msgstr "赋值操作" #: :771 #, safe-html, strict-same msgid "Copy Assignment" msgstr "复制赋值" #: :773 #, safe-html, strict-same msgid "" "```c++ concurrent_node_map& operator=(concurrent_node_map const& other); ```" msgstr "" "```c++ concurrent_node_map& operator=(concurrent_node_map const& " "other); ```" #: :777 #, 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` 元素的副本。" #: :782 #, 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[可复制插入]\n" "并发：;; 阻塞 `*this` 与 `other`" #: :785 #, safe-html, strict-same msgctxt ":785" msgid "---" msgstr "---" #: :787 #, safe-html, strict-same msgid "Move Assignment" msgstr "移动赋值" #: :788 #, safe-html, strict-same msgid "" "```c++ concurrent_node_map& operator=(concurrent_node_map&& other) noexcept(" "(boost::allocator_traits::is_always_equal::value || " "boost::allocator_traits" "::propagate_on_container_move_assignment::value) && std::is_same::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_node_map_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_node_map& operator=(concurrent_node_map&& " "other) noexcept((boost::allocator_traits::is_always_equal::value " "|| boost::allocator_traits" "::propagate_on_container_move_assignment::value) && " "std::is_same::value); ```移动赋值运算符。销毁已存" "在的所有元素，与 `other` 交换哈希函数和谓词；若 " "`Alloc::propagate_on_container_move_assignment` 存在且其值为 `true`，则从 " "`other` 移动赋值分配器。\n" "若此时分配器与 `other.get_allocator()` 相等，则将 `other` 的内部桶数组直接转" "移给 `*this`；否则插入 `other` 元素的移动构造副本。若启用了 " "xref:concurrent_node_map_boost_unordered_enable_stats[统计功能]，仅当最终分配" "器与 `other.get_allocator()` 相等时，从 `other` 转移内部统计信息，且始终调用 " "`other.reset_stats()`。" #: :803 #, safe-html, strict-same msgid "Concurrency:;; Blocking on `*this` and `other`." msgstr "并发：;; 阻塞 `*this` 与 `other`" #: :805 #, safe-html, strict-same msgctxt ":805" msgid "---" msgstr "---" #: :807 #, safe-html, strict-same msgid "Initializer List Assignment" msgstr "初始化列表赋值" #: :808 #, safe-html, strict-same msgid "" "```c++ concurrent_node_map& operator=(std::initializer_list il); " "```" msgstr "" "```c++ concurrent_node_map& operator=(std::initializer_list " "il); ```" #: :812 #, safe-html, strict-same msgid "" "Assign from values in initializer list. All previously existing elements are " "destroyed." msgstr "通过初始化列表赋值。销毁所有已存在的元素。" #: :815 #, 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[可复制插入]\n" "并发：;; 阻塞 `*this`" #: :818 #, safe-html, strict-same msgctxt ":818" msgid "---" msgstr "---" #: :820 #, safe-html, strict-same msgid "Visitation" msgstr "访问操作" #: :822 #, safe-html, strict-same msgid "[c]visit" msgstr "[c]visit" #: :824 #, 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; ```" #: :833 #, safe-html, strict-same msgid "" "If an element `x` exists with key equivalent to `k`, invokes `f` with a " "reference to `x`. Such reference is const iff `*this` is const." msgstr "" "若存在键与 `k` 等价的元素 `x`，则以 `x` 的引用调用函数 `f`。当且仅当 `*this` " "为常量时，该引用为常量引用。" #: :837 #, 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` 类型对象的开销。" #: :840 #, safe-html, strict-same msgctxt ":840" msgid "---" msgstr "---" #: :842 #, safe-html, strict-same msgid "Bulk visit" msgstr "批量访问" #: :844 #, 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; ```" #: :853 #, 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 " "reference to `x`. Such reference is const iff `*this` is const." msgstr "" "对范围 [`first`, `last`) 中的每个元素 `k`，若容器内存在键与 `k` 等价的元素 " "`x`，则以 `x` 的引用调用函数 `f`。当且仅当 `*this` 为常量时，该引用为常量引用" "。" #: :858 #, safe-html, strict-same msgid "" "Although functionally equivalent to individually invoking " "xref:concurrent_node_map_cvisit[`[c\\]visit`] for each key, bulk visitation " "performs generally faster due to internal streamlining optimizations. It is " "advisable that `std::distance(first,last)` be at least " "xref:#concurrent_node_map_constants[`bulk_visit_size`] to enjoy a " "performance gain: beyond this size, performance is not expected to increase " "further." msgstr "" "尽管功能上等同于对每个键单独调用 `[c]visit`，但得益于内部的流式优化，批量访问" "通常性能更高。建议当 `std::distance(first,last)` 至少达到 `bulk_visit_size` " "时使用批量访问以获得性能提升；超过该大小后，性能不会进一步提升。" #: :867 #, 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），或满足 C++20 及之后标" "准的 `std::forward_iterator` 概念。\n" "对于 `K = std::iterator_traits::value_type`，要么 `K` 是 " "`key_type`，要么 `Hash::is_transparent` 和 `Pred::is_transparent` 是合法的成" "员别名。\n" "在后一种情况下，库假定 `Hash` 可同时接收 `K` 与 `Key` 类型调用，且 `Pred` 是" "透明的。这支持异构查找，避免了实例化 `Key` 类型对象的开销。\n" "返回值：;; 被访问的元素总数。" #: :876 #, safe-html, strict-same msgctxt ":876" msgid "---" msgstr "---" #: :878 #, safe-html, strict-same msgid "[c]visit_all" msgstr "[c]visit_all" #: :880 #, 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; ```" #: :886 #, safe-html, strict-same msgid "" "Successively invokes `f` with references to each of the elements in the " "table. Such references are const iff `*this` is const." msgstr "" "依次以表中每个元素的引用调用函数 `f`。当且仅当 `*this` 为常量时，该引用为常量" "引用。" #: :890 #, safe-html, strict-same msgid "Returns:;; The number of elements visited." msgstr "返回值：;; 被访问的元素数量。" #: :892 #, safe-html, strict-same msgctxt ":892" msgid "---" msgstr "---" #: :894 #, safe-html, strict-same msgid "Parallel [c]visit_all" msgstr "并行 ++[++c++]++visit++_++all" #: :896 #, 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; ```" #: :902 #, safe-html, strict-same msgid "" "Invokes `f` with references to each of the elements in the table. Such " "references are const iff `*this` is const. Execution is parallelized " "according to the semantics of the execution policy specified." msgstr "" "以表中每个元素的引用调用函数 `f`。当且仅当 `*this` 为常量时，该引用为常量引用" "。执行过程将根据指定执行策略的语义进行并行化处理。" #: :906 #, 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" "不允许使用无序执行策略。" #: :913 #, safe-html, strict-same msgctxt ":913" msgid "---" msgstr "---" #: :915 #, safe-html, strict-same msgid "[c]visit_while" msgstr "[c]visit_while" #: :917 #, 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; ```" #: :923 #, safe-html, strict-same msgid "" "Successively invokes `f` with references to each of the elements in the " "table until `f` returns `false` or all the elements are visited. Such " "references to the elements are const iff `*this` is const." msgstr "" "依次以哈希表中每个元素的引用调用函数 `f`，直到 `f` 返回 `false` 或遍历完所有" "元素。当且仅当 `*this` 为常量时，元素的引用为常量引用。" #: :928 #, safe-html, strict-same msgid "Returns:;; `false` iff `f` ever returns `false`." msgstr "返回值：;; 当且仅当 `f` 曾返回 `false` 时，返回 `false`。" #: :930 #, safe-html, strict-same msgctxt ":930" msgid "---" msgstr "---" #: :932 #, safe-html, strict-same msgid "Parallel [c]visit_while" msgstr "并行 ++[++c++]++visit++_++while" #: :934 #, 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; ```" #: :940 #, safe-html, strict-same msgid "" "Invokes `f` with references to each of the elements in the table until `f` " "returns `false` or all the elements are visited. Such references to the " "elements are const iff `*this` is const. Execution is parallelized according " "to the semantics of the execution policy specified." msgstr "" "以哈希表中每个元素的引用调用函数 `f`，直到 `f` 返回 `false` 或遍历完所有元素" "。当且仅当 `*this` 为常量时，元素的引用为常量引用。执行过程将根据指定执行策略" "的语义进行并行化处理。" #: :946 #, 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`。" #: :957 #, safe-html, strict-same msgctxt ":957" msgid "---" msgstr "---" #: :959 #, safe-html, strict-same msgid "Size and Capacity" msgstr "大小与容量" #: :961 #, safe-html, strict-same msgid "empty" msgstr "空" #: :963 #, safe-html, strict-same msgid "```c++ [[nodiscard]] bool empty() const noexcept; ```" msgstr "```c++ [[nodiscard]] bool empty() const noexcept; ```" #: :968 #, safe-html, strict-same msgid "Returns:;; `size() == 0`" msgstr "返回值：;; `size() == 0`（容器为空时返回 true，否则返回 false）" #: :970 #, safe-html, strict-same msgctxt ":970" msgid "---" msgstr "---" #: :972 #, safe-html, strict-same msgid "size" msgstr "大小" #: :974 #, safe-html, strict-same msgid "```c++ size_type size() const noexcept; ```" msgstr "```c++ size_type size() const noexcept; ```" #: :979 #, safe-html, strict-same msgid "Returns:;; The number of elements in the table." msgstr "返回值：;; 哈希表中的元素总数。" #: :982 #, 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 "" "注意：;; 在存在并发插入操作时，返回的值可能无法精确反映函数执行完成后哈希表的" "真实大小。" #: :985 #, safe-html, strict-same msgctxt ":985" msgid "---" msgstr "---" #: :987 #, safe-html, strict-same msgid "max_size" msgstr "max_size" #: :989 #, safe-html, strict-same msgid "```c++ size_type max_size() const noexcept; ```" msgstr "```c++ size_type max_size() const noexcept; ```" #: :994 #, safe-html, strict-same msgid "Returns:;; `size()` of the largest possible table." msgstr "返回值：;; 哈希表能容纳的最大元素数量（最大容量）。" #: :996 #, safe-html, strict-same msgctxt ":996" msgid "---" msgstr "---" #: :998 #, safe-html, strict-same msgid "Modifiers" msgstr "修改器" #: :1000 #, safe-html, strict-same msgid "emplace" msgstr "原地构造" #: :1001 #, safe-html, strict-same msgid "```c++ template bool emplace(Args&&... args); ```" msgstr "" "```c++ template bool emplace(Args&&... args); " "```" #: :1005 #, 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` 构造对象并插入到哈" "希表中。" #: :1008 #, 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:;; If `args...` is of the form `k,v`, it delays constructing the whole " "object until it is certain that an element should be inserted, using only " "the `k` argument to check." msgstr "" "要求：;; `value_type` 可由参数 `args` 构造。\n" "返回值：;; 成功插入元素时返回 `true`。\n" "并发特性：;; 当对当前对象执行重哈希操作时会阻塞。\n" "注意：;; 若 `args...` 格式为 `k,v`，则会仅使用参数 `k` 进行键检查，**直到确定" "需要插入元素时**，才会构造完整对象。" #: :1013 #, safe-html, strict-same msgctxt ":1013" msgid "---" msgstr "---" #: :1015 #, safe-html, strict-same msgid "Copy Insert" msgstr "复制插入" #: :1016 #, safe-html, strict-same msgid "" "```c++ bool insert(const value_type& obj); bool insert(const init_type& obj)" "; ```" msgstr "" "```c++ bool insert(const value_type& obj); bool insert(const " "init_type& obj); ```" #: :1021 #, safe-html, strict-same msgctxt ":1021" msgid "" "Inserts `obj` in the table if and only if there is no element in the table " "with an equivalent key." msgstr "当且仅当哈希表中不存在键等价的元素时，将`obj`插入表中。" #: :1024 #, safe-html, strict-same 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:;; A call of the " "form `insert(x)`, where `x` is equally convertible to both `const " "value_type&` and `const init_type&`, is not ambiguous and selects the " "`init_type` overload." msgstr "" "要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^] 要求。返回值：;; 成功执行插入操作则返回 " "`true`。并发特性：;; 对当前对象执行重哈希操作时会发生阻塞。注意：;; 若调用形" "式为 `insert(x)`，且 `x` 可同时隐式转换为 `const value_type&` 与 `const " "init_type&`，该调用不存在歧义，会选用 `init_type` 重载版本。" #: :1029 #, safe-html, strict-same msgctxt ":1029" msgid "---" msgstr "---" #: :1031 #, safe-html, strict-same msgid "Move Insert" msgstr "移动插入" #: :1032 #, safe-html, strict-same msgid "```c++ bool insert(value_type&& obj); bool insert(init_type&& obj); ```" msgstr "" "```c++ bool insert(value_type&& obj); bool insert" "(init_type&& obj); ```" #: :1037 #, safe-html, strict-same msgctxt ":1037" msgid "" "Inserts `obj` in the table if and only if there is no element in the table " "with an equivalent key." msgstr "当且仅当哈希表中不存在等价键的元素时，将`obj`插入表中。" #: :1040 #, 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:;; A call of the form " "`insert(x)`, where `x` is equally convertible to both `value_type&&` and " "`init_type&&`, is not ambiguous and selects the `init_type` overload." msgstr "" "要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^] 要求。\n" "返回值：;; 成功执行插入操作则返回 `true`。\n" "并发特性：;; 对当前对象执行重哈希操作时会发生阻塞。\n" "注意：;; 若调用形式为 `insert(x)`，且 `x` 可同时转换为 " "`value_type&&` 与 `init_type&&`，该调用不存在歧义，会选用 " "`init_type` 重载版本。" #: :1045 #, safe-html, strict-same msgctxt ":1045" msgid "---" msgstr "---" #: :1047 #, safe-html, strict-same msgid "Insert Iterator Range" msgstr "迭代器范围插入" #: :1048 #, safe-html, strict-same msgid "" "```c++ template size_type insert(InputIterator first, " "InputIterator last); ```" msgstr "" "```c++ template size_type insert(InputIterator " "first, InputIterator last); ```" #: :1052 #, safe-html, strict-same msgctxt ":1052" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等价于 [listing,subs=\"+macros,+quotes\"]" #: :1059 #, safe-html, strict-same msgctxt ":1059" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 成功插入的元素数量。" #: :1061 #, safe-html, strict-same msgctxt ":1061" msgid "---" msgstr "---" #: :1063 #, safe-html, strict-same msgid "Insert Initializer List" msgstr "初始化列表插入" #: :1064 #, safe-html, strict-same msgid "```c++ size_type insert(std::initializer_list il); ```" msgstr "" "```c++ size_type insert(std::initializer_list il); ```" #: :1068 #, safe-html, strict-same msgctxt ":1068" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等价于 [listing,subs=\"+macros,+quotes\"]" #: :1075 #, safe-html, strict-same msgctxt ":1075" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 成功插入的元素个数。" #: :1077 #, safe-html, strict-same msgctxt ":1077" msgid "---" msgstr "---" #: :1079 #, safe-html, strict-same msgid "Insert Node" msgstr "节点插入" #: :1080 #, safe-html, strict-same msgid "```c++ insert_return_type insert(node_type&& nh); ```" msgstr "```c++ insert_return_type insert(node_type&& nh); ```" #: :1084 #, safe-html, strict-same msgid "" "If `nh` is not empty, inserts the associated element in the table if and " "only if there is no element in the table with a key equivalent to `nh.key()" "`. `nh` is empty when the function returns." msgstr "" "若`nh`非空，则当且仅当哈希表中不存在与`nh.key()`等价的键时，将关联元素插入表" "中。函数返回时，`nh`为空。" #: :1088 #, safe-html, strict-same msgctxt ":1088" msgid "" "Returns:;; An `insert_return_type` object constructed from `inserted` and " "`node`: +" msgstr "返回值：;; 由`inserted`和`node`构造的`insert_return_type`对象：" #: :1089 #, safe-html, strict-same msgctxt ":1089" msgid "If `nh` is empty, `inserted` is `false` and `node` is empty." msgstr "若 `nh` 为空，则 `inserted` 为 `false` 且 `node` 为空。" #: :1090 #, safe-html, strict-same msgctxt ":1090" msgid "" "Otherwise if the insertion took place, `inserted` is true and `node` is " "empty." msgstr "若插入操作成功，则 `inserted` 为 true， 且 `node` 为空。" #: :1091 #, safe-html, strict-same msgctxt ":1091" msgid "" "If the insertion failed, `inserted` is false and `node` has the previous " "value of `nh`." msgstr "若插入操作失败，则 `inserted` 为 false ，且 `node` 保留 `nh` 的原值。" #: :1092 #, safe-html, strict-same msgid "" "Throws:;; If an exception is thrown by an operation other than a call to " "`hasher` the function has no effect. Concurrency:;; Blocking on rehashing of " "`*this`. Notes:;; Behavior is undefined if `nh` is not empty and the " "allocators of `nh` and the container are not equal." msgstr "" "若 `nh` 非空，则当且仅当容器中不存在键等价于 `nh.key()` 的元素时，插入关联元" "素。函数返回时 `nh` 为空。" #: :1096 #, safe-html, strict-same msgctxt ":1096" msgid "---" msgstr "---" #: :1098 #, safe-html, strict-same msgid "emplace_or_[c]visit" msgstr "emplace_or_[c]visit" #: :1099 #, 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); ```" #: :1104 #, 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 reference to the equivalent element; such reference is const iff " "`emplace_or_cvisit` is used." msgstr "" "若表中无等价键元素，则使用参数`args`构造对象并插入表中。否则，调用`f`并传入等" "价元素的引用；当且仅当使用`emplace_or_cvisit`时，该引用为常量引用。" #: :1108 #, 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:;; 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" "并发特性：;; 对当前对象执行重哈希操作时会发生阻塞。\n" "注意：;; 该接口仅为说明性接口，因为C++不允许在可变参数包之后声明参数 `f`。" #: :1113 #, safe-html, strict-same msgctxt ":1113" msgid "---" msgstr "---" #: :1115 #, safe-html, strict-same msgid "Copy insert_or_[c]visit" msgstr "复制 insert++_++or++_[++c++]++visit" #: :1116 #, 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); " "template bool insert_or_visit(const init_type& obj, F f); " "template bool insert_or_cvisit(const init_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); template bool insert_or_visit(const " "init_type& obj, F f); template bool insert_or_cvisit(const " "init_type& obj, F f); ```" #: :1123 #, safe-html, strict-same msgctxt ":1123" 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 reference to the " "equivalent element; such reference is const iff a `*_cvisit` overload is " "used." msgstr "" "当且仅当哈希表中不存在等价键的元素时，将`obj`插入表中。否则，调用`f`并传入等" "价元素的引用；当且仅当使用`*_cvisit`重载版本时，该引用为常量引用。" #: :1127 #, safe-html, strict-same 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:;; In a call of the " "form `insert_or_[c]visit(obj, f)`, the overloads accepting a `const " "value_type&` argument participate in overload resolution only if " "`std::remove_cv::type>::type` is " "`value_type`." msgstr "" "要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^] 要求。\n" "返回值：;; 成功执行插入操作则返回 `true`。\n" "并发特性：;; 对当前对象执行重哈希操作时会发生阻塞。\n" "注意：;; 在形式为 `insert_or_[c]visit(obj, f)` 的调用中，仅当 " "`std::remove_cv::type>::type` 为 " "`value_type` 时，接受 `const value_type&` 参数的重载版本才会参与重载决议" "。" #: :1133 #, safe-html, strict-same msgctxt ":1133" msgid "---" msgstr "---" #: :1135 #, safe-html, strict-same msgid "Move insert_or_[c]visit" msgstr "移动 insert++_++or++_[++c++]++visit" #: :1136 #, 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); " "template bool insert_or_visit(init_type&& obj, F f); template bool insert_or_cvisit(init_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); template bool insert_or_visit(init_type&& obj, F " "f); template bool insert_or_cvisit(init_type&& obj, F " "f); ```" #: :1143 #, safe-html, strict-same msgctxt ":1143" 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 reference to the " "equivalent element; such reference is const iff a `*_cvisit` overload is " "used." msgstr "" "当且仅当哈希表中不存在等价键的元素时，将`obj`插入表中。否则，调用`f`并传入等" "价元素的引用；当且仅当使用`*_cvisit`重载版本时，该引用为常量引用。" #: :1147 #, 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:;; In a call of the " "form `insert_or_[c]visit(obj, f)`, the overloads accepting a `value_type&&` " "argument participate in overload resolution only if " "`std::remove_reference::type` is `value_type`." msgstr "" "要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^] 要求。\n" "返回值：;; 成功执行插入操作则返回 `true`。\n" "并发特性：;; 对当前对象执行重哈希操作时会发生阻塞。\n" "注意：;; 在形式为 `insert_or_[c]visit(obj, f)` 的调用中，仅当 " "`std::remove_reference::type` 为 `value_type` 时，接受 " "`value_type&&` 参数的重载版本才会参与重载决议。" #: :1153 #, safe-html, strict-same msgctxt ":1153" msgid "---" msgstr "---" #: :1155 #, safe-html, strict-same msgid "Insert Iterator Range or Visit" msgstr "迭代器范围插入或访问" #: :1156 #, 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); ```" #: :1163 #, safe-html, strict-same msgctxt ":1163" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等价于 [listing,subs=\"+macros,+quotes\"]" #: :1170 #, safe-html, strict-same msgctxt ":1170" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 成功插入的元素个数。" #: :1172 #, safe-html, strict-same msgctxt ":1172" msgid "---" msgstr "---" #: :1174 #, safe-html, strict-same msgid "Insert Initializer List or Visit" msgstr "初始化列表插入或访问" #: :1175 #, 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); ```" #: :1180 #, safe-html, strict-same msgctxt ":1180" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等价于 [listing,subs=\"+macros,+quotes\"]" #: :1187 #, safe-html, strict-same msgctxt ":1187" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 成功插入的元素个数。" #: :1189 #, safe-html, strict-same msgctxt ":1189" msgid "---" msgstr "---" #: :1191 #, safe-html, strict-same msgid "Insert Node or Visit" msgstr "节点插入或访问" #: :1192 #, safe-html, strict-same msgid "" "```c++ template insert_return_type insert_or_visit(node_type&& nh, " "F f); template insert_return_type insert_or_cvisit(node_type&& nh, " "F f); ```" msgstr "" "```c++ template insert_return_type insert_or_visit" "(node_type&& nh, F f); template insert_return_type " "insert_or_cvisit(node_type&& nh, F f); ```" #: :1197 #, safe-html, strict-same msgid "" "If `nh` is empty, does nothing. Otherwise, inserts the associated element in " "the table if and only if there is no element in the table with a key " "equivalent to `nh.key()`. Otherwise, invokes `f` with a reference to the " "equivalent element; such reference is const iff `insert_or_cvisit` is used." msgstr "" "若`nh`为空，则不执行任何操作。否则，当且仅当哈希表中不存在与`nh.key()`等价的" "键时，将关联元素插入表中。若存在等价键，则调用`f`并传入等价元素的引用；当且仅" "当使用`insert_or_cvisit`时，该引用为常量引用。" #: :1202 #, safe-html, strict-same msgctxt ":1202" msgid "" "Returns:;; An `insert_return_type` object constructed from `inserted` and " "`node`: +" msgstr "返回值：;; 由 `inserted` 和 `node` 构造的 `insert_return_type` 对象：" #: :1203 #, safe-html, strict-same msgctxt ":1203" msgid "If `nh` is empty, `inserted` is `false` and `node` is empty." msgstr "若 `nh` 为空，则 `inserted` 为 `false` 且 `node` 为空。" #: :1204 #, safe-html, strict-same msgctxt ":1204" msgid "" "Otherwise if the insertion took place, `inserted` is true and `node` is " "empty." msgstr "若插入操作成功，则 `inserted` 为 true， 且 `node` 为空。" #: :1205 #, safe-html, strict-same msgctxt ":1205" msgid "" "If the insertion failed, `inserted` is false and `node` has the previous " "value of `nh`." msgstr "若插入操作失败，则 `inserted` 为 false ，且 `node` 保留 `nh` 的原值。" #: :1206 #, safe-html, strict-same msgid "" "Throws:;; If an exception is thrown by an operation other than a call to " "`hasher` or call to `f`, the function has no effect. Concurrency:;; Blocking " "on rehashing of `*this`. Notes:;; Behavior is undefined if `nh` is not empty " "and the allocators of `nh` and the container are not equal." msgstr "" "若 `nh` 为空，则不执行任何操作。否则，当且仅当容器中不存在键等价于 `nh.key()" "` 的元素时，插入其关联的元素；否则，以等价元素的引用为参数调用 `f` ；当且仅当" "使用 `insert++_++or++_++cvisit` 时该引用为常量引用。" #: :1210 #, safe-html, strict-same msgctxt ":1210" msgid "---" msgstr "---" #: :1212 #, safe-html, strict-same msgid "emplace_and_[c]visit" msgstr "emplace_and_[c]visit" #: :1213 #, 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)" "; ```" #: :1220 #, 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 non-const reference to the newly created element. Otherwise, " "invokes `f2` with a reference to the equivalent element; such reference is " "const iff `emplace_and_cvisit` is used." msgstr "" "若表中无等价键元素，则使用参数`args`构造对象并插入表中，随后以非常量引用指向" "新创建的元素并调用`f1`。否则，以指向等价元素的引用调用`f2`；当且仅当使" "用`emplace_and_cvisit`时，该引用为常量引用。" #: :1225 #, 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:;; 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" "注意：;; 该接口仅作说明用途，因为 C++ 不允许在可变参数包之后声明参数 `f1` 和 " "`f2`。" #: :1230 #, safe-html, strict-same msgctxt ":1230" msgid "---" msgstr "---" #: :1232 #, safe-html, strict-same msgid "Copy insert_and_[c]visit" msgstr "复制 insert++_++and++_[++c++]++visit" #: :1233 #, 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); template bool " "insert_and_visit(const init_type& obj, F1 f1, F2 f2); template bool insert_and_cvisit(const init_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); template bool insert_and_visit" "(const init_type& obj, F1 f1, F2 f2); template bool insert_and_cvisit(const init_type& obj, F1 f1, F2 f2); " "```" #: :1240 #, safe-html, strict-same msgctxt ":1240" 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 non-const reference to " "the newly created element. Otherwise, invokes `f2` with a reference to the " "equivalent element; such reference is const iff a `*_cvisit` overload is " "used." msgstr "" "当且仅当哈希表中不存在等价键的元素时，将`obj`插入表中，随后以非常量引用指向新" "创建的元素并调用`f1`。否则，以指向等价元素的引用调用`f2`；当且仅当使" "用`*_cvisit`重载版本时，该引用为常量引用。" #: :1245 #, safe-html, strict-same 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:;; In a call of the " "form `insert_and_[c]visit(obj, f1, f2)`, the overloads accepting a `const " "value_type&` argument participate in overload resolution only if " "`std::remove_cv::type>::type` is " "`value_type`." msgstr "" "要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^] 要求。\n" "返回值：;; 若执行插入操作则返回 `true`。\n" "并发特性：;; 阻塞对 `*this` 的重哈希操作。\n" "注意：;; 在形式为 `insert_and_[c]visit(obj, f1, f2)` 的调用中，仅当 " "`std::remove_cv::type>::type` 为 " "`value_type` 时，接受 `const value_type&` 参数的重载版本才会参与重载决议" "。" #: :1251 #, safe-html, strict-same msgctxt ":1251" msgid "---" msgstr "---" #: :1253 #, safe-html, strict-same msgid "Move insert_and_[c]visit" msgstr "移动 insert++_++and++_[++c++]++visit" #: :1254 #, 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); template bool " "insert_and_visit(init_type&& obj, F1 f1, F2 f2); template bool insert_and_cvisit(init_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); " "template bool insert_and_visit" "(init_type&& obj, F1 f1, F2 f2); template bool insert_and_cvisit(init_type&& obj, F1 f1, F2 f2); ```" #: :1261 #, safe-html, strict-same msgctxt ":1261" 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 non-const reference to " "the newly created element. Otherwise, invokes `f2` with a reference to the " "equivalent element; such reference is const iff a `*_cvisit` overload is " "used." msgstr "" "当且仅当哈希表中不存在等价键的元素时，将`obj`插入表中，随后以非常量引用指向新" "创建的元素并调用`f1`。否则，以指向等价元素的引用调用`f2`；当且仅当使" "用`*_cvisit`重载版本时，该引用为常量引用。" #: :1266 #, 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:;; In a call of the " "form `insert_and_[c]visit(obj, f1, f2)`, the overloads accepting a " "`value_type&&` argument participate in overload resolution only if " "`std::remove_reference::type` is `value_type`." msgstr "" "要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^] 要求。\n" "返回值：;; 若执行插入操作则返回 `true`。\n" "并发特性：;; 阻塞对 `*this` 的重哈希操作。\n" "注意：;; 在形式为 `insert_and_[c]visit(obj, f1, f2)` 的调用中，仅当 " "`std::remove_reference::type` 为 `value_type` 时，接受 " "`value_type&&` 参数的重载版本才会参与重载决议。" #: :1272 #, safe-html, strict-same msgctxt ":1272" msgid "---" msgstr "---" #: :1274 #, safe-html, strict-same msgid "Insert Iterator Range and Visit" msgstr "迭代器范围插入并访问" #: :1275 #, safe-html, strict-same msgid "" "```c++ template size_type " "insert_or_visit(InputIterator first, InputIterator last, F1 f1, F2 f2); " "template size_type insert_or_cvisit" "(InputIterator first, InputIterator last, F1 f2, F2 f2); ```" msgstr "" "```c++ template " "size_type insert_or_visit(InputIterator first, InputIterator last, F1 f1, F2 " "f2); template " "size_type insert_or_cvisit(InputIterator first, InputIterator last, F1 f2, " "F2 f2); ```" #: :1282 #, safe-html, strict-same msgctxt ":1282" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等价于 [listing,subs=\"+macros,+quotes\"]" #: :1289 #, safe-html, strict-same msgctxt ":1289" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 成功插入的元素个数。" #: :1291 #, safe-html, strict-same msgctxt ":1291" msgid "---" msgstr "---" #: :1293 #, safe-html, strict-same msgid "Insert Initializer List and Visit" msgstr "初始化列表插入并访问" #: :1294 #, 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); ```" #: :1301 #, safe-html, strict-same msgctxt ":1301" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等价于 [listing,subs=\"+macros,+quotes\"]" #: :1308 #, safe-html, strict-same msgctxt ":1308" msgid "Returns:;; The number of elements inserted." msgstr "返回值：;; 成功插入的元素个数。" #: :1310 #, safe-html, strict-same msgctxt ":1310" msgid "---" msgstr "---" #: :1312 #, safe-html, strict-same msgid "Insert Node and Visit" msgstr "节点插入并访问" #: :1313 #, safe-html, strict-same msgid "" "```c++ template insert_return_type insert_and_visit" "(node_type&& nh, F1 f1, F2 f2); template " "insert_return_type insert_and_cvisit(node_type&& nh, F1 f1, F2 f2); ```" msgstr "" "```c++ template insert_return_type " "insert_and_visit(node_type&& nh, F1 f1, F2 f2); template insert_return_type insert_and_cvisit" "(node_type&& nh, F1 f1, F2 f2); ```" #: :1320 #, safe-html, strict-same msgid "" "If `nh` is empty, does nothing. Otherwise, inserts the associated element in " "the table if and only if there is no element in the table with a key " "equivalent to `nh.key()`, and then invokes `f1` with a non-const reference " "to the newly inserted element. Otherwise, invokes `f2` with a reference to " "the equivalent element; such reference is const iff `insert_or_cvisit` is " "used." msgstr "" "若`nh`为空，则不执行任何操作。否则，当且仅当哈希表中不存在与`nh.key()`等价的" "键时，将关联元素插入表中，随后以非常量引用指向新插入的元素并调用`f1`。若存在" "等价键，则调用`f2`并传入等价元素的引用；当且仅当使用`insert_or_cvisit`时，该" "引用为常量引用。" #: :1326 #, safe-html, strict-same msgctxt ":1326" msgid "" "Returns:;; An `insert_return_type` object constructed from `inserted` and " "`node`: +" msgstr "返回值：;; 由 `inserted` 和 `node` 构造的 `insert_return_type` 对象：" #: :1327 #, safe-html, strict-same msgctxt ":1327" msgid "If `nh` is empty, `inserted` is `false` and `node` is empty." msgstr "若 `nh` 为空，则 `inserted` 为 `false` 且 `node` 为空。" #: :1328 #, safe-html, strict-same msgctxt ":1328" msgid "" "Otherwise if the insertion took place, `inserted` is true and `node` is " "empty." msgstr "若插入操作成功，则 `inserted` 为 true， 且 `node` 为空。" #: :1329 #, safe-html, strict-same msgctxt ":1329" msgid "" "If the insertion failed, `inserted` is false and `node` has the previous " "value of `nh`." msgstr "若插入操作失败，则 `inserted` 为 false ，且 `node` 保留 `nh` 的原值。" #: :1330 #, safe-html, strict-same msgid "" "Throws:;; If an exception is thrown by an operation other than a call to " "`hasher` or call to `f1` or `f2`, the function has no effect. Concurrency:;; " "Blocking on rehashing of `*this`. Notes:;; Behavior is undefined if `nh` is " "not empty and the allocators of `nh` and the container are not equal." msgstr "" "若 `nh` 为空，则不执行任何操作。否则，当且仅当容器中不存在键等价于 `nh.key()" "` 的元素时，插入关联元素，并以新插入元素的非常量引用为参数调用 `f1` ；否则，" "以等价元素的引用为参数调用 `f2` ；当且仅当使用 `insert++_++or++_++cvisit` （" "此处应为 `insert++_++and++_++cvisit` ，可能是英文出了点错误）时该引用为常量引" "用。" #: :1334 #, safe-html, strict-same msgctxt ":1334" msgid "---" msgstr "---" #: :1336 #, safe-html, strict-same msgid "try_emplace" msgstr "try_emplace" #: :1337 #, safe-html, strict-same msgid "" "```c++ template bool try_emplace(const key_type& k, Args&&... " "args); template bool try_emplace(key_type&& k, Args&&... args)" "; template bool try_emplace(K&& k, Args&&... args); " "```" msgstr "" "```c++ template bool try_emplace(const key_type& k, " "Args&&... args); template bool try_emplace" "(key_type&& k, Args&&... args); template bool try_emplace(K&& k, Args&&... " "args); ```" #: :1343 #, safe-html, strict-same msgid "" "Inserts an element constructed from `k` and `args` into the table if there " "is no existing element with key `k` contained within it." msgstr "若表中不存在键为`k`的元素，则将由`k`和`args`构造的元素插入表中。" #: :1346 #, safe-html, strict-same msgid "" "Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on " "rehashing of `*this`. Notes:;; This function is similiar to " "xref:#concurrent_node_map_emplace[emplace], with the difference that no " "`value_type` is constructed if there is an element with an equivalent key; " "otherwise, the construction is of the form: + + -- ```c++" msgstr "" "返回值：;; 若执行插入操作则返回 true。\n" "并发特性：;; 阻塞对 *this 的重哈希操作。\n" "注意：;; 该函数与 xref:#concurrent_node_map_emplace [emplace] 类似，区别在于" "：若表中已存在等价键的元素，则不会构造 value_type；否则，构造方式如下：" #: :1354 #, safe-html, strict-same msgctxt ":1354" msgid "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...))" msgstr "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...))" #: :1359 #, safe-html, strict-same msgctxt ":1359" msgid "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...)) ```" msgstr "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...)) ```" #: :1364 #, safe-html, strict-same msgid "" "unlike xref:#concurrent_node_map_emplace[emplace], which simply forwards all " "arguments to ``value_type``'s constructor." msgstr "" "与 xref:#concurrent_node_map_emplace[emplace] 不同，该函数会直接将所有参数转" "发给 `value_type` 的构造函数。" #: :1366 #, safe-html, strict-same msgid "" "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 "" "仅当 Hash::is_transparent 与 Pred::is_transparent 为合法的成员类型别名时，" "template 这个重载版本才会参与重载决议。\n" "库实现假定 Hash 可同时接受 K 类型与 Key 类型作为参数，且 Pred 是透明的。\n" "这一特性支持异构查找，从而避免实例化 Key 类型对象带来的性能开销。" #: :1368 #, safe-html, strict-same msgctxt ":1368" msgid "--" msgstr "--" #: :1370 #, safe-html, strict-same msgctxt ":1370" msgid "---" msgstr "---" #: :1372 #, safe-html, strict-same msgid "try_emplace_or_[c]visit" msgstr "try_emplace_or_[c]visit" #: :1373 #, safe-html, strict-same msgid "" "```c++ template bool try_emplace_or_visit(const " "key_type& k, Args&&... args, F&& f); template bool " "try_emplace_or_cvisit(const key_type& k, Args&&... args, F&& f); " "template bool try_emplace_or_visit(key_type&& k, " "Args&&... args, F&& f); template bool " "try_emplace_or_cvisit(key_type&& k, Args&&... args, F&& f); template bool try_emplace_or_visit(K&& k, Args&&... args, " "F&& f); template bool try_emplace_or_cvisit" "(K&& k, Args&&... args, F&& f); ```" msgstr "" "```c++ template bool " "try_emplace_or_visit(const key_type& k, Args&&... args, " "F&& f); template bool " "try_emplace_or_cvisit(const key_type& k, Args&&... args, " "F&& f); template bool " "try_emplace_or_visit(key_type&& k, Args&&... args, " "F&& f); template bool " "try_emplace_or_cvisit(key_type&& k, Args&&... args, " "F&& f); template bool try_emplace_or_visit(K&& k, Args&&... args, " "F&& f); template bool try_emplace_or_cvisit(K&& k, Args&&... args, " "F&& f); ```" #: :1388 #, safe-html, strict-same msgid "" "Inserts an element constructed from `k` and `args` into the table if there " "is no existing element with key `k` contained within it. Otherwise, invokes " "`f` with a reference to the equivalent element; such reference is const iff " "a `*_cvisit` overload is used." msgstr "" "若表中不存在键为`k`的元素，则将由`k`和`args`构造的元素插入表中。\n" "否则，以指向等价元素的引用调用`f`；当且仅当使用`*_cvisit`重载版本时，该引用为" "常量引用。" #: :1392 #, safe-html, strict-same msgctxt ":1392" msgid "" "Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on " "rehashing of `*this`. Notes:;; No `value_type` is constructed if there is an " "element with an equivalent key; otherwise, the construction is of the form: " "+ + -- ```c++" msgstr "" "返回值：;; 若执行插入操作则返回 true。\n" "并发特性：;; 阻塞对 *this 的重哈希操作。\n" "注意：;; 若已存在等价键的元素，则不会构造 value_type；否则，构造方式如下：" #: :1400 #, safe-html, strict-same msgctxt ":1400" msgid "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...))" msgstr "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...))" #: :1405 #, safe-html, strict-same msgctxt ":1405" msgid "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...)) ```" msgstr "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...)) ```" #: :1410 #, safe-html, strict-same msgid "" "The interface is exposition only, as C++ does not allow to declare a " "parameter `f` after a variadic parameter pack." msgstr "该接口仅为说明性用法，因为 C++ 不允许在可变参数包之后声明参数 `f`。" #: :1412 #, safe-html, strict-same msgid "" "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 "" "仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员类型别名时" "，`template` 这些重载版本才会参与" "重载决议。库假定 `Hash` 可同时接受 `K` 类型和 `Key` 类型作为参数，且 `Pred` " "是透明的。这支持**异构查找**，从而避免实例化 `Key` 类型对象带来的性能开销。" #: :1414 #, safe-html, strict-same msgctxt ":1414" msgid "--" msgstr "--" #: :1416 #, safe-html, strict-same msgctxt ":1416" msgid "---" msgstr "---" #: :1418 #, safe-html, strict-same msgid "try_emplace_and_[c]visit" msgstr "try_emplace_and_[c]visit" #: :1419 #, safe-html, strict-same msgid "" "```c++ template bool try_emplace_and_visit" "(const key_type& k, Args&&... args, F1&& f1, F2&& f2); template bool try_emplace_and_cvisit(const key_type& k, " "Args&&... args, F1&& f1, F2&& f2); template bool try_emplace_and_visit(key_type&& k, Args&&... args, F1&& f1, F2&& " "f2); template bool try_emplace_and_cvisit" "(key_type&& k, Args&&... args, F1&& f1, F2&& f2); template bool try_emplace_and_visit(K&& k, Args&&... args, " "F1&& f1, F2&& f2); template bool " "try_emplace_and_cvisit(K&& k, Args&&... args, F1&& f1, F2&& f2); ```" msgstr "" "```c++ template bool " "try_emplace_and_visit(const key_type& k, Args&&... args, " "F1&& f1, F2&& f2); template bool try_emplace_and_cvisit(const key_type& k, " "Args&&... args, F1&& f1, F2&& f2); template bool try_emplace_and_visit" "(key_type&& k, Args&&... args, F1&& f1, F2&& " "f2); template bool " "try_emplace_and_cvisit(key_type&& k, Args&&... args, " "F1&& f1, F2&& f2); template bool try_emplace_and_visit" "(K&& k, Args&&... args, F1&& f1, F2&& f2); " "template " "bool try_emplace_and_cvisit(K&& k, Args&&... args, " "F1&& f1, F2&& f2); ```" "" #: :1434 #, safe-html, strict-same msgid "" "Inserts an element constructed from `k` and `args` into the table if there " "is no existing element with key `k` contained within it, and then invokes " "`f1` with a non-const reference to the newly created element. Otherwise, " "invokes `f2` with a reference to the equivalent element; such reference is " "const iff a `*_cvisit` overload is used." msgstr "" "若表中不存在键为`k`的元素，则将由`k`和`args`构造的元素插入表中，随后以非常量" "引用指向新创建的元素并调用`f1`。\n" "否则，以指向等价元素的引用调用`f2`；当且仅当使用`*_cvisit`重载版本时，该引用" "为常量引用。" #: :1439 #, safe-html, strict-same msgctxt ":1439" msgid "" "Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on " "rehashing of `*this`. Notes:;; No `value_type` is constructed if there is an " "element with an equivalent key; otherwise, the construction is of the form: " "+ + -- ```c++" msgstr "" "返回值：;; 若执行插入操作则返回 true。\n" "并发特性：;; 阻塞对 *this 的重哈希操作。\n" "注意：;; 若已存在等价键的元素，则不会构造 value_type；否则，构造方式如下：" #: :1447 #, safe-html, strict-same msgctxt ":1447" msgid "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...))" msgstr "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...))" #: :1452 #, safe-html, strict-same msgctxt ":1452" msgid "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...)) ```" msgstr "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(args)...)) ```" #: :1457 #, safe-html, strict-same msgid "" "The interface is exposition only, as C++ does not allow to declare parameter " "`f1` and `f2` after a variadic parameter pack." msgstr "该接口仅为说明性用法，因为 C++ 不允许在可变参数包之后声明 `f1` 和 `f2` 参数。" #: :1459 #, safe-html, strict-same msgid "" "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 "" "仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 为有效成员类型别名时" "，`template` 这些重载版" "本才会参与重载决议。\n" "库假定 `Hash` 可同时接受 `K` 类型与 `Key` 类型作为参数，且 `Pred` 是透明的" "。\n" "这支持**异构查找**，从而避免实例化 `Key` 类型对象带来的性能开销。" #: :1461 #, safe-html, strict-same msgctxt ":1461" msgid "--" msgstr "--" #: :1463 #, safe-html, strict-same msgctxt ":1463" msgid "---" msgstr "---" #: :1465 #, safe-html, strict-same msgid "insert_or_assign" msgstr "insert_or_assign" #: :1466 #, safe-html, strict-same msgid "" "```c++ template bool insert_or_assign(const key_type& k, M&& obj); " "template bool insert_or_assign(key_type&& k, M&& obj); " "template bool insert_or_assign(K&& k, M&& obj); ```" msgstr "" "```c++ template bool insert_or_assign(const key_type& k, " "M&& obj); template bool insert_or_assign" "(key_type&& k, M&& obj); template bool insert_or_assign(K&& k, M&& obj); ```" #: :1472 #, safe-html, strict-same msgid "" "Inserts a new element into the table or updates an existing one by assigning " "to the contained value." msgstr "向表中插入新元素，或通过为已包含的值赋值来更新现有元素。" #: :1474 #, safe-html, strict-same msgid "" "If there is an element with key `k`, then it is updated by assigning " "`std::forward(obj)`." msgstr "若表中存在键为`k`的元素，则通过`std::forward(obj)`赋值来更新该元素。" #: :1476 #, safe-html, strict-same msgid "If there is no such element, it is added to the table as: ```c++" msgstr "若不存在该元素，则以如下形式添加到表中：" #: :1479 #, safe-html, strict-same msgid "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(obj)))" msgstr "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(obj)))" #: :1484 #, safe-html, strict-same msgid "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(obj))) ```" msgstr "" "value_type(std::piecewise_construct, std::forward_as_tuple(std::forward" "(k)), std::forward_as_tuple(std::forward(obj))) ```" #: :1490 #, safe-html, strict-same msgid "" "Returns:;; `true` if an insert took place. Concurrency:;; Blocking on " "rehashing of `*this`. Notes:;; The `template` 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 "" "返回值：;; 若执行插入操作则返回 `true`。\n" "并发特性：;; 阻塞对 `*this` 的重哈希操作。\n" "注意：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员类" "型别名时，`template` 才参与重载决议。库假定 " "`Hash` 可同时接受 `K` 类型与 `Key` 类型作为参数，且 `Pred` 是透明的。这支持异" "构查找，从而避免实例化 `Key` 类型对象带来的性能开销。" #: :1494 #, safe-html, strict-same msgctxt ":1494" msgid "---" msgstr "---" #: :1496 #, safe-html, strict-same msgid "erase" msgstr "擦除" #: :1497 #, 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); ```" #: :1502 #, safe-html, strict-same msgid "Erases the element with key equivalent to `k` if it exists." msgstr "若存在键与 `k` 等价的元素，则删除该元素。" #: :1505 #, 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" "注意：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员类" "型别名时，`template` 重载版本才参与重载决议。库假定 `Hash` 可同" "时接受 `K` 类型与 `Key` 类型作为参数，且 `Pred` 是透明的。这支持异构查找，从" "而避免实例化 `Key` 类型对象带来的性能开销。" #: :1509 #, safe-html, strict-same msgctxt ":1509" msgid "---" msgstr "---" #: :1511 #, safe-html, strict-same msgid "erase_if by Key" msgstr "erase_if by Key" #: :1512 #, 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); ```" #: :1517 #, safe-html, strict-same msgid "" "Erases the element `x` with key equivalent to `k` if it exists and `f(x)` is " "`true`." msgstr "若存在键与 `k` 等价的元素 `x`，且 `f(x)` 返回 `true`，则删除该元素。" #: :1520 #, 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:;; `f` is " "passed a non-const reference to `x`. + + 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" "注意：;; `f` 接收指向 `x` 的非常量引用。\n" "`template` 重载版本仅在 " "`std::is_execution_policy_v>` 为 " "`false` 时参与重载决议。\n" "`template` 重载版本仅在 " "`Hash::is_transparent` 和 `Pred::is_transparent` 为有效成员类型别名时参与重载" "决议。库假定 `Hash` 可同时接受 `K` 类型与 `Key` 类型作为参数，且 `Pred` 是透" "明的。这支持异构查找，从而避免实例化 `Key` 类型对象带来的性能开销。" #: :1528 #, safe-html, strict-same msgctxt ":1528" msgid "---" msgstr "---" #: :1530 #, safe-html, strict-same msgctxt ":1530" msgid "erase_if" msgstr "erase_if" #: :1531 #, safe-html, strict-same msgid "```c++ template size_type erase_if(F f); ```" msgstr "```c++ template size_type erase_if(F f); ```" #: :1535 #, safe-html, strict-same msgid "" "Successively invokes `f` with non-const references to each of the elements " "in the table, and erases those for which `f` returns `true`." msgstr "" "依次以非常量引用为参数，对表中的每个元素调用 `f`，并删除所有 `f` 返回 `true` " "的元素。" #: :1538 #, 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` 抛出异常时才会抛出。" #: :1541 #, safe-html, strict-same msgctxt ":1541" msgid "---" msgstr "---" #: :1543 #, safe-html, strict-same msgid "Parallel erase_if" msgstr "并行条件擦除" #: :1544 #, safe-html, strict-same msgid "" "```c++ template void erase_if" "(ExecutionPolicy&& policy, F f); ```" msgstr "" "```c++ template void erase_if" "(ExecutionPolicy&& policy, F f); ```" #: :1548 #, safe-html, strict-same msgid "" "Invokes `f` with non-const 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` 的元素。" #: :1552 #, 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`。注意：;; 仅在支持 C++17 并行算法的编译器中可用。该重载版" "本仅在`std::is_execution_policy_v>` " "为 `true` 时参与重载决议。不允许使用无序执行策略。" #: :1559 #, safe-html, strict-same msgctxt ":1559" msgid "---" msgstr "---" #: :1561 #, safe-html, strict-same msgid "swap" msgstr "交换" #: :1562 #, safe-html, strict-same msgid "" "```c++ void swap(concurrent_node_map& other) noexcept" "(boost::allocator_traits::is_always_equal::value || " "boost::allocator_traits::propagate_on_container_swap::value); ```" msgstr "" "```c++ void swap(concurrent_node_map& other) noexcept" "(boost::allocator_traits::is_always_equal::value || " "boost::allocator_traits::propagate_on_container_swap::value); " "```" #: :1568 #, safe-html, strict-same msgid "Swaps the contents of the table with the parameter." msgstr "将当前表与参数表的内容进行交换。" #: :1570 #, 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` 且其值为 `true`，则交换两个" "表的分配器；否则，使用不相等的分配器进行交换会导致未定义行为。" #: :1573 #, 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`。" #: :1576 #, safe-html, strict-same msgctxt ":1576" msgid "---" msgstr "---" #: :1578 #, safe-html, strict-same msgid "extract" msgstr "extract" #: :1579 #, safe-html, strict-same msgid "" "```c++ node_type extract(const key_type& k); template node_type " "extract(K&& k); ```" msgstr "" "```c++ node_type extract(const key_type& k); template " "node_type extract(K&& k); ```" #: :1584 #, safe-html, strict-same msgid "Extracts the element with key equivalent to `k`, if it exists." msgstr "若存在键与 `k` 等价的元素，则提取该元素。" #: :1587 #, safe-html, strict-same msgid "" "Returns:;; A `node_type` object holding the extracted element, or empty if " "no element was extracted. 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 "" "返回值：;; 一个存储被提取元素的 `node_type` 对象；若未提取任何元素，则为空。" "抛出异常：;; 仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。注意：;; 仅当 " "`Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员类型别名时" "，`template` 重载版本才参与重载决议。库假定 `Hash` 可同时接受 " "`K` 类型与 `Key` 类型作为参数，且 `Pred` 是透明的。这支持异构查找，从而避免实" "例化 `Key` 类型对象带来的性能开销。" #: :1591 #, safe-html, strict-same msgctxt ":1591" msgid "---" msgstr "---" #: :1593 #, safe-html, strict-same msgid "extract_if" msgstr "条件提取" #: :1594 #, safe-html, strict-same msgid "" "```c++ template node_type extract_if(const key_type& k, F f); " "template node_type extract_if(K&& k, F f); ```" msgstr "" "```c++ template node_type extract_if(const key_type& k, F " "f); template node_type extract_if" "(K&& k, F f); ```" #: :1599 #, safe-html, strict-same msgid "" "Extracts the element `x` with key equivalent to `k`, if it exists and `f(x)` " "is `true`." msgstr "若存在键与 `k` 等价的元素 `x`，且 `f(x)` 返回 `true`，则提取该元素。" #: :1602 #, safe-html, strict-same msgid "" "Returns:;; A `node_type` object holding the extracted element, or empty if " "no element was extracted. Throws:;; Only throws an exception if it is thrown " "by `hasher` or `key_equal` or `f`. 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 "" "返回值：;; 一个存储被提取元素的 `node_type` 对象；若未提取任何元素，则为空" "。\n" "抛出异常：;; 仅当 `hasher`、`key_equal` 或 `f` 抛出异常时才会抛出。\n" "注意：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员类" "型别名时，`template` 重载版本才参与重载决议。库假定 `Hash` 可同" "时接受 `K` 类型与 `Key` 类型作为参数，且 `Pred` 是透明的。这支持异构查找，从" "而避免实例化 `Key` 类型对象带来的性能开销。" #: :1606 #, safe-html, strict-same msgctxt ":1606" msgid "---" msgstr "---" #: :1608 #, safe-html, strict-same msgid "clear" msgstr "清空" #: :1609 #, safe-html, strict-same msgid "```c++ void clear() noexcept; ```" msgstr "```c++ void clear() noexcept; ```" #: :1613 #, safe-html, strict-same msgid "Erases all elements in the table." msgstr "清空表中的所有元素。" #: :1616 #, 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`。" #: :1619 #, safe-html, strict-same msgctxt ":1619" msgid "---" msgstr "---" #: :1621 #, safe-html, strict-same msgid "merge" msgstr "合并" #: :1622 #, safe-html, strict-same msgid "" "```c++ template size_type merge(concurrent_node_map& source); template size_type merge" "(concurrent_node_map&& source); ```" msgstr "" "```c++ template size_type merge" "(concurrent_node_map& " "source); template size_type merge" "(concurrent_node_map" "&& source); ```" #: :1629 #, 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` 中删除这些元素。" #: :1632 #, safe-html, strict-same msgid "" "Returns:;; The number of elements inserted. Concurrency:;; Blocking on " "`*this` and `source`." msgstr "" "返回值：;; 插入的元素数量。\n" "并发特性：;; 阻塞当前容器 `*this` 与源容器 `source`。" #: :1635 #, safe-html, strict-same msgctxt ":1635" msgid "---" msgstr "---" #: :1637 #, safe-html, strict-same msgid "Observers" msgstr "观察器" #: :1639 #, safe-html, strict-same msgid "get_allocator" msgstr "get++_++allocator" #: :1640 #, safe-html, strict-same msgid "``` allocator_type get_allocator() const noexcept; ```" msgstr "``` allocator_type get_allocator() const noexcept; ```" #: :1645 #, safe-html, strict-same msgid "Returns:;; The table's allocator." msgstr "返回值：;; 表的分配器。" #: :1647 #, safe-html, strict-same msgctxt ":1647" msgid "---" msgstr "---" #: :1649 #, safe-html, strict-same msgid "hash_function" msgstr "哈希函数" #: :1650 #, safe-html, strict-same msgid "``` hasher hash_function() const; ```" msgstr "``` hasher hash_function() const; ```" #: :1655 #, safe-html, strict-same msgid "Returns:;; The table's hash function." msgstr "返回值：;; 表的哈希函数。" #: :1657 #, safe-html, strict-same msgctxt ":1657" msgid "---" msgstr "---" #: :1659 #, safe-html, strict-same msgid "key_eq" msgstr "key_eq" #: :1660 #, safe-html, strict-same msgid "``` key_equal key_eq() const; ```" msgstr "``` key_equal key_eq() const; ```" #: :1665 #, safe-html, strict-same msgid "Returns:;; The table's key equality predicate." msgstr "返回值：;; 表的键相等性谓词。" #: :1667 #, safe-html, strict-same msgctxt ":1667" msgid "---" msgstr "---" #: :1669 #, safe-html, strict-same msgid "Map Operations" msgstr "映射操作" #: :1671 #, safe-html, strict-same msgid "count" msgstr "count" #: :1672 #, 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; ```" #: :1679 #, 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" "注意：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员类" "型别名时，`template` 重载版本才参与重载决议。库假定 `Hash` 可同" "时接受 `K` 类型与 `Key` 类型作为参数，且 `Pred` 是透明的。这支持异构查找，从" "而避免实例化 `Key` 类型对象带来的性能开销。\n" "在存在并发插入操作的情况下，返回的值可能无法精确反映执行后容器的真实状态。" #: :1685 #, safe-html, strict-same msgctxt ":1685" msgid "---" msgstr "---" #: :1687 #, safe-html, strict-same msgid "contains" msgstr "包含" #: :1688 #, 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; ```" #: :1695 #, 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" "注意：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员类" "型别名时，`template` 重载版本才参与重载决议。库假定 `Hash` 可同" "时接受 `K` 类型与 `Key` 类型作为参数，且 `Pred` 是透明的。这支持异构查找，从" "而避免实例化 `Key` 类型对象带来的性能开销。\n" "在存在并发插入操作的情况下，返回的值可能无法精确反映执行后容器的真实状态。" #: :1701 #, safe-html, strict-same msgctxt ":1701" msgid "---" msgstr "---" #: :1702 #, safe-html, strict-same msgid "Bucket Interface" msgstr "桶接口" #: :1704 #, safe-html, strict-same msgid "bucket_count" msgstr "bucket_count" #: :1705 #, safe-html, strict-same msgid "```c++ size_type bucket_count() const noexcept; ```" msgstr "```c++ size_type bucket_count() const noexcept; ```" #: :1710 #, safe-html, strict-same msgid "Returns:;; The size of the bucket array." msgstr "返回值：;; 桶数组的大小。" #: :1712 #, safe-html, strict-same msgctxt ":1712" msgid "---" msgstr "---" #: :1714 #, safe-html, strict-same msgid "Hash Policy" msgstr "哈希策略" #: :1716 #, safe-html, strict-same msgid "load_factor" msgstr "负载因子" #: :1717 #, safe-html, strict-same msgid "```c++ float load_factor() const noexcept; ```" msgstr "```c++ float load_factor() const noexcept; ```" #: :1722 #, 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`。" #: :1724 #, safe-html, strict-same msgctxt ":1724" msgid "---" msgstr "---" #: :1726 #, safe-html, strict-same msgid "max_load_factor" msgstr "max_load_factor（最大负载因子）" #: :1728 #, safe-html, strict-same msgid "```c++ float max_load_factor() const noexcept; ```" msgstr "```c++ float max_load_factor() const noexcept; ```" #: :1733 #, safe-html, strict-same msgid "Returns:;; Returns the table's maximum load factor." msgstr "返回值：;; 容器的最大负载因子。" #: :1735 #, safe-html, strict-same msgctxt ":1735" msgid "---" msgstr "---" #: :1737 #, safe-html, strict-same msgid "Set max_load_factor" msgstr "设置最大负载因子" #: :1738 #, safe-html, strict-same msgid "```c++ void max_load_factor(float z); ```" msgstr "```c++ void max_load_factor(float z); ```" #: :1743 #, safe-html, strict-same msgid "" "Effects:;; Does nothing, as the user is not allowed to change this " "parameter. Kept for compatibility with `boost::unordered_map`." msgstr "" "效果：;; 不执行任何操作，因为不允许用户修改此参数。保留该函数是为了与 " "`boost::unordered_map` 保持兼容。" #: :1745 #, safe-html, strict-same msgctxt ":1745" msgid "---" msgstr "---" #: :1748 #, safe-html, strict-same msgid "max_load" msgstr "max_load（最大负载）" #: :1750 #, safe-html, strict-same msgid "```c++ size_type max_load() const noexcept; ```" msgstr "```c++ size_type max_load() const noexcept; ```" #: :1755 #, 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" "在存在并发插入操作的情况下，返回的值可能无法精确反映执行后容器的真实状态。" #: :1762 #, safe-html, strict-same msgctxt ":1762" msgid "---" msgstr "---" #: :1764 #, safe-html, strict-same msgid "rehash" msgstr "重哈希" #: :1765 #, safe-html, strict-same msgid "```c++ void rehash(size_type n); ```" msgstr "```c++ void rehash(size_type n); ```" #: :1769 #, 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`，且负载因子小于等于最大负" "载因子。适用时，该操作会增大或缩小容器的桶数量 `bucket_count()`。" #: :1771 #, safe-html, strict-same msgid "" "When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array." msgstr "" "效果：;; 当容器元素数量 `size() == 0` 时，调用 `rehash(0)` 会释放底层桶数组的" "内存。" #: :1774 #, 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`。" #: :1778 #, safe-html, strict-same msgid "reserve" msgstr "保留" #: :1779 #, safe-html, strict-same msgid "```c++ void reserve(size_type n); ```" msgstr "```c++ void reserve(size_type n); ```" #: :1783 #, safe-html, strict-same msgid "Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`." msgstr "效果：;; 等价于 `a.rehash(ceil(n / a.max_load_factor()))`。" #: :1785 #, 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` 功能类似，该函数可用于增大或缩小容器的桶数量。" #: :1788 #, 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`。" #: :1791 #, safe-html, strict-same msgctxt ":1791" msgid "---" msgstr "---" #: :1793 #, safe-html, strict-same msgid "Statistics" msgstr "统计信息" #: :1795 #, safe-html, strict-same msgid "get_stats" msgstr "get_stats" #: :1796 #, safe-html, strict-same msgid "```c++ stats get_stats() const; ```" msgstr "```c++ stats get_stats() const; ```" #: :1801 #, 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_node_map_boost_unordered_enable_stats[enabled]." msgstr "" "返回值：;; 表截至目前执行的插入和查找操作的统计信息描述。\n" "注意：;; 仅当启用了**统计信息计算**功能时可用。" #: :1804 #, safe-html, strict-same msgctxt ":1804" msgid "---" msgstr "---" #: :1806 #, safe-html, strict-same msgid "reset_stats" msgstr "reset_stats" #: :1807 #, safe-html, strict-same msgid "```c++ void reset_stats() noexcept; ```" msgstr "```c++ void reset_stats() noexcept; ```" #: :1812 #, 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_node_map_boost_unordered_enable_stats[enabled]." msgstr "" "效果：;; 将容器维护的内部统计数据归零。\n" "注意：;; 仅当 xref:reference/stats.adoc#stats[statistics calculation] 被 " "xref:concurrent_node_map_boost_unordered_enable_stats[enabled] 启用时可用。" #: :1815 #, safe-html, strict-same msgctxt ":1815" msgid "---" msgstr "---" #: :1817 #, safe-html, strict-same msgid "Deduction Guides" msgstr "推导指引" #: :1818 #, safe-html, strict-same msgid "" "A deduction guide will not participate in overload resolution if any of the " "following are true:" msgstr "如果以下任何一条件为真，则推导指引将不参与重载决议：" #: :1820 #, 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` 模板参数，且为该参数推导出的类型" "符合分配器要求。" #: :1825 #, safe-html, strict-same msgid "" "A `size_­type` parameter type in a deduction guide refers to the `size_­type` " "member type of the table type deduced by the deduction guide. Its default " "value coincides with the default value of the constructor selected." msgstr "" "推导指引中的 `size++_++type` 参数类型，指向由该推导指引所推导容器类型的 " "`size++_++type` 成员类型。其默认值与所选构造函数的默认值一致。" #: :1829 #, safe-html, strict-same msgid "__iter-value-type__" msgstr "_iter-value-type_" #: :1837 #, safe-html, strict-same msgid "__iter-key-type__" msgstr "__iter-key-type__" #: :1845 #, safe-html, strict-same msgid "__iter-mapped-type__" msgstr "__iter-mapped-type__" #: :1853 #, safe-html, strict-same msgid "__iter-to-alloc-type__" msgstr "__iter-to-alloc-type__" #: :1862 #, safe-html, strict-same msgid "Equality Comparisons" msgstr "相等性比较" #: :1864 #, safe-html, strict-same msgid "operator" msgstr "operator" #: :1865 #, safe-html, strict-same msgid "" "```c++ template " "bool operator==(const concurrent_node_map& x, " "const concurrent_node_map& y); ```" msgstr "" "```c++ template bool operator==(const concurrent_node_map& x, const concurrent_node_map& y); ```" #: :1871 #, 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`。" #: :1874 #, safe-html, strict-same msgctxt ":1874" 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" "注意：;; 若两个表的相等性谓词不一致，行为未定义。" #: :1877 #, safe-html, strict-same msgctxt ":1877" msgid "---" msgstr "---" #: :1879 #, safe-html, strict-same msgid "operator!" msgstr "operator!" #: :1880 #, safe-html, strict-same msgid "" "```c++ template " "bool operator!=(const concurrent_node_map& x, " "const concurrent_node_map& y); ```" msgstr "" "```c++ template bool operator!=(const concurrent_node_map& x, const concurrent_node_map& y); ```" #: :1886 #, 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`。" #: :1889 #, safe-html, strict-same msgctxt ":1889" 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" "注意：;; 若两个表的相等性谓词不兼容，行为未定义。" #: :1892 #, safe-html, strict-same msgctxt ":1892" msgid "---" msgstr "---" #: :1894 #, safe-html, strict-same msgid "Swap" msgstr "交换" #: :1895 #, safe-html, strict-same msgid "" "```c++ template " "void swap(concurrent_node_map& x, " "concurrent_node_map& y) noexcept(noexcept(x.swap" "(y))); ```" msgstr "" "```c++ template void swap(concurrent_node_map& x, concurrent_node_map& y) noexcept(noexcept(x.swap(y))); ```" #: :1902 #, safe-html, strict-same msgctxt ":1902" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等价于 [listing,subs=\"+macros,+quotes\"]" #: :1908 #, safe-html, strict-same msgctxt ":1908" msgid "---" msgstr "---" #: :1910 #, safe-html, strict-same msgctxt ":1910" msgid "erase_if" msgstr "erase_if" #: :1911 #, safe-html, strict-same msgid "" "```c++ template typename concurrent_node_map::size_type erase_if" "(concurrent_node_map& c, Predicate pred); ```" msgstr "" "```c++ template typename concurrent_node_map::size_type erase_if(concurrent_node_map& c, Predicate pred); ```" #: :1917 #, safe-html, strict-same msgctxt ":1917" msgid "Equivalent to [listing,subs=\"+macros,+quotes\"]" msgstr "等价于 [listing,subs=\"+macros,+quotes\"]" #: :1923 #, safe-html, strict-same msgid "Serialization" msgstr "序列化" #: :1925 #, safe-html, strict-same msgid "" "``concurrent_node_map``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 "" "`concurrent++_++node++_++map` 可通过本库提供的 API，借助 link:../../../../../" "serialization/index.html[Boost.Serialization] 实现归档/检索功能。同时支持常规" "格式与 XML 格式的归档文件。" #: :1929 #, safe-html, strict-same msgid "Saving an concurrent_node_map to an archive" msgstr "将 concurrent++_++node++_++map 保存至归档" #: :1931 #, safe-html, strict-same msgid "" "Saves all the elements of a `concurrent_node_map` `x` to an archive (XML " "archive) `ar`." msgstr "" "将 `concurrent++_++node++_++map` 容器 `x` 中的所有元素保存至归档（XML 格式归" "档） `ar` 中。" #: :1934 #, safe-html, strict-same msgid "" "Requires:;; `std::remove_const::type` and " "`std::remove_const::type` are serializable (XML serializable), " "and they do support 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 "" "要求;; `std::remove++_++const++<++key++_++type++>++::type` 和 " "`std::remove++_++const++<++mapped++_++type++>++::type` 必须满足可序列化" "要求（XML 可序列化），且需要支持 Boost.Serialization 的 " "`save++_++construct++_++data` / `load++_++construct++_++data` 协议（该协议自" "动支持 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默" "认构造] 要求）。 并发性;; 阻塞于 `x` 。" #: :1941 #, safe-html, strict-same msgctxt ":1941" msgid "---" msgstr "---" #: :1943 #, safe-html, strict-same msgid "Loading an concurrent_node_map from an archive" msgstr "从归档加载 concurrent++_++node++_++map" #: :1945 #, safe-html, strict-same msgid "" "Deletes all preexisting elements of a `concurrent_node_map` `x` and inserts " "from an archive (XML archive) `ar` restored copies of the elements of the " "original `concurrent_node_map` `other` saved to the storage read by `ar`." msgstr "" "删除 `concurrent++_++node++_++map` 容器 `x` 中的所有现有元素，并从归档（XML " "归档） `ar` 插入原始 `concurrent++_++node++_++map` 容器 `other` 的元素副本，" "这些副本保存在 `ar` 读取的存储中。" #: :1950 #, 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` 。"