Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Constructs an empty container using `a` as the allocator, with …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:403	Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	要求;; 若使用默认值，则 `hasher` 、 `key++_++equal` 和 `allocator++_++type` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造] 要求。
:405	---	---
	Copy Constructor	复制构造函数
	```c++ unordered_set(const unordered_set& other); ```	```c++ unordered_set(const unordered_set& other); ```
	The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.	复制构造函数。复制所含元素、哈希函数、谓词、最大负载因子和分配器。
	If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.	若 `Allocator::select_on_container_copy_construction` 存在且具有正确的签名，则将根据其结果来构造分配器。
:417	Requires:;; `value_type` is copy constructible	要求：;; `value_type` 需满足可复制构造要求。
:419	---	---
	Move Constructor	移动构造函数
	```c++ unordered_set(unordered_set&& other); ```	```c++ unordered_set(unordered_set&& other); ```
	The move constructor.	移动构造函数。
	Notes:;; This is implemented using Boost.Move. Requires:;; `value_type` is move-constructible.	说明：;; 该实现使用 Boost.Move。要求：;; `value_type` 需满足可移动构造要求。
:432	---	---
	Iterator Range Constructor with Allocator	带分配器的迭代器范围构造函数
	```c++ template<class InputIterator> unordered_set(InputIterator f, InputIterator l, const allocator_type& a); ```	```c++ template<class inputiterator=""> unordered_set(InputIterator f, InputIterator l, const allocator_type& a); ```</class>
	Constructs an empty container using `a` as the allocator, with the default hash function and key equality predicate and a maximum load factor of `1.0` and inserts the elements from `[f, l)` into it.	构造一个空容器，使用 `a` 作为分配器、默认的哈希函数和键相等性谓词，并将最大负载因子设为 `1.0` ，然后将 `[f, l)` 范围内的元素插入其中。
:443	Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	要求：`hasher`、`key_equal` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]要求。
:445	---	---
	Allocator Constructor	分配器构造函数
	```c++ explicit unordered_set(const Allocator& a); ```	```c++ explicit unordered_set(const Allocator& a); ```
	Constructs an empty container, using allocator `a`.	构造一个空容器，使用分配器 `a`。
:454	---	---
	Copy Constructor with Allocator	带分配器的复制构造函数
	```c++ unordered_set(const unordered_set& other, const Allocator& a); ```	```c++ unordered_set(const unordered_set& other, const Allocator& a); ```
	Constructs an container, copying ``other``'s contained elements, hash function, predicate, maximum load factor, but using allocator `a`.	构造一个容器，移动 `other` 中所包含的元素，并获取其哈希函数、谓词及最大负载因子，但使用分配器 `a` 。
:463	---	---
	Move Constructor with Allocator	带分配器的移动构造函数
	```c++ unordered_set(unordered_set&& other, const Allocator& a); ```	```c++ unordered_set(unordered_set&& other, const Allocator& a); ```
	Construct a container moving ``other``'s contained elements, and having the hash function, predicate and maximum load factor, but using allocate `a`.	构造一个容器，移动 `other` 中所包含的元素，并获取其哈希函数、谓词及最大负载因子，但使用分配器 `a` 。
	Notes:;; This is implemented using Boost.Move. Requires:;; `value_type` is move insertable.	说明：该实现使用 Boost.Move。要求：`value_type` 需满足可移动插入要求。
:476	---	---

	English	Chinese (Simplified Han script)	Actions
	``` hasher hash_function() const; ```	``` hasher hash_function() const; ```
	Returns:;; The container's hash function.	返回：容器的哈希函数。
	key_eq	key++_++eq
	Returns:;; The container's key equality predicate	返回：容器的键相等谓词。
	Lookup	查找
	When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array.	当 `size() == 0` 时，`rehash(0)` 将释放底层桶数组。
	Requires:;; `n < bucket_count()` Returns:;; The number of elements in bucket `n`.	要求：`n < bucket_count()` 返回：桶 `n` 中的元素数量。
	```c++ size_type bucket(const key_type& k) const; template<class K> size_type bucket(const K& k) const; ```	```c++ size_type bucket(const key_type& k) const; template<class k=""> size_type bucket(const K& k) const; ```</class>
	```c++ local_iterator end(size_type n); const_local_iterator end(size_type n) const; ```	```c++ local_iterator end(size_type n); const_local_iterator end(size_type n) const; ```
	reserve	保留
	Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the first element in the bucket with index `n`.	要求：`n` 应在 `[0, bucket_count())` 范围内。返回：指向索引为 `n` 的桶中第一个元素的常量局部迭代器。
	The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.	复制构造函数。复制所含元素、哈希函数、谓词、最大负载因子和分配器。
	Move Constructor	移动构造函数
	```c++ unordered_set(unordered_set&& other); ```	```c++ unordered_set(unordered_set&& other); ```
	The move constructor.	移动构造函数。
	Constructs an empty container using `a` as the allocator, with the default hash function and key equality predicate and a maximum load factor of `1.0` and inserts the elements from `[f, l)` into it.	构造一个空容器，使用 `a` 作为分配器、默认的哈希函数和键相等性谓词，并将最大负载因子设为 `1.0` ，然后将 `[f, l)` 范围内的元素插入其中。
	```c++ unordered_set(const unordered_set& other, const Allocator& a); ```	```c++ unordered_set(const unordered_set& other, const Allocator& a); ```
	Initializer List Constructor	初始化列表构造函数
	Postconditions:;; `size() == 0` Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	后置条件：`size() == 0` 要求：`hasher` 和 `key_equal` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]要求。
	Postconditions:;; `size() == 0` Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	后置条件：size() == 0 要求：key_equal 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]要求。
	```c++ unordered_set& operator=(unordered_set&& 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_set& operator=(unordered_set&& other) noexcept(boost::allocator_traits<allocator>::is_always_equal::value && boost::is_nothrow_move_assignable_v<hash> && boost::is_nothrow_move_assignable_v<pred>); ``` 移动赋值运算符。</pred></hash></allocator>
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `args`. 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 value. 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` 需从 `args` 处满足对 `X` 的 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[可原位构造^] 要求。返回：若执行了插入，则返回类型中的布尔分量为 `true`。+ + 若执行了插入，则迭代器指向新插入的元素；否则指向等价的元素。抛出：若调用 `hasher` 以外的操作抛出异常，则函数无效果。说明：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。+ + 指向元素的指针和引用永远不会失效。
	emplace_hint	emplace_hint
	```c++ template<class... Args> iterator emplace_hint(const_iterator position, Args&&... args); ```	```c++ template<class... args=""> iterator emplace_hint(const_iterator position, Args&&... args); ```</class...>
	`position` is a suggestion to where the element should be inserted.	`position` 是一个关于元素应插入位置的提示。
	```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[可复制插入^] 要求。返回：若执行了插入，则返回类型中的布尔分量为 `true`。+ +若执行了插入，则迭代器指向新插入的元素；否则指向等价的元素。抛出：若调用 `hasher` 以外的操作抛出异常，则函数无效果。说明：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。+ +指向元素的指针和引用永远不会失效。
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. 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/MoveInsertable[可移动插入^] 要求。返回：若执行了插入，则返回类型中的布尔分量为 `true`。+ +若执行了插入，则迭代器指向新插入的元素；否则指向等价的元素。抛出：若调用 `hasher` 以外的操作抛出异常，则函数无效果。说明：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。+ +指向元素的指针和引用永远不会失效。
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. 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.	要求：`value_type` 需满足 https://en.cppreference.com/w/cpp/named_req/CopyInsertable[可复制插入^] 要求。返回：若执行了插入，则迭代器指向新插入的元素；否则指向等价的元素。抛出：若调用 `hasher` 以外的操作抛出异常，则函数无效果。说明：标准对提示的含义表述相当模糊。但使用它的唯一实际方式，也是 Boost.Unordered 唯一支持的方式，是将其指向具有相同键的现有元素。+ +可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。+ +指向元素的指针和引用永远不会失效。
	Insert Iterator Range	迭代器范围插入

Loading…

admin

Translation uploaded

English

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

06/05/2026

admin

String added in the repository

English

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

50904

Source string location

:440

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 69

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