Dynare++: drop unused codepaths
parent
44b40bbf09
commit
39896d8d0a
|
@ -30,12 +30,6 @@ BlockDiagonal::BlockDiagonal(const QuasiTriangular &t)
|
|||
}
|
||||
}
|
||||
|
||||
BlockDiagonal::BlockDiagonal(int p, const BlockDiagonal &b)
|
||||
: QuasiTriangular(p, b),
|
||||
row_len(b.row_len), col_len(b.col_len)
|
||||
{
|
||||
}
|
||||
|
||||
/* Put zeroes to right upper submatrix whose first column is defined
|
||||
by ‘edge’ */
|
||||
void
|
||||
|
|
|
@ -15,7 +15,6 @@ class BlockDiagonal : public QuasiTriangular
|
|||
std::vector<int> row_len, col_len;
|
||||
public:
|
||||
BlockDiagonal(ConstVector d, int d_size);
|
||||
BlockDiagonal(int p, const BlockDiagonal &b);
|
||||
BlockDiagonal(const BlockDiagonal &b) = default;
|
||||
BlockDiagonal(const QuasiTriangular &t);
|
||||
BlockDiagonal &operator=(const QuasiTriangular &t)
|
||||
|
|
|
@ -462,66 +462,12 @@ QuasiTriangular::setMatrix(double r, const QuasiTriangular &t)
|
|||
getData().add(r, t.getData());
|
||||
}
|
||||
|
||||
void
|
||||
QuasiTriangular::setMatrixViaIter(double r, const QuasiTriangular &t)
|
||||
{
|
||||
register double rr = r;
|
||||
diag_iter dil = diag_begin();
|
||||
const_diag_iter dir = t.diag_begin();
|
||||
for (; dil != diag_end(); ++dil, ++dir)
|
||||
{
|
||||
dil->getAlpha() = rr*(*dir->getAlpha());
|
||||
if (!dil->isReal())
|
||||
{
|
||||
dil->getBeta1() = rr*dir->getBeta1();
|
||||
dil->getBeta2() = rr*dir->getBeta2();
|
||||
}
|
||||
col_iter cil = col_begin(*dil);
|
||||
const_col_iter cir = t.col_begin(*dir);
|
||||
for (; cil != col_end(*dil); ++cil, ++cir)
|
||||
if (dil->isReal())
|
||||
*cil = rr*(*cir);
|
||||
else
|
||||
{
|
||||
cil.a() = rr*cir.a();
|
||||
cil.b() = rr*cir.b();
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
QuasiTriangular::addMatrix(double r, const QuasiTriangular &t)
|
||||
{
|
||||
getData().add(r, t.getData());
|
||||
}
|
||||
|
||||
void
|
||||
QuasiTriangular::addMatrixViaIter(double r, const QuasiTriangular &t)
|
||||
{
|
||||
register double rr = r;
|
||||
diag_iter dil = diag_begin();
|
||||
const_diag_iter dir = t.diag_begin();
|
||||
for (; dil != diag_end(); ++dil, ++dir)
|
||||
{
|
||||
dil->getAlpha() = (*dil->getAlpha()) + rr*(*dir->getAlpha());
|
||||
if (!dil->isReal())
|
||||
{
|
||||
dil->getBeta1() += rr*dir->getBeta1();
|
||||
dil->getBeta2() += rr*dir->getBeta2();
|
||||
}
|
||||
col_iter cil = col_begin(*dil);
|
||||
const_col_iter cir = t.col_begin(*dir);
|
||||
for (; cil != col_end(*dil); ++cil, ++cir)
|
||||
if (dil->isReal())
|
||||
*cil += rr*(*cir);
|
||||
else
|
||||
{
|
||||
cil.a() += rr*cir.a();
|
||||
cil.b() += rr*cir.b();
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
QuasiTriangular::addUnit()
|
||||
{
|
||||
|
|
|
@ -441,9 +441,6 @@ private:
|
|||
void multaKron(KronVector &x, const ConstKronVector &b) const;
|
||||
/* x = x + (thisᵀ⊗I)·b */
|
||||
void multaKronTrans(KronVector &x, const ConstKronVector &b) const;
|
||||
/* implementation via iterators, useful for large matrices */
|
||||
void setMatrixViaIter(double r, const QuasiTriangular &t);
|
||||
void addMatrixViaIter(double r, const QuasiTriangular &t);
|
||||
/* hide noneffective implementations of parents */
|
||||
void multsVec(Vector &x, const ConstVector &d) const;
|
||||
void multsVecTrans(Vector &x, const ConstVector &d) const;
|
||||
|
|
Loading…
Reference in New Issue