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,
63 unordered_map(from_range_t, R&& rg, size_type n = see below,
67 explicit unordered_map(const allocator_type&);
68 unordered_map(const unordered_map&);
69 unordered_map(const unordered_map&, const Allocator&);
70 unordered_map(unordered_map&&)
75 unordered_map(unordered_map&&, const Allocator&);
76 unordered_map(initializer_list<value_type>, size_type n = 0,
79 unordered_map(size_type n, const allocator_type& a)
80 : unordered_map(n, hasher(), key_equal(), a) {} // C++14
81 unordered_map(size_type n, const hasher& hf, const allocator_type& a)
82 : unordered_map(n, hf, key_equal(), a) {} // C++14
84 unordered_map(InputIterator f, InputIterator l, size_type n, const allocator_type& a)
85 : unordered_map(f, l, n, hasher(), key_equal(), a) {} // C++14
87 unordered_map(InputIterator f, InputIterator l, size_type n, const hasher& hf,
89 : unordered_map(f, l, n, hf, key_equal(), a) {} // C++14
91 unordered_map(from_range_t, R&& rg, size_type n, const allocator_type& a)
92 : unordered_map(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
94 unordered_map(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
95 : unordered_map(from_range, std::forward<R>(rg), n, hf, key_equal(), a) { } // C++23
96 unordered_map(initializer_list<value_type> il, size_type n, const allocator_type& a)
97 : unordered_map(il, n, hasher(), key_equal(), a) {} // C++14
98 unordered_map(initializer_list<value_type> il, size_type n, const hasher& hf,
100 : unordered_map(il, n, hf, key_equal(), a) {} // C++14
101 ~unordered_map();
102 unordered_map& operator=(const unordered_map&);
103 unordered_map& operator=(unordered_map&&)
109 unordered_map& operator=(initializer_list<value_type>);
169 void merge(unordered_map<Key, T, H2, P2, Allocator>& source); // C++17
171 void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); // C++17
177 void swap(unordered_map&)
235 unordered_map(InputIterator, InputIterator, typename see below::size_type = see below,
237 -> unordered_map<iter_key_t<InputIterator>, iter_value_t<InputIterator>, Hash, Pred,
243 unordered_map(from_range_t, R&&, typename see below::size_type = see below,
245 -> unordered_map<range-key-type<R>, range-mapped-type<R>, Hash, Pred, Allocator>; // C++23
249 unordered_map(initializer_list<pair<const Key, T>>, typename see below::size_type = see below,
251 -> unordered_map<Key, T, Hash, Pred, Allocator>; // C++17
254 unordered_map(InputIterator, InputIterator, typename see below::size_type, Allocator)
255 -> unordered_map<iter_key_t<InputIterator>, iter_val_t<InputIterator>,
259 unordered_map(InputIterator, InputIterator, Allocator)
260 -> unordered_map<iter_key_t<InputIterator>, iter_val_t<InputIterator>,
264 unordered_map(InputIterator, InputIterator, typename see below::size_type, Hash, Allocator)
265 -> unordered_map<iter_key_t<InputIterator>, iter_val_t<InputIterator>, Hash,
269 unordered_map(from_range_t, R&&, typename see below::size_type, Allocator)
270 -> unordered_map<range-key-type<R>, range-mapped-type<R>, hash<range-key-type<R>>,
274 unordered_map(from_range_t, R&&, Allocator)
275 -> unordered_map<range-key-type<R>, range-mapped-type<R>, hash<range-key-type<R>>,
279 unordered_map(from_range_t, R&&, typename see below::size_type, Hash, Allocator)
280 -> unordered_map<range-key-type<R>, range-mapped-type<R>, Hash,
284 unordered_map(initializer_list<pair<const Key, T>>, typename see below::size_type, Allocator)
285 -> unordered_map<Key, T, hash<Key>, equal_to<Key>, Allocator>; // C++17
288 unordered_map(initializer_list<pair<const Key, T>>, Allocator)
289 -> unordered_map<Key, T, hash<Key>, equal_to<Key>, Allocator>; // C++17
292 unordered_map(initializer_list<pair<const Key, T>>, typename see below::size_type, Hash, Allocator)
293 -> unordered_map<Key, T, Hash, equal_to<Key>, Allocator>; // C++17
296 void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x,
297 unordered_map<Key, T, Hash, Pred, Alloc>& y)
302 operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
303 const unordered_map<Key, T, Hash, Pred, Alloc>& y);
307 operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
308 const unordered_map<Key, T, Hash, Pred, Alloc>& y); // Removed in C++20
442 void merge(unordered_map<Key, T, H2, P2, Allocator>& source); // C++17
444 void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); // C++17
565 typename unordered_map<K, T, H, P, A>::size_type
566 erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred); // C++20
956 friend class _LIBCPP_TEMPLATE_VIS unordered_map;
1012 friend class _LIBCPP_TEMPLATE_VIS unordered_map;
1029 class _LIBCPP_TEMPLATE_VIS unordered_map {
1087 friend class _LIBCPP_TEMPLATE_VIS unordered_map;
1091 …_LIBCPP_HIDE_FROM_ABI unordered_map() _NOEXCEPT_(is_nothrow_default_constructible<__table>::value)…
1093 unordered_map(size_type __n, const hasher& __hf = hasher(), const key_equal& __eql = key_equal());
1095 …unordered_map(size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a…
1097 _LIBCPP_HIDE_FROM_ABI unordered_map(_InputIterator __first, _InputIterator __last);
1100 unordered_map(_InputIterator __first,
1106 _LIBCPP_HIDE_FROM_ABI unordered_map(
1116 _LIBCPP_HIDE_FROM_ABI unordered_map(
1131 _LIBCPP_HIDE_FROM_ABI explicit unordered_map(const allocator_type& __a);
1132 _LIBCPP_HIDE_FROM_ABI unordered_map(const unordered_map& __u);
1133 _LIBCPP_HIDE_FROM_ABI unordered_map(const unordered_map& __u, const allocator_type& __a);
1135 …_LIBCPP_HIDE_FROM_ABI unordered_map(unordered_map&& __u) _NOEXCEPT_(is_nothrow_move_constructible<…
1136 _LIBCPP_HIDE_FROM_ABI unordered_map(unordered_map&& __u, const allocator_type& __a);
1137 _LIBCPP_HIDE_FROM_ABI unordered_map(initializer_list<value_type> __il);
1139 unordered_map(initializer_list<value_type> __il,
1143 _LIBCPP_HIDE_FROM_ABI unordered_map(
1151 _LIBCPP_HIDE_FROM_ABI unordered_map(size_type __n, const allocator_type& __a)
1152 : unordered_map(__n, hasher(), key_equal(), __a) {}
1153 _LIBCPP_HIDE_FROM_ABI unordered_map(size_type __n, const hasher& __hf, const allocator_type& __a)
1154 : unordered_map(__n, __hf, key_equal(), __a) {}
1157 …unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& …
1158 : unordered_map(__first, __last, __n, hasher(), key_equal(), __a) {}
1160 _LIBCPP_HIDE_FROM_ABI unordered_map(
1162 : unordered_map(__first, __last, __n, __hf, key_equal(), __a) {}
1166 …_LIBCPP_HIDE_FROM_ABI unordered_map(from_range_t, _Range&& __range, size_type __n, const allocator…
1167 : unordered_map(from_range, std::forward<_Range>(__range), __n, hasher(), key_equal(), __a) {}
1171 …unordered_map(from_range_t, _Range&& __range, size_type __n, const hasher& __hf, const allocator_t…
1172 : unordered_map(from_range, std::forward<_Range>(__range), __n, __hf, key_equal(), __a) {}
1175 …_LIBCPP_HIDE_FROM_ABI unordered_map(initializer_list<value_type> __il, size_type __n, const alloca…
1176 : unordered_map(__il, __n, hasher(), key_equal(), __a) {}
1178 …unordered_map(initializer_list<value_type> __il, size_type __n, const hasher& __hf, const allocato…
1179 : unordered_map(__il, __n, __hf, key_equal(), __a) {}
1181 _LIBCPP_HIDE_FROM_ABI ~unordered_map() {
1185 _LIBCPP_HIDE_FROM_ABI unordered_map& operator=(const unordered_map& __u) {
1201 _LIBCPP_HIDE_FROM_ABI unordered_map& operator=(unordered_map&& __u)
1203 _LIBCPP_HIDE_FROM_ABI unordered_map& operator=(initializer_list<value_type> __il);
1336 … "node_type with incompatible allocator passed to unordered_map::insert()");
1341 … "node_type with incompatible allocator passed to unordered_map::insert()");
1352 …_LIBCPP_HIDE_FROM_ABI void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>& _…
1358 …_LIBCPP_HIDE_FROM_ABI void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>&& …
1377 …_LIBCPP_HIDE_FROM_ABI void swap(unordered_map& __u) _NOEXCEPT_(__is_nothrow_swappable<__table>::va…
1480 unordered_map(_InputIterator,
1486 …-> unordered_map<__iter_key_type<_InputIterator>, __iter_mapped_type<_InputIterator>, _Hash, _Pred…
1497 unordered_map(from_range_t,
1503 …-> unordered_map<__range_key_type<_Range>, __range_mapped_type<_Range>, _Hash, _Pred, _Allocator>;…
1515 unordered_map(initializer_list<pair<_Key, _Tp>>,
1519 … _Allocator = _Allocator()) -> unordered_map<remove_const_t<_Key>, _Tp, _Hash, _Pred, _Allocator>;
1525 unordered_map(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Al…
1526 -> unordered_map<__iter_key_type<_InputIterator>,
1536 unordered_map(_InputIterator, _InputIterator, _Allocator)
1537 -> unordered_map<__iter_key_type<_InputIterator>,
1550 unordered_map(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Ha…
1551 -> unordered_map<__iter_key_type<_InputIterator>,
1560 unordered_map(from_range_t, _Range&&, typename allocator_traits<_Allocator>::size_type, _Allocator)
1561 -> unordered_map<__range_key_type<_Range>,
1568 unordered_map(from_range_t, _Range&&, _Allocator)
1569 -> unordered_map<__range_key_type<_Range>,
1581 unordered_map(from_range_t, _Range&&, typename allocator_traits<_Allocator>::size_type, _Hash, _All…
1582 -> unordered_map<__range_key_type<_Range>,
1591 unordered_map(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type, …
1592 …-> unordered_map<remove_const_t<_Key>, _Tp, hash<remove_const_t<_Key>>, equal_to<remove_const_t<_K…
1595 unordered_map(initializer_list<pair<_Key, _Tp>>, _Allocator)
1596 …-> unordered_map<remove_const_t<_Key>, _Tp, hash<remove_const_t<_Key>>, equal_to<remove_const_t<_K…
1605 unordered_map(initializer_list<pair<_Key, _Tp>>, typename allocator_traits<_Allocator>::size_type, …
1606 -> unordered_map<remove_const_t<_Key>, _Tp, _Hash, equal_to<remove_const_t<_Key>>, _Allocator>;
1610 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(size_type __n, const hasher& __hf, co…
1616 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1623 inline unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(const allocator_type& __a)
1628 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(_InputIterator __first, _InputIterato…
1634 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1643 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1656 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(const unordered_map& __u) : __table_(…
1662 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(const unordered_map& __u, const alloc…
1671 inline unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(unordered_map&& __u)
1676 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(unordered_map&& __u, const allocator_…
1687 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(initializer_list<value_type> __il) {
1692 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1700 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1712 inline unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&
1713 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(unordered_map&& __u)
1720 inline unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&
1721 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(initializer_list<value_type> __il) {
1730 inline void unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::insert(_InputIterator __first, _InputIt…
1738 _Tp& unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k) {
1746 _Tp& unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](key_type&& __k) {
1756 typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__node_holder
1757 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__construct_node_with_key(const key_type& __k) {
1768 _Tp& unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k) {
1781 _Tp& unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::at(const key_type& __k) {
1784 __throw_out_of_range("unordered_map::at: key not found");
1789 const _Tp& unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::at(const key_type& __k) const {
1792 __throw_out_of_range("unordered_map::at: key not found");
1798 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, unordered_map<_Key, _Tp, _Hash, _Pred, _A…
1805 inline _LIBCPP_HIDE_FROM_ABI typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::size_type
1806 erase_if(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __c, _Predicate __pred) {
1812 _LIBCPP_HIDE_FROM_ABI bool operator==(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1813 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) {
1816 typedef typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator const_iterator;
1828 inline _LIBCPP_HIDE_FROM_ABI bool operator!=(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& …
1829 … const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) {
1894 friend class _LIBCPP_TEMPLATE_VIS unordered_map;
2115 …_LIBCPP_HIDE_FROM_ABI void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>& _…
2121 …_LIBCPP_HIDE_FROM_ABI void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>&& …
2540 using unordered_map _LIBCPP_AVAILABILITY_PMR =
2541 …std::unordered_map<_KeyT, _ValueT, _HashT, _PredT, polymorphic_allocator<std::pair<const _KeyT, _V…