Lines Matching refs:const_iterator
40 typedef implementation-defined const_iterator;
42 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
88 const_iterator begin() const noexcept;
90 const_iterator end() const noexcept;
97 const_iterator cbegin() const noexcept;
98 const_iterator cend() const noexcept;
111 iterator emplace_hint(const_iterator position, Args&&... args);
114 iterator insert(const_iterator position, const value_type& v);
115 iterator insert(const_iterator position, value_type&& v);
120 node_type extract(const_iterator position); // C++17
123 iterator insert(const_iterator hint, node_type&& nh); // C++17
125 iterator erase(const_iterator position);
128 iterator erase(const_iterator first, const_iterator last);
153 const_iterator find(const key_type& k) const;
157 const_iterator find(const K& x) const; // C++14
163 const_iterator lower_bound(const key_type& k) const;
167 const_iterator lower_bound(const K& x) const; // C++14
170 const_iterator upper_bound(const key_type& k) const;
174 const_iterator upper_bound(const K& x) const; // C++14
176 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
180 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
241 typedef implementation-defined const_iterator;
243 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
288 const_iterator begin() const noexcept;
290 const_iterator end() const noexcept;
297 const_iterator cbegin() const noexcept;
298 const_iterator cend() const noexcept;
311 iterator emplace_hint(const_iterator position, Args&&... args);
314 iterator insert(const_iterator position, const value_type& v);
315 iterator insert(const_iterator position, value_type&& v);
320 node_type extract(const_iterator position); // C++17
323 iterator insert(const_iterator hint, node_type&& nh); // C++17
325 iterator erase(const_iterator position);
328 iterator erase(const_iterator first, const_iterator last);
353 const_iterator find(const key_type& k) const;
357 const_iterator find(const K& x) const; // C++14
361 const_iterator lower_bound(const key_type& k) const;
365 const_iterator lower_bound(const K& x) const; // C++14
368 const_iterator upper_bound(const key_type& k) const;
372 const_iterator upper_bound(const K& x) const; // C++14
375 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
379 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
470 typedef typename __base::const_iterator iterator;
471 typedef typename __base::const_iterator const_iterator;
473 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
603 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
607 const_iterator end() const _NOEXCEPT {return __tree_.end();}
623 const_iterator cbegin() const _NOEXCEPT {return begin();}
625 const_iterator cend() const _NOEXCEPT {return end();}
646 iterator emplace_hint(const_iterator __p, _Args&&... __args)
654 iterator insert(const_iterator __p, const value_type& __v)
661 for (const_iterator __e = cend(); __f != __l; ++__f)
671 iterator insert(const_iterator __p, value_type&& __v)
680 iterator erase(const_iterator __p) {return __tree_.erase(__p);}
685 iterator erase(const_iterator __f, const_iterator __l)
700 iterator insert(const_iterator __hint, node_type&& __nh)
713 node_type extract(const_iterator __it)
766 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
774 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
791 const_iterator lower_bound(const key_type& __k) const
801 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
809 const_iterator upper_bound(const key_type& __k) const
818 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
826 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
835 …typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::ty…
848 const_iterator __e = cend();
958 typedef typename __base::const_iterator iterator;
959 typedef typename __base::const_iterator const_iterator;
961 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
1090 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
1094 const_iterator end() const _NOEXCEPT {return __tree_.end();}
1110 const_iterator cbegin() const _NOEXCEPT {return begin();}
1112 const_iterator cend() const _NOEXCEPT {return end();}
1133 iterator emplace_hint(const_iterator __p, _Args&&... __args)
1141 iterator insert(const_iterator __p, const value_type& __v)
1148 for (const_iterator __e = cend(); __f != __l; ++__f)
1158 iterator insert(const_iterator __p, value_type&& __v)
1167 iterator erase(const_iterator __p) {return __tree_.erase(__p);}
1171 iterator erase(const_iterator __f, const_iterator __l)
1186 iterator insert(const_iterator __hint, node_type&& __nh)
1199 node_type extract(const_iterator __it)
1253 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1261 typename _VSTD::enable_if<_VSTD::__is_transparent<_Compare, _K2>::value,const_iterator>::type
1279 const_iterator lower_bound(const key_type& __k) const
1289 typename _VSTD::enable_if<_VSTD::__is_transparent<_Compare, _K2>::value,const_iterator>::type
1297 const_iterator upper_bound(const key_type& __k) const
1306 typename _VSTD::enable_if<_VSTD::__is_transparent<_Compare, _K2>::value,const_iterator>::type
1314 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1323 …:enable_if<_VSTD::__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::type
1336 const_iterator __e = cend();