get_station_list.c

Go to the documentation of this file.

#include "prototypes.h"
 
void get_station_list(char *fname,int smonth,int emonth)
 
{
 
 extern struct dval dval;
 extern char station_list_custom_file[100];
 int i,ier,sflag,field,j,xadd,yadd;
 extern struct station station[1500];
 extern int max_stations;
 FILE *fp;
 char *p,kbuf[150],hb5[10],parm[10];
 double dist1,dist2,dist,sorted[30];
 int m,l,h,k;
 int kk;
 float lat,lon;
 float conv=.0174;
 long t,u;
 
 max_stations=0;
 
 fp=fopen(fname,"r");
 
 if(fp==NULL) {
 
              printf("could not open %s\n",fname);
              exit(1);
 
              }
 
 i=0;
 for(;;) {
 
    p=fgets(kbuf,120,fp);
    if(p==NULL)
              break;
 
    if(i==1500)
              break;
 
    p=strchr(kbuf,'\n');
 
    if(p!=NULL)
             *p=0;
 
    ier=sscanf(kbuf,"%s %s %f %f %d %d ",station[i].hb5,
               station[i].parm,&station[i].lat,
               &station[i].lon,&station[i].elev,&station[i].tip);
 
 
    if(strncasecmp("PPD",station[i].parm,3)!=0 &&
       strncasecmp("PPM",station[i].parm,3)!=0 )
                      continue;
 
    if(ier != 6)
               continue;
 
    lat=station[i].lat;
    lon=station[i].lon;
 
    t=dval.a * cos(lat*conv)/(1+sin(lat*conv))
      * cos((lon-dval.lo-90)*conv) + dval.xo +.5;
 
    station[i].x=t;
 
    u=dval.a * cos(lat*conv)/(1+sin(lat*conv))
      * sin((lon-dval.lo-90)*conv) + dval.yo + .5;
       
    station[i].y=u;
 
    for(k=0;k<12;k++) {
 
            ier=is_good(k,smonth,emonth);
 
            if(ier == -1)
                   continue;
 
 
             station[i].isoh[k]=get_lisohyet(station[i].lat,station[i].lon,k);
 
 
       }
 
    sflag=1;
    field=0;
    for(j=0;j<strlen(kbuf);j++) {
 
                  if(kbuf[j] !=' ' && sflag==1) {
                                    sflag=0; 
                                    field++;
 
                  }
      
                  else if(kbuf[j]==' ')
                          sflag=1;
 
                 if(field==7) {
 
                          kbuf[j+49]=0;
 
                          strcpy(station[i].name,&kbuf[j]);
                          break;
 
            }
 
                }
 
  i++;
 
  }
 
max_stations=i;
fclose(fp);
 
strcpy(kbuf,fname);
strcat(kbuf,".custom");
strcpy(station_list_custom_file,kbuf);
 
fp=fopen(kbuf,"r");
 
if(fp!=NULL) {
printf("custom ok\n");
     for(;;) {
 
           p=fgets(kbuf,80,fp);
           if(p==NULL)
                   break;
 
           p=strchr(kbuf,'\n');
           *p=0;
 
           ier=sscanf(kbuf,"%s %s %d %d",hb5,parm,&xadd,&yadd);
 
           for(j=0;j<max_stations;j++) {
 
                   if(strcmp(hb5,station[j].hb5)==0) {
                     
                      if(strncmp(parm,station[j].parm,3)==0 &&
                              parm[4]==station[j].parm[4]) {
 
                              station[j].xadd=xadd;
                              station[j].yadd=yadd;
                              break;
 
                }
 
         }
 
     }
     }
 
   }
 
fclose(fp);          
 
for(i=0;i<max_stations;i++) {
 
        for(l=0;l<30;l++)
                    sorted[l]=9999999;
 
        for(m=0;m<max_stations;m++) {
        
               if(i==m)
                     continue; 
 
               dist1=station[i].lat-station[m].lat;
               dist2=station[i].lon-station[m].lon;
 
               dist=pow(dist1,2)+pow(dist2,2);
 
               for(l=0;l<30;l++) {
 
                       if(dist < sorted[l]) {
 
                               for(h=29; h > l; h--) {
 
                                     sorted[h]=sorted[h-1];
                                              
                                     station[i].index[h]=
                                     station[i].index[h-1];
   
                   }
 
                               sorted[l]=dist;
                                              
                               station[i].index[l]=m;
 
                               break;
 
                 }
                      
 
             }
 
         }
 
      }
 
return;
 
}