summaryrefslogtreecommitdiff
path: root/src/meta.hh
diff options
context:
space:
mode:
authorMaxime Coste <mawww@kakoune.org>2017-11-12 13:01:18 +0800
committerMaxime Coste <mawww@kakoune.org>2017-11-12 13:01:18 +0800
commit00e06302722a5b15a292b10d165dff640a3d3ce0 (patch)
treea05cc739b011f5d2d697671b0a9e11662e8adaaa /src/meta.hh
parent5cfccad39cd4b215736f8560a55404f78bae4b7d (diff)
Move Array and ConstexprVector to a constexpr_utils.hh header
Diffstat (limited to 'src/meta.hh')
-rw-r--r--src/meta.hh70
1 files changed, 0 insertions, 70 deletions
diff --git a/src/meta.hh b/src/meta.hh
index ce29a758..280f2b93 100644
--- a/src/meta.hh
+++ b/src/meta.hh
@@ -1,10 +1,6 @@
#ifndef meta_hh_INCLUDED
#define meta_hh_INCLUDED
-#include <utility>
-#include <initializer_list>
-#include <stddef.h>
-
namespace Kakoune
{
inline namespace Meta
@@ -14,72 +10,6 @@ struct AnyType{};
template<typename T> struct Type : AnyType {};
}
-
-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; }
-
- T m_data[N];
-};
-
-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>());
-}
-
-template<typename T, size_t capacity>
-struct ConstexprVector
-{
- using iterator = T*;
- using const_iterator = const T*;
-
- constexpr ConstexprVector() : m_size{0} {}
- constexpr ConstexprVector(std::initializer_list<T> items)
- : m_size{items.size()}
- {
- T* ptr = m_data;
- for (auto& item : items)
- *ptr++ = std::move(item);
- }
-
- constexpr bool empty() const { return m_size == 0; }
- constexpr size_t size() const { return m_size; }
-
- constexpr void resize(size_t n, const T& val = {})
- {
- if (n >= capacity)
- throw "capacity exceeded";
- for (int i = m_size; i < n; ++i)
- m_data[i] = val;
- m_size = n;
- kak_assert(this->size() == m_size); // check for https://gcc.gnu.org/bugzilla/show_bug.cgi?id=79520
- }
-
- constexpr T& operator[](size_t i) { return m_data[i]; }
- constexpr const T& operator[](size_t i) const { return m_data[i]; }
-
- constexpr iterator begin() { return m_data; }
- constexpr iterator end() { return m_data + m_size; }
-
- constexpr const_iterator begin() const { return m_data; }
- constexpr const_iterator end() const { return m_data + m_size; }
-
- size_t m_size;
- T m_data[capacity] = {};
-};
-
}
#endif // meta_hh_INCLUDED