2 //===-------------------------- dynarray ----------------------------------===//
4 // The LLVM Compiler Infrastructure
6 // This file is dual licensed under the MIT and the University of Illinois Open
7 // Source Licenses. See LICENSE.TXT for details.
9 //===----------------------------------------------------------------------===//
11 #ifndef _LIBCPP_DYNARRAY
12 #define _LIBCPP_DYNARRAY
15 #if _LIBCPP_STD_VER > 11
20 namespace std { namespace experimental {
22 template< typename T >
28 typedef const T& const_reference;
30 typedef const T* const_pointer;
31 typedef implementation-defined iterator;
32 typedef implementation-defined const_iterator;
33 typedef reverse_iterator<iterator> reverse_iterator;
34 typedef reverse_iterator<const_iterator> const_reverse_iterator;
35 typedef size_t size_type;
36 typedef ptrdiff_t difference_type;
39 // construct/copy/destroy:
40 explicit dynarray(size_type c);
41 template <typename Alloc>
42 dynarray(size_type c, const Alloc& alloc);
43 dynarray(size_type c, const T& v);
44 template <typename Alloc>
45 dynarray(size_type c, const T& v, const Alloc& alloc);
46 dynarray(const dynarray& d);
47 template <typename Alloc>
48 dynarray(const dynarray& d, const Alloc& alloc);
49 dynarray(initializer_list<T>);
50 template <typename Alloc>
51 dynarray(initializer_list<T>, const Alloc& alloc);
53 dynarray& operator=(const dynarray&) = delete;
57 iterator begin() noexcept;
58 const_iterator begin() const noexcept;
59 const_iterator cbegin() const noexcept;
60 iterator end() noexcept;
61 const_iterator end() const noexcept;
62 const_iterator cend() const noexcept;
64 reverse_iterator rbegin() noexcept;
65 const_reverse_iterator rbegin() const noexcept;
66 const_reverse_iterator crbegin() const noexcept;
67 reverse_iterator rend() noexcept;
68 const_reverse_iterator rend() const noexcept;
69 const_reverse_iterator crend() const noexcept;
72 size_type size() const noexcept;
73 size_type max_size() const noexcept;
74 bool empty() const noexcept;
77 reference operator[](size_type n);
78 const_reference operator[](size_type n) const;
81 const_reference front() const;
83 const_reference back() const;
85 const_reference at(size_type n) const;
86 reference at(size_type n);
90 const T* data() const noexcept;
92 // mutating member functions:
93 void fill(const T& v);
96 }} // std::experimental
100 #include <__functional_base>
103 #include <initializer_list>
107 #if defined(_LIBCPP_NO_EXCEPTIONS)
111 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
112 #pragma GCC system_header
115 namespace std { namespace experimental { inline namespace __array_extensions_v1 {
118 struct _LIBCPP_TYPE_VIS_ONLY dynarray
122 typedef dynarray __self;
123 typedef _Tp value_type;
124 typedef value_type& reference;
125 typedef const value_type& const_reference;
126 typedef value_type* iterator;
127 typedef const value_type* const_iterator;
128 typedef value_type* pointer;
129 typedef const value_type* const_pointer;
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;
137 value_type * __base_;
138 _LIBCPP_ALWAYS_INLINE dynarray () noexcept : __base_(nullptr), __size_(0) {}
140 static inline _LIBCPP_INLINE_VISIBILITY value_type* __allocate ( size_t count )
142 if ( numeric_limits<size_t>::max() / sizeof (value_type) <= count )
144 #ifndef _LIBCPP_NO_EXCEPTIONS
145 throw bad_array_length();
147 assert(!"dynarray::allocation");
150 return static_cast<value_type *> (::operator new (sizeof(value_type) * count));
153 static inline _LIBCPP_INLINE_VISIBILITY void __deallocate ( value_type* __ptr ) noexcept
155 ::operator delete (static_cast<void *> (__ptr));
160 explicit dynarray(size_type __c);
161 dynarray(size_type __c, const value_type& __v);
162 dynarray(const dynarray& __d);
163 dynarray(initializer_list<value_type>);
165 // We're not implementing these right now.
166 // Waiting for the resolution of LWG issue #2235
167 // template <typename _Alloc>
168 // dynarray(size_type __c, const _Alloc& __alloc);
169 // template <typename _Alloc>
170 // dynarray(size_type __c, const value_type& __v, const _Alloc& __alloc);
171 // template <typename _Alloc>
172 // dynarray(const dynarray& __d, const _Alloc& __alloc);
173 // template <typename _Alloc>
174 // dynarray(initializer_list<value_type>, const _Alloc& __alloc);
176 dynarray& operator=(const dynarray&) = delete;
180 inline _LIBCPP_INLINE_VISIBILITY iterator begin() noexcept { return iterator(data()); }
181 inline _LIBCPP_INLINE_VISIBILITY const_iterator begin() const noexcept { return const_iterator(data()); }
182 inline _LIBCPP_INLINE_VISIBILITY const_iterator cbegin() const noexcept { return const_iterator(data()); }
183 inline _LIBCPP_INLINE_VISIBILITY iterator end() noexcept { return iterator(data() + __size_); }
184 inline _LIBCPP_INLINE_VISIBILITY const_iterator end() const noexcept { return const_iterator(data() + __size_); }
185 inline _LIBCPP_INLINE_VISIBILITY const_iterator cend() const noexcept { return const_iterator(data() + __size_); }
187 inline _LIBCPP_INLINE_VISIBILITY reverse_iterator rbegin() noexcept { return reverse_iterator(end()); }
188 inline _LIBCPP_INLINE_VISIBILITY const_reverse_iterator rbegin() const noexcept { return const_reverse_iterator(end()); }
189 inline _LIBCPP_INLINE_VISIBILITY const_reverse_iterator crbegin() const noexcept { return const_reverse_iterator(end()); }
190 inline _LIBCPP_INLINE_VISIBILITY reverse_iterator rend() noexcept { return reverse_iterator(begin()); }
191 inline _LIBCPP_INLINE_VISIBILITY const_reverse_iterator rend() const noexcept { return const_reverse_iterator(begin()); }
192 inline _LIBCPP_INLINE_VISIBILITY const_reverse_iterator crend() const noexcept { return const_reverse_iterator(begin()); }
195 inline _LIBCPP_INLINE_VISIBILITY size_type size() const noexcept { return __size_; }
196 inline _LIBCPP_INLINE_VISIBILITY size_type max_size() const noexcept { return __size_; }
197 inline _LIBCPP_INLINE_VISIBILITY bool empty() const noexcept { return __size_ == 0; }
200 inline _LIBCPP_INLINE_VISIBILITY reference operator[](size_type __n) { return data()[__n]; }
201 inline _LIBCPP_INLINE_VISIBILITY const_reference operator[](size_type __n) const { return data()[__n]; }
203 inline _LIBCPP_INLINE_VISIBILITY reference front() { return data()[0]; }
204 inline _LIBCPP_INLINE_VISIBILITY const_reference front() const { return data()[0]; }
205 inline _LIBCPP_INLINE_VISIBILITY reference back() { return data()[__size_-1]; }
206 inline _LIBCPP_INLINE_VISIBILITY const_reference back() const { return data()[__size_-1]; }
208 inline _LIBCPP_INLINE_VISIBILITY const_reference at(size_type __n) const;
209 inline _LIBCPP_INLINE_VISIBILITY reference at(size_type __n);
212 inline _LIBCPP_INLINE_VISIBILITY _Tp* data() noexcept { return __base_; }
213 inline _LIBCPP_INLINE_VISIBILITY const _Tp* data() const noexcept { return __base_; }
215 // mutating member functions:
216 inline _LIBCPP_INLINE_VISIBILITY void fill(const value_type& __v) { fill_n(begin(), __size_, __v); }
220 inline _LIBCPP_INLINE_VISIBILITY
221 dynarray<_Tp>::dynarray(size_type __c) : dynarray ()
223 __base_ = __allocate (__c);
224 value_type *__data = data ();
225 for ( __size_ = 0; __size_ < __c; ++__size_, ++__data )
226 ::new (__data) value_type;
230 inline _LIBCPP_INLINE_VISIBILITY
231 dynarray<_Tp>::dynarray(size_type __c, const value_type& __v) : dynarray ()
233 __base_ = __allocate (__c);
234 value_type *__data = data ();
235 for ( __size_ = 0; __size_ < __c; ++__size_, ++__data )
236 ::new (__data) value_type (__v);
240 inline _LIBCPP_INLINE_VISIBILITY
241 dynarray<_Tp>::dynarray(initializer_list<value_type> __il) : dynarray ()
243 size_t sz = __il.size();
244 __base_ = __allocate (sz);
245 value_type *__data = data ();
246 auto src = __il.begin();
247 for ( __size_ = 0; __size_ < sz; ++__size_, ++__data, ++src )
248 ::new (__data) value_type (*src);
252 inline _LIBCPP_INLINE_VISIBILITY
253 dynarray<_Tp>::dynarray(const dynarray& __d) : dynarray ()
255 size_t sz = __d.size();
256 __base_ = __allocate (sz);
257 value_type *__data = data ();
258 auto src = __d.begin();
259 for ( __size_ = 0; __size_ < sz; ++__size_, ++__data, ++src )
260 ::new (__data) value_type (*src);
264 inline _LIBCPP_INLINE_VISIBILITY
265 dynarray<_Tp>::~dynarray()
267 value_type *__data = data () + __size_;
268 for ( size_t i = 0; i < __size_; ++i )
269 (--__data)->value_type::~value_type();
270 __deallocate ( __base_ );
274 inline _LIBCPP_INLINE_VISIBILITY
275 typename dynarray<_Tp>::reference
276 dynarray<_Tp>::at(size_type __n)
280 #ifndef _LIBCPP_NO_EXCEPTIONS
281 throw out_of_range("dynarray::at");
283 assert(!"dynarray::at out_of_range");
290 inline _LIBCPP_INLINE_VISIBILITY
291 typename dynarray<_Tp>::const_reference
292 dynarray<_Tp>::at(size_type __n) const
296 #ifndef _LIBCPP_NO_EXCEPTIONS
297 throw out_of_range("dynarray::at");
299 assert(!"dynarray::at out_of_range");
308 _LIBCPP_BEGIN_NAMESPACE_STD
309 template <class _Tp, class _Alloc>
310 struct _LIBCPP_TYPE_VIS_ONLY uses_allocator<std::experimental::dynarray<_Tp>, _Alloc> : true_type {};
311 _LIBCPP_END_NAMESPACE_STD
313 #endif // if _LIBCPP_STD_VER > 11
314 #endif // _LIBCPP_DYNARRAY