summaryrefslogtreecommitdiff
path: root/src/array_view.hh
diff options
context:
space:
mode:
authorMaxime Coste <frrrwww@gmail.com>2015-01-06 13:40:56 +0000
committerMaxime Coste <frrrwww@gmail.com>2015-01-06 13:43:37 +0000
commit295a97f2a64b0b8d548ed7948d6c278ba04a9c67 (patch)
tree03ad360ec44370862c4b92604ed1b17b6d43ae6d /src/array_view.hh
parent8e92e0eebcf38d539fe055e455b8d628f5caf9f3 (diff)
Rename memoryview to ArrayView
Diffstat (limited to 'src/array_view.hh')
-rw-r--r--src/array_view.hh68
1 files changed, 68 insertions, 0 deletions
diff --git a/src/array_view.hh b/src/array_view.hh
new file mode 100644
index 00000000..6a807c2c
--- /dev/null
+++ b/src/array_view.hh
@@ -0,0 +1,68 @@
+#ifndef array_view_hh_INCLUDED
+#define array_view_hh_INCLUDED
+
+#include <vector>
+#include <initializer_list>
+
+namespace Kakoune
+{
+
+// An ArrayView provides a typed, non owning view of a memory
+// range with an interface similar to std::vector.
+template<typename T>
+class ArrayView
+{
+public:
+ using size_t = std::size_t;
+
+ ArrayView()
+ : m_pointer(nullptr), m_size(0) {}
+
+ ArrayView(const T& oneval)
+ : m_pointer(&oneval), m_size(1) {}
+
+ ArrayView(const T* pointer, size_t size)
+ : m_pointer(pointer), m_size(size) {}
+
+ ArrayView(const T* begin, const T* end)
+ : m_pointer(begin), m_size(end - begin) {}
+
+ template<typename Iterator>
+ ArrayView(const Iterator& begin, const Iterator& end)
+ : m_pointer(&(*begin)), m_size(end - begin) {}
+
+ ArrayView(const std::vector<T>& v)
+ : m_pointer(&v[0]), m_size(v.size()) {}
+
+ ArrayView(const std::initializer_list<T>& v)
+ : m_pointer(v.begin()), m_size(v.size()) {}
+
+ const T* pointer() const { return m_pointer; }
+ size_t size() const { return m_size; }
+ const T& operator[](size_t n) const { return *(m_pointer + n); }
+
+ const T* begin() const { return m_pointer; }
+ const T* end() const { return m_pointer+m_size; }
+
+ using reverse_iterator = std::reverse_iterator<const T*>;
+ reverse_iterator rbegin() const { return reverse_iterator(m_pointer+m_size); }
+ reverse_iterator rend() const { return reverse_iterator(m_pointer); }
+
+ const T& front() const { return *m_pointer; }
+ const T& back() const { return *(m_pointer + m_size - 1); }
+
+ bool empty() const { return m_size == 0; }
+
+ ArrayView subrange(size_t first, size_t count) const
+ {
+ return ArrayView(m_pointer + first, count);
+ }
+
+private:
+ const T* m_pointer;
+ size_t m_size;
+};
+
+}
+
+#endif // array_view_hh_INCLUDED