stepan
/
dynare
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

libkorder: use infinity instead of large constant in minimization algorith 

By the way, also use C++17 initialization within “if” statement.
remove-submodule
Sébastien Villemot 2023-06-28 23:09:56 +02:00
parent e6920a60a1
commit 8b945dfd64
No known key found for this signature in database
GPG Key ID: 2CECE9350ECEBE4A
1 changed files with 16 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
mex/sources/libkorder/sylv/QuasiTriangular.cc
View File

@ -1,6 +1,6 @@
/*
* Copyright © 2004-2011 Ondra Kamenik
* Copyright © 2019 Dynare Team
* Copyright © 2019-2023 Dynare Team
*
* This file is part of Dynare.
*
@ -28,6 +28,7 @@
#include <cmath>
#include <iostream>
#include <sstream>
#include <limits>
double
DiagonalBlock::getDeterminant() const
@ -267,16 +268,14 @@ Diagonal::diag_iter
Diagonal::findClosestBlock(diag_iter start, diag_iter end, double a)
{
diag_iter closest = start;
double minim = 1.0e100;
double minim {std::numeric_limits<double>::infinity()};
for (diag_iter run = start; run != end; ++run)
{
double dist = std::abs(a - run->getSize());
if (dist < minim)
{
minim = dist;
closest = run;
}
}
if (double dist = std::abs(a - run->getSize());
dist < minim)
{
minim = dist;
closest = run;
}
return closest;
}
@ -284,16 +283,14 @@ Diagonal::diag_iter
Diagonal::findNextLargerBlock(diag_iter start, diag_iter end, double a)
{
diag_iter closest = start;
double minim = 1.0e100;
double minim {std::numeric_limits<double>::infinity()};
for (diag_iter run = start; run != end; ++run)
{
double dist = run->getSize() - a;
if ((0 <= dist) && (dist < minim))
{
minim = dist;
closest = run;
}
}
if (double dist = run->getSize() - a;
0 <= dist && dist < minim)
{
minim = dist;
closest = run;
}
return closest;
}