Lines Matching refs:const
21 class Allocator = allocator<pair<const Key, T>>>
28 typedef pair<const key_type, mapped_type> value_type;
56 bool operator()(const value_type& x, const value_type& y) const;
65 explicit map(const key_compare& comp);
66 map(const key_compare& comp, const allocator_type& a);
69 const key_compare& comp = key_compare());
72 const key_compare& comp, const allocator_type& a);
73 map(const map& m);
78 explicit map(const allocator_type& a);
79 map(const map& m, const allocator_type& a);
80 map(map&& m, const allocator_type& a);
81 map(initializer_list<value_type> il, const key_compare& comp = key_compare());
82 map(initializer_list<value_type> il, const key_compare& comp, const allocator_type& a);
84 map(InputIterator first, InputIterator last, const allocator_type& a)
86 map(initializer_list<value_type> il, const allocator_type& a)
90 map& operator=(const map& m);
100 const_iterator begin() const noexcept;
102 const_iterator end() const noexcept;
105 const_reverse_iterator rbegin() const noexcept;
107 const_reverse_iterator rend() const noexcept;
109 const_iterator cbegin() const noexcept;
110 const_iterator cend() const noexcept;
111 const_reverse_iterator crbegin() const noexcept;
112 const_reverse_iterator crend() const noexcept;
115 bool empty() const noexcept;
116 size_type size() const noexcept;
117 size_type max_size() const noexcept;
120 mapped_type& operator[](const key_type& k);
123 mapped_type& at(const key_type& k);
124 const mapped_type& at(const key_type& k) const;
131 pair<iterator, bool> insert(const value_type& v);
135 iterator insert(const_iterator position, const value_type& v);
144 node_type extract(const key_type& x); // C++17
149 pair<iterator, bool> try_emplace(const key_type& k, Args&&... args); // C++17
153 iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); // C++17
157 pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj); // C++17
161 iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj); // C++17
167 size_type erase(const key_type& k);
185 allocator_type get_allocator() const noexcept;
186 key_compare key_comp() const;
187 value_compare value_comp() const;
190 iterator find(const key_type& k);
191 const_iterator find(const key_type& k) const;
193 iterator find(const K& x); // C++14
195 const_iterator find(const K& x) const; // C++14
198 size_type count(const K& x) const; // C++14
199 size_type count(const key_type& k) const;
201 bool contains(const key_type& x) const; // C++20
202 template<class K> bool contains(const K& x) const; // C++20
204 iterator lower_bound(const key_type& k);
205 const_iterator lower_bound(const key_type& k) const;
207 iterator lower_bound(const K& x); // C++14
209 const_iterator lower_bound(const K& x) const; // C++14
211 iterator upper_bound(const key_type& k);
212 const_iterator upper_bound(const key_type& k) const;
214 iterator upper_bound(const K& x); // C++14
216 const_iterator upper_bound(const K& x) const; // C++14
218 pair<iterator,iterator> equal_range(const key_type& k);
219 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
221 pair<iterator,iterator> equal_range(const K& x); // C++14
223 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
233 class Allocator = allocator<pair<const Key, T>>>
234 map(initializer_list<pair<const Key, T>>, Compare = Compare(), Allocator = Allocator())
243 map(initializer_list<pair<const Key, T>>, Allocator) -> map<Key, T, less<Key>, Allocator>; // C++17
247 operator==(const map<Key, T, Compare, Allocator>& x,
248 const map<Key, T, Compare, Allocator>& y);
252 operator< (const map<Key, T, Compare, Allocator>& x,
253 const map<Key, T, Compare, Allocator>& y);
257 operator!=(const map<Key, T, Compare, Allocator>& x,
258 const map<Key, T, Compare, Allocator>& y);
262 operator> (const map<Key, T, Compare, Allocator>& x,
263 const map<Key, T, Compare, Allocator>& y);
267 operator>=(const map<Key, T, Compare, Allocator>& x,
268 const map<Key, T, Compare, Allocator>& y);
272 operator<=(const map<Key, T, Compare, Allocator>& x,
273 const map<Key, T, Compare, Allocator>& y);
287 class Allocator = allocator<pair<const Key, T>>>
294 typedef pair<const key_type,mapped_type> value_type;
320 bool operator()(const value_type& x, const value_type& y) const;
329 explicit multimap(const key_compare& comp);
330 multimap(const key_compare& comp, const allocator_type& a);
332 multimap(InputIterator first, InputIterator last, const key_compare& comp);
334 multimap(InputIterator first, InputIterator last, const key_compare& comp,
335 const allocator_type& a);
336 multimap(const multimap& m);
341 explicit multimap(const allocator_type& a);
342 multimap(const multimap& m, const allocator_type& a);
343 multimap(multimap&& m, const allocator_type& a);
344 multimap(initializer_list<value_type> il, const key_compare& comp = key_compare());
345 multimap(initializer_list<value_type> il, const key_compare& comp,
346 const allocator_type& a);
348 multimap(InputIterator first, InputIterator last, const allocator_type& a)
350 multimap(initializer_list<value_type> il, const allocator_type& a)
354 multimap& operator=(const multimap& m);
364 const_iterator begin() const noexcept;
366 const_iterator end() const noexcept;
369 const_reverse_iterator rbegin() const noexcept;
371 const_reverse_iterator rend() const noexcept;
373 const_iterator cbegin() const noexcept;
374 const_iterator cend() const noexcept;
375 const_reverse_iterator crbegin() const noexcept;
376 const_reverse_iterator crend() const noexcept;
379 bool empty() const noexcept;
380 size_type size() const noexcept;
381 size_type max_size() const noexcept;
388 iterator insert(const value_type& v);
392 iterator insert(const_iterator position, const value_type& v);
401 node_type extract(const key_type& x); // C++17
407 size_type erase(const key_type& k);
425 allocator_type get_allocator() const noexcept;
426 key_compare key_comp() const;
427 value_compare value_comp() const;
430 iterator find(const key_type& k);
431 const_iterator find(const key_type& k) const;
433 iterator find(const K& x); // C++14
435 const_iterator find(const K& x) const; // C++14
438 size_type count(const K& x) const; // C++14
439 size_type count(const key_type& k) const;
441 bool contains(const key_type& x) const; // C++20
442 template<class K> bool contains(const K& x) const; // C++20
444 iterator lower_bound(const key_type& k);
445 const_iterator lower_bound(const key_type& k) const;
447 iterator lower_bound(const K& x); // C++14
449 const_iterator lower_bound(const K& x) const; // C++14
451 iterator upper_bound(const key_type& k);
452 const_iterator upper_bound(const key_type& k) const;
454 iterator upper_bound(const K& x); // C++14
456 const_iterator upper_bound(const K& x) const; // C++14
458 pair<iterator,iterator> equal_range(const key_type& k);
459 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
461 pair<iterator,iterator> equal_range(const K& x); // C++14
463 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
473 class Allocator = allocator<pair<const Key, T>>>
474 multimap(initializer_list<pair<const Key, T>>, Compare = Compare(), Allocator = Allocator())
483 multimap(initializer_list<pair<const Key, T>>, Allocator)
488 operator==(const multimap<Key, T, Compare, Allocator>& x,
489 const multimap<Key, T, Compare, Allocator>& y);
493 operator< (const multimap<Key, T, Compare, Allocator>& x,
494 const multimap<Key, T, Compare, Allocator>& y);
498 operator!=(const multimap<Key, T, Compare, Allocator>& x,
499 const multimap<Key, T, Compare, Allocator>& y);
503 operator> (const multimap<Key, T, Compare, Allocator>& x,
504 const multimap<Key, T, Compare, Allocator>& y);
508 operator>=(const multimap<Key, T, Compare, Allocator>& x,
509 const multimap<Key, T, Compare, Allocator>& y);
513 operator<=(const multimap<Key, T, Compare, Allocator>& x,
514 const multimap<Key, T, Compare, Allocator>& y);
589 const _Compare& key_comp() const _NOEXCEPT {return *this;}
591 bool operator()(const _CP& __x, const _CP& __y) const
592 … {return static_cast<const _Compare&>(*this)(__x.__get_value().first, __y.__get_value().first);}
594 bool operator()(const _CP& __x, const _Key& __y) const
595 {return static_cast<const _Compare&>(*this)(__x.__get_value().first, __y);}
597 bool operator()(const _Key& __x, const _CP& __y) const
598 {return static_cast<const _Compare&>(*this)(__x, __y.__get_value().first);}
609 bool operator()(const _K2& __x, const _CP& __y) const
610 {return static_cast<const _Compare&>(*this)(__x, __y.__get_value().first);}
614 bool operator()(const _CP& __x, const _K2& __y) const
615 {return static_cast<const _Compare&>(*this)(__x.__get_value().first, __y);}
634 const _Compare& key_comp() const _NOEXCEPT {return comp;}
637 bool operator()(const _CP& __x, const _CP& __y) const
640 bool operator()(const _CP& __x, const _Key& __y) const
643 bool operator()(const _Key& __x, const _CP& __y) const
655 bool operator()(const _K2& __x, const _CP& __y) const
660 bool operator()(const _CP& __x, const _K2& __y) const
687 __map_node_destructor& operator=(const __map_node_destructor&);
736 typedef pair<const key_type, mapped_type> value_type;
755 const value_type& __get_value() const
781 __value_type& operator=(const __value_type& __v)
807 __value_type(const __value_type&) = delete;
818 typedef pair<const key_type, mapped_type> value_type;
827 const value_type& __get_value() const { return __cc; }
831 __value_type(__value_type const&);
832 __value_type& operator=(__value_type const&);
844 typedef _Key const __key_type;
870 reference operator*() const {return __i_->__get_value();}
872 pointer operator->() const {return pointer_traits<pointer>::pointer_to(__i_->__get_value());}
895 bool operator==(const __map_iterator& __x, const __map_iterator& __y)
899 bool operator!=(const __map_iterator& __x, const __map_iterator& __y)
919 typedef const value_type& reference;
933 reference operator*() const {return __i_->__get_value();}
935 pointer operator->() const {return pointer_traits<pointer>::pointer_to(__i_->__get_value());}
958 bool operator==(const __map_const_iterator& __x, const __map_const_iterator& __y)
961 bool operator!=(const __map_const_iterator& __x, const __map_const_iterator& __y)
970 class _Allocator = allocator<pair<const _Key, _Tp> > >
977 typedef pair<const key_type, mapped_type> value_type;
981 typedef const value_type& const_reference;
996 bool operator()(const value_type& __x, const value_type& __y) const
1041 explicit map(const key_compare& __comp)
1048 explicit map(const key_compare& __comp, const allocator_type& __a)
1054 const key_compare& __comp = key_compare())
1063 const key_compare& __comp, const allocator_type& __a)
1072 map(_InputIterator __f, _InputIterator __l, const allocator_type& __a)
1077 map(const map& __m)
1084 map& operator=(const map& __m)
1108 map(map&& __m, const allocator_type& __a);
1119 map(initializer_list<value_type> __il, const key_compare& __comp = key_compare())
1126 map(initializer_list<value_type> __il, const key_compare& __comp, const allocator_type& __a)
1134 map(initializer_list<value_type> __il, const allocator_type& __a)
1148 explicit map(const allocator_type& __a)
1154 map(const map& __m, const allocator_type& __a)
1168 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
1172 const_iterator end() const _NOEXCEPT {return __tree_.end();}
1177 const_reverse_iterator rbegin() const _NOEXCEPT
1183 const_reverse_iterator rend() const _NOEXCEPT
1187 const_iterator cbegin() const _NOEXCEPT {return begin();}
1189 const_iterator cend() const _NOEXCEPT {return end();}
1191 const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
1193 const_reverse_iterator crend() const _NOEXCEPT {return rend();}
1196 bool empty() const _NOEXCEPT {return __tree_.size() == 0;}
1198 size_type size() const _NOEXCEPT {return __tree_.size();}
1200 size_type max_size() const _NOEXCEPT {return __tree_.max_size();}
1202 mapped_type& operator[](const key_type& __k);
1207 mapped_type& at(const key_type& __k);
1208 const mapped_type& at(const key_type& __k) const;
1211 allocator_type get_allocator() const _NOEXCEPT {return allocator_type(__tree_.__alloc());}
1213 key_compare key_comp() const {return __tree_.value_comp().key_comp();}
1215 value_compare value_comp() const {return value_compare(__tree_.value_comp().key_comp());}
1246 insert(const value_type& __v) {return __tree_.__insert_unique(__v);}
1250 insert(const_iterator __p, const value_type& __v)
1279 pair<iterator, bool> try_emplace(const key_type& __k, _Args&&... __args)
1299 iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1319 pair<iterator, bool> insert_or_assign(const key_type& __k, _Vp&& __v)
1345 const key_type& __k,
1376 size_type erase(const key_type& __k)
1402 node_type extract(key_type const& __key)
1451 iterator find(const key_type& __k) {return __tree_.find(__k);}
1453 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1458 find(const _K2& __k) {return __tree_.find(__k);}
1462 find(const _K2& __k) const {return __tree_.find(__k);}
1466 size_type count(const key_type& __k) const
1472 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
1477 bool contains(const key_type& __k) const {return find(__k) != end();}
1481 contains(const _K2& __k) const { return find(__k) != end(); }
1485 iterator lower_bound(const key_type& __k)
1488 const_iterator lower_bound(const key_type& __k) const
1494 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
1499 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
1503 iterator upper_bound(const key_type& __k)
1506 const_iterator upper_bound(const key_type& __k) const
1512 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
1516 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
1520 pair<iterator,iterator> equal_range(const key_type& __k)
1523 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1529 equal_range(const _K2& __k) {return __tree_.__equal_range_multi(__k);}
1533 equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}
1547 __node_holder __construct_node_with_key(const key_type& __k);
1561 class _Allocator = allocator<pair<const _Key, _Tp>>,
1582 map<_Key, _Tp, _Compare, _Allocator>::map(map&& __m, const allocator_type& __a)
1596 map<_Key, _Tp, _Compare, _Allocator>::operator[](const key_type& __k)
1618 map<_Key, _Tp, _Compare, _Allocator>::__construct_node_with_key(const key_type& __k)
1631 map<_Key, _Tp, _Compare, _Allocator>::operator[](const key_type& __k)
1649 map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k)
1659 const _Tp&
1660 map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k) const
1673 operator==(const map<_Key, _Tp, _Compare, _Allocator>& __x,
1674 const map<_Key, _Tp, _Compare, _Allocator>& __y)
1682 operator< (const map<_Key, _Tp, _Compare, _Allocator>& __x,
1683 const map<_Key, _Tp, _Compare, _Allocator>& __y)
1691 operator!=(const map<_Key, _Tp, _Compare, _Allocator>& __x,
1692 const map<_Key, _Tp, _Compare, _Allocator>& __y)
1700 operator> (const map<_Key, _Tp, _Compare, _Allocator>& __x,
1701 const map<_Key, _Tp, _Compare, _Allocator>& __y)
1709 operator>=(const map<_Key, _Tp, _Compare, _Allocator>& __x,
1710 const map<_Key, _Tp, _Compare, _Allocator>& __y)
1718 operator<=(const map<_Key, _Tp, _Compare, _Allocator>& __x,
1719 const map<_Key, _Tp, _Compare, _Allocator>& __y)
1746 class _Allocator = allocator<pair<const _Key, _Tp> > >
1753 typedef pair<const key_type, mapped_type> value_type;
1757 typedef const value_type& const_reference;
1773 bool operator()(const value_type& __x, const value_type& __y) const
1817 explicit multimap(const key_compare& __comp)
1824 explicit multimap(const key_compare& __comp, const allocator_type& __a)
1830 const key_compare& __comp = key_compare())
1839 const key_compare& __comp, const allocator_type& __a)
1848 multimap(_InputIterator __f, _InputIterator __l, const allocator_type& __a)
1853 multimap(const multimap& __m)
1861 multimap& operator=(const multimap& __m)
1885 multimap(multimap&& __m, const allocator_type& __a);
1896 multimap(initializer_list<value_type> __il, const key_compare& __comp = key_compare())
1903 … multimap(initializer_list<value_type> __il, const key_compare& __comp, const allocator_type& __a)
1911 multimap(initializer_list<value_type> __il, const allocator_type& __a)
1925 explicit multimap(const allocator_type& __a)
1931 multimap(const multimap& __m, const allocator_type& __a)
1945 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
1949 const_iterator end() const _NOEXCEPT {return __tree_.end();}
1954 const_reverse_iterator rbegin() const _NOEXCEPT
1959 const_reverse_iterator rend() const _NOEXCEPT
1963 const_iterator cbegin() const _NOEXCEPT {return begin();}
1965 const_iterator cend() const _NOEXCEPT {return end();}
1967 const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
1969 const_reverse_iterator crend() const _NOEXCEPT {return rend();}
1972 bool empty() const _NOEXCEPT {return __tree_.size() == 0;}
1974 size_type size() const _NOEXCEPT {return __tree_.size();}
1976 size_type max_size() const _NOEXCEPT {return __tree_.max_size();}
1979 allocator_type get_allocator() const _NOEXCEPT {return allocator_type(__tree_.__alloc());}
1981 key_compare key_comp() const {return __tree_.value_comp().key_comp();}
1983 value_compare value_comp() const
2028 iterator insert(const value_type& __v) {return __tree_.__insert_multi(__v);}
2031 iterator insert(const_iterator __p, const value_type& __v)
2047 size_type erase(const key_type& __k) {return __tree_.__erase_multi(__k);}
2070 node_type extract(key_type const& __key)
2123 iterator find(const key_type& __k) {return __tree_.find(__k);}
2125 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
2130 find(const _K2& __k) {return __tree_.find(__k);}
2134 find(const _K2& __k) const {return __tree_.find(__k);}
2138 size_type count(const key_type& __k) const
2144 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
2149 bool contains(const key_type& __k) const {return find(__k) != end();}
2153 contains(const _K2& __k) const { return find(__k) != end(); }
2157 iterator lower_bound(const key_type& __k)
2160 const_iterator lower_bound(const key_type& __k) const
2166 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
2171 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
2175 iterator upper_bound(const key_type& __k)
2178 const_iterator upper_bound(const key_type& __k) const
2184 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
2188 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
2192 pair<iterator,iterator> equal_range(const key_type& __k)
2195 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
2201 equal_range(const _K2& __k) {return __tree_.__equal_range_multi(__k);}
2205 equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}
2227 class _Allocator = allocator<pair<const _Key, _Tp>>,
2248 multimap<_Key, _Tp, _Compare, _Allocator>::multimap(multimap&& __m, const allocator_type& __a)
2264 operator==(const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
2265 const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
2273 operator< (const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
2274 const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
2282 operator!=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
2283 const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
2291 operator> (const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
2292 const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
2300 operator>=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
2301 const multimap<_Key, _Tp, _Compare, _Allocator>& __y)
2309 operator<=(const multimap<_Key, _Tp, _Compare, _Allocator>& __x,
2310 const multimap<_Key, _Tp, _Compare, _Allocator>& __y)