User avatar admin

Translation uploaded
Construction of empty container
Construction of empty container空容器的构造
06/05/2026
User avatar admin

Translation uploaded
Unordered Associative Containers
Unordered Associative Containers无序关联容器
:148
06/05/2026
User avatar admin

Translation uploaded
Associative Containers
Associative Containers关联容器
:148
06/05/2026
User avatar admin

Translation uploaded
Operation
Operation操作
06/05/2026
User avatar admin

Translation uploaded
---
---
06/05/2026
User avatar admin

Translation uploaded
When inserting with a hint, implementations are permitted to ignore the hint.
When inserting with a hint, implementations are permitted to ignore the hint.使用提示迭代器插入元素时，实现允许忽略该提示。
06/05/2026
User avatar admin

Translation uploaded
Can be compared using the `==` and `!=` operators.
Can be compared using the `==` and `!=` operators.可使用`==` 和`!=`运算符进行比较。
06/05/2026
User avatar admin

Translation uploaded
Can be compared using the `==`, `!=`, `<`, `\<=`, `>`, `>=` operators.
Can be compared using the 可使用`==`, `!=`, `<&lt;`, `\<&lt;=`, `>`, `>=` operators.&gt;`, `&gt;=`运算符进行比较。
06/05/2026
User avatar admin

Translation uploaded
**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.)闭散列容器：本地迭代器可用于遍历各个哈希桶。（本地迭代器与迭代器的顺序无需存在对应关系。）
06/05/2026
User avatar admin

Translation uploaded
No equivalent
No equivalent无对应接口
06/05/2026
User avatar admin

Translation uploaded
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.迭代器以任意顺序遍历容器，该顺序会随元素插入发生变化，但等价元素始终保持相邻。
06/05/2026
User avatar admin

Translation uploaded
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.迭代器按照比较对象定义的顺序遍历容器。
06/05/2026
User avatar admin

Translation uploaded
**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.基于节点的容器：指向容器元素的指针和引用永远不会失效。
扁平容器：发生重新哈希时，指向容器元素的指针和引用将会失效。
06/05/2026
User avatar admin

Translation uploaded
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]. + 可能会导致迭代器失效]。
06/05/2026
User avatar admin

Translation uploaded
Iterators, pointers and references to the container's elements are never invalidated.
Iterators, pointers and references to the container's elements are never invalidated.指向容器元素的迭代器、指针和引用永远不会失效。
06/05/2026
User avatar admin

Translation uploaded
`iterator`, `const_iterator` are of at least the forward category.
`iterator`, `const_iterator` are of at least the forward category.迭代器`、`常迭代器`的迭代类别至少为前向迭代器。
06/05/2026
User avatar admin

Translation uploaded
`iterator`, `const_iterator` are of the bidirectional category.
`iterator`, `const_iterator` are of the bidirectional category.迭代器`、`常迭代器`的迭代类别为双向迭代器。
06/05/2026
User avatar admin

Translation uploaded
**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.闭散列容器：使用 bucket (k) 可确定键 k 待插入的哈希桶。需注意，插入操作可能触发容器重新哈希，元素最终会被存入其他哈希桶。
06/05/2026
User avatar admin

Translation uploaded
`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. + 若键k不存在于容器中，则返回容器末尾的区间。该函数无法返回定位区间，因为k可被插入到多个位置。
06/05/2026
User avatar admin

Translation uploaded
`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)` returns an empty range at the position that `k` would be inserted if `k` isn't present in the container.会在k 应插入的位置返回一个空区间。
06/05/2026

Search