1 // class template array -*- C++ -*-
3 // Copyright (C) 2004, 2005, 2006, 2007 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.
37 #include <bits/stl_algobase.h>
42 _GLIBCXX_BEGIN_NAMESPACE(_GLIBCXX_TR1)
44 /// @brief struct array [6.2.2].
45 /// NB: Requires complete type _Tp.
46 template<typename _Tp, std::size_t _Nm>
49 typedef _Tp value_type;
50 typedef value_type& reference;
51 typedef const value_type& const_reference;
52 typedef value_type* iterator;
53 typedef const value_type* const_iterator;
54 typedef std::size_t size_type;
55 typedef std::ptrdiff_t difference_type;
56 typedef std::reverse_iterator<iterator> reverse_iterator;
57 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
59 // Support for zero-sized arrays mandatory.
60 value_type _M_instance[_Nm ? _Nm : 1] __attribute__((__aligned__));
62 // No explicit construct/copy/destroy for aggregate type.
65 assign(const value_type& __u)
66 { std::fill_n(begin(), size(), __u); }
70 { std::swap_ranges(begin(), end(), __other.begin()); }
75 { return iterator(&_M_instance[0]); }
79 { return const_iterator(&_M_instance[0]); }
83 { return iterator(&_M_instance[_Nm]); }
87 { return const_iterator(&_M_instance[_Nm]); }
91 { return reverse_iterator(end()); }
93 const_reverse_iterator
95 { return const_reverse_iterator(end()); }
99 { return reverse_iterator(begin()); }
101 const_reverse_iterator
103 { return const_reverse_iterator(begin()); }
107 size() const { return _Nm; }
110 max_size() const { return _Nm; }
113 empty() const { return size() == 0; }
117 operator[](size_type __n)
118 { return _M_instance[__n]; }
121 operator[](size_type __n) const
122 { return _M_instance[__n]; }
128 return _M_instance[__n];
132 at(size_type __n) const
135 return _M_instance[__n];
148 { return _Nm ? *(end() - 1) : *end(); }
152 { return _Nm ? *(end() - 1) : *end(); }
156 { return &_M_instance[0]; }
160 { return &_M_instance[0]; }
163 template<std::size_t _Mm>
164 typename __gnu_cxx::__enable_if<_Mm, void>::__type
165 _M_check(size_type __n) const
167 if (__builtin_expect(__n >= _Mm, false))
168 std::__throw_out_of_range(__N("array::_M_check"));
171 // Avoid "unsigned comparison with zero" warnings.
172 template<std::size_t _Mm>
173 typename __gnu_cxx::__enable_if<!_Mm, void>::__type
174 _M_check(size_type) const
175 { std::__throw_out_of_range(__N("array::_M_check")); }
178 // Array comparisons.
179 template<typename _Tp, std::size_t _Nm>
181 operator==(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
182 { return std::equal(__one.begin(), __one.end(), __two.begin()); }
184 template<typename _Tp, std::size_t _Nm>
186 operator!=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
187 { return !(__one == __two); }
189 template<typename _Tp, std::size_t _Nm>
191 operator<(const array<_Tp, _Nm>& __a, const array<_Tp, _Nm>& __b)
193 return std::lexicographical_compare(__a.begin(), __a.end(),
194 __b.begin(), __b.end());
197 template<typename _Tp, std::size_t _Nm>
199 operator>(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
200 { return __two < __one; }
202 template<typename _Tp, std::size_t _Nm>
204 operator<=(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two)
205 { return !(__one > __two); }
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 // Specialized algorithms [6.2.2.2].
213 template<typename _Tp, std::size_t _Nm>
215 swap(array<_Tp, _Nm>& __one, array<_Tp, _Nm>& __two)
216 { std::swap_ranges(__one.begin(), __one.end(), __two.begin()); }
218 // Tuple interface to class template array [6.2.2.5].
219 template<typename _Tp> class tuple_size;
220 template<int _Int, typename _Tp> class tuple_element;
222 template<typename _Tp, std::size_t _Nm>
223 struct tuple_size<array<_Tp, _Nm> >
224 { static const int value = _Nm; };
226 template<typename _Tp, std::size_t _Nm>
227 const int tuple_size<array<_Tp, _Nm> >::value;
229 template<int _Int, typename _Tp, std::size_t _Nm>
230 struct tuple_element<_Int, array<_Tp, _Nm> >
231 { typedef _Tp type; };
233 template<int _Int, typename _Tp, std::size_t _Nm>
235 get(array<_Tp, _Nm>& __arr)
236 { return __arr[_Int]; }
238 template<int _Int, typename _Tp, std::size_t _Nm>
240 get(const array<_Tp, _Nm>& __arr)
241 { return __arr[_Int]; }
243 _GLIBCXX_END_NAMESPACE