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 | |
Dominik Laskowski | 04667b7 | 2021-12-15 13:14:54 -0800 | [diff] [blame^] | 19 | #include <ftl/details/array_traits.h> |
Dominik Laskowski | 5444fc8 | 2020-11-24 13:41:10 -0800 | [diff] [blame] | 20 | #include <ftl/static_vector.h> |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 21 | |
| 22 | #include <algorithm> |
| 23 | #include <iterator> |
| 24 | #include <type_traits> |
| 25 | #include <utility> |
| 26 | #include <variant> |
| 27 | #include <vector> |
| 28 | |
| 29 | namespace android::ftl { |
| 30 | |
| 31 | template <typename> |
Dominik Laskowski | 5444fc8 | 2020-11-24 13:41:10 -0800 | [diff] [blame] | 32 | struct is_small_vector; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 33 | |
| 34 | // ftl::StaticVector that promotes to std::vector when full. SmallVector is a drop-in replacement |
| 35 | // for std::vector with statically allocated storage for N elements, whose goal is to improve run |
| 36 | // time by avoiding heap allocation and increasing probability of cache hits. The standard API is |
| 37 | // augmented by an unstable_erase operation that does not preserve order, and a replace operation |
| 38 | // that destructively emplaces. |
| 39 | // |
| 40 | // SmallVector<T, 0> is a specialization that thinly wraps std::vector. |
| 41 | // |
| 42 | // Example usage: |
| 43 | // |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 44 | // ftl::SmallVector<char, 3> vector; |
| 45 | // assert(vector.empty()); |
| 46 | // assert(!vector.dynamic()); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 47 | // |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 48 | // vector = {'a', 'b', 'c'}; |
| 49 | // assert(vector.size() == 3u); |
| 50 | // assert(!vector.dynamic()); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 51 | // |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 52 | // vector.push_back('d'); |
| 53 | // assert(vector.dynamic()); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 54 | // |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 55 | // vector.unstable_erase(vector.begin()); |
| 56 | // assert(vector == (ftl::SmallVector{'d', 'b', 'c'})); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 57 | // |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 58 | // vector.pop_back(); |
| 59 | // assert(vector.back() == 'b'); |
| 60 | // assert(vector.dynamic()); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 61 | // |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 62 | // const char array[] = "hi"; |
| 63 | // vector = ftl::SmallVector(array); |
| 64 | // assert(vector == (ftl::SmallVector{'h', 'i', '\0'})); |
| 65 | // assert(!vector.dynamic()); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 66 | // |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 67 | // ftl::SmallVector strings = ftl::init::list<std::string>("abc")("123456", 3u)(3u, '?'); |
| 68 | // assert(strings.size() == 3u); |
| 69 | // assert(!strings.dynamic()); |
Dominik Laskowski | ccd50a4 | 2020-10-30 19:56:38 -0700 | [diff] [blame] | 70 | // |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 71 | // assert(strings[0] == "abc"); |
| 72 | // assert(strings[1] == "123"); |
| 73 | // assert(strings[2] == "???"); |
Dominik Laskowski | ccd50a4 | 2020-10-30 19:56:38 -0700 | [diff] [blame] | 74 | // |
Dominik Laskowski | 5444fc8 | 2020-11-24 13:41:10 -0800 | [diff] [blame] | 75 | template <typename T, std::size_t N> |
Dominik Laskowski | 04667b7 | 2021-12-15 13:14:54 -0800 | [diff] [blame^] | 76 | class SmallVector final : details::ArrayTraits<T>, details::ArrayComparators<SmallVector> { |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 77 | using Static = StaticVector<T, N>; |
| 78 | using Dynamic = SmallVector<T, 0>; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 79 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 80 | // TODO: Replace with std::remove_cvref_t in C++20. |
| 81 | template <typename U> |
| 82 | using remove_cvref_t = std::remove_cv_t<std::remove_reference_t<U>>; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 83 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 84 | public: |
| 85 | FTL_ARRAY_TRAIT(T, value_type); |
| 86 | FTL_ARRAY_TRAIT(T, size_type); |
| 87 | FTL_ARRAY_TRAIT(T, difference_type); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 88 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 89 | FTL_ARRAY_TRAIT(T, pointer); |
| 90 | FTL_ARRAY_TRAIT(T, reference); |
| 91 | FTL_ARRAY_TRAIT(T, iterator); |
| 92 | FTL_ARRAY_TRAIT(T, reverse_iterator); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 93 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 94 | FTL_ARRAY_TRAIT(T, const_pointer); |
| 95 | FTL_ARRAY_TRAIT(T, const_reference); |
| 96 | FTL_ARRAY_TRAIT(T, const_iterator); |
| 97 | FTL_ARRAY_TRAIT(T, const_reverse_iterator); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 98 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 99 | // Creates an empty vector. |
| 100 | SmallVector() = default; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 101 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 102 | // Constructs at most N elements. See StaticVector for underlying constructors. |
| 103 | template <typename Arg, typename... Args, |
| 104 | typename = std::enable_if_t<!is_small_vector<remove_cvref_t<Arg>>{}>> |
| 105 | SmallVector(Arg&& arg, Args&&... args) |
| 106 | : vector_(std::in_place_type<Static>, std::forward<Arg>(arg), std::forward<Args>(args)...) {} |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 107 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 108 | // Copies at most N elements from a smaller convertible vector. |
| 109 | template <typename U, std::size_t M, typename = std::enable_if_t<M <= N>> |
| 110 | SmallVector(const SmallVector<U, M>& other) |
| 111 | : SmallVector(kIteratorRange, other.begin(), other.end()) {} |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 112 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 113 | void swap(SmallVector& other) { vector_.swap(other.vector_); } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 114 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 115 | // Returns whether the vector is backed by static or dynamic storage. |
| 116 | bool dynamic() const { return std::holds_alternative<Dynamic>(vector_); } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 117 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 118 | // Avoid std::visit as it generates a dispatch table. |
| 119 | #define DISPATCH(T, F, ...) \ |
| 120 | T F() __VA_ARGS__ { \ |
| 121 | return dynamic() ? std::get<Dynamic>(vector_).F() : std::get<Static>(vector_).F(); \ |
| 122 | } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 123 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 124 | DISPATCH(size_type, max_size, const) |
| 125 | DISPATCH(size_type, size, const) |
| 126 | DISPATCH(bool, empty, const) |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 127 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 128 | // noexcept to suppress warning about zero variadic macro arguments. |
| 129 | DISPATCH(iterator, begin, noexcept) |
| 130 | DISPATCH(const_iterator, begin, const) |
| 131 | DISPATCH(const_iterator, cbegin, const) |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 132 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 133 | DISPATCH(iterator, end, noexcept) |
| 134 | DISPATCH(const_iterator, end, const) |
| 135 | DISPATCH(const_iterator, cend, const) |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 136 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 137 | DISPATCH(reverse_iterator, rbegin, noexcept) |
| 138 | DISPATCH(const_reverse_iterator, rbegin, const) |
| 139 | DISPATCH(const_reverse_iterator, crbegin, const) |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 140 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 141 | DISPATCH(reverse_iterator, rend, noexcept) |
| 142 | DISPATCH(const_reverse_iterator, rend, const) |
| 143 | DISPATCH(const_reverse_iterator, crend, const) |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 144 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 145 | DISPATCH(iterator, last, noexcept) |
| 146 | DISPATCH(const_iterator, last, const) |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 147 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 148 | DISPATCH(reference, front, noexcept) |
| 149 | DISPATCH(const_reference, front, const) |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 150 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 151 | DISPATCH(reference, back, noexcept) |
| 152 | DISPATCH(const_reference, back, const) |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 153 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 154 | reference operator[](size_type i) { |
| 155 | return dynamic() ? std::get<Dynamic>(vector_)[i] : std::get<Static>(vector_)[i]; |
| 156 | } |
| 157 | |
| 158 | const_reference operator[](size_type i) const { return const_cast<SmallVector&>(*this)[i]; } |
| 159 | |
| 160 | // Replaces an element, and returns a reference to it. The iterator must be dereferenceable, so |
| 161 | // replacing at end() is erroneous. |
| 162 | // |
| 163 | // The element is emplaced via move constructor, so type T does not need to define copy/move |
| 164 | // assignment, e.g. its data members may be const. |
| 165 | // |
| 166 | // The arguments may directly or indirectly refer to the element being replaced. |
| 167 | // |
| 168 | // Iterators to the replaced element point to its replacement, and others remain valid. |
| 169 | // |
| 170 | template <typename... Args> |
| 171 | reference replace(const_iterator it, Args&&... args) { |
| 172 | if (dynamic()) { |
| 173 | return std::get<Dynamic>(vector_).replace(it, std::forward<Args>(args)...); |
| 174 | } else { |
| 175 | return std::get<Static>(vector_).replace(it, std::forward<Args>(args)...); |
| 176 | } |
| 177 | } |
| 178 | |
| 179 | // Appends an element, and returns a reference to it. |
| 180 | // |
| 181 | // If the vector reaches its static or dynamic capacity, then all iterators are invalidated. |
| 182 | // Otherwise, only the end() iterator is invalidated. |
| 183 | // |
| 184 | template <typename... Args> |
| 185 | reference emplace_back(Args&&... args) { |
| 186 | constexpr auto kInsertStatic = &Static::template emplace_back<Args...>; |
| 187 | constexpr auto kInsertDynamic = &Dynamic::template emplace_back<Args...>; |
| 188 | return *insert<kInsertStatic, kInsertDynamic>(std::forward<Args>(args)...); |
| 189 | } |
| 190 | |
| 191 | // Appends an element. |
| 192 | // |
| 193 | // If the vector reaches its static or dynamic capacity, then all iterators are invalidated. |
| 194 | // Otherwise, only the end() iterator is invalidated. |
| 195 | // |
| 196 | void push_back(const value_type& v) { |
| 197 | constexpr auto kInsertStatic = |
| 198 | static_cast<bool (Static::*)(const value_type&)>(&Static::push_back); |
| 199 | constexpr auto kInsertDynamic = |
| 200 | static_cast<bool (Dynamic::*)(const value_type&)>(&Dynamic::push_back); |
| 201 | insert<kInsertStatic, kInsertDynamic>(v); |
| 202 | } |
| 203 | |
| 204 | void push_back(value_type&& v) { |
| 205 | constexpr auto kInsertStatic = static_cast<bool (Static::*)(value_type &&)>(&Static::push_back); |
| 206 | constexpr auto kInsertDynamic = |
| 207 | static_cast<bool (Dynamic::*)(value_type &&)>(&Dynamic::push_back); |
| 208 | insert<kInsertStatic, kInsertDynamic>(std::move(v)); |
| 209 | } |
| 210 | |
| 211 | // Removes the last element. The vector must not be empty, or the call is erroneous. |
| 212 | // |
| 213 | // The last() and end() iterators are invalidated. |
| 214 | // |
Dominik Laskowski | 44828ce | 2021-09-13 11:00:22 -0700 | [diff] [blame] | 215 | DISPATCH(void, pop_back, noexcept) |
| 216 | |
| 217 | // Removes all elements. |
| 218 | // |
| 219 | // All iterators are invalidated. |
| 220 | // |
| 221 | DISPATCH(void, clear, noexcept) |
| 222 | |
| 223 | #undef DISPATCH |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 224 | |
| 225 | // Erases an element, but does not preserve order. Rather than shifting subsequent elements, |
| 226 | // this moves the last element to the slot of the erased element. |
| 227 | // |
| 228 | // The last() and end() iterators, as well as those to the erased element, are invalidated. |
| 229 | // |
| 230 | void unstable_erase(iterator it) { |
| 231 | if (dynamic()) { |
| 232 | std::get<Dynamic>(vector_).unstable_erase(it); |
| 233 | } else { |
| 234 | std::get<Static>(vector_).unstable_erase(it); |
| 235 | } |
| 236 | } |
| 237 | |
| 238 | private: |
| 239 | template <auto InsertStatic, auto InsertDynamic, typename... Args> |
| 240 | auto insert(Args&&... args) { |
| 241 | if (Dynamic* const vector = std::get_if<Dynamic>(&vector_)) { |
| 242 | return (vector->*InsertDynamic)(std::forward<Args>(args)...); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 243 | } |
| 244 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 245 | auto& vector = std::get<Static>(vector_); |
| 246 | if (vector.full()) { |
| 247 | return (promote(vector).*InsertDynamic)(std::forward<Args>(args)...); |
| 248 | } else { |
| 249 | return (vector.*InsertStatic)(std::forward<Args>(args)...); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 250 | } |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 251 | } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 252 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 253 | Dynamic& promote(Static& static_vector) { |
| 254 | assert(static_vector.full()); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 255 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 256 | // Allocate double capacity to reduce probability of reallocation. |
| 257 | Dynamic vector; |
| 258 | vector.reserve(Static::max_size() * 2); |
| 259 | std::move(static_vector.begin(), static_vector.end(), std::back_inserter(vector)); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 260 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 261 | return vector_.template emplace<Dynamic>(std::move(vector)); |
| 262 | } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 263 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 264 | std::variant<Static, Dynamic> vector_; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 265 | }; |
| 266 | |
| 267 | // Partial specialization without static storage. |
| 268 | template <typename T> |
Dominik Laskowski | 04667b7 | 2021-12-15 13:14:54 -0800 | [diff] [blame^] | 269 | class SmallVector<T, 0> final : details::ArrayTraits<T>, |
| 270 | details::ArrayIterators<SmallVector<T, 0>, T>, |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 271 | std::vector<T> { |
Dominik Laskowski | 04667b7 | 2021-12-15 13:14:54 -0800 | [diff] [blame^] | 272 | using details::ArrayTraits<T>::construct_at; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 273 | |
Dominik Laskowski | 04667b7 | 2021-12-15 13:14:54 -0800 | [diff] [blame^] | 274 | using Iter = details::ArrayIterators<SmallVector, T>; |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 275 | using Impl = std::vector<T>; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 276 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 277 | friend Iter; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 278 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 279 | public: |
| 280 | FTL_ARRAY_TRAIT(T, value_type); |
| 281 | FTL_ARRAY_TRAIT(T, size_type); |
| 282 | FTL_ARRAY_TRAIT(T, difference_type); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 283 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 284 | FTL_ARRAY_TRAIT(T, pointer); |
| 285 | FTL_ARRAY_TRAIT(T, reference); |
| 286 | FTL_ARRAY_TRAIT(T, iterator); |
| 287 | FTL_ARRAY_TRAIT(T, reverse_iterator); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 288 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 289 | FTL_ARRAY_TRAIT(T, const_pointer); |
| 290 | FTL_ARRAY_TRAIT(T, const_reference); |
| 291 | FTL_ARRAY_TRAIT(T, const_iterator); |
| 292 | FTL_ARRAY_TRAIT(T, const_reverse_iterator); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 293 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 294 | using Impl::Impl; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 295 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 296 | using Impl::empty; |
| 297 | using Impl::max_size; |
| 298 | using Impl::size; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 299 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 300 | using Impl::reserve; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 301 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 302 | // std::vector iterators are not necessarily raw pointers. |
| 303 | iterator begin() { return Impl::data(); } |
| 304 | iterator end() { return Impl::data() + size(); } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 305 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 306 | using Iter::begin; |
| 307 | using Iter::end; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 308 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 309 | using Iter::cbegin; |
| 310 | using Iter::cend; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 311 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 312 | using Iter::rbegin; |
| 313 | using Iter::rend; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 314 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 315 | using Iter::crbegin; |
| 316 | using Iter::crend; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 317 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 318 | using Iter::last; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 319 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 320 | using Iter::back; |
| 321 | using Iter::front; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 322 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 323 | using Iter::operator[]; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 324 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 325 | template <typename... Args> |
| 326 | reference replace(const_iterator it, Args&&... args) { |
| 327 | value_type element{std::forward<Args>(args)...}; |
| 328 | std::destroy_at(it); |
| 329 | // This is only safe because exceptions are disabled. |
| 330 | return *construct_at(it, std::move(element)); |
| 331 | } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 332 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 333 | template <typename... Args> |
| 334 | iterator emplace_back(Args&&... args) { |
| 335 | return &Impl::emplace_back(std::forward<Args>(args)...); |
| 336 | } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 337 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 338 | bool push_back(const value_type& v) { |
| 339 | Impl::push_back(v); |
| 340 | return true; |
| 341 | } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 342 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 343 | bool push_back(value_type&& v) { |
| 344 | Impl::push_back(std::move(v)); |
| 345 | return true; |
| 346 | } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 347 | |
Dominik Laskowski | 44828ce | 2021-09-13 11:00:22 -0700 | [diff] [blame] | 348 | using Impl::clear; |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 349 | using Impl::pop_back; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 350 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 351 | void unstable_erase(iterator it) { |
Dominik Laskowski | dda9bba | 2021-02-03 18:56:00 -0800 | [diff] [blame] | 352 | if (it != last()) replace(it, std::move(back())); |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 353 | pop_back(); |
| 354 | } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 355 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 356 | void swap(SmallVector& other) { Impl::swap(other); } |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 357 | }; |
| 358 | |
| 359 | template <typename> |
Dominik Laskowski | 5444fc8 | 2020-11-24 13:41:10 -0800 | [diff] [blame] | 360 | struct is_small_vector : std::false_type {}; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 361 | |
Dominik Laskowski | 5444fc8 | 2020-11-24 13:41:10 -0800 | [diff] [blame] | 362 | template <typename T, std::size_t N> |
| 363 | struct is_small_vector<SmallVector<T, N>> : std::true_type {}; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 364 | |
| 365 | // Deduction guide for array constructor. |
Dominik Laskowski | 5444fc8 | 2020-11-24 13:41:10 -0800 | [diff] [blame] | 366 | template <typename T, std::size_t N> |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 367 | SmallVector(T (&)[N]) -> SmallVector<std::remove_cv_t<T>, N>; |
| 368 | |
| 369 | // Deduction guide for variadic constructor. |
| 370 | template <typename T, typename... Us, typename V = std::decay_t<T>, |
| 371 | typename = std::enable_if_t<(std::is_constructible_v<V, Us> && ...)>> |
| 372 | SmallVector(T&&, Us&&...) -> SmallVector<V, 1 + sizeof...(Us)>; |
| 373 | |
| 374 | // Deduction guide for in-place constructor. |
Dominik Laskowski | 5444fc8 | 2020-11-24 13:41:10 -0800 | [diff] [blame] | 375 | template <typename T, std::size_t... Sizes, typename... Types> |
Dominik Laskowski | ccd50a4 | 2020-10-30 19:56:38 -0700 | [diff] [blame] | 376 | SmallVector(InitializerList<T, std::index_sequence<Sizes...>, Types...>&&) |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 377 | -> SmallVector<T, sizeof...(Sizes)>; |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 378 | |
| 379 | // Deduction guide for StaticVector conversion. |
Dominik Laskowski | 5444fc8 | 2020-11-24 13:41:10 -0800 | [diff] [blame] | 380 | template <typename T, std::size_t N> |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 381 | SmallVector(StaticVector<T, N>&&) -> SmallVector<T, N>; |
| 382 | |
Dominik Laskowski | 5444fc8 | 2020-11-24 13:41:10 -0800 | [diff] [blame] | 383 | template <typename T, std::size_t N> |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 384 | inline void swap(SmallVector<T, N>& lhs, SmallVector<T, N>& rhs) { |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 385 | lhs.swap(rhs); |
Dominik Laskowski | 0bacf27 | 2020-10-22 14:08:27 -0700 | [diff] [blame] | 386 | } |
| 387 | |
Dominik Laskowski | e21dbed | 2020-12-04 20:51:43 -0800 | [diff] [blame] | 388 | } // namespace android::ftl |