Lines Matching refs:const_iterator
39 typedef implementation-defined const_iterator;
41 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
100 const_iterator begin() const noexcept;
102 const_iterator end() const noexcept;
109 const_iterator cbegin() const noexcept;
110 const_iterator cend() const noexcept;
130 iterator emplace_hint(const_iterator position, Args&&... args);
135 iterator insert(const_iterator position, const value_type& v);
136 iterator insert(const_iterator position, value_type&& v); // C++17
138 iterator insert(const_iterator position, P&& p);
143 node_type extract(const_iterator position); // C++17
146 iterator insert(const_iterator hint, node_type&& nh); // C++17
153 iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); // C++17
155 iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args); // C++17
161 iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj); // C++17
163 iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj); // C++17
165 iterator erase(const_iterator position);
168 iterator erase(const_iterator first, const_iterator last);
191 const_iterator find(const key_type& k) const;
195 const_iterator find(const K& x) const; // C++14
205 const_iterator lower_bound(const key_type& k) const;
209 const_iterator lower_bound(const K& x) const; // C++14
212 const_iterator upper_bound(const key_type& k) const;
216 const_iterator upper_bound(const K& x) const; // C++14
219 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
223 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
286 typedef implementation-defined const_iterator;
288 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
345 const_iterator begin() const noexcept;
347 const_iterator end() const noexcept;
354 const_iterator cbegin() const noexcept;
355 const_iterator cend() const noexcept;
368 iterator emplace_hint(const_iterator position, Args&&... args);
373 iterator insert(const_iterator position, const value_type& v);
374 iterator insert(const_iterator position, value_type&& v); // C++17
376 iterator insert(const_iterator position, P&& p);
381 node_type extract(const_iterator position); // C++17
384 iterator insert(const_iterator hint, node_type&& nh); // C++17
386 iterator erase(const_iterator position);
389 iterator erase(const_iterator first, const_iterator last);
412 const_iterator find(const key_type& k) const;
416 const_iterator find(const K& x) const; // C++14
426 const_iterator lower_bound(const key_type& k) const;
430 const_iterator lower_bound(const K& x) const; // C++14
433 const_iterator upper_bound(const key_type& k) const;
437 const_iterator upper_bound(const K& x) const; // C++14
440 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
444 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
972 typedef __map_const_iterator<typename __base::const_iterator> const_iterator;
974 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
1122 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
1126 const_iterator end() const _NOEXCEPT {return __tree_.end();}
1141 const_iterator cbegin() const _NOEXCEPT {return begin();}
1143 const_iterator cend() const _NOEXCEPT {return end();}
1180 iterator emplace_hint(const_iterator __p, _Args&& ...__args) {
1193 iterator insert(const_iterator __pos, _Pp&& __p)
1204 insert(const_iterator __p, const value_type& __v)
1213 iterator insert(const_iterator __p, value_type&& __v)
1225 for (const_iterator __e = cend(); __f != __l; ++__f)
1253 iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1263 iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
1298 _LIBCPP_INLINE_VISIBILITY iterator insert_or_assign(const_iterator __h,
1311 _LIBCPP_INLINE_VISIBILITY iterator insert_or_assign(const_iterator __h,
1326 iterator erase(const_iterator __p) {return __tree_.erase(__p.__i_);}
1333 iterator erase(const_iterator __f, const_iterator __l)
1348 iterator insert(const_iterator __hint, node_type&& __nh)
1361 node_type extract(const_iterator __it)
1407 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1415 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1442 const_iterator lower_bound(const key_type& __k) const
1452 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1460 const_iterator upper_bound(const key_type& __k) const
1469 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
1477 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1486 …typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::ty…
1539 const_iterator __e = cend();
1756 typedef __map_const_iterator<typename __base::const_iterator> const_iterator;
1758 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
1906 const_iterator begin() const _NOEXCEPT {return __tree_.begin();}
1910 const_iterator end() const _NOEXCEPT {return __tree_.end();}
1924 const_iterator cbegin() const _NOEXCEPT {return begin();}
1926 const_iterator cend() const _NOEXCEPT {return end();}
1957 iterator emplace_hint(const_iterator __p, _Args&& ...__args) {
1970 iterator insert(const_iterator __pos, _Pp&& __p)
1978 iterator insert(const_iterator __p, value_type&& __v)
1992 iterator insert(const_iterator __p, const value_type& __v)
1999 for (const_iterator __e = cend(); __f != __l; ++__f)
2004 iterator erase(const_iterator __p) {return __tree_.erase(__p.__i_);}
2010 iterator erase(const_iterator __f, const_iterator __l)
2023 iterator insert(const_iterator __hint, node_type&& __nh)
2036 node_type extract(const_iterator __it)
2086 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
2094 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
2121 const_iterator lower_bound(const key_type& __k) const
2131 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
2139 const_iterator upper_bound(const key_type& __k) const
2148 typename enable_if<__is_transparent<_Compare, _K2>::value,const_iterator>::type
2156 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
2165 …typename enable_if<__is_transparent<_Compare, _K2>::value,pair<const_iterator,const_iterator>>::ty…
2212 const_iterator __e = cend();