#include #include #include #include template class Matrix { public: Matrix(const std::size_t& rows, const std::size_t& columns); Matrix(const Matrix& matrix); Matrix(Matrix&& matrix); ~Matrix(); const Matrix transpose(); inline std::size_t length() const; inline std::size_t length(const std::size_t& dimension) const; //get arr[row][column] inline T& operator()(const std::size_t& row, const std::size_t& column) const; const Matrix operator+(const Matrix& matrix) const; const Matrix operator-(const Matrix& matrix) const; const Matrix operator*(const Matrix& matrix) const; const Matrix operator*(const T& value) const; Matrix& operator=(const Matrix& matrix); Matrix& operator=(Matrix&& matrix); Matrix& operator+=(const Matrix& matrix); Matrix& operator-=(const Matrix& matrix); Matrix& operator*=(const Matrix& matrix); Matrix& operator*=(const T& value); private: std::size_t rows; std::size_t columns; T **arr; template friend const Matrix operator*(const T1& value, const Matrix& matrix); template friend std::ostream& operator<<(std::ostream& out, const Matrix& matrix); }; int main() { using std::cout; using std::endl; int factor = 2; srand(time(NULL)); Matrix m1(2, 4); Matrix m2(4, 2); Matrix m3(m1); for(std::size_t i = 0; i < m1.length(0); i++) { for(std::size_t j = 0; j < m1.length(1); j++) { m1(i, j) = rand()%10; m2(j, i) = rand()%10; } } try { cout << "Matrix A: " << endl << m1 << endl; cout << "Matrix B: " << endl << m2 << endl; cout << "Matrix A * B: " << endl << m1 * m2 << endl << endl; cout << "Matrix A *= B: " << endl << (m1 *= m2) << endl << endl; Matrix m4(m1 + m2); cout << "Matrix A * " << factor << ": " << endl << factor * m1 << endl; cout << "Transposed Matrix A: " << endl << m1.transpose() << endl; m1 = m2; cout << "Matrix A = B: " << endl << m1 << endl; } catch(const char *msg) { cout << msg << endl; } return 0; } template Matrix::Matrix(const std::size_t& rows, const std::size_t& columns) :rows(rows), columns(columns) { if(!rows || !columns) { throw "Rows or columns count must be greater than zero!"; } arr = new T*[rows]; for(std::size_t i = 0; i < rows; i++) { arr[i] = new T[columns]{0}; } } template Matrix::Matrix(const Matrix& matrix) :rows(matrix.rows), columns(matrix.columns) { arr = new T*[rows]; for(std::size_t i = 0; i < rows; i++) { arr[i] = new T[columns]; for(std::size_t j = 0; j < columns; j++) { arr[i][j] = matrix.arr[i][j]; } } } template Matrix::Matrix(Matrix&& matrix) :rows(matrix.rows), columns(matrix.columns) { for(std::size_t i = 0; i < rows; i++) { delete[] arr[i]; } delete[] arr; arr = matrix.arr; matrix.arr = nullptr; } template Matrix::~Matrix() { for(std::size_t i = 0; i < rows; i++) { delete[] arr[i]; } delete[] arr; } template const Matrix Matrix::transpose() { Matrix tmp(columns, rows); for(std::size_t i = 0; i < rows; i++) { for(std::size_t j = 0; j < columns; j++) { tmp.arr[j][i] = arr[i][j]; } } return tmp; } template inline std::size_t Matrix::length() const { return rows * columns; } template inline std::size_t Matrix::length(const std::size_t& dimension) const { if(dimension == 0) { return rows; } else if(dimension == 1) { return columns; } throw "Dimension doesn't exist!"; } template inline T& Matrix::operator()(const std::size_t& row, const std::size_t& column) const { return arr[row][column]; } template const Matrix Matrix::operator+(const Matrix& matrix) const { if((rows != matrix.rows) || (columns != matrix.columns)) { throw "The sizes of the matrices don't match"; } Matrix tmp(rows, columns); for(std::size_t i = 0; i < rows; i++) { for(std::size_t j = 0; j < columns; j++) { tmp.arr[i][j] = arr[i][j] + matrix.arr[i][j]; } } return tmp; } template const Matrix Matrix::operator-(const Matrix& matrix) const { if((rows != matrix.rows) || (columns != matrix.columns)) { throw "The sizes of the matrices don't match"; } Matrix tmp(rows, columns); for(std::size_t i = 0; i < rows; i++) { for(std::size_t j = 0; j < columns; j++) { tmp.arr[i][j] = arr[i][j] - matrix.arr[i][j]; } } return tmp; } template const Matrix Matrix::operator*(const Matrix& matrix) const { if(columns != matrix.rows) { throw "Wrong size for matrix multilplication"; } Matrix tmp(rows, matrix.columns); for(std::size_t i = 0 ; i < rows; i++) { for(std::size_t j = 0 ; j < columns; j++) { tmp.arr[i][j] = 0; for(std::size_t k = 0 ; k < columns; k++) { tmp.arr[i][j] += arr[i][k] * matrix.arr[k][j]; } } } return tmp; } template const Matrix Matrix::operator*(const T& value) const { Matrix tmp(*this); for(std::size_t i = 0; i < rows; i++) { for(std::size_t j = 0; j < columns; j++) { tmp.arr[i][j] *= value; } } return tmp; } template Matrix& Matrix::operator=(const Matrix& matrix) { if(this == &matrix) { return *this; } for(std::size_t i = 0; i < rows; i++) { delete[] arr[i]; } delete[] arr; rows = matrix.rows; columns = matrix.columns; arr = new T*[rows]; for(std::size_t i = 0; i < rows; i++) { arr[i] = new T[columns]; memmove(arr[i], matrix.arr[i], sizeof(T) * columns); } return *this; } template Matrix& Matrix::operator=(Matrix&& matrix) { if(matrix = *this) { return *this; } for(std::size_t i = 0; i < rows; i++) { delete[] arr[i]; } delete[] arr; rows = matrix.rows; columns = matrix.columns; arr = matrix.arr; matrix.arr = nullptr; return *this; } template Matrix& Matrix::operator+=(const Matrix& matrix) { *this = *this + matrix; return *this; } template Matrix& Matrix::operator-=(const Matrix& matrix) { *this = *this - matrix; return *this; } template Matrix& Matrix::operator*=(const Matrix& matrix) { *this = *this * matrix; return *this; } template Matrix& Matrix::operator*=(const T& value) { *this = *this * value; return *this; } template const Matrix operator*(const T1& value, const Matrix& matrix) { return matrix * value; } template std::ostream& operator<<(std::ostream& out, const Matrix& matrix) { for(std::size_t i = 0; i < matrix.rows; i++) { for(std::size_t j = 0; j < matrix.columns; j++) { out << matrix.arr[i][j] << " "; } out << std::endl; } return out; }

Matrix class template