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

212 :868
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class K> iterator insert(const_iterator hint, K&& k); ``` 73/10000 · 73
212 :863
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class K> std::pair<iterator, bool> insert(const_iterator hint, K&& k); ``` 90/10000 · 90
:996 :996
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
212 :965
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Insert 11/10000 · 11
212 :904
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Insert 11/10000 · 11
212 :844
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an element into the container by performing `emplace_hint(hint, std::forward<P>(value))`. 97/10000 · 97
212 :937
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Modifiers 9/10000 · 9
212 :921
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void insert(std::initializer_list<value_type>); ``` 58/10000 · 58
212 :845
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Iterator Range 21/10000 · 21
212 :841
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] into the container. Throws:;; When inserting a single element, if an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. 464/10000 · 464
212 :901
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> std::pair<iterator, bool> try_emplace(const key_type& k, Args&&... args); template<class... Args> std::pair<iterator, bool> try_emplace(key_type&& k, Args&&... args); template<class K, class... Args> std::pair<iterator, bool> try_emplace(K&& k, Args&&... args); ``` 296/10000 · 296
:703 :703
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|500k updates, 4.5M lookups + skew=0.01 h|500k updates, 4.5M lookups + skew=0.5 h|500k updates, 4.5M lookups + skew=0.99 |=== 126/10000 · 126
213 :314
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The container now meets {cpp}11's complexity requirements, but to do so uses a little more memory. This means that `quick_erase` and `erase_return_void` are no longer required, they'll be removed in a future version. 216/10000 · 216
213 :908
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Emplace Insert with Hint 24/10000 · 24
:872 :872
	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
:867 :867
	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
213 :998
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Modifiers 9/10000 · 9
213 :966
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ bool insert(const value_type& obj); bool insert(const init_type& obj); ``` 81/10000 · 81
213 :905
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ bool insert(const value_type& obj); ``` 46/10000 · 46
:846 :846
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Only participates in overload resolution if `std::is_constructible<value_type, P&&>::value` is `true`. 102/10000 · 102