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
User avatar admin

Translation uploaded
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. `无实际意义。
06/05/2026
User avatar admin

Translation uploaded
Member function `lower_bound(k)` and `upper_bound(k)`
Member function 成员函数`lower_bound(k)` and 和`upper_bound(k)`
06/05/2026
User avatar admin

Translation uploaded
Keys `k1`, `k2` are considered equivalent if `Pred(k1, k2)`
Keys `若`谓词对象(k1`, `k2` are considered equivalent if `Pred(k1, k2)`)成立`，则键`k1`、`k2`视为等价。
06/05/2026
User avatar admin

Translation uploaded
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)`.若`!对象(k1, k2) && !对象(k2, k1)`，则键`k1`、`k2`视为等价。
06/05/2026
User avatar admin

Translation uploaded
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.构造函数包含可选的额外参数，用于指定初始最小哈希桶数量、哈希函数以及相等性判断对象。
06/05/2026
User avatar admin

Translation uploaded
Constructors have optional extra parameters for the comparison object.
Constructors have optional extra parameters for the comparison object.构造函数包含用于比较对象的可选额外参数。
06/05/2026
User avatar admin

Translation uploaded
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.键可通过成员函数`hash_function()`获取的`哈希对象`进行哈希计算，并通过成员函数`key_eq()`获取的`键相等比较对象`检查是否相等。不存在用于值比较或值哈希的函数对象。
06/05/2026
User avatar admin

Translation uploaded
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()`.键可通过成员函数`key_comp()`获取的`键比较对象`进行比较，值可通过成员函数`value_comp()`获取的`值比较对象`进行比较。
06/05/2026
User avatar admin

Translation uploaded
Parameterized by a function object `Hash` and an equivalence relation `Pred`
Parameterized by a function object `Hash` and an equivalence relation `Pred`由函数对象`哈希对象`和等价关系`谓词对象`参数化。
06/05/2026
User avatar admin

Translation uploaded
Parameterized by an ordering relation `Compare`
Parameterized by an ordering relation通过排序关系 `Compare` 进行 参数化
06/05/2026
User avatar admin

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

Translation uploaded
Associative Containers
Associative Containers关联容器
:100
06/05/2026

Search