blob: 5d5006a144f1c2da1777df1d8a2a1f29026174d3 (
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
|
/*
* Copyright (c) 2020, the SerenityOS developers.
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#pragma once
#include <AK/Types.h>
#include <initializer_list>
namespace Gfx {
template<size_t N, typename T>
class Matrix {
public:
static constexpr size_t Size = N;
Matrix() = default;
Matrix(std::initializer_list<T> elements)
{
VERIFY(elements.size() == N * N);
size_t i = 0;
for (auto& element : elements) {
m_elements[i / N][i % N] = element;
++i;
}
}
template<typename... Args>
Matrix(Args... args)
: Matrix({ (T)args... })
{
}
Matrix(const Matrix& other)
{
__builtin_memcpy(m_elements, other.elements(), sizeof(T) * N * N);
}
auto elements() const { return m_elements; }
auto elements() { return m_elements; }
Matrix operator*(const Matrix& other) const
{
Matrix product;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
auto& element = product.m_elements[i][j];
if constexpr (N == 4) {
element = m_elements[0][j] * other.m_elements[i][0]
+ m_elements[1][j] * other.m_elements[i][1]
+ m_elements[2][j] * other.m_elements[i][2]
+ m_elements[3][j] * other.m_elements[i][3];
} else if constexpr (N == 3) {
element = m_elements[0][j] * other.m_elements[i][0]
+ m_elements[1][j] * other.m_elements[i][1]
+ m_elements[2][j] * other.m_elements[i][2];
} else if constexpr (N == 2) {
element = m_elements[0][j] * other.m_elements[i][0]
+ m_elements[1][j] * other.m_elements[i][1];
} else if constexpr (N == 1) {
element = m_elements[0][j] * other.m_elements[i][0];
} else {
T value {};
for (size_t k = 0; k < N; ++k)
value += m_elements[k][j] * other.m_elements[i][k];
element = value;
}
}
}
return product;
}
private:
T m_elements[N][N];
};
}
using Gfx::Matrix;
|
