libstdc++
debug/stl_iterator.h
Go to the documentation of this file.
1 // Debugging support implementation -*- C++ -*-
2 
3 // Copyright (C) 2015-2019 Free Software Foundation, Inc.
4 //
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
9 // any later version.
10 
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
15 
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
19 
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
24 
25 /** @file debug/stl_iterator.h
26  * This file is a GNU debug extension to the Standard C++ Library.
27  */
28 
29 #ifndef _GLIBCXX_DEBUG_STL_ITERATOR_H
30 #define _GLIBCXX_DEBUG_STL_ITERATOR_H 1
31 
32 #include <debug/helper_functions.h>
33 
34 namespace __gnu_debug
35 {
36  // Help Debug mode to see through reverse_iterator.
37  template<typename _Iterator>
38  inline bool
41  typename _Distance_traits<_Iterator>::__type& __dist)
42  { return __valid_range(__last.base(), __first.base(), __dist); }
43 
44  template<typename _Iterator>
45  inline typename _Distance_traits<_Iterator>::__type
48  { return __get_distance(__last.base(), __first.base()); }
49 
50  template<typename _Iterator, typename _Size>
51  inline bool
52  __can_advance(const std::reverse_iterator<_Iterator>& __it, _Size __n)
53  { return __can_advance(__it.base(), -__n); }
54 
55  template<typename _Iterator, typename _Sequence>
57  __base(const std::reverse_iterator<_Safe_iterator<
58  _Iterator, _Sequence, std::random_access_iterator_tag> >& __it)
59  { return std::reverse_iterator<_Iterator>(__it.base().base()); }
60 
61 #if __cplusplus < 201103L
62  template<typename _Iterator>
63  struct _Unsafe_type<std::reverse_iterator<_Iterator> >
64  {
65  typedef typename _Unsafe_type<_Iterator>::_Type _UnsafeType;
67  };
68 
69  template<typename _Iterator>
71  __unsafe(const std::reverse_iterator<_Iterator>& __it)
72  {
73  typedef typename _Unsafe_type<_Iterator>::_Type _UnsafeType;
74  return std::reverse_iterator<_UnsafeType>(__unsafe(__it.base()));
75  }
76 #else
77  template<typename _Iterator>
78  inline auto
79  __unsafe(const std::reverse_iterator<_Iterator>& __it)
80  -> decltype(std::__make_reverse_iterator(__unsafe(__it.base())))
81  { return std::__make_reverse_iterator(__unsafe(__it.base())); }
82 #endif
83 
84 #if __cplusplus >= 201103L
85  // Help Debug mode to see through move_iterator.
86  template<typename _Iterator>
87  inline bool
89  const std::move_iterator<_Iterator>& __last,
90  typename _Distance_traits<_Iterator>::__type& __dist)
91  { return __valid_range(__first.base(), __last.base(), __dist); }
92 
93  template<typename _Iterator>
94  inline typename _Distance_traits<_Iterator>::__type
96  const std::move_iterator<_Iterator>& __last)
97  { return __get_distance(__first.base(), __last.base()); }
98 
99  template<typename _Iterator, typename _Size>
100  inline bool
101  __can_advance(const std::move_iterator<_Iterator>& __it, _Size __n)
102  { return __can_advance(__it.base(), __n); }
103 
104  template<typename _Iterator>
105  inline auto
106  __unsafe(const std::move_iterator<_Iterator>& __it)
107  -> decltype(std::make_move_iterator(__unsafe(__it.base())))
108  { return std::make_move_iterator(__unsafe(__it.base())); }
109 
110  template<typename _Iterator>
111  inline auto
113  -> decltype(std::make_move_iterator(__base(__it.base())))
114  { return std::make_move_iterator(__base(__it.base())); }
115 #endif
116 }
117 
118 namespace std
119 {
120 _GLIBCXX_BEGIN_NAMESPACE_VERSION
121 
122  template<typename _Iterator, typename _Container, typename _Sequence>
123  _Iterator
124  __niter_base(const __gnu_debug::_Safe_iterator<
125  __gnu_cxx::__normal_iterator<_Iterator, _Container>,
126  _Sequence, std::random_access_iterator_tag>&);
127 
128 _GLIBCXX_END_NAMESPACE_VERSION
129 }
130 
131 #endif
ISO C++ entities toplevel namespace is std.
Safe iterator wrapper.
Definition: formatter.h:80
GNU debug classes for public use.
Random-access iterators support a superset of bidirectional iterator operations.
_GLIBCXX17_CONSTEXPR iterator_type base() const
_Iterator __base(_Iterator __it)
_Distance_traits< _Iterator >::__type __get_distance(_Iterator __lhs, _Iterator __rhs, std::random_access_iterator_tag)
bool __valid_range(_InputIterator __first, _InputIterator __last, typename _Distance_traits< _InputIterator >::__type &__dist)