2. Boost Unordered Translation (zh_Hans)
3. Search

Filters

• Untranslated strings • state:empty
• Unfinished strings • state:<translated
• Translated strings • state:>=translated
• Strings marked for edit • state:needs-editing
• Strings with suggestions • has:suggestion
• Strings with variants • has:variant
• Strings with screenshots • has:screenshot
• Strings with labels • has:label
• Strings with context • has:context
• Unfinished strings without suggestions • state:<translated AND NOT has:suggestion
• Strings with comments • has:comment
• Strings with any failing checks • has:check
• Approved strings • state:approved
• Strings waiting for review • state:translated

state:>=translated

Component and priority

• Position and priority
• Position
• Priority
• Labels
• Source string
• Target string
• String age
• Last updated
• Number of words
• Number of comments
• Number of failing checks
• Key
• String location
• Component and priority

	Translation	Key	Source string	Target string
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		:idprefix: comparison_	:idprefix: comparison_
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Comparison with Associative Containers	Comparison with Associative Containers
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English	:100	Associative Containers	Associative Containers
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English	:100	Unordered Associative Containers	Unordered Associative Containers
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Parameterized by an ordering relation `Compare`	Parameterized by an ordering relation `Compare`
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Parameterized by a function object `Hash` and an equivalence relation `Pred`	Parameterized by a function object `Hash` and an equivalence relation `Pred`
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Keys can be compared using `key_compare` which is accessed by member function `key_comp()`, values can be compared using `value_compare` which is accessed by member function `value_comp()`.	Keys can be compared using `key_compare` which is accessed by member function `key_comp()`, values can be compared using `value_compare` which is accessed by member function `value_comp()`.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Keys can be hashed using `hasher` which is accessed by member function `hash_function()`, and checked for equality using `key_equal` which is accessed by member function `key_eq()`. There is no function object for compared or hashing values.	Keys can be hashed using `hasher` which is accessed by member function `hash_function()`, and checked for equality using `key_equal` which is accessed by member function `key_eq()`. There is no function object for compared or hashing values.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Constructors have optional extra parameters for the comparison object.	Constructors have optional extra parameters for the comparison object.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Constructors have optional extra parameters for the initial minimum number of buckets, a hash function and an equality object.	Constructors have optional extra parameters for the initial minimum number of buckets, a hash function and an equality object.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Keys `k1`, `k2` are considered equivalent if `!Compare(k1, k2) && !Compare(k2, k1)`.	Keys `k1`, `k2` are considered equivalent if `!Compare(k1, k2) && !Compare(k2, k1)`.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Keys `k1`, `k2` are considered equivalent if `Pred(k1, k2)`	Keys `k1`, `k2` are considered equivalent if `Pred(k1, k2)`
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Member function `lower_bound(k)` and `upper_bound(k)`	Member function `lower_bound(k)` and `upper_bound(k)`
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		No equivalent. Since the elements aren't ordered `lower_bound` and `upper_bound` would be meaningless.	No equivalent. Since the elements aren't ordered `lower_bound` and `upper_bound` would be meaningless.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		`equal_range(k)` returns an empty range at the position that `k` would be inserted if `k` isn't present in the container.	`equal_range(k)` returns an empty range at the position that `k` would be inserted if `k` isn't present in the container.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		`equal_range(k)` returns a range at the end of the container if `k` isn't present in the container. It can't return a positioned range as `k` could be inserted into multiple place. +	`equal_range(k)` returns a range at the end of the container if `k` isn't present in the container. It can't return a positioned range as `k` could be inserted into multiple place. +
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		**Closed-addressing containers:** To find out the bucket that `k` would be inserted into use `bucket(k)`. But remember that an insert can cause the container to rehash - meaning that the element can be inserted into a different bucket.	**Closed-addressing containers:** To find out the bucket that `k` would be inserted into use `bucket(k)`. But remember that an insert can cause the container to rehash - meaning that the element can be inserted into a different bucket.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		`iterator`, `const_iterator` are of the bidirectional category.	`iterator`, `const_iterator` are of the bidirectional category.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		`iterator`, `const_iterator` are of at least the forward category.	`iterator`, `const_iterator` are of at least the forward category.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Iterators, pointers and references to the container's elements are never invalidated.	Iterators, pointers and references to the container's elements are never invalidated.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		xref:regular.adoc#regular_iterator_invalidation[Iterators can be invalidated by calls to insert or rehash]. +	xref:regular.adoc#regular_iterator_invalidation[Iterators can be invalidated by calls to insert or rehash]. +
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		**Node-based containers:** Pointers and references to the container's elements are never invalidated. + **Flat containers:** Pointers and references to the container's elements are invalidated when rehashing occurs.	**Node-based containers:** Pointers and references to the container's elements are never invalidated. + **Flat containers:** Pointers and references to the container's elements are invalidated when rehashing occurs.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Iterators iterate through the container in the order defined by the comparison object.	Iterators iterate through the container in the order defined by the comparison object.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Iterators iterate through the container in an arbitrary order, that can change as elements are inserted, although equivalent elements are always adjacent.	Iterators iterate through the container in an arbitrary order, that can change as elements are inserted, although equivalent elements are always adjacent.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		No equivalent	No equivalent
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		**Closed-addressing containers:** Local iterators can be used to iterate through individual buckets. (The order of local iterators and iterators aren't required to have any correspondence.)	**Closed-addressing containers:** Local iterators can be used to iterate through individual buckets. (The order of local iterators and iterators aren't required to have any correspondence.)
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Can be compared using the `==`, `!=`, `<`, `\<=`, `>`, `>=` operators.	Can be compared using the `==`, `!=`, `<`, `\<=`, `>`, `>=` operators.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Can be compared using the `==` and `!=` operators.	Can be compared using the `==` and `!=` operators.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		When inserting with a hint, implementations are permitted to ignore the hint.	When inserting with a hint, implementations are permitted to ignore the hint.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		---	---
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Operation	Operation
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English	:148	Associative Containers	Associative Containers
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English	:148	Unordered Associative Containers	Unordered Associative Containers
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Construction of empty container	Construction of empty container
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		constant	constant
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		O(_n_) where _n_ is the minimum number of buckets.	O(_n_) where _n_ is the minimum number of buckets.
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Construction of container from a range of _N_ elements	Construction of container from a range of _N_ elements
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		O(_N log N_), O(_N_) if the range is sorted with `value_comp()`	O(_N log N_), O(_N_) if the range is sorted with `value_comp()`
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Average case O(_N_), worst case O(_N^2^_)	Average case O(_N_), worst case O(_N^2^_)
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Insert a single element	Insert a single element
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English	:148	logarithmic	logarithmic
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Average case constant, worst case linear	Average case constant, worst case linear
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Insert a single element with a hint	Insert a single element with a hint
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Amortized constant if `t` elements inserted right after hint, logarithmic otherwise	Amortized constant if `t` elements inserted right after hint, logarithmic otherwise
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Average case constant, worst case linear (ie. the same as a normal insert).	Average case constant, worst case linear (ie. the same as a normal insert).
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Inserting a range of _N_ elements	Inserting a range of _N_ elements
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		_N_ log(`size()` + _N_)	_N_ log(`size()` + _N_)
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Average case O(_N_), worst case O(_N_ * `size()`)	Average case O(_N_), worst case O(_N_ * `size()`)
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Erase by key, `k`	Erase by key, `k`
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English	:148	O(log(`size()`) + `count(k)`)	O(log(`size()`) + `count(k)`)
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English	:148	Average case: O(`count(k)`), Worst case: O(`size()`)	Average case: O(`count(k)`), Worst case: O(`size()`)
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Erase a single element by iterator	Erase a single element by iterator
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Amortized constant	Amortized constant
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English	:148	Average case: O(1), Worst case: O(`size()`)	Average case: O(1), Worst case: O(`size()`)
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Erase a range of _N_ elements	Erase a range of _N_ elements
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		O(log(`size()`) + _N_)	O(log(`size()`) + _N_)
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Average case: O(_N_), Worst case: O(`size()`)	Average case: O(_N_), Worst case: O(`size()`)
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Clearing the container	Clearing the container
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English	:148	O(`size()`)	O(`size()`)
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Find	Find
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		Count	Count
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		`equal_range(k)`	`equal_range(k)`
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		`lower_bound`,`upper_bound`	`lower_bound`,`upper_bound`
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — English		n/a	n/a
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		[#regular] = Regular Containers	[#regular] = 常规容器
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		:idprefix: regular_	:idprefix: regular_
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Boost.Unordered closed-addressing containers (`boost::unordered_set`, `boost::unordered_map`, `boost::unordered_multiset` and `boost::unordered_multimap`) are fully conformant with the C++ specification for unordered associative containers, so for those who know how to use `std::unordered_set`, `std::unordered_map`, etc., their homonyms in Boost.Unordered are drop-in replacements. The interface of open-addressing containers (`boost::unordered_node_set`, `boost::unordered_node_map`, `boost::unordered_flat_set` and `boost::unordered_flat_map`) is very similar, but they present some minor differences listed in the dedicated xref:compliance.adoc#compliance_open_addressing_containers[standard compliance section].	Boost.Unordered 的闭寻址容器（ `boost::unordered++_++set` 、 `boost::unordered++_++map` 、 `boost::unordered++_++multiset` 与 `boost::unordered++_++multimap` ）完全符合 C{plus}{plus} 无序关联容器的标准规范。因此，对于熟悉 `std::unordered++_++set` 、 `std::unordered++_++map` 等用法的用户，可直接将其替换为Boost.Unordered 中的同名容器。开放寻址容器（ `boost::unordered++_++node++_++set` 、 `boost::unordered++_++node++_++map` 、 `boost::unordered++_++flat++_++set` 和 `boost::unordered++_++flat++_++map` ）的接口与之高度相似，但存在一些细微差异，详见专门的 xref:compliance.adoc#compliance_open_addressing_containers[标准符合性章节] 。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		For readers without previous experience with hash containers but familiar with normal associative containers (`std::set`, `std::map`, `std::multiset` and `std::multimap`), Boost.Unordered containers are used in a similar manner:	对于没有哈希容器经验但熟悉常规关联容器（ `std::set` 、 `std::map` 、 `std::multiset` 和 `std::multimap` ）的读者，Boost.Unordered 容器的使用方式与之类似：
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		But since the elements aren't ordered, the output of:	但由于元素不按顺序存储，以下代码的输出结果：
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		can be in any order. For example, it might be:	可能以任意顺序输出。例如，结果可能为：
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		There are other differences, which are listed in the xref:regular.adoc#comparison[Comparison with Associative Containers] section.	其他差异列于 xref:regular.adoc#comparison[与关联容器的对比] 章节中。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Iterator Invalidation	迭代器失效
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		It is not specified how member functions other than `rehash` and `reserve` affect the bucket count, although `insert` can only invalidate iterators when the insertion causes the container's load to be greater than the maximum allowed. For most implementations this means that `insert` will only change the number of buckets when this happens. Iterators can be invalidated by calls to `insert`, `rehash` and `reserve`.	标准未明确规定除 `rehash` 和 `reserve` 之外的成员函数如何影响桶数量，但 `insert` 操作仅当导致容器负载超过最大允许值时才会使迭代器失效。在大多数实现中，这意味着 `insert` 仅在此种情况下才会改变桶的数量。迭代器可能因调用 `insert` 、 `rehash` 或 `reserve` 而失效。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		As for pointers and references, they are never invalidated for node-based containers (`boost::unordered_[multi]set`, `boost::unordered_[multi]map`, `boost::unordered_node_set`, `boost::unordered_node_map`), but they will be when rehashing occurs for `boost::unordered_flat_set` and `boost::unordered_flat_map`: this is because these containers store elements directly into their holding buckets, so when allocating a new bucket array the elements must be transferred by means of move construction.	对于基于节点的容器（ `boost::unordered++_[++multi++]++set` 、 `boost::unordered++_[++multi++]++map` 、 `boost::unordered++_++node++_++set` 、 `boost::unordered++_++node++_++map` ），其指针和引用永远不会失效。但对于 `boost::unordered++_++flat++_++set` 和 `boost::unordered++_++flat++_++map` ，在发生重哈希时指针和引用将会失效：这是因为这些容器将元素直接存储在桶中，当分配新的桶数组时，必须通过移动构造来转移元素。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		In a similar manner to using `reserve` for ``vector``s, it can be a good idea to call `reserve` before inserting a large number of elements. This will get the expensive rehashing out of the way and let you store iterators, safe in the knowledge that they won't be invalidated. If you are inserting `n` elements into container `x`, you could first call:	与为 `vector` 使用 `reserve` 类似，在插入大量元素之前调用 `reserve` 是一个好主意。这样可以避免代价高昂的重哈希操作，并且让你能够存储迭代器，确信它们不会被失效。如果你要向容器 `x` 插入 `n` 个元素，可以先调用：
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		``` x.reserve(n); ```	``` x.reserve(n); ```
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		`reserve(n)` reserves space for at least `n` elements, allocating enough buckets	`reserve(n)` 为至少 `n` 个元素预留空间，分配足够数量的桶，
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		so as to not exceed the maximum load factor. + Because the maximum load factor is defined as the number of elements divided by the total number of available buckets, this function is logically equivalent to: + ``` x.rehash(std::ceil(n / x.max_load_factor())) ``` + See the xref:reference/unordered_map.adoc#unordered_map_rehash[reference for more details] on the `rehash` function.	以确保不超过最大负载因子。由于最大负载因子定义为元素数量除以可用桶的总数，该函数在逻辑上等价于： ```cppx.rehash(std::ceil(n / x.max_load_factor()))``` 有关 `rehash` 函数的更多详细信息，请参阅 xref:reference/unordered_map.adoc#unordered_map_rehash[参考文档]。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		:idprefix: comparison_	:idprefix: comparison_
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Comparison with Associative Containers	与关联容器的对比
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)	:100	Associative Containers	关联容器
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)	:100	Unordered Associative Containers	无序关联容器
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Parameterized by an ordering relation `Compare`	通过排序关系 `Compare` 进行 参数化
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Parameterized by a function object `Hash` and an equivalence relation `Pred`	由函数对象`哈希对象`和等价关系`谓词对象`参数化。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Keys can be compared using `key_compare` which is accessed by member function `key_comp()`, values can be compared using `value_compare` which is accessed by member function `value_comp()`.	键可通过成员函数`key_comp()`获取的`键比较对象`进行比较，值可通过成员函数`value_comp()`获取的`值比较对象`进行比较。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Keys can be hashed using `hasher` which is accessed by member function `hash_function()`, and checked for equality using `key_equal` which is accessed by member function `key_eq()`. There is no function object for compared or hashing values.	键可通过成员函数`hash_function()`获取的`哈希对象`进行哈希计算，并通过成员函数`key_eq()`获取的`键相等比较对象`检查是否相等。不存在用于值比较或值哈希的函数对象。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Constructors have optional extra parameters for the comparison object.	构造函数包含用于比较对象的可选额外参数。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Constructors have optional extra parameters for the initial minimum number of buckets, a hash function and an equality object.	构造函数包含可选的额外参数，用于指定初始最小哈希桶数量、哈希函数以及相等性判断对象。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Keys `k1`, `k2` are considered equivalent if `!Compare(k1, k2) && !Compare(k2, k1)`.	若`!对象(k1, k2) &amp;&amp; !对象(k2, k1)`，则键`k1`、`k2`视为等价。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Keys `k1`, `k2` are considered equivalent if `Pred(k1, k2)`	若`谓词对象(k1, k2)成立`，则键`k1`、`k2`视为等价。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Member function `lower_bound(k)` and `upper_bound(k)`	成员函数`lower_bound(k)`和`upper_bound(k)`
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		No equivalent. Since the elements aren't ordered `lower_bound` and `upper_bound` would be meaningless.	无对应接口。由于元素无序，`lower_bound `和 `upper_bound `无实际意义。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		`equal_range(k)` returns an empty range at the position that `k` would be inserted if `k` isn't present in the container.	若键k不存在于容器中，equal_range(k)会在k 应插入的位置返回一个空区间。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		`equal_range(k)` returns a range at the end of the container if `k` isn't present in the container. It can't return a positioned range as `k` could be inserted into multiple place. +	equal_range(k) 若键k不存在于容器中，则返回容器末尾的区间。该函数无法返回定位区间，因为k可被插入到多个位置。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		**Closed-addressing containers:** To find out the bucket that `k` would be inserted into use `bucket(k)`. But remember that an insert can cause the container to rehash - meaning that the element can be inserted into a different bucket.	闭散列容器：使用 bucket (k) 可确定键 k 待插入的哈希桶。需注意，插入操作可能触发容器重新哈希，元素最终会被存入其他哈希桶。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		`iterator`, `const_iterator` are of the bidirectional category.	`迭代器`、`常迭代器`的迭代类别为双向迭代器。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		`iterator`, `const_iterator` are of at least the forward category.	`迭代器`、`常迭代器`的迭代类别至少为前向迭代器。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		Iterators, pointers and references to the container's elements are never invalidated.	指向容器元素的迭代器、指针和引用永远不会失效。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		xref:regular.adoc#regular_iterator_invalidation[Iterators can be invalidated by calls to insert or rehash]. +	xref:regular.adoc#regular_iterator_invalidation [调用 insert 或 rehash 可能会导致迭代器失效]。
	Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)		**Node-based containers:** Pointers and references to the container's elements are never invalidated. + **Flat containers:** Pointers and references to the container's elements are invalidated when rehashing occurs.	基于节点的容器：指向容器元素的指针和引用永远不会失效。 扁平容器：发生重新哈希时，指向容器元素的指针和引用将会失效。

• 126 / 128
  / 128