summaryrefslogtreecommitdiff
path: root/hwpfilter/source
diff options
context:
space:
mode:
authorRüdiger Timm <rt@openoffice.org>2004-09-08 15:17:41 +0000
committerRüdiger Timm <rt@openoffice.org>2004-09-08 15:17:41 +0000
commit1d5c0038b25a972d69a47541f3ab989f82c1b674 (patch)
tree14c8b3e62075c5a5ef41f60b7107ab3c0de6ed85 /hwpfilter/source
parent3d8a8afb2cd00cf07233a6bc9ccf5e736ad3c99b (diff)
INTEGRATION: CWS ooo20040704 (1.1.18); FILE MERGED
2004/06/30 13:05:18 waratah 1.1.18.1: #i30874# Add initial values to potentially unitialised values
Diffstat (limited to 'hwpfilter/source')
-rw-r--r--hwpfilter/source/solver.cpp20
1 files changed, 14 insertions, 6 deletions
diff --git a/hwpfilter/source/solver.cpp b/hwpfilter/source/solver.cpp
index 9356a60c3080..99171b8cb0d2 100644
--- a/hwpfilter/source/solver.cpp
+++ b/hwpfilter/source/solver.cpp
@@ -2,9 +2,9 @@
*
* $RCSfile: solver.cpp,v $
*
- * $Revision: 1.1 $
+ * $Revision: 1.2 $
*
- * last change: $Author: dvo $ $Date: 2003-10-15 14:42:05 $
+ * last change: $Author: rt $ $Date: 2004-09-08 16:17:41 $
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
@@ -115,7 +115,9 @@ int mgcLinearSystem::Inverse (int n, float** a)
int* indxr = new int[n];
int* ipiv = new int[n];
- int i, j, k, irow, icol;
+ int i, j, k;
+ int irow = 0;
+ int icol = 0;
float big, pivinv, save;
for (j = 0; j < n; j++)
@@ -222,7 +224,9 @@ int mgcLinearSystem::Solve (int n, float** a, float* b)
return 0;
}
- int i, j, k, irow, icol;
+ int i, j, k;
+ int irow = 0;
+ int icol = 0;
float big, pivinv, save;
for (j = 0; j < n; j++)
@@ -562,7 +566,9 @@ int mgcLinearSystemD::Inverse (int n, double** a)
int* indxr = new int[n];
int* ipiv = new int[n];
- int i, j, k, irow, icol;
+ int i, j, k;
+ int irow = 0;
+ int icol = 0;
double big, pivinv, save;
for (j = 0; j < n; j++)
@@ -668,7 +674,9 @@ int mgcLinearSystemD::Solve (int n, double** a, double* b)
return 0;
}
- int i, j, k, irow, icol;
+ int i, j, k;
+ int irow = 0;
+ int icol = 0;
double big, pivinv, save;
for (j = 0; j < n; j++)