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

207 :825
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class K> std::pair<iterator, bool> insert(const_iterator hint, K&& k); ``` 90/10000 · 90
207 :825
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `*first`. 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. 480/10000 · 480
207 :887
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void insert(std::initializer_list<value_type>); ``` 58/10000 · 58
:684 :684
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|5M updates, 45M lookups + skew=0.01 h|5M updates, 45M lookups + skew=0.5 h|5M updates, 45M lookups + skew=0.99 |=== 117/10000 · 117
208 :303
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.49.0 14/10000 · 14
208 :888
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator insert(const_iterator hint, value_type&& obj); ``` 66/10000 · 66
:853 :853
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. 63/10000 · 63
:850 :850
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. This implementation ignores it. 95/10000 · 95
:985 :985
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
208 :949
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> bool emplace(Args&&... args); ``` 64/10000 · 64
208 :890
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> bool emplace(Args&&... args); ``` 64/10000 · 64
208 :828
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; An iterator pointing to the inserted element. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key. + + 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. 669/10000 · 669
208 :926
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — max_size 8/10000 · 8
:911 :911
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key. 145/10000 · 145
:829 :829
	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
:831 :831
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:891 :891
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key. 145/10000 · 145
:692 :692
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Visual Studio 2022, x86 23/10000 · 23
209 :305
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fix warning due to accidental odd assignment. 45/10000 · 45
:892 :892
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the container if and only if there is no element in the container with an equivalent key. 106/10000 · 106