Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 2020 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | #pragma once |
| 18 | |
| 19 | #include <algorithm> |
| 20 | #include <iterator> |
| 21 | #include <new> |
| 22 | |
| 23 | #define FTL_ARRAY_TRAIT(T, U) using U = typename ArrayTraits<T>::U |
| 24 | |
| 25 | namespace android::ftl { |
| 26 | |
| 27 | template <typename T> |
| 28 | struct ArrayTraits { |
| 29 | using value_type = T; |
| 30 | using size_type = size_t; |
| 31 | using difference_type = ptrdiff_t; |
| 32 | |
| 33 | using pointer = value_type*; |
| 34 | using reference = value_type&; |
| 35 | using iterator = pointer; |
| 36 | using reverse_iterator = std::reverse_iterator<iterator>; |
| 37 | |
| 38 | using const_pointer = const value_type*; |
| 39 | using const_reference = const value_type&; |
| 40 | using const_iterator = const_pointer; |
| 41 | using const_reverse_iterator = std::reverse_iterator<const_iterator>; |
| 42 | |
| 43 | // TODO: Replace with std::construct_at in C++20. |
| 44 | template <typename... Args> |
| 45 | static pointer construct_at(const_iterator it, Args&&... args) { |
| 46 | void* const ptr = const_cast<void*>(static_cast<const void*>(it)); |
| 47 | return new (ptr) value_type{std::forward<Args>(args)...}; |
| 48 | } |
| 49 | }; |
| 50 | |
| 51 | // CRTP mixin to define iterator functions in terms of non-const Self::begin and Self::end. |
| 52 | template <typename Self, typename T> |
| 53 | class ArrayIterators { |
| 54 | FTL_ARRAY_TRAIT(T, size_type); |
| 55 | |
| 56 | FTL_ARRAY_TRAIT(T, reference); |
| 57 | FTL_ARRAY_TRAIT(T, iterator); |
| 58 | FTL_ARRAY_TRAIT(T, reverse_iterator); |
| 59 | |
| 60 | FTL_ARRAY_TRAIT(T, const_reference); |
| 61 | FTL_ARRAY_TRAIT(T, const_iterator); |
| 62 | FTL_ARRAY_TRAIT(T, const_reverse_iterator); |
| 63 | |
| 64 | Self& self() const { return *const_cast<Self*>(static_cast<const Self*>(this)); } |
| 65 | |
| 66 | public: |
| 67 | const_iterator begin() const { return cbegin(); } |
| 68 | const_iterator cbegin() const { return self().begin(); } |
| 69 | |
| 70 | const_iterator end() const { return cend(); } |
| 71 | const_iterator cend() const { return self().end(); } |
| 72 | |
| 73 | reverse_iterator rbegin() { return std::make_reverse_iterator(self().end()); } |
| 74 | const_reverse_iterator rbegin() const { return crbegin(); } |
| 75 | const_reverse_iterator crbegin() const { return self().rbegin(); } |
| 76 | |
| 77 | reverse_iterator rend() { return std::make_reverse_iterator(self().begin()); } |
| 78 | const_reverse_iterator rend() const { return crend(); } |
| 79 | const_reverse_iterator crend() const { return self().rend(); } |
| 80 | |
| 81 | iterator last() { return self().end() - 1; } |
| 82 | const_iterator last() const { return self().last(); } |
| 83 | |
| 84 | reference front() { return *self().begin(); } |
| 85 | const_reference front() const { return self().front(); } |
| 86 | |
| 87 | reference back() { return *last(); } |
| 88 | const_reference back() const { return self().back(); } |
| 89 | |
| 90 | reference operator[](size_type i) { return *(self().begin() + i); } |
| 91 | const_reference operator[](size_type i) const { return self()[i]; } |
| 92 | }; |
| 93 | |
| 94 | // Mixin to define comparison operators for an array-like template. |
| 95 | // TODO: Replace with operator<=> in C++20. |
| 96 | template <template <typename, size_t> class Array> |
| 97 | struct ArrayComparators { |
| 98 | template <typename T, size_t N, size_t M> |
| 99 | friend bool operator==(const Array<T, N>& lhs, const Array<T, M>& rhs) { |
| 100 | return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin()); |
| 101 | } |
| 102 | |
| 103 | template <typename T, size_t N, size_t M> |
| 104 | friend bool operator<(const Array<T, N>& lhs, const Array<T, M>& rhs) { |
| 105 | return std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end()); |
| 106 | } |
| 107 | |
| 108 | template <typename T, size_t N, size_t M> |
| 109 | friend bool operator>(const Array<T, N>& lhs, const Array<T, M>& rhs) { |
| 110 | return rhs < lhs; |
| 111 | } |
| 112 | |
| 113 | template <typename T, size_t N, size_t M> |
| 114 | friend bool operator!=(const Array<T, N>& lhs, const Array<T, M>& rhs) { |
| 115 | return !(lhs == rhs); |
| 116 | } |
| 117 | |
| 118 | template <typename T, size_t N, size_t M> |
| 119 | friend bool operator>=(const Array<T, N>& lhs, const Array<T, M>& rhs) { |
| 120 | return !(lhs < rhs); |
| 121 | } |
| 122 | |
| 123 | template <typename T, size_t N, size_t M> |
| 124 | friend bool operator<=(const Array<T, N>& lhs, const Array<T, M>& rhs) { |
| 125 | return !(lhs > rhs); |
| 126 | } |
| 127 | }; |
| 128 | |
| 129 | } // namespace android::ftl |