20 strings / 246 words

Translation Key Source string Target string
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)
``` x.reserve(n); ```
``` x.reserve(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)
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 `k1`, `k2` are considered equivalent if `!Compare(k1, k2) && !Compare(k2, k1)`.
若`!对象(k1, k2) && !对象(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)
`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)
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.
基于节点的容器：指向容器元素的指针和引用永远不会失效。
扁平容器：发生重新哈希时，指向容器元素的指针和引用将会失效。
Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)
---
---
Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)
Average case O(_N_), worst case O(_N^2^_)
平均时间复杂度 O(_N_)，最坏时间复杂度 O(_N^2^_)
Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)
_N_ log(`size()` + _N_)
_N_ log(`size()` + _N_)
Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)
:148
O(log(`size()`) + `count(k)`)
O(log(`size()`) + `count(k)`)
Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)
O(log(`size()`) + _N_)
O(log(`size()`) + _N_)
Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)
:148
O(`size()`)
O(`size()`)
Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)
`equal_range(k)`
`equal_range(k)`
Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)
`lower_bound`,`upper_bound`
`lower_bound`,`upper_bound`
Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Regular (adoc) — Chinese (Simplified Han script)
n/a
n/a