diff options
| author | Maxime Coste <mawww@kakoune.org> | 2024-08-15 11:41:35 +1000 |
|---|---|---|
| committer | Maxime Coste <mawww@kakoune.org> | 2024-08-15 12:58:25 +1000 |
| commit | 65ac5d42c9209c4b89c590c93cfa8d985e66b168 (patch) | |
| tree | 2cf07a812c46e81c71204236b8a32c495132f62e /src/array.hh | |
| parent | b804693630f61be757413e6e5a700995be1b164b (diff) | |
Remove unused ConstexprVector and rename constexpr_utils.hh to array.hh
Diffstat (limited to 'src/array.hh')
| -rw-r--r-- | src/array.hh | 48 |
1 files changed, 48 insertions, 0 deletions
diff --git a/src/array.hh b/src/array.hh new file mode 100644 index 00000000..ec8b098b --- /dev/null +++ b/src/array.hh @@ -0,0 +1,48 @@ +#ifndef array_hh_INCLUDED +#define array_hh_INCLUDED + +#include <utility> +#include <stddef.h> + +#include "array_view.hh" + +namespace Kakoune +{ + +template<typename T, size_t N> +struct Array +{ + constexpr size_t size() const { return N; } + constexpr const T& operator[](int i) const { return m_data[i]; } + constexpr const T* begin() const { return m_data; } + constexpr const T* end() const { return m_data+N; } + + constexpr T& operator[](int i) { return m_data[i]; } + constexpr T* begin() { return m_data; } + constexpr T* end() { return m_data+N; } + + constexpr operator ArrayView<T>() { return {m_data, N}; } + constexpr operator ConstArrayView<T>() const { return {m_data, N}; } + + T m_data[N]; +}; + +template<typename T, typename... U> requires (std::is_same_v<T, U> and ...) +Array(T, U...) -> Array<T, 1 + sizeof...(U)>; + +template<typename T, size_t N, size_t... Indices> +constexpr Array<T, N> make_array(const T (&data)[N], std::index_sequence<Indices...>) +{ + static_assert(sizeof...(Indices) == N, "size mismatch"); + return {{data[Indices]...}}; +} + +template<typename T, size_t N> +constexpr Array<T, N> make_array(const T (&data)[N]) +{ + return make_array(data, std::make_index_sequence<N>()); +} + +} + +#endif // array_hh_INCLUDED |
