Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: - It has an `InputIterator` template parameter and a type …

Zen

Translation

English

- 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.

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	rehash	重哈希
	```c++ void rehash(size_type n); ```	```c++ void rehash(size_type n); ```
	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.	改变桶的数量，使得至少包含 `n` 个桶，并且使得负载因子小于或等于最大负载因子。在适用的情况下，这将增大或缩小与容器相关联的 `bucket_count()`。
	When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array.	当 `size() == 0` 时，`rehash(0)` 将释放底层桶数组的内存。
:1633	Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.	使迭代器失效，并改变元素的顺序。指向元素的指针和引用不会失效。
:1636	Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.	抛出：;; 如果抛出异常（除非是由容器的哈希函数或比较函数抛出），则该函数无效。
:1638	---	---
	reserve	保留
	```c++ void reserve(size_type n); ```	```c++ void reserve(size_type n); ```
	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<float>::infinity()`.	等价于 `a.rehash(ceil(n / a.max_load_factor()))`；如果 `n > 0` 且 `a.max_load_factor() == std::numeric_limits<float>::infinity()`，则等价于 `a.rehash(1)`。</float>
	Similar to `rehash`, this function can be used to grow or shrink the number of buckets in the container.	与 `rehash` 类似，此函数可用于增加或减少容器中桶的数量。
:1649	Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.	使迭代器失效，并改变元素的顺序。指向元素的指针和引用不会失效。
:1652	Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.	抛出：;; 如果抛出异常（除非是由容器的哈希函数或比较函数抛出），则该函数无效。
	Deduction Guides	推导指引
	A deduction guide will not participate in overload resolution if any of the following are true:	在以下任一条件成立时，推导指引将不参与重载决议：
	- 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.	- 它具有 `InputIterator` 模板参数，并且为该参数推导出的类型不符合输入迭代器的要求。 - 它具有 `Allocator` 模板参数，并且为该参数推导出的类型不符合分配器的要求。 - 它具有 `Hash` 模板参数，并且为该参数推导出的是整数类型或符合分配器要求的类型。 - 它具有 `Pred` 模板参数，并且为该参数推导出的是符合分配器要求的类型。
	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.	推导指引中的 `size_type` 参数类型指向由该推导指引所推导出的容器类型的 `size_type` 成员类型。其默认值与所选构造函数的默认值一致。
	__iter-value-type__	_iter-value-type_
	__iter-key-type__	__iter-key-type__
	__iter-mapped-type__	__iter-mapped-type__
	__iter-to-alloc-type__	__iter-to-alloc-type__
	Equality Comparisons	相等性比较
	operator	operator
	```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x, const unordered_map<Key, T, Hash, Pred, Alloc>& y); ```	```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> bool operator==(const unordered_map<key, t,="" hash,="" pred,="" alloc="">& x, const unordered_map<key, t,="" hash,="" pred,="" alloc="">& y); ```</key,></key,></class>
	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).	如果 `x.size() == y.size()` 并且对于 `x` 中的每个元素，在 `y` 中都有一个具有相同键且值相等的元素（使用 `operator==` 比较值类型），则返回 `true`。
:1711	Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.	备注：;; 如果两个容器不具有等价的相等谓词，则行为未定义。
:1713	---	---
	operator!	operator!
	```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x, const unordered_map<Key, T, Hash, Pred, Alloc>& y); ```	```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> bool operator!=(const unordered_map<key, t,="" hash,="" pred,="" alloc="">& x, const unordered_map<key, t,="" hash,="" pred,="" alloc="">& y); ```</key,></key,></class>
	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).	如果 `x.size() == y.size()` 并且对于 `x` 中的每个元素，在 `y` 中都有一个具有相同键且值相等的元素（使用 `operator==` 比较值类型），则返回 `false`。
:1725	Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.	备注：;; 如果两个容器不具有等价的相等谓词，则行为未定义。

	English	Chinese (Simplified Han script)	Actions
	swap	交换
	```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>
	```c++ unordered_map(std::initializer_list<value_type> il, size_type n, const allocator_type& a); ```	```c++ unordered_map(std::initializer_list<value_type> il, size_type n, const allocator_type& a); ```</value_type>
	initializer_list Constructor with Bucket Count and Hasher and Allocator	带桶数、哈希函数和分配器的初始化列表构造函数
	```c++ unordered_map(std::initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a); ```	```c++ unordered_map(std::initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a); ```</value_type>
	```c++ local_iterator begin(size_type n); const_local_iterator begin(size_type n) const; ```	```c++ local_iterator begin(size_type n); const_local_iterator begin(size_type n) const; ```
	- 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.	- 它具有 `InputIterator` 模板参数，并且为该参数推导出的类型不符合输入迭代器的要求。 - 它具有 `Allocator` 模板参数，并且为该参数推导出的类型不符合分配器的要求。 - 它具有 `Hash` 模板参数，并且为该参数推导出的是整数类型或符合分配器要求的类型。 - 它具有 `Pred` 模板参数，并且为该参数推导出的是符合分配器要求的类型。
	__iter-key-type__	__iter-key-type__
	Returns:;; The number of erased elements. Notes:;; Equivalent to: + + ```c++ auto original_size = c.size(); for (auto i = c.begin(), last = c.end(); i != last; ) { if (pred(*i)) { i = c.erase(i); } else { ++i; } } return original_size - c.size(); ``` + Note that the references passed to `pred` are non-const.	返回：;; 被移除的元素数量。备注：;; 等价于：```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();```注意，传递给 `pred` 的引用是非常量的。
	``unordered_map``s can be archived/retrieved by means of link:../../../../../serialization/index.html[Boost.Serialization^] using the API provided by this library. Both regular and XML archives are supported.	`unordered_map` 可以通过本库提供的 API，使用 link:../../../../../serialization/index.html[Boost.Serialization^] 进行归档/恢复。支持常规归档和 XML 归档。
	Requires:;; `std::remove_const<key_type>::type` and `std::remove_const<mapped_type>::type` are serializable (XML serializable), and they do support Boost.Serialization `save_construct_data`/`load_construct_data` protocol (automatically suported by https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^] types).	要求：;; `std::remove_const<key_type>::type` 和 `std::remove_const<mapped_type>::type` 必须是可序列化的（支持 XML 序列化），并且它们支持 Boost.Serialization 的 `save_construct_data`/`load_construct_data` 协议（该协议由 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^] 类型的自动支持）。</mapped_type></key_type>
	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.	构造一个至少包含 n 个桶的空容器，使用 hf 作为哈希函数，a 作为分配器，最大负载因子为 1.0，并将 il 中的元素插入其中。
	Destructor	析构函数
	```c++ ~unordered_map(); ```	```c++ ~unordered_map(); ```
	Note:;; The destructor is applied to every element, and all memory is deallocated	注意：析构函数会应用于每个元素，并且所有内存都会被释放。
	Assignment	赋值操作
	Copy Assignment	复制赋值
	The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.	赋值运算符。拷贝所包含的元素、哈希函数、谓词和最大负载因子，但不拷贝分配器。
	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.	如果 `Alloc::propagate_on_container_copy_assignment` 存在且 `Alloc::propagate_on_container_copy_assignment::value` 为 `true`，则分配器会被覆盖；否则，拷贝的元素将使用现有的分配器创建。
	Move Assignment	移动赋值
	```c++ unordered_map& operator=(unordered_map&& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value && boost::is_nothrow_move_assignable_v<Hash> && boost::is_nothrow_move_assignable_v<Pred>); ``` The move assignment operator.	```c++ unordered_map& operator=(unordered_map&& other) noexcept(boost::allocator_traits<allocator>::is_always_equal::value && boost::is_nothrow_move_assignable_v<hash> && boost::is_nothrow_move_assignable_v<pred>); ``` The move assignment operator.</pred></hash></allocator>

Loading…

admin

Translation uploaded

English

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

- ~~It has an~~它具有 ÌnputIterator` template parameter and a type that does not qualify as an input iterator is deduced for that parameter. - It has an Àllocator` 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.模板参数，并且为该参数推导出的类型不符合输入迭代器的要求。
- 它具有 Àllocator` 模板参数，并且为该参数推导出的类型不符合分配器的要求。
- 它具有 `Hash` 模板参数，并且为该参数推导出的是整数类型或符合分配器要求的类型。
- 它具有 `Pred` 模板参数，并且为该参数推导出的是符合分配器要求的类型。

06/05/2026

admin

String added in the repository

English

Chinese (Simplified Han script) 494 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

55829

Source string location

:1657

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 447

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