2. Boost Unordered Translation (zh_Hans)
3. Doc / Modules / Root / Pages / Reference / Concurrent Node Set (adoc)
4. English
5. Zen

:951 :951
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
218 :953
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Insert 11/10000 · 11
219 :954
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ bool insert(const value_type& obj); ``` 46/10000 · 46
:958 :958
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the table if and only if there is no element in the table with an equivalent key. 98/10000 · 98
:961 :961
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. 198/10000 · 198
:965 :965
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
223 :967
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Insert 11/10000 · 11
224 :968
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ bool insert(value_type&& obj); ``` 41/10000 · 41
:972 :972
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the table if and only if there is no element in the table with an equivalent key. 98/10000 · 98
226 :975
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. 196/10000 · 196
:979 :979
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
228 :981
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Transparent Insert 18/10000 · 18
229 :982
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class K> bool insert(K&& k); ``` 48/10000 · 48
230 :986
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an element constructed from `std::forward<K>(k)` in the container if and only if there is no element in the container with an equivalent key. 149/10000 · 149
231 :989
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; This overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type. 565/10000 · 565
:994 :994
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
233 :996
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Iterator Range 21/10000 · 21
234 :997
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class InputIterator> size_type insert(InputIterator first, InputIterator last); ``` 99/10000 · 99
:1001 :1001
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to [listing,subs="+macros,+quotes"] 46/10000 · 46
:1008 :1008
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements inserted. 43/10000 · 43