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

180 :736
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `position` is a suggestion to where the element should be inserted. 67/10000 · 67
180 :828
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Successively invokes `f` with const references to each of the elements in the table. 84/10000 · 84
180 :803
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> iterator emplace_hint(const_iterator position, Args&&... args); ``` 98/10000 · 98
180 :734
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Insert 11/10000 · 11
180 :730
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `args`. 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. 702/10000 · 702
180 :789
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Insert 11/10000 · 11
:579 :579
	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
181 :267
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — for {cpp}11 compilers. 'construct' and 'destroy' should work a little better for {cpp}11 allocators. 100/10000 · 100
181 :791
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> iterator emplace_hint(const_iterator position, Args&&... args); ``` 98/10000 · 98
:751 :751
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent value. 152/10000 · 152
:758 :758
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent key. 150/10000 · 150
181 :886
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Successively invokes `f` with references to each of the elements in the table. Such references are const iff `*this` is const. 126/10000 · 126
:861 :861
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:804 :804
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
181 :739
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `args`. 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. 702/10000 · 702
181 :831
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements visited. 42/10000 · 42
:807 :807
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent key. 150/10000 · 150
181 :735
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ std::pair<iterator, bool> insert(const value_type& obj); ``` 67/10000 · 67
:739 :739
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
181 :790
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ std::pair<iterator, bool> insert(const value_type& obj); std::pair<iterator, bool> insert(const init_type& obj); ``` 123/10000 · 123