Lines Matching refs:const
34 typedef const value_type& const_reference;
53 explicit unordered_set(size_type n, const hasher& hf = hasher(),
54 const key_equal& eql = key_equal(),
55 const allocator_type& a = allocator_type());
58 size_type n = 0, const hasher& hf = hasher(),
59 const key_equal& eql = key_equal(),
60 const allocator_type& a = allocator_type());
61 explicit unordered_set(const allocator_type&);
62 unordered_set(const unordered_set&);
63 unordered_set(const unordered_set&, const Allocator&);
69 unordered_set(unordered_set&&, const Allocator&);
71 const hasher& hf = hasher(), const key_equal& eql = key_equal(),
72 const allocator_type& a = allocator_type());
73 unordered_set(size_type n, const allocator_type& a); // C++14
74 unordered_set(size_type n, const hasher& hf, const allocator_type& a); // C++14
76 … unordered_set(InputIterator f, InputIterator l, size_type n, const allocator_type& a); // C++14
79 const hasher& hf, const allocator_type& a); // C++14
80 unordered_set(initializer_list<value_type> il, size_type n, const allocator_type& a); // C++14
82 const hasher& hf, const allocator_type& a); // C++14
84 unordered_set& operator=(const unordered_set&);
93 allocator_type get_allocator() const noexcept;
95 bool empty() const noexcept;
96 size_type size() const noexcept;
97 size_type max_size() const noexcept;
101 const_iterator begin() const noexcept;
102 const_iterator end() const noexcept;
103 const_iterator cbegin() const noexcept;
104 const_iterator cend() const noexcept;
110 pair<iterator, bool> insert(const value_type& obj);
112 iterator insert(const_iterator hint, const value_type& obj);
119 node_type extract(const key_type& x); // C++17
125 size_type erase(const key_type& k);
143 hasher hash_function() const;
144 key_equal key_eq() const;
146 iterator find(const key_type& k);
147 const_iterator find(const key_type& k) const;
149 iterator find(const K& x); // C++20
151 const_iterator find(const K& x) const; // C++20
152 size_type count(const key_type& k) const;
154 size_type count(const K& k) const; // C++20
155 bool contains(const key_type& k) const; // C++20
157 bool contains(const K& k) const; // C++20
158 pair<iterator, iterator> equal_range(const key_type& k);
159 pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
161 pair<iterator, iterator> equal_range(const K& k); // C++20
163 pair<const_iterator, const_iterator> equal_range(const K& k) const; // C++20
165 size_type bucket_count() const noexcept;
166 size_type max_bucket_count() const noexcept;
168 size_type bucket_size(size_type n) const;
169 size_type bucket(const key_type& k) const;
173 const_local_iterator begin(size_type n) const;
174 const_local_iterator end(size_type n) const;
175 const_local_iterator cbegin(size_type n) const;
176 const_local_iterator cend(size_type n) const;
178 float load_factor() const noexcept;
179 float max_load_factor() const noexcept;
229 operator==(const unordered_set<Value, Hash, Pred, Alloc>& x,
230 const unordered_set<Value, Hash, Pred, Alloc>& y);
234 operator!=(const unordered_set<Value, Hash, Pred, Alloc>& x,
235 const unordered_set<Value, Hash, Pred, Alloc>& y);
249 typedef const value_type& const_reference;
267 explicit unordered_multiset(size_type n, const hasher& hf = hasher(),
268 const key_equal& eql = key_equal(),
269 const allocator_type& a = allocator_type());
272 size_type n = 0, const hasher& hf = hasher(),
273 const key_equal& eql = key_equal(),
274 const allocator_type& a = allocator_type());
275 explicit unordered_multiset(const allocator_type&);
276 unordered_multiset(const unordered_multiset&);
277 unordered_multiset(const unordered_multiset&, const Allocator&);
283 unordered_multiset(unordered_multiset&&, const Allocator&);
285 const hasher& hf = hasher(), const key_equal& eql = key_equal(),
286 const allocator_type& a = allocator_type());
287 unordered_multiset(size_type n, const allocator_type& a); // C++14
288 unordered_multiset(size_type n, const hasher& hf, const allocator_type& a); // C++14
290 …unordered_multiset(InputIterator f, InputIterator l, size_type n, const allocator_type& a); // C++…
293 const hasher& hf, const allocator_type& a); // C++14
294 …unordered_multiset(initializer_list<value_type> il, size_type n, const allocator_type& a); // C++14
296 const hasher& hf, const allocator_type& a); // C++14
298 unordered_multiset& operator=(const unordered_multiset&);
307 allocator_type get_allocator() const noexcept;
309 bool empty() const noexcept;
310 size_type size() const noexcept;
311 size_type max_size() const noexcept;
315 const_iterator begin() const noexcept;
316 const_iterator end() const noexcept;
317 const_iterator cbegin() const noexcept;
318 const_iterator cend() const noexcept;
324 iterator insert(const value_type& obj);
326 iterator insert(const_iterator hint, const value_type& obj);
333 node_type extract(const key_type& x); // C++17
339 size_type erase(const key_type& k);
357 hasher hash_function() const;
358 key_equal key_eq() const;
360 iterator find(const key_type& k);
361 const_iterator find(const key_type& k) const;
363 iterator find(const K& x); // C++20
365 const_iterator find(const K& x) const; // C++20
366 size_type count(const key_type& k) const;
368 size_type count(const K& k) const; // C++20
369 bool contains(const key_type& k) const; // C++20
371 bool contains(const K& k) const; // C++20
372 pair<iterator, iterator> equal_range(const key_type& k);
373 pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
375 pair<iterator, iterator> equal_range(const K& k); // C++20
377 pair<const_iterator, const_iterator> equal_range(const K& k) const; // C++20
379 size_type bucket_count() const noexcept;
380 size_type max_bucket_count() const noexcept;
382 size_type bucket_size(size_type n) const;
383 size_type bucket(const key_type& k) const;
387 const_local_iterator begin(size_type n) const;
388 const_local_iterator end(size_type n) const;
389 const_local_iterator cbegin(size_type n) const;
390 const_local_iterator cend(size_type n) const;
392 float load_factor() const noexcept;
393 float max_load_factor() const noexcept;
451 operator==(const unordered_multiset<Value, Hash, Pred, Alloc>& x,
452 const unordered_multiset<Value, Hash, Pred, Alloc>& y);
456 operator!=(const unordered_multiset<Value, Hash, Pred, Alloc>& x,
457 const unordered_multiset<Value, Hash, Pred, Alloc>& y);
516 typedef const value_type& const_reference;
552 explicit unordered_set(size_type __n, const hasher& __hf = hasher(),
553 const key_equal& __eql = key_equal());
556 unordered_set(size_type __n, const allocator_type& __a)
559 unordered_set(size_type __n, const hasher& __hf, const allocator_type& __a)
562 unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql,
563 const allocator_type& __a);
568 size_type __n, const hasher& __hf = hasher(),
569 const key_equal& __eql = key_equal());
572 size_type __n, const hasher& __hf, const key_equal& __eql,
573 const allocator_type& __a);
578 size_type __n, const allocator_type& __a)
582 size_type __n, const hasher& __hf, const allocator_type& __a)
586 explicit unordered_set(const allocator_type& __a);
587 unordered_set(const unordered_set& __u);
588 unordered_set(const unordered_set& __u, const allocator_type& __a);
593 unordered_set(unordered_set&& __u, const allocator_type& __a);
596 const hasher& __hf = hasher(),
597 const key_equal& __eql = key_equal());
599 const hasher& __hf, const key_equal& __eql,
600 const allocator_type& __a);
604 const allocator_type& __a)
608 const hasher& __hf, const allocator_type& __a)
618 unordered_set& operator=(const unordered_set& __u)
632 allocator_type get_allocator() const _NOEXCEPT
636 bool empty() const _NOEXCEPT {return __table_.size() == 0;}
638 size_type size() const _NOEXCEPT {return __table_.size();}
640 size_type max_size() const _NOEXCEPT {return __table_.max_size();}
647 const_iterator begin() const _NOEXCEPT {return __table_.begin();}
649 const_iterator end() const _NOEXCEPT {return __table_.end();}
651 const_iterator cbegin() const _NOEXCEPT {return __table_.begin();}
653 const_iterator cend() const _NOEXCEPT {return __table_.end();}
687 pair<iterator, bool> insert(const value_type& __x)
691 iterator insert(const_iterator __p, const value_type& __x) {
693 "unordered_set::insert(const_iterator, const value_type&) called with an iterator not"
705 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
730 node_type extract(key_type const& __key)
780 hasher hash_function() const {return __table_.hash_function();}
782 key_equal key_eq() const {return __table_.key_eq();}
785 iterator find(const key_type& __k) {return __table_.find(__k);}
787 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
791 iterator find(const _K2& __k) {return __table_.find(__k);}
794 const_iterator find(const _K2& __k) const {return __table_.find(__k);}
798 size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
802 size_type count(const _K2& __k) const {return __table_.__count_unique(__k);}
807 bool contains(const key_type& __k) const {return find(__k) != end();}
811 bool contains(const _K2& __k) const {return find(__k) != end();}
815 pair<iterator, iterator> equal_range(const key_type& __k)
818 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
823 pair<iterator, iterator> equal_range(const _K2& __k)
827 pair<const_iterator, const_iterator> equal_range(const _K2& __k) const
832 size_type bucket_count() const _NOEXCEPT {return __table_.bucket_count();}
834 size_type max_bucket_count() const _NOEXCEPT {return __table_.max_bucket_count();}
837 size_type bucket_size(size_type __n) const {return __table_.bucket_size(__n);}
839 size_type bucket(const key_type& __k) const {return __table_.bucket(__k);}
846 const_local_iterator begin(size_type __n) const {return __table_.cbegin(__n);}
848 const_local_iterator end(size_type __n) const {return __table_.cend(__n);}
850 const_local_iterator cbegin(size_type __n) const {return __table_.cbegin(__n);}
852 const_local_iterator cend(size_type __n) const {return __table_.cend(__n);}
855 float load_factor() const _NOEXCEPT {return __table_.load_factor();}
857 float max_load_factor() const _NOEXCEPT {return __table_.max_load_factor();}
867 bool __dereferenceable(const const_iterator* __i) const
869 bool __decrementable(const const_iterator* __i) const
871 bool __addable(const const_iterator* __i, ptrdiff_t __n) const
873 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
941 const hasher& __hf, const key_equal& __eql)
950 const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
970 const hasher& __hf, const key_equal& __eql)
982 const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
993 const allocator_type& __a)
1001 const unordered_set& __u)
1011 const unordered_set& __u, const allocator_type& __a)
1034 unordered_set&& __u, const allocator_type& __a)
1058 initializer_list<value_type> __il, size_type __n, const hasher& __hf,
1059 const key_equal& __eql)
1069 initializer_list<value_type> __il, size_type __n, const hasher& __hf,
1070 const key_equal& __eql, const allocator_type& __a)
1134 operator==(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1135 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1154 operator!=(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1155 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1172 typedef const value_type& const_reference;
1207 explicit unordered_multiset(size_type __n, const hasher& __hf = hasher(),
1208 const key_equal& __eql = key_equal());
1209 unordered_multiset(size_type __n, const hasher& __hf,
1210 const key_equal& __eql, const allocator_type& __a);
1213 unordered_multiset(size_type __n, const allocator_type& __a)
1216 unordered_multiset(size_type __n, const hasher& __hf, const allocator_type& __a)
1223 size_type __n, const hasher& __hf = hasher(),
1224 const key_equal& __eql = key_equal());
1227 size_type __n , const hasher& __hf,
1228 const key_equal& __eql, const allocator_type& __a);
1233 size_type __n, const allocator_type& __a)
1238 size_type __n, const hasher& __hf, const allocator_type& __a)
1242 explicit unordered_multiset(const allocator_type& __a);
1243 unordered_multiset(const unordered_multiset& __u);
1244 unordered_multiset(const unordered_multiset& __u, const allocator_type& __a);
1249 unordered_multiset(unordered_multiset&& __u, const allocator_type& __a);
1252 const hasher& __hf = hasher(),
1253 const key_equal& __eql = key_equal());
1255 const hasher& __hf, const key_equal& __eql,
1256 const allocator_type& __a);
1259 unordered_multiset(initializer_list<value_type> __il, size_type __n, const allocator_type& __a)
1262 …unordered_multiset(initializer_list<value_type> __il, size_type __n, const hasher& __hf, const all…
1272 unordered_multiset& operator=(const unordered_multiset& __u)
1285 allocator_type get_allocator() const _NOEXCEPT
1289 bool empty() const _NOEXCEPT {return __table_.size() == 0;}
1291 size_type size() const _NOEXCEPT {return __table_.size();}
1293 size_type max_size() const _NOEXCEPT {return __table_.max_size();}
1300 const_iterator begin() const _NOEXCEPT {return __table_.begin();}
1302 const_iterator end() const _NOEXCEPT {return __table_.end();}
1304 const_iterator cbegin() const _NOEXCEPT {return __table_.begin();}
1306 const_iterator cend() const _NOEXCEPT {return __table_.end();}
1329 iterator insert(const value_type& __x) {return __table_.__insert_multi(__x);}
1332 iterator insert(const_iterator __p, const value_type& __x)
1363 node_type extract(key_type const& __key)
1405 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
1418 hasher hash_function() const {return __table_.hash_function();}
1420 key_equal key_eq() const {return __table_.key_eq();}
1423 iterator find(const key_type& __k) {return __table_.find(__k);}
1425 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
1429 iterator find(const _K2& __k) {return __table_.find(__k);}
1432 const_iterator find(const _K2& __k) const {return __table_.find(__k);}
1436 size_type count(const key_type& __k) const {return __table_.__count_multi(__k);}
1440 size_type count(const _K2& __k) const {return __table_.__count_multi(__k);}
1445 bool contains(const key_type& __k) const {return find(__k) != end();}
1449 bool contains(const _K2& __k) const {return find(__k) != end();}
1453 pair<iterator, iterator> equal_range(const key_type& __k)
1456 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
1461 pair<iterator, iterator> equal_range(const _K2& __k)
1465 pair<const_iterator, const_iterator> equal_range(const _K2& __k) const
1470 size_type bucket_count() const _NOEXCEPT {return __table_.bucket_count();}
1472 size_type max_bucket_count() const _NOEXCEPT {return __table_.max_bucket_count();}
1475 size_type bucket_size(size_type __n) const {return __table_.bucket_size(__n);}
1477 size_type bucket(const key_type& __k) const {return __table_.bucket(__k);}
1484 const_local_iterator begin(size_type __n) const {return __table_.cbegin(__n);}
1486 const_local_iterator end(size_type __n) const {return __table_.cend(__n);}
1488 const_local_iterator cbegin(size_type __n) const {return __table_.cbegin(__n);}
1490 const_local_iterator cend(size_type __n) const {return __table_.cend(__n);}
1493 float load_factor() const _NOEXCEPT {return __table_.load_factor();}
1495 float max_load_factor() const _NOEXCEPT {return __table_.max_load_factor();}
1505 bool __dereferenceable(const const_iterator* __i) const
1507 bool __decrementable(const const_iterator* __i) const
1509 bool __addable(const const_iterator* __i, ptrdiff_t __n) const
1511 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
1577 size_type __n, const hasher& __hf, const key_equal& __eql)
1586 size_type __n, const hasher& __hf, const key_equal& __eql,
1587 const allocator_type& __a)
1607 const hasher& __hf, const key_equal& __eql)
1619 const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
1630 const allocator_type& __a)
1638 const unordered_multiset& __u)
1648 const unordered_multiset& __u, const allocator_type& __a)
1671 unordered_multiset&& __u, const allocator_type& __a)
1695 initializer_list<value_type> __il, size_type __n, const hasher& __hf,
1696 const key_equal& __eql)
1706 initializer_list<value_type> __il, size_type __n, const hasher& __hf,
1707 const key_equal& __eql, const allocator_type& __a)
1772 operator==(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1773 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1796 operator!=(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1797 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)