msgid "" msgstr "" "Project-Id-Version: English (Boost Unordered Translation (zh_Hans))\n" "Report-Msgid-Bugs-To: \n" "POT-Creation-Date: 2026-06-07 07:31+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_multiset" msgstr "Class Template unordered_multiset" #: :4 #, read-only, safe-html, strict-same msgid ":idprefix: unordered_multiset_" msgstr ":idprefix: unordered_multiset_" #: :6 #, read-only, safe-html, strict-same msgid "" "`boost::unordered_multiset` — An unordered associative container that stores " "values. The same key can be stored multiple times." msgstr "" "`boost::unordered_multiset` — An unordered associative container that stores " "values. The same key can be stored multiple times." #: :8 #, read-only, safe-html, strict-same msgid "Synopsis" msgstr "Synopsis" #: :238 #, read-only, safe-html, strict-same msgctxt ":238" msgid "---" msgstr "---" #: :240 #, read-only, safe-html, strict-same msgid "Description" msgstr "Description" #: :242 #, read-only, safe-html, strict-same msgid "*Template Parameters*" msgstr "*Template Parameters*" #: :245 #, read-only, safe-html, strict-same msgid "_Key_" msgstr "_Key_" #: :245 #, read-only, safe-html, strict-same msgid "" "`Key` must be https://en.cppreference.com/w/cpp/named_req/" "Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy " "it)." msgstr "" "`Key` must be https://en.cppreference.com/w/cpp/named_req/" "Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy " "it)." #: :245 #, read-only, safe-html, strict-same msgid "_Hash_" msgstr "_Hash_" #: :245 #, 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`." #: :245 #, read-only, safe-html, strict-same msgid "_Pred_" msgstr "_Pred_" #: :245 #, read-only, safe-html, strict-same msgid "" "A binary function object that implements an equivalence relation on values " "of type `Key`. 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 implements an equivalence relation on values " "of type `Key`. 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." #: :245 #, read-only, safe-html, strict-same msgid "_Allocator_" msgstr "_Allocator_" #: :245 #, 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." #: :258 #, 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." #: :262 #, read-only, safe-html, strict-same msgid "" "The elements are organized into buckets. Keys with the same hash code are " "stored in the same bucket and elements with equivalent keys are stored next " "to each other." msgstr "" "The elements are organized into buckets. Keys with the same hash code are " "stored in the same bucket and elements with equivalent keys are stored next " "to each other." #: :264 #, read-only, safe-html, strict-same msgid "" "The number of buckets can be automatically increased by a call to insert, or " "as the result of calling rehash." msgstr "" "The number of buckets can be automatically increased by a call to insert, or " "as the result of calling rehash." #: :266 #, read-only, safe-html, strict-same msgid "Configuration macros" msgstr "Configuration macros" #: :268 #, read-only, safe-html, strict-same msgid "`BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0`" msgstr "`BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0`" #: :270 #, read-only, safe-html, strict-same msgid "" "Globally define this macro to support loading of ``unordered_multiset``s " "saved to a Boost.Serialization archive with a version of Boost prior to " "Boost 1.84." msgstr "" "Globally define this macro to support loading of ``unordered_multiset``s " "saved to a Boost.Serialization archive with a version of Boost prior to " "Boost 1.84." #: :273 #, read-only, safe-html, strict-same msgid "Typedefs" msgstr "Typedefs" #: :280 #, read-only, safe-html, strict-same msgctxt ":280" msgid "A constant iterator whose value type is `value_type`." msgstr "A constant iterator whose value type is `value_type`." #: :282 #, read-only, safe-html, strict-same msgctxt ":282" msgid "The iterator category is at least a forward iterator." msgstr "The iterator category is at least a forward iterator." #: :284 #, read-only, safe-html, strict-same msgid "Convertible to `const_iterator`." msgstr "Convertible to `const_iterator`." #: :286 #, read-only, safe-html, strict-same msgctxt ":286" msgid "---" msgstr "---" #: :293 #, read-only, safe-html, strict-same msgctxt ":293" msgid "A constant iterator whose value type is `value_type`." msgstr "A constant iterator whose value type is `value_type`." #: :295 #, read-only, safe-html, strict-same msgctxt ":295" msgid "The iterator category is at least a forward iterator." msgstr "The iterator category is at least a forward iterator." #: :297 #, read-only, safe-html, strict-same msgctxt ":297" msgid "---" msgstr "---" #: :304 #, read-only, safe-html, strict-same msgid "" "An iterator with the same value type, difference type and pointer and " "reference type as iterator." msgstr "" "An iterator with the same value type, difference type and pointer and " "reference type as iterator." #: :306 #, read-only, safe-html, strict-same msgid "" "A `local_iterator` object can be used to iterate through a single bucket." msgstr "" "A `local_iterator` object can be used to iterate through a single bucket." #: :308 #, read-only, safe-html, strict-same msgctxt ":308" msgid "---" msgstr "---" #: :315 #, read-only, safe-html, strict-same msgid "" "A constant iterator with the same value type, difference type and pointer " "and reference type as const_iterator." msgstr "" "A constant iterator with the same value type, difference type and pointer " "and reference type as const_iterator." #: :317 #, read-only, safe-html, strict-same msgid "" "A const_local_iterator object can be used to iterate through a single bucket." msgstr "" "A const_local_iterator object can be used to iterate through a single bucket." #: :319 #, read-only, safe-html, strict-same msgctxt ":319" msgid "---" msgstr "---" #: :326 #, read-only, safe-html, strict-same msgid "See node_handle_set for details." msgstr "See node_handle_set for details." #: :328 #, read-only, safe-html, strict-same msgctxt ":328" msgid "---" msgstr "---" #: :330 #, read-only, safe-html, strict-same msgid "Constructors" msgstr "Constructors" #: :332 #, read-only, safe-html, strict-same msgid "Default Constructor" msgstr "Default Constructor" #: :333 #, read-only, safe-html, strict-same msgid "```c++ unordered_multiset(); ```" msgstr "```c++ unordered_multiset(); ```" #: :337 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container using `hasher()` as the hash function, " "`key_equal()` as the key equality predicate, `allocator_type()` as the " "allocator and a maximum load factor of `1.0`." msgstr "" "Constructs an empty container using `hasher()` as the hash function, " "`key_equal()` as the key equality predicate, `allocator_type()` as the " "allocator and a maximum load factor of `1.0`." #: :342 #, read-only, safe-html, strict-same msgctxt ":342" 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^]." #: :345 #, read-only, safe-html, strict-same msgctxt ":345" msgid "---" msgstr "---" #: :347 #, read-only, safe-html, strict-same msgid "Bucket Count Constructor" msgstr "Bucket Count Constructor" #: :348 #, read-only, safe-html, strict-same msgid "" "```c++ explicit unordered_multiset(size_type n, const hasher& hf = hasher(), " "const key_equal& eql = key_equal(), const allocator_type& a = allocator_type" "()); ```" msgstr "" "```c++ explicit unordered_multiset(size_type n, const hasher& hf = hasher(), " "const key_equal& eql = key_equal(), const allocator_type& a = allocator_type" "()); ```" #: :355 #, 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, `a` as the allocator and " "a maximum load factor of `1.0`." msgstr "" "Constructs an empty container with at least `n` buckets, using `hf` as the " "hash function, `eql` as the key equality predicate, `a` as the allocator and " "a maximum load factor of `1.0`." #: :360 #, read-only, safe-html, strict-same msgctxt ":360" 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^]." #: :363 #, read-only, safe-html, strict-same msgctxt ":363" msgid "---" msgstr "---" #: :365 #, read-only, safe-html, strict-same msgid "Iterator Range Constructor" msgstr "Iterator Range Constructor" #: :376 #, 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, `a` as the allocator and " "a maximum load factor of `1.0` 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, `a` as the allocator and " "a maximum load factor of `1.0` and inserts the elements from `[f, l)` into " "it." #: :379 #, read-only, safe-html, strict-same msgctxt ":379" 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^]." #: :381 #, read-only, safe-html, strict-same msgctxt ":381" msgid "---" msgstr "---" #: :383 #, read-only, safe-html, strict-same msgid "Copy Constructor" msgstr "Copy Constructor" #: :384 #, read-only, safe-html, strict-same msgid "```c++ unordered_multiset(const unordered_multiset& other); ```" msgstr "```c++ unordered_multiset(const unordered_multiset& other); ```" #: :388 #, read-only, safe-html, strict-same msgid "" "The copy constructor. Copies the contained elements, hash function, " "predicate, maximum load factor and allocator." msgstr "" "The copy constructor. Copies the contained elements, hash function, " "predicate, maximum load factor and allocator." #: :390 #, 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." #: :393 #, read-only, safe-html, strict-same msgctxt ":393" msgid "Requires:;; `value_type` is copy constructible" msgstr "Requires:;; `value_type` is copy constructible" #: :395 #, read-only, safe-html, strict-same msgctxt ":395" msgid "---" msgstr "---" #: :397 #, read-only, safe-html, strict-same msgid "Move Constructor" msgstr "Move Constructor" #: :398 #, read-only, safe-html, strict-same msgid "```c++ unordered_multiset(unordered_multiset&& other); ```" msgstr "```c++ unordered_multiset(unordered_multiset&& other); ```" #: :402 #, read-only, safe-html, strict-same msgid "The move constructor." msgstr "The move constructor." #: :405 #, read-only, safe-html, strict-same msgid "" "Notes:;; This is implemented using Boost.Move. Requires:;; `value_type` is " "move-constructible." msgstr "" "Notes:;; This is implemented using Boost.Move. Requires:;; `value_type` is " "move-constructible." #: :408 #, read-only, safe-html, strict-same msgctxt ":408" msgid "---" msgstr "---" #: :410 #, read-only, safe-html, strict-same msgid "Iterator Range Constructor with Allocator" msgstr "Iterator Range Constructor with Allocator" #: :411 #, read-only, safe-html, strict-same msgid "" "```c++ template unordered_multiset(InputIterator f, " "InputIterator l, const allocator_type& a); ```" msgstr "" "```c++ template unordered_multiset(InputIterator f, " "InputIterator l, const allocator_type& a); ```" #: :416 #, 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 a maximum load factor of `1.0` " "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 a maximum load factor of `1.0` " "and inserts the elements from `[f, l)` into it." #: :419 #, read-only, safe-html, strict-same msgctxt ":419" 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^]." #: :421 #, read-only, safe-html, strict-same msgctxt ":421" msgid "---" msgstr "---" #: :423 #, read-only, safe-html, strict-same msgid "Allocator Constructor" msgstr "Allocator Constructor" #: :424 #, read-only, safe-html, strict-same msgid "```c++ explicit unordered_multiset(const Allocator& a); ```" msgstr "```c++ explicit unordered_multiset(const Allocator& a); ```" #: :428 #, read-only, safe-html, strict-same msgid "Constructs an empty container, using allocator `a`." msgstr "Constructs an empty container, using allocator `a`." #: :430 #, read-only, safe-html, strict-same msgctxt ":430" msgid "---" msgstr "---" #: :432 #, read-only, safe-html, strict-same msgid "Copy Constructor with Allocator" msgstr "Copy Constructor with Allocator" #: :433 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_multiset(const unordered_multiset& other, const Allocator& " "a); ```" msgstr "" "```c++ unordered_multiset(const unordered_multiset& other, const Allocator& " "a); ```" #: :437 #, read-only, safe-html, strict-same msgid "" "Constructs an container, copying ``other``'s contained elements, hash " "function, predicate, maximum load factor, but using allocator `a`." msgstr "" "Constructs an container, copying ``other``'s contained elements, hash " "function, predicate, maximum load factor, but using allocator `a`." #: :439 #, read-only, safe-html, strict-same msgctxt ":439" msgid "---" msgstr "---" #: :441 #, read-only, safe-html, strict-same msgid "Move Constructor with Allocator" msgstr "Move Constructor with Allocator" #: :442 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_multiset(unordered_multiset&& other, const Allocator& a); " "```" msgstr "" "```c++ unordered_multiset(unordered_multiset&& other, const Allocator& a); " "```" #: :446 #, read-only, safe-html, strict-same msgid "" "Construct a container moving ``other``'s contained elements, and having the " "hash function, predicate and maximum load factor, but using allocate `a`." msgstr "" "Construct a container moving ``other``'s contained elements, and having the " "hash function, predicate and maximum load factor, but using allocate `a`." #: :449 #, read-only, safe-html, strict-same msgid "" "Notes:;; This is implemented using Boost.Move. Requires:;; `value_type` is " "move insertable." msgstr "" "Notes:;; This is implemented using Boost.Move. Requires:;; `value_type` is " "move insertable." #: :452 #, read-only, safe-html, strict-same msgctxt ":452" msgid "---" msgstr "---" #: :454 #, read-only, safe-html, strict-same msgid "Initializer List Constructor" msgstr "Initializer List Constructor" #: :464 #, 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, `a` as the allocator and " "a maximum load factor of `1.0` 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, `a` as the allocator and " "a maximum load factor of `1.0` and inserts the elements from `il` into it." #: :467 #, read-only, safe-html, strict-same msgctxt ":467" 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^]." #: :469 #, read-only, safe-html, strict-same msgctxt ":469" msgid "---" msgstr "---" #: :471 #, read-only, safe-html, strict-same msgid "Bucket Count Constructor with Allocator" msgstr "Bucket Count Constructor with Allocator" #: :472 #, read-only, safe-html, strict-same msgid "```c++ unordered_multiset(size_type n, const allocator_type& a); ```" msgstr "```c++ unordered_multiset(size_type n, const allocator_type& a); ```" #: :476 #, 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, `a` as " "the allocator and a maximum load factor of `1.0`." msgstr "" "Constructs an empty container with at least `n` buckets, using `hf` as the " "hash function, the default hash function and key equality predicate, `a` as " "the allocator and a maximum load factor of `1.0`." #: :479 #, 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^]." #: :482 #, read-only, safe-html, strict-same msgctxt ":482" msgid "---" msgstr "---" #: :484 #, read-only, safe-html, strict-same msgid "Bucket Count Constructor with Hasher and Allocator" msgstr "Bucket Count Constructor with Hasher and Allocator" #: :485 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_multiset(size_type n, const hasher& hf, const " "allocator_type& a); ```" msgstr "" "```c++ unordered_multiset(size_type n, const hasher& hf, const " "allocator_type& a); ```" #: :489 #, 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, `a` as the allocator and " "a maximum load factor of `1.0`." msgstr "" "Constructs an empty container with at least `n` buckets, using `hf` as the " "hash function, the default key equality predicate, `a` as the allocator and " "a maximum load factor of `1.0`." #: :492 #, 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^]." #: :495 #, read-only, safe-html, strict-same msgctxt ":495" msgid "---" msgstr "---" #: :497 #, read-only, safe-html, strict-same msgid "Iterator Range Constructor with Bucket Count and Allocator" msgstr "Iterator Range Constructor with Bucket Count and Allocator" #: :504 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container with at least `n` buckets, using `a` as the " "allocator, with the default hash function and key equality predicate and a " "maximum load factor of `1.0` and inserts the elements from `[f, l)` into it." msgstr "" "Constructs an empty container with at least `n` buckets, using `a` as the " "allocator, with the default hash function and key equality predicate and a " "maximum load factor of `1.0` and inserts the elements from `[f, l)` into it." #: :507 #, read-only, safe-html, strict-same msgctxt ":507" 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^]." #: :509 #, read-only, safe-html, strict-same msgctxt ":509" msgid "---" msgstr "---" #: :511 #, read-only, safe-html, strict-same msgid "Iterator Range Constructor with Bucket Count and Hasher" msgstr "Iterator Range Constructor with Bucket Count and Hasher" #: :519 #, 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 a maximum load factor of `1.0` 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 a maximum load factor of `1.0` and inserts the elements from `[f, l)` " "into it." #: :522 #, read-only, safe-html, strict-same msgctxt ":522" 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^]." #: :524 #, read-only, safe-html, strict-same msgctxt ":524" msgid "---" msgstr "---" #: :526 #, read-only, safe-html, strict-same msgid "initializer_list Constructor with Allocator" msgstr "initializer_list Constructor with Allocator" #: :528 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_multiset(std::initializer_list il, const " "allocator_type& a); ```" msgstr "" "```c++ unordered_multiset(std::initializer_list il, const " "allocator_type& a); ```" #: :532 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container using `a` as the allocator and a maximum load " "factor of 1.0 and inserts the elements from `il` into it." msgstr "" "Constructs an empty container using `a` as the allocator and a maximum load " "factor of 1.0 and inserts the elements from `il` into it." #: :535 #, read-only, safe-html, strict-same msgctxt ":535" 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^]." #: :537 #, read-only, safe-html, strict-same msgctxt ":537" msgid "---" msgstr "---" #: :539 #, read-only, safe-html, strict-same msgid "initializer_list Constructor with Bucket Count and Allocator" msgstr "initializer_list Constructor with Bucket Count and Allocator" #: :541 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_multiset(std::initializer_list il, size_type n, " "const allocator_type& a) ```" msgstr "" "```c++ unordered_multiset(std::initializer_list il, size_type n, " "const allocator_type& a) ```" #: :545 #, read-only, safe-html, strict-same msgid "" "Constructs an empty container with at least `n` buckets, using `a` as the " "allocator and a maximum load factor of 1.0 and inserts the elements from " "`il` into it." msgstr "" "Constructs an empty container with at least `n` buckets, using `a` as the " "allocator and a maximum load factor of 1.0 and inserts the elements from " "`il` into it." #: :548 #, read-only, safe-html, strict-same msgctxt ":548" 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^]." #: :550 #, read-only, safe-html, strict-same msgctxt ":550" msgid "---" msgstr "---" #: :552 #, 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" #: :554 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_multiset(std::initializer_list il, size_type n, " "const hasher& hf, const allocator_type& a); ```" msgstr "" "```c++ unordered_multiset(std::initializer_list il, size_type n, " "const hasher& hf, const allocator_type& a); ```" #: :559 #, 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 a maximum load factor of 1.0 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 a maximum load factor of 1.0 and " "inserts the elements from `il` into it." #: :562 #, read-only, safe-html, strict-same msgctxt ":562" 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^]." #: :564 #, read-only, safe-html, strict-same msgctxt ":564" msgid "---" msgstr "---" #: :566 #, read-only, safe-html, strict-same msgid "Destructor" msgstr "Destructor" #: :568 #, read-only, safe-html, strict-same msgid "```c++ ~unordered_multiset(); ```" msgstr "```c++ ~unordered_multiset(); ```" #: :573 #, 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" #: :575 #, read-only, safe-html, strict-same msgctxt ":575" msgid "---" msgstr "---" #: :577 #, read-only, safe-html, strict-same msgid "Assignment" msgstr "Assignment" #: :579 #, read-only, safe-html, strict-same msgid "Copy Assignment" msgstr "Copy Assignment" #: :581 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_multiset& operator=(const unordered_multiset& other); ```" msgstr "" "```c++ unordered_multiset& operator=(const unordered_multiset& other); ```" #: :585 #, read-only, safe-html, strict-same msgid "" "The assignment operator. Copies the contained elements, hash function, " "predicate and maximum load factor but not the allocator." msgstr "" "The assignment operator. Copies the contained elements, hash function, " "predicate and maximum load factor but not the allocator." #: :587 #, read-only, safe-html, strict-same msgid "" "If `Alloc::propagate_on_container_copy_assignment` exists and " "`Alloc::propagate_on_container_copy_assignment::value` is `true`, the " "allocator is overwritten, if not the copied elements are created using the " "existing allocator." msgstr "" "If `Alloc::propagate_on_container_copy_assignment` exists and " "`Alloc::propagate_on_container_copy_assignment::value` is `true`, the " "allocator is overwritten, if not the copied elements are created using the " "existing allocator." #: :590 #, read-only, safe-html, strict-same msgctxt ":590" msgid "Requires:;; `value_type` is copy constructible" msgstr "Requires:;; `value_type` is copy constructible" #: :592 #, read-only, safe-html, strict-same msgctxt ":592" msgid "---" msgstr "---" #: :594 #, read-only, safe-html, strict-same msgid "Move Assignment" msgstr "Move Assignment" #: :595 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_multiset& operator=(unordered_multiset&& other) noexcept" "(boost::allocator_traits::is_always_equal::value && " "boost::is_nothrow_move_assignable_v && " "boost::is_nothrow_move_assignable_v); ``` The move assignment operator." msgstr "" "```c++ unordered_multiset& operator=(unordered_multiset&& other) noexcept" "(boost::allocator_traits::is_always_equal::value && " "boost::is_nothrow_move_assignable_v && " "boost::is_nothrow_move_assignable_v); ``` The move assignment operator." #: :603 #, read-only, safe-html, strict-same msgid "" "If `Alloc::propagate_on_container_move_assignment` exists and " "`Alloc::propagate_on_container_move_assignment::value` is `true`, the " "allocator is overwritten, if not the moved elements are created using the " "existing allocator." msgstr "" "If `Alloc::propagate_on_container_move_assignment` exists and " "`Alloc::propagate_on_container_move_assignment::value` is `true`, the " "allocator is overwritten, if not the moved elements are created using the " "existing allocator." #: :606 #, read-only, safe-html, strict-same msgid "Requires:;; `value_type` is move constructible." msgstr "Requires:;; `value_type` is move constructible." #: :608 #, read-only, safe-html, strict-same msgctxt ":608" msgid "---" msgstr "---" #: :610 #, read-only, safe-html, strict-same msgid "Initializer List Assignment" msgstr "Initializer List Assignment" #: :611 #, read-only, safe-html, strict-same msgid "" "```c++ unordered_multiset& operator=(std::initializer_list il); " "```" msgstr "" "```c++ unordered_multiset& operator=(std::initializer_list il); " "```" #: :615 #, read-only, safe-html, strict-same msgid "" "Assign from values in initializer list. All existing elements are either " "overwritten by the new elements or destroyed." msgstr "" "Assign from values in initializer list. All existing elements are either " "overwritten by the new elements or destroyed." #: :618 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^] into the container and https://" "en.cppreference.com/w/cpp/named_req/CopyAssignable[CopyAssignable^]." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^] into the container and https://" "en.cppreference.com/w/cpp/named_req/CopyAssignable[CopyAssignable^]." #: :620 #, read-only, safe-html, strict-same msgctxt ":620" msgid "---" msgstr "---" #: :622 #, read-only, safe-html, strict-same msgid "Iterators" msgstr "Iterators" #: :624 #, read-only, safe-html, strict-same msgctxt ":624" msgid "begin" msgstr "begin" #: :625 #, 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; ```" #: :631 #, 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." 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." #: :633 #, read-only, safe-html, strict-same msgctxt ":633" msgid "---" msgstr "---" #: :635 #, read-only, safe-html, strict-same msgctxt ":635" msgid "end" msgstr "end" #: :636 #, 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; " "```" #: :642 #, 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." #: :644 #, read-only, safe-html, strict-same msgctxt ":644" msgid "---" msgstr "---" #: :646 #, read-only, safe-html, strict-same msgctxt ":646" msgid "cbegin" msgstr "cbegin" #: :647 #, read-only, safe-html, strict-same msgid "```c++ const_iterator cbegin() const noexcept; ```" msgstr "```c++ const_iterator cbegin() const noexcept; ```" #: :652 #, 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." 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." #: :654 #, read-only, safe-html, strict-same msgctxt ":654" msgid "---" msgstr "---" #: :656 #, read-only, safe-html, strict-same msgctxt ":656" msgid "cend" msgstr "cend" #: :657 #, read-only, safe-html, strict-same msgid "```c++ const_iterator cend() const noexcept; ```" msgstr "```c++ const_iterator cend() const noexcept; ```" #: :662 #, 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." #: :664 #, read-only, safe-html, strict-same msgctxt ":664" msgid "---" msgstr "---" #: :666 #, read-only, safe-html, strict-same msgid "Size and Capacity" msgstr "Size and Capacity" #: :668 #, read-only, safe-html, strict-same msgid "empty" msgstr "empty" #: :670 #, read-only, safe-html, strict-same msgid "```c++ [[nodiscard]] bool empty() const noexcept; ```" msgstr "```c++ [[nodiscard]] bool empty() const noexcept; ```" #: :675 #, read-only, safe-html, strict-same msgid "Returns:;; `size() == 0`" msgstr "Returns:;; `size() == 0`" #: :677 #, read-only, safe-html, strict-same msgctxt ":677" msgid "---" msgstr "---" #: :679 #, read-only, safe-html, strict-same msgid "size" msgstr "size" #: :681 #, read-only, safe-html, strict-same msgid "```c++ size_type size() const noexcept; ```" msgstr "```c++ size_type size() const noexcept; ```" #: :686 #, read-only, safe-html, strict-same msgid "Returns:;; `std::distance(begin(), end())`" msgstr "Returns:;; `std::distance(begin(), end())`" #: :688 #, read-only, safe-html, strict-same msgctxt ":688" msgid "---" msgstr "---" #: :690 #, read-only, safe-html, strict-same msgid "max_size" msgstr "max_size" #: :692 #, read-only, safe-html, strict-same msgid "```c++ size_type max_size() const noexcept; ```" msgstr "```c++ size_type max_size() const noexcept; ```" #: :697 #, read-only, safe-html, strict-same msgid "Returns:;; `size()` of the largest possible container." msgstr "Returns:;; `size()` of the largest possible container." #: :699 #, read-only, safe-html, strict-same msgctxt ":699" msgid "---" msgstr "---" #: :701 #, read-only, safe-html, strict-same msgid "Modifiers" msgstr "Modifiers" #: :703 #, read-only, safe-html, strict-same msgid "emplace" msgstr "emplace" #: :704 #, read-only, safe-html, strict-same msgid "```c++ template iterator emplace(Args&&... args); ```" msgstr "```c++ template iterator emplace(Args&&... args); ```" #: :708 #, read-only, safe-html, strict-same msgctxt ":708" msgid "" "Inserts an object, constructed with the arguments args, in the container." msgstr "" "Inserts an object, constructed with the arguments args, in the container." #: :711 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "EmplaceConstructible[EmplaceConstructible^] into `X` from `args`. Returns:;; " "An iterator pointing to the inserted element. 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 factor to be greater to or equal to the maximum load factor. + + " "Pointers and references to elements are never invalidated." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "EmplaceConstructible[EmplaceConstructible^] into `X` from `args`. Returns:;; " "An iterator pointing to the inserted element. 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 factor to be greater to or equal to the maximum load factor. + + " "Pointers and references to elements are never invalidated." #: :718 #, read-only, safe-html, strict-same msgctxt ":718" msgid "---" msgstr "---" #: :720 #, read-only, safe-html, strict-same msgid "emplace_hint" msgstr "emplace_hint" #: :721 #, 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); ```" #: :725 #, read-only, safe-html, strict-same msgctxt ":725" msgid "" "Inserts an object, constructed with the arguments args, in the container." msgstr "" "Inserts an object, constructed with the arguments args, in the container." #: :727 #, read-only, safe-html, strict-same msgctxt ":727" msgid "`hint` is a suggestion to where the element should be inserted." msgstr "`hint` is a suggestion to where the element should be inserted." #: :730 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "EmplaceConstructible[EmplaceConstructible^] into `X` from `args`. Returns:;; " "An iterator pointing to the inserted element. Throws:;; If an exception is " "thrown by an operation other than a call to `hasher` the function has no " "effect. Notes:;; The standard is fairly vague on the meaning of the hint. " "But the only practical way to use it, and the only way that Boost.Unordered " "supports is to point to an existing element with the same key. + + Can " "invalidate iterators, but only if the insert causes the load factor to be " "greater to or equal to the maximum load factor. + + Pointers and references " "to elements are never invalidated." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "EmplaceConstructible[EmplaceConstructible^] into `X` from `args`. Returns:;; " "An iterator pointing to the inserted element. Throws:;; If an exception is " "thrown by an operation other than a call to `hasher` the function has no " "effect. Notes:;; The standard is fairly vague on the meaning of the hint. " "But the only practical way to use it, and the only way that Boost.Unordered " "supports is to point to an existing element with the same key. + + Can " "invalidate iterators, but only if the insert causes the load factor to be " "greater to or equal to the maximum load factor. + + Pointers and references " "to elements are never invalidated." #: :739 #, read-only, safe-html, strict-same msgctxt ":739" msgid "---" msgstr "---" #: :741 #, read-only, safe-html, strict-same msgid "Copy Insert" msgstr "Copy Insert" #: :742 #, read-only, safe-html, strict-same msgid "```c++ iterator insert(const value_type& obj); ```" msgstr "```c++ iterator insert(const value_type& obj); ```" #: :746 #, read-only, safe-html, strict-same msgctxt ":746" msgid "Inserts `obj` in the container." msgstr "Inserts `obj` in the container." #: :749 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]. Returns:;; An iterator pointing to the " "inserted element. 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 factor to be greater to or " "equal to the maximum load factor. + + Pointers and references to elements " "are never invalidated." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]. Returns:;; An iterator pointing to the " "inserted element. 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 factor to be greater to or " "equal to the maximum load factor. + + Pointers and references to elements " "are never invalidated." #: :756 #, read-only, safe-html, strict-same msgctxt ":756" msgid "---" msgstr "---" #: :758 #, read-only, safe-html, strict-same msgid "Move Insert" msgstr "Move Insert" #: :759 #, read-only, safe-html, strict-same msgid "```c++ iterator insert(value_type&& obj); ```" msgstr "```c++ iterator insert(value_type&& obj); ```" #: :763 #, read-only, safe-html, strict-same msgctxt ":763" msgid "Inserts `obj` in the container." msgstr "Inserts `obj` in the container." #: :766 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]. Returns:;; An iterator pointing to the " "inserted element. 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 factor to be greater to or " "equal to the maximum load factor. + + Pointers and references to elements " "are never invalidated." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]. Returns:;; An iterator pointing to the " "inserted element. 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 factor to be greater to or " "equal to the maximum load factor. + + Pointers and references to elements " "are never invalidated." #: :773 #, read-only, safe-html, strict-same msgctxt ":773" msgid "---" msgstr "---" #: :775 #, read-only, safe-html, strict-same msgid "Copy Insert with Hint" msgstr "Copy Insert with Hint" #: :776 #, read-only, safe-html, strict-same msgid "```c++ iterator insert(const_iterator hint, const value_type& obj); ```" msgstr "```c++ iterator insert(const_iterator hint, const value_type& obj); ```" #: :780 #, read-only, safe-html, strict-same msgctxt ":780" msgid "Inserts `obj` in the container." msgstr "Inserts `obj` in the container." #: :782 #, read-only, safe-html, strict-same msgctxt ":782" msgid "`hint` is a suggestion to where the element should be inserted." msgstr "`hint` is a suggestion to where the element should be inserted." #: :785 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]. Returns:;; An iterator pointing to the " "inserted element. Throws:;; If an exception is thrown by an operation other " "than a call to `hasher` the function has no effect. Notes:;; The standard is " "fairly vague on the meaning of the hint. But the only practical way to use " "it, and the only way that Boost.Unordered supports is to point to an " "existing element with the same key. + + Can invalidate iterators, but only " "if the insert causes the load factor to be greater to or equal to the " "maximum load factor. + + Pointers and references to elements are never " "invalidated." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "CopyInsertable[CopyInsertable^]. Returns:;; An iterator pointing to the " "inserted element. Throws:;; If an exception is thrown by an operation other " "than a call to `hasher` the function has no effect. Notes:;; The standard is " "fairly vague on the meaning of the hint. But the only practical way to use " "it, and the only way that Boost.Unordered supports is to point to an " "existing element with the same key. + + Can invalidate iterators, but only " "if the insert causes the load factor to be greater to or equal to the " "maximum load factor. + + Pointers and references to elements are never " "invalidated." #: :794 #, read-only, safe-html, strict-same msgctxt ":794" msgid "---" msgstr "---" #: :796 #, read-only, safe-html, strict-same msgid "Move Insert with Hint" msgstr "Move Insert with Hint" #: :797 #, read-only, safe-html, strict-same msgid "```c++ iterator insert(const_iterator hint, value_type&& obj); ```" msgstr "```c++ iterator insert(const_iterator hint, value_type&& obj); ```" #: :801 #, read-only, safe-html, strict-same msgctxt ":801" msgid "Inserts `obj` in the container." msgstr "Inserts `obj` in the container." #: :803 #, read-only, safe-html, strict-same msgctxt ":803" msgid "`hint` is a suggestion to where the element should be inserted." msgstr "`hint` is a suggestion to where the element should be inserted." #: :806 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]. Returns:;; An iterator pointing to the " "inserted element. Throws:;; If an exception is thrown by an operation other " "than a call to `hasher` the function has no effect. Notes:;; The standard is " "fairly vague on the meaning of the hint. But the only practical way to use " "it, and the only way that Boost.Unordered supports is to point to an " "existing element with the same key. + + Can invalidate iterators, but only " "if the insert causes the load factor to be greater to or equal to the " "maximum load factor. + + Pointers and references to elements are never " "invalidated." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]. Returns:;; An iterator pointing to the " "inserted element. Throws:;; If an exception is thrown by an operation other " "than a call to `hasher` the function has no effect. Notes:;; The standard is " "fairly vague on the meaning of the hint. But the only practical way to use " "it, and the only way that Boost.Unordered supports is to point to an " "existing element with the same key. + + Can invalidate iterators, but only " "if the insert causes the load factor to be greater to or equal to the " "maximum load factor. + + Pointers and references to elements are never " "invalidated." #: :815 #, read-only, safe-html, strict-same msgctxt ":815" msgid "---" msgstr "---" #: :817 #, read-only, safe-html, strict-same msgid "Insert Iterator Range" msgstr "Insert Iterator Range" #: :818 #, read-only, safe-html, strict-same msgid "" "```c++ template void insert(InputIterator first, " "InputIterator last); ```" msgstr "" "```c++ template void insert(InputIterator first, " "InputIterator last); ```" #: :822 #, read-only, safe-html, strict-same msgid "Inserts a range of elements into the container." msgstr "Inserts a range of elements into the container." #: :825 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "EmplaceConstructible[EmplaceConstructible^] into `X` 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 factor to " "be greater to or equal to the maximum load factor. + + Pointers and " "references to elements are never invalidated." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "EmplaceConstructible[EmplaceConstructible^] into `X` 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 factor to " "be greater to or equal to the maximum load factor. + + Pointers and " "references to elements are never invalidated." #: :831 #, read-only, safe-html, strict-same msgctxt ":831" msgid "---" msgstr "---" #: :833 #, read-only, safe-html, strict-same msgid "Insert Initializer List" msgstr "Insert Initializer List" #: :834 #, read-only, safe-html, strict-same msgid "```c++ void insert(std::initializer_list il); ```" msgstr "```c++ void insert(std::initializer_list il); ```" #: :838 #, read-only, safe-html, strict-same 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." #: :841 #, 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 factor to be greater to or " "equal to the maximum load factor. + + Pointers and references to elements " "are never invalidated." 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 factor to be greater to or " "equal to the maximum load factor. + + Pointers and references to elements " "are never invalidated." #: :847 #, read-only, safe-html, strict-same msgctxt ":847" msgid "---" msgstr "---" #: :849 #, read-only, safe-html, strict-same msgid "Extract by Iterator" msgstr "Extract by Iterator" #: :850 #, read-only, safe-html, strict-same msgid "```c++ node_type extract(const_iterator position); ```" msgstr "```c++ node_type extract(const_iterator position); ```" #: :854 #, read-only, safe-html, strict-same msgid "Removes the element pointed to by `position`." msgstr "Removes the element pointed to by `position`." #: :857 #, read-only, safe-html, strict-same msgid "" "Returns:;; A `node_type` owning the element. Notes:;; A node extracted using " "this method can be inserted into a compatible `unordered_set`." msgstr "" "Returns:;; A `node_type` owning the element. Notes:;; A node extracted using " "this method can be inserted into a compatible `unordered_set`." #: :860 #, read-only, safe-html, strict-same msgctxt ":860" msgid "---" msgstr "---" #: :862 #, read-only, safe-html, strict-same msgid "Extract by Value" msgstr "Extract by Value" #: :863 #, 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); ```" #: :868 #, read-only, safe-html, strict-same msgid "Removes an element with key equivalent to `k`." msgstr "Removes an element with key equivalent to `k`." #: :871 #, read-only, safe-html, strict-same msgid "" "Returns:;; A `node_type` owning the element if found, otherwise an empty " "`node_type`. Throws:;; Only throws an exception if it is thrown by `hasher` " "or `key_equal`. Notes:;; A node extracted using this method can be inserted " "into a compatible `unordered_set`. + + 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:;; A `node_type` owning the element if found, otherwise an empty " "`node_type`. Throws:;; Only throws an exception if it is thrown by `hasher` " "or `key_equal`. Notes:;; A node extracted using this method can be inserted " "into a compatible `unordered_set`. + + 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." #: :877 #, read-only, safe-html, strict-same msgctxt ":877" msgid "---" msgstr "---" #: :879 #, read-only, safe-html, strict-same msgid "Insert with `node_handle`" msgstr "Insert with `node_handle`" #: :880 #, read-only, safe-html, strict-same msgid "```c++ iterator insert(node_type&& nh); ```" msgstr "```c++ iterator insert(node_type&& nh); ```" #: :884 #, read-only, safe-html, strict-same msgctxt ":884" msgid "If `nh` is empty, has no effect." msgstr "If `nh` is empty, has no effect." #: :886 #, read-only, safe-html, strict-same msgctxt ":886" msgid "Otherwise inserts the element owned by `nh`." msgstr "Otherwise inserts the element owned by `nh`." #: :889 #, read-only, safe-html, strict-same msgid "" "Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the " "container's allocator. Returns:;; If `nh` was empty, returns `end()`. + + " "Otherwise returns an iterator pointing to the newly inserted element. " "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 factor to be greater to or equal to the " "maximum load factor. + + Pointers and references to elements are never " "invalidated. + + This can be used to insert a node extracted from a " "compatible `unordered_set`." msgstr "" "Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the " "container's allocator. Returns:;; If `nh` was empty, returns `end()`. + + " "Otherwise returns an iterator pointing to the newly inserted element. " "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 factor to be greater to or equal to the " "maximum load factor. + + Pointers and references to elements are never " "invalidated. + + This can be used to insert a node extracted from a " "compatible `unordered_set`." #: :900 #, read-only, safe-html, strict-same msgctxt ":900" msgid "---" msgstr "---" #: :902 #, read-only, safe-html, strict-same msgid "Insert with Hint and `node_handle`" msgstr "Insert with Hint and `node_handle`" #: :903 #, 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); ```" #: :907 #, read-only, safe-html, strict-same msgctxt ":907" msgid "If `nh` is empty, has no effect." msgstr "If `nh` is empty, has no effect." #: :909 #, read-only, safe-html, strict-same msgctxt ":909" msgid "Otherwise inserts the element owned by `nh`." msgstr "Otherwise inserts the element owned by `nh`." #: :911 #, read-only, safe-html, strict-same msgctxt ":911" msgid "`hint` is a suggestion to where the element should be inserted." msgstr "`hint` is a suggestion to where the element should be inserted." #: :914 #, read-only, safe-html, strict-same msgid "" "Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the " "container's allocator. Returns:;; If `nh` was empty, returns `end()`. + + " "Otherwise returns an iterator pointing to the newly inserted element. " "Throws:;; If an exception is thrown by an operation other than a call to " "hasher the function has no effect. Notes:;; The standard is fairly vague on " "the meaning of the hint. But the only practical way to use it, and the only " "way that Boost.Unordered supports is to point to an existing element with " "the same key. + + Can invalidate iterators, but only if the insert causes " "the load factor to be greater to or equal to the maximum load factor. + + " "Pointers and references to elements are never invalidated. + + This can be " "used to insert a node extracted from a compatible `unordered_set`." msgstr "" "Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the " "container's allocator. Returns:;; If `nh` was empty, returns `end()`. + + " "Otherwise returns an iterator pointing to the newly inserted element. " "Throws:;; If an exception is thrown by an operation other than a call to " "hasher the function has no effect. Notes:;; The standard is fairly vague on " "the meaning of the hint. But the only practical way to use it, and the only " "way that Boost.Unordered supports is to point to an existing element with " "the same key. + + Can invalidate iterators, but only if the insert causes " "the load factor to be greater to or equal to the maximum load factor. + + " "Pointers and references to elements are never invalidated. + + This can be " "used to insert a node extracted from a compatible `unordered_set`." #: :927 #, read-only, safe-html, strict-same msgctxt ":927" msgid "---" msgstr "---" #: :929 #, read-only, safe-html, strict-same msgid "Erase by Position" msgstr "Erase by Position" #: :931 #, read-only, safe-html, strict-same msgid "" "```c++ iterator erase(iterator position); iterator erase(const_iterator " "position); ```" msgstr "" "```c++ iterator erase(iterator position); iterator erase(const_iterator " "position); ```" #: :936 #, read-only, safe-html, strict-same msgctxt ":936" msgid "Erase the element pointed to by `position`." msgstr "Erase the element pointed to by `position`." #: :939 #, read-only, safe-html, strict-same msgid "" "Returns:;; The iterator following `position` before the erasure. Throws:;; " "Only throws an exception if it is thrown by `hasher` or `key_equal`. " "Notes:;; In older versions this could be inefficient because it had to " "search through several buckets to find the position of the returned " "iterator. The data structure has been changed so that this is no longer the " "case, and the alternative erase methods have been deprecated." msgstr "" "Returns:;; The iterator following `position` before the erasure. Throws:;; " "Only throws an exception if it is thrown by `hasher` or `key_equal`. " "Notes:;; In older versions this could be inefficient because it had to " "search through several buckets to find the position of the returned " "iterator. The data structure has been changed so that this is no longer the " "case, and the alternative erase methods have been deprecated." #: :943 #, read-only, safe-html, strict-same msgctxt ":943" msgid "---" msgstr "---" #: :945 #, read-only, safe-html, strict-same msgid "Erase by Value" msgstr "Erase by Value" #: :946 #, read-only, safe-html, strict-same msgid "" "```c++ size_type erase(const key_type& k); template size_type erase" "(K&& x); ```" msgstr "" "```c++ size_type erase(const key_type& k); template size_type erase" "(K&& x); ```" #: :951 #, read-only, safe-html, strict-same msgid "Erase all elements with key equivalent to `k`." msgstr "Erase all elements with key equivalent to `k`." #: :954 #, 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." #: :958 #, read-only, safe-html, strict-same msgctxt ":958" msgid "---" msgstr "---" #: :960 #, read-only, safe-html, strict-same msgid "Erase Range" msgstr "Erase Range" #: :962 #, 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); ```" #: :966 #, 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`." #: :969 #, read-only, safe-html, strict-same msgid "" "Returns:;; The iterator following the erased elements - i.e. `last`. " "Throws:;; Only throws an exception if it is thrown by `hasher` or " "`key_equal`. + + In this implementation, this overload doesn't call either " "function object's methods so it is no throw, but this might not be true in " "other implementations." msgstr "" "Returns:;; The iterator following the erased elements - i.e. `last`. " "Throws:;; Only throws an exception if it is thrown by `hasher` or " "`key_equal`. + + In this implementation, this overload doesn't call either " "function object's methods so it is no throw, but this might not be true in " "other implementations." #: :974 #, read-only, safe-html, strict-same msgctxt ":974" msgid "---" msgstr "---" #: :976 #, read-only, safe-html, strict-same msgid "quick_erase" msgstr "quick_erase" #: :977 #, read-only, safe-html, strict-same msgid "```c++ void quick_erase(const_iterator position); ```" msgstr "```c++ void quick_erase(const_iterator position); ```" #: :981 #, read-only, safe-html, strict-same msgctxt ":981" msgid "Erase the element pointed to by `position`." msgstr "Erase the element pointed to by `position`." #: :984 #, read-only, safe-html, strict-same msgctxt ":984" msgid "" "Throws:;; Only throws an exception if it is thrown by `hasher` or " "`key_equal`. + + In this implementation, this overload doesn't call either " "function object's methods so it is no throw, but this might not be true in " "other implementations. Notes:;; This method was implemented because " "returning an iterator to the next element from erase was expensive, but the " "container has been redesigned so that is no longer the case. So this method " "is now deprecated." msgstr "" "Throws:;; Only throws an exception if it is thrown by `hasher` or " "`key_equal`. + + In this implementation, this overload doesn't call either " "function object's methods so it is no throw, but this might not be true in " "other implementations. Notes:;; This method was implemented because " "returning an iterator to the next element from erase was expensive, but the " "container has been redesigned so that is no longer the case. So this method " "is now deprecated." #: :989 #, read-only, safe-html, strict-same msgctxt ":989" msgid "---" msgstr "---" #: :991 #, read-only, safe-html, strict-same msgid "erase_return_void" msgstr "erase_return_void" #: :992 #, read-only, safe-html, strict-same msgid "```c++ void erase_return_void(const_iterator position); ```" msgstr "```c++ void erase_return_void(const_iterator position); ```" #: :996 #, read-only, safe-html, strict-same msgctxt ":996" msgid "Erase the element pointed to by `position`." msgstr "Erase the element pointed to by `position`." #: :999 #, read-only, safe-html, strict-same msgctxt ":999" msgid "" "Throws:;; Only throws an exception if it is thrown by `hasher` or " "`key_equal`. + + In this implementation, this overload doesn't call either " "function object's methods so it is no throw, but this might not be true in " "other implementations. Notes:;; This method was implemented because " "returning an iterator to the next element from erase was expensive, but the " "container has been redesigned so that is no longer the case. So this method " "is now deprecated." msgstr "" "Throws:;; Only throws an exception if it is thrown by `hasher` or " "`key_equal`. + + In this implementation, this overload doesn't call either " "function object's methods so it is no throw, but this might not be true in " "other implementations. Notes:;; This method was implemented because " "returning an iterator to the next element from erase was expensive, but the " "container has been redesigned so that is no longer the case. So this method " "is now deprecated." #: :1004 #, read-only, safe-html, strict-same msgctxt ":1004" msgid "---" msgstr "---" #: :1006 #, read-only, safe-html, strict-same msgid "swap" msgstr "swap" #: :1007 #, read-only, safe-html, strict-same msgid "" "```c++ void swap(unordered_multiset&) noexcept" "(boost::allocator_traits::is_always_equal::value && " "boost::is_nothrow_swappable_v && boost::is_nothrow_swappable_v); " "```" msgstr "" "```c++ void swap(unordered_multiset&) noexcept" "(boost::allocator_traits::is_always_equal::value && " "boost::is_nothrow_swappable_v && boost::is_nothrow_swappable_v); " "```" #: :1014 #, 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." #: :1016 #, read-only, safe-html, strict-same msgctxt ":1016" 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." #: :1019 #, read-only, safe-html, strict-same msgid "" "Throws:;; Doesn't throw an exception unless it is thrown by the copy " "constructor or copy assignment operator of `key_equal` or `hasher`. Notes:;; " "The exception specifications aren't quite the same as the C++11 standard, as " "the equality predicate and hash function are swapped using their copy " "constructors." msgstr "" "Throws:;; Doesn't throw an exception unless it is thrown by the copy " "constructor or copy assignment operator of `key_equal` or `hasher`. Notes:;; " "The exception specifications aren't quite the same as the C++11 standard, as " "the equality predicate and hash function are swapped using their copy " "constructors." #: :1022 #, read-only, safe-html, strict-same msgctxt ":1022" msgid "---" msgstr "---" #: :1024 #, read-only, safe-html, strict-same msgid "clear" msgstr "clear" #: :1025 #, read-only, safe-html, strict-same msgid "```c++ void clear() noexcept; ```" msgstr "```c++ void clear() noexcept; ```" #: :1029 #, read-only, safe-html, strict-same msgid "Erases all elements in the container." msgstr "Erases all elements in the container." #: :1032 #, read-only, safe-html, strict-same msgid "Postconditions:;; `size() == 0` Throws:;; Never throws an exception." msgstr "Postconditions:;; `size() == 0` Throws:;; Never throws an exception." #: :1035 #, read-only, safe-html, strict-same msgctxt ":1035" msgid "---" msgstr "---" #: :1037 #, read-only, safe-html, strict-same msgid "merge" msgstr "merge" #: :1038 #, read-only, safe-html, strict-same msgid "" "```c++ template void merge(unordered_multiset& source); template void merge" "(unordered_multiset&& source); template void merge(unordered_set& source); " "template void merge(unordered_set" "&& source); ```" msgstr "" "```c++ template void merge(unordered_multiset& source); template void merge" "(unordered_multiset&& source); template void merge(unordered_set& source); " "template void merge(unordered_set" "&& source); ```" #: :1049 #, read-only, safe-html, strict-same msgid "" "Attempt to \"merge\" two containers by iterating `source` and extracting all " "nodes in `source` and inserting them into `*this`." msgstr "" "Attempt to \"merge\" two containers by iterating `source` and extracting all " "nodes in `source` and inserting them into `*this`." #: :1051 #, read-only, safe-html, strict-same msgid "" "Because `source` can have a different hash function and key equality " "predicate, the key of each node in `source` is rehashed using `this\\->" "hash_function()` and then, if required, compared using `this\\->key_eq()`." msgstr "" "Because `source` can have a different hash function and key equality " "predicate, the key of each node in `source` is rehashed using `this\\->" "hash_function()` and then, if required, compared using `this\\->key_eq()`." #: :1054 #, read-only, safe-html, strict-same msgid "" "The behavior of this function is undefined if `this\\->get_allocator() != " "source.get_allocator()`." msgstr "" "The behavior of this function is undefined if `this\\->get_allocator() != " "source.get_allocator()`." #: :1056 #, read-only, safe-html, strict-same msgid "" "This function does not copy or move any elements and instead simply " "relocates the nodes from `source` into `*this`." msgstr "" "This function does not copy or move any elements and instead simply " "relocates the nodes from `source` into `*this`." #: :1060 #, read-only, safe-html, strict-same msgid "Notes:;; + --" msgstr "Notes:;; + --" #: :1063 #, read-only, safe-html, strict-same msgid "Pointers and references to transferred elements remain valid." msgstr "Pointers and references to transferred elements remain valid." #: :1064 #, read-only, safe-html, strict-same msgid "Invalidates iterators to transferred elements." msgstr "Invalidates iterators to transferred elements." #: :1065 #, read-only, safe-html, strict-same msgid "Invalidates iterators belonging to `*this`." msgstr "Invalidates iterators belonging to `*this`." #: :1066 #, read-only, safe-html, strict-same msgid "Iterators to non-transferred elements in `source` remain valid." msgstr "Iterators to non-transferred elements in `source` remain valid." #: :1067 #, read-only, safe-html, strict-same msgid "--" msgstr "--" #: :1069 #, read-only, safe-html, strict-same msgctxt ":1069" msgid "---" msgstr "---" #: :1071 #, read-only, safe-html, strict-same msgid "Observers" msgstr "Observers" #: :1073 #, read-only, safe-html, strict-same msgid "get_allocator" msgstr "get_allocator" #: :1074 #, read-only, safe-html, strict-same msgid "``` allocator_type get_allocator() const noexcept; ```" msgstr "``` allocator_type get_allocator() const noexcept; ```" #: :1078 #, read-only, safe-html, strict-same msgctxt ":1078" msgid "---" msgstr "---" #: :1080 #, read-only, safe-html, strict-same msgid "hash_function" msgstr "hash_function" #: :1081 #, read-only, safe-html, strict-same msgid "``` hasher hash_function() const; ```" msgstr "``` hasher hash_function() const; ```" #: :1086 #, read-only, safe-html, strict-same msgid "Returns:;; The container's hash function." msgstr "Returns:;; The container's hash function." #: :1088 #, read-only, safe-html, strict-same msgctxt ":1088" msgid "---" msgstr "---" #: :1090 #, read-only, safe-html, strict-same msgid "key_eq" msgstr "key_eq" #: :1092 #, read-only, safe-html, strict-same msgid "``` key_equal key_eq() const; ```" msgstr "``` key_equal key_eq() const; ```" #: :1097 #, read-only, safe-html, strict-same msgid "Returns:;; The container's key equality predicate" msgstr "Returns:;; The container's key equality predicate" #: :1099 #, read-only, safe-html, strict-same msgctxt ":1099" msgid "---" msgstr "---" #: :1101 #, read-only, safe-html, strict-same msgid "Lookup" msgstr "Lookup" #: :1103 #, read-only, safe-html, strict-same msgid "find" msgstr "find" #: :1104 #, 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); " "template const_iterator find(const K& k) const; template " "iterator find(CompatibleKey const&, CompatibleHash const&, " "CompatiblePredicate const&); template const_iterator find" "(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&) " "const; ```" msgstr "" "```c++ iterator find(const key_type& k); const_iterator find(const " "key_type& k) const; template iterator find(const K& k); " "template const_iterator find(const K& k) const; template " "iterator find(CompatibleKey const&, CompatibleHash const&, " "CompatiblePredicate const&); template const_iterator find" "(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&) " "const; ```" #: :1120 #, read-only, safe-html, strict-same msgid "" "Returns:;; An iterator pointing to an element with key equivalent to `k`, or " "`b.end()` if no such element exists. Notes:;; The templated overloads " "containing `CompatibleKey`, `CompatibleHash` and `CompatiblePredicate` are " "non-standard extensions which allow you to use a compatible hash function " "and equality predicate for a key of a different type in order to avoid an " "expensive type cast. In general, its use is not encouraged and instead the " "`K` member function templates should be used. + + 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 " "`b.end()` if no such element exists. Notes:;; The templated overloads " "containing `CompatibleKey`, `CompatibleHash` and `CompatiblePredicate` are " "non-standard extensions which allow you to use a compatible hash function " "and equality predicate for a key of a different type in order to avoid an " "expensive type cast. In general, its use is not encouraged and instead the " "`K` member function templates should be used. + + 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." #: :1125 #, read-only, safe-html, strict-same msgctxt ":1125" msgid "---" msgstr "---" #: :1127 #, read-only, safe-html, strict-same msgid "count" msgstr "count" #: :1128 #, 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; ```" #: :1135 #, 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." #: :1138 #, read-only, safe-html, strict-same msgctxt ":1138" msgid "---" msgstr "---" #: :1140 #, read-only, safe-html, strict-same msgid "contains" msgstr "contains" #: :1141 #, 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; ```" #: :1148 #, 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." #: :1151 #, read-only, safe-html, strict-same msgctxt ":1151" msgid "---" msgstr "---" #: :1153 #, read-only, safe-html, strict-same msgid "equal_range" msgstr "equal_range" #: :1154 #, 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; ```" #: :1164 #, 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." #: :1167 #, read-only, safe-html, strict-same msgctxt ":1167" msgid "---" msgstr "---" #: :1169 #, read-only, safe-html, strict-same msgid "Bucket Interface" msgstr "Bucket Interface" #: :1171 #, read-only, safe-html, strict-same msgid "bucket_count" msgstr "bucket_count" #: :1172 #, read-only, safe-html, strict-same msgid "```c++ size_type bucket_count() const noexcept; ```" msgstr "```c++ size_type bucket_count() const noexcept; ```" #: :1177 #, read-only, safe-html, strict-same msgid "Returns:;; The number of buckets." msgstr "Returns:;; The number of buckets." #: :1179 #, read-only, safe-html, strict-same msgctxt ":1179" msgid "---" msgstr "---" #: :1181 #, read-only, safe-html, strict-same msgid "max_bucket_count" msgstr "max_bucket_count" #: :1182 #, read-only, safe-html, strict-same msgid "```c++ size_type max_bucket_count() const noexcept; ```" msgstr "```c++ size_type max_bucket_count() const noexcept; ```" #: :1187 #, read-only, safe-html, strict-same msgid "Returns:;; An upper bound on the number of buckets." msgstr "Returns:;; An upper bound on the number of buckets." #: :1189 #, read-only, safe-html, strict-same msgctxt ":1189" msgid "---" msgstr "---" #: :1191 #, read-only, safe-html, strict-same msgid "bucket_size" msgstr "bucket_size" #: :1192 #, read-only, safe-html, strict-same msgid "```c++ size_type bucket_size(size_type n) const; ```" msgstr "```c++ size_type bucket_size(size_type n) const; ```" #: :1197 #, read-only, safe-html, strict-same msgid "" "Requires:;; `n < bucket_count()` Returns:;; The number of elements in bucket " "`n`." msgstr "" "Requires:;; `n < bucket_count()` Returns:;; The number of elements in bucket " "`n`." #: :1200 #, read-only, safe-html, strict-same msgctxt ":1200" msgid "---" msgstr "---" #: :1202 #, read-only, safe-html, strict-same msgid "bucket" msgstr "bucket" #: :1203 #, read-only, safe-html, strict-same msgid "" "```c++ size_type bucket(const key_type& k) const; template " "size_type bucket(const K& k) const; ```" msgstr "" "```c++ size_type bucket(const key_type& k) const; template " "size_type bucket(const K& k) const; ```" #: :1209 #, read-only, safe-html, strict-same msgid "" "Returns:;; The index of the bucket which would contain an element with key " "`k`. Postconditions:;; The return value is less than `bucket_count()`. " "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 index of the bucket which would contain an element with key " "`k`. Postconditions:;; The return value is less than `bucket_count()`. " "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." #: :1213 #, read-only, safe-html, strict-same msgctxt ":1213" msgid "---" msgstr "---" #: :1215 #, read-only, safe-html, strict-same msgctxt ":1215" msgid "begin" msgstr "begin" #: :1217 #, read-only, safe-html, strict-same msgid "" "```c++ local_iterator begin(size_type n); const_local_iterator begin" "(size_type n) const; ```" msgstr "" "```c++ local_iterator begin(size_type n); const_local_iterator begin" "(size_type n) const; ```" #: :1223 #, read-only, safe-html, strict-same msgid "" "Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A " "local iterator pointing the first element in the bucket with index `n`." msgstr "" "Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A " "local iterator pointing the first element in the bucket with index `n`." #: :1226 #, read-only, safe-html, strict-same msgctxt ":1226" msgid "---" msgstr "---" #: :1228 #, read-only, safe-html, strict-same msgctxt ":1228" msgid "end" msgstr "end" #: :1229 #, read-only, safe-html, strict-same msgid "" "```c++ local_iterator end(size_type n); const_local_iterator end(size_type " "n) const; ```" msgstr "" "```c++ local_iterator end(size_type n); const_local_iterator end(size_type " "n) const; ```" #: :1235 #, read-only, safe-html, strict-same msgid "" "Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A " "local iterator pointing the 'one past the end' element in the bucket with " "index `n`." msgstr "" "Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A " "local iterator pointing the 'one past the end' element in the bucket with " "index `n`." #: :1238 #, read-only, safe-html, strict-same msgctxt ":1238" msgid "---" msgstr "---" #: :1240 #, read-only, safe-html, strict-same msgctxt ":1240" msgid "cbegin" msgstr "cbegin" #: :1241 #, read-only, safe-html, strict-same msgid "```c++ const_local_iterator cbegin(size_type n) const; ```" msgstr "```c++ const_local_iterator cbegin(size_type n) const; ```" #: :1246 #, read-only, safe-html, strict-same msgid "" "Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A " "constant local iterator pointing the first element in the bucket with index " "`n`." msgstr "" "Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A " "constant local iterator pointing the first element in the bucket with index " "`n`." #: :1249 #, read-only, safe-html, strict-same msgctxt ":1249" msgid "---" msgstr "---" #: :1251 #, read-only, safe-html, strict-same msgctxt ":1251" msgid "cend" msgstr "cend" #: :1252 #, read-only, safe-html, strict-same msgid "```c++ const_local_iterator cend(size_type n) const; ```" msgstr "```c++ const_local_iterator cend(size_type n) const; ```" #: :1257 #, read-only, safe-html, strict-same msgid "" "Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A " "constant local iterator pointing the 'one past the end' element in the " "bucket with index `n`." msgstr "" "Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A " "constant local iterator pointing the 'one past the end' element in the " "bucket with index `n`." #: :1260 #, read-only, safe-html, strict-same msgctxt ":1260" msgid "---" msgstr "---" #: :1262 #, read-only, safe-html, strict-same msgid "Hash Policy" msgstr "Hash Policy" #: :1264 #, read-only, safe-html, strict-same msgid "load_factor" msgstr "load_factor" #: :1265 #, read-only, safe-html, strict-same msgid "```c++ float load_factor() const noexcept; ```" msgstr "```c++ float load_factor() const noexcept; ```" #: :1270 #, read-only, safe-html, strict-same msgid "Returns:;; The average number of elements per bucket." msgstr "Returns:;; The average number of elements per bucket." #: :1272 #, read-only, safe-html, strict-same msgctxt ":1272" msgid "---" msgstr "---" #: :1274 #, read-only, safe-html, strict-same msgid "max_load_factor" msgstr "max_load_factor" #: :1276 #, read-only, safe-html, strict-same msgid "```c++ float max_load_factor() const noexcept; ```" msgstr "```c++ float max_load_factor() const noexcept; ```" #: :1281 #, read-only, safe-html, strict-same msgid "Returns:;; Returns the current maximum load factor." msgstr "Returns:;; Returns the current maximum load factor." #: :1283 #, read-only, safe-html, strict-same msgctxt ":1283" msgid "---" msgstr "---" #: :1285 #, read-only, safe-html, strict-same msgid "Set max_load_factor" msgstr "Set max_load_factor" #: :1286 #, read-only, safe-html, strict-same msgid "```c++ void max_load_factor(float z); ```" msgstr "```c++ void max_load_factor(float z); ```" #: :1291 #, read-only, safe-html, strict-same msgid "" "Effects:;; Changes the container's maximum load factor, using `z` as a hint." msgstr "" "Effects:;; Changes the container's maximum load factor, using `z` as a hint." #: :1293 #, read-only, safe-html, strict-same msgctxt ":1293" msgid "---" msgstr "---" #: :1295 #, read-only, safe-html, strict-same msgid "rehash" msgstr "rehash" #: :1296 #, read-only, safe-html, strict-same msgid "```c++ void rehash(size_type n); ```" msgstr "```c++ void rehash(size_type n); ```" #: :1300 #, read-only, safe-html, strict-same msgid "" "Changes the number of buckets 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 the number of buckets 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." #: :1302 #, read-only, safe-html, strict-same msgid "" "When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array." msgstr "" "When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array." #: :1304 #, read-only, safe-html, strict-same msgctxt ":1304" msgid "" "Invalidates iterators, and changes the order of elements. Pointers and " "references to elements are not invalidated." msgstr "" "Invalidates iterators, and changes the order of elements. Pointers and " "references to elements are not invalidated." #: :1307 #, read-only, safe-html, strict-same msgctxt ":1307" 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." #: :1309 #, read-only, safe-html, strict-same msgctxt ":1309" msgid "---" msgstr "---" #: :1311 #, read-only, safe-html, strict-same msgid "reserve" msgstr "reserve" #: :1312 #, read-only, safe-html, strict-same msgid "```c++ void reserve(size_type n); ```" msgstr "```c++ void reserve(size_type n); ```" #: :1316 #, read-only, safe-html, strict-same msgid "" "Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`, or `a.rehash(1)` if " "`n > 0` and `a.max_load_factor() == std::numeric_limits::infinity()`." msgstr "" "Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`, or `a.rehash(1)` if " "`n > 0` and `a.max_load_factor() == std::numeric_limits::infinity()`." #: :1318 #, 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." #: :1320 #, read-only, safe-html, strict-same msgctxt ":1320" msgid "" "Invalidates iterators, and changes the order of elements. Pointers and " "references to elements are not invalidated." msgstr "" "Invalidates iterators, and changes the order of elements. Pointers and " "references to elements are not invalidated." #: :1323 #, read-only, safe-html, strict-same msgctxt ":1323" 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." #: :1326 #, read-only, safe-html, strict-same msgctxt ":1326" msgid "---" msgstr "---" #: :1328 #, read-only, safe-html, strict-same msgid "Deduction Guides" msgstr "Deduction Guides" #: :1329 #, 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:" #: :1331 #, 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." #: :1336 #, 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." #: :1340 #, read-only, safe-html, strict-same msgid "__iter-value-type__" msgstr "__iter-value-type__" #: :1348 #, read-only, safe-html, strict-same msgid "Equality Comparisons" msgstr "Equality Comparisons" #: :1350 #, read-only, safe-html, strict-same msgid "operator" msgstr "operator" #: :1351 #, read-only, safe-html, strict-same msgid "" "```c++ template bool " "operator==(const unordered_multiset& x, const " "unordered_multiset& y); ```" msgstr "" "```c++ template bool " "operator==(const unordered_multiset& x, const " "unordered_multiset& y); ```" #: :1357 #, 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)." #: :1360 #, read-only, safe-html, strict-same msgctxt ":1360" 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." #: :1362 #, read-only, safe-html, strict-same msgctxt ":1362" msgid "---" msgstr "---" #: :1364 #, read-only, safe-html, strict-same msgid "operator!" msgstr "operator!" #: :1365 #, read-only, safe-html, strict-same msgid "" "```c++ template bool " "operator!=(const unordered_multiset& x, const " "unordered_multiset& y); ```" msgstr "" "```c++ template bool " "operator!=(const unordered_multiset& x, const " "unordered_multiset& y); ```" #: :1371 #, 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)." #: :1374 #, read-only, safe-html, strict-same msgctxt ":1374" 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." #: :1376 #, read-only, safe-html, strict-same msgctxt ":1376" msgid "---" msgstr "---" #: :1378 #, read-only, safe-html, strict-same msgid "Swap" msgstr "Swap" #: :1379 #, read-only, safe-html, strict-same msgid "" "```c++ template void swap" "(unordered_multiset& x, unordered_multiset& y) noexcept(noexcept(x.swap(y))); ```" msgstr "" "```c++ template void swap" "(unordered_multiset& x, unordered_multiset& y) noexcept(noexcept(x.swap(y))); ```" #: :1386 #, read-only, safe-html, strict-same msgid "Swaps the contents of `x` and `y`." msgstr "Swaps the contents of `x` and `y`." #: :1388 #, read-only, safe-html, strict-same msgctxt ":1388" 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." #: :1391 #, read-only, safe-html, strict-same msgid "" "Effects:;; `x.swap(y)` Throws:;; Doesn't throw an exception unless it is " "thrown by the copy constructor or copy assignment operator of `key_equal` or " "`hasher`. Notes:;; The exception specifications aren't quite the same as the " "C++11 standard, as the equality predicate and hash function are swapped " "using their copy constructors." msgstr "" "Effects:;; `x.swap(y)` Throws:;; Doesn't throw an exception unless it is " "thrown by the copy constructor or copy assignment operator of `key_equal` or " "`hasher`. Notes:;; The exception specifications aren't quite the same as the " "C++11 standard, as the equality predicate and hash function are swapped " "using their copy constructors." #: :1395 #, read-only, safe-html, strict-same msgctxt ":1395" msgid "---" msgstr "---" #: :1397 #, read-only, safe-html, strict-same msgid "erase_if" msgstr "erase_if" #: :1398 #, read-only, safe-html, strict-same msgid "" "```c++ template " "typename unordered_multiset::size_type erase_if" "(unordered_multiset& c, Predicate pred); ```" msgstr "" "```c++ template " "typename unordered_multiset::size_type erase_if" "(unordered_multiset& c, Predicate pred); ```" #: :1404 #, 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`." #: :1407 #, 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(); ```" 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(); ```" #: :1422 #, read-only, safe-html, strict-same msgid "Serialization" msgstr "Serialization" #: :1424 #, read-only, safe-html, strict-same msgid "" "``unordered_multiset``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_multiset``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." #: :1428 #, read-only, safe-html, strict-same msgid "Saving an unordered_multiset to an archive" msgstr "Saving an unordered_multiset to an archive" #: :1430 #, read-only, safe-html, strict-same msgid "" "Saves all the elements of an `unordered_multiset` `x` to an archive (XML " "archive) `ar`." msgstr "" "Saves all the elements of an `unordered_multiset` `x` to an archive (XML " "archive) `ar`." #: :1433 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is serializable (XML serializable), and it supports " "Boost.Serialization `save_construct_data`/`load_construct_data` protocol " "(automatically suported by https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^] types)." msgstr "" "Requires:;; `value_type` is serializable (XML serializable), and it supports " "Boost.Serialization `save_construct_data`/`load_construct_data` protocol " "(automatically suported by https://en.cppreference.com/w/cpp/named_req/" "DefaultConstructible[DefaultConstructible^] types)." #: :1439 #, read-only, safe-html, strict-same msgctxt ":1439" msgid "---" msgstr "---" #: :1441 #, read-only, safe-html, strict-same msgid "Loading an unordered_multiset from an archive" msgstr "Loading an unordered_multiset from an archive" #: :1443 #, read-only, safe-html, strict-same msgid "" "Deletes all preexisting elements of an `unordered_multiset` `x` and inserts " "from an archive (XML archive) `ar` restored copies of the elements of the " "original `unordered_multiset` `other` saved to the storage read by `ar`." msgstr "" "Deletes all preexisting elements of an `unordered_multiset` `x` and inserts " "from an archive (XML archive) `ar` restored copies of the elements of the " "original `unordered_multiset` `other` saved to the storage read by `ar`." #: :1448 #, read-only, safe-html, strict-same msgid "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]. `x.key_equal()` is functionally equivalent " "to `other.key_equal()`. Note:;; If the archive was saved using a release of " "Boost prior to Boost 1.84, the configuration macro " "`BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0` has to be globally " "defined for this operation to succeed; otherwise, an exception is thrown." msgstr "" "Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/" "MoveInsertable[MoveInsertable^]. `x.key_equal()` is functionally equivalent " "to `other.key_equal()`. Note:;; If the archive was saved using a release of " "Boost prior to Boost 1.84, the configuration macro " "`BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0` has to be globally " "defined for this operation to succeed; otherwise, an exception is thrown." #: :1454 #, read-only, safe-html, strict-same msgctxt ":1454" msgid "---" msgstr "---" #: :1456 #, read-only, safe-html, strict-same msgid "Saving an iterator/const_iterator to an archive" msgstr "Saving an iterator/const_iterator to an archive" #: :1458 #, 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." #: :1462 #, read-only, safe-html, strict-same msgid "" "Requires:;; The `unordered_multiset` `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_multiset` `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`." #: :1466 #, read-only, safe-html, strict-same msgctxt ":1466" msgid "---" msgstr "---" #: :1468 #, read-only, safe-html, strict-same msgid "Loading an iterator/const_iterator from an archive" msgstr "Loading an iterator/const_iterator from an archive" #: :1470 #, 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`." #: :1475 #, read-only, safe-html, strict-same msgid "" "Requires:;; If `x` is the `unordered_multiset` `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_multiset` `it` points to, no modifying " "operations have been issued on `x` between loading of `x` and loading of " "`it`."