87ed8700e2
* first fix to start branch PR * explicit conversion from sizet to int * Array.h and DiagonalMatrix.h * many sizet to int conversions * removed some unused variables and added expl overrides * removed many unused parameters * more typing * even more * last of the easy changes
121 lines
3.5 KiB
C++
121 lines
3.5 KiB
C++
/***************************************************************************
|
|
* Copyright (c) 2023 Ondsel, Inc. *
|
|
* *
|
|
* This file is part of OndselSolver. *
|
|
* *
|
|
* See LICENSE file for details about copyright. *
|
|
***************************************************************************/
|
|
|
|
#pragma once
|
|
|
|
#include <memory>
|
|
#include <cmath>
|
|
|
|
#include "SparseVector.h"
|
|
#include "FullRow.h"
|
|
|
|
namespace MbD {
|
|
template<typename T>
|
|
class SparseRow;
|
|
template<typename T>
|
|
using SpRowsptr = std::shared_ptr<SparseRow<T>>;
|
|
using SpRowDsptr = std::shared_ptr<SparseRow<double>>;
|
|
|
|
template<typename T>
|
|
class SparseRow : public SparseVector<T>
|
|
{
|
|
public:
|
|
SparseRow() {}
|
|
SparseRow(int n) : SparseVector<T>(n) {}
|
|
SparseRow(std::initializer_list<std::pair<const int, T>> list) : SparseVector<T>{ list } {}
|
|
SparseRow(std::initializer_list<std::initializer_list<T>> list) : SparseVector<T>{ list } {}
|
|
SpRowDsptr timesconditionedWithTol(double scaling, double tol);
|
|
SpRowDsptr conditionedWithTol(double tol);
|
|
void atiplusFullRow(int j, FRowsptr<T> fullRow);
|
|
void atiminusFullRow(int j, FRowsptr<T> fullRow);
|
|
void atiplusFullRowtimes(int j, FRowsptr<T> fullRow, double factor);
|
|
T timesFullColumn(FColsptr<T> fullCol);
|
|
SpRowsptr<T> plusSparseRow(SpRowsptr<T> spMat);
|
|
SpRowsptr<T> clonesptr();
|
|
|
|
};
|
|
template<>
|
|
inline SpRowDsptr SparseRow<double>::timesconditionedWithTol(double scaling, double tol)
|
|
{
|
|
auto answer = std::make_shared<SparseRow<double>>(this->numberOfElements());
|
|
for (auto const& keyValue : *this)
|
|
{
|
|
auto val = keyValue.second * scaling;
|
|
if (std::abs(val) >= tol) (*answer)[keyValue.first] = val;
|
|
}
|
|
return answer;
|
|
}
|
|
template<>
|
|
inline SpRowDsptr SparseRow<double>::conditionedWithTol(double tol)
|
|
{
|
|
auto answer = std::make_shared<SparseRow<double>>(this->numberOfElements());
|
|
for (auto const& keyValue : *this)
|
|
{
|
|
auto val = keyValue.second;
|
|
if (std::abs(val) >= tol) (*answer)[keyValue.first] = val;
|
|
}
|
|
return answer;
|
|
}
|
|
template<typename T>
|
|
inline void SparseRow<T>::atiplusFullRow(int j, FRowsptr<T> fullRow)
|
|
{
|
|
for (int jj = 0; jj < (int)fullRow->size(); jj++)
|
|
{
|
|
(*this)[j + jj] += fullRow->at(jj);
|
|
}
|
|
}
|
|
template<typename T>
|
|
inline void SparseRow<T>::atiminusFullRow(int j, FRowsptr<T> fullRow)
|
|
{
|
|
for (int jj = 0; jj < (int)fullRow->size(); jj++)
|
|
{
|
|
(*this)[j + jj] -= fullRow->at(jj);
|
|
}
|
|
}
|
|
template<typename T>
|
|
inline void SparseRow<T>::atiplusFullRowtimes(int j, FRowsptr<T> fullRow, double factor)
|
|
{
|
|
for (int jj = 0; jj < (int)fullRow->size(); jj++)
|
|
{
|
|
(*this)[j + jj] += fullRow->at(jj) * factor;
|
|
}
|
|
}
|
|
template<typename T>
|
|
inline T SparseRow<T>::timesFullColumn(FColsptr<T> fullCol)
|
|
{
|
|
T sum = 0.0;
|
|
for (auto const& keyValue : *this) {
|
|
sum += fullCol->at(keyValue.first) * keyValue.second;
|
|
}
|
|
return sum;
|
|
}
|
|
template<typename T>
|
|
inline SpRowsptr<T> SparseRow<T>::plusSparseRow(SpRowsptr<T> spRow)
|
|
{
|
|
auto answer = clonesptr();
|
|
for (auto const& keyValue : *spRow)
|
|
{
|
|
auto key = keyValue.first;
|
|
auto val = keyValue.second;
|
|
if (answer->find(key) == answer->end()) {
|
|
(*answer)[key] = val;
|
|
}
|
|
else {
|
|
(*answer)[key] = val + answer->at(key);
|
|
}
|
|
}
|
|
return answer;
|
|
}
|
|
template<typename T>
|
|
inline std::shared_ptr<SparseRow<T>> SparseRow<T>::clonesptr()
|
|
{
|
|
return std::make_shared<SparseRow<T>>(*this);
|
|
}
|
|
}
|
|
|