Permalink
Browse files

fixed 6 iridium compiler warnings (mono)

  • Loading branch information...
1 parent 67c9e2f commit 85ce4b317f52ce7c7f01d844ef3290eeaa95b898 @cdrnet cdrnet committed Dec 20, 2008
@@ -358,7 +358,6 @@ IList<ComplexVector> rowVectors
}
int rows = rowVectors.Count;
- int columns = rowVectors[0].Length;
Complex[][] newData = new Complex[rows][];
for(int i = 0; i < rows; i++)
@@ -72,7 +72,7 @@ public class EigenvalueDecomposition
OnDemandComputation<Matrix> _blockDiagonalOnDemand;
OnDemandComputation<Matrix> _eigenVectorsOnDemand;
- OnDemandComputation<ComplexVector> _eigenValuesOnDemand;
+ //OnDemandComputation<ComplexVector> _eigenValuesOnDemand;
/// <summary>
/// Check for symmetry, then construct the eigenvalue decomposition
@@ -223,22 +223,22 @@ public Matrix EigenVectors
InitOnDemandComputations()
{
_blockDiagonalOnDemand = new OnDemandComputation<Matrix>(ComputeBlockDiagonalMatrix);
- _eigenValuesOnDemand = new OnDemandComputation<ComplexVector>(ComputeEigenValues);
+ //_eigenValuesOnDemand = new OnDemandComputation<ComplexVector>(ComputeEigenValues);
_eigenVectorsOnDemand = new OnDemandComputation<Matrix>(ComputeEigentVectors);
}
- ComplexVector
- ComputeEigenValues()
- {
- Complex[] eigenvalues = new Complex[n];
+ //ComplexVector
+ //ComputeEigenValues()
+ //{
+ // Complex[] eigenvalues = new Complex[n];
- for(int i = 0; i < eigenvalues.Length; i++)
- {
- eigenvalues[i] = new Complex(d[i], e[i]);
- }
+ // for(int i = 0; i < eigenvalues.Length; i++)
+ // {
+ // eigenvalues[i] = new Complex(d[i], e[i]);
+ // }
- return new ComplexVector(eigenvalues);
- }
+ // return new ComplexVector(eigenvalues);
+ //}
Matrix
ComputeBlockDiagonalMatrix()
@@ -369,7 +369,6 @@ Vector rowVector
throw new ArgumentNullException("rowVector");
}
- int columns = rowVector.Length;
double[][] newData = new double[1][];
newData[0] = rowVector.CopyToArray();
@@ -434,7 +433,6 @@ IList<Vector> rowVectors
}
int rows = rowVectors.Count;
- int columns = rowVectors[0].Length;
double[][] newData = new double[rows][];
for(int i = 0; i < rows; i++)
@@ -441,7 +441,7 @@ public static Histogram OptimalFreedom(int bucketCount, ICollection distribution
// Loop for finding the optimal boundary of the last bucket
// ('j+1' is the index of the first value in the last bucket)
- for(int j = (k - 1), avg = (k - 1); j < i; j++)
+ for(int j = (k - 1); j < i; j++)
{
double currentCost = optimalCost[j, k - 1] +
(values[i] - values[j + 1]) * (i - j);
@@ -524,7 +524,7 @@ public static Histogram OptimalSquaredFreedom(int histSize, ICollection distribu
// Loop for finding the optimal boundary of the last bucket
// ('j+1' is the index of the first value in the last bucket)
- for(int j = (k - 1), avg = (k - 1); j < i; j++)
+ for(int j = (k - 1); j < i; j++)
{
double currentCost = optimalCost[j, k - 1] +
(values[i] - values[j + 1]) * (values[i] - values[j + 1]) * (i - j);

0 comments on commit 85ce4b3

Please sign in to comment.