Lines Matching refs:const_iterator
39 typedef implementation-defined const_iterator;
41 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
87 const_iterator begin() const noexcept;
89 const_iterator end() const noexcept;
96 const_iterator cbegin() const noexcept;
97 const_iterator cend() const noexcept;
110 iterator emplace_hint(const_iterator position, Args&&... args);
113 iterator insert(const_iterator position, const value_type& v);
114 iterator insert(const_iterator position, value_type&& v);
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);
152 const_iterator find(const key_type& k) const;
156 const_iterator find(const K& x) const; // C++14
166 const_iterator lower_bound(const key_type& k) const;
170 const_iterator lower_bound(const K& x) const; // C++14
173 const_iterator upper_bound(const key_type& k) const;
177 const_iterator upper_bound(const K& x) const; // C++14
179 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
183 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
264 typedef implementation-defined const_iterator;
266 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
311 const_iterator begin() const noexcept;
313 const_iterator end() const noexcept;
320 const_iterator cbegin() const noexcept;
321 const_iterator cend() const noexcept;
334 iterator emplace_hint(const_iterator position, Args&&... args);
337 iterator insert(const_iterator position, const value_type& v);
338 iterator insert(const_iterator position, value_type&& v);
343 node_type extract(const_iterator position); // C++17
346 iterator insert(const_iterator hint, node_type&& nh); // C++17
348 iterator erase(const_iterator position);
351 iterator erase(const_iterator first, const_iterator last);
376 const_iterator find(const key_type& k) const;
380 const_iterator find(const K& x) const; // C++14
390 const_iterator lower_bound(const key_type& k) const;
394 const_iterator lower_bound(const K& x) const; // C++14
397 const_iterator upper_bound(const key_type& k) const;
401 const_iterator upper_bound(const K& x) const; // C++14
404 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
408 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
545 typedef typename __base::const_iterator iterator;
546 typedef typename __base::const_iterator const_iterator;
548 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
683 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
687 const_iterator end() const _NOEXCEPT {return __tree_.end();}
703 const_iterator cbegin() const _NOEXCEPT {return begin();}
705 const_iterator cend() const _NOEXCEPT {return end();}
726 iterator emplace_hint(const_iterator __p, _Args&&... __args)
734 iterator insert(const_iterator __p, const value_type& __v)
741 for (const_iterator __e = cend(); __f != __l; ++__f)
751 iterator insert(const_iterator __p, value_type&& __v)
760 iterator erase(const_iterator __p) {return __tree_.erase(__p);}
765 iterator erase(const_iterator __f, const_iterator __l)
780 iterator insert(const_iterator __hint, node_type&& __nh)
793 node_type extract(const_iterator __it)
846 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
854 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
881 const_iterator lower_bound(const key_type& __k) const
891 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
899 const_iterator upper_bound(const key_type& __k) const
908 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
916 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
925 …typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::ty…
968 const_iterator __e = cend();
1082 typedef typename __base::const_iterator iterator;
1083 typedef typename __base::const_iterator const_iterator;
1085 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
1219 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
1223 const_iterator end() const _NOEXCEPT {return __tree_.end();}
1239 const_iterator cbegin() const _NOEXCEPT {return begin();}
1241 const_iterator cend() const _NOEXCEPT {return end();}
1262 iterator emplace_hint(const_iterator __p, _Args&&... __args)
1270 iterator insert(const_iterator __p, const value_type& __v)
1277 for (const_iterator __e = cend(); __f != __l; ++__f)
1287 iterator insert(const_iterator __p, value_type&& __v)
1296 iterator erase(const_iterator __p) {return __tree_.erase(__p);}
1300 iterator erase(const_iterator __f, const_iterator __l)
1315 iterator insert(const_iterator __hint, node_type&& __nh)
1328 node_type extract(const_iterator __it)
1382 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1390 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1417 const_iterator lower_bound(const key_type& __k) const
1427 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1435 const_iterator upper_bound(const key_type& __k) const
1444 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1452 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1461 …typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::ty…
1504 const_iterator __e = cend();