Lines Matching refs:unordered_map
2 //===-------------------------- unordered_map -----------------------------===//
16 unordered_map synopsis
25 class unordered_map
50 unordered_map()
55 explicit unordered_map(size_type n, const hasher& hf = hasher(),
59 unordered_map(InputIterator f, InputIterator l,
63 explicit unordered_map(const allocator_type&);
64 unordered_map(const unordered_map&);
65 unordered_map(const unordered_map&, const Allocator&);
66 unordered_map(unordered_map&&)
71 unordered_map(unordered_map&&, const Allocator&);
72 unordered_map(initializer_list<value_type>, size_type n = 0,
75 unordered_map(size_type n, const allocator_type& a)
76 : unordered_map(n, hasher(), key_equal(), a) {} // C++14
77 unordered_map(size_type n, const hasher& hf, const allocator_type& a)
78 : unordered_map(n, hf, key_equal(), a) {} // C++14
80 unordered_map(InputIterator f, InputIterator l, size_type n, const allocator_type& a)
81 : unordered_map(f, l, n, hasher(), key_equal(), a) {} // C++14
83 unordered_map(InputIterator f, InputIterator l, size_type n, const hasher& hf,
85 : unordered_map(f, l, n, hf, key_equal(), a) {} // C++14
86 unordered_map(initializer_list<value_type> il, size_type n, const allocator_type& a)
87 : unordered_map(il, n, hasher(), key_equal(), a) {} // C++14
88 unordered_map(initializer_list<value_type> il, size_type n, const hasher& hf,
90 : unordered_map(il, n, hf, key_equal(), a) {} // C++14
91 ~unordered_map();
92 unordered_map& operator=(const unordered_map&);
93 unordered_map& operator=(unordered_map&&)
99 unordered_map& operator=(initializer_list<value_type>);
157 void merge(unordered_map<Key, T, H2, P2, Allocator>& source); // C++17
159 void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); // C++17
165 void swap(unordered_map&)
208 void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x,
209 unordered_map<Key, T, Hash, Pred, Alloc>& y)
214 operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
215 const unordered_map<Key, T, Hash, Pred, Alloc>& y);
219 operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
220 const unordered_map<Key, T, Hash, Pred, Alloc>& y);
342 void merge(unordered_map<Key, T, H2, P2, Allocator>& source); // C++17
344 void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); // C++17
777 template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
831 template <class, class, class, class, class> friend class _LIBCPP_TEMPLATE_VIS unordered_map;
842 class _LIBCPP_TEMPLATE_VIS unordered_map
899 friend class _LIBCPP_TEMPLATE_VIS unordered_map;
904 unordered_map()
911 explicit unordered_map(size_type __n, const hasher& __hf = hasher(),
913 unordered_map(size_type __n, const hasher& __hf,
917 unordered_map(_InputIterator __first, _InputIterator __last);
919 unordered_map(_InputIterator __first, _InputIterator __last,
923 unordered_map(_InputIterator __first, _InputIterator __last,
928 explicit unordered_map(const allocator_type& __a);
929 unordered_map(const unordered_map& __u);
930 unordered_map(const unordered_map& __u, const allocator_type& __a);
933 unordered_map(unordered_map&& __u)
935 unordered_map(unordered_map&& __u, const allocator_type& __a);
936 unordered_map(initializer_list<value_type> __il);
937 unordered_map(initializer_list<value_type> __il, size_type __n,
939 unordered_map(initializer_list<value_type> __il, size_type __n,
945 unordered_map(size_type __n, const allocator_type& __a)
946 : unordered_map(__n, hasher(), key_equal(), __a) {}
948 unordered_map(size_type __n, const hasher& __hf, const allocator_type& __a)
949 : unordered_map(__n, __hf, key_equal(), __a) {}
952 …unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& …
953 : unordered_map(__first, __last, __n, hasher(), key_equal(), __a) {}
956 … unordered_map(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf,
958 : unordered_map(__first, __last, __n, __hf, key_equal(), __a) {}
960 unordered_map(initializer_list<value_type> __il, size_type __n, const allocator_type& __a)
961 : unordered_map(__il, __n, hasher(), key_equal(), __a) {}
963 unordered_map(initializer_list<value_type> __il, size_type __n, const hasher& __hf,
965 : unordered_map(__il, __n, __hf, key_equal(), __a) {}
967 // ~unordered_map() = default;
969 unordered_map& operator=(const unordered_map& __u)
987 unordered_map& operator=(unordered_map&& __u)
990 unordered_map& operator=(initializer_list<value_type> __il);
1024 "unordered_map::insert(const_iterator, const value_type&) called with an iterator not"
1025 " referring to this unordered_map");
1048 "unordered_map::insert(const_iterator, const value_type&) called with an iterator not"
1049 " referring to this unordered_map");
1069 "unordered_map::insert(const_iterator, value_type&&) called with an iterator not"
1070 " referring to this unordered_map");
1088 "unordered_map::emplace_hint(const_iterator, args...) called with an iterator not"
1089 " referring to this unordered_map");
1123 "unordered_map::try_emplace(const_iterator, key, args...) called with an iterator not"
1124 " referring to this unordered_map");
1137 "unordered_map::try_emplace(const_iterator, key, args...) called with an iterator not"
1138 " referring to this unordered_map");
1203 "node_type with incompatible allocator passed to unordered_map::insert()");
1211 "node_type with incompatible allocator passed to unordered_map::insert()");
1229 void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>& __source)
1237 void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>&& __source)
1262 void swap(unordered_map& __u)
1350 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1361 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1374 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1385 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1396 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1410 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1423 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1424 const unordered_map& __u)
1435 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1436 const unordered_map& __u, const allocator_type& __a)
1450 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1451 unordered_map&& __u)
1462 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1463 unordered_map&& __u, const allocator_type& __a)
1484 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1494 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1507 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map(
1521 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&
1522 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(unordered_map&& __u)
1531 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&
1532 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(
1545 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
1556 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k)
1565 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](key_type&& __k)
1574 typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__node_holder
1575 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__construct_node_with_key(const key_type& __k)
1588 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k)
1603 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::at(const key_type& __k)
1608 throw out_of_range("unordered_map::at: key not found");
1615 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::at(const key_type& __k) const
1620 throw out_of_range("unordered_map::at: key not found");
1628 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1629 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1638 void erase_if(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __c, _Predicate __pred)
1644 operator==(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1645 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1649 typedef typename unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator
1664 operator!=(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1665 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1726 friend class _LIBCPP_TEMPLATE_VIS unordered_map;
1950 void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>& __source)
1958 void merge(unordered_map<key_type, mapped_type, _H2, _P2, allocator_type>&& __source)