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

:1010 :1010
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:1000 :1000
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) ``` 135/10000 · 135
237 :921
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void swap(unordered_flat_set& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value || boost::allocator_traits<Allocator>::propagate_on_container_swap::value); ``` 191/10000 · 191
237 :929
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase by Position 17/10000 · 17
237 :991
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class M> std::pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj); template<class M> std::pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj); template<class K, class M> std::pair<iterator, bool> insert_or_assign(K&& k, M&& obj); ``` 272/10000 · 272
238 :371
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — {svn-ticket-url}/3773[Ticket 3773^]: 36/10000 · 36
:998 :998
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. 125/10000 · 125
238 :953
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ insert_return_type insert(node_type&& nh); ``` 53/10000 · 53
238 :934
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is not empty, inserts the associated element in the container if and only if there is no element in the container with a key equivalent to `nh.value()`. `nh` becomes empty if insertion took place, otherwise it is not changed. 233/10000 · 233
:1077 :1077
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
238 :1053
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F> bool insert_or_visit(const value_type& obj, F f); template<class F> bool insert_or_cvisit(const value_type& obj, F f); template<class F> bool insert_or_visit(const init_type& obj, F f); template<class F> bool insert_or_cvisit(const init_type& obj, F f); ``` 282/10000 · 282
238 :984
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args, class F> bool emplace_or_visit(Args&&... args, F&& f); template<class... Args, class F> bool emplace_or_cvisit(Args&&... args, F&& f); ``` 169/10000 · 169
238 :923
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator insert(node_type&& nh); ``` 43/10000 · 43
238 :1012
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Initializer List 23/10000 · 23
238 :1005
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — unlike xref:#unordered_node_map_emplace[emplace], which simply forwards all arguments to ``value_type``'s constructor. 118/10000 · 118
238 :927
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Swaps the contents of the container with the parameter. 55/10000 · 55
238 :931
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator erase(iterator position); iterator erase(const_iterator position); ``` 86/10000 · 86
:1000 :1000
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts a new element into the container or updates an existing one by assigning to the contained value. 104/10000 · 104
239 :372
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Add missing `std` qualifier to `ptrdiff_t`. 43/10000 · 43
:1000 :1000
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Pointers and references to elements are never invalidated. 58/10000 · 58