Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: The standard is fairly vague on the meaning of the …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:991	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) ```	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<k>(k)), std::forward_as_tuple(std::forward<args>(args)...)) ```</args></k>
	instead of xref:#unordered_map_emplace[emplace] which simply forwards all arguments to ``value_type``'s constructor.	而不是像 xref:#unordered_map_emplace[emplace] 那样简单地将所有参数转发给 `value_type` 的构造函数。
:998	Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.	可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。
:1000	Pointers and references to elements are never invalidated.	指向元素的指针和引用永远不会失效。
:1002	The `template<class K, class\... Args>` 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. --	`template<class k,="" args="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1005	---	---
	try_emplace with Hint	带提示位置的 `try_emplace`
	```c++ template<class... Args> iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); template<class... Args> iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args); template<class K, class... Args> iterator try_emplace(const_iterator hint, K&& k, Args&&... args); ```	```c++ template<class... args=""> iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); template<class... args=""> iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args); template<class k,="" class...="" args=""> iterator try_emplace(const_iterator hint, K&& k, Args&&... args); ```</class></class...></class...>
:1017	Inserts a new element into the container if there is no existing element with key `k` contained within it.	如果容器中不存在键为 `k` 的元素，则插入一个新元素。
:1019	If there is an existing element with key `k` this function does nothing.	如果已存在键为 `k` 的元素，则该函数不执行任何操作。
:1021	`hint` is a suggestion to where the element should be inserted.	`hint` 是关于元素插入位置的建议。
	Returns:;; If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; This function is similiar to xref:#unordered_map_emplace_hint[emplace_hint] except the `value_type` is constructed using: + + -- ```c++	返回：如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：此函数类似于 xref:#unordered_map_emplace_hint[emplace_hint]，区别在于 `value_type` 的构造方式如下： ```c++
:1031	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Key>(k)), std::forward_as_tuple(std::forward<Args>(args)...))	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<key>(k)), std::forward_as_tuple(std::forward<args>(args)...))</args></key>
:1036	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) ```	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<k>(k)), std::forward_as_tuple(std::forward<args>(args)...)) ```</args></k>
	instead of xref:#unordered_map_emplace_hint[emplace_hint] which simply forwards all arguments to ``value_type``'s constructor.	而不是像 xref:#unordered_map_emplace_hint[emplace_hint] 那样简单地将所有参数转发给 `value_type` 的构造函数。
	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.	标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。
:1045	Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.	可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。
:1047	Pointers and references to elements are never invalidated.	指向元素的指针和引用永远不会失效。
:1049	The `template<class K, class\... Args>` 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. --	`template<class k,="" args="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1052	---	---
	insert_or_assign	insert_or_assign
	```c++ template<class M> std::pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj); template<class M> std::pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj); template<class K, class M> std::pair<iterator, bool> insert_or_assign(K&& k, M&& obj); ```	```c++ template<class m=""> std::pair<iterator, bool=""> insert_or_assign(const key_type& k, M&& obj); template<class m=""> std::pair<iterator, bool=""> insert_or_assign(key_type&& k, M&& obj); template<class k,="" class="" m=""> std::pair<iterator, bool=""> insert_or_assign(K&& k, M&& obj); ```</iterator,></class></iterator,></class></iterator,></class>
:1064	Inserts a new element into the container or updates an existing one by assigning to the contained value.	向容器中插入一个新元素，或通过赋值更新现有元素的值。
:1066	If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.	如果存在键为 `k` 的元素，则通过赋值 `std::forward<m>(obj)` 来更新它。</m>
:1068	If there is no such element, it is added to the container as: ```c++	如果不存在这样的元素，则将其添加到容器中，形式为： ```c++
:1071	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Key>(k)), std::forward_as_tuple(std::forward<M>(obj)))	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<key>(k)), std::forward_as_tuple(std::forward<m>(obj)))</m></key>
:1076	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<M>(obj))) ```	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<k>(k)), std::forward_as_tuple(std::forward<m>(obj))) ```</m></k>
	Returns:;; The bool component of the return type is true if an insert took place. + + If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + The `template<class K, class M>` 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.	返回：返回类型的 bool 分量为 true 表示发生了插入。如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。 `template<class k,="" class="" m="">` 仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1092	---	---
	insert_or_assign with Hint	带提示位置的 `insert_or_assign`
	```c++ template<class M> iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj); template<class M> iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj); template<class K, class M> iterator insert_or_assign(const_iterator hint, K&& k, M&& obj); ```	```c++ template<class m=""> iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj); template<class m=""> iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj); template<class k,="" class="" m=""> iterator insert_or_assign(const_iterator hint, K&& k, M&& obj); ```</class></class></class>

	English	Chinese (Simplified Han script)	Actions
	initializer_list Constructor with Bucket Count and Allocator	带桶数和分配器的初始化列表构造函数
	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.	构造一个至少包含 `n` 个桶的空容器，使用 `a` 作为分配器，最大负载因子为 `1.0`，并将 `il` 中的元素插入其中。
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `args`. Returns:;; If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; 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. + + If `args...` is of the form `k,v`, it delays constructing the whole object until it is certain that an element should be inserted, using only the `k` argument to check. This optimization happens when the map's `key_type` is move constructible or when the `k` argument is a `key_type`.	要求：`value_type` 必须可以从 `args` 出发在 `X` 中进行 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[可原位构造^]。返回：如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。如果 `args...` 的形式为 `k,v`，则该函数会延迟构造整个对象，直到确定应该插入元素为止，仅使用 `k` 参数进行检查。当映射的 `key_type` 可移动构造或 `k` 参数本身就是 `key_type` 类型时，此优化生效。
	```c++ std::pair<iterator, bool> insert(const value_type& obj); ```	```c++ std::pair<iterator, bool=""> insert(const value_type& obj); ```</iterator,>
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. Returns:;; The bool component of the return type is true if an insert took place. + + If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated.	要求：`value_type` 满足 https://en.cppreference.com/w/cpp/named_req/CopyInsertable[可拷贝插入^]。返回：返回类型的 bool 分量为 true 表示发生了插入。如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。
	Move Insert	移动插入
	Emplace Insert with Hint	带提示的原地插入
	```c++ template<class P> iterator insert(const_iterator hint, P&& obj); ```	```c++ template<class p=""> iterator insert(const_iterator hint, P&& obj); ```</class>
	Inserts an element into the container by performing `emplace_hint(hint, std::forward<P>(value))`.	通过执行 `emplace_hint(hint, std::forward<p>(value))` 向容器中插入一个元素。</p>
	```c++ template<class InputIterator> void insert(InputIterator first, InputIterator last); ```	```c++ template<class inputiterator=""> void insert(InputIterator first, InputIterator last); ```</class>
	Insert Initializer List	初始化列表插入
	```c++ void insert(std::initializer_list<value_type>); ```	```c++ void insert(std::initializer_list<value_type>); ```</value_type>
	```c++ template<class... Args> std::pair<iterator, bool> try_emplace(const key_type& k, Args&&... args); template<class... Args> std::pair<iterator, bool> try_emplace(key_type&& k, Args&&... args); template<class K, class... Args> std::pair<iterator, bool> try_emplace(K&& k, Args&&... args) ```	```c++ template<class... args=""> std::pair<iterator, bool=""> try_emplace(const key_type& k, Args&&... args); template<class... args=""> std::pair<iterator, bool=""> try_emplace(key_type&& k, Args&&... args); template<class k,="" class...="" args=""> std::pair<iterator, bool=""> try_emplace(K&& k, Args&&... args) ```</iterator,></class></iterator,></class...></iterator,></class...>
	instead of xref:#unordered_map_emplace[emplace] which simply forwards all arguments to ``value_type``'s constructor.	而不是像 xref:#unordered_map_emplace[emplace] 那样简单地将所有参数转发给 `value_type` 的构造函数。
	```c++ template<class... Args> iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); template<class... Args> iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args); template<class K, class... Args> iterator try_emplace(const_iterator hint, K&& k, Args&&... args); ```	```c++ template<class... args=""> iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); template<class... args=""> iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args); template<class k,="" class...="" args=""> iterator try_emplace(const_iterator hint, K&& k, Args&&... args); ```</class></class...></class...>
	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.	标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。
	```c++ template<class M> std::pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj); template<class M> std::pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj); template<class K, class M> std::pair<iterator, bool> insert_or_assign(K&& k, M&& obj); ```	```c++ template<class m=""> std::pair<iterator, bool=""> insert_or_assign(const key_type& k, M&& obj); template<class m=""> std::pair<iterator, bool=""> insert_or_assign(key_type&& k, M&& obj); template<class k,="" class="" m=""> std::pair<iterator, bool=""> insert_or_assign(K&& k, M&& obj); ```</iterator,></class></iterator,></class></iterator,></class>
	insert_or_assign with Hint	带提示位置的 `insert_or_assign`
	```c++ template<class M> iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj); template<class M> iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj); template<class K, class M> iterator insert_or_assign(const_iterator hint, K&& k, M&& obj); ```	```c++ template<class m=""> iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj); template<class m=""> iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj); template<class k,="" class="" m=""> iterator insert_or_assign(const_iterator hint, K&& k, M&& obj); ```</class></class></class>
	```c++ insert_return_type insert(node_type&& nh); ```	```c++ insert_return_type insert(node_type&& nh); ```
	If there is already an element in the container with an equivalent key has no effect on `nh` (i.e. `nh` still contains the node.)	如果容器中已存在具有等价键的元素，则对 `nh` 无影响（即 `nh` 仍然包含该节点）。
	Returns:;; The number of elements erased. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; The `template<class K>` 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.	返回：被擦除的元素数量。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	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.	返回：被擦除元素之后的迭代器——即 `last`。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。在此实现中，此重载不会调用任何函数对象的方法，因此不会抛出异常，但这在其他实现中可能并不成立。
	Class Template unordered_map	类模板 unordered_map
	:idprefix: unordered_map_	:idprefix: unordered_map_
	```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>
	merge	合并
	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()` 进行比较。
	Notes:;; + --	注意:;; + --

Loading…

admin

Translation uploaded

English

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

06/05/2026

admin

String added in the repository

English

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

06/05/2026

Browse all string changes

Glossary

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

String information

Flags

safe-html, strict-same

Unit identifier

55633

Source string location

:1043

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 251

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

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file