Lines Matching refs:const_iterator
41 typedef /unspecified/ const_iterator;
101 const_iterator begin() const noexcept;
102 const_iterator end() const noexcept;
103 const_iterator cbegin() const noexcept;
104 const_iterator cend() const noexcept;
109 iterator emplace_hint(const_iterator position, Args&&... args);
112 iterator insert(const_iterator hint, const value_type& obj);
113 iterator insert(const_iterator hint, value_type&& obj);
118 node_type extract(const_iterator position); // C++17
121 iterator insert(const_iterator hint, node_type&& nh); // C++17
123 iterator erase(const_iterator position);
126 iterator erase(const_iterator first, const_iterator last);
147 const_iterator find(const key_type& k) const;
151 const_iterator find(const K& x) const; // C++20
159 pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
163 pair<const_iterator, const_iterator> equal_range(const K& k) const; // C++20
219 typedef /unspecified/ const_iterator;
278 const_iterator begin() const noexcept;
279 const_iterator end() const noexcept;
280 const_iterator cbegin() const noexcept;
281 const_iterator cend() const noexcept;
286 iterator emplace_hint(const_iterator position, Args&&... args);
289 iterator insert(const_iterator hint, const value_type& obj);
290 iterator insert(const_iterator hint, value_type&& obj);
295 node_type extract(const_iterator position); // C++17
298 iterator insert(const_iterator hint, node_type&& nh); // C++17
300 iterator erase(const_iterator position);
303 iterator erase(const_iterator first, const_iterator last);
324 const_iterator find(const key_type& k) const;
328 const_iterator find(const K& x) const; // C++20
336 pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
340 pair<const_iterator, const_iterator> equal_range(const K& k) const; // C++20
436 typedef typename __table::const_iterator iterator;
437 typedef typename __table::const_iterator const_iterator;
554 const_iterator begin() const _NOEXCEPT {return __table_.begin();}
556 const_iterator end() const _NOEXCEPT {return __table_.end();}
558 const_iterator cbegin() const _NOEXCEPT {return __table_.begin();}
560 const_iterator cend() const _NOEXCEPT {return __table_.end();}
570 iterator emplace_hint(const_iterator __p, _Args&&... __args)
573 "unordered_set::emplace_hint(const_iterator, args...) called with an iterator not"
578 iterator emplace_hint(const_iterator, _Args&&... __args)
587 iterator insert(const_iterator __p, value_type&& __x)
590 "unordered_set::insert(const_iterator, value_type&&) called with an iterator not"
595 iterator insert(const_iterator, value_type&& __x)
608 iterator insert(const_iterator __p, const value_type& __x)
611 … "unordered_set::insert(const_iterator, const value_type&) called with an iterator not"
616 iterator insert(const_iterator, const value_type& __x)
624 iterator erase(const_iterator __p) {return __table_.erase(__p);}
628 iterator erase(const_iterator __first, const_iterator __last)
643 iterator insert(const_iterator __h, node_type&& __nh)
656 node_type extract(const_iterator __it)
708 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
716 …If<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value, const_iterator>
740 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
749 …sher, _K2>::value && __is_transparent<key_equal, _K2>::value, pair<const_iterator, const_iterator>>
789 bool __dereferenceable(const const_iterator* __i) const
791 bool __decrementable(const const_iterator* __i) const
793 bool __addable(const const_iterator* __i, ptrdiff_t __n) const
795 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
1086 typedef typename unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator
1087 const_iterator;
1088 for (const_iterator __i = __x.begin(), __ex = __x.end(), __ey = __y.end();
1091 const_iterator __j = __y.find(*__i);
1134 typedef typename __table::const_iterator iterator;
1135 typedef typename __table::const_iterator const_iterator;
1249 const_iterator begin() const _NOEXCEPT {return __table_.begin();}
1251 const_iterator end() const _NOEXCEPT {return __table_.end();}
1253 const_iterator cbegin() const _NOEXCEPT {return __table_.begin();}
1255 const_iterator cend() const _NOEXCEPT {return __table_.end();}
1264 iterator emplace_hint(const_iterator __p, _Args&&... __args)
1270 iterator insert(const_iterator __p, value_type&& __x)
1281 iterator insert(const_iterator __p, const value_type& __x)
1298 iterator insert(const_iterator __hint, node_type&& __nh)
1306 node_type extract(const_iterator __position)
1352 iterator erase(const_iterator __p) {return __table_.erase(__p);}
1356 iterator erase(const_iterator __first, const_iterator __last)
1374 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
1382 …If<__is_transparent<hasher, _K2>::value && __is_transparent<key_equal, _K2>::value, const_iterator>
1406 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
1415 …sher, _K2>::value && __is_transparent<key_equal, _K2>::value, pair<const_iterator, const_iterator>>
1455 bool __dereferenceable(const const_iterator* __i) const
1457 bool __decrementable(const const_iterator* __i) const
1459 bool __addable(const const_iterator* __i, ptrdiff_t __n) const
1461 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
1752 typedef typename unordered_multiset<_Value, _Hash, _Pred, _Alloc>::const_iterator
1753 const_iterator;
1754 typedef pair<const_iterator, const_iterator> _EqRng;
1755 for (const_iterator __i = __x.begin(), __ex = __x.end(); __i != __ex;)