Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Because `source` can have a different hash function and key …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:1083	---	---
	swap	交换
	```c++ void swap(unordered_set& 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_set& 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.	交换容器与参数的内容。
:1095	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 标准并不完全相同。
:1101	---	---
	clear	清空
	```c++ void clear() noexcept; ```	```c++ void clear() noexcept; ```
	Erases all elements in the container.	擦除容器中的所有元素。
	Postconditions:;; `size() == 0` Throws:;; Never throws an exception.	后置条件：`size() == 0` 抛出：永不抛出异常。
:1114	---	---
	merge	合并
	```c++ template<class H2, class P2> void merge(unordered_set<Key, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_set<Key, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_multiset<Key, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multiset<Key, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> void merge(unordered_set<key, h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_set<key, h2,="" p2,="" allocator="">&& source); template<class h2,="" class="" p2=""> void merge(unordered_multiset<key, h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_multiset<key, 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` 容器，提取其中所有不包含在 `++++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` 可以有不同的哈希函数和键相等性谓词，因此会使用 `this-++>++hash++_++function()` 操作对 `source` 中每个节点的键进行重哈希，并在需要时使用 `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.	使指向被转移元素的迭代器失效。
	Invalidates iterators belonging to `*this`.	使属于 `++*++this` 的迭代器失效。
	Iterators to non-transferred elements in `source` remain valid.	指向 `source` 中未被转移元素的迭代器保持有效。
	--	--
:1149	---	---
	Observers	观察器
	get_allocator	get++_++allocator
	``` allocator_type get_allocator() const; ```	``` allocator_type get_allocator() const; ```
:1158	---	---
	hash_function	哈希函数
	``` hasher hash_function() const; ```	``` hasher hash_function() const; ```

	English	Chinese (Simplified Han script)	Actions
	```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:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_multiset`, but that is not supported yet.	返回：一个拥有该元素的 `node_type`。说明：在 C++17 中，通过此方法提取的节点可以插入到兼容的 `unordered_multiset` 中，但该功能尚未支持。
	```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>
	```c++ insert_return_type insert(node_type&& nh); ```	```c++ insert_return_type insert(node_type&& nh); ```
	Insert with Hint and `node_handle`	带提示和 `node++_++handle` 的插入
	```c++ iterator insert(const_iterator hint, node_type&& nh); ```	```c++ iterator insert(const_iterator hint, 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` 仍持有该节点.）
	```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```	```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```
	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` 抛出异常时才会抛出异常。+ + 在此实现中，此重载不会调用这两个函数对象的任何方法，因此不会抛出异常，但在其他实现中可能并非如此。
	Hash Policy	哈希策略
	Postconditions:;; `size() == 0` Throws:;; Never throws an exception.	后置条件：`size() == 0` 抛出：永不抛出异常。
	merge	合并
	```c++ template<class H2, class P2> void merge(unordered_set<Key, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_set<Key, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_multiset<Key, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multiset<Key, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> void merge(unordered_set<key, h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_set<key, h2,="" p2,="" allocator="">&& source); template<class h2,="" class="" p2=""> void merge(unordered_multiset<key, h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_multiset<key, h2,="" p2,="" allocator="">&& source); ```</key,></class></key,></class></key,></class></key,></class>
	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` 可以有不同的哈希函数和键相等性谓词，因此会使用 `this-++>++hash++_++function()` 操作对 `source` 中每个节点的键进行重哈希，并在需要时使用 `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` 中。
	Pointers and references to transferred elements remain valid.	指向被转移元素的指针和引用保持有效。
	Observers	观察器
	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); 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:;; An iterator pointing to an element with key equivalent to `k`, or `b.end()` if no such element exists. Notes:;; The templated overloads containing `CompatibleKey`, `CompatibleHash` and `CompatiblePredicate` are non-standard extensions which allow you to use a compatible hash function and equality predicate for a key of a different type in order to avoid an expensive type cast. In general, its use is not encouraged and instead the `K` member function templates should be used. + + 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` 等价的元素的迭代器，若不存在这样的元素则返回 `b.end()`。说明：包含 `CompatibleKey`、`CompatibleHash` 和 `CompatiblePredicate` 的模板化重载是非标准扩展，允许您使用兼容的哈希函数和相等谓词来处理不同类型的键，以避免昂贵的类型转换。通常不鼓励使用它们，而应使用 `K` 成员函数模板。+ +`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时以 `K` 和 `Key` 调用，且 `Pred` 是透明的。这实现了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	```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>
	```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>
	```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,>
	Bucket Interface	桶接口
	bucket_count	bucket++_++count
	```c++ size_type bucket_count() const noexcept; ```	```c++ size_type bucket_count() const noexcept; ```
	Returns:;; The number of buckets.	返回：桶的数量。

Loading…

admin

Translation uploaded

English

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

~~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()`.~~可以有不同的哈希函数和键相等性谓词，因此会使用 `this-++>++hash++_++function()` 操作对 `source` 中每个节点的键进行重哈希，并在需要时使用 `this-++>++key++_++eq()` 进行比较。

06/05/2026

admin

String added in the repository

English

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

51125

Source string location

:1131

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_set_zh_Hans.adoc, string 290

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