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

153 :472
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The benchmarks exercise a number of threads _T_ (between 1 and 16) concurrently performing operations randomly chosen among **update**, **successful lookup** and **unsuccessful lookup**. The keys used in the operations follow a https://en.wikipedia.org/wiki/Zipf%27s_law#Formal_definition[Zipf distribution^] with different _skew_ parameters: the higher the skew, the more concentrated are the keys in the lower values of the covered range. 440/10000 · 440
153 :227
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ({github-pr-url}/2[GitHub #2^]). 32/10000 · 32
:712 :712
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — cbegin 6/10000 · 6
153 :671
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ const_iterator cbegin() const noexcept; ``` 50/10000 · 50
153 :679
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ const_iterator cbegin() const noexcept; ``` 50/10000 · 50
153 :771
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Assignment 15/10000 · 15
153 :751
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrency:;; Blocking on `*this` and `other`. 47/10000 · 47
153 :697
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrency:;; Blocking on `*this` and `other`. 47/10000 · 47
:663 :663
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
153 :718
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_node_set& operator=(concurrent_node_set const& other); ``` 76/10000 · 76
153 :726
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ const_iterator cbegin() const noexcept; ``` 50/10000 · 50
153 :657
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A `const_iterator` which refers to the past-the-end value for the container. 87/10000 · 87
:656 :656
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — cend 4/10000 · 4
153 :708
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A `const_iterator` which refers to the past-the-end value for the container. 87/10000 · 87
154 :478
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `boost::concurrent_flat_map` and `boost::concurrent_node_map` are exercised using both regular and xref:concurrent.adoc#concurrent_bulk_visitation[bulk visitation]: in the latter case, lookup keys are buffered in a local array and then processed at once each time the buffer reaches `xref:reference/concurrent_flat_map.adoc#concurrent_flat_map_constants[bulk_visit_size]`. 372/10000 · 372
154 :229
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.56.0 14/10000 · 14
154 :713
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ const_iterator cbegin() const noexcept; ``` 50/10000 · 50
154 :676
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A `const_iterator` referring to the first element of the container, or if the container is empty the past-the-end value for the container. 149/10000 · 149
154 :684
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A `const_iterator` referring to the first element of the container, or if the container is empty the past-the-end value for the container. Complexity:;; O(`bucket_count()`) 183/10000 · 183
154 :773
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_node_map& operator=(concurrent_node_map const& other); ``` 76/10000 · 76