Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Throws:;; Doesn't throw an exception unless it is thrown by …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:1267	---	---
	quick_erase	quick_erase
	```c++ void quick_erase(const_iterator position); ```	```c++ void quick_erase(const_iterator position); ```
:1274	Erase the element pointed to by `position`.	擦除 `position` 所指向的元素。
:1277	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.	抛出：;; 仅当由 `hasher` 或 `key_equal` 抛出异常时才会抛出异常。在此实现中，此重载不会调用任一函数对象的方法，因此不会抛出异常，但在其他实现中可能并非如此。备注：;; 之所以实现此方法，是因为从 `erase` 返回下一个元素的迭代器开销较大，但容器已经过重新设计，情况不再如此。因此，此方法现已废弃。
:1282	---	---
	erase_return_void	erase_return_void
	```c++ void erase_return_void(const_iterator position); ```	```c++ void erase_return_void(const_iterator position); ```
:1289	Erase the element pointed to by `position`.	删除 `position` 所指向的元素。
:1292	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.	抛出：;; 仅当由 `hasher` 或 `key_equal` 抛出异常时才会抛出异常。在此实现中，此重载不会调用任一函数对象的方法，因此不会抛出异常，但在其他实现中可能并非如此。备注：;; 之所以实现此方法，是因为从 `erase` 返回下一个元素的迭代器开销较大，但容器已经过重新设计，情况不再如此。因此，此方法现已废弃。
:1297	---	---
	swap	交换
	```c++ void swap(unordered_map& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value && boost::is_nothrow_swappable_v<Hash> && boost::is_nothrow_swappable_v<Pred>); ```	```c++ void swap(unordered_map& other) noexcept(boost::allocator_traits<allocator>::is_always_equal::value && boost::is_nothrow_swappable_v<hash> && boost::is_nothrow_swappable_v<pred>); ```</pred></hash></allocator>
	Swaps the contents of the container with the parameter.	将容器的内容与参数进行交换。
:1309	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.	如果 `Allocator::propagate_on_container_swap` 已声明且 `Allocator::propagate_on_container_swap::value` 为 `true`，则交换两个容器的分配器。否则，使用不相等的分配器进行交换将导致未定义行为。
	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.	抛出：;; 除非由 `key_equal` 或 `hasher` 的复制构造函数或复制赋值运算符抛出异常，否则不会抛出异常。备注：;; 异常规范与 C++11 标准不完全相同，因为相等谓词和哈希函数是通过它们的复制构造函数进行交换的。
:1315	---	---
	clear	清空
	```c++ void clear(); ```	```c++ void clear(); ```
	Erases all elements in the container.	清除容器中的所有元素。
	Postconditions:;; `size() == 0` Throws:;; Never throws an exception.	后置条件：;; `size() == 0`抛出：;; 永不抛出异常。
:1328	---	---
	merge	合并
	```c++ template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> void merge(unordered_map<key, t,="" h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_map<key, t,="" h2,="" p2,="" allocator="">&& source); template<class h2,="" class="" p2=""> void merge(unordered_multimap<key, t,="" h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_multimap<key, t,="" h2,="" p2,="" allocator="">&& source); ```</key,></class></key,></class></key,></class></key,></class>
	Attempt to "merge" two containers by iterating `source` and extracting any node in `source` that is not contained in `this` and then inserting it into `this`.	尝试通过迭代 `source` 并提取 `source` 中不包含在 `this` 内的任何节点，然后将其插入到 `this` 中，从而实现两个容器的“合并”。
	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()`.	由于 `source` 可能具有不同的哈希函数和键相等谓词，因此 `source` 中每个节点的键都将使用 `this->hash_function()` 重新计算哈希值，然后根据需要再使用 `this->key_eq()` 进行比较。
	The behavior of this function is undefined if `this\->get_allocator() != source.get_allocator()`.	如果 `this->get_allocator() != source.get_allocator()`，则此函数的行为未定义。
	This function does not copy or move any elements and instead simply relocates the nodes from `source` into `*this`.	此函数不会复制或移动任何元素，而只是将节点从 `source` 重新定位到 `*this` 中。
	Notes:;; + --	注意:;; + --
	Pointers and references to transferred elements remain valid.	指向被转移元素的指针和引用保持有效。
	Invalidates iterators to transferred elements.	使指向被转移元素的迭代器失效。

	English	Chinese (Simplified Han script)	Actions
	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.	构造一个至少包含 `n` 个桶的空容器，使用 `a` 作为分配器，使用默认的哈希函数、默认的键相等谓词以及最大负载因子 `1.0`，并将 `[f, l)` 范围内的元素插入其中。
	Iterator Range Constructor with Bucket Count and Hasher	带桶数和哈希函数的迭代器范围构造函数
	Loading an iterator/const_iterator from an archive	从归档中加载迭代器/常量迭代器
	Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty returns `end()`. + + If there was already an element in the container with an equivalent key returns an iterator pointing to that. + + 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_multimap`.	要求：`nh` 为空或 `nh.get_allocator()` 等于容器的分配器。返回：如果 `nh` 为空，则返回 `end()`。如果容器中已存在具有等价键的元素，则返回指向该元素的迭代器。否则返回指向新插入元素的迭代器。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。此函数可用于插入从兼容的 `unordered_multimap` 中提取的节点。
	Erase by Position	通过位置擦除
	```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```	```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```
	Swaps the contents of the container with the parameter.	将容器的内容与参数进行交换。
	Erase by Key	通过键擦除
	```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& k); ```	```c++ size_type erase(const key_type& k); template<class k=""> size_type erase(K&& k); ```</class>
	Erase all elements with key equivalent to `k`.	擦除所有键与 `k` 等价的元素。
	Erase Range	范围擦除
	```c++ iterator erase(const_iterator first, const_iterator last); ```	```c++ iterator erase(const_iterator first, const_iterator last); ```
	Erases the elements in the range from `first` to `last`.	擦除从 `first` 到 `last` 范围内的元素。
	erase_return_void	erase_return_void
	```c++ void erase_return_void(const_iterator position); ```	```c++ void erase_return_void(const_iterator position); ```
	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.	抛出：;; 除非由 `key_equal` 或 `hasher` 的复制构造函数或复制赋值运算符抛出异常，否则不会抛出异常。备注：;; 异常规范与 C++11 标准不完全相同，因为相等谓词和哈希函数是通过它们的复制构造函数进行交换的。
	clear	清空
	```c++ void clear(); ```	```c++ void clear(); ```
	Erases all elements in the container.	清除容器中的所有元素。
	Postconditions:;; `size() == 0` Throws:;; Never throws an exception.	后置条件：;; `size() == 0`抛出：;; 永不抛出异常。
	```c++ template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> void merge(unordered_map<key, t,="" h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_map<key, t,="" h2,="" p2,="" allocator="">&& source); template<class h2,="" class="" p2=""> void merge(unordered_multimap<key, t,="" h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_multimap<key, t,="" h2,="" p2,="" allocator="">&& source); ```</key,></class></key,></class></key,></class></key,></class>
	The behavior of this function is undefined if `this\->get_allocator() != source.get_allocator()`.	如果 `this->get_allocator() != source.get_allocator()`，则此函数的行为未定义。
	```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class K> iterator find(const K& k); template<class K> const_iterator find(const K& k) const; template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> iterator find(CompatibleKey const& k, CompatibleHash const& hash, CompatiblePredicate const& eq); template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> const_iterator find(CompatibleKey const& k, CompatibleHash const& hash, CompatiblePredicate const& eq) const;	```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class k=""> iterator find(const K& k); template<class k=""> const_iterator find(const K& k) const; template<typename compatiblekey,="" typename="" compatiblehash,="" compatiblepredicate=""> iterator find(CompatibleKey const& k, CompatibleHash const& hash, CompatiblePredicate const& eq); template<typename compatiblekey,="" typename="" compatiblehash,="" compatiblepredicate=""> const_iterator find(CompatibleKey const& k, CompatibleHash const& hash, CompatiblePredicate const& eq) const;</typename></typename></class></class>
	Returns:;; The number of elements with key equivalent to `k`. Notes:;; The `template<class K>` 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.	返回：;; 键与 `k` 等价的元素个数。备注：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时，`template<class k="">` 重载才会参与重载决议。库假定 `Hash` 可同时以 `K` 和 `Key` 类型调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型的开销。</class>
	equal_range	equal_range
	```c++ size_type max_bucket_count() const noexcept; ```	```c++ size_type max_bucket_count() const noexcept; ```
	```c++ unordered_map(std::initializer_list<value_type> il, const allocator_type& a); ```	```c++ unordered_map(std::initializer_list<value_type> il, const allocator_type& a); ```</value_type>
	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<class K>` 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.	返回：;; 一个范围，包含所有键与 `k` 等价的元素。若容器中不包含任何此类元素，则返回 `std::make_pair(b.end(), b.end())`。备注：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时，`template<class k="">` 重载才会参与重载决议。库假定 `Hash` 可同时以 `K` 和 `Key` 类型调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型的开销。</class>
	operator++[++++]++	operator++[++++]++
	Returns:;; A reference to `x.second` where `x` is the (unique) element whose key is equivalent to `k`. Throws:;; An exception object of type `std::out_of_range` if no such element is present. Notes:;; The `template<class K>` 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.	返回：;; 指向 `x.second` 的引用，其中 `x` 是键与 `k` 等价的（唯一）元素。抛出：;; 如果不存在这样的元素，则抛出 `std::out_of_range` 类型的异常对象。备注：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时，`template<class k="">` 重载才会参与重载决议。库假定 `Hash` 可同时以 `K` 和 `Key` 类型调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型的开销。</class>

Loading…

admin

Translation uploaded

English

Chinese (Simplified Han script) 272 characters editedCurrent translationState: Translated

~~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.~~ 的复制构造函数或复制赋值运算符抛出异常，否则不会抛出异常。
备注：;; 异常规范与 C++11 标准不完全相同，因为相等谓词和哈希函数是通过它们的复制构造函数进行交换的。

06/05/2026

admin

String added in the repository

English

Chinese (Simplified Han script) 306 characters editedPrevious translationState: Needs editing (Needs rewriting)

06/05/2026

Browse all string changes

Things to check

Mismatching line breaks

Number of new lines in translation does not match source.

Reset

Glossary

English	Chinese (Simplified Han script)
No related strings found in the glossary.

String information

Flags

safe-html, strict-same

Unit identifier

55710

Source string location

:1312

String age

06/05/2026

Last updated

06/06/2026

Source string age

06/05/2026

Translation file AsciiDoc file

doc/modules/ROOT/pages/reference/unordered_map_zh_Hans.adoc, string 328

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.

Translation

Things to check

Mismatching line breaks

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file