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

Code cleanups

Browse Source 
on behalf of Lebedev, see issue 1355
This commit is contained in:
Oliver Duis
2012-05-06 22:10:37 +02:00
parent 686188d6bb
commit 1483ecb47c
125 changed files with 750 additions and 747 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
rtengine/EdgePreservingDecomposition.cc
View File

@@ -126,7 +126,7 @@ bool MultiDiagonalSymmetricMatrix::CreateDiagonal(unsigned int index, unsigned i
return true;
}
int MultiDiagonalSymmetricMatrix::FindIndex(unsigned int StartRow){
int MultiDiagonalSymmetricMatrix::FindIndex(unsigned int StartRow) const {
//There's GOT to be a better way to do this. "Bidirectional map?"
for(unsigned int i = 0; i != m; i++)
if(StartRows[i] == StartRow)
@@ -274,7 +274,7 @@ void MultiDiagonalSymmetricMatrix::KillIncompleteCholeskyFactorization(void){
delete IncompleteCholeskyFactorization;
}
void MultiDiagonalSymmetricMatrix::CholeskyBackSolve(float *x, float *b){
void MultiDiagonalSymmetricMatrix::CholeskyBackSolve(float *x, float *b) const {
//We want to solve L D Lt x = b where D is a diagonal matrix described by Diagonals[0] and L is a unit lower triagular matrix described by the rest of the diagonals.
//Let D Lt x = y. Then, first solve L y = b.
float *y = new float[n];