liz/rawTherapee
liz/rawTherapee
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

cppcheck clean rtengine/EdgePreservingDecomposition.h

Browse Source
This commit is contained in:
Ingo Weyrich 2021-05-22 11:15:35 +02:00
parent 1cce9a4ad2
commit 954ce94e3f
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
rtengine/EdgePreservingDecomposition.cc
View File

@ -208,7 +208,7 @@ bool MultiDiagonalSymmetricMatrix::CreateDiagonal(int index, int StartRow)
return true;
}
inline int MultiDiagonalSymmetricMatrix::FindIndex(int StartRow)
inline int MultiDiagonalSymmetricMatrix::FindIndex(int StartRow) const
{
//There's GOT to be a better way to do this. "Bidirectional map?"
// Issue 1895 : Changed start of loop from zero to one

4
rtengine/EdgePreservingDecomposition.h
View File

@ -97,7 +97,7 @@ public:
int *StartRows;
bool CreateDiagonal(int index, int StartRow);
int n, m; //The matrix is n x n, with m diagonals on the lower triangle. Don't change these. They should be private but aren't for convenience.
inline int DiagonalLength(int StartRow) //Gives number of elements in a diagonal.
inline int DiagonalLength(int StartRow) const //Gives number of elements in a diagonal.
{
return n - StartRow;
};
@ -109,7 +109,7 @@ public:
void VectorProduct(float *Product, float *x);
//Given the start row, attempts to find the corresponding index, or -1 if the StartRow doesn't exist.
inline int FindIndex(int StartRow) __attribute__((always_inline));
inline int FindIndex(int StartRow) const __attribute__((always_inline));
//This is the same as above, but designed to take this class as a pass through variable. By this way you can feed
//the meat of this class into an independent function, such as SparseConjugateGradient.