array.hh (1257B)
1 #ifndef array_hh_INCLUDED 2 #define array_hh_INCLUDED 3 4 #include <utility> 5 #include <stddef.h> 6 7 #include "array_view.hh" 8 9 namespace Kakoune 10 { 11 12 template<typename T, size_t N> 13 struct Array 14 { 15 constexpr size_t size() const { return N; } 16 constexpr const T& operator[](int i) const { return m_data[i]; } 17 constexpr const T* begin() const { return m_data; } 18 constexpr const T* end() const { return m_data+N; } 19 20 constexpr T& operator[](int i) { return m_data[i]; } 21 constexpr T* begin() { return m_data; } 22 constexpr T* end() { return m_data+N; } 23 24 constexpr operator ArrayView<T>() { return {m_data, N}; } 25 constexpr operator ConstArrayView<T>() const { return {m_data, N}; } 26 27 T m_data[N]; 28 }; 29 30 template<typename T, typename... U> requires (std::is_same_v<T, U> and ...) 31 Array(T, U...) -> Array<T, 1 + sizeof...(U)>; 32 33 template<typename T, size_t N, size_t... Indices> 34 constexpr Array<T, N> make_array(const T (&data)[N], std::index_sequence<Indices...>) 35 { 36 static_assert(sizeof...(Indices) == N, "size mismatch"); 37 return {{data[Indices]...}}; 38 } 39 40 template<typename T, size_t N> 41 constexpr Array<T, N> make_array(const T (&data)[N]) 42 { 43 return make_array(data, std::make_index_sequence<N>()); 44 } 45 46 } 47 48 #endif // array_hh_INCLUDED