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

APPENDIX B. PROGRAM LISTINGS 250
Minimum m;
Vector minv = createVector();
/* for each minimum in extrema list */
for(i = 0; i < sizeVector(extv); i++) {
e = (Extremum)elementAt(extv, i);
if(e->type == MINIMUM) {
/* create Minimum struct with same f, Z, B */
m = (Minimum)malloc(sizeof(*m));
m->f = e->f;
m->Z = e->Z;
m->B = e->B;
/* search for left maximum and calculate df, dZ */
for(j = i - 1; j >= 0; j--) {
searche = (Extremum)elementAt(extv, j);
if(searche->type == MAXIMUM) {
m->L_max_df = e->f - searche->f;
m->L_max_dZ = searche->Z - e->Z;
break;
}
}
/* if none found, set to nan */
if(j < 0) {
m->L_max_df = invalidNum();
m->L_max_dZ = invalidNum();
}
/* search for left minimum and calculate df, dZ */
for(j = i - 1; j >= 0; j--) {
searche = (Extremum)elementAt(extv, j);
if(searche->type == MINIMUM) {
m->L_min_df = e->f - searche->f;
m->L_min_dZ = searche->Z - e->Z;
break;
}
}
/* if none found, set to nan */
if(j < 0) {
m->L_min_df = invalidNum();
m->L_min_dZ = invalidNum();
}
/* search for left maximum and calculate df, dZ */
for(j = i + 1; j < sizeVector(extv); j++) {
searche = (Extremum)elementAt(extv, j);
if(searche->type == MAXIMUM) {
m->R_max_df = searche->f - e->f;
m->R_max_dZ = searche->Z - e->Z;
break;
}
}
/* if none found, set to nan */
if(j >= sizeVector(extv)) {
m->R_max_df = invalidNum();
m->R_max_dZ = invalidNum();
}
/* search for left minimum and calculate df, dZ */
for(j = i + 1; j < sizeVector(extv); j++) {
searche = (Extremum)elementAt(extv, j);
if(searche->type == MINIMUM) {