Lines Matching refs:const
51 explicit set(const value_compare& comp);
52 set(const value_compare& comp, const allocator_type& a);
55 const value_compare& comp = value_compare());
57 set(InputIterator first, InputIterator last, const value_compare& comp,
58 const allocator_type& a);
59 set(const set& s);
64 explicit set(const allocator_type& a);
65 set(const set& s, const allocator_type& a);
66 set(set&& s, const allocator_type& a);
67 set(initializer_list<value_type> il, const value_compare& comp = value_compare());
68 set(initializer_list<value_type> il, const value_compare& comp,
69 const allocator_type& a);
71 set(InputIterator first, InputIterator last, const allocator_type& a)
73 set(initializer_list<value_type> il, const allocator_type& a)
77 set& operator=(const set& s);
87 const_iterator begin() const noexcept;
89 const_iterator end() const noexcept;
92 const_reverse_iterator rbegin() const noexcept;
94 const_reverse_iterator rend() const noexcept;
96 const_iterator cbegin() const noexcept;
97 const_iterator cend() const noexcept;
98 const_reverse_iterator crbegin() const noexcept;
99 const_reverse_iterator crend() const noexcept;
102 bool empty() const noexcept;
103 size_type size() const noexcept;
104 size_type max_size() const noexcept;
111 pair<iterator,bool> insert(const value_type& v);
113 iterator insert(const_iterator position, const value_type& v);
120 node_type extract(const key_type& x); // C++17
126 size_type erase(const key_type& k);
146 allocator_type get_allocator() const noexcept;
147 key_compare key_comp() const;
148 value_compare value_comp() const;
151 iterator find(const key_type& k);
152 const_iterator find(const key_type& k) const;
154 iterator find(const K& x);
156 const_iterator find(const K& x) const; // C++14
159 size_type count(const K& x) const; // C++14
160 size_type count(const key_type& k) const;
162 bool contains(const key_type& x) const; // C++20
163 template<class K> bool contains(const K& x) const; // C++20
165 iterator lower_bound(const key_type& k);
166 const_iterator lower_bound(const key_type& k) const;
168 iterator lower_bound(const K& x); // C++14
170 const_iterator lower_bound(const K& x) const; // C++14
172 iterator upper_bound(const key_type& k);
173 const_iterator upper_bound(const key_type& k) const;
175 iterator upper_bound(const K& x); // C++14
177 const_iterator upper_bound(const K& x) const; // C++14
178 pair<iterator,iterator> equal_range(const key_type& k);
179 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
181 pair<iterator,iterator> equal_range(const K& x); // C++14
183 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
207 operator==(const set<Key, Compare, Allocator>& x,
208 const set<Key, Compare, Allocator>& y);
212 operator< (const set<Key, Compare, Allocator>& x,
213 const set<Key, Compare, Allocator>& y);
217 operator!=(const set<Key, Compare, Allocator>& x,
218 const set<Key, Compare, Allocator>& y);
222 operator> (const set<Key, Compare, Allocator>& x,
223 const set<Key, Compare, Allocator>& y);
227 operator>=(const set<Key, Compare, Allocator>& x,
228 const set<Key, Compare, Allocator>& y);
232 operator<=(const set<Key, Compare, Allocator>& x,
233 const set<Key, Compare, Allocator>& y);
275 explicit multiset(const value_compare& comp);
276 multiset(const value_compare& comp, const allocator_type& a);
279 const value_compare& comp = value_compare());
282 const value_compare& comp, const allocator_type& a);
283 multiset(const multiset& s);
288 explicit multiset(const allocator_type& a);
289 multiset(const multiset& s, const allocator_type& a);
290 multiset(multiset&& s, const allocator_type& a);
291 multiset(initializer_list<value_type> il, const value_compare& comp = value_compare());
292 multiset(initializer_list<value_type> il, const value_compare& comp,
293 const allocator_type& a);
295 multiset(InputIterator first, InputIterator last, const allocator_type& a)
297 multiset(initializer_list<value_type> il, const allocator_type& a)
301 multiset& operator=(const multiset& s);
311 const_iterator begin() const noexcept;
313 const_iterator end() const noexcept;
316 const_reverse_iterator rbegin() const noexcept;
318 const_reverse_iterator rend() const noexcept;
320 const_iterator cbegin() const noexcept;
321 const_iterator cend() const noexcept;
322 const_reverse_iterator crbegin() const noexcept;
323 const_reverse_iterator crend() const noexcept;
326 bool empty() const noexcept;
327 size_type size() const noexcept;
328 size_type max_size() const noexcept;
335 iterator insert(const value_type& v);
337 iterator insert(const_iterator position, const value_type& v);
344 node_type extract(const key_type& x); // C++17
350 size_type erase(const key_type& k);
370 allocator_type get_allocator() const noexcept;
371 key_compare key_comp() const;
372 value_compare value_comp() const;
375 iterator find(const key_type& k);
376 const_iterator find(const key_type& k) const;
378 iterator find(const K& x);
380 const_iterator find(const K& x) const; // C++14
383 size_type count(const K& x) const; // C++14
384 size_type count(const key_type& k) const;
386 bool contains(const key_type& x) const; // C++20
387 template<class K> bool contains(const K& x) const; // C++20
389 iterator lower_bound(const key_type& k);
390 const_iterator lower_bound(const key_type& k) const;
392 iterator lower_bound(const K& x); // C++14
394 const_iterator lower_bound(const K& x) const; // C++14
396 iterator upper_bound(const key_type& k);
397 const_iterator upper_bound(const key_type& k) const;
399 iterator upper_bound(const K& x); // C++14
401 const_iterator upper_bound(const K& x) const; // C++14
403 pair<iterator,iterator> equal_range(const key_type& k);
404 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
406 pair<iterator,iterator> equal_range(const K& x); // C++14
408 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
432 operator==(const multiset<Key, Compare, Allocator>& x,
433 const multiset<Key, Compare, Allocator>& y);
437 operator< (const multiset<Key, Compare, Allocator>& x,
438 const multiset<Key, Compare, Allocator>& y);
442 operator!=(const multiset<Key, Compare, Allocator>& x,
443 const multiset<Key, Compare, Allocator>& y);
447 operator> (const multiset<Key, Compare, Allocator>& x,
448 const multiset<Key, Compare, Allocator>& y);
452 operator>=(const multiset<Key, Compare, Allocator>& x,
453 const multiset<Key, Compare, Allocator>& y);
457 operator<=(const multiset<Key, Compare, Allocator>& x,
458 const multiset<Key, Compare, Allocator>& y);
527 typedef const value_type& const_reference;
567 explicit set(const value_compare& __comp)
574 explicit set(const value_compare& __comp, const allocator_type& __a)
579 const value_compare& __comp = value_compare())
587 set(_InputIterator __f, _InputIterator __l, const value_compare& __comp,
588 const allocator_type& __a)
597 set(_InputIterator __f, _InputIterator __l, const allocator_type& __a)
602 set(const set& __s)
609 set& operator=(const set& __s)
623 explicit set(const allocator_type& __a)
627 set(const set& __s, const allocator_type& __a)
634 set(set&& __s, const allocator_type& __a);
637 set(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
644 set(initializer_list<value_type> __il, const value_compare& __comp,
645 const allocator_type& __a)
653 set(initializer_list<value_type> __il, const allocator_type& __a)
681 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
685 const_iterator end() const _NOEXCEPT {return __tree_.end();}
691 const_reverse_iterator rbegin() const _NOEXCEPT
697 const_reverse_iterator rend() const _NOEXCEPT
701 const_iterator cbegin() const _NOEXCEPT {return begin();}
703 const_iterator cend() const _NOEXCEPT {return end();}
705 const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
707 const_reverse_iterator crend() const _NOEXCEPT {return rend();}
710 bool empty() const _NOEXCEPT {return __tree_.size() == 0;}
712 size_type size() const _NOEXCEPT {return __tree_.size();}
714 size_type max_size() const _NOEXCEPT {return __tree_.max_size();}
729 pair<iterator,bool> insert(const value_type& __v)
732 iterator insert(const_iterator __p, const value_type& __v)
760 size_type erase(const key_type& __k)
786 node_type extract(key_type const& __key)
834 allocator_type get_allocator() const _NOEXCEPT {return __tree_.__alloc();}
836 key_compare key_comp() const {return __tree_.value_comp();}
838 value_compare value_comp() const {return __tree_.value_comp();}
842 iterator find(const key_type& __k) {return __tree_.find(__k);}
844 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
849 find(const _K2& __k) {return __tree_.find(__k);}
853 find(const _K2& __k) const {return __tree_.find(__k);}
857 size_type count(const key_type& __k) const
863 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
868 bool contains(const key_type& __k) const {return find(__k) != end();}
872 contains(const _K2& __k) const { return find(__k) != end(); }
876 iterator lower_bound(const key_type& __k)
879 const_iterator lower_bound(const key_type& __k) const
885 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
890 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
894 iterator upper_bound(const key_type& __k)
897 const_iterator upper_bound(const key_type& __k) const
903 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
907 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
911 pair<iterator,iterator> equal_range(const key_type& __k)
914 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
920 equal_range(const _K2& __k) {return __tree_.__equal_range_multi(__k);}
924 equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}
961 set<_Key, _Compare, _Allocator>::set(set&& __s, const allocator_type& __a)
977 operator==(const set<_Key, _Compare, _Allocator>& __x,
978 const set<_Key, _Compare, _Allocator>& __y)
986 operator< (const set<_Key, _Compare, _Allocator>& __x,
987 const set<_Key, _Compare, _Allocator>& __y)
995 operator!=(const set<_Key, _Compare, _Allocator>& __x,
996 const set<_Key, _Compare, _Allocator>& __y)
1004 operator> (const set<_Key, _Compare, _Allocator>& __x,
1005 const set<_Key, _Compare, _Allocator>& __y)
1013 operator>=(const set<_Key, _Compare, _Allocator>& __x,
1014 const set<_Key, _Compare, _Allocator>& __y)
1022 operator<=(const set<_Key, _Compare, _Allocator>& __x,
1023 const set<_Key, _Compare, _Allocator>& __y)
1060 typedef const value_type& const_reference;
1100 explicit multiset(const value_compare& __comp)
1107 explicit multiset(const value_compare& __comp, const allocator_type& __a)
1112 const value_compare& __comp = value_compare())
1121 multiset(_InputIterator __f, _InputIterator __l, const allocator_type& __a)
1128 const value_compare& __comp, const allocator_type& __a)
1135 multiset(const multiset& __s)
1143 multiset& operator=(const multiset& __s)
1155 multiset(multiset&& __s, const allocator_type& __a);
1158 explicit multiset(const allocator_type& __a)
1161 multiset(const multiset& __s, const allocator_type& __a)
1169 multiset(initializer_list<value_type> __il, const value_compare& __comp = value_compare())
1176 multiset(initializer_list<value_type> __il, const value_compare& __comp,
1177 const allocator_type& __a)
1185 multiset(initializer_list<value_type> __il, const allocator_type& __a)
1213 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
1217 const_iterator end() const _NOEXCEPT {return __tree_.end();}
1223 const_reverse_iterator rbegin() const _NOEXCEPT
1229 const_reverse_iterator rend() const _NOEXCEPT
1233 const_iterator cbegin() const _NOEXCEPT {return begin();}
1235 const_iterator cend() const _NOEXCEPT {return end();}
1237 const_reverse_iterator crbegin() const _NOEXCEPT {return rbegin();}
1239 const_reverse_iterator crend() const _NOEXCEPT {return rend();}
1242 bool empty() const _NOEXCEPT {return __tree_.size() == 0;}
1244 size_type size() const _NOEXCEPT {return __tree_.size();}
1246 size_type max_size() const _NOEXCEPT {return __tree_.max_size();}
1261 iterator insert(const value_type& __v)
1264 iterator insert(const_iterator __p, const value_type& __v)
1292 size_type erase(const key_type& __k) {return __tree_.__erase_multi(__k);}
1317 node_type extract(key_type const& __key)
1366 allocator_type get_allocator() const _NOEXCEPT {return __tree_.__alloc();}
1368 key_compare key_comp() const {return __tree_.value_comp();}
1370 value_compare value_comp() const {return __tree_.value_comp();}
1374 iterator find(const key_type& __k) {return __tree_.find(__k);}
1376 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1381 find(const _K2& __k) {return __tree_.find(__k);}
1385 find(const _K2& __k) const {return __tree_.find(__k);}
1389 size_type count(const key_type& __k) const
1395 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
1400 bool contains(const key_type& __k) const {return find(__k) != end();}
1404 contains(const _K2& __k) const { return find(__k) != end(); }
1408 iterator lower_bound(const key_type& __k)
1411 const_iterator lower_bound(const key_type& __k) const
1417 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
1422 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
1426 iterator upper_bound(const key_type& __k)
1429 const_iterator upper_bound(const key_type& __k) const
1435 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
1439 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
1443 pair<iterator,iterator> equal_range(const key_type& __k)
1446 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1452 equal_range(const _K2& __k) {return __tree_.__equal_range_multi(__k);}
1456 equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}
1493 multiset<_Key, _Compare, _Allocator>::multiset(multiset&& __s, const allocator_type& __a)
1509 operator==(const multiset<_Key, _Compare, _Allocator>& __x,
1510 const multiset<_Key, _Compare, _Allocator>& __y)
1518 operator< (const multiset<_Key, _Compare, _Allocator>& __x,
1519 const multiset<_Key, _Compare, _Allocator>& __y)
1527 operator!=(const multiset<_Key, _Compare, _Allocator>& __x,
1528 const multiset<_Key, _Compare, _Allocator>& __y)
1536 operator> (const multiset<_Key, _Compare, _Allocator>& __x,
1537 const multiset<_Key, _Compare, _Allocator>& __y)
1545 operator>=(const multiset<_Key, _Compare, _Allocator>& __x,
1546 const multiset<_Key, _Compare, _Allocator>& __y)
1554 operator<=(const multiset<_Key, _Compare, _Allocator>& __x,
1555 const multiset<_Key, _Compare, _Allocator>& __y)