mirror of
https://github.com/Ardour/ardour.git
synced 2025-12-07 15:25:01 +01:00
fixes for 98% of all the warnings/errors reported by OS X gcc on tiger
git-svn-id: svn://localhost/ardour2/branches/3.0@10179 d708f5d6-7413-0410-9779-e7cbd77b26cf
This commit is contained in:
parent
15e390ebe5
commit
0938a42440
100 changed files with 239 additions and 224 deletions
|
|
@ -155,7 +155,7 @@ double MathUtilities::mean(const std::vector<double> &src,
|
|||
{
|
||||
double sum = 0.;
|
||||
|
||||
for (int i = 0; i < count; ++i)
|
||||
for (unsigned int i = 0; i < count; ++i)
|
||||
{
|
||||
sum += src[start + i];
|
||||
}
|
||||
|
|
@ -167,7 +167,6 @@ void MathUtilities::getFrameMinMax(const double *data, unsigned int len, double
|
|||
{
|
||||
unsigned int i;
|
||||
double temp = 0.0;
|
||||
double a=0.0;
|
||||
|
||||
if (len == 0) {
|
||||
*min = *max = 0;
|
||||
|
|
@ -317,9 +316,9 @@ void MathUtilities::normalise(std::vector<double> &data, NormaliseType type)
|
|||
case NormaliseUnitSum:
|
||||
{
|
||||
double sum = 0.0;
|
||||
for (int i = 0; i < data.size(); ++i) sum += data[i];
|
||||
for (unsigned int i = 0; i < data.size(); ++i) sum += data[i];
|
||||
if (sum != 0.0) {
|
||||
for (int i = 0; i < data.size(); ++i) data[i] /= sum;
|
||||
for (unsigned int i = 0; i < data.size(); ++i) data[i] /= sum;
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
|
@ -327,11 +326,11 @@ void MathUtilities::normalise(std::vector<double> &data, NormaliseType type)
|
|||
case NormaliseUnitMax:
|
||||
{
|
||||
double max = 0.0;
|
||||
for (int i = 0; i < data.size(); ++i) {
|
||||
for (unsigned int i = 0; i < data.size(); ++i) {
|
||||
if (fabs(data[i]) > max) max = fabs(data[i]);
|
||||
}
|
||||
if (max != 0.0) {
|
||||
for (int i = 0; i < data.size(); ++i) data[i] /= max;
|
||||
for (unsigned int i = 0; i < data.size(); ++i) data[i] /= max;
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue