diff options
| author | Paul Davis <paul@linuxaudiosystems.com> | 2015-10-04 15:11:15 -0400 |
|---|---|---|
| committer | Paul Davis <paul@linuxaudiosystems.com> | 2015-10-04 15:11:15 -0400 |
| commit | 4178db5f632721eefb58c42d684fc10f8f4fb9da (patch) | |
| tree | a549de293b1a4dd6b5c3f5070f44f95e5e829f46 /libs/qm-dsp/maths | |
| parent | 4dc63966f0872efe768dad61eb9b8785d06b92d1 (diff) | |
globally remove all trailing whitespace from .cpp and .hpp files missed by previous commit
Diffstat (limited to 'libs/qm-dsp/maths')
| -rw-r--r-- | libs/qm-dsp/maths/Correlation.cpp | 2 | ||||
| -rw-r--r-- | libs/qm-dsp/maths/KLDivergence.cpp | 2 | ||||
| -rw-r--r-- | libs/qm-dsp/maths/MathUtilities.cpp | 4 |
3 files changed, 4 insertions, 4 deletions
diff --git a/libs/qm-dsp/maths/Correlation.cpp b/libs/qm-dsp/maths/Correlation.cpp index 17ee28f749..fd36ac3473 100644 --- a/libs/qm-dsp/maths/Correlation.cpp +++ b/libs/qm-dsp/maths/Correlation.cpp @@ -40,7 +40,7 @@ void Correlation::doAutoUnBiased(double *src, double *dst, unsigned int length) { for( j = i; j < length; j++) { - tmp += src[ j-i ] * src[ j ]; + tmp += src[ j-i ] * src[ j ]; } diff --git a/libs/qm-dsp/maths/KLDivergence.cpp b/libs/qm-dsp/maths/KLDivergence.cpp index 3c3cb134ca..3502afb5cc 100644 --- a/libs/qm-dsp/maths/KLDivergence.cpp +++ b/libs/qm-dsp/maths/KLDivergence.cpp @@ -50,7 +50,7 @@ double KLDivergence::distanceDistribution(const vector<double> &d1, double d = 0; double small = 1e-20; - + for (int i = 0; i < sz; ++i) { d += d1[i] * log10((d1[i] + small) / (d2[i] + small)); } diff --git a/libs/qm-dsp/maths/MathUtilities.cpp b/libs/qm-dsp/maths/MathUtilities.cpp index 9b5b2fc992..2249c53a95 100644 --- a/libs/qm-dsp/maths/MathUtilities.cpp +++ b/libs/qm-dsp/maths/MathUtilities.cpp @@ -76,7 +76,7 @@ double MathUtilities::getAlphaNorm( const std::vector <double> &data, unsigned i double MathUtilities::round(double x) { double val = (double)floor(x + 0.5); - + return val; } @@ -86,7 +86,7 @@ double MathUtilities::median(const double *src, unsigned int len) double tmp = 0.0; double tempMedian; double medianVal; - + double* scratch = new double[ len ];//Vector < double > sortedX = Vector < double > ( size ); for ( i = 0; i < len; i++ ) |