Zen

Translation

O(_n_) where _n_ is the minimum number of buckets.
20/500 · 50

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
xref:regular.adoc#regular_iterator_invalidation[Iterators can be invalidated by calls to insert or rehash]. +
xref:regular.adoc#regular_iterator_invalidation [调用 insert 或 rehash 可能会导致迭代器失效]。
**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.
基于节点的容器：指向容器元素的指针和引用永远不会失效。
扁平容器：发生重新哈希时，指向容器元素的指针和引用将会失效。
Iterators iterate through the container in the order defined by the comparison object.
迭代器按照比较对象定义的顺序遍历容器。
Iterators iterate through the container in an arbitrary order, that can change as elements are inserted, although equivalent elements are always adjacent.
迭代器以任意顺序遍历容器，该顺序会随元素插入发生变化，但等价元素始终保持相邻。
No equivalent
无对应接口
**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.)
闭散列容器：本地迭代器可用于遍历各个哈希桶。（本地迭代器与迭代器的顺序无需存在对应关系。）
Can be compared using the `==`, `!=`, `<`, `\<=`, `>`, `>=` operators.
可使用`==`, `!=`, `&lt;`, `\&lt;=`, `&gt;`, `&gt;=`运算符进行比较。
Can be compared using the `==` and `!=` operators.
可使用`==` 和`!=`运算符进行比较。
When inserting with a hint, implementations are permitted to ignore the hint.
使用提示迭代器插入元素时，实现允许忽略该提示。
---
---
Operation
操作
:148
Associative Containers
关联容器
:148
Unordered Associative Containers
无序关联容器
Construction of empty container
空容器的构造
constant
常数级
O(_n_) where _n_ is the minimum number of buckets.
O(_n_)，其中 _n_ 是最小桶数。
Construction of container from a range of _N_ elements
由_N_元素的区间构造容器
O(_N log N_), O(_N_) if the range is sorted with `value_comp()`
O(_N log N_)，如果区间已按 `value_comp()` 排序则为 O(_N_)
Average case O(_N_), worst case O(_N^2^_)
平均时间复杂度 O(_N_)，最坏时间复杂度 O(_N^2^_)
Insert a single element
插入单个元素
:148
logarithmic
对数级
Average case constant, worst case linear
平均情况为常数时间，最坏情况为线性时间
Insert a single element with a hint
带提示插入单个元素
Amortized constant if `t` elements inserted right after hint, logarithmic otherwise
若在提示位置后直接插入t个元素，则为均摊常数时间；否则为对数时间
Average case constant, worst case linear (ie. the same as a normal insert).
平均情况为常数时间，最坏情况为线性时间（即与普通插入操作一致）。
Inserting a range of _N_ elements
插入_N_元素的区间
_N_ log(`size()` + _N_)
_N_ log(`size()` + _N_)
Average case O(_N_), worst case O(_N_ * `size()`)
平均时间复杂度 O(_N_)，最坏时间复杂度O (_N_ * `size()`)
Erase by key, `k`
按键`k`移除
:148
O(log(`size()`) + `count(k)`)
O(log(`size()`) + `count(k)`)
:148
Average case: O(`count(k)`), Worst case: O(`size()`)
平均情况：O(`count(k)`)，最坏情况：O(`size()`)
English Chinese (Simplified Han script) Actions
Constructors have optional extra parameters for the initial minimum number of buckets, a hash function and an equality object.
构造函数包含可选的额外参数，用于指定初始最小哈希桶数量、哈希函数以及相等性判断对象。
Keys `k1`, `k2` are considered equivalent if `!Compare(k1, k2) && !Compare(k2, k1)`.
若`!对象(k1, k2) &amp;&amp; !对象(k2, k1)`，则键`k1`、`k2`视为等价。
Keys `k1`, `k2` are considered equivalent if `Pred(k1, k2)`
若`谓词对象(k1, k2)成立`，则键`k1`、`k2`视为等价。
No equivalent. Since the elements aren't ordered `lower_bound` and `upper_bound` would be meaningless.
无对应接口。由于元素无序，`lower_bound `和 `upper_bound `无实际意义。
`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 应插入的位置返回一个空区间。
**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 待插入的哈希桶。需注意，插入操作可能触发容器重新哈希，元素最终会被存入其他哈希桶。
`iterator`, `const_iterator` are of the bidirectional category.
`迭代器`、`常迭代器`的迭代类别为双向迭代器。
`iterator`, `const_iterator` are of at least the forward category.
`迭代器`、`常迭代器`的迭代类别至少为前向迭代器。
Iterators, pointers and references to the container's elements are never invalidated.
指向容器元素的迭代器、指针和引用永远不会失效。
xref:regular.adoc#regular_iterator_invalidation[Iterators can be invalidated by calls to insert or rehash]. +
xref:regular.adoc#regular_iterator_invalidation [调用 insert 或 rehash 可能会导致迭代器失效]。
**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.
基于节点的容器：指向容器元素的指针和引用永远不会失效。
扁平容器：发生重新哈希时，指向容器元素的指针和引用将会失效。
Iterators iterate through the container in the order defined by the comparison object.
迭代器按照比较对象定义的顺序遍历容器。
When inserting with a hint, implementations are permitted to ignore the hint.
使用提示迭代器插入元素时，实现允许忽略该提示。
---
---
Construction of empty container
空容器的构造
O(_n_) where _n_ is the minimum number of buckets.
O(_n_)，其中 _n_ 是最小桶数。
Construction of container from a range of _N_ elements
由_N_元素的区间构造容器
O(_N log N_), O(_N_) if the range is sorted with `value_comp()`
O(_N log N_)，如果区间已按 `value_comp()` 排序则为 O(_N_)
Average case constant, worst case linear (ie. the same as a normal insert).
平均情况为常数时间，最坏情况为线性时间（即与普通插入操作一致）。
Inserting a range of _N_ elements
插入_N_元素的区间
_N_ log(`size()` + _N_)
_N_ log(`size()` + _N_)
Average case O(_N_), worst case O(_N_ * `size()`)
平均时间复杂度 O(_N_)，最坏时间复杂度O (_N_ * `size()`)
Average case: O(_N_), Worst case: O(`size()`)
平均情况：O(_N_)，最坏情况： O(`size()`)
Clearing the container
清空容器
:idprefix: regular_
:idprefix: regular_
Iterators iterate through the container in an arbitrary order, that can change as elements are inserted, although equivalent elements are always adjacent.
迭代器以任意顺序遍历容器，该顺序会随元素插入发生变化，但等价元素始终保持相邻。
There are other differences, which are listed in the xref:regular.adoc#comparison[Comparison with Associative Containers] section.
其他差异列于 xref:regular.adoc#comparison[与关联容器的对比] 章节中。
Iterator Invalidation
迭代器失效
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()`获取的`键相等比较对象`检查是否相等。不存在用于值比较或值哈希的函数对象。
No equivalent
无对应接口

Loading…

User avatar admin

Translation uploaded
O(_n_) where _n_ is the minimum number of buckets.
O(_n_) where _n_ is the minimum number of buckets.，其中 _n_ 是最小桶数。
06/05/2026
User avatar admin

String added in the repository
O(_n_) where _n_ is the minimum number of buckets.
O(_n_) where _n_ is the minimum number of buckets.
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
49729
Source string location
:148
String age
06/05/2026
Last updated
06/06/2026
Source string age
06/05/2026
Translation file AsciiDoc file
doc/modules/ROOT/pages/regular_zh_Hans.adoc, string 50