1 // class template array -*- C++ -*-
3 // Copyright (C) 2004, 2005, 2006 Free Software Foundation, Inc.
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 2, or (at your option)
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.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
31 * This is a TR1 C++ Library header.
41 #include <bits/functexcept.h>
42 #include <ext/type_traits.h>
47 _GLIBCXX_BEGIN_NAMESPACE(tr1)
49 /// @brief struct array [6.2.2].
50 /// NB: Requires complete type _Tp.
51 template<typename _Tp, std::size_t _Nm>
54 typedef _Tp value_type;
55 typedef value_type& reference;
56 typedef const value_type& const_reference;
57 typedef value_type* iterator;
58 typedef const value_type* const_iterator;
59 typedef std::size_t size_type;
60 typedef std::ptrdiff_t difference_type;
61 typedef std::reverse_iterator<iterator> reverse_iterator;
62 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
64 // Support for zero-sized arrays mandatory.
65 value_type _M_instance[_Nm ? _Nm : 1] __attribute__((__aligned__));
67 // No explicit construct/copy/destroy for aggregate type.
70 assign(const value_type& __u)
71 { std::fill_n(begin(), size(), __u); }
75 { std::swap_ranges(begin(), end(), __other.begin()); }
80 { return iterator(&_M_instance[0]); }
84 { return const_iterator(&_M_instance[0]); }
88 { return iterator(&_M_instance[_Nm]); }
92 { return const_iterator(&_M_instance[_Nm]); }
96 { return reverse_iterator(end()); }
98 const_reverse_iterator
100 { return const_reverse_iterator(end()); }
104 { return reverse_iterator(begin()); }
106 const_reverse_iterator
108 { return const_reverse_iterator(begin()); }
112 size() const { return _Nm; }
115 max_size() const { return _Nm; }
118 empty() const { return size() == 0; }
122 operator[](size_type __n)
123 { return _M_instance[__n]; }
126 operator[](size_type __n) const
127 { return _M_instance[__n]; }
133 return _M_instance[__n];
137 at(size_type __n) const
140 return _M_instance[__n];
153 { return _Nm ? *(end() - 1) : *end(); }
157 { return _Nm ? *(end() - 1) : *end(); }
161 { return &_M_instance[0]; }
165 { return &_M_instance[0]; }
168 template<std::size_t _Mm>
169 typename __gnu_cxx::__enable_if<_Mm, void>::__type
170 _M_check(size_type __n) const
172 if (__builtin_expect(__n >= _Mm, false))
173 std::__throw_out_of_range(__N("array::_M_check"));
176 // Avoid "unsigned comparison with zero" warnings.
177 template<std::size_t _Mm>
178 typename __gnu_cxx::__enable_if<!_Mm, void>::__type
179 _M_check(size_type) const
180 { std::__throw_out_of_range(__N("array::_M_check")); }
183 // Array comparisons.
184 template<typename _Tp, std::size_t _Nm>
186 operator==(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
187 { return std::equal(__one.begin(), __one.end(), __two.begin()); }
189 template<typename _Tp, std::size_t _Nm>
191 operator!=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
192 { return !(__one == __two); }
194 template<typename _Tp, std::size_t _Nm>
196 operator<(const array<_Tp, _Nm>& __a, const array<_Tp, _Nm>& __b)
198 return std::lexicographical_compare(__a.begin(), __a.end(),
199 __b.begin(), __b.end());
202 template<typename _Tp, std::size_t _Nm>
204 operator>(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
205 { return __two < __one; }
207 template<typename _Tp, std::size_t _Nm>
209 operator<=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
210 { return !(__one > __two); }
212 template<typename _Tp, std::size_t _Nm>
214 operator>=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
215 { return !(__one < __two); }
217 // Specialized algorithms [6.2.2.2].
218 template<typename _Tp, std::size_t _Nm>
220 swap(array<_Tp, _Nm>& __one, array<_Tp, _Nm>& __two)
221 { std::swap_ranges(__one.begin(), __one.end(), __two.begin()); }
223 // Tuple interface to class template array [6.2.2.5].
224 template<typename _Tp> class tuple_size;
225 template<int _Int, typename _Tp> class tuple_element;
227 template<typename _Tp, std::size_t _Nm>
228 struct tuple_size<array<_Tp, _Nm> >
229 { static const int value = _Nm; };
231 template<typename _Tp, std::size_t _Nm>
232 const int tuple_size<array<_Tp, _Nm> >::value;
234 template<int _Int, typename _Tp, std::size_t _Nm>
235 struct tuple_element<_Int, array<_Tp, _Nm> >
236 { typedef _Tp type; };
238 template<int _Int, typename _Tp, std::size_t _Nm>
240 get(array<_Tp, _Nm>& __arr)
241 { return __arr[_Int]; }
243 template<int _Int, typename _Tp, std::size_t _Nm>
245 get(const array<_Tp, _Nm>& __arr)
246 { return __arr[_Int]; }
248 _GLIBCXX_END_NAMESPACE