1 //===--- ArrayRef.h - Array Reference Wrapper -------------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #ifndef LLVM_ADT_ARRAYREF_H
11 #define LLVM_ADT_ARRAYREF_H
13 #include "llvm/ADT/Hashing.h"
14 #include "llvm/ADT/None.h"
15 #include "llvm/ADT/SmallVector.h"
19 /// ArrayRef - Represent a constant reference to an array (0 or more elements
20 /// consecutively in memory), i.e. a start pointer and a length. It allows
21 /// various APIs to take consecutive elements easily and conveniently.
23 /// This class does not own the underlying data, it is expected to be used in
24 /// situations where the data resides in some other buffer, whose lifetime
25 /// extends past that of the ArrayRef. For this reason, it is not in general
26 /// safe to store an ArrayRef.
28 /// This is intended to be trivially copyable, so it should be passed by
33 typedef const T *iterator;
34 typedef const T *const_iterator;
35 typedef size_t size_type;
37 typedef std::reverse_iterator<iterator> reverse_iterator;
40 /// The start of the array, in an external buffer.
43 /// The number of elements.
47 /// @name Constructors
50 /// Construct an empty ArrayRef.
51 /*implicit*/ ArrayRef() : Data(nullptr), Length(0) {}
53 /// Construct an empty ArrayRef from None.
54 /*implicit*/ ArrayRef(NoneType) : Data(nullptr), Length(0) {}
56 /// Construct an ArrayRef from a single element.
57 /*implicit*/ ArrayRef(const T &OneElt)
58 : Data(&OneElt), Length(1) {}
60 /// Construct an ArrayRef from a pointer and length.
61 /*implicit*/ ArrayRef(const T *data, size_t length)
62 : Data(data), Length(length) {}
64 /// Construct an ArrayRef from a range.
65 ArrayRef(const T *begin, const T *end)
66 : Data(begin), Length(end - begin) {}
68 /// Construct an ArrayRef from a SmallVector. This is templated in order to
69 /// avoid instantiating SmallVectorTemplateCommon<T> whenever we
70 /// copy-construct an ArrayRef.
72 /*implicit*/ ArrayRef(const SmallVectorTemplateCommon<T, U> &Vec)
73 : Data(Vec.data()), Length(Vec.size()) {
76 /// Construct an ArrayRef from a std::vector.
78 /*implicit*/ ArrayRef(const std::vector<T, A> &Vec)
79 : Data(Vec.data()), Length(Vec.size()) {}
81 /// Construct an ArrayRef from a C array.
83 /*implicit*/ LLVM_CONSTEXPR ArrayRef(const T (&Arr)[N])
84 : Data(Arr), Length(N) {}
86 /// Construct an ArrayRef from a std::initializer_list.
87 /*implicit*/ ArrayRef(const std::initializer_list<T> &Vec)
88 : Data(Vec.begin() == Vec.end() ? (T*)nullptr : Vec.begin()),
91 /// Construct an ArrayRef<const T*> from ArrayRef<T*>. This uses SFINAE to
92 /// ensure that only ArrayRefs of pointers can be converted.
95 const ArrayRef<U *> &A,
96 typename std::enable_if<
97 std::is_convertible<U *const *, T const *>::value>::type * = nullptr)
98 : Data(A.data()), Length(A.size()) {}
100 /// Construct an ArrayRef<const T*> from a SmallVector<T*>. This is
101 /// templated in order to avoid instantiating SmallVectorTemplateCommon<T>
102 /// whenever we copy-construct an ArrayRef.
103 template<typename U, typename DummyT>
104 /*implicit*/ ArrayRef(
105 const SmallVectorTemplateCommon<U *, DummyT> &Vec,
106 typename std::enable_if<
107 std::is_convertible<U *const *, T const *>::value>::type * = nullptr)
108 : Data(Vec.data()), Length(Vec.size()) {
111 /// Construct an ArrayRef<const T*> from std::vector<T*>. This uses SFINAE
112 /// to ensure that only vectors of pointers can be converted.
113 template<typename U, typename A>
114 ArrayRef(const std::vector<U *, A> &Vec,
115 typename std::enable_if<
116 std::is_convertible<U *const *, T const *>::value>::type* = 0)
117 : Data(Vec.data()), Length(Vec.size()) {}
120 /// @name Simple Operations
123 iterator begin() const { return Data; }
124 iterator end() const { return Data + Length; }
126 reverse_iterator rbegin() const { return reverse_iterator(end()); }
127 reverse_iterator rend() const { return reverse_iterator(begin()); }
129 /// empty - Check if the array is empty.
130 bool empty() const { return Length == 0; }
132 const T *data() const { return Data; }
134 /// size - Get the array size.
135 size_t size() const { return Length; }
137 /// front - Get the first element.
138 const T &front() const {
143 /// back - Get the last element.
144 const T &back() const {
146 return Data[Length-1];
149 // copy - Allocate copy in Allocator and return ArrayRef<T> to it.
150 template <typename Allocator> ArrayRef<T> copy(Allocator &A) {
151 T *Buff = A.template Allocate<T>(Length);
152 std::uninitialized_copy(begin(), end(), Buff);
153 return ArrayRef<T>(Buff, Length);
156 /// equals - Check for element-wise equality.
157 bool equals(ArrayRef RHS) const {
158 if (Length != RHS.Length)
160 return std::equal(begin(), end(), RHS.begin());
163 /// slice(n) - Chop off the first N elements of the array.
164 ArrayRef<T> slice(size_t N) const {
165 assert(N <= size() && "Invalid specifier");
166 return ArrayRef<T>(data()+N, size()-N);
169 /// slice(n, m) - Chop off the first N elements of the array, and keep M
170 /// elements in the array.
171 ArrayRef<T> slice(size_t N, size_t M) const {
172 assert(N+M <= size() && "Invalid specifier");
173 return ArrayRef<T>(data()+N, M);
176 /// \brief Drop the first \p N elements of the array.
177 ArrayRef<T> drop_front(size_t N = 1) const {
178 assert(size() >= N && "Dropping more elements than exist");
179 return slice(N, size() - N);
182 /// \brief Drop the last \p N elements of the array.
183 ArrayRef<T> drop_back(size_t N = 1) const {
184 assert(size() >= N && "Dropping more elements than exist");
185 return slice(0, size() - N);
189 /// @name Operator Overloads
191 const T &operator[](size_t Index) const {
192 assert(Index < Length && "Invalid index!");
197 /// @name Expensive Operations
199 std::vector<T> vec() const {
200 return std::vector<T>(Data, Data+Length);
204 /// @name Conversion operators
206 operator std::vector<T>() const {
207 return std::vector<T>(Data, Data+Length);
213 /// MutableArrayRef - Represent a mutable reference to an array (0 or more
214 /// elements consecutively in memory), i.e. a start pointer and a length. It
215 /// allows various APIs to take and modify consecutive elements easily and
218 /// This class does not own the underlying data, it is expected to be used in
219 /// situations where the data resides in some other buffer, whose lifetime
220 /// extends past that of the MutableArrayRef. For this reason, it is not in
221 /// general safe to store a MutableArrayRef.
223 /// This is intended to be trivially copyable, so it should be passed by
226 class MutableArrayRef : public ArrayRef<T> {
230 typedef std::reverse_iterator<iterator> reverse_iterator;
232 /// Construct an empty MutableArrayRef.
233 /*implicit*/ MutableArrayRef() : ArrayRef<T>() {}
235 /// Construct an empty MutableArrayRef from None.
236 /*implicit*/ MutableArrayRef(NoneType) : ArrayRef<T>() {}
238 /// Construct an MutableArrayRef from a single element.
239 /*implicit*/ MutableArrayRef(T &OneElt) : ArrayRef<T>(OneElt) {}
241 /// Construct an MutableArrayRef from a pointer and length.
242 /*implicit*/ MutableArrayRef(T *data, size_t length)
243 : ArrayRef<T>(data, length) {}
245 /// Construct an MutableArrayRef from a range.
246 MutableArrayRef(T *begin, T *end) : ArrayRef<T>(begin, end) {}
248 /// Construct an MutableArrayRef from a SmallVector.
249 /*implicit*/ MutableArrayRef(SmallVectorImpl<T> &Vec)
250 : ArrayRef<T>(Vec) {}
252 /// Construct a MutableArrayRef from a std::vector.
253 /*implicit*/ MutableArrayRef(std::vector<T> &Vec)
254 : ArrayRef<T>(Vec) {}
256 /// Construct an MutableArrayRef from a C array.
258 /*implicit*/ LLVM_CONSTEXPR MutableArrayRef(T (&Arr)[N])
259 : ArrayRef<T>(Arr) {}
261 T *data() const { return const_cast<T*>(ArrayRef<T>::data()); }
263 iterator begin() const { return data(); }
264 iterator end() const { return data() + this->size(); }
266 reverse_iterator rbegin() const { return reverse_iterator(end()); }
267 reverse_iterator rend() const { return reverse_iterator(begin()); }
269 /// front - Get the first element.
271 assert(!this->empty());
275 /// back - Get the last element.
277 assert(!this->empty());
278 return data()[this->size()-1];
281 /// slice(n) - Chop off the first N elements of the array.
282 MutableArrayRef<T> slice(size_t N) const {
283 assert(N <= this->size() && "Invalid specifier");
284 return MutableArrayRef<T>(data()+N, this->size()-N);
287 /// slice(n, m) - Chop off the first N elements of the array, and keep M
288 /// elements in the array.
289 MutableArrayRef<T> slice(size_t N, size_t M) const {
290 assert(N+M <= this->size() && "Invalid specifier");
291 return MutableArrayRef<T>(data()+N, M);
294 /// \brief Drop the first \p N elements of the array.
295 MutableArrayRef<T> drop_front(size_t N = 1) const {
296 assert(this->size() >= N && "Dropping more elements than exist");
297 return slice(N, this->size() - N);
300 MutableArrayRef<T> drop_back(size_t N = 1) const {
301 assert(this->size() >= N && "Dropping more elements than exist");
302 return slice(0, this->size() - N);
306 /// @name Operator Overloads
308 T &operator[](size_t Index) const {
309 assert(Index < this->size() && "Invalid index!");
310 return data()[Index];
314 /// @name ArrayRef Convenience constructors
317 /// Construct an ArrayRef from a single element.
319 ArrayRef<T> makeArrayRef(const T &OneElt) {
323 /// Construct an ArrayRef from a pointer and length.
325 ArrayRef<T> makeArrayRef(const T *data, size_t length) {
326 return ArrayRef<T>(data, length);
329 /// Construct an ArrayRef from a range.
331 ArrayRef<T> makeArrayRef(const T *begin, const T *end) {
332 return ArrayRef<T>(begin, end);
335 /// Construct an ArrayRef from a SmallVector.
336 template <typename T>
337 ArrayRef<T> makeArrayRef(const SmallVectorImpl<T> &Vec) {
341 /// Construct an ArrayRef from a SmallVector.
342 template <typename T, unsigned N>
343 ArrayRef<T> makeArrayRef(const SmallVector<T, N> &Vec) {
347 /// Construct an ArrayRef from a std::vector.
349 ArrayRef<T> makeArrayRef(const std::vector<T> &Vec) {
353 /// Construct an ArrayRef from an ArrayRef (no-op) (const)
354 template <typename T> ArrayRef<T> makeArrayRef(const ArrayRef<T> &Vec) {
358 /// Construct an ArrayRef from an ArrayRef (no-op)
359 template <typename T> ArrayRef<T> &makeArrayRef(ArrayRef<T> &Vec) {
363 /// Construct an ArrayRef from a C array.
364 template<typename T, size_t N>
365 ArrayRef<T> makeArrayRef(const T (&Arr)[N]) {
366 return ArrayRef<T>(Arr);
370 /// @name ArrayRef Comparison Operators
374 inline bool operator==(ArrayRef<T> LHS, ArrayRef<T> RHS) {
375 return LHS.equals(RHS);
379 inline bool operator!=(ArrayRef<T> LHS, ArrayRef<T> RHS) {
380 return !(LHS == RHS);
385 // ArrayRefs can be treated like a POD type.
386 template <typename T> struct isPodLike;
387 template <typename T> struct isPodLike<ArrayRef<T> > {
388 static const bool value = true;
391 template <typename T> hash_code hash_value(ArrayRef<T> S) {
392 return hash_combine_range(S.begin(), S.end());
394 } // end namespace llvm
396 #endif // LLVM_ADT_ARRAYREF_H