Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Node Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Returns:;; An iterator pointing to an element with key equivalent …

Zen

Translation

English

Returns:;; An iterator pointing to an element with key equivalent to `k`, or `end()` if no such element exists. 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.

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	``` allocator_type get_allocator() const noexcept; ```	``` allocator_type get_allocator() const noexcept; ```
	Returns:;; The container's allocator.	返回：容器的分配器。
:1278	---	---
	hash_function	哈希函数
	``` hasher hash_function() const; ```	``` hasher hash_function() const; ```
	Returns:;; The container's hash function.	返回：容器的哈希函数。
:1288	---	---
	key_eq	key_eq
	``` key_equal key_eq() const; ```	``` key_equal key_eq() const; ```
	Returns:;; The container's key equality predicate	返回：容器的键相等谓词。
:1298	---	---
	Lookup	查找
	find	find
	```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class K> iterator find(const K& k);	```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class k=""> iterator find(const K& k);</class>
	```	```
	Returns:;; An iterator pointing to an element with key equivalent to `k`, or `end()` if no such element exists. 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` 等价的元素的迭代器；如果不存在这样的元素，则返回 `end()`。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1315	---	---
	count	count
	```c++ size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; ```	```c++ size_type count(const key_type& k) const; template<class k=""> size_type count(const K& k) const; ```</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` 等价的元素数量。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1328	---	---
	contains	包含
	```c++ bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; ```	```c++ bool contains(const key_type& k) const; template<class k=""> bool contains(const K& k) const; ```</class>
	Returns:;; A boolean indicating whether or not there is an element with key equal to `key` in the container 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.	返回：一个布尔值，指示容器中是否存在键等于 `key` 的元素。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1341	---	---
	equal_range	equal_range
	```c++ std::pair<iterator, iterator> equal_range(const key_type& k); std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const; template<class K> std::pair<iterator, iterator> equal_range(const K& k); template<class K> std::pair<const_iterator, const_iterator> equal_range(const K& k) const; ```	```c++ std::pair<iterator, iterator=""> equal_range(const key_type& k); std::pair<const_iterator, const_iterator=""> equal_range(const key_type& k) const; template<class k=""> std::pair<iterator, iterator=""> equal_range(const K& k); template<class k=""> std::pair<const_iterator, const_iterator=""> equal_range(const K& k) const; ```</const_iterator,></class></iterator,></class></const_iterator,></iterator,>
	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())`。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1357	---	---
	operator++[++++]++	operator++[++++]++
	```c++ mapped_type& operator[](const key_type& k); mapped_type& operator[](key_type&& k); template<class K> mapped_type& operator[](K&& k); ```	```c++ mapped_type& operator[](const key_type& k); mapped_type& operator[](key_type&& k); template<class k=""> mapped_type& operator[](K&& k); ```</class>

	English	Chinese (Simplified Han script)	Actions
	Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * bucket_count()`	后置条件：`size() == 0`，`max_load() >= max_load_factor() * bucket_count()`
	merge	合并
	```c++ template<class H2, class P2> void merge(unordered_node_map<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_node_map<Key, T, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> void merge(unordered_node_map<key, t,="" h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_node_map<key, t,="" h2,="" p2,="" allocator="">&& source); ```</key,></class></key,></class>
	Observers	观察器
	get_allocator	get_allocator
	``` allocator_type get_allocator() const noexcept; ```	``` allocator_type get_allocator() const noexcept; ```
	Returns:;; The container's allocator.	返回：容器的分配器。
	hash_function	哈希函数
	``` hasher hash_function() const; ```	``` hasher hash_function() const; ```
	Returns:;; The container's hash function.	返回：容器的哈希函数。
	key_eq	key_eq
	``` key_equal key_eq() const; ```	``` key_equal key_eq() const; ```
	find	find
	```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class K> iterator find(const K& k);	```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class k=""> iterator find(const K& k);</class>
	```	```
	Returns:;; An iterator pointing to an element with key equivalent to `k`, or `end()` if no such element exists. 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` 等价的元素的迭代器；如果不存在这样的元素，则返回 `end()`。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	count	count
	```c++ size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; ```	```c++ size_type count(const key_type& k) const; template<class k=""> size_type count(const K& k) const; ```</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` 等价的元素数量。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	contains	包含
	```c++ bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; ```	```c++ bool contains(const key_type& k) const; template<class k=""> bool contains(const K& k) const; ```</class>
	Returns:;; A boolean indicating whether or not there is an element with key equal to `key` in the container 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.	返回：一个布尔值，指示容器中是否存在键等于 `key` 的元素。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	equal_range	equal_range
	```c++ std::pair<iterator, iterator> equal_range(const key_type& k); std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const; template<class K> std::pair<iterator, iterator> equal_range(const K& k); template<class K> std::pair<const_iterator, const_iterator> equal_range(const K& k) const; ```	```c++ std::pair<iterator, iterator=""> equal_range(const key_type& k); std::pair<const_iterator, const_iterator=""> equal_range(const key_type& k) const; template<class k=""> std::pair<iterator, iterator=""> equal_range(const K& k); template<class k=""> std::pair<const_iterator, const_iterator=""> equal_range(const K& k) const; ```</const_iterator,></class></iterator,></class></const_iterator,></iterator,>
	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())`。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	operator++[++++]++	operator++[++++]++
	```c++ mapped_type& operator[](const key_type& k); mapped_type& operator[](key_type&& k); template<class K> mapped_type& operator[](K&& k); ```	```c++ mapped_type& operator[](const key_type& k); mapped_type& operator[](key_type&& k); template<class k=""> mapped_type& operator[](K&& k); ```</class>
	Effects:;; If the container does not already contain an element with a key equivalent to `k`, inserts the value `std::pair<key_type const, mapped_type>(k, mapped_type())`. Returns:;; A reference to `x.second` where `x` is the element already in the container, or the newly inserted element with a key equivalent to `k`. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load. + + The `template<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` 等价的元素，则插入值 `std::pair<key_type const,="" mapped_type="">(k, mapped_type())`。返回：对 `x.second` 的引用，其中 `x` 是容器中已存在的元素，或是新插入的键与 `k` 等价的元素。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。 `template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class></key_type>
	at	at
	```c++ mapped_type& at(const key_type& k); const mapped_type& at(const key_type& k) const; template<class K> mapped_type& at(const K& k); template<class K> const mapped_type& at(const K& k) const; ```	```c++ mapped_type& at(const key_type& k); const mapped_type& at(const key_type& k) const; template<class k=""> mapped_type& at(const K& k); template<class k=""> const mapped_type& at(const K& k) const; ```</class></class>

Loading…

admin

Translation uploaded

English

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

~~Returns:;; An iterator pointing to an element with key equivalent to `k`, or `end()` if no such element exists. Notes:;; The `template<class K>` overloads only participate in overload resolution if~~返回：指向键与 `k` 等价的元素的迭代器；如果不存在这样的元素，则返回 `end()`。
注意：`template<class k="">` 重载仅在 `Hash::is_transparent` ~~and~~和 `Pred::is_transparent` ~~are valid member typedefs. The library assumes that `Hash` is callable with both~~是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` ~~and~~和 `Key` ~~and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.~~调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>

06/05/2026

admin

String added in the repository

English

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

06/05/2026

Browse all string changes

Things to check

Double space

Translation contains double space.

Fix string

Reset

Mismatched full stop

Source and translation do not both end with a full stop.

Reset

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

53089

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_node_map_zh_Hans.adoc, string 336

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

Double space

Mismatched full stop

Mismatching line breaks

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file