Lines Matching refs:const_iterator
39 typedef implementation-defined const_iterator;
41 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
92 const_iterator begin() const noexcept;
94 const_iterator end() const noexcept;
101 const_iterator cbegin() const noexcept;
102 const_iterator cend() const noexcept;
115 iterator emplace_hint(const_iterator position, Args&&... args);
118 iterator insert(const_iterator position, const value_type& v);
119 iterator insert(const_iterator position, value_type&& v);
126 node_type extract(const_iterator position); // C++17
129 iterator insert(const_iterator hint, node_type&& nh); // C++17
131 iterator erase(const_iterator position);
134 iterator erase(const_iterator first, const_iterator last);
159 const_iterator find(const key_type& k) const;
163 const_iterator find(const K& x) const; // C++14
173 const_iterator lower_bound(const key_type& k) const;
177 const_iterator lower_bound(const K& x) const; // C++14
180 const_iterator upper_bound(const key_type& k) const;
184 const_iterator upper_bound(const K& x) const; // C++14
186 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
190 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
284 typedef implementation-defined const_iterator;
286 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
337 const_iterator begin() const noexcept;
339 const_iterator end() const noexcept;
346 const_iterator cbegin() const noexcept;
347 const_iterator cend() const noexcept;
360 iterator emplace_hint(const_iterator position, Args&&... args);
363 iterator insert(const_iterator position, const value_type& v);
364 iterator insert(const_iterator position, value_type&& v);
371 node_type extract(const_iterator position); // C++17
374 iterator insert(const_iterator hint, node_type&& nh); // C++17
376 iterator erase(const_iterator position);
379 iterator erase(const_iterator first, const_iterator last);
404 const_iterator find(const key_type& k) const;
408 const_iterator find(const K& x) const; // C++14
418 const_iterator lower_bound(const key_type& k) const;
422 const_iterator lower_bound(const K& x) const; // C++14
425 const_iterator upper_bound(const key_type& k) const;
429 const_iterator upper_bound(const K& x) const; // C++14
432 pair<const_iterator,const_iterator> equal_range(const key_type& k) const;
436 pair<const_iterator,const_iterator> equal_range(const K& x) const; // C++14
590 typedef typename __base::const_iterator iterator;
591 typedef typename __base::const_iterator const_iterator;
593 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
702 _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT { return __tree_.begin(); }
704 _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT { return __tree_.end(); }
711 _LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return begin(); }
712 _LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return end(); }
727 _LIBCPP_HIDE_FROM_ABI iterator emplace_hint(const_iterator __p, _Args&&... __args) {
733 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, const value_type& __v) {
739 for (const_iterator __e = cend(); __f != __l; ++__f)
746 const_iterator __end = cend();
758 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, value_type&& __v) {
765 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __p) { return __tree_.erase(__p); }
767 …_LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __f, const_iterator __l) { return __tree_.eras…
776 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __hint, node_type&& __nh) {
784 _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) {
821 _LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __tree_.find(__k); }
828 _LIBCPP_HIDE_FROM_ABI const_iterator find(const _K2& __k) const {
850 …_LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const key_type& __k) const { return __tree_.lower…
858 _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const _K2& __k) const {
864 …_LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const key_type& __k) const { return __tree_.upper…
871 _LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const _K2& __k) const {
879 …_LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> equal_range(const key_type& __k) const {
888 _LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> equal_range(const _K2& __k) const {
945 const_iterator __e = cend();
1044 typedef typename __base::const_iterator iterator;
1045 typedef typename __base::const_iterator const_iterator;
1047 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
1159 _LIBCPP_HIDE_FROM_ABI const_iterator begin() const _NOEXCEPT { return __tree_.begin(); }
1161 _LIBCPP_HIDE_FROM_ABI const_iterator end() const _NOEXCEPT { return __tree_.end(); }
1168 _LIBCPP_HIDE_FROM_ABI const_iterator cbegin() const _NOEXCEPT { return begin(); }
1169 _LIBCPP_HIDE_FROM_ABI const_iterator cend() const _NOEXCEPT { return end(); }
1184 _LIBCPP_HIDE_FROM_ABI iterator emplace_hint(const_iterator __p, _Args&&... __args) {
1190 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, const value_type& __v) {
1196 for (const_iterator __e = cend(); __f != __l; ++__f)
1203 const_iterator __end = cend();
1213 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, value_type&& __v) {
1220 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __p) { return __tree_.erase(__p); }
1222 …_LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __f, const_iterator __l) { return __tree_.eras…
1231 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __hint, node_type&& __nh) {
1239 _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) {
1278 _LIBCPP_HIDE_FROM_ABI const_iterator find(const key_type& __k) const { return __tree_.find(__k); }
1285 _LIBCPP_HIDE_FROM_ABI const_iterator find(const _K2& __k) const {
1307 …_LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const key_type& __k) const { return __tree_.lower…
1315 _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const _K2& __k) const {
1321 …_LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const key_type& __k) const { return __tree_.upper…
1328 _LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const _K2& __k) const {
1336 …_LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> equal_range(const key_type& __k) const {
1345 _LIBCPP_HIDE_FROM_ABI pair<const_iterator, const_iterator> equal_range(const _K2& __k) const {
1404 const_iterator __e = cend();