msgid "" msgstr "" "Project-Id-Version: English (Boost Unordered Translation (zh_Hans))\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2026-06-06 18:56+0000\n" "PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n" "Last-Translator: FULL NAME \n" "Language-Team: English \n" "Language: en\n" "MIME-Version: 1.0\n" "Content-Type: text/plain; charset=UTF-8\n" "Content-Transfer-Encoding: 8bit\n" "Plural-Forms: nplurals=2; plural=n != 1;\n" "X-Generator: Weblate 2026.5\n" #: :2 #, read-only, safe-html, strict-same msgid "Class Template unordered_node_map" msgstr "Class Template unordered_node_map" #: :4 #, read-only, safe-html, strict-same msgid ":idprefix: unordered_node_map_" msgstr ":idprefix: unordered_node_map_" #: :6 #, read-only, safe-html, strict-same msgid "" "`boost::unordered_node_map` — A node-based, open-addressing unordered " "associative container that associates unique keys with another value." msgstr "" "`boost::unordered_node_map` — A node-based, open-addressing unordered " "associative container that associates unique keys with another value." #: :8 #, read-only, safe-html, strict-same msgid "" "`boost::unordered_node_map` uses an open-addressing layout like " "`boost::unordered_flat_map`, but, being node-based, it provides pointer " "stability and node handling functionalities. Its performance lies between " "those of `boost::unordered_map` and `boost::unordered_flat_map`." msgstr "" "`boost::unordered_node_map` uses an open-addressing layout like " "`boost::unordered_flat_map`, but, being node-based, it provides pointer " "stability and node handling functionalities. Its performance lies between " "those of `boost::unordered_map` and `boost::unordered_flat_map`." #: :12 #, read-only, safe-html, strict-same msgid "" "As a result of its using open addressing, the interface of " "`boost::unordered_node_map` deviates in a number of aspects from that of " "`boost::unordered_map`/`std::unordered_map`:" msgstr "" "As a result of its using open addressing, the interface of " "`boost::unordered_node_map` deviates in a number of aspects from that of " "`boost::unordered_map`/`std::unordered_map`:" #: :15 #, read-only, safe-html, strict-same msgid "" "- `begin()` is not constant-time. - There is no API for bucket handling " "(except `bucket_count`). - The maximum load factor of the container is " "managed internally and can't be set by the user." msgstr "" "- `begin()` is not constant-time. - There is no API for bucket handling " "(except `bucket_count`). - The maximum load factor of the container is " "managed internally and can't be set by the user." #: :19 #, read-only, safe-html, strict-same msgid "" "Other than this, `boost::unordered_node_map` is mostly a drop-in replacement " "of standard unordered associative containers." msgstr "" "Other than this, `boost::unordered_node_map` is mostly a drop-in replacement " "of standard unordered associative containers." #: :22 #, read-only, safe-html, strict-same msgid "Synopsis" msgstr "Synopsis" #: :286 #, read-only, safe-html, strict-same msgctxt ":286" msgid "---" msgstr "---" #: :288 #, read-only, safe-html, strict-same msgid "Description" msgstr "Description" #: :290 #, read-only, safe-html, strict-same msgid "*Template Parameters*" msgstr "*Template Parameters*" #: :293 #, read-only, safe-html, strict-same msgid "_Key_" msgstr "_Key_" #: :297 #, read-only, safe-html, strict-same msgid "" "into the container 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 container." msgstr "" "into the container 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 container." #: :300 #, read-only, safe-html, strict-same msgid "_T_" msgstr "_T_" #: :300 #, read-only, safe-html, strict-same msgid "_Hash_" msgstr "_Hash_" #: :300 #, read-only, 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 "" "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`." #: :300 #, read-only, safe-html, strict-same msgid "_Pred_" msgstr "_Pred_" #: :300 #, read-only, 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 "" "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`." #: :300 #, read-only, safe-html, strict-same msgid "_Allocator_" msgstr "_Allocator_" #: :300 #, read-only, safe-html, strict-same msgid "" "An allocator whose value type is the same as the container's value type." msgstr "" "An allocator whose value type is the same as the container's value type." #: :310 #, read-only, safe-html, strict-same msgid "" "Allocators using https://en.cppreference.com/w/cpp/named_req/" "Allocator#Fancy_pointers[fancy pointers] are supported." msgstr "" "Allocators using https://en.cppreference.com/w/cpp/named_req/" "Allocator#Fancy_pointers[fancy pointers] are supported." #: :314 #, read-only, safe-html, strict-same msgid "" "The element nodes of the container are held into an internal _bucket array_. " "A 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 "" "The element nodes of the container are held into an internal _bucket array_. " "A 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." #: :318 #, read-only, 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 container (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 "" "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 container (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." #: :323 #, read-only, 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 "" "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." #: :327 #, read-only, safe-html, strict-same msgctxt ":327" msgid "---" msgstr "---" #: :329 #, read-only, safe-html, strict-same msgid "Configuration Macros" msgstr "Configuration Macros" #: :331 #, read-only, safe-html, strict-same msgid "`BOOST_UNORDERED_ENABLE_STATS`" msgstr "`BOOST_UNORDERED_ENABLE_STATS`" #: :333 #, read-only, safe-html, strict-same msgid "" "Globally define this macro to enable xref:reference/" "stats.adoc#stats[statistics calculation] for the container. Note that this " "option decreases the overall performance of many operations." msgstr "" "Globally define this macro to enable xref:reference/" "stats.adoc#stats[statistics calculation] for the container. Note that this " "option decreases the overall performance of many operations." #: :336 #, read-only, safe-html, strict-same msgctxt ":336" msgid "---" msgstr "---" #: :338 #, read-only, safe-html, strict-same msgid "Typedefs" msgstr "Typedefs" #: :345 #, read-only, safe-html, strict-same msgid "An iterator whose value type is `value_type`." msgstr "An iterator whose value type is `value_type`." #: :347 #, read-only, safe-html, strict-same msgctxt ":347" msgid "The iterator category is at least a forward iterator." msgstr "The iterator category is at least a forward iterator." #: :349 #, read-only, safe-html, strict-same msgid "Convertible to `const_iterator`." msgstr "Convertible to `const_iterator`." #: :351 #, read-only, safe-html, strict-same msgctxt ":351" msgid "---" msgstr "---" #: :358 #, read-only, safe-html, strict-same msgid "A constant iterator whose value type is `value_type`." msgstr "A constant iterator whose value type is `value_type`." #: :360 #, read-only, safe-html, strict-same msgctxt ":360" msgid "The iterator category is at least a forward iterator." msgstr "The iterator category is at least a forward iterator." #: :362 #, read-only, safe-html, strict-same msgctxt ":362" msgid "---" msgstr "---" #: :369 #, read-only, safe-html, strict-same msgid "" "A class for holding extracted container elements, modelling https://" "en.cppreference.com/w/cpp/container/node_handle[NodeHandle]." msgstr "" "A class for holding extracted container elements, modelling https://" "en.cppreference.com/w/cpp/container/node_handle[NodeHandle]." #: :372 #, read-only, safe-html, strict-same msgctxt ":372" msgid "---" msgstr "---" #: :379 #, read-only, safe-html, strict-same msgid "A specialization of an internal class template:" msgstr "A specialization of an internal class template:" #: :392 #, read-only, safe-html, strict-same msgid "with `Iterator` = `iterator` and `NodeType` = `node_type`." msgstr "with `Iterator` = `iterator` and `NodeType` = `node_type`." #: :394 #, read-only, safe-html, strict-same msgctxt ":394" msgid "---" msgstr "---" #: :396 #, read-only, safe-html, strict-same msgid "Constructors" msgstr "Constructors" #: :398 #, read-only, safe-html, strict-same msgid "Default Constructor" msgstr "Default Constructor" #: :399 #, read-only, safe-html, strict-same msgid "```c++ unordered_node_map(); ```" msgstr "```c++ unordered_node_map(); ```" #: :403 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container using `hasher()` as the hash function, " "`key_equal()` as the key equality predicate and `allocator_type()` as the " "allocator." msgstr "" "Constructs an empty container using `hasher()` as the hash function, " "`key_equal()` as the key equality predicate and `allocator_type()` as the " "allocator." #: :407 #, read-only, safe-html, strict-same msgctxt ":407" 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 "" "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^]." #: :410 #, read-only, safe-html, strict-same msgctxt ":410" msgid "---" msgstr "---" #: :412 #, read-only, safe-html, strict-same msgid "Bucket Count Constructor" msgstr "Bucket Count Constructor" #: :413 #, read-only, safe-html, strict-same msgid "" "```c++ explicit unordered_node_map(size_type n, const hasher& hf = hasher(), " "const key_equal& eql = key_equal(), const allocator_type& a = allocator_type" "()); ```" msgstr "" "```c++ explicit unordered_node_map(size_type n, const hasher& hf = hasher(), " "const key_equal& eql = key_equal(), const allocator_type& a = allocator_type" "()); ```" #: :420 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container with at least `n` buckets, using `hf` as the " "hash function, `eql` as the key equality predicate, and `a` as the allocator." msgstr "" "Constructs an empty container with at least `n` buckets, using `hf` as the " "hash function, `eql` as the key equality predicate, and `a` as the allocator." #: :424 #, read-only, safe-html, strict-same msgctxt ":424" 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 "" "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^]." #: :427 #, read-only, safe-html, strict-same msgctxt ":427" msgid "---" msgstr "---" #: :429 #, read-only, safe-html, strict-same msgid "Iterator Range Constructor" msgstr "Iterator Range Constructor" #: :440 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container 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 "" "Constructs an empty container 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." #: :443 #, read-only, safe-html, strict-same msgctxt ":443" 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 "" "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^]." #: :445 #, read-only, safe-html, strict-same msgctxt ":445" msgid "---" msgstr "---" #: :447 #, read-only, safe-html, strict-same msgid "Copy Constructor" msgstr "Copy Constructor" #: :448 #, read-only, safe-html, strict-same msgid "```c++ unordered_node_map(unordered_node_map const& other); ```" msgstr "```c++ unordered_node_map(unordered_node_map const& other); ```" #: :452 #, read-only, safe-html, strict-same msgid "" "The copy constructor. Copies the contained elements, hash function, " "predicate and allocator." msgstr "" "The copy constructor. Copies the contained elements, hash function, " "predicate and allocator." #: :454 #, read-only, 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 "" "If `Allocator::select_on_container_copy_construction` exists and has the " "right signature, the allocator will be constructed from its result." #: :456 #, read-only, safe-html, strict-same msgctxt ":456" msgid "---" msgstr "---" #: :458 #, read-only, safe-html, strict-same msgid "Move Constructor" msgstr "Move Constructor" #: :459 #, read-only, safe-html, strict-same msgid "```c++ unordered_node_map(unordered_node_map&& other); ```" msgstr "```c++ unordered_node_map(unordered_node_map&& other); ```" #: :463 #, read-only, safe-html, strict-same msgid "" "The move constructor. 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:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the " "internal statistical information from `other` and calls `other.reset_stats()" "`." msgstr "" "The move constructor. 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:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the " "internal statistical information from `other` and calls `other.reset_stats()" "`." #: :468 #, read-only, safe-html, strict-same msgctxt ":468" msgid "---" msgstr "---" #: :470 #, read-only, safe-html, strict-same msgid "Iterator Range Constructor with Allocator" msgstr "Iterator Range Constructor with Allocator" #: :471 #, read-only, safe-html, strict-same msgid "" "```c++ template unordered_node_map(InputIterator f, " "InputIterator l, const allocator_type& a); ```" msgstr "" "```c++ template unordered_node_map(InputIterator f, " "InputIterator l, const allocator_type& a); ```" #: :476 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container using `a` as the allocator, with the default " "hash function and key equality predicate and inserts the elements from `[f, " "l)` into it." msgstr "" "Constructs an empty container using `a` as the allocator, with the default " "hash function and key equality predicate and inserts the elements from `[f, " "l)` into it." #: :479 #, read-only, safe-html, strict-same msgctxt ":479" msgid "" "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/" "cpp/named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/" "cpp/named_req/DefaultConstructible[DefaultConstructible^]." #: :481 #, read-only, safe-html, strict-same msgctxt ":481" msgid "---" msgstr "---" #: :483 #, read-only, safe-html, strict-same msgid "Allocator Constructor" msgstr "Allocator Constructor" #: :484 #, read-only, safe-html, strict-same msgid "```c++ explicit unordered_node_map(Allocator const& a); ```" msgstr "```c++ explicit unordered_node_map(Allocator const& a); ```" #: :488 #, read-only, safe-html, strict-same msgid "Constructs an empty container, using allocator `a`." msgstr "Constructs an empty container, using allocator `a`." #: :490 #, read-only, safe-html, strict-same msgctxt ":490" msgid "---" msgstr "---" #: :492 #, read-only, safe-html, strict-same msgid "Copy Constructor with Allocator" msgstr "Copy Constructor with Allocator" #: :493 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_node_map(unordered_node_map const& other, Allocator const& " "a); ```" msgstr "" "```c++ unordered_node_map(unordered_node_map const& other, Allocator const& " "a); ```" #: :497 #, read-only, safe-html, strict-same msgid "" "Constructs a container, copying ``other``'s contained elements, hash " "function, and predicate, but using allocator `a`." msgstr "" "Constructs a container, copying ``other``'s contained elements, hash " "function, and predicate, but using allocator `a`." #: :499 #, read-only, safe-html, strict-same msgctxt ":499" msgid "---" msgstr "---" #: :501 #, read-only, safe-html, strict-same msgid "Move Constructor with Allocator" msgstr "Move Constructor with Allocator" #: :502 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_node_map(unordered_node_map&& other, Allocator const& a); " "```" msgstr "" "```c++ unordered_node_map(unordered_node_map&& other, Allocator const& a); " "```" #: :506 #, read-only, safe-html, strict-same msgid "" "If `a == other.get_allocator()`, the element nodes of `other` are " "transferred directly to the new container; 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:unordered_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 "" "If `a == other.get_allocator()`, the element nodes of `other` are " "transferred directly to the new container; 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:unordered_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()`." #: :513 #, read-only, safe-html, strict-same msgctxt ":513" msgid "---" msgstr "---" #: :515 #, read-only, safe-html, strict-same msgid "Move Constructor from concurrent_node_map" msgstr "Move Constructor from concurrent_node_map" #: :517 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_node_map(concurrent_node_map" "&& other); ```" msgstr "" "```c++ unordered_node_map(concurrent_node_map" "&& other); ```" #: :521 #, read-only, safe-html, strict-same msgid "" "Move construction from a xref:#concurrent_node_map[`concurrent_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:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the " "internal statistical information from `other` and calls `other.reset_stats()" "`." msgstr "" "Move construction from a xref:#concurrent_node_map[`concurrent_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:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the " "internal statistical information from `other` and calls `other.reset_stats()" "`." #: :528 #, read-only, safe-html, strict-same msgid "Complexity:;; Constant time. Concurrency:;; Blocking on `other`." msgstr "Complexity:;; Constant time. Concurrency:;; Blocking on `other`." #: :531 #, read-only, safe-html, strict-same msgctxt ":531" msgid "---" msgstr "---" #: :533 #, read-only, safe-html, strict-same msgid "Initializer List Constructor" msgstr "Initializer List Constructor" #: :543 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container 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 "" "Constructs an empty container 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." #: :546 #, read-only, safe-html, strict-same msgctxt ":546" 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 "" "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^]." #: :548 #, read-only, safe-html, strict-same msgctxt ":548" msgid "---" msgstr "---" #: :550 #, read-only, safe-html, strict-same msgid "Bucket Count Constructor with Allocator" msgstr "Bucket Count Constructor with Allocator" #: :551 #, read-only, safe-html, strict-same msgid "```c++ unordered_node_map(size_type n, allocator_type const& a); ```" msgstr "```c++ unordered_node_map(size_type n, allocator_type const& a); ```" #: :555 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container 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 "" "Constructs an empty container with at least `n` buckets, using `hf` as the " "hash function, the default hash function and key equality predicate and `a` " "as the allocator." #: :558 #, read-only, 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 "" "Postconditions:;; `size() == 0` Requires:;; `hasher` and `key_equal` need to " "be https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^]." #: :561 #, read-only, safe-html, strict-same msgctxt ":561" msgid "---" msgstr "---" #: :563 #, read-only, safe-html, strict-same msgid "Bucket Count Constructor with Hasher and Allocator" msgstr "Bucket Count Constructor with Hasher and Allocator" #: :564 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_node_map(size_type n, hasher const& hf, allocator_type " "const& a); ```" msgstr "" "```c++ unordered_node_map(size_type n, hasher const& hf, allocator_type " "const& a); ```" #: :568 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container with at least `n` buckets, using `hf` as the " "hash function, the default key equality predicate and `a` as the allocator." msgstr "" "Constructs an empty container with at least `n` buckets, using `hf` as the " "hash function, the default key equality predicate and `a` as the allocator." #: :571 #, read-only, 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 "" "Postconditions:;; `size() == 0` Requires:;; `key_equal` needs to be https://" "en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^]." #: :574 #, read-only, safe-html, strict-same msgctxt ":574" msgid "---" msgstr "---" #: :576 #, read-only, safe-html, strict-same msgid "Iterator Range Constructor with Bucket Count and Allocator" msgstr "Iterator Range Constructor with Bucket Count and Allocator" #: :583 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container 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 "" "Constructs an empty container 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." #: :586 #, read-only, safe-html, strict-same msgctxt ":586" msgid "" "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/" "cpp/named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/" "cpp/named_req/DefaultConstructible[DefaultConstructible^]." #: :588 #, read-only, safe-html, strict-same msgctxt ":588" msgid "---" msgstr "---" #: :590 #, read-only, safe-html, strict-same msgid "Iterator Range Constructor with Bucket Count and Hasher" msgstr "Iterator Range Constructor with Bucket Count and Hasher" #: :598 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container 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 "" "Constructs an empty container 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." #: :601 #, read-only, safe-html, strict-same msgctxt ":601" msgid "" "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[DefaultConstructible^]." #: :603 #, read-only, safe-html, strict-same msgctxt ":603" msgid "---" msgstr "---" #: :605 #, read-only, safe-html, strict-same msgid "initializer_list Constructor with Allocator" msgstr "initializer_list Constructor with Allocator" #: :607 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_node_map(std::initializer_list il, const " "allocator_type& a); ```" msgstr "" "```c++ unordered_node_map(std::initializer_list il, const " "allocator_type& a); ```" #: :611 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container using `a` and default hash function and key " "equality predicate, and inserts the elements from `il` into it." msgstr "" "Constructs an empty container using `a` and default hash function and key " "equality predicate, and inserts the elements from `il` into it." #: :614 #, read-only, safe-html, strict-same msgctxt ":614" 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^]." #: :616 #, read-only, safe-html, strict-same msgctxt ":616" msgid "---" msgstr "---" #: :618 #, read-only, safe-html, strict-same msgid "initializer_list Constructor with Bucket Count and Allocator" msgstr "initializer_list Constructor with Bucket Count and Allocator" #: :620 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_node_map(std::initializer_list il, size_type n, " "const allocator_type& a); ```" msgstr "" "```c++ unordered_node_map(std::initializer_list il, size_type n, " "const allocator_type& a); ```" #: :624 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container with at least `n` buckets, using `a` and " "default hash function and key equality predicate, and inserts the elements " "from `il` into it." msgstr "" "Constructs an empty container with at least `n` buckets, using `a` and " "default hash function and key equality predicate, and inserts the elements " "from `il` into it." #: :627 #, read-only, safe-html, strict-same msgctxt ":627" 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^]." #: :629 #, read-only, safe-html, strict-same msgctxt ":629" msgid "---" msgstr "---" #: :631 #, read-only, safe-html, strict-same msgid "initializer_list Constructor with Bucket Count and Hasher and Allocator" msgstr "initializer_list Constructor with Bucket Count and Hasher and Allocator" #: :633 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_node_map(std::initializer_list il, size_type n, " "const hasher& hf, const allocator_type& a); ```" msgstr "" "```c++ unordered_node_map(std::initializer_list il, size_type n, " "const hasher& hf, const allocator_type& a); ```" #: :638 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container 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 "" "Constructs an empty container 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." #: :641 #, read-only, safe-html, strict-same msgctxt ":641" msgid "" "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[DefaultConstructible^]." msgstr "" "Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/" "named_req/DefaultConstructible[DefaultConstructible^]." #: :643 #, read-only, safe-html, strict-same msgctxt ":643" msgid "---" msgstr "---" #: :645 #, read-only, safe-html, strict-same msgid "Destructor" msgstr "Destructor" #: :647 #, read-only, safe-html, strict-same msgid "```c++ ~unordered_node_map(); ```" msgstr "```c++ ~unordered_node_map(); ```" #: :652 #, read-only, safe-html, strict-same msgid "" "Note:;; The destructor is applied to every element, and all memory is " "deallocated" msgstr "" "Note:;; The destructor is applied to every element, and all memory is " "deallocated" #: :654 #, read-only, safe-html, strict-same msgctxt ":654" msgid "---" msgstr "---" #: :656 #, read-only, safe-html, strict-same msgid "Assignment" msgstr "Assignment" #: :658 #, read-only, safe-html, strict-same msgid "Copy Assignment" msgstr "Copy Assignment" #: :660 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_node_map& operator=(unordered_node_map const& other); ```" msgstr "" "```c++ unordered_node_map& operator=(unordered_node_map const& other); ```" #: :664 #, read-only, 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 "" "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`." #: :669 #, read-only, safe-html, strict-same msgctxt ":669" msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]" msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]" #: :671 #, read-only, safe-html, strict-same msgctxt ":671" msgid "---" msgstr "---" #: :673 #, read-only, safe-html, strict-same msgid "Move Assignment" msgstr "Move Assignment" #: :674 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_node_map& operator=(unordered_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 the new container; otherwise, " "inserts move-constructed copies of the elements of `other`. If statistics " "are xref:unordered_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++ unordered_node_map& operator=(unordered_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 the new container; otherwise, " "inserts move-constructed copies of the elements of `other`. If statistics " "are xref:unordered_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()`." #: :688 #, read-only, safe-html, strict-same msgctxt ":688" msgid "---" msgstr "---" #: :690 #, read-only, safe-html, strict-same msgid "Initializer List Assignment" msgstr "Initializer List Assignment" #: :691 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_node_map& operator=(std::initializer_list il); " "```" msgstr "" "```c++ unordered_node_map& operator=(std::initializer_list il); " "```" #: :695 #, read-only, safe-html, strict-same msgid "" "Assign from values in initializer list. All previously existing elements are " "destroyed." msgstr "" "Assign from values in initializer list. All previously existing elements are " "destroyed." #: :698 #, read-only, safe-html, strict-same msgctxt ":698" msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]" msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]" #: :700 #, read-only, safe-html, strict-same msgid "Iterators" msgstr "Iterators" #: :702 #, read-only, safe-html, strict-same msgid "begin" msgstr "begin" #: :703 #, read-only, safe-html, strict-same msgid "" "```c++ iterator begin() noexcept; const_iterator begin() const noexcept; ```" msgstr "" "```c++ iterator begin() noexcept; const_iterator begin() const noexcept; ```" #: :709 #, read-only, safe-html, strict-same msgid "" "Returns:;; An iterator referring to the first element of the container, or " "if the container is empty the past-the-end value for the container. " "Complexity:;; O(`bucket_count()`)" msgstr "" "Returns:;; An iterator referring to the first element of the container, or " "if the container is empty the past-the-end value for the container. " "Complexity:;; O(`bucket_count()`)" #: :712 #, read-only, safe-html, strict-same msgctxt ":712" msgid "---" msgstr "---" #: :714 #, read-only, safe-html, strict-same msgid "end" msgstr "end" #: :715 #, read-only, safe-html, strict-same msgid "" "```c++ iterator end() noexcept; const_iterator end() const noexcept; ```" msgstr "" "```c++ iterator end() noexcept; const_iterator end() const noexcept; ```" #: :721 #, read-only, safe-html, strict-same msgid "" "Returns:;; An iterator which refers to the past-the-end value for the " "container." msgstr "" "Returns:;; An iterator which refers to the past-the-end value for the " "container." #: :723 #, read-only, safe-html, strict-same msgctxt ":723" msgid "---" msgstr "---" #: :725 #, read-only, safe-html, strict-same msgid "cbegin" msgstr "cbegin" #: :726 #, read-only, safe-html, strict-same msgid "```c++ const_iterator cbegin() const noexcept; ```" msgstr "```c++ const_iterator cbegin() const noexcept; ```" #: :731 #, read-only, safe-html, strict-same msgid "" "Returns:;; A `const_iterator` referring to the first element of the " "container, or if the container is empty the past-the-end value for the " "container. Complexity:;; O(`bucket_count()`)" msgstr "" "Returns:;; A `const_iterator` referring to the first element of the " "container, or if the container is empty the past-the-end value for the " "container. Complexity:;; O(`bucket_count()`)" #: :734 #, read-only, safe-html, strict-same msgctxt ":734" msgid "---" msgstr "---" #: :736 #, read-only, safe-html, strict-same msgid "cend" msgstr "cend" #: :737 #, read-only, safe-html, strict-same msgid "```c++ const_iterator cend() const noexcept; ```" msgstr "```c++ const_iterator cend() const noexcept; ```" #: :742 #, read-only, safe-html, strict-same msgid "" "Returns:;; A `const_iterator` which refers to the past-the-end value for the " "container." msgstr "" "Returns:;; A `const_iterator` which refers to the past-the-end value for the " "container." #: :744 #, read-only, safe-html, strict-same msgctxt ":744" msgid "---" msgstr "---" #: :746 #, read-only, safe-html, strict-same msgid "Size and Capacity" msgstr "Size and Capacity" #: :748 #, read-only, safe-html, strict-same msgid "empty" msgstr "empty" #: :750 #, read-only, safe-html, strict-same msgid "```c++ [[nodiscard]] bool empty() const noexcept; ```" msgstr "```c++ [[nodiscard]] bool empty() const noexcept; ```" #: :755 #, read-only, safe-html, strict-same msgid "Returns:;; `size() == 0`" msgstr "Returns:;; `size() == 0`" #: :757 #, read-only, safe-html, strict-same msgctxt ":757" msgid "---" msgstr "---" #: :759 #, read-only, safe-html, strict-same msgid "size" msgstr "size" #: :761 #, read-only, safe-html, strict-same msgid "```c++ size_type size() const noexcept; ```" msgstr "```c++ size_type size() const noexcept; ```" #: :766 #, read-only, safe-html, strict-same msgid "Returns:;; `std::distance(begin(), end())`" msgstr "Returns:;; `std::distance(begin(), end())`" #: :768 #, read-only, safe-html, strict-same msgctxt ":768" msgid "---" msgstr "---" #: :770 #, read-only, safe-html, strict-same msgid "max_size" msgstr "max_size" #: :772 #, read-only, safe-html, strict-same msgid "```c++ size_type max_size() const noexcept; ```" msgstr "```c++ size_type max_size() const noexcept; ```" #: :777 #, read-only, safe-html, strict-same msgid "Returns:;; `size()` of the largest possible container." msgstr "Returns:;; `size()` of the largest possible container." #: :779 #, read-only, safe-html, strict-same msgctxt ":779" msgid "---" msgstr "---" #: :781 #, read-only, safe-html, strict-same msgid "Modifiers" msgstr "Modifiers" #: :783 #, read-only, safe-html, strict-same msgid "emplace" msgstr "emplace" #: :784 #, read-only, safe-html, strict-same msgid "" "```c++ template std::pair emplace(Args&&... " "args); ```" msgstr "" "```c++ template std::pair emplace(Args&&... " "args); ```" #: :788 #, read-only, safe-html, strict-same msgctxt ":788" msgid "" "Inserts an object, constructed with the arguments `args`, in the container " "if and only if there is no element in the container with an equivalent key." msgstr "" "Inserts an object, constructed with the arguments `args`, in the container " "if and only if there is no element in the container with an equivalent key." #: :791 #, read-only, safe-html, strict-same msgctxt ":791" msgid "" "Requires:;; `value_type` is constructible from `args`. Returns:;; The `bool` " "component of the return type is `true` if an insert took place. + + If an " "insert took place, then the iterator points to the newly inserted element. " "Otherwise, it points to the element with equivalent key. Throws:;; If an " "exception is thrown by an operation other than a call to `hasher` the " "function has no effect. Notes:;; Can invalidate iterators, but only if the " "insert causes the load to be greater than the maximum load. + + 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. This optimization happens when `key_type` is move constructible or " "when the `k` argument is a `key_type`." msgstr "" "Requires:;; `value_type` is constructible from `args`. Returns:;; The `bool` " "component of the return type is `true` if an insert took place. + + If an " "insert took place, then the iterator points to the newly inserted element. " "Otherwise, it points to the element with equivalent key. Throws:;; If an " "exception is thrown by an operation other than a call to `hasher` the " "function has no effect. Notes:;; Can invalidate iterators, but only if the " "insert causes the load to be greater than the maximum load. + + 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. This optimization happens when `key_type` is move constructible or " "when the `k` argument is a `key_type`." #: :800 #, read-only, safe-html, strict-same msgctxt ":800" msgid "---" msgstr "---" #: :802 #, read-only, safe-html, strict-same msgid "emplace_hint" msgstr "emplace_hint" #: :803 #, read-only, safe-html, strict-same msgid "" "```c++ template iterator emplace_hint(const_iterator " "position, Args&&... args); ```" msgstr "" "```c++ template iterator emplace_hint(const_iterator " "position, Args&&... args); ```" #: :807 #, read-only, safe-html, strict-same msgctxt ":807" msgid "" "Inserts an object, constructed with the arguments `args`, in the container " "if and only if there is no element in the container with an equivalent key." msgstr "" "Inserts an object, constructed with the arguments `args`, in the container " "if and only if there is no element in the container with an equivalent key." #: :809 #, read-only, safe-html, strict-same msgid "" "`position` is a suggestion to where the element should be inserted. This " "implementation ignores it." msgstr "" "`position` is a suggestion to where the element should be inserted. This " "implementation ignores it." #: :812 #, read-only, safe-html, strict-same msgctxt ":812" msgid "" "Requires:;; `value_type` is constructible from `args`. Returns:;; The `bool` " "component of the return type is `true` if an insert took place. + + If an " "insert took place, then the iterator points to the newly inserted element. " "Otherwise, it points to the element with equivalent key. Throws:;; If an " "exception is thrown by an operation other than a call to `hasher` the " "function has no effect. Notes:;; Can invalidate iterators, but only if the " "insert causes the load to be greater than the maximum load. + + 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. This optimization happens when `key_type` is move constructible or " "when the `k` argument is a `key_type`." msgstr "" "Requires:;; `value_type` is constructible from `args`. Returns:;; The `bool` " "component of the return type is `true` if an insert took place. + + If an " "insert took place, then the iterator points to the newly inserted element. " "Otherwise, it points to the element with equivalent key. Throws:;; If an " "exception is thrown by an operation other than a call to `hasher` the " "function has no effect. Notes:;; Can invalidate iterators, but only if the " "insert causes the load to be greater than the maximum load. + + 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. This optimization happens when `key_type` is move constructible or " "when the `k` argument is a `key_type`." #: :821 #, read-only, safe-html, strict-same msgctxt ":821" msgid "---" msgstr "---" #: :823 #, read-only, safe-html, strict-same msgid "Copy Insert" msgstr "Copy Insert" #: :824 #, read-only, safe-html, strict-same msgid "" "```c++ std::pair insert(const value_type& obj); " "std::pair insert(const init_type& obj); ```" msgstr "" "```c++ std::pair insert(const value_type& obj); " "std::pair insert(const init_type& obj); ```" #: :829 #, read-only, safe-html, strict-same msgctxt ":829" msgid "" "Inserts `obj` in the container if and only if there is no element in the " "container with an equivalent key." msgstr "" "Inserts `obj` in the container if and only if there is no element in the " "container with an equivalent key." #: :832 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]. Returns:;; The `bool` component of the " "return type is `true` if an insert took place. + + If an insert took place, " "then the iterator points to the newly inserted element. Otherwise, it points " "to the element with equivalent key. Throws:;; If an exception is thrown by " "an operation other than a call to `hasher` the function has no effect. " "Notes:;; Can invalidate iterators, but only if the insert causes the load to " "be greater than the maximum load. + + 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 "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]. Returns:;; The `bool` component of the " "return type is `true` if an insert took place. + + If an insert took place, " "then the iterator points to the newly inserted element. Otherwise, it points " "to the element with equivalent key. Throws:;; If an exception is thrown by " "an operation other than a call to `hasher` the function has no effect. " "Notes:;; Can invalidate iterators, but only if the insert causes the load to " "be greater than the maximum load. + + 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." #: :841 #, read-only, safe-html, strict-same msgctxt ":841" msgid "---" msgstr "---" #: :843 #, read-only, safe-html, strict-same msgid "Move Insert" msgstr "Move Insert" #: :844 #, read-only, safe-html, strict-same msgid "" "```c++ std::pair insert(value_type&& obj); " "std::pair insert(init_type&& obj); ```" msgstr "" "```c++ std::pair insert(value_type&& obj); " "std::pair insert(init_type&& obj); ```" #: :849 #, read-only, safe-html, strict-same msgctxt ":849" msgid "" "Inserts `obj` in the container if and only if there is no element in the " "container with an equivalent key." msgstr "" "Inserts `obj` in the container if and only if there is no element in the " "container with an equivalent key." #: :852 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]. Returns:;; The `bool` component of the " "return type is `true` if an insert took place. + + If an insert took place, " "then the iterator points to the newly inserted element. Otherwise, it points " "to the element with equivalent key. Throws:;; If an exception is thrown by " "an operation other than a call to `hasher` the function has no effect. " "Notes:;; Can invalidate iterators, but only if the insert causes the load to " "be greater than the maximum load. + + 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 "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]. Returns:;; The `bool` component of the " "return type is `true` if an insert took place. + + If an insert took place, " "then the iterator points to the newly inserted element. Otherwise, it points " "to the element with equivalent key. Throws:;; If an exception is thrown by " "an operation other than a call to `hasher` the function has no effect. " "Notes:;; Can invalidate iterators, but only if the insert causes the load to " "be greater than the maximum load. + + 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." #: :861 #, read-only, safe-html, strict-same msgctxt ":861" msgid "---" msgstr "---" #: :863 #, read-only, safe-html, strict-same msgid "Copy Insert with Hint" msgstr "Copy Insert with Hint" #: :864 #, read-only, safe-html, strict-same msgid "" "```c++ iterator insert(const_iterator hint, const value_type& obj); iterator " "insert(const_iterator hint, const init_type& obj); ``` Inserts `obj` in the " "container if and only if there is no element in the container with an " "equivalent key." msgstr "" "```c++ iterator insert(const_iterator hint, const value_type& obj); iterator " "insert(const_iterator hint, const init_type& obj); ``` Inserts `obj` in the " "container if and only if there is no element in the container with an " "equivalent key." #: :870 #, read-only, safe-html, strict-same msgctxt ":870" msgid "" "`hint` is a suggestion to where the element should be inserted. This " "implementation ignores it." msgstr "" "`hint` is a suggestion to where the element should be inserted. This " "implementation ignores it." #: :873 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]. Returns:;; The `bool` component of the " "return type is `true` if an insert took place. + + If an insert took place, " "then the iterator points to the newly inserted element. Otherwise, it points " "to the element with equivalent key. Throws:;; If an exception is thrown by " "an operation other than a call to `hasher` the function has no effect. " "Notes:;; Can invalidate iterators, but only if the insert causes the load to " "be greater than the maximum load. + + A call of the form `insert(hint, 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 "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]. Returns:;; The `bool` component of the " "return type is `true` if an insert took place. + + If an insert took place, " "then the iterator points to the newly inserted element. Otherwise, it points " "to the element with equivalent key. Throws:;; If an exception is thrown by " "an operation other than a call to `hasher` the function has no effect. " "Notes:;; Can invalidate iterators, but only if the insert causes the load to " "be greater than the maximum load. + + A call of the form `insert(hint, x)`, " "where `x` is equally convertible to both `const value_type&` and `const " "init_type&`, is not ambiguous and selects the `init_type` overload." #: :882 #, read-only, safe-html, strict-same msgctxt ":882" msgid "---" msgstr "---" #: :884 #, read-only, safe-html, strict-same msgid "Move Insert with Hint" msgstr "Move Insert with Hint" #: :885 #, read-only, safe-html, strict-same msgid "" "```c++ iterator insert(const_iterator hint, value_type&& obj); iterator " "insert(const_iterator hint, init_type&& obj); ```" msgstr "" "```c++ iterator insert(const_iterator hint, value_type&& obj); iterator " "insert(const_iterator hint, init_type&& obj); ```" #: :890 #, read-only, safe-html, strict-same msgctxt ":890" msgid "" "Inserts `obj` in the container if and only if there is no element in the " "container with an equivalent key." msgstr "" "Inserts `obj` in the container if and only if there is no element in the " "container with an equivalent key." #: :892 #, read-only, safe-html, strict-same msgctxt ":892" msgid "" "`hint` is a suggestion to where the element should be inserted. This " "implementation ignores it." msgstr "" "`hint` is a suggestion to where the element should be inserted. This " "implementation ignores it." #: :895 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]. Returns:;; The `bool` component of the " "return type is `true` if an insert took place. + + If an insert took place, " "then the iterator points to the newly inserted element. Otherwise, it points " "to the element with equivalent key. Throws:;; If an exception is thrown by " "an operation other than a call to `hasher` the function has no effect. " "Notes:;; Can invalidate iterators, but only if the insert causes the load to " "be greater than the maximum load. + + A call of the form `insert(hint, x)`, " "where `x` is equally convertible to both `value_type&&` and `init_type&&`, " "is not ambiguous and selects the `init_type` overload." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]. Returns:;; The `bool` component of the " "return type is `true` if an insert took place. + + If an insert took place, " "then the iterator points to the newly inserted element. Otherwise, it points " "to the element with equivalent key. Throws:;; If an exception is thrown by " "an operation other than a call to `hasher` the function has no effect. " "Notes:;; Can invalidate iterators, but only if the insert causes the load to " "be greater than the maximum load. + + A call of the form `insert(hint, x)`, " "where `x` is equally convertible to both `value_type&&` and `init_type&&`, " "is not ambiguous and selects the `init_type` overload." #: :904 #, read-only, safe-html, strict-same msgctxt ":904" msgid "---" msgstr "---" #: :906 #, read-only, safe-html, strict-same msgid "Insert Iterator Range" msgstr "Insert Iterator Range" #: :907 #, read-only, safe-html, strict-same msgid "" "```c++ template void insert(InputIterator first, " "InputIterator last); ```" msgstr "" "```c++ template void insert(InputIterator first, " "InputIterator last); ```" #: :911 #, read-only, safe-html, strict-same msgctxt ":911" msgid "" "Inserts a range of elements into the container. Elements are inserted if and " "only if there is no element in the container with an equivalent key." msgstr "" "Inserts a range of elements into the container. Elements are inserted if and " "only if there is no element in the container with an equivalent key." #: :914 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "EmplaceConstructible[EmplaceConstructible^] into the container from " "`*first`. Throws:;; When inserting a single element, if an exception is " "thrown by an operation other than a call to `hasher` the function has no " "effect. Notes:;; Can invalidate iterators, but only if the insert causes the " "load to be greater than the maximum load." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "EmplaceConstructible[EmplaceConstructible^] into the container from " "`*first`. Throws:;; When inserting a single element, if an exception is " "thrown by an operation other than a call to `hasher` the function has no " "effect. Notes:;; Can invalidate iterators, but only if the insert causes the " "load to be greater than the maximum load." #: :918 #, read-only, safe-html, strict-same msgctxt ":918" msgid "---" msgstr "---" #: :920 #, read-only, safe-html, strict-same msgid "Insert Initializer List" msgstr "Insert Initializer List" #: :921 #, read-only, safe-html, strict-same msgid "```c++ void insert(std::initializer_list); ```" msgstr "```c++ void insert(std::initializer_list); ```" #: :925 #, read-only, safe-html, strict-same msgctxt ":925" msgid "" "Inserts a range of elements into the container. Elements are inserted if and " "only if there is no element in the container with an equivalent key." msgstr "" "Inserts a range of elements into the container. Elements are inserted if and " "only if there is no element in the container with an equivalent key." #: :928 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^] into the container. Throws:;; When inserting " "a single element, if an exception is thrown by an operation other than a " "call to `hasher` the function has no effect. Notes:;; Can invalidate " "iterators, but only if the insert causes the load to be greater than the " "maximum load." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^] into the container. Throws:;; When inserting " "a single element, if an exception is thrown by an operation other than a " "call to `hasher` the function has no effect. Notes:;; Can invalidate " "iterators, but only if the insert causes the load to be greater than the " "maximum load." #: :932 #, read-only, safe-html, strict-same msgctxt ":932" msgid "---" msgstr "---" #: :934 #, read-only, safe-html, strict-same msgid "Insert Node" msgstr "Insert Node" #: :935 #, read-only, safe-html, strict-same msgid "```c++ insert_return_type insert(node_type&& nh); ```" msgstr "```c++ insert_return_type insert(node_type&& nh); ```" #: :939 #, read-only, safe-html, strict-same msgid "" "If `nh` is not empty, inserts the associated element in the container if and " "only if there is no element in the container with a key equivalent to `nh.key" "()`. `nh` is empty when the function returns." msgstr "" "If `nh` is not empty, inserts the associated element in the container if and " "only if there is no element in the container with a key equivalent to `nh.key" "()`. `nh` is empty when the function returns." #: :943 #, read-only, safe-html, strict-same msgid "" "Returns:;; An `insert_return_type` object constructed from `position`, " "`inserted` and `node`: +" msgstr "" "Returns:;; An `insert_return_type` object constructed from `position`, " "`inserted` and `node`: +" #: :944 #, read-only, safe-html, strict-same msgid "" "If `nh` is empty, `inserted` is `false`, `position` is `end()`, and `node` " "is empty." msgstr "" "If `nh` is empty, `inserted` is `false`, `position` is `end()`, and `node` " "is empty." #: :945 #, read-only, safe-html, strict-same msgid "" "Otherwise if the insertion took place, `inserted` is true, `position` points " "to the inserted element, and `node` is empty." msgstr "" "Otherwise if the insertion took place, `inserted` is true, `position` points " "to the inserted element, and `node` is empty." #: :946 #, read-only, safe-html, strict-same msgid "" "If the insertion failed, `inserted` is false, `node` has the previous value " "of `nh`, and `position` points to an element with a key equivalent to `nh.key" "()`." msgstr "" "If the insertion failed, `inserted` is false, `node` has the previous value " "of `nh`, and `position` points to an element with a key equivalent to `nh.key" "()`." #: :947 #, read-only, 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. Notes:;; Behavior is undefined if `nh` " "is not empty and the allocators of `nh` and the container are not equal." msgstr "" "Throws:;; If an exception is thrown by an operation other than a call to " "`hasher` the function has no effect. Notes:;; Behavior is undefined if `nh` " "is not empty and the allocators of `nh` and the container are not equal." #: :950 #, read-only, safe-html, strict-same msgctxt ":950" msgid "---" msgstr "---" #: :952 #, read-only, safe-html, strict-same msgid "Insert Node with Hint" msgstr "Insert Node with Hint" #: :953 #, read-only, safe-html, strict-same msgid "```c++ iterator insert(const_iterator hint, node_type&& nh); ```" msgstr "```c++ iterator insert(const_iterator hint, node_type&& nh); ```" #: :957 #, read-only, safe-html, strict-same msgid "" "If `nh` is not empty, inserts the associated element in the container if and " "only if there is no element in the container with a key equivalent to `nh.key" "()`. `nh` becomes empty if insertion took place, otherwise it is not changed." msgstr "" "If `nh` is not empty, inserts the associated element in the container if and " "only if there is no element in the container with a key equivalent to `nh.key" "()`. `nh` becomes empty if insertion took place, otherwise it is not changed." #: :960 #, read-only, safe-html, strict-same msgctxt ":960" msgid "" "`hint` is a suggestion to where the element should be inserted. This " "implementation ignores it." msgstr "" "`hint` is a suggestion to where the element should be inserted. This " "implementation ignores it." #: :963 #, read-only, safe-html, strict-same msgid "" "Returns:;; The iterator returned is `end()` if `nh` is empty. If insertion " "took place, then the iterator points to the newly inserted element; " "otherwise, it points to the element with equivalent key. Throws:;; If an " "exception is thrown by an operation other than a call to `hasher` the " "function has no effect. Notes:;; Behavior is undefined if `nh` is not empty " "and the allocators of `nh` and the container are not equal." msgstr "" "Returns:;; The iterator returned is `end()` if `nh` is empty. If insertion " "took place, then the iterator points to the newly inserted element; " "otherwise, it points to the element with equivalent key. Throws:;; If an " "exception is thrown by an operation other than a call to `hasher` the " "function has no effect. Notes:;; Behavior is undefined if `nh` is not empty " "and the allocators of `nh` and the container are not equal." #: :968 #, read-only, safe-html, strict-same msgctxt ":968" msgid "---" msgstr "---" #: :970 #, read-only, safe-html, strict-same msgid "try_emplace" msgstr "try_emplace" #: :971 #, read-only, safe-html, strict-same msgid "" "```c++ template std::pair try_emplace(const " "key_type& k, Args&&... args); template std::pair try_emplace(key_type&& k, Args&&... args); template std::pair try_emplace(K&& k, Args&&... args); ```" msgstr "" "```c++ template std::pair try_emplace(const " "key_type& k, Args&&... args); template std::pair try_emplace(key_type&& k, Args&&... args); template std::pair try_emplace(K&& k, Args&&... args); ```" #: :980 #, read-only, safe-html, strict-same msgctxt ":980" msgid "" "Inserts a new element into the container if there is no existing element " "with key `k` contained within it." msgstr "" "Inserts a new element into the container if there is no existing element " "with key `k` contained within it." #: :982 #, read-only, safe-html, strict-same msgctxt ":982" msgid "" "If there is an existing element with key `k` this function does nothing." msgstr "" "If there is an existing element with key `k` this function does nothing." #: :985 #, read-only, safe-html, strict-same msgid "" "Returns:;; The `bool` component of the return type is `true` if an insert " "took place. + + If an insert took place, then the iterator points to the " "newly inserted element. Otherwise, it points to the element with equivalent " "key. Throws:;; If an exception is thrown by an operation other than a call " "to `hasher` the function has no effect. Notes:;; This function is similiar " "to xref:#unordered_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 "" "Returns:;; The `bool` component of the return type is `true` if an insert " "took place. + + If an insert took place, then the iterator points to the " "newly inserted element. Otherwise, it points to the element with equivalent " "key. Throws:;; If an exception is thrown by an operation other than a call " "to `hasher` the function has no effect. Notes:;; This function is similiar " "to xref:#unordered_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++" #: :995 #, read-only, safe-html, strict-same msgctxt ":995" 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)...))" #: :1000 #, read-only, safe-html, strict-same msgctxt ":1000" 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)...)) ```" #: :1005 #, read-only, safe-html, strict-same msgid "" "unlike xref:#unordered_node_map_emplace[emplace], which simply forwards all " "arguments to ``value_type``'s constructor." msgstr "" "unlike xref:#unordered_node_map_emplace[emplace], which simply forwards all " "arguments to ``value_type``'s constructor." #: :1007 #, read-only, safe-html, strict-same msgctxt ":1007" msgid "" "Can invalidate iterators, but only if the insert causes the load to be " "greater than the maximum load." msgstr "" "Can invalidate iterators, but only if the insert causes the load to be " "greater than the maximum load." #: :1009 #, read-only, safe-html, strict-same msgctxt ":1009" msgid "" "The `template` overload only participates in " "overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are " "valid member typedefs and neither `iterator` nor `const_iterator` are " "implicitly convertible from `K`. 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 "" "The `template` overload only participates in " "overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are " "valid member typedefs and neither `iterator` nor `const_iterator` are " "implicitly convertible from `K`. 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." #: :1011 #, read-only, safe-html, strict-same msgctxt ":1011" msgid "--" msgstr "--" #: :1013 #, read-only, safe-html, strict-same msgctxt ":1013" msgid "---" msgstr "---" #: :1015 #, read-only, safe-html, strict-same msgid "try_emplace with Hint" msgstr "try_emplace with Hint" #: :1016 #, read-only, safe-html, strict-same msgid "" "```c++ template iterator try_emplace(const_iterator hint, " "const key_type& k, Args&&... args); template iterator " "try_emplace(const_iterator hint, key_type&& k, Args&&... args); " "template iterator try_emplace(const_iterator hint, " "K&& k, Args&&... args); ```" msgstr "" "```c++ template iterator try_emplace(const_iterator hint, " "const key_type& k, Args&&... args); template iterator " "try_emplace(const_iterator hint, key_type&& k, Args&&... args); " "template iterator try_emplace(const_iterator hint, " "K&& k, Args&&... args); ```" #: :1025 #, read-only, safe-html, strict-same msgctxt ":1025" msgid "" "Inserts a new element into the container if there is no existing element " "with key `k` contained within it." msgstr "" "Inserts a new element into the container if there is no existing element " "with key `k` contained within it." #: :1027 #, read-only, safe-html, strict-same msgctxt ":1027" msgid "" "If there is an existing element with key `k` this function does nothing." msgstr "" "If there is an existing element with key `k` this function does nothing." #: :1029 #, read-only, safe-html, strict-same msgid "" "`hint` is a suggestion to where the element should be inserted. This " "implementation ignores it." msgstr "" "`hint` is a suggestion to where the element should be inserted. This " "implementation ignores it." #: :1032 #, read-only, safe-html, strict-same msgid "" "Returns:;; If an insert took place, then the iterator points to the newly " "inserted element. Otherwise, it points to the element with equivalent key. " "Throws:;; If an exception is thrown by an operation other than a call to " "`hasher` the function has no effect. Notes:;; This function is similiar to " "xref:#unordered_node_map_emplace_hint[emplace_hint], 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 "" "Returns:;; If an insert took place, then the iterator points to the newly " "inserted element. Otherwise, it points to the element with equivalent key. " "Throws:;; If an exception is thrown by an operation other than a call to " "`hasher` the function has no effect. Notes:;; This function is similiar to " "xref:#unordered_node_map_emplace_hint[emplace_hint], 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++" #: :1040 #, read-only, safe-html, strict-same msgctxt ":1040" 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)...))" #: :1045 #, read-only, safe-html, strict-same msgctxt ":1045" 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)...)) ```" #: :1050 #, read-only, safe-html, strict-same msgid "" "unlike xref:#unordered_node_map_emplace_hint[emplace_hint], which simply " "forwards all arguments to ``value_type``'s constructor." msgstr "" "unlike xref:#unordered_node_map_emplace_hint[emplace_hint], which simply " "forwards all arguments to ``value_type``'s constructor." #: :1052 #, read-only, safe-html, strict-same msgctxt ":1052" msgid "" "Can invalidate iterators, but only if the insert causes the load to be " "greater than the maximum load." msgstr "" "Can invalidate iterators, but only if the insert causes the load to be " "greater than the maximum load." #: :1054 #, read-only, safe-html, strict-same msgctxt ":1054" msgid "" "The `template` overload only participates in " "overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are " "valid member typedefs and neither `iterator` nor `const_iterator` are " "implicitly convertible from `K`. 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 "" "The `template` overload only participates in " "overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are " "valid member typedefs and neither `iterator` nor `const_iterator` are " "implicitly convertible from `K`. 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." #: :1056 #, read-only, safe-html, strict-same msgctxt ":1056" msgid "--" msgstr "--" #: :1058 #, read-only, safe-html, strict-same msgctxt ":1058" msgid "---" msgstr "---" #: :1060 #, read-only, safe-html, strict-same msgid "insert_or_assign" msgstr "insert_or_assign" #: :1061 #, read-only, safe-html, strict-same msgid "" "```c++ template std::pair insert_or_assign(const " "key_type& k, M&& obj); template std::pair " "insert_or_assign(key_type&& k, M&& obj); template " "std::pair insert_or_assign(K&& k, M&& obj); ```" msgstr "" "```c++ template std::pair insert_or_assign(const " "key_type& k, M&& obj); template std::pair " "insert_or_assign(key_type&& k, M&& obj); template " "std::pair insert_or_assign(K&& k, M&& obj); ```" #: :1070 #, read-only, safe-html, strict-same msgctxt ":1070" msgid "" "Inserts a new element into the container or updates an existing one by " "assigning to the contained value." msgstr "" "Inserts a new element into the container or updates an existing one by " "assigning to the contained value." #: :1072 #, read-only, safe-html, strict-same msgctxt ":1072" msgid "" "If there is an element with key `k`, then it is updated by assigning " "`std::forward(obj)`." msgstr "" "If there is an element with key `k`, then it is updated by assigning " "`std::forward(obj)`." #: :1074 #, read-only, safe-html, strict-same msgctxt ":1074" msgid "If there is no such element, it is added to the container as: ```c++" msgstr "If there is no such element, it is added to the container as: ```c++" #: :1077 #, read-only, safe-html, strict-same msgctxt ":1077" 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)))" #: :1082 #, read-only, safe-html, strict-same msgctxt ":1082" 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))) ```" #: :1088 #, read-only, safe-html, strict-same msgid "" "Returns:;; The `bool` component of the return type is `true` if an insert " "took place. + + If an insert took place, then the iterator points to the " "newly inserted element. Otherwise, it points to the element with equivalent " "key. Throws:;; If an exception is thrown by an operation other than a call " "to `hasher` the function has no effect. Notes:;; Can invalidate iterators, " "but only if the insert causes the load to be greater than the maximum load. " "+ + 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 "" "Returns:;; The `bool` component of the return type is `true` if an insert " "took place. + + If an insert took place, then the iterator points to the " "newly inserted element. Otherwise, it points to the element with equivalent " "key. Throws:;; If an exception is thrown by an operation other than a call " "to `hasher` the function has no effect. Notes:;; Can invalidate iterators, " "but only if the insert causes the load to be greater than the maximum load. " "+ + 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." #: :1096 #, read-only, safe-html, strict-same msgctxt ":1096" msgid "---" msgstr "---" #: :1098 #, read-only, safe-html, strict-same msgid "insert_or_assign with Hint" msgstr "insert_or_assign with Hint" #: :1099 #, read-only, safe-html, strict-same msgid "" "```c++ template iterator insert_or_assign(const_iterator hint, " "const key_type& k, M&& obj); template iterator insert_or_assign" "(const_iterator hint, key_type&& k, M&& obj); template " "iterator insert_or_assign(const_iterator hint, K&& k, M&& obj); ```" msgstr "" "```c++ template iterator insert_or_assign(const_iterator hint, " "const key_type& k, M&& obj); template iterator insert_or_assign" "(const_iterator hint, key_type&& k, M&& obj); template " "iterator insert_or_assign(const_iterator hint, K&& k, M&& obj); ```" #: :1108 #, read-only, safe-html, strict-same msgctxt ":1108" msgid "" "Inserts a new element into the container or updates an existing one by " "assigning to the contained value." msgstr "" "Inserts a new element into the container or updates an existing one by " "assigning to the contained value." #: :1110 #, read-only, safe-html, strict-same msgctxt ":1110" msgid "" "If there is an element with key `k`, then it is updated by assigning " "`std::forward(obj)`." msgstr "" "If there is an element with key `k`, then it is updated by assigning " "`std::forward(obj)`." #: :1112 #, read-only, safe-html, strict-same msgctxt ":1112" msgid "If there is no such element, it is added to the container as: ```c++" msgstr "If there is no such element, it is added to the container as: ```c++" #: :1115 #, read-only, safe-html, strict-same msgctxt ":1115" 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)))" #: :1120 #, read-only, safe-html, strict-same msgctxt ":1120" 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))) ```" #: :1125 #, read-only, safe-html, strict-same msgctxt ":1125" msgid "" "`hint` is a suggestion to where the element should be inserted. This " "implementation ignores it." msgstr "" "`hint` is a suggestion to where the element should be inserted. This " "implementation ignores it." #: :1128 #, read-only, safe-html, strict-same msgid "" "Returns:;; If an insert took place, then the iterator points to the newly " "inserted element. Otherwise, it points to the element with equivalent key. " "Throws:;; If an exception is thrown by an operation other than a call to " "`hasher` the function has no effect. Notes:;; Can invalidate iterators, but " "only if the insert causes the load to be greater than the maximum load. + + " "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 "" "Returns:;; If an insert took place, then the iterator points to the newly " "inserted element. Otherwise, it points to the element with equivalent key. " "Throws:;; If an exception is thrown by an operation other than a call to " "`hasher` the function has no effect. Notes:;; Can invalidate iterators, but " "only if the insert causes the load to be greater than the maximum load. + + " "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." #: :1134 #, read-only, safe-html, strict-same msgctxt ":1134" msgid "---" msgstr "---" #: :1137 #, read-only, safe-html, strict-same msgid "Erase by Position" msgstr "Erase by Position" #: :1145 #, read-only, safe-html, strict-same msgid "Erase the element pointed to by `position`." msgstr "Erase the element pointed to by `position`." #: :1148 #, read-only, safe-html, strict-same msgid "" "Returns:;; An opaque object implicitly convertible to the `iterator` or " "`const_iterator` immediately following `position` prior to the erasure. " "Throws:;; Nothing. Notes:;; The opaque object returned must only be " "discarded or immediately converted to `iterator` or `const_iterator`." msgstr "" "Returns:;; An opaque object implicitly convertible to the `iterator` or " "`const_iterator` immediately following `position` prior to the erasure. " "Throws:;; Nothing. Notes:;; The opaque object returned must only be " "discarded or immediately converted to `iterator` or `const_iterator`." #: :1153 #, read-only, safe-html, strict-same msgctxt ":1153" msgid "---" msgstr "---" #: :1155 #, read-only, safe-html, strict-same msgid "Erase by Key" msgstr "Erase by Key" #: :1156 #, read-only, safe-html, strict-same msgid "" "```c++ size_type erase(const key_type& k); template size_type erase" "(K&& k); ```" msgstr "" "```c++ size_type erase(const key_type& k); template size_type erase" "(K&& k); ```" #: :1161 #, read-only, safe-html, strict-same msgid "Erase all elements with key equivalent to `k`." msgstr "Erase all elements with key equivalent to `k`." #: :1164 #, read-only, safe-html, strict-same msgid "" "Returns:;; The number of elements erased. 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 and neither `iterator` " "nor `const_iterator` are implicitly convertible from `K`. 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 "" "Returns:;; The number of elements erased. 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 and neither `iterator` " "nor `const_iterator` are implicitly convertible from `K`. 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." #: :1168 #, read-only, safe-html, strict-same msgctxt ":1168" msgid "---" msgstr "---" #: :1170 #, read-only, safe-html, strict-same msgid "Erase Range" msgstr "Erase Range" #: :1172 #, read-only, safe-html, strict-same msgid "```c++ iterator erase(const_iterator first, const_iterator last); ```" msgstr "```c++ iterator erase(const_iterator first, const_iterator last); ```" #: :1176 #, read-only, safe-html, strict-same msgid "Erases the elements in the range from `first` to `last`." msgstr "Erases the elements in the range from `first` to `last`." #: :1179 #, read-only, safe-html, strict-same msgid "" "Returns:;; The iterator following the erased elements - i.e. `last`. " "Throws:;; Nothing in this implementation (neither the `hasher` nor the " "`key_equal` objects are called)." msgstr "" "Returns:;; The iterator following the erased elements - i.e. `last`. " "Throws:;; Nothing in this implementation (neither the `hasher` nor the " "`key_equal` objects are called)." #: :1182 #, read-only, safe-html, strict-same msgctxt ":1182" msgid "---" msgstr "---" #: :1184 #, read-only, safe-html, strict-same msgid "swap" msgstr "swap" #: :1185 #, read-only, safe-html, strict-same msgid "" "```c++ void swap(unordered_node_map& other) noexcept" "(boost::allocator_traits::is_always_equal::value || " "boost::allocator_traits::propagate_on_container_swap::value); ```" msgstr "" "```c++ void swap(unordered_node_map& other) noexcept" "(boost::allocator_traits::is_always_equal::value || " "boost::allocator_traits::propagate_on_container_swap::value); ```" #: :1191 #, read-only, safe-html, strict-same msgid "Swaps the contents of the container with the parameter." msgstr "Swaps the contents of the container with the parameter." #: :1193 #, read-only, safe-html, strict-same msgctxt ":1193" msgid "" "If `Allocator::propagate_on_container_swap` is declared and " "`Allocator::propagate_on_container_swap::value` is `true` then the " "containers' allocators are swapped. Otherwise, swapping with unequal " "allocators results in undefined behavior." msgstr "" "If `Allocator::propagate_on_container_swap` is declared and " "`Allocator::propagate_on_container_swap::value` is `true` then the " "containers' allocators are swapped. Otherwise, swapping with unequal " "allocators results in undefined behavior." #: :1196 #, read-only, safe-html, strict-same msgid "Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping." msgstr "Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping." #: :1198 #, read-only, safe-html, strict-same msgctxt ":1198" msgid "---" msgstr "---" #: :1200 #, read-only, safe-html, strict-same msgid "Extract by Position" msgstr "Extract by Position" #: :1201 #, read-only, safe-html, strict-same msgid "```c++ node_type extract(const_iterator position); ```" msgstr "```c++ node_type extract(const_iterator position); ```" #: :1205 #, read-only, safe-html, strict-same msgid "Extracts the element pointed to by `position`." msgstr "Extracts the element pointed to by `position`." #: :1208 #, read-only, safe-html, strict-same msgid "" "Returns:;; A `node_type` object holding the extracted element. Throws:;; " "Nothing." msgstr "" "Returns:;; A `node_type` object holding the extracted element. Throws:;; " "Nothing." #: :1211 #, read-only, safe-html, strict-same msgctxt ":1211" msgid "---" msgstr "---" #: :1213 #, read-only, safe-html, strict-same msgid "Extract by Key" msgstr "Extract by Key" #: :1214 #, read-only, 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); ```" #: :1219 #, read-only, safe-html, strict-same msgid "Extracts the element with key equivalent to `k`, if it exists." msgstr "Extracts the element with key equivalent to `k`, if it exists." #: :1222 #, read-only, 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 "" "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." #: :1226 #, read-only, safe-html, strict-same msgctxt ":1226" msgid "---" msgstr "---" #: :1228 #, read-only, safe-html, strict-same msgid "pull" msgstr "pull" #: :1229 #, read-only, safe-html, strict-same msgid "```c++ init_type pull(const_iterator position); ```" msgstr "```c++ init_type pull(const_iterator position); ```" #: :1233 #, read-only, safe-html, strict-same msgid "" "Move-constructs an `init_value` `x` from the element pointed to by " "`position`, erases the element and returns `x`." msgstr "" "Move-constructs an `init_value` `x` from the element pointed to by " "`position`, erases the element and returns `x`." #: :1236 #, read-only, safe-html, strict-same msgctxt ":1236" msgid "---" msgstr "---" #: :1238 #, read-only, safe-html, strict-same msgid "clear" msgstr "clear" #: :1239 #, read-only, safe-html, strict-same msgid "```c++ void clear() noexcept; ```" msgstr "```c++ void clear() noexcept; ```" #: :1243 #, read-only, safe-html, strict-same msgid "Erases all elements in the container." msgstr "Erases all elements in the container." #: :1246 #, read-only, safe-html, strict-same msgid "" "Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * " "bucket_count()`" msgstr "" "Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * " "bucket_count()`" #: :1248 #, read-only, safe-html, strict-same msgctxt ":1248" msgid "---" msgstr "---" #: :1250 #, read-only, safe-html, strict-same msgid "merge" msgstr "merge" #: :1251 #, read-only, safe-html, strict-same msgid "" "```c++ template void merge(unordered_node_map& source); template void merge" "(unordered_node_map&& source); ```" msgstr "" "```c++ template void merge(unordered_node_map& source); template void merge" "(unordered_node_map&& source); ```" #: :1258 #, read-only, safe-html, strict-same msgid "" "Transfers all the element nodes from `source` whose key is not already " "present in `*this`." msgstr "" "Transfers all the element nodes from `source` whose key is not already " "present in `*this`." #: :1261 #, read-only, safe-html, strict-same msgid "" "Requires:;; `this\\->get_allocator() == source.get_allocator()`. Notes:;; " "Invalidates iterators to the elements transferred. If the resulting size of " "`*this` is greater than its original maximum load, invalidates all iterators " "associated to `*this`." msgstr "" "Requires:;; `this\\->get_allocator() == source.get_allocator()`. Notes:;; " "Invalidates iterators to the elements transferred. If the resulting size of " "`*this` is greater than its original maximum load, invalidates all iterators " "associated to `*this`." #: :1266 #, read-only, safe-html, strict-same msgctxt ":1266" msgid "---" msgstr "---" #: :1268 #, read-only, safe-html, strict-same msgid "Observers" msgstr "Observers" #: :1270 #, read-only, safe-html, strict-same msgid "get_allocator" msgstr "get_allocator" #: :1271 #, read-only, safe-html, strict-same msgid "``` allocator_type get_allocator() const noexcept; ```" msgstr "``` allocator_type get_allocator() const noexcept; ```" #: :1276 #, read-only, safe-html, strict-same msgid "Returns:;; The container's allocator." msgstr "Returns:;; The container's allocator." #: :1278 #, read-only, safe-html, strict-same msgctxt ":1278" msgid "---" msgstr "---" #: :1280 #, read-only, safe-html, strict-same msgid "hash_function" msgstr "hash_function" #: :1281 #, read-only, safe-html, strict-same msgid "``` hasher hash_function() const; ```" msgstr "``` hasher hash_function() const; ```" #: :1286 #, read-only, safe-html, strict-same msgid "Returns:;; The container's hash function." msgstr "Returns:;; The container's hash function." #: :1288 #, read-only, safe-html, strict-same msgctxt ":1288" msgid "---" msgstr "---" #: :1290 #, read-only, safe-html, strict-same msgid "key_eq" msgstr "key_eq" #: :1291 #, read-only, safe-html, strict-same msgid "``` key_equal key_eq() const; ```" msgstr "``` key_equal key_eq() const; ```" #: :1296 #, read-only, safe-html, strict-same msgid "Returns:;; The container's key equality predicate" msgstr "Returns:;; The container's key equality predicate" #: :1298 #, read-only, safe-html, strict-same msgctxt ":1298" msgid "---" msgstr "---" #: :1300 #, read-only, safe-html, strict-same msgid "Lookup" msgstr "Lookup" #: :1302 #, read-only, safe-html, strict-same msgid "find" msgstr "find" #: :1303 #, read-only, safe-html, strict-same msgid "" "```c++ iterator find(const key_type& k); const_iterator find(const " "key_type& k) const; template iterator find(const K& k);" msgstr "" "```c++ iterator find(const key_type& k); const_iterator find(const " "key_type& k) const; template iterator find(const K& k);" #: :1309 #, read-only, safe-html, strict-same msgid "```" msgstr "```" #: :1312 #, read-only, safe-html, strict-same msgid "" "Returns:;; An iterator pointing to an element with key equivalent to `k`, or " "`end()` if no such element exists. 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 "" "Returns:;; An iterator pointing to an element with key equivalent to `k`, or " "`end()` if no such element exists. 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." #: :1315 #, read-only, safe-html, strict-same msgctxt ":1315" msgid "---" msgstr "---" #: :1317 #, read-only, safe-html, strict-same msgid "count" msgstr "count" #: :1318 #, read-only, 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; ```" #: :1325 #, read-only, safe-html, strict-same msgid "" "Returns:;; The number of elements with key equivalent to `k`. 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 "" "Returns:;; The number of elements with key equivalent to `k`. 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." #: :1328 #, read-only, safe-html, strict-same msgctxt ":1328" msgid "---" msgstr "---" #: :1330 #, read-only, safe-html, strict-same msgid "contains" msgstr "contains" #: :1331 #, read-only, 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; ```" #: :1338 #, read-only, safe-html, strict-same msgid "" "Returns:;; A boolean indicating whether or not there is an element with key " "equal to `key` in the container 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 "" "Returns:;; A boolean indicating whether or not there is an element with key " "equal to `key` in the container 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." #: :1341 #, read-only, safe-html, strict-same msgctxt ":1341" msgid "---" msgstr "---" #: :1343 #, read-only, safe-html, strict-same msgid "equal_range" msgstr "equal_range" #: :1344 #, read-only, safe-html, strict-same msgid "" "```c++ std::pair equal_range(const " "key_type& k); std::pair equal_range(const " "key_type& k) const; template std::pair" " equal_range(const K& k); template " "std::pair equal_range(const K& k) const; ```" msgstr "" "```c++ std::pair equal_range(const " "key_type& k); std::pair equal_range(const " "key_type& k) const; template std::pair" " equal_range(const K& k); template " "std::pair equal_range(const K& k) const; ```" #: :1354 #, read-only, safe-html, strict-same msgid "" "Returns:;; A range containing all elements with key equivalent to `k`. If " "the container doesn't contain any such elements, returns `std::make_pair" "(b.end(), b.end())`. 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 "" "Returns:;; A range containing all elements with key equivalent to `k`. If " "the container doesn't contain any such elements, returns `std::make_pair" "(b.end(), b.end())`. 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." #: :1357 #, read-only, safe-html, strict-same msgctxt ":1357" msgid "---" msgstr "---" #: :1359 #, read-only, safe-html, strict-same msgid "operator++[++++]++" msgstr "operator++[++++]++" #: :1360 #, read-only, safe-html, strict-same msgid "" "```c++ mapped_type& operator[](const key_type& k); mapped_type& operator[]" "(key_type&& k); template mapped_type& operator[](K&& k); ```" msgstr "" "```c++ mapped_type& operator[](const key_type& k); mapped_type& operator[]" "(key_type&& k); template mapped_type& operator[](K&& k); ```" #: :1367 #, read-only, safe-html, strict-same msgid "" "Effects:;; If the container does not already contain an element with a key " "equivalent to `k`, inserts the value `std::pair" "(k, mapped_type())`. Returns:;; A reference to `x.second` where `x` is the " "element already in the container, or the newly inserted element with a key " "equivalent to `k`. Throws:;; If an exception is thrown by an operation other " "than a call to `hasher` the function has no effect. Notes:;; Can invalidate " "iterators, but only if the insert causes the load to be greater than the " "maximum load. + + 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 "" "Effects:;; If the container does not already contain an element with a key " "equivalent to `k`, inserts the value `std::pair" "(k, mapped_type())`. Returns:;; A reference to `x.second` where `x` is the " "element already in the container, or the newly inserted element with a key " "equivalent to `k`. Throws:;; If an exception is thrown by an operation other " "than a call to `hasher` the function has no effect. Notes:;; Can invalidate " "iterators, but only if the insert causes the load to be greater than the " "maximum load. + + 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." #: :1374 #, read-only, safe-html, strict-same msgctxt ":1374" msgid "---" msgstr "---" #: :1376 #, read-only, safe-html, strict-same msgid "at" msgstr "at" #: :1377 #, read-only, safe-html, strict-same msgid "" "```c++ mapped_type& at(const key_type& k); const mapped_type& at(const " "key_type& k) const; template mapped_type& at(const K& k); " "template const mapped_type& at(const K& k) const; ```" msgstr "" "```c++ mapped_type& at(const key_type& k); const mapped_type& at(const " "key_type& k) const; template mapped_type& at(const K& k); " "template const mapped_type& at(const K& k) const; ```" #: :1385 #, read-only, safe-html, strict-same msgid "" "Returns:;; A reference to `x.second` where `x` is the (unique) element whose " "key is equivalent to `k`. Throws:;; An exception object of type " "`std::out_of_range` if no such element is present. 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 "" "Returns:;; A reference to `x.second` where `x` is the (unique) element whose " "key is equivalent to `k`. Throws:;; An exception object of type " "`std::out_of_range` if no such element is present. 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." #: :1389 #, read-only, safe-html, strict-same msgctxt ":1389" msgid "---" msgstr "---" #: :1391 #, read-only, safe-html, strict-same msgid "Bucket Interface" msgstr "Bucket Interface" #: :1393 #, read-only, safe-html, strict-same msgid "bucket_count" msgstr "bucket_count" #: :1394 #, read-only, safe-html, strict-same msgid "```c++ size_type bucket_count() const noexcept; ```" msgstr "```c++ size_type bucket_count() const noexcept; ```" #: :1399 #, read-only, safe-html, strict-same msgid "Returns:;; The size of the bucket array." msgstr "Returns:;; The size of the bucket array." #: :1401 #, read-only, safe-html, strict-same msgctxt ":1401" msgid "---" msgstr "---" #: :1403 #, read-only, safe-html, strict-same msgid "Hash Policy" msgstr "Hash Policy" #: :1405 #, read-only, safe-html, strict-same msgid "load_factor" msgstr "load_factor" #: :1406 #, read-only, safe-html, strict-same msgid "```c++ float load_factor() const noexcept; ```" msgstr "```c++ float load_factor() const noexcept; ```" #: :1411 #, read-only, safe-html, strict-same msgid "" "Returns:;; `static_cast(size())/static_cast(bucket_count())`, " "or `0` if `bucket_count() == 0`." msgstr "" "Returns:;; `static_cast(size())/static_cast(bucket_count())`, " "or `0` if `bucket_count() == 0`." #: :1413 #, read-only, safe-html, strict-same msgctxt ":1413" msgid "---" msgstr "---" #: :1415 #, read-only, safe-html, strict-same msgid "max_load_factor" msgstr "max_load_factor" #: :1417 #, read-only, safe-html, strict-same msgid "```c++ float max_load_factor() const noexcept; ```" msgstr "```c++ float max_load_factor() const noexcept; ```" #: :1422 #, read-only, safe-html, strict-same msgid "Returns:;; Returns the container's maximum load factor." msgstr "Returns:;; Returns the container's maximum load factor." #: :1424 #, read-only, safe-html, strict-same msgctxt ":1424" msgid "---" msgstr "---" #: :1426 #, read-only, safe-html, strict-same msgid "Set max_load_factor" msgstr "Set max_load_factor" #: :1427 #, read-only, safe-html, strict-same msgid "```c++ void max_load_factor(float z); ```" msgstr "```c++ void max_load_factor(float z); ```" #: :1432 #, read-only, 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 "" "Effects:;; Does nothing, as the user is not allowed to change this " "parameter. Kept for compatibility with `boost::unordered_map`." #: :1434 #, read-only, safe-html, strict-same msgctxt ":1434" msgid "---" msgstr "---" #: :1437 #, read-only, safe-html, strict-same msgid "max_load" msgstr "max_load" #: :1439 #, read-only, safe-html, strict-same msgid "```c++ size_type max_load() const noexcept; ```" msgstr "```c++ size_type max_load() const noexcept; ```" #: :1444 #, read-only, safe-html, strict-same msgid "" "Returns:;; The maximum number of elements the container can hold without " "rehashing, assuming that no further elements will be erased. Note:;; After " "construction, rehash or clearance, the container's maximum load is at least " "`max_load_factor() * bucket_count()`. This number may decrease on erasure " "under high-load conditions." msgstr "" "Returns:;; The maximum number of elements the container can hold without " "rehashing, assuming that no further elements will be erased. Note:;; After " "construction, rehash or clearance, the container's maximum load is at least " "`max_load_factor() * bucket_count()`. This number may decrease on erasure " "under high-load conditions." #: :1448 #, read-only, safe-html, strict-same msgctxt ":1448" msgid "---" msgstr "---" #: :1450 #, read-only, safe-html, strict-same msgid "rehash" msgstr "rehash" #: :1451 #, read-only, safe-html, strict-same msgid "```c++ void rehash(size_type n); ```" msgstr "```c++ void rehash(size_type n); ```" #: :1455 #, read-only, 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 container." msgstr "" "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 container." #: :1457 #, read-only, safe-html, strict-same msgid "" "When `size() == 0`, `rehash(0)` will deallocate the underlying buckets " "array. If the provided Allocator uses fancy pointers, a default allocation " "is subsequently performed." msgstr "" "When `size() == 0`, `rehash(0)` will deallocate the underlying buckets " "array. If the provided Allocator uses fancy pointers, a default allocation " "is subsequently performed." #: :1459 #, read-only, safe-html, strict-same msgctxt ":1459" msgid "Invalidates iterators and changes the order of elements." msgstr "Invalidates iterators and changes the order of elements." #: :1462 #, read-only, safe-html, strict-same msgctxt ":1462" msgid "" "Throws:;; The function has no effect if an exception is thrown, unless it is " "thrown by the container's hash function or comparison function." msgstr "" "Throws:;; The function has no effect if an exception is thrown, unless it is " "thrown by the container's hash function or comparison function." #: :1464 #, read-only, safe-html, strict-same msgctxt ":1464" msgid "---" msgstr "---" #: :1466 #, read-only, safe-html, strict-same msgid "reserve" msgstr "reserve" #: :1467 #, read-only, safe-html, strict-same msgid "```c++ void reserve(size_type n); ```" msgstr "```c++ void reserve(size_type n); ```" #: :1471 #, read-only, safe-html, strict-same msgid "Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`." msgstr "Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`." #: :1473 #, read-only, safe-html, strict-same msgid "" "Similar to `rehash`, this function can be used to grow or shrink the number " "of buckets in the container." msgstr "" "Similar to `rehash`, this function can be used to grow or shrink the number " "of buckets in the container." #: :1475 #, read-only, safe-html, strict-same msgctxt ":1475" msgid "Invalidates iterators and changes the order of elements." msgstr "Invalidates iterators and changes the order of elements." #: :1478 #, read-only, safe-html, strict-same msgctxt ":1478" msgid "" "Throws:;; The function has no effect if an exception is thrown, unless it is " "thrown by the container's hash function or comparison function." msgstr "" "Throws:;; The function has no effect if an exception is thrown, unless it is " "thrown by the container's hash function or comparison function." #: :1480 #, read-only, safe-html, strict-same msgctxt ":1480" msgid "---" msgstr "---" #: :1482 #, read-only, safe-html, strict-same msgid "Statistics" msgstr "Statistics" #: :1484 #, read-only, safe-html, strict-same msgid "get_stats" msgstr "get_stats" #: :1485 #, read-only, safe-html, strict-same msgid "```c++ stats get_stats() const; ```" msgstr "```c++ stats get_stats() const; ```" #: :1490 #, read-only, safe-html, strict-same msgid "" "Returns:;; A statistical description of the insertion and lookup operations " "performed by the container so far. Notes:;; Only available if xref:reference/" "stats.adoc#stats[statistics calculation] is " "xref:unordered_node_map_boost_unordered_enable_stats[enabled]." msgstr "" "Returns:;; A statistical description of the insertion and lookup operations " "performed by the container so far. Notes:;; Only available if xref:reference/" "stats.adoc#stats[statistics calculation] is " "xref:unordered_node_map_boost_unordered_enable_stats[enabled]." #: :1493 #, read-only, safe-html, strict-same msgctxt ":1493" msgid "---" msgstr "---" #: :1495 #, read-only, safe-html, strict-same msgid "reset_stats" msgstr "reset_stats" #: :1496 #, read-only, safe-html, strict-same msgid "```c++ void reset_stats() noexcept; ```" msgstr "```c++ void reset_stats() noexcept; ```" #: :1501 #, read-only, safe-html, strict-same msgid "" "Effects:;; Sets to zero the internal statistics kept by the container. " "Notes:;; Only available if xref:reference/stats.adoc#stats[statistics " "calculation] is " "xref:unordered_node_map_boost_unordered_enable_stats[enabled]." msgstr "" "Effects:;; Sets to zero the internal statistics kept by the container. " "Notes:;; Only available if xref:reference/stats.adoc#stats[statistics " "calculation] is " "xref:unordered_node_map_boost_unordered_enable_stats[enabled]." #: :1504 #, read-only, safe-html, strict-same msgctxt ":1504" msgid "---" msgstr "---" #: :1506 #, read-only, safe-html, strict-same msgid "Deduction Guides" msgstr "Deduction Guides" #: :1507 #, read-only, safe-html, strict-same msgid "" "A deduction guide will not participate in overload resolution if any of the " "following are true:" msgstr "" "A deduction guide will not participate in overload resolution if any of the " "following are true:" #: :1509 #, read-only, 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 "" "- 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." #: :1514 #, read-only, safe-html, strict-same msgid "" "A `size_­type` parameter type in a deduction guide refers to the `size_­type` " "member type of the container type deduced by the deduction guide. Its " "default value coincides with the default value of the constructor selected." msgstr "" "A `size_­type` parameter type in a deduction guide refers to the `size_­type` " "member type of the container type deduced by the deduction guide. Its " "default value coincides with the default value of the constructor selected." #: :1518 #, read-only, safe-html, strict-same msgid "__iter-value-type__" msgstr "__iter-value-type__" #: :1526 #, read-only, safe-html, strict-same msgid "__iter-key-type__" msgstr "__iter-key-type__" #: :1534 #, read-only, safe-html, strict-same msgid "__iter-mapped-type__" msgstr "__iter-mapped-type__" #: :1542 #, read-only, safe-html, strict-same msgid "__iter-to-alloc-type__" msgstr "__iter-to-alloc-type__" #: :1551 #, read-only, safe-html, strict-same msgid "Equality Comparisons" msgstr "Equality Comparisons" #: :1553 #, read-only, safe-html, strict-same msgid "operator" msgstr "operator" #: :1554 #, read-only, safe-html, strict-same msgid "" "```c++ template " "bool operator==(const unordered_node_map& x, " "const unordered_node_map& y); ```" msgstr "" "```c++ template " "bool operator==(const unordered_node_map& x, " "const unordered_node_map& y); ```" #: :1560 #, read-only, safe-html, strict-same msgid "" "Return `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 "" "Return `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)." #: :1563 #, read-only, safe-html, strict-same msgctxt ":1563" msgid "" "Notes:;; Behavior is undefined if the two containers don't have equivalent " "equality predicates." msgstr "" "Notes:;; Behavior is undefined if the two containers don't have equivalent " "equality predicates." #: :1565 #, read-only, safe-html, strict-same msgctxt ":1565" msgid "---" msgstr "---" #: :1567 #, read-only, safe-html, strict-same msgid "operator!" msgstr "operator!" #: :1568 #, read-only, safe-html, strict-same msgid "" "```c++ template " "bool operator!=(const unordered_node_map& x, " "const unordered_node_map& y); ```" msgstr "" "```c++ template " "bool operator!=(const unordered_node_map& x, " "const unordered_node_map& y); ```" #: :1574 #, read-only, safe-html, strict-same msgid "" "Return `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 "" "Return `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)." #: :1577 #, read-only, safe-html, strict-same msgctxt ":1577" msgid "" "Notes:;; Behavior is undefined if the two containers don't have equivalent " "equality predicates." msgstr "" "Notes:;; Behavior is undefined if the two containers don't have equivalent " "equality predicates." #: :1579 #, read-only, safe-html, strict-same msgid "Swap" msgstr "Swap" #: :1580 #, read-only, safe-html, strict-same msgid "" "```c++ template " "void swap(unordered_node_map& x, " "unordered_node_map& y) noexcept(noexcept(x.swap" "(y))); ```" msgstr "" "```c++ template " "void swap(unordered_node_map& x, " "unordered_node_map& y) noexcept(noexcept(x.swap" "(y))); ```" #: :1587 #, read-only, safe-html, strict-same msgid "Swaps the contents of `x` and `y`." msgstr "Swaps the contents of `x` and `y`." #: :1589 #, read-only, safe-html, strict-same msgctxt ":1589" msgid "" "If `Allocator::propagate_on_container_swap` is declared and " "`Allocator::propagate_on_container_swap::value` is `true` then the " "containers' allocators are swapped. Otherwise, swapping with unequal " "allocators results in undefined behavior." msgstr "" "If `Allocator::propagate_on_container_swap` is declared and " "`Allocator::propagate_on_container_swap::value` is `true` then the " "containers' allocators are swapped. Otherwise, swapping with unequal " "allocators results in undefined behavior." #: :1592 #, read-only, safe-html, strict-same msgid "" "Effects:;; `x.swap(y)` Throws:;; Nothing unless `key_equal` or `hasher` " "throw on swapping." msgstr "" "Effects:;; `x.swap(y)` Throws:;; Nothing unless `key_equal` or `hasher` " "throw on swapping." #: :1595 #, read-only, safe-html, strict-same msgctxt ":1595" msgid "---" msgstr "---" #: :1597 #, read-only, safe-html, strict-same msgid "erase_if" msgstr "erase_if" #: :1598 #, read-only, safe-html, strict-same msgid "" "```c++ template typename unordered_node_map::size_type erase_if" "(unordered_node_map& c, Predicate pred); ```" msgstr "" "```c++ template typename unordered_node_map::size_type erase_if" "(unordered_node_map& c, Predicate pred); ```" #: :1604 #, read-only, safe-html, strict-same msgid "" "Traverses the container `c` and removes all elements for which the supplied " "predicate returns `true`." msgstr "" "Traverses the container `c` and removes all elements for which the supplied " "predicate returns `true`." #: :1607 #, read-only, safe-html, strict-same msgid "" "Returns:;; The number of erased elements. Notes:;; Equivalent to: + + ```c++ " "auto original_size = c.size(); for (auto i = c.begin(), last = c.end(); i != " "last; ) { if (pred(*i)) { i = c.erase(i); } else { ++i; } } return " "original_size - c.size(); ``` + Note that the references passed to `pred` " "are non-const." msgstr "" "Returns:;; The number of erased elements. Notes:;; Equivalent to: + + ```c++ " "auto original_size = c.size(); for (auto i = c.begin(), last = c.end(); i != " "last; ) { if (pred(*i)) { i = c.erase(i); } else { ++i; } } return " "original_size - c.size(); ``` + Note that the references passed to `pred` " "are non-const." #: :1624 #, read-only, safe-html, strict-same msgid "Serialization" msgstr "Serialization" #: :1626 #, read-only, safe-html, strict-same msgid "" "``unordered_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 "" "``unordered_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." #: :1630 #, read-only, safe-html, strict-same msgid "Saving an unordered_node_map to an archive" msgstr "Saving an unordered_node_map to an archive" #: :1632 #, read-only, safe-html, strict-same msgid "" "Saves all the elements of an `unordered_node_map` `x` to an archive (XML " "archive) `ar`." msgstr "" "Saves all the elements of an `unordered_node_map` `x` to an archive (XML " "archive) `ar`." #: :1635 #, read-only, 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)." msgstr "" "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)." #: :1641 #, read-only, safe-html, strict-same msgctxt ":1641" msgid "---" msgstr "---" #: :1643 #, read-only, safe-html, strict-same msgid "Loading an unordered_node_map from an archive" msgstr "Loading an unordered_node_map from an archive" #: :1645 #, read-only, safe-html, strict-same msgid "" "Deletes all preexisting elements of an `unordered_node_map` `x` and inserts " "from an archive (XML archive) `ar` restored copies of the elements of the " "original `unordered_node_map` `other` saved to the storage read by `ar`." msgstr "" "Deletes all preexisting elements of an `unordered_node_map` `x` and inserts " "from an archive (XML archive) `ar` restored copies of the elements of the " "original `unordered_node_map` `other` saved to the storage read by `ar`." #: :1650 #, read-only, safe-html, strict-same msgid "" "Requires:;; `key_type` and `mapped_type` are constructible from " "`std::remove_const::type&&` and `std::remove_const" "::type&&`, respectively. `x.key_equal()` is functionally equivalent to " "`other.key_equal()`." msgstr "" "Requires:;; `key_type` and `mapped_type` are constructible from " "`std::remove_const::type&&` and `std::remove_const" "::type&&`, respectively. `x.key_equal()` is functionally equivalent to " "`other.key_equal()`." #: :1655 #, read-only, safe-html, strict-same msgctxt ":1655" msgid "---" msgstr "---" #: :1657 #, read-only, safe-html, strict-same msgid "Saving an iterator/const_iterator to an archive" msgstr "Saving an iterator/const_iterator to an archive" #: :1659 #, read-only, safe-html, strict-same msgid "" "Saves the positional information of an `iterator` (`const_iterator`) `it` to " "an archive (XML archive) `ar`. `it` can be and `end()` iterator." msgstr "" "Saves the positional information of an `iterator` (`const_iterator`) `it` to " "an archive (XML archive) `ar`. `it` can be and `end()` iterator." #: :1663 #, read-only, safe-html, strict-same msgid "" "Requires:;; The `unordered_node_map` `x` pointed to by `it` has been " "previously saved to `ar`, and no modifying operations have been issued on " "`x` between saving of `x` and saving of `it`." msgstr "" "Requires:;; The `unordered_node_map` `x` pointed to by `it` has been " "previously saved to `ar`, and no modifying operations have been issued on " "`x` between saving of `x` and saving of `it`." #: :1667 #, read-only, safe-html, strict-same msgctxt ":1667" msgid "---" msgstr "---" #: :1669 #, read-only, safe-html, strict-same msgid "Loading an iterator/const_iterator from an archive" msgstr "Loading an iterator/const_iterator from an archive" #: :1671 #, read-only, safe-html, strict-same msgid "" "Makes an `iterator` (`const_iterator`) `it` point to the restored position " "of the original `iterator` (`const_iterator`) saved to the storage read by " "an archive (XML archive) `ar`." msgstr "" "Makes an `iterator` (`const_iterator`) `it` point to the restored position " "of the original `iterator` (`const_iterator`) saved to the storage read by " "an archive (XML archive) `ar`." #: :1676 #, read-only, safe-html, strict-same msgid "" "Requires:;; If `x` is the `unordered_node_map` `it` points to, no modifying " "operations have been issued on `x` between loading of `x` and loading of " "`it`." msgstr "" "Requires:;; If `x` is the `unordered_node_map` `it` points to, no modifying " "operations have been issued on `x` between loading of `x` and loading of " "`it`."