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
484 typedef typename __base::const_iterator iterator;
485 typedef typename __base::const_iterator const_iterator;
487 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
622 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
626 const_iterator end() const _NOEXCEPT {return __tree_.end();}
642 const_iterator cbegin() const _NOEXCEPT {return begin();}
644 const_iterator cend() const _NOEXCEPT {return end();}
665 iterator emplace_hint(const_iterator __p, _Args&&... __args)
673 iterator insert(const_iterator __p, const value_type& __v)
680 for (const_iterator __e = cend(); __f != __l; ++__f)
690 iterator insert(const_iterator __p, value_type&& __v)
699 iterator erase(const_iterator __p) {return __tree_.erase(__p);}
704 iterator erase(const_iterator __f, const_iterator __l)
719 iterator insert(const_iterator __hint, node_type&& __nh)
732 node_type extract(const_iterator __it)
785 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
793 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
820 const_iterator lower_bound(const key_type& __k) const
830 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
838 const_iterator upper_bound(const key_type& __k) const
847 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
855 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
864 …typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::ty…
905 const_iterator __e = cend();
1016 typedef typename __base::const_iterator iterator;
1017 typedef typename __base::const_iterator const_iterator;
1019 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
1153 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
1157 const_iterator end() const _NOEXCEPT {return __tree_.end();}
1173 const_iterator cbegin() const _NOEXCEPT {return begin();}
1175 const_iterator cend() const _NOEXCEPT {return end();}
1196 iterator emplace_hint(const_iterator __p, _Args&&... __args)
1204 iterator insert(const_iterator __p, const value_type& __v)
1211 for (const_iterator __e = cend(); __f != __l; ++__f)
1221 iterator insert(const_iterator __p, value_type&& __v)
1230 iterator erase(const_iterator __p) {return __tree_.erase(__p);}
1234 iterator erase(const_iterator __f, const_iterator __l)
1249 iterator insert(const_iterator __hint, node_type&& __nh)
1262 node_type extract(const_iterator __it)
1316 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1324 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1351 const_iterator lower_bound(const key_type& __k) const
1361 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1369 const_iterator upper_bound(const key_type& __k) const
1378 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1386 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1395 …typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::ty…
1436 const_iterator __e = cend();