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
245 typedef implementation-defined const_iterator;
247 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
292 const_iterator begin() const noexcept;
294 const_iterator end() const noexcept;
301 const_iterator cbegin() const noexcept;
302 const_iterator cend() const noexcept;
315 iterator emplace_hint(const_iterator position, Args&&... args);
318 iterator insert(const_iterator position, const value_type& v);
319 iterator insert(const_iterator position, value_type&& v);
324 node_type extract(const_iterator position); // C++17
327 iterator insert(const_iterator hint, node_type&& nh); // C++17
329 iterator erase(const_iterator position);
332 iterator erase(const_iterator first, const_iterator last);
357 const_iterator find(const key_type& k) const;
361 const_iterator find(const K& x) const; // C++14
371 const_iterator lower_bound(const key_type& k) const;
375 const_iterator lower_bound(const K& x) const; // C++14
378 const_iterator upper_bound(const key_type& k) const;
382 const_iterator upper_bound(const K& x) const; // C++14
385 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
389 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
486 typedef typename __base::const_iterator iterator;
487 typedef typename __base::const_iterator const_iterator;
489 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
624 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
628 const_iterator end() const _NOEXCEPT {return __tree_.end();}
644 const_iterator cbegin() const _NOEXCEPT {return begin();}
646 const_iterator cend() const _NOEXCEPT {return end();}
667 iterator emplace_hint(const_iterator __p, _Args&&... __args)
675 iterator insert(const_iterator __p, const value_type& __v)
682 for (const_iterator __e = cend(); __f != __l; ++__f)
692 iterator insert(const_iterator __p, value_type&& __v)
701 iterator erase(const_iterator __p) {return __tree_.erase(__p);}
706 iterator erase(const_iterator __f, const_iterator __l)
721 iterator insert(const_iterator __hint, node_type&& __nh)
734 node_type extract(const_iterator __it)
787 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
795 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
822 const_iterator lower_bound(const key_type& __k) const
832 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
840 const_iterator upper_bound(const key_type& __k) const
849 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
857 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
866 …typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::ty…
907 const_iterator __e = cend();
1018 typedef typename __base::const_iterator iterator;
1019 typedef typename __base::const_iterator const_iterator;
1021 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
1155 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
1159 const_iterator end() const _NOEXCEPT {return __tree_.end();}
1175 const_iterator cbegin() const _NOEXCEPT {return begin();}
1177 const_iterator cend() const _NOEXCEPT {return end();}
1198 iterator emplace_hint(const_iterator __p, _Args&&... __args)
1206 iterator insert(const_iterator __p, const value_type& __v)
1213 for (const_iterator __e = cend(); __f != __l; ++__f)
1223 iterator insert(const_iterator __p, value_type&& __v)
1232 iterator erase(const_iterator __p) {return __tree_.erase(__p);}
1236 iterator erase(const_iterator __f, const_iterator __l)
1251 iterator insert(const_iterator __hint, node_type&& __nh)
1264 node_type extract(const_iterator __it)
1318 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1326 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1353 const_iterator lower_bound(const key_type& __k) const
1363 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1371 const_iterator upper_bound(const key_type& __k) const
1380 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1388 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1397 …typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::ty…
1438 const_iterator __e = cend();