-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmatrix.h
More file actions
229 lines (188 loc) · 5.63 KB
/
matrix.h
File metadata and controls
229 lines (188 loc) · 5.63 KB
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
225
226
227
228
229
#pragma once
#include <complex>
#include <vector>
#include <stdexcept>
template<class T>
class Matrix {
public:
Matrix();
Matrix(size_t rows, size_t columns);
Matrix(size_t rows, size_t columns, T element);
Matrix(Matrix<T> &&m) noexcept;
Matrix(const Matrix<T> &m) = default;
~Matrix<T>() = default;
size_t rows() const;
size_t columns() const;
void setMatrix(const std::vector<std::vector<T>>& matrix);
void removeAt(size_t index);
void insert(size_t index);
void resize(size_t size);
std::vector<std::vector<T>>& getMatrix();
std::vector<T>& operator[](size_t index);
const std::vector<T>& operator[](size_t index) const;
Matrix<T>& operator=(const Matrix<T> &m);
private:
size_t _rows;
size_t _columns;
std::vector<std::vector<T>> _matrix;
};
template<class T>
Matrix<T>::Matrix() :
_rows(0),
_columns(0)
{}
template<class T>
Matrix<T>::Matrix(size_t rows, size_t columns):
_rows(rows),
_columns(columns),
_matrix(_rows, std::vector<T>(_columns))
{}
template<class T>
Matrix<T>::Matrix(size_t rows, size_t columns, T element) :
_rows(rows),
_columns(columns) {
for (size_t row = 0; row < rows; ++row) {
_matrix.push_back(std::vector<T>());
for (size_t column = 0; column < columns; ++column) {
_matrix[row].push_back(element);
}
}
}
template<class T>
Matrix<T>::Matrix(Matrix<T>&& m) noexcept :
_rows(m.rows()),
_columns(m.columns()),
_matrix(m.getMatrix()) {
m._rows = 0;
m._columns = 0;
}
template<class T>
void Matrix<T>::setMatrix(const std::vector<std::vector<T>>& matrix) {
_matrix = matrix;
_rows = matrix.size();
_rows > 0 ? _columns = matrix[0].size() : _columns = 0;
}
template<class T>
void Matrix<T>::removeAt(size_t index) {
if (index > _rows || index > _columns) {
throw std::logic_error("Не верный индекс");
}
_matrix.erase(_matrix.begin() + index);
}
template<class T>
void Matrix<T>::resize(size_t size) {
if (_rows < size) {
_matrix.reserve(static_cast<size_t>(size));
for (int i = size - _rows; i > 0; i--) {
_matrix.push_back(std::vector<T>(size, 0));
}
for (int i = 0; i < _rows; i++) {
_matrix[i].resize(size);
for (int j = 0; j < size; j++) {
_matrix[i][j] = 0;
}
}
_rows = _columns = static_cast<int>(_matrix.size());
} else if (_rows > size) {
_matrix.resize(static_cast<size_t>(size));
_rows = size;
for (int i = 0; i < _rows; i++) {
_matrix[i].resize(size);
}
_columns = size;
}
}
template<class T>
std::vector<std::vector<T>>& Matrix<T>::getMatrix() {
return _matrix;
}
template<class T>
size_t Matrix<T>::columns() const {
return _columns;
}
template<class T>
size_t Matrix<T>::rows() const {
return _rows;
}
template<class T>
std::vector<T> &Matrix<T>::operator[](size_t index) {
if (index < 0 || index > _rows) {
throw std::logic_error("Выход за границы матрицы");
}
return _matrix[index];
}
template<class T>
const std::vector<T> &Matrix<T>::operator[](size_t index) const {
if (index < 0 || index > _rows) {
throw std::logic_error("Выход за границы матрицы");
}
return _matrix[index];
}
template<class T>
Matrix<T> &Matrix<T>::operator=(const Matrix<T> &m) {
if (this != &m) {
_matrix = m._matrix;
_rows = m._rows;
_columns = m._columns;
}
return *this;
}
template<class T>
Matrix<T> operator +(const Matrix<T>& m1, const Matrix<T>& m2) {
if (m1._rows != m2._rows && m1._columns != m2._columns) {
throw std::logic_error("Матрицы разного размера");
}
Matrix<T> newM = Matrix<T>(m1._rows, m2._columns);
for (int row = 0; row < m1._rows; row++) {
for (int column = 0; column < m1._columns; column++) {
newM[row][column] = m1[row][column] + m2[row][column];
}
}
return newM;
}
template<class T>
Matrix<T> operator -(const Matrix<T>& m1, const Matrix<T>& m2) {
if (m1._rows != m2._rows && m1._columns != m2._columns) {
throw std::logic_error("Матрицы разного размера");
}
Matrix<T> newM = Matrix<T>(m1._rows, m2._columns);
for (int row = 0; row < m1._rows; row++) {
for (int column = 0; column < m1._columns; column++) {
newM[row][column] = m1[row][column] - m2[row][column];
}
}
return newM;
}
template<class T>
Matrix<T> operator *(const Matrix<T>& m1, const Matrix<T>& m2) {
if (m1._rows != m2._rows && m1._columns != m2._columns) {
throw std::logic_error("Матрицы разного размера");
}
Matrix<T> newM = Matrix<T>(m1._rows, m2._columns);
for (int row = 0; row < m1._rows; row++) {
for (int column = 0; column < m1._columns; column++) {
for (int count = 0; count < m1._columns; count++) {
newM[row][column] += m1[row][count] * m2[count][column];
}
}
}
return newM;
}
template<class T>
bool operator ==(const Matrix<T>& m1, const Matrix<T>& m2) {
if (m1._rows != m2._rows && m1._columns != m2._columns) {
return false;
}
for (int row = 0; row < m1._rows; row++) {
for (int column = 0; column < m1._columns; column++) {
if (m1[row][column] != m2[row][column]) {
return false;
}
}
}
return true;
}
template<class T>
bool operator !=(const Matrix<T>& m1, const Matrix<T>& m2) {
return !(m1 == m2);
}