183 lines
3.8 KiB
C++
183 lines
3.8 KiB
C++
/*
|
||
* @Author: iR
|
||
* @Date: 2022-03-11 16:44:46
|
||
* @LastEditors: iR
|
||
* @LastEditTime: 2022-03-12 12:30:44
|
||
* @FilePath: \Code\inc\matrix.hpp
|
||
* @Description:
|
||
*
|
||
* Copyright (c) 2022 by iR, All Rights Reserved.
|
||
*/
|
||
#ifndef _MATRIX_HPP_
|
||
#define _MATRIX_HPP_
|
||
|
||
#include <iostream>
|
||
#include <stdio.h>
|
||
|
||
#include "../inc/vector.hpp"
|
||
|
||
template <class T>
|
||
class Matrix
|
||
{
|
||
private:
|
||
int _height;
|
||
int _width;
|
||
Vector<T> *_mat;
|
||
|
||
protected:
|
||
public:
|
||
/**
|
||
* @description: 极度缺省初始化, 大小为2*2, 初值为0
|
||
* @param {int} w
|
||
* @param {int} h
|
||
*/
|
||
Matrix();
|
||
/**
|
||
* @description: 缺省初始化，初值为0
|
||
* @param {int} w
|
||
* @param {int} h
|
||
*/
|
||
Matrix(int w, int h);
|
||
|
||
/**
|
||
* @description: 以相同值初始化矩阵元素
|
||
* @param {int} w
|
||
* @param {int} h
|
||
* @param {T} init_value
|
||
*/
|
||
Matrix(int w, int h, T init_value);
|
||
|
||
/**
|
||
* @description: 以顺序访问数组的值初始化矩阵元素
|
||
* @note: 必须给出正确的数组,因为在函数内无法判定数组是否正确
|
||
* @param {int} w
|
||
* @param {int} h
|
||
* @param {const T} elements[]
|
||
*/
|
||
Matrix(int w, int h, const T elements[]);
|
||
|
||
/**
|
||
* @description: 以另一个矩阵初始化当前矩阵的元素，实际是元素拷贝
|
||
* @param {Matrix} &another
|
||
*/
|
||
Matrix(const Matrix &another);
|
||
|
||
/**
|
||
* @description: 只读访问内容
|
||
* @param {int} w
|
||
* @param {int} h
|
||
* @return {*}
|
||
*/
|
||
const T get(int w, int h) const;
|
||
|
||
/**
|
||
* @description:运算符重载
|
||
*/
|
||
const T operator[](int i) const { return _mat->get(i); }
|
||
|
||
/**
|
||
* @description:运算符重载
|
||
*/
|
||
T operator=(const Matrix &b);
|
||
|
||
/**
|
||
* @description: 可读可写访问
|
||
* @param {int} w
|
||
* @param {int} h
|
||
* @return {*}
|
||
*/
|
||
T &at(int w, int h) { return _mat[h * _width + w]; }
|
||
|
||
const int getWidth() const { return _width; }
|
||
const int getHeight() const { return _height; }
|
||
};
|
||
|
||
template <class T>
|
||
Matrix<T>::Matrix()
|
||
{
|
||
_width = 2;
|
||
_height = 2;
|
||
_mat = new Vector<T>(2 * 2, 0);
|
||
}
|
||
|
||
template <class T>
|
||
Matrix<T>::Matrix(int w, int h)
|
||
{
|
||
_width = w;
|
||
_height = h;
|
||
_mat = new Vector<T>(w * h, 0);
|
||
}
|
||
|
||
template <class T>
|
||
Matrix<T>::Matrix(int w, int h, T init_value)
|
||
{
|
||
_width = w;
|
||
_height = h;
|
||
_mat = new Vector<T>(w * h, init_value);
|
||
}
|
||
|
||
template <class T>
|
||
Matrix<T>::Matrix(int w, int h, const T elements[])
|
||
{
|
||
int size = w * h;
|
||
try
|
||
{
|
||
|
||
// if (w * h > size)
|
||
// throw "Error: The number of array elements is less than the matrix elements.\n";
|
||
// if (w * h < size)
|
||
// throw "Error: The number of array elements is greater than the matrix elements.\n";
|
||
|
||
_width = w;
|
||
_height = h;
|
||
_mat = new Vector<T>;
|
||
for (int i = 0; i < size; i++)
|
||
_mat->put(i, elements[i]);
|
||
}
|
||
catch (const char *msg)
|
||
{
|
||
std::cout << msg << "SIZE:" << size << std::endl;
|
||
;
|
||
}
|
||
}
|
||
template <class T>
|
||
Matrix<T>::Matrix(const Matrix &another)
|
||
{
|
||
try
|
||
{
|
||
_width = another.getWidth();
|
||
_height = another.getHeight();
|
||
_mat = new Vector<T>;
|
||
for (int i = 0; i < _width * _height; i++)
|
||
_mat->put(i, another[i]);
|
||
}
|
||
catch (const char *msg)
|
||
{
|
||
std::cout << msg;
|
||
}
|
||
}
|
||
|
||
template <class T>
|
||
T Matrix<T>::operator=(const Matrix &another)
|
||
{
|
||
try
|
||
{
|
||
_width = another.getWidth();
|
||
_height = another.getHeight();
|
||
_mat = new Vector<T>;
|
||
for (int i = 0; i < _width * _height; i++)
|
||
_mat->put(i, another[i]);
|
||
}
|
||
catch (const char *msg)
|
||
{
|
||
std::cout << msg;
|
||
}
|
||
}
|
||
|
||
template <class T>
|
||
const T Matrix<T>::get(int w, int h) const
|
||
{
|
||
return _mat[h * _width + w];
|
||
}
|
||
|
||
#endif |