User avatar admin

Translation uploaded
`std::allocator_traits<Alloc>::destroy`
`std::allocator_traits<Aalloc>::destroy`</alloc>
06/05/2026
User avatar admin

Translation uploaded
`std::allocator_traits<Alloc>::construct`
`std::allocator_traits<Aalloc>::construct`</alloc>
06/05/2026
User avatar admin

Translation uploaded
`std::allocator_traits<Alloc>::deallocate`
`std::allocator_traits<Aalloc>::deallocate`</alloc>
06/05/2026
User avatar admin

Translation uploaded
`std::allocator_traits<Alloc>::allocate`
`std::allocator_traits<Aalloc>::allocate`</alloc>
06/05/2026
User avatar admin

Translation uploaded
Copy construction from `al` of an allocator rebound from `Alloc`
Copy construction from `al` of an allocator rebound from `Alloc`从 `al` 复制构造重新绑定的分配器
06/05/2026
User avatar admin

Translation uploaded
Concurrent invocations of `operator()` on the same const instance of `Hash` or `Pred` are required to not introduce data races. For `Alloc` being either `Allocator` or any allocator type rebound from `Allocator`, concurrent invocations of the following operations on the same instance `al` of `Alloc` are required to not introduce data races:
Concurrent invocations of `operator()` on the same const instance of要求对同一 `Hash` or或 `Pred` are required to not introduce data races. For `Alloc` being either `Allocator` or any allocator type rebound from `Allocator`, concurrent invocations of the following operations on the same instance `al` of `Alloc` are required to not introduce data races:常量实例并发调用 `operator()` 时不得引入数据竞争。对于 `Alloc` （即 `Allocator` 或其重绑定后的任意分配器类型），在同一实例 `al` 上并发调用以下操作时不得引入数据竞争：
06/05/2026
User avatar admin

Translation uploaded
Concurrency Requirements and Guarantees
Concurrency Requirements and Guarantees并发要求与保证
06/05/2026
User avatar admin

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

Translation uploaded
If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost.
If 若`link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hhash>::value` is为 `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost.，则直接使用原哈希函数；否则会添加一个比特混合后处理阶段，以额外计算开销为代价提升哈希质量。</hash>
06/05/2026
User avatar admin

Translation uploaded
The size of the bucket array can be automatically increased by a call to `insert`/`emplace`, or as a result of calling `rehash`/`reserve`. The _load factor_ of the table (number of elements divided by number of buckets) is never greater than `max_load_factor()`, except possibly for small sizes where the implementation may decide to allow for higher loads.
The size of the bucket array can be automatically increased by a call to `insert`/`emplace`, or as a result of calling `rehash`/`reserve`. The _load factor_ of the table (number of elements divided by number of buckets) is never greater than `max_load_factor()`, except possibly for small sizes where the implementation may decide to allow for higher loads.通过调用 `insert`/`emplace`，或执行 `rehash`/`reserve` 操作，可自动增大桶数组的大小。哈希表的**负载因子**（元素数量除以桶数量）永远不会大于 `max_load_factor()`，仅在尺寸极小时，实现可能允许更高的负载。
06/05/2026
User avatar admin

Translation uploaded
The element nodes of the table are held into an internal _bucket array_. An node is inserted into a bucket determined by the hash code of its element, but if the bucket is already occupied (a _collision_), an available one in the vicinity of the original position is used.
The element nodes of the table are held into an internal _bucket array_. An node is inserted into a bucket determined by the hash code of its element, but if the bucket is already occupied (a _collision_), an available one in the vicinity of the original position is used.哈希表的元素节点存储在内部**桶数组**中。节点会根据其元素的哈希值插入到对应的桶中；若该桶已被占用（即发生**哈希冲突**），则使用原位置附近的可用桶。
06/05/2026
User avatar admin

Translation uploaded
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
Allocators using支持使用 https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.花式指针] 的分配器。
06/05/2026
User avatar admin

Translation uploaded
An allocator whose value type is the same as the table's value type.
An allocator whose value type is the same as the table's value type.值类型与该表的值类型一致的分配器。
06/05/2026
User avatar admin

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

Translation uploaded
A binary function object that induces an equivalence relation on values of type `Key`. It takes two arguments of type `Key` and returns a value of type `bool`.
A binary function object that induces an equivalence relation on values of type `Key`. It takes two arguments of type `Key` and returns a value of type `bool`.一种二元函数对象，用于对Key类型的值建立等价关系。它接受两个Key类型的参数，并返回一个bool类型的值。
06/05/2026
User avatar admin

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

Translation uploaded
A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.
A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.一元函数对象类型，用作 `Key` 的哈希函数。它接受一个类型为 `Key`
06/05/2026
User avatar admin

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

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

Translation uploaded
into the table from any `std::pair` object convertible to it, and it also must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the table.
into the table from any `std::pair` object convertible to it, and it also must be`std::pair` 对象 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[原地构造] 到容器中，并且必须支持从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the table.擦除] 。
06/05/2026

Search