Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 1 | // -*- C++ -*- |
| 2 | //===---------------------------- array -----------------------------------===// |
| 3 | // |
Howard Hinnant | f5256e1 | 2010-05-11 21:36:01 +0000 | [diff] [blame] | 4 | // The LLVM Compiler Infrastructure |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 5 | // |
Howard Hinnant | b64f8b0 | 2010-11-16 22:09:02 +0000 | [diff] [blame] | 6 | // This file is dual licensed under the MIT and the University of Illinois Open |
| 7 | // Source Licenses. See LICENSE.TXT for details. |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 8 | // |
| 9 | //===----------------------------------------------------------------------===// |
| 10 | |
| 11 | #ifndef _LIBCPP_ARRAY |
| 12 | #define _LIBCPP_ARRAY |
| 13 | |
| 14 | /* |
| 15 | array synopsis |
| 16 | |
| 17 | namespace std |
| 18 | { |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 19 | template <class T, size_t N > |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 20 | struct array |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 21 | { |
| 22 | // types: |
| 23 | typedef T & reference; |
| 24 | typedef const T & const_reference; |
| 25 | typedef implementation defined iterator; |
| 26 | typedef implementation defined const_iterator; |
| 27 | typedef size_t size_type; |
| 28 | typedef ptrdiff_t difference_type; |
| 29 | typedef T value_type; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 30 | typedef T* pointer; |
| 31 | typedef const T* const_pointer; |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 32 | typedef std::reverse_iterator<iterator> reverse_iterator; |
| 33 | typedef std::reverse_iterator<const_iterator> const_reverse_iterator; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 34 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 35 | // No explicit construct/copy/destroy for aggregate type |
| 36 | void fill(const T& u); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 37 | void swap(array& a); |
| 38 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 39 | // iterators: |
| 40 | iterator begin(); |
| 41 | const_iterator begin() const; |
| 42 | iterator end(); |
| 43 | const_iterator end() const; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 44 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 45 | reverse_iterator rbegin(); |
| 46 | const_reverse_iterator rbegin() const; |
| 47 | reverse_iterator rend(); |
| 48 | const_reverse_iterator rend() const; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 49 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 50 | const_iterator cbegin() const; |
| 51 | const_iterator cend() const; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 52 | const_reverse_iterator crbegin() const; |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 53 | const_reverse_iterator crend() const; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 54 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 55 | // capacity: |
| 56 | constexpr size_type size() const; |
| 57 | constexpr size_type max_size() const; |
| 58 | bool empty() const; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 59 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 60 | // element access: |
| 61 | reference operator[](size_type n); |
| 62 | const_reference operator[](size_type n) const; |
| 63 | const_reference at(size_type n) const; |
| 64 | reference at(size_type n); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 65 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 66 | reference front(); |
| 67 | const_reference front() const; |
| 68 | reference back(); |
| 69 | const_reference back() const; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 70 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 71 | T* data(); |
| 72 | const T* data() const; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 73 | }; |
| 74 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 75 | template <class T, size_t N> |
| 76 | bool operator==(const array<T,N>& x, const array<T,N>& y); |
| 77 | template <class T, size_t N> |
| 78 | bool operator!=(const array<T,N>& x, const array<T,N>& y); |
| 79 | template <class T, size_t N> |
| 80 | bool operator<(const array<T,N>& x, const array<T,N>& y); |
| 81 | template <class T, size_t N> |
| 82 | bool operator>(const array<T,N>& x, const array<T,N>& y); |
| 83 | template <class T, size_t N> |
| 84 | bool operator<=(const array<T,N>& x, const array<T,N>& y); |
| 85 | template <class T, size_t N> |
| 86 | bool operator>=(const array<T,N>& x, const array<T,N>& y); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 87 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 88 | template <class T, size_t N > |
| 89 | void swap(array<T,N>& x, array<T,N>& y); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 90 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 91 | template <class T> class tuple_size; |
| 92 | template <int I, class T> class tuple_element; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 93 | template <class T, size_t N> struct tuple_size<array<T, N>>; |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 94 | template <int I, class T, size_t N> struct tuple_element<I, array<T, N>>; |
| 95 | template <int I, class T, size_t N> T& get(array<T, N>&); |
| 96 | template <int I, class T, size_t N> const T& get(const array<T, N>&); |
Howard Hinnant | cd2254b | 2010-11-17 19:52:17 +0000 | [diff] [blame^] | 97 | template <int I, class T, size_t N> T&& get(array<T, N>&&); |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 98 | |
| 99 | } // std |
| 100 | |
| 101 | */ |
| 102 | |
| 103 | #include <__config> |
| 104 | #include <__tuple> |
| 105 | #include <type_traits> |
| 106 | #include <utility> |
| 107 | #include <iterator> |
| 108 | #include <algorithm> |
| 109 | #include <stdexcept> |
| 110 | #if defined(_LIBCPP_NO_EXCEPTIONS) |
| 111 | #include <cassert> |
| 112 | #endif |
| 113 | |
| 114 | #pragma GCC system_header |
| 115 | |
| 116 | _LIBCPP_BEGIN_NAMESPACE_STD |
| 117 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 118 | template <class _Tp, size_t _Size> |
Howard Hinnant | 333f50d | 2010-09-21 20:16:37 +0000 | [diff] [blame] | 119 | struct _LIBCPP_VISIBLE array |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 120 | { |
| 121 | // types: |
| 122 | typedef array __self; |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 123 | typedef _Tp value_type; |
| 124 | typedef value_type& reference; |
| 125 | typedef const value_type& const_reference; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 126 | typedef value_type* iterator; |
| 127 | typedef const value_type* const_iterator; |
| 128 | typedef value_type* pointer; |
| 129 | typedef const value_type* const_pointer; |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 130 | typedef size_t size_type; |
| 131 | typedef ptrdiff_t difference_type; |
| 132 | typedef std::reverse_iterator<iterator> reverse_iterator; |
| 133 | typedef std::reverse_iterator<const_iterator> const_reverse_iterator; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 134 | |
| 135 | value_type __elems_[_Size > 0 ? _Size : 1]; |
| 136 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 137 | // No explicit construct/copy/destroy for aggregate type |
Howard Hinnant | 333f50d | 2010-09-21 20:16:37 +0000 | [diff] [blame] | 138 | _LIBCPP_INLINE_VISIBILITY void fill(const value_type& __u) |
| 139 | {_STD::fill_n(__elems_, _Size, __u);} |
| 140 | _LIBCPP_INLINE_VISIBILITY void swap(array& __a) |
| 141 | {_STD::swap_ranges(__elems_, __elems_ + _Size, __a.__elems_);} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 142 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 143 | // iterators: |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 144 | _LIBCPP_INLINE_VISIBILITY iterator begin() {return iterator(__elems_);} |
| 145 | _LIBCPP_INLINE_VISIBILITY const_iterator begin() const {return const_iterator(__elems_);} |
| 146 | _LIBCPP_INLINE_VISIBILITY iterator end() {return iterator(__elems_ + _Size);} |
| 147 | _LIBCPP_INLINE_VISIBILITY const_iterator end() const {return const_iterator(__elems_ + _Size);} |
| 148 | |
| 149 | _LIBCPP_INLINE_VISIBILITY reverse_iterator rbegin() {return reverse_iterator(end());} |
| 150 | _LIBCPP_INLINE_VISIBILITY const_reverse_iterator rbegin() const {return const_reverse_iterator(end());} |
| 151 | _LIBCPP_INLINE_VISIBILITY reverse_iterator rend() {return reverse_iterator(begin());} |
| 152 | _LIBCPP_INLINE_VISIBILITY const_reverse_iterator rend() const {return const_reverse_iterator(begin());} |
| 153 | |
| 154 | _LIBCPP_INLINE_VISIBILITY const_iterator cbegin() const {return begin();} |
| 155 | _LIBCPP_INLINE_VISIBILITY const_iterator cend() const {return end();} |
| 156 | _LIBCPP_INLINE_VISIBILITY const_reverse_iterator crbegin() const {return rbegin();} |
| 157 | _LIBCPP_INLINE_VISIBILITY const_reverse_iterator crend() const {return rend();} |
| 158 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 159 | // capacity: |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 160 | _LIBCPP_INLINE_VISIBILITY /*constexpr*/ size_type size() const {return _Size;} |
| 161 | _LIBCPP_INLINE_VISIBILITY /*constexpr*/ size_type max_size() const {return _Size;} |
| 162 | _LIBCPP_INLINE_VISIBILITY bool empty() const {return _Size == 0;} |
| 163 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 164 | // element access: |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 165 | _LIBCPP_INLINE_VISIBILITY reference operator[](size_type __n) {return __elems_[__n];} |
| 166 | _LIBCPP_INLINE_VISIBILITY const_reference operator[](size_type __n) const {return __elems_[__n];} |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 167 | reference at(size_type __n); |
| 168 | const_reference at(size_type __n) const; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 169 | |
| 170 | _LIBCPP_INLINE_VISIBILITY reference front() {return __elems_[0];} |
| 171 | _LIBCPP_INLINE_VISIBILITY const_reference front() const {return __elems_[0];} |
| 172 | _LIBCPP_INLINE_VISIBILITY reference back() {return __elems_[_Size > 0 ? _Size-1 : 0];} |
| 173 | _LIBCPP_INLINE_VISIBILITY const_reference back() const {return __elems_[_Size > 0 ? _Size-1 : 0];} |
| 174 | |
| 175 | _LIBCPP_INLINE_VISIBILITY value_type* data() {return __elems_;} |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 176 | _LIBCPP_INLINE_VISIBILITY const value_type* data() const {return __elems_;} |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 177 | }; |
| 178 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 179 | template <class _Tp, size_t _Size> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 180 | typename array<_Tp, _Size>::reference |
| 181 | array<_Tp, _Size>::at(size_type __n) |
| 182 | { |
| 183 | if (__n >= _Size) |
| 184 | #ifndef _LIBCPP_NO_EXCEPTIONS |
| 185 | throw out_of_range("array::at"); |
| 186 | #else |
| 187 | assert(!"array::at out_of_range"); |
| 188 | #endif |
| 189 | return __elems_[__n]; |
| 190 | } |
| 191 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 192 | template <class _Tp, size_t _Size> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 193 | typename array<_Tp, _Size>::const_reference |
| 194 | array<_Tp, _Size>::at(size_type __n) const |
| 195 | { |
| 196 | if (__n >= _Size) |
| 197 | #ifndef _LIBCPP_NO_EXCEPTIONS |
| 198 | throw out_of_range("array::at"); |
| 199 | #else |
| 200 | assert(!"array::at out_of_range"); |
| 201 | #endif |
| 202 | return __elems_[__n]; |
| 203 | } |
| 204 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 205 | template <class _Tp, size_t _Size> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 206 | _LIBCPP_INLINE_VISIBILITY inline |
| 207 | bool |
| 208 | operator==(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) |
| 209 | { |
| 210 | return _STD::equal(__x.__elems_, __x.__elems_ + _Size, __y.__elems_); |
| 211 | } |
| 212 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 213 | template <class _Tp, size_t _Size> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 214 | _LIBCPP_INLINE_VISIBILITY inline |
| 215 | bool |
| 216 | operator!=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) |
| 217 | { |
| 218 | return !(__x == __y); |
| 219 | } |
| 220 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 221 | template <class _Tp, size_t _Size> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 222 | _LIBCPP_INLINE_VISIBILITY inline |
| 223 | bool |
| 224 | operator<(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) |
| 225 | { |
| 226 | return _STD::lexicographical_compare(__x.__elems_, __x.__elems_ + _Size, __y.__elems_, __y.__elems_ + _Size); |
| 227 | } |
| 228 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 229 | template <class _Tp, size_t _Size> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 230 | _LIBCPP_INLINE_VISIBILITY inline |
| 231 | bool |
| 232 | operator>(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) |
| 233 | { |
| 234 | return __y < __x; |
| 235 | } |
| 236 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 237 | template <class _Tp, size_t _Size> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 238 | _LIBCPP_INLINE_VISIBILITY inline |
| 239 | bool |
| 240 | operator<=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) |
| 241 | { |
| 242 | return !(__y < __x); |
| 243 | } |
| 244 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 245 | template <class _Tp, size_t _Size> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 246 | _LIBCPP_INLINE_VISIBILITY inline |
| 247 | bool |
| 248 | operator>=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) |
| 249 | { |
| 250 | return !(__x < __y); |
| 251 | } |
| 252 | |
Howard Hinnant | 324bb03 | 2010-08-22 00:02:43 +0000 | [diff] [blame] | 253 | template <class _Tp, size_t _Size> |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 254 | _LIBCPP_INLINE_VISIBILITY inline |
| 255 | void |
| 256 | swap(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) |
| 257 | { |
| 258 | __x.swap(__y); |
| 259 | } |
| 260 | |
| 261 | template <class _Tp, size_t _Size> |
Howard Hinnant | 333f50d | 2010-09-21 20:16:37 +0000 | [diff] [blame] | 262 | class _LIBCPP_VISIBLE tuple_size<array<_Tp, _Size> > |
| 263 | : public integral_constant<size_t, _Size> {}; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 264 | |
| 265 | template <class _Tp, size_t _Size> |
Howard Hinnant | 333f50d | 2010-09-21 20:16:37 +0000 | [diff] [blame] | 266 | class _LIBCPP_VISIBLE tuple_size<const array<_Tp, _Size> > |
| 267 | : public integral_constant<size_t, _Size> {}; |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 268 | |
| 269 | template <size_t _Ip, class _Tp, size_t _Size> |
Howard Hinnant | 333f50d | 2010-09-21 20:16:37 +0000 | [diff] [blame] | 270 | class _LIBCPP_VISIBLE tuple_element<_Ip, array<_Tp, _Size> > |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 271 | { |
| 272 | public: |
| 273 | typedef _Tp type; |
| 274 | }; |
| 275 | |
| 276 | template <size_t _Ip, class _Tp, size_t _Size> |
Howard Hinnant | 333f50d | 2010-09-21 20:16:37 +0000 | [diff] [blame] | 277 | class _LIBCPP_VISIBLE tuple_element<_Ip, const array<_Tp, _Size> > |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 278 | { |
| 279 | public: |
| 280 | typedef const _Tp type; |
| 281 | }; |
| 282 | |
| 283 | template <size_t _Ip, class _Tp, size_t _Size> |
| 284 | _LIBCPP_INLINE_VISIBILITY inline |
| 285 | _Tp& |
| 286 | get(array<_Tp, _Size>& __a) |
| 287 | { |
| 288 | return __a[_Ip]; |
| 289 | } |
| 290 | |
| 291 | template <size_t _Ip, class _Tp, size_t _Size> |
| 292 | _LIBCPP_INLINE_VISIBILITY inline |
| 293 | const _Tp& |
| 294 | get(const array<_Tp, _Size>& __a) |
| 295 | { |
| 296 | return __a[_Ip]; |
| 297 | } |
| 298 | |
Howard Hinnant | cd2254b | 2010-11-17 19:52:17 +0000 | [diff] [blame^] | 299 | #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| 300 | |
| 301 | template <size_t _Ip, class _Tp, size_t _Size> |
| 302 | _LIBCPP_INLINE_VISIBILITY inline |
| 303 | _Tp&& |
| 304 | get(array<_Tp, _Size>&& __a) |
| 305 | { |
| 306 | return _STD::move(__a[_Ip]); |
| 307 | } |
| 308 | |
| 309 | #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| 310 | |
Howard Hinnant | bc8d3f9 | 2010-05-11 19:42:16 +0000 | [diff] [blame] | 311 | _LIBCPP_END_NAMESPACE_STD |
| 312 | |
| 313 | #endif // _LIBCPP_ARRAY |