Flute acoustics: measurement, modelling and design - School of ...

APPENDIX B. PROGRAM LISTINGS 263
window, and choose the Minimum closest to the integer
mark as the harmonic. */
while(i < arraysize) {
if(ha[i] >= right_bound) {
i++;
break;
} else {
if((ha[i] > left_bound) && (ha[i] < right_bound)) {
if(found) {
if(fabs(harmonic - ha[i]) < df) {
df = fabs(harmonic - ha[i]);
curharmonic = i;
}
} else {
df = fabs(harmonic - ha[i]);
curharmonic = i;
found = 1;
}
}
i++;
}
}
/* if a minimum is found in this window, enter the rounded off
integer ratio and the impedance level of the harmonic into
a Harmonic structure and insert this into a vector. */
if(found && (ha[i - 1] >= harmonic)) {
h = (Harmonic)malloc(sizeof(*h));
h->n = round(ha[curharmonic]);
h->Z = ((Minimum)elementAt(minv, pos + curharmonic + 1))->Z;
addElement(harmv, h);
}
/* if last Minimum reached, break */
if(i == arraysize)
break;
}
/* return all found harmonics */
return harmv;
}
double harmAvgZ(Vector harmv) {
int i;
int numharm;
double totalZ = 0.0;
double totalfraction = 0.0;
Harmonic h;
/* maximum number of harmonics averaged
is either HARMONICS_AVERAGED or the number
of harmonics present */
if(sizeVector(harmv) < HARMONICS_AVERAGED)
numharm = sizeVector(harmv);
else
numharm = HARMONICS_AVERAGED;
/* if no harmonics present, return NaN */