2. Boost Unordered Translation (zh_Hans)
3. English
4. Zen

13 :62
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Which you can then use in a case insensitive dictionary: ```cpp boost::unordered_map<std::string, int, ihash, iequal_to> idictionary; ``` 137/10000 · 137
13 :24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/running insertion.xlsx.practice non-unique 5.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice non-unique 5.png,window=_blank] 180/10000 · 180
13 :128
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Note that in this last example the visitation function could actually _modify_ the element: as a general rule, operations on a concurrent map `m` will grant visitation functions const/non-const access to the element depending on whether `m` is const/non-const. Const access can be always be explicitly requested by using `cvisit` overloads (for instance, `insert_or_cvisit`) and may result in higher parallelization. For concurrent sets, on the other hand, visitation is always const access. 492/10000 · 492
13 :115
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Average probe lengths should be close to 1.0. 45/10000 · 45
13 :51
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `size_type bucket_count() const` 32/10000 · 32
13 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When swapping, `Pred` and `Hash` are not currently swapped by calling `swap`, their copy constructors are used. As a consequence, when swapping an exception may be thrown from their copy constructor. 199/10000 · 199
13 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In practice, the extra indirection can have a dramatic performance impact to common operations such as `insert`, `find` and `erase`. But to keep iteration of the container fast, Boost.Unordered introduces a novel data structure, a "bucket group". A bucket group is a fixed-width view of a subsection of the buckets array. It contains a bitmask (a `std::size_t`) which it uses to track occupancy of buckets and contains two pointers so that it can form a doubly-linked list with non-empty groups. An example diagram is below: 524/10000 · 524
13 :26
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The container visualizations also work if you are using fancy pointers in your allocator, such as `boost::interprocess::offset_ptr`. While this is rare, Boost.Unordered has natvis customization points to support any type of fancy pointer. `boost::interprocess::offset_ptr` has support already defined in the Boost.Interprocess library, and you can add support to your own type by following the instructions contained in a comment near the end of the file link:https://github.com/boostorg/unordered/blob/develop/extra/boost_unordered.natvis[/extra/boost_unordered.natvis]. 571/10000 · 571
13 :15
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/stats.adoc[Statistics] 37/10000 · 37
13 :26
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — allow for visitation of an element right after insertion (by contrast, `insert_or_visit(x, f)` only visits the element if insertion did _not_ take place). 154/10000 · 154
13 :287
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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`. 151/10000 · 151
13 :246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A binary function object that implements an equivalence relation on values of type `Key`. 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. 247/10000 · 247
13 :247
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Key` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container. 97/10000 · 97
13 :361
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _T_ 3/10000 · 3
13 :344
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _T_ 3/10000 · 3
13 :290
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container. 87/10000 · 87
13 :254
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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`. 151/10000 · 151
13 :64
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Average probe lenghts should be close to 1.0. 45/10000 · 45
13 :307
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container. 87/10000 · 87
13 :297
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — into the container 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 container. 169/10000 · 169