summaryrefslogtreecommitdiff
path: root/a5/matrix.h
blob: 6d880e201e01757d66bb9e9a5e26eee2bc438020 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
// -*- c++ -*-
#pragma once

#include <utility>
#include <valarray>
#include <stdexcept>
#include <concepts>

template<typename T1, typename T2>
concept supports_modulo =
	requires(T1 t1, T2 t2)
	{
		t1 % t2;
	};

template<typename T>
concept supports_matrix =
	requires(T a, T b, int i)
	{
		a * b;
		a / b;
		a + b;
		a - b;

		a * i;
		a / i;
		a + i;
		a - i;

		a *= b;
		a /= b;
		a += b;
		a -= b;

		a *= i;
		a /= i;
		a += i;
		a -= i;

		a = b;
		a = {};
	};


template<typename T, std::size_t N, std::size_t M>
	requires supports_matrix<T>
class Matrix
{
public:
	Matrix()
		: data(T{}, N * M)
	{
	}

	Matrix(Matrix<T, N, M>&& other)
	{
		*this = std::move(other);
	}

	Matrix(const Matrix<T, N, M>& other)
	{
		*this = other;
	}

	Matrix& operator=(Matrix<T, N, M>&& other)
	{
		data = std::move(other.data);
		return *this;
	}

	Matrix& operator=(const Matrix<T, N, M>& other)
	{
		data = other.data;
		return *this;
	}

	T& m(std::size_t x, std::size_t y)
	{
		if(x >= N) throw std::out_of_range("Subscript x out of range.");
		if(y >= M) throw std::out_of_range("Subscript y out of range.");
		return data[x + y * N];
	}

	const T& m(std::size_t x, std::size_t y) const
	{
		if(x >= N) throw std::out_of_range("Subscript x out of range.");
		if(y >= M) throw std::out_of_range("Subscript y out of range.");
		return data[x + y * N];
	}

	Matrix<T, N, M> operator+(const Matrix<T, N, M>& other) const
	{
		Matrix m(*this);
		m.data += other.data;
		return m;
	}

	Matrix<T, N, M> operator+(int val)
	{
		Matrix<T, N, M> m(*this);
		for(auto& d : m.data) d += val;
		return m;
	}

	Matrix<T, N, M> operator-(const Matrix<T, N, M>& other) const
	{
		Matrix<T, N, M> m(*this);
		m.data -= other.data;
		return m;
	}

	Matrix <T, N, M> operator-(int val)
	{
		Matrix<T, N, M> m(*this);
		for(auto& d : m.data) d -= val;
		return m;
	}

	Matrix<T, N, M> operator%(const Matrix<T, N, M>& other) const
		requires(supports_modulo<T,T>)
	{
		Matrix<T, N, M> m(*this);
		m.data %= other.data;
		return m;
	}

	Matrix<T, N, M> operator%(int val)
		requires(supports_modulo<T,int>)
	{
		Matrix m(*this);
		for(auto& d : m.data) d %= val;
		return m;
	}

	template<std::size_t R>
	Matrix<T, N, R> operator*(const Matrix<T, M, R>& other) const
	{
		Matrix<T, N, R> out;
		for(std::size_t i = 0; i < N; ++i)
		{
			for(std::size_t j = 0; j < R; ++j)
			{
				out.m(i,j) = {};
				for(std::size_t k = 0; k < M; ++k)
				{
					out.m(i,j) += m(i,k) * other.m(k,j);
				}
			}
		}

		return out;
	}

	Matrix<T, N, M> operator*(int val)
	{
		Matrix<T, N, M> m(*this);
		for(auto& d : m.data) d *= val;
		return m;
	}

	template<std::size_t R>
	Matrix<T, N, R> operator/(const Matrix<T, M, R>& other) const
	{
		Matrix<T, N, R> out;
		for(std::size_t i = 0; i < N; ++i)
		{
			for(std::size_t j = 0; j < R; ++j)
			{
				out.m(i,j) = {};
				for(std::size_t k = 0; k < M; ++k)
				{
					out.m(i,j) += m(i,k) / other.m(k,j);
				}
			}
		}

		return out;
	}

	Matrix<T, N, M> operator/(int val) const
	{
		Matrix<T, N, M> m(*this);
		for(auto& d : m.data) d /= val;
		return m;
	}

	struct pos_t
	{
		std::size_t x;
		std::size_t y;
	};

	void Move(pos_t from, pos_t to)
	{
		m(to.x, to.x) = m(from.x, from.x);
		m(from.x, from.y) = {};
	}

	std::vector<T> Row(std::size_t n) const
	{
		if(n >= M) throw std::out_of_range("Subscript out of range.");
		std::vector<T> out;
		for(std::size_t x = 0; x < N; ++x)
		{
			out.push_back(m(x, n));
		}
		return out;
	}

	std::vector<T> Column(std::size_t n) const
	{
		if(n >= N) throw std::out_of_range("Subscript out of range.");
		std::vector<T> out;
		for(std::size_t y = 0; y < M; ++y)
		{
			out.push_back(m(n, y));
		}
		return out;
	}

private:
	// Invariant; at all times data contains w * h initialized data members
	std::valarray<T> data; // default initialized to empty
};