1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
// { dg-options "-std=gnu++11" }
// { dg-do compile }
// Copyright (C) 2016-2017 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
#include <iterator>
namespace std {
// C++11 24.4.4, iterator operations:
template <class InputIterator, class Distance>
void
advance(InputIterator& i, Distance n);
template <class InputIterator>
typename iterator_traits<InputIterator>::difference_type
distance(InputIterator first, InputIterator last);
template<class ForwardIterator>
ForwardIterator
next(ForwardIterator x,
typename iterator_traits<ForwardIterator>::difference_type);
template<class BidirectionalIterator>
BidirectionalIterator
prev(BidirectionalIterator x,
typename iterator_traits<BidirectionalIterator>::difference_type);
// C++11 24.5, Iterator adaptors:
template <class Iterator> class reverse_iterator;
template <class Iterator1, class Iterator2>
bool operator==(const reverse_iterator<Iterator1>& x,
const reverse_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
bool operator<(const reverse_iterator<Iterator1>& x,
const reverse_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
bool operator!=(const reverse_iterator<Iterator1>& x,
const reverse_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
bool operator>(const reverse_iterator<Iterator1>& x,
const reverse_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
bool operator>=(const reverse_iterator<Iterator1>& x,
const reverse_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
bool operator<=(const reverse_iterator<Iterator1>& x,
const reverse_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
auto
operator-(const reverse_iterator<Iterator1>& x,
const reverse_iterator<Iterator2>& y)
-> decltype(x.base() - y.base());
template <class Iterator>
reverse_iterator<Iterator>
operator+(typename reverse_iterator<Iterator>::difference_type n,
const reverse_iterator<Iterator>& x);
template <class Container> class back_insert_iterator;
template <class Container>
back_insert_iterator<Container> back_inserter(Container& x);
template <class Container> class front_insert_iterator;
template <class Container>
front_insert_iterator<Container> front_inserter(Container& x);
template <class Container> class insert_iterator;
template <class Container, class Iterator>
insert_iterator<Container> inserter(Container& x, Iterator i);
template <class Iterator> class move_iterator;
template <class Iterator1, class Iterator2>
bool operator==(const move_iterator<Iterator1>& x,
const move_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
bool operator!=(const move_iterator<Iterator1>& x,
const move_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
bool operator<(const move_iterator<Iterator1>& x,
const move_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
bool operator<=(const move_iterator<Iterator1>& x,
const move_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
bool operator>(const move_iterator<Iterator1>& x,
const move_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
bool operator>=(const move_iterator<Iterator1>& x,
const move_iterator<Iterator2>& y);
template <class Iterator1, class Iterator2>
auto operator-(const move_iterator<Iterator1>& x,
const move_iterator<Iterator2>& y)
-> decltype(x.base() - y.base());
template <class Iterator>
move_iterator<Iterator>
operator+(typename move_iterator<Iterator>::difference_type,
const move_iterator<Iterator>&);
template <class Iterator>
move_iterator<Iterator> make_move_iterator(const Iterator&);
// 24.6, stream iterators:
template <class T, class charT, class traits, class Distance>
class istream_iterator;
template <class T, class charT, class traits, class Distance>
bool operator==(const istream_iterator<T,charT,traits,Distance>& x,
const istream_iterator<T,charT,traits,Distance>& y);
template <class T, class charT, class traits, class Distance>
bool operator!=(const istream_iterator<T,charT,traits,Distance>& x,
const istream_iterator<T,charT,traits,Distance>& y);
template <class T, class charT, class traits>
class ostream_iterator;
template<class charT, class traits>
class istreambuf_iterator;
template <class charT, class traits>
bool
operator==(const istreambuf_iterator<charT,traits>&,
const istreambuf_iterator<charT,traits>&);
template <class charT, class traits>
bool operator!=(const istreambuf_iterator<charT,traits>&,
const istreambuf_iterator<charT,traits>&);
template <class charT, class traits>
class ostreambuf_iterator;
}
|
