mirror of https://github.com/xfarrow/lasd.git
123 lines
3.0 KiB
C++
Executable File
123 lines
3.0 KiB
C++
Executable File
|
|
namespace lasd {
|
|
|
|
template <typename Data>
|
|
MatrixVec<Data>::MatrixVec(ulong r, ulong c){
|
|
rows = r;
|
|
columns = c;
|
|
size = r*c;
|
|
Elements = new Data[size]{};
|
|
}
|
|
|
|
template <typename Data>
|
|
MatrixVec<Data>::MatrixVec(const MatrixVec& toCopy){
|
|
rows = toCopy.rows;
|
|
columns = toCopy.columns;
|
|
size = toCopy.size;
|
|
Elements = new Data[size]{};
|
|
for(ulong i=0 ; i<size ; ++i){
|
|
Elements[i] = toCopy.Elements[i];
|
|
}
|
|
}
|
|
|
|
template <typename Data>
|
|
MatrixVec<Data>::MatrixVec(MatrixVec<Data>&& toMove) noexcept{
|
|
std::swap(rows, toMove.rows);
|
|
std::swap(columns, toMove.columns);
|
|
std::swap(size, toMove.size);
|
|
std::swap(Elements, toMove.Elements);
|
|
}
|
|
|
|
template <typename Data>
|
|
MatrixVec<Data>::~MatrixVec(){
|
|
Clear();
|
|
}
|
|
|
|
template <typename Data>
|
|
MatrixVec<Data>& MatrixVec<Data>::operator=(const MatrixVec& toCopy){
|
|
Clear();
|
|
rows = toCopy.rows;
|
|
columns = toCopy.columns;
|
|
size = toCopy.size;
|
|
Elements = new Data[size]{};
|
|
for(ulong i=0 ; i<size ; ++i){
|
|
Elements[i] = toCopy.Elements[i];
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
template <typename Data>
|
|
MatrixVec<Data>& MatrixVec<Data>::operator=(MatrixVec&& toMove) noexcept{
|
|
std::swap(rows, toMove.rows);
|
|
std::swap(columns, toMove.columns);
|
|
std::swap(size, toMove.size);
|
|
std::swap(Elements, toMove.Elements);
|
|
return *this;
|
|
}
|
|
|
|
template <typename Data>
|
|
bool MatrixVec<Data>::operator==(const MatrixVec& toCompare) const noexcept{
|
|
if(rows == toCompare.rows && columns == toCompare.columns){
|
|
return Vector<Data>::operator==(toCompare);
|
|
}else{
|
|
return false;
|
|
}
|
|
}
|
|
|
|
template <typename Data>
|
|
bool MatrixVec<Data>::operator!=(const MatrixVec& toCompare) const noexcept{
|
|
return !(*this == toCompare);
|
|
}
|
|
|
|
template <typename Data>
|
|
void MatrixVec<Data>::RowResize(const ulong& new_row_dim){
|
|
if(new_row_dim != rows){
|
|
Vector<Data>::Resize(new_row_dim * columns);
|
|
rows = new_row_dim;
|
|
size = new_row_dim * columns;
|
|
}
|
|
}
|
|
|
|
template <typename Data>
|
|
void MatrixVec<Data>::ColumnResize(const ulong& new_column_dim){
|
|
if(new_column_dim != columns){
|
|
ulong limit = (new_column_dim < columns)? new_column_dim : columns;
|
|
Data* tmp = new Data[rows * new_column_dim]{};
|
|
for(ulong i=0 ; i<rows ; ++i){
|
|
for(ulong j=0 ; j<limit ; ++j){
|
|
tmp[(i*new_column_dim)+j] = (*this)(i,j);
|
|
}
|
|
}
|
|
size = rows * new_column_dim;
|
|
columns = new_column_dim;
|
|
std::swap(Elements, tmp);
|
|
delete[] tmp;
|
|
}
|
|
}
|
|
|
|
template <typename Data>
|
|
bool MatrixVec<Data>::ExistsCell(const ulong& r, const ulong& c) const noexcept{
|
|
return (r<rows && c<columns);
|
|
}
|
|
|
|
template <typename Data>
|
|
const Data& MatrixVec<Data>::operator()(const ulong r, const ulong c) const{
|
|
if(ExistsCell(r,c)) return Elements[(r*columns)+c];
|
|
else throw std::out_of_range("Tried to access an invalid position!");
|
|
}
|
|
|
|
template <typename Data>
|
|
Data& MatrixVec<Data>::operator()(const ulong r, const ulong c){
|
|
if(ExistsCell(r,c)) return Elements[(r*columns)+c];
|
|
else throw std::out_of_range("Tried to access an invalid position!");
|
|
}
|
|
|
|
template <typename Data>
|
|
void MatrixVec<Data>::Clear(){
|
|
Vector<Data>::Clear();
|
|
rows = 0;
|
|
columns = 0;
|
|
}
|
|
|
|
}
|