Lines Matching refs:const_iterator
42 typedef /unspecified/ const_iterator;
102 const_iterator begin() const noexcept;
103 const_iterator end() const noexcept;
104 const_iterator cbegin() const noexcept;
105 const_iterator cend() const noexcept;
110 iterator emplace_hint(const_iterator position, Args&&... args);
113 iterator insert(const_iterator hint, const value_type& obj);
114 iterator insert(const_iterator hint, value_type&& obj);
119 node_type extract(const_iterator position); // C++17
122 iterator insert(const_iterator hint, node_type&& nh); // C++17
124 iterator erase(const_iterator position);
127 iterator erase(const_iterator first, const_iterator last);
148 const_iterator find(const key_type& k) const;
151 pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
207 typedef /unspecified/ const_iterator;
266 const_iterator begin() const noexcept;
267 const_iterator end() const noexcept;
268 const_iterator cbegin() const noexcept;
269 const_iterator cend() const noexcept;
274 iterator emplace_hint(const_iterator position, Args&&... args);
277 iterator insert(const_iterator hint, const value_type& obj);
278 iterator insert(const_iterator hint, value_type&& obj);
283 node_type extract(const_iterator position); // C++17
286 iterator insert(const_iterator hint, node_type&& nh); // C++17
288 iterator erase(const_iterator position);
291 iterator erase(const_iterator first, const_iterator last);
312 const_iterator find(const key_type& k) const;
315 pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
407 typedef typename __table::const_iterator iterator;
408 typedef typename __table::const_iterator const_iterator;
521 const_iterator begin() const _NOEXCEPT {return __table_.begin();}
523 const_iterator end() const _NOEXCEPT {return __table_.end();}
525 const_iterator cbegin() const _NOEXCEPT {return __table_.begin();}
527 const_iterator cend() const _NOEXCEPT {return __table_.end();}
537 iterator emplace_hint(const_iterator __p, _Args&&... __args)
540 "unordered_set::emplace_hint(const_iterator, args...) called with an iterator not"
545 iterator emplace_hint(const_iterator, _Args&&... __args)
554 iterator insert(const_iterator __p, value_type&& __x)
557 "unordered_set::insert(const_iterator, value_type&&) called with an iterator not"
562 iterator insert(const_iterator, value_type&& __x)
575 iterator insert(const_iterator __p, const value_type& __x)
578 … "unordered_set::insert(const_iterator, const value_type&) called with an iterator not"
583 iterator insert(const_iterator, const value_type& __x)
591 iterator erase(const_iterator __p) {return __table_.erase(__p);}
595 iterator erase(const_iterator __first, const_iterator __last)
610 iterator insert(const_iterator __h, node_type&& __nh)
623 node_type extract(const_iterator __it)
675 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
682 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
721 bool __dereferenceable(const const_iterator* __i) const
723 bool __decrementable(const const_iterator* __i) const
725 bool __addable(const const_iterator* __i, ptrdiff_t __n) const
727 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
958 typedef typename unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator
959 const_iterator;
960 for (const_iterator __i = __x.begin(), __ex = __x.end(), __ey = __y.end();
963 const_iterator __j = __y.find(*__i);
1007 typedef typename __table::const_iterator iterator;
1008 typedef typename __table::const_iterator const_iterator;
1118 const_iterator begin() const _NOEXCEPT {return __table_.begin();}
1120 const_iterator end() const _NOEXCEPT {return __table_.end();}
1122 const_iterator cbegin() const _NOEXCEPT {return __table_.begin();}
1124 const_iterator cend() const _NOEXCEPT {return __table_.end();}
1133 iterator emplace_hint(const_iterator __p, _Args&&... __args)
1139 iterator insert(const_iterator __p, value_type&& __x)
1150 iterator insert(const_iterator __p, const value_type& __x)
1167 iterator insert(const_iterator __hint, node_type&& __nh)
1175 node_type extract(const_iterator __position)
1221 iterator erase(const_iterator __p) {return __table_.erase(__p);}
1225 iterator erase(const_iterator __first, const_iterator __last)
1243 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
1250 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
1289 bool __dereferenceable(const const_iterator* __i) const
1291 bool __decrementable(const const_iterator* __i) const
1293 bool __addable(const const_iterator* __i, ptrdiff_t __n) const
1295 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
1528 typedef typename unordered_multiset<_Value, _Hash, _Pred, _Alloc>::const_iterator
1529 const_iterator;
1530 typedef pair<const_iterator, const_iterator> _EqRng;
1531 for (const_iterator __i = __x.begin(), __ex = __x.end(); __i != __ex;)