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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
// class template array -*- C++ -*-
// Copyright (C) 2004 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 2, 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 COPYING. If not, write to the Free
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
// USA.
// As a special exception, you may use this file as part of a free software
// library without restriction. Specifically, if other files instantiate
// templates or use macros or inline functions from this file, or you compile
// this file and link it with other files to produce an executable, this
// file does not by itself cause the resulting executable to be covered by
// the GNU General Public License. This exception does not however
// invalidate any other reasons why the executable file might be covered by
// the GNU General Public License.
/** @file
* This is a TR1 C++ Library header.
*/
#ifndef _ARRAY
#define _ARRAY 1
#include <new>
#include <iterator>
#include <algorithm>
#include <bits/functexcept.h>
//namespace std::tr1
namespace std
{
namespace tr1
{
/// @brief struct array [6.2.2].
/// NB: Requires complete type _Tp.
template<typename _Tp, size_t _Nm = 1>
struct array
{
typedef _Tp value_type;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef value_type* iterator;
typedef const value_type* const_iterator;
typedef size_t size_type;
typedef ptrdiff_t difference_type;
typedef std::reverse_iterator<iterator> reverse_iterator;
typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
// Compile time constant without other dependencies.
enum { _S_index = _Nm };
// Support for zero-sized arrays mandatory.
value_type _M_instance[_Nm ? _Nm : 1];
// No explicit construct/copy/destroy for aggregate type.
void
assign(const value_type& u);
void
swap(array&);
// Iterators.
iterator
begin()
{ return reinterpret_cast<iterator>(&_M_instance[0]); }
const_iterator
begin() const
{ return reinterpret_cast<const_iterator>(&_M_instance[0]); }
iterator
end()
{ return reinterpret_cast<iterator>(&_M_instance[_Nm]); }
const_iterator
end() const
{ return reinterpret_cast<const_iterator>(&_M_instance[_Nm]); }
reverse_iterator
rbegin()
{ return reverse_iterator(this->end()); }
const_reverse_iterator
rbegin() const
{ return const_reverse_iterator(this->end()); }
reverse_iterator
rend()
{ return reverse_iterator(this->begin()); }
const_reverse_iterator
rend() const
{ return const_reverse_iterator(this->begin()); }
// Capacity.
size_type
size() const { return _Nm; }
size_type
max_size() const { return _Nm; }
bool
empty() const { return size() == 0; }
// Element access.
reference
operator[](size_type __n)
{ return reinterpret_cast<reference>(_M_instance[__n]); }
const_reference
operator[](size_type __n) const
{ return reinterpret_cast<const_reference>(_M_instance[__n]); }
const_reference
at(size_type __n) const
{
if (__builtin_expect(__n > _Nm, false))
std::__throw_out_of_range("array::at");
return reinterpret_cast<const_reference>(_M_instance[__n]);
}
reference
at(size_type __n)
{
if (__builtin_expect(__n > _Nm, false))
std::__throw_out_of_range("array::at");
return reinterpret_cast<reference>(_M_instance[__n]);
}
reference
front();
const_reference
front() const;
reference
back();
const_reference
back() const;
_Tp*
data();
const _Tp*
data() const;
};
// Array comparisons.
template<typename _Tp, size_t _Nm>
bool
operator==(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
{ return std::equal(__one.begin(), __one.end(), __two.begin()); }
template<typename _Tp, size_t _Nm>
bool
operator!=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
{ return !(__one == __two); }
template<typename _Tp, size_t _Nm>
bool
operator<(const array<_Tp, _Nm>& a, const array<_Tp, _Nm>& b)
{
return std::lexicographical_compare(a.begin(), a.end(),
b.begin(), b.end());
}
template<typename _Tp, size_t _Nm>
bool
operator>(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
{ return __two < __one; }
template<typename _Tp, size_t _Nm>
bool
operator<=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
{ return !(__one > __two); }
template<typename _Tp, size_t _Nm>
bool
operator>=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
{ return !(__one < __two); }
// Specialized algorithms [6.2.2.2].
template<typename _Tp, size_t _Nm>
void
swap(array<_Tp, _Nm>& __one, array<_Tp, _Nm>& __two)
{ swap_ranges(__one.begin(), __one.end(), __two.begin()); }
} // namespace std::tr1
}
#endif
|
