|
| 1 | +/**************************************************************************/ |
| 2 | +/* fixed_vector.h */ |
| 3 | +/**************************************************************************/ |
| 4 | +/* This file is part of: */ |
| 5 | +/* GODOT ENGINE */ |
| 6 | +/* https://godotengine.org */ |
| 7 | +/**************************************************************************/ |
| 8 | +/* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */ |
| 9 | +/* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */ |
| 10 | +/* */ |
| 11 | +/* Permission is hereby granted, free of charge, to any person obtaining */ |
| 12 | +/* a copy of this software and associated documentation files (the */ |
| 13 | +/* "Software"), to deal in the Software without restriction, including */ |
| 14 | +/* without limitation the rights to use, copy, modify, merge, publish, */ |
| 15 | +/* distribute, sublicense, and/or sell copies of the Software, and to */ |
| 16 | +/* permit persons to whom the Software is furnished to do so, subject to */ |
| 17 | +/* the following conditions: */ |
| 18 | +/* */ |
| 19 | +/* The above copyright notice and this permission notice shall be */ |
| 20 | +/* included in all copies or substantial portions of the Software. */ |
| 21 | +/* */ |
| 22 | +/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */ |
| 23 | +/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */ |
| 24 | +/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */ |
| 25 | +/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */ |
| 26 | +/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */ |
| 27 | +/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */ |
| 28 | +/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ |
| 29 | +/**************************************************************************/ |
| 30 | + |
| 31 | +#pragma once |
| 32 | + |
| 33 | +// A high speed Vector of fixed capacity. |
| 34 | +// Especially useful if you need to create an array on the stack, to |
| 35 | +// prevent dynamic allocations (especially in bottleneck code). |
| 36 | + |
| 37 | +// Choose CAPACITY such that it is enough for all elements that could be added through all branches. |
| 38 | + |
| 39 | +// Set force_trivial to true to gain a slight performance improvement on resize calls |
| 40 | +// if the default value of the type can be ignored. |
| 41 | +template <class T, uint32_t CAPACITY, bool force_trivial = false> |
| 42 | +class FixedVector { |
| 43 | + // This declaration allows us to access other FixedVector's private members. |
| 44 | + template <class T_, uint32_t CAPACITY_, bool force_trivial_> |
| 45 | + friend class FixedVector; |
| 46 | + |
| 47 | + static_assert(!force_trivial || std::is_trivially_destructible_v<T>, "force_trivial may only be true if the type is trivially destructible."); |
| 48 | + |
| 49 | + uint32_t _size = 0; |
| 50 | + alignas(T) uint8_t _data[CAPACITY * sizeof(T)]; |
| 51 | + |
| 52 | + constexpr static uint32_t DATA_PADDING = MAX(alignof(T), alignof(uint32_t)) - alignof(uint32_t); |
| 53 | + |
| 54 | +public: |
| 55 | + _FORCE_INLINE_ constexpr FixedVector() = default; |
| 56 | + constexpr FixedVector(std::initializer_list<T> p_init) { |
| 57 | + ERR_FAIL_COND(p_init.size() > CAPACITY); |
| 58 | + for (const T &element : p_init) { |
| 59 | + memnew_placement(ptr() + _size++, T(element)); |
| 60 | + } |
| 61 | + } |
| 62 | + |
| 63 | + template <uint32_t p_capacity, bool p_force_trivial = false> |
| 64 | + constexpr FixedVector(const FixedVector<T, p_capacity, p_force_trivial> &p_from) { |
| 65 | + ERR_FAIL_COND(p_from.size() > CAPACITY); |
| 66 | + if constexpr (std::is_trivially_copyable_v<T>) { |
| 67 | + // Copy size and all provided elements at once. |
| 68 | + memcpy((void *)&_size, (void *)&p_from._size, sizeof(_size) + DATA_PADDING + p_from.size() * sizeof(T)); |
| 69 | + } else { |
| 70 | + for (const T &element : p_from) { |
| 71 | + memnew_placement(ptr() + _size++, T(element)); |
| 72 | + } |
| 73 | + } |
| 74 | + } |
| 75 | + |
| 76 | + template <uint32_t p_capacity, bool p_force_trivial = false> |
| 77 | + constexpr FixedVector(FixedVector<T, p_capacity, p_force_trivial> &&p_from) { |
| 78 | + ERR_FAIL_COND(p_from.size() > CAPACITY); |
| 79 | + // Copy size and all provided elements at once. |
| 80 | + // Note: Assumes trivial relocatability. |
| 81 | + memcpy((void *)&_size, (void *)&p_from._size, sizeof(_size) + DATA_PADDING + p_from.size() * sizeof(T)); |
| 82 | + p_from._size = 0; |
| 83 | + } |
| 84 | + |
| 85 | + ~FixedVector() { |
| 86 | + if constexpr (!std::is_trivially_destructible_v<T>) { |
| 87 | + for (uint32_t i = 0; i < _size; i++) { |
| 88 | + ptr()[i].~T(); |
| 89 | + } |
| 90 | + } |
| 91 | + } |
| 92 | + |
| 93 | + _FORCE_INLINE_ constexpr T *ptr() { return (T *)(_data); } |
| 94 | + _FORCE_INLINE_ constexpr const T *ptr() const { return (const T *)(_data); } |
| 95 | + |
| 96 | + _FORCE_INLINE_ constexpr operator Span<T>() const { return Span<T>(ptr(), size()); } |
| 97 | + _FORCE_INLINE_ constexpr Span<T> span() const { return operator Span<T>(); } |
| 98 | + |
| 99 | + _FORCE_INLINE_ constexpr uint32_t size() const { return _size; } |
| 100 | + _FORCE_INLINE_ constexpr bool is_empty() const { return !_size; } |
| 101 | + _FORCE_INLINE_ constexpr bool is_full() const { return _size == CAPACITY; } |
| 102 | + _FORCE_INLINE_ constexpr uint32_t capacity() const { return CAPACITY; } |
| 103 | + |
| 104 | + _FORCE_INLINE_ constexpr void clear() { resize(0); } |
| 105 | + |
| 106 | + template <bool p_ensure_zero = false> |
| 107 | + constexpr Error resize(uint32_t p_size) { |
| 108 | + if (!force_trivial && p_size > _size) { |
| 109 | + ERR_FAIL_COND_V(p_size > CAPACITY, ERR_OUT_OF_MEMORY); |
| 110 | + memnew_arr_placement<p_ensure_zero>(ptr() + _size, p_size - _size); |
| 111 | + } else if (p_size < _size) { |
| 112 | + if constexpr (!std::is_trivially_destructible_v<T>) { |
| 113 | + for (uint32_t i = p_size; i < _size; i++) { |
| 114 | + ptr()[i].~T(); |
| 115 | + } |
| 116 | + } |
| 117 | + } |
| 118 | + |
| 119 | + _size = p_size; |
| 120 | + return OK; |
| 121 | + } |
| 122 | + |
| 123 | + constexpr void push_back(const T &p_val) { |
| 124 | + ERR_FAIL_COND(_size >= CAPACITY); |
| 125 | + memnew_placement(ptr() + _size, T(p_val)); |
| 126 | + _size++; |
| 127 | + } |
| 128 | + |
| 129 | + constexpr void pop_back() { |
| 130 | + ERR_FAIL_COND(_size == 0); |
| 131 | + _size--; |
| 132 | + ptr()[_size].~T(); |
| 133 | + } |
| 134 | + |
| 135 | + // NOTE: Subscripts sanity check the bounds to avoid undefined behavior. |
| 136 | + // This is slower than direct buffer access and can prevent autovectorization. |
| 137 | + // If the bounds are known, use ptr() subscript instead. |
| 138 | + constexpr const T &operator[](uint32_t p_index) const { |
| 139 | + CRASH_COND(p_index >= _size); |
| 140 | + return ptr()[p_index]; |
| 141 | + } |
| 142 | + |
| 143 | + constexpr T &operator[](uint32_t p_index) { |
| 144 | + CRASH_COND(p_index >= _size); |
| 145 | + return ptr()[p_index]; |
| 146 | + } |
| 147 | + |
| 148 | + _FORCE_INLINE_ constexpr T *begin() { return ptr(); } |
| 149 | + _FORCE_INLINE_ constexpr T *end() { return ptr() + _size; } |
| 150 | + |
| 151 | + _FORCE_INLINE_ constexpr const T *begin() const { return ptr(); } |
| 152 | + _FORCE_INLINE_ constexpr const T *end() const { return ptr() + _size; } |
| 153 | +}; |
0 commit comments