Boost Unordered Translation (zh_Hans) - Chinese (Simplified Han script) @ Boost-Weblate: Saves the positional information of an `iterator` (`const

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	erase_if	erase_if
	```c++ template<class K, class T, class H, class P, class A, class Predicate> typename unordered_map<K, T, H, P, A>::size_type erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred); ```	```c++ template<class k,="" class="" t,="" h,="" p,="" a,="" predicate=""> typename unordered_map<k, t,="" h,="" p,="" a="">::size_type erase_if(unordered_map<k, t,="" h,="" p,="" a="">& c, Predicate pred); ```</k,></k,></class>
	Traverses the container `c` and removes all elements for which the supplied predicate returns `true`.	遍历容器 `c` 并移除所有使给定谓词返回 `true` 的元素。
	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` 的引用是非常量的。
	Serialization	序列化
	``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 归档。
	Saving an unordered_map to an archive	将 unordered_map 保存到归档
	Saves all the elements of an `unordered_map` `x` to an archive (XML archive) `ar`.	将 `unordered_map` `x` 的所有元素保存到归档（XML 归档）`ar` 中。
	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>
:1790	---	---
	Loading an unordered_map from an archive	从归档中加载 unordered_map
	Deletes all preexisting elements of an `unordered_map` `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `unordered_map` `other` saved to the storage read by `ar`.	删除 `unordered_map` `x` 中所有已存在的元素，并从归档（XML 归档）`ar` 中插入由 `ar` 所读取存储中保存的原始 `unordered_map` `other` 元素的恢复副本。
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `(std::remove_const<key_type>::type&&, std::remove_const<mapped_type>::type&&)`. `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.	要求：;; `value_type` 可以从 `(std::remove_const<key_type>::type&&, std::remove_const<mapped_type>::type&&)` 进行 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^]。`x.key_equal()` 在功能上等价于 `other.key_equal()`。注意：;; 如果归档是使用 Boost 1.84 之前的 Boost 版本保存的，则必须全局定义配置宏 `BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0` 才能使此操作成功；否则将抛出异常。</mapped_type></key_type>
:1806	---	---
	Saving an iterator/const_iterator to an archive	将迭代器/常量迭代器保存到归档中
	Saves the positional information of an `iterator` (`const_iterator`) `it` to an archive (XML archive) `ar`. `it` can be and `end()` iterator.	将 `iterator`（`const_iterator`）`it` 的位置信息保存到归档（XML 归档）`ar` 中。`it` 可以是 `end()` 迭代器。
	Requires:;; The `unordered_map` `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`.	要求：;; `it` 所指向的 `unordered_map` `x` 此前已保存至 `ar`，并且在保存 `x` 和保存 `it` 之间未对 `x` 执行任何修改操作。
:1818	---	---
	Loading an iterator/const_iterator from an archive	从归档中加载迭代器/常量迭代器
	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`.	使 `iterator`（`const_iterator`）`it` 指向保存到由归档（XML 归档）`ar` 读取的存储中的原始 `iterator`（`const_iterator`）的被恢复位置。
	Requires:;; If `x` is the `unordered_map` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`.	要求：;; 如果 `x` 是 `it` 所指向的 `unordered_map`，则在加载 `x` 和加载 `it` 之间未对 `x` 执行任何修改操作。

	English	Chinese (Simplified Han script)	Actions
	Returns:;; A `const_iterator` which refers to the past-the-end value for the container.	返回：指向容器尾后值的 `const_iterator`。
	Size and Capacity	大小与容量
	empty	空
	```c++ [[nodiscard]] bool empty() const noexcept; ```	```c++ [[nodiscard]] bool empty() const noexcept; ```
	Returns:;; `size() == 0`	返回：`size() == 0`。
	size	大小
	```c++ size_type max_size() const noexcept; ```	```c++ size_type max_size() const noexcept; ```
	Returns:;; `size()` of the largest possible container.	返回：可能的最大容器的 `size()`。
	Modifiers	修改器
	emplace	原地构造
	```c++ template<class... Args> std::pair<iterator, bool> emplace(Args&&... args); ```	```c++ template<class... args=""> std::pair<iterator, bool=""> emplace(Args&&... args); ```</iterator,></class...>
	```c++ std::pair<iterator, bool> insert(value_type&& obj); ```	```c++ std::pair<iterator, bool=""> insert(value_type&& obj); ```</iterator,>
	```c++ template<class K, class T, class H, class P, class A, class Predicate> typename unordered_map<K, T, H, P, A>::size_type erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred); ```	```c++ template<class k,="" class="" t,="" h,="" p,="" a,="" predicate=""> typename unordered_map<k, t,="" h,="" p,="" a="">::size_type erase_if(unordered_map<k, t,="" h,="" p,="" a="">& c, Predicate pred); ```</k,></k,></class>
	Traverses the container `c` and removes all elements for which the supplied predicate returns `true`.	遍历容器 `c` 并移除所有使给定谓词返回 `true` 的元素。
	Saving an iterator/const_iterator to an archive	将迭代器/常量迭代器保存到归档中
	Saves the positional information of an `iterator` (`const_iterator`) `it` to an archive (XML archive) `ar`. `it` can be and `end()` iterator.	将 `iterator`（`const_iterator`）`it` 的位置信息保存到归档（XML 归档）`ar` 中。`it` 可以是 `end()` 迭代器。
	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.	返回：返回类型的 bool 分量为 true 表示发生了插入。如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
	Copy Insert with Hint	带提示的复制插入
	```c++ iterator insert(const_iterator hint, const value_type& obj); ``` Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.	```c++iterator insert(const_iterator hint, const value_type& obj);``` 当且仅当容器中没有具有等价键的元素时，才将 `obj` 插入容器。
	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. + + 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.	返回：如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。 `template<class k,="" class="" m="">` 仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	Extract by Iterator	通过迭代器提取
	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++
	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` 的构造函数。
	```c++ node_type extract(const_iterator position); ```	```c++ node_type extract(const_iterator position); ```
	Removes the element pointed to by `position`.	移除 `position` 所指向的元素。
	Returns:;; A `node_type` owning the element. Notes:;; A node extracted using this method can be inserted into a compatible `unordered_multimap`.	返回：一个拥有该元素的 `node_type`。注意：通过此方法提取的节点可以插入到兼容的 `unordered_multimap` 中。
	Extract by Key	通过键提取
	```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ```	```c++ node_type extract(const key_type& k); template<class k=""> node_type extract(K&& k); ```</class>
	Removes an element with key equivalent to `k`.	移除一个键与 `k` 等价的元素。
	`boost::unordered_map` — An unordered associative container that associates unique keys with another value.	`boost::unordered_map` — 一个无序关联容器，用于将唯一的键与另一个值关联起来。

Loading…

admin

Translation uploaded

English

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

06/05/2026

admin

String added in the repository

English

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

Component

Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Map (adoc)

Flags

safe-html, strict-same

Unit identifier

55866

Source string location

:1810

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 484

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

Component

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file