iterative-solver 0.0
Span.h
1#ifndef LINEARALGEBRA_SRC_MOLPRO_LINALG_ARRAY_SPAN_H
2#define LINEARALGEBRA_SRC_MOLPRO_LINALG_ARRAY_SPAN_H
3#include <stddef.h>
4#include <type_traits>
5#include <utility>
6
7#if defined(USE_STD_SPAN) && __cplusplus >= 202002L
8#include <span>
9#endif
10
11namespace molpro::linalg::array {
12
13#if defined(USE_STD_SPAN) && __cplusplus >= 202002L
15template <typename T>
16using Span = std::span<T>;
17
18#endif
19
20#if !defined(USE_STD_SPAN) || __cplusplus < 202002L
21inline
22#endif
23 namespace span {
24
30template <typename T = double>
31class Span {
32public:
33 using element_type = T;
34 using value_type = std::remove_cv_t<T>;
35 using reference = T&;
36 using const_reference = const T&;
37 using size_type = size_t;
38 using difference_type = std::ptrdiff_t;
39 using iterator = T*;
40 using const_iterator = T const*;
41
42 Span() = default;
43 ~Span() = default;
45 Span(const Span& source) = default;
46 Span(Span<T>&& source) noexcept : m_buffer{source.m_buffer}, m_size{source.m_size} {
47 Span<T> t{};
48 swap(source, t);
49 }
50 Span& operator=(const Span& source) = default;
51 Span& operator=(Span&& source) noexcept {
52 Span<T> t{std::move(source)};
53 swap(*this, t);
54 return *this;
55 }
56 reference operator[](size_type i) { return *(m_buffer + i); }
57 const_reference operator[](size_type i) const { return *(m_buffer + i); }
58
60 friend void swap(Span<T>& x, Span<T>& y) {
61 using std::swap;
63 swap(x.m_size, y.m_size);
64 }
65
66 iterator data() { return m_buffer; }
67 const_iterator data() const { return m_buffer; }
68
69 iterator begin() { return m_buffer; }
70 const_iterator begin() const { return m_buffer; }
71 const_iterator cbegin() const { return m_buffer; }
72
73 iterator end() { return m_buffer + m_size; }
74 const_iterator end() const { return m_buffer + m_size; }
75 const_iterator cend() const { return m_buffer + m_size; }
76
77 size_type size() const { return m_size; }
78
79 bool empty() const { return m_size == 0; }
80
81protected:
82 iterator m_buffer = nullptr;
84};
85
86template <typename T>
87auto begin(Span<T>& x) {
88 return x.begin();
89}
90
91template <typename T>
92auto begin(const Span<T>& x) {
93 return x.begin();
94}
95
96template <typename T>
97auto end(Span<T>& x) {
98 return x.end();
99}
100
101template <typename T>
102auto end(const Span<T>& x) {
103 return x.end();
104}
105} // namespace span
106} // namespace molpro::linalg::array
107
108#endif // LINEARALGEBRA_SRC_MOLPRO_LINALG_ARRAY_SPAN_H
Non-owning container taking a pointer to the data buffer and its size and exposing routines for itera...
Definition: Span.h:31
std::remove_cv_t< T > value_type
Definition: Span.h:34
iterator m_buffer
Definition: Span.h:82
Span(T *data, size_type size)
Definition: Span.h:44
T const * const_iterator
Definition: Span.h:40
Span(Span< T > &&source) noexcept
Definition: Span.h:46
T & reference
Definition: Span.h:35
const_iterator cbegin() const
Definition: Span.h:71
const_reference operator[](size_type i) const
Definition: Span.h:57
reference operator[](size_type i)
Definition: Span.h:56
friend void swap(Span< T > &x, Span< T > &y)
Swap content of two Spans.
Definition: Span.h:60
size_type m_size
Definition: Span.h:83
const_iterator end() const
Definition: Span.h:74
const_iterator cend() const
Definition: Span.h:75
const T & const_reference
Definition: Span.h:36
T element_type
Definition: Span.h:33
Span & operator=(Span &&source) noexcept
Definition: Span.h:51
size_t size_type
Definition: Span.h:37
const_iterator begin() const
Definition: Span.h:70
const_iterator data() const
Definition: Span.h:67
bool empty() const
Definition: Span.h:79
iterator begin()
Definition: Span.h:69
size_type size() const
Definition: Span.h:77
iterator end()
Definition: Span.h:73
Span(const Span &source)=default
Span & operator=(const Span &source)=default
iterator data()
Definition: Span.h:66
T * iterator
Definition: Span.h:39
std::ptrdiff_t difference_type
Definition: Span.h:38
auto begin(Span< T > &x)
Definition: Span.h:87
auto end(Span< T > &x)
Definition: Span.h:97
Definition: ArrayHandler.h:18