|
|
|
@ -15,7 +15,7 @@
|
|
|
|
|
|
|
|
|
|
void findrfc(double *y1,double hmin, int *ind, int n,int *info) {
|
|
|
|
|
double xminus,xplus,Tpl,Tmi,*y,Tstart;
|
|
|
|
|
int i,j,ix=0,NC;
|
|
|
|
|
int i,j,ix=0,NC,iy;
|
|
|
|
|
info[0] = 0;
|
|
|
|
|
if (*(y1+0)> *(y1+1)){
|
|
|
|
|
/* if first is a max , ignore the first max*/
|
|
|
|
@ -87,6 +87,7 @@ void findrfc(double *y1,double hmin, int *ind, int n,int *info) {
|
|
|
|
|
ix++;
|
|
|
|
|
*(ind+ix)=(Tstart+2*i+1);
|
|
|
|
|
ix++;
|
|
|
|
|
|
|
|
|
|
} /*if*/
|
|
|
|
|
goto L180;
|
|
|
|
|
L170:
|
|
|
|
@ -108,6 +109,7 @@ void findrfc(double *y1,double hmin, int *ind, int n,int *info) {
|
|
|
|
|
} /*if*/
|
|
|
|
|
} /*elseif*/
|
|
|
|
|
L180:
|
|
|
|
|
iy=i;
|
|
|
|
|
} /* for i */
|
|
|
|
|
info[0] = ix;
|
|
|
|
|
return ;
|
|
|
|
|