Lines Matching refs:unordered_map
15 unordered_map synopsis
24 class unordered_map
49 unordered_map()
54 explicit unordered_map(size_type n, const hasher& hf = hasher(),
58 unordered_map(InputIterator f, InputIterator l,
62 explicit unordered_map(const allocator_type&);
63 unordered_map(const unordered_map&);
64 unordered_map(const unordered_map&, const Allocator&);
65 unordered_map(unordered_map&&)
70 unordered_map(unordered_map&&, const Allocator&);
71 unordered_map(initializer_list<value_type>, size_type n = 0,
74 unordered_map(size_type n, const allocator_type& a)
75 : unordered_map(n, hasher(), key_equal(), a) {} // C++14
76 unordered_map(size_type n, const hasher& hf, const allocator_type& a)
77 : unordered_map(n, hf, key_equal(), a) {} // C++14
79 unordered_map(InputIterator f, InputIterator l, size_type n, const allocator_type& a)
80 : unordered_map(f, l, n, hasher(), key_equal(), a) {} // C++14
82 unordered_map(InputIterator f, InputIterator l, size_type n, const hasher& hf,
84 : unordered_map(f, l, n, hf, key_equal(), a) {} // C++14
85 unordered_map(initializer_list<value_type> il, size_type n, const allocator_type& a)
86 : unordered_map(il, n, hasher(), key_equal(), a) {} // C++14
87 unordered_map(initializer_list<value_type> il, size_type n, const hasher& hf,
89 : unordered_map(il, n, hf, key_equal(), a) {} // C++14
90 ~unordered_map();
91 unordered_map& operator=(const unordered_map&);
92 unordered_map& operator=(unordered_map&&)
98 unordered_map& operator=(initializer_list<value_type>);
156 void merge(unordered_map<Key, T, H2, P2, Allocator>& source); // C++17
158 void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); // C++17
164 void swap(unordered_map&)
222 unordered_map(InputIterator, InputIterator, typename see below::size_type = see below,
224 -> unordered_map<iter_key_t<InputIterator>, iter_value_t<InputIterator>, Hash, Pred,
229 unordered_map(initializer_list<pair<const Key, T>>, typename see below::size_type = see below,
231 -> unordered_map<Key, T, Hash, Pred, Allocator>; // C++17
234 unordered_map(InputIterator, InputIterator, typename see below::size_type, Allocator)
235 -> unordered_map<iter_key_t<InputIterator>, iter_val_t<InputIterator>,
239 unordered_map(InputIterator, InputIterator, Allocator)
240 -> unordered_map<iter_key_t<InputIterator>, iter_val_t<InputIterator>,
244 unordered_map(InputIterator, InputIterator, typename see below::size_type, Hash, Allocator)
245 -> unordered_map<iter_key_t<InputIterator>, iter_val_t<InputIterator>, Hash,
249 unordered_map(initializer_list<pair<const Key, T>>, typename see below::size_type, Allocator)
250 -> unordered_map<Key, T, hash<Key>, equal_to<Key>, Allocator>; // C++17
253 unordered_map(initializer_list<pair<const Key, T>>, Allocator)
254 -> unordered_map<Key, T, hash<Key>, equal_to<Key>, Allocator>; // C++17
257 unordered_map(initializer_list<pair<const Key, T>>, typename see below::size_type, Hash, Allocator)
258 -> unordered_map<Key, T, Hash, equal_to<Key>, Allocator>; // C++17
261 void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x,
262 unordered_map<Key, T, Hash, Pred, Alloc>& y)
267 operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
268 const unordered_map<Key, T, Hash, Pred, Alloc>& y);
272 operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
273 const unordered_map<Key, T, Hash, Pred, Alloc>& y);
395 void merge(unordered_map<Key, T, H2, P2, Allocator>& source); // C++17
397 void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); // C++17
496 typename unordered_map<K, T, H, P, A>::size_type
497 erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred); // C++20
963 template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
1017 template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
1028 class _LIBCPP_TEMPLATE_VIS unordered_map
1084 friend class _LIBCPP_TEMPLATE_VIS unordered_map;
1089 unordered_map()
1094 explicit unordered_map(size_type __n, const hasher& __hf = hasher(),
1096 unordered_map(size_type __n, const hasher& __hf,
1100 unordered_map(_InputIterator __first, _InputIterator __last);
1102 unordered_map(_InputIterator __first, _InputIterator __last,
1106 unordered_map(_InputIterator __first, _InputIterator __last,
1111 explicit unordered_map(const allocator_type& __a);
1112 unordered_map(const unordered_map& __u);
1113 unordered_map(const unordered_map& __u, const allocator_type& __a);
1116 unordered_map(unordered_map&& __u)
1118 unordered_map(unordered_map&& __u, const allocator_type& __a);
1119 unordered_map(initializer_list<value_type> __il);
1120 unordered_map(initializer_list<value_type> __il, size_type __n,
1122 unordered_map(initializer_list<value_type> __il, size_type __n,
1128 unordered_map(size_type __n, const allocator_type& __a)
1129 : unordered_map(__n, hasher(), key_equal(), __a) {}
1131 unordered_map(size_type __n, const hasher& __hf, const allocator_type& __a)
1132 : unordered_map(__n, __hf, key_equal(), __a) {}
1135 …unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& …
1136 : unordered_map(__first, __last, __n, hasher(), key_equal(), __a) {}
1139 … unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf,
1141 : unordered_map(__first, __last, __n, __hf, key_equal(), __a) {}
1143 unordered_map(initializer_list<value_type> __il, size_type __n, const allocator_type& __a)
1144 : unordered_map(__il, __n, hasher(), key_equal(), __a) {}
1146 unordered_map(initializer_list<value_type> __il, size_type __n, const hasher& __hf,
1148 : unordered_map(__il, __n, __hf, key_equal(), __a) {}
1151 ~unordered_map() {
1156 unordered_map& operator=(const unordered_map& __u)
1174 unordered_map& operator=(unordered_map&& __u)
1177 unordered_map& operator=(initializer_list<value_type> __il);
1210 … "unordered_map::insert(const_iterator, const value_type&) called with an iterator not "
1211 "referring to this unordered_map");
1231 … "unordered_map::insert(const_iterator, const value_type&) called with an iterator not"
1232 " referring to this unordered_map");
1249 … "unordered_map::insert(const_iterator, value_type&&) called with an iterator not"
1250 " referring to this unordered_map");
1265 … "unordered_map::emplace_hint(const_iterator, args...) called with an iterator not"
1266 " referring to this unordered_map");
1297 … "unordered_map::try_emplace(const_iterator, key, args...) called with an iterator not"
1298 " referring to this unordered_map");
1308 … "unordered_map::try_emplace(const_iterator, key, args...) called with an iterator not"
1309 " referring to this unordered_map");
1372 "node_type with incompatible allocator passed to unordered_map::insert()");
1380 "node_type with incompatible allocator passed to unordered_map::insert()");
1398 void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>& __source)
1406 void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>&& __source)
1431 void swap(unordered_map& __u)
1562 unordered_map(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type = 0,
1564 …-> unordered_map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>, _Hash, _Pred…
1573 unordered_map(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type =…
1575 -> unordered_map<remove_const_t<_Key>, _Tp, _Hash, _Pred, _Allocator>;
1580 unordered_map(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Al…
1581 -> unordered_map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
1587 unordered_map(_InputIterator, _InputIterator, _Allocator)
1588 -> unordered_map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
1596 unordered_map(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Ha…
1597 -> unordered_map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>,
1602 unordered_map(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type, …
1603 -> unordered_map<remove_const_t<_Key>, _Tp,
1609 unordered_map(initializer_list<pair<_Key, _Tp>>, _Allocator)
1610 -> unordered_map<remove_const_t<_Key>, _Tp,
1618 unordered_map(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type, …
1619 -> unordered_map<remove_const_t<_Key>, _Tp, _Hash,
1624 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1633 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1644 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1653 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1662 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1674 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1685 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1686 const unordered_map& __u)
1695 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1696 const unordered_map& __u, const allocator_type& __a)
1708 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1709 unordered_map&& __u)
1718 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1719 unordered_map&& __u, const allocator_type& __a)
1736 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1744 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1755 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1767 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&
1768 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(unordered_map&& __u)
1777 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&
1778 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(
1791 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
1802 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k)
1811 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](key_type&& __k)
1820 typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__node_holder
1821 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__construct_node_with_key(const key_type& __k)
1834 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k)
1849 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::at(const key_type& __k)
1853 __throw_out_of_range("unordered_map::at: key not found");
1859 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::at(const key_type& __k) const
1863 __throw_out_of_range("unordered_map::at: key not found");
1870 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1871 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1881 typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::size_type
1882 erase_if(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __c,
1890 operator==(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1891 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1895 typedef typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator
1910 operator!=(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1911 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1971 friend class _LIBCPP_TEMPLATE_VIS unordered_map;
2197 void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>& __source)
2205 void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>&& __source)