/**************************************************************************/ /* span.h */ /**************************************************************************/ /* This file is part of: */ /* GODOT ENGINE */ /* https://godotengine.org */ /**************************************************************************/ /* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */ /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */ /* */ /* Permission is hereby granted, free of charge, to any person obtaining */ /* a copy of this software and associated documentation files (the */ /* "Software"), to deal in the Software without restriction, including */ /* without limitation the rights to use, copy, modify, merge, publish, */ /* distribute, sublicense, and/or sell copies of the Software, and to */ /* permit persons to whom the Software is furnished to do so, subject to */ /* the following conditions: */ /* */ /* The above copyright notice and this permission notice shall be */ /* included in all copies or substantial portions of the Software. */ /* */ /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */ /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */ /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */ /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */ /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */ /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */ /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ /**************************************************************************/ #pragma once #include "core/typedefs.h" // Equivalent of std::span. // Represents a view into a contiguous memory space. // DISCLAIMER: This data type does not own the underlying buffer. DO NOT STORE IT. // Additionally, for the lifetime of the Span, do not resize the buffer, and do not insert or remove elements from it. // Failure to respect this may lead to crashes or undefined behavior. template class Span { const T *_ptr = nullptr; uint64_t _len = 0; public: static constexpr bool is_string = std::disjunction_v< std::is_same, std::is_same, std::is_same, std::is_same>; _FORCE_INLINE_ constexpr Span() = default; _FORCE_INLINE_ constexpr Span(const T *p_ptr, uint64_t p_len) : _ptr(p_ptr), _len(p_len) {} // Allows creating Span directly from C arrays and string literals. template _FORCE_INLINE_ constexpr Span(const T (&p_array)[N]) : _ptr(p_array), _len(N) { if constexpr (is_string) { // Cut off the \0 terminator implicitly added to string literals. if (N > 0 && p_array[N - 1] == '\0') { _len--; } } } _FORCE_INLINE_ constexpr uint64_t size() const { return _len; } _FORCE_INLINE_ constexpr bool is_empty() const { return _len == 0; } _FORCE_INLINE_ constexpr const T *ptr() const { return _ptr; } // NOTE: Span subscripts sanity check the bounds to avoid undefined behavior. // This is slower than direct buffer access and can prevent autovectorization. // If the bounds are known, use ptr() subscript instead. _FORCE_INLINE_ constexpr const T &operator[](uint64_t p_idx) const { CRASH_COND(p_idx >= _len); return _ptr[p_idx]; } _FORCE_INLINE_ constexpr const T *begin() const { return _ptr; } _FORCE_INLINE_ constexpr const T *end() const { return _ptr + _len; } // Algorithms. constexpr int64_t find(const T &p_val, uint64_t p_from = 0) const; constexpr int64_t rfind(const T &p_val, uint64_t p_from) const; _FORCE_INLINE_ constexpr int64_t rfind(const T &p_val) const { return rfind(p_val, size() - 1); } constexpr uint64_t count(const T &p_val) const; }; template constexpr int64_t Span::find(const T &p_val, uint64_t p_from) const { for (uint64_t i = p_from; i < size(); i++) { if (ptr()[i] == p_val) { return i; } } return -1; } template constexpr int64_t Span::rfind(const T &p_val, uint64_t p_from) const { for (int64_t i = p_from; i >= 0; i--) { if (ptr()[i] == p_val) { return i; } } return -1; } template constexpr uint64_t Span::count(const T &p_val) const { uint64_t amount = 0; for (uint64_t i = 0; i < size(); i++) { if (ptr()[i] == p_val) { amount++; } } return amount; } // Zero-constructing Span initializes _ptr and _len to 0 (and thus empty). template struct is_zero_constructible> : std::true_type {};