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 dynarray(size_type c, const T& v);
42 dynarray(const dynarray& d);
43 dynarray(initializer_list<T>);
45 template <class Alloc>
46 dynarray(allocator_arg_t, const Alloc& a, size_type c, const Alloc& alloc);
47 template <class Alloc>
48 dynarray(allocator_arg_t, const Alloc& a, size_type c, const T& v, const Alloc& alloc);
49 template <class Alloc>
50 dynarray(allocator_arg_t, const Alloc& a, const dynarray& d, const Alloc& alloc);
51 template <class Alloc>
52 dynarray(allocator_arg_t, const Alloc& a, 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 #include <__undef___deallocate>
109 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
110 #pragma GCC system_header
113 namespace std { namespace experimental { inline namespace __array_extensions_v1 {
116 struct _LIBCPP_TEMPLATE_VIS dynarray
120 typedef dynarray __self;
121 typedef _Tp value_type;
122 typedef value_type& reference;
123 typedef const value_type& const_reference;
124 typedef value_type* iterator;
125 typedef const value_type* const_iterator;
126 typedef value_type* pointer;
127 typedef const value_type* const_pointer;
128 typedef size_t size_type;
129 typedef ptrdiff_t difference_type;
130 typedef std::reverse_iterator<iterator> reverse_iterator;
131 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
135 value_type * __base_;
136 _LIBCPP_ALWAYS_INLINE dynarray () noexcept : __size_(0), __base_(nullptr) {}
138 static inline _LIBCPP_INLINE_VISIBILITY value_type* __allocate ( size_t count )
140 if ( numeric_limits<size_t>::max() / sizeof (value_type) <= count )
141 __throw_bad_array_length();
143 return static_cast<value_type *> (_VSTD::__allocate (sizeof(value_type) * count));
146 static inline _LIBCPP_INLINE_VISIBILITY void __deallocate ( value_type* __ptr ) noexcept
148 _VSTD::__deallocate (static_cast<void *> (__ptr));
153 _LIBCPP_INLINE_VISIBILITY
154 explicit dynarray(size_type __c);
155 _LIBCPP_INLINE_VISIBILITY
156 dynarray(size_type __c, const value_type& __v);
157 _LIBCPP_INLINE_VISIBILITY
158 dynarray(const dynarray& __d);
159 _LIBCPP_INLINE_VISIBILITY
160 dynarray(initializer_list<value_type>);
162 // We're not implementing these right now.
163 // Updated with the resolution of LWG issue #2255
164 // template <typename _Alloc>
165 // dynarray(allocator_arg_t, const _Alloc& __alloc, size_type __c);
166 // template <typename _Alloc>
167 // dynarray(allocator_arg_t, const _Alloc& __alloc, size_type __c, const value_type& __v);
168 // template <typename _Alloc>
169 // dynarray(allocator_arg_t, const _Alloc& __alloc, const dynarray& __d);
170 // template <typename _Alloc>
171 // dynarray(allocator_arg_t, const _Alloc& __alloc, initializer_list<value_type>);
173 dynarray& operator=(const dynarray&) = delete;
174 _LIBCPP_INLINE_VISIBILITY
178 inline _LIBCPP_INLINE_VISIBILITY iterator begin() noexcept { return iterator(data()); }
179 inline _LIBCPP_INLINE_VISIBILITY const_iterator begin() const noexcept { return const_iterator(data()); }
180 inline _LIBCPP_INLINE_VISIBILITY const_iterator cbegin() const noexcept { return const_iterator(data()); }
181 inline _LIBCPP_INLINE_VISIBILITY iterator end() noexcept { return iterator(data() + __size_); }
182 inline _LIBCPP_INLINE_VISIBILITY const_iterator end() const noexcept { return const_iterator(data() + __size_); }
183 inline _LIBCPP_INLINE_VISIBILITY const_iterator cend() const noexcept { return const_iterator(data() + __size_); }
185 inline _LIBCPP_INLINE_VISIBILITY reverse_iterator rbegin() noexcept { return reverse_iterator(end()); }
186 inline _LIBCPP_INLINE_VISIBILITY const_reverse_iterator rbegin() const noexcept { return const_reverse_iterator(end()); }
187 inline _LIBCPP_INLINE_VISIBILITY const_reverse_iterator crbegin() const noexcept { return const_reverse_iterator(end()); }
188 inline _LIBCPP_INLINE_VISIBILITY reverse_iterator rend() noexcept { return reverse_iterator(begin()); }
189 inline _LIBCPP_INLINE_VISIBILITY const_reverse_iterator rend() const noexcept { return const_reverse_iterator(begin()); }
190 inline _LIBCPP_INLINE_VISIBILITY const_reverse_iterator crend() const noexcept { return const_reverse_iterator(begin()); }
193 inline _LIBCPP_INLINE_VISIBILITY size_type size() const noexcept { return __size_; }
194 inline _LIBCPP_INLINE_VISIBILITY size_type max_size() const noexcept { return __size_; }
195 inline _LIBCPP_INLINE_VISIBILITY bool empty() const noexcept { return __size_ == 0; }
198 inline _LIBCPP_INLINE_VISIBILITY reference operator[](size_type __n) { return data()[__n]; }
199 inline _LIBCPP_INLINE_VISIBILITY const_reference operator[](size_type __n) const { return data()[__n]; }
201 inline _LIBCPP_INLINE_VISIBILITY reference front() { return data()[0]; }
202 inline _LIBCPP_INLINE_VISIBILITY const_reference front() const { return data()[0]; }
203 inline _LIBCPP_INLINE_VISIBILITY reference back() { return data()[__size_-1]; }
204 inline _LIBCPP_INLINE_VISIBILITY const_reference back() const { return data()[__size_-1]; }
206 inline _LIBCPP_INLINE_VISIBILITY const_reference at(size_type __n) const;
207 inline _LIBCPP_INLINE_VISIBILITY reference at(size_type __n);
210 inline _LIBCPP_INLINE_VISIBILITY _Tp* data() noexcept { return __base_; }
211 inline _LIBCPP_INLINE_VISIBILITY const _Tp* data() const noexcept { return __base_; }
213 // mutating member functions:
214 inline _LIBCPP_INLINE_VISIBILITY void fill(const value_type& __v) { fill_n(begin(), __size_, __v); }
219 dynarray<_Tp>::dynarray(size_type __c) : dynarray ()
221 __base_ = __allocate (__c);
222 value_type *__data = data ();
223 for ( __size_ = 0; __size_ < __c; ++__size_, ++__data )
224 ::new (__data) value_type;
229 dynarray<_Tp>::dynarray(size_type __c, const value_type& __v) : dynarray ()
231 __base_ = __allocate (__c);
232 value_type *__data = data ();
233 for ( __size_ = 0; __size_ < __c; ++__size_, ++__data )
234 ::new (__data) value_type (__v);
239 dynarray<_Tp>::dynarray(initializer_list<value_type> __il) : dynarray ()
241 size_t sz = __il.size();
242 __base_ = __allocate (sz);
243 value_type *__data = data ();
244 auto src = __il.begin();
245 for ( __size_ = 0; __size_ < sz; ++__size_, ++__data, ++src )
246 ::new (__data) value_type (*src);
251 dynarray<_Tp>::dynarray(const dynarray& __d) : dynarray ()
253 size_t sz = __d.size();
254 __base_ = __allocate (sz);
255 value_type *__data = data ();
256 auto src = __d.begin();
257 for ( __size_ = 0; __size_ < sz; ++__size_, ++__data, ++src )
258 ::new (__data) value_type (*src);
263 dynarray<_Tp>::~dynarray()
265 value_type *__data = data () + __size_;
266 for ( size_t i = 0; i < __size_; ++i )
267 (--__data)->value_type::~value_type();
268 __deallocate ( __base_ );
272 inline _LIBCPP_INLINE_VISIBILITY
273 typename dynarray<_Tp>::reference
274 dynarray<_Tp>::at(size_type __n)
277 __throw_out_of_range("dynarray::at");
283 inline _LIBCPP_INLINE_VISIBILITY
284 typename dynarray<_Tp>::const_reference
285 dynarray<_Tp>::at(size_type __n) const
288 __throw_out_of_range("dynarray::at");
296 _LIBCPP_BEGIN_NAMESPACE_STD
297 template <class _Tp, class _Alloc>
298 struct _LIBCPP_TEMPLATE_VIS uses_allocator<std::experimental::dynarray<_Tp>, _Alloc> : true_type {};
299 _LIBCPP_END_NAMESPACE_STD
301 #endif // if _LIBCPP_STD_VER > 11
302 #endif // _LIBCPP_DYNARRAY