Exemple #1
0
grib_index* InputGrib::getIndex(const Key::Input& iKey, const std::string& iLocalVariable) const {
   std::string indexFilename = getIndexFilename(iKey);
   char* filename_index = new char[indexFilename.size()+1];
   std::strcpy(filename_index, indexFilename.c_str());
   FILE* fid0 = fopen(filename_index, "r");
   grib_index* gribIndex = NULL;

   if(fid0 != NULL) {
      int err = 0;
      gribIndex = grib_index_read(0, filename_index, &err);
      //std::cout << "reading" << std::endl;
      if(err != 0) {
         assert(gribIndex == NULL);
         std::stringstream ss;
         ss << "Input::Grib Error reading index file: " << indexFilename;
         Global::logger->write(ss.str(), Logger::warning);
      }
      fclose(fid0);
      delete filename_index;
   }

   if(gribIndex == NULL)
      return(NULL);

   std::string shortName;
   std::string levelType;
   std::string level;
   getVariableValues(iLocalVariable, shortName, levelType,level);

   char* shortNameChar = new char[shortName.size()+1];
   char* levelTypeChar = new char[levelType.size()+1];
   char* levelChar     = new char[level.size()+1];
   std::strcpy(shortNameChar, shortName.c_str());
   std::strcpy(levelTypeChar, levelType.c_str());
   std::strcpy(levelChar, level.c_str());
   // NOTE: If the grib file was partial, then the index file might not contain the key we
   // are searching for. In this case grib_handle_new_from_index will not create any handle
   // This is ok.
   grib_index_select_string(gribIndex, "levtype", levelTypeChar);
   grib_index_select_string(gribIndex, "levelist", levelChar);
   grib_index_select_string(gribIndex, "shortName", shortNameChar);
   delete shortNameChar;
   delete levelTypeChar;
   delete levelChar;
   return(gribIndex);
}
Exemple #2
0
grib_index* codes_index_read(grib_context* c,const char* filename,int *err)
{
    return grib_index_read(c,filename,err);
}
Exemple #3
0
int main(int argc,char* argv[])
{
  grib_index* index=NULL;
  grib_handle* h=NULL;
  long *step,*level,*number;
  char** shortName=NULL;
  int i,j,k,l;
  size_t stepSize,levelSize,shortNameSize,numberSize;
  long ostep,olevel,onumber;
  char oshortName[200];
  size_t lenshortName=200;
  int ret=0,count=0;

  if (argc != 2) usage(argv[0]);

  printf("indexing...\n");

  index=grib_index_read(0,"out.gribidx",&ret);
  GRIB_CHECK(ret,0);

  printf("end indexing...\n");

  /* get the number of distinct values of "step" in the index */
  GRIB_CHECK(grib_index_get_size(index,"step",&stepSize),0);
  step=(long*)malloc(sizeof(long)*stepSize);
  if (!step) exit(1);
  /* get the list of distinct steps from the index */
  /* the list is in ascending order */
  GRIB_CHECK(grib_index_get_long(index,"step",step,&stepSize),0);
  printf("stepSize=%ld\n",(long)stepSize);
  for (i=0;i<stepSize;i++) printf("%ld ",step[i]);
  printf("\n");

  /*same as for "step"*/
  GRIB_CHECK(grib_index_get_size(index,"level",&levelSize),0);
  level=(long*)malloc(sizeof(long)*levelSize);
  if (!level) exit(1);
  /*same as for "step"*/
  GRIB_CHECK(grib_index_get_long(index,"level",level,&levelSize),0);
  printf("levelSize=%ld\n",(long)levelSize);
  for (i=0;i<levelSize;i++) printf("%ld ",level[i]);
  printf("\n");

  /*same as for "step"*/
  GRIB_CHECK(grib_index_get_size(index,"number",&numberSize),0);
  number=(long*)malloc(sizeof(long)*numberSize);
  if (!number) exit(1);
  /*same as for "step"*/
  GRIB_CHECK(grib_index_get_long(index,"number",number,&numberSize),0);
  printf("numberSize=%ld\n",(long)numberSize);
  for (i=0;i<numberSize;i++) printf("%ld ",number[i]);
  printf("\n");

  /*same as for "step"*/
  GRIB_CHECK(grib_index_get_size(index,"shortName",&shortNameSize),0);
  shortName=(char**)malloc(sizeof(char*)*shortNameSize);
  if (!shortName) exit(1);
  /*same as for "step"*/
  GRIB_CHECK(grib_index_get_string(index,"shortName",shortName,&shortNameSize),0);
  printf("shortNameSize=%ld\n",(long)shortNameSize);
  for (i=0;i<shortNameSize;i++) printf("%s ",shortName[i]);
  printf("\n");

  count=0;
  /* nested loops on the keys values of the index */
  /* different order of the nested loops doesn't affect performance*/
  for (i=0;i<shortNameSize;i++) {
    /* select the grib with shortName=shortName[i] */
    grib_index_select_string(index,"shortName",shortName[i]);

    for (l=0;l<levelSize;l++) {
      /* select the grib with level=level[i] */
      grib_index_select_long(index,"level",level[l]);

      for (j=0;j<numberSize;j++) {
        /* select the grib with number=number[i] */
        grib_index_select_long(index,"number",number[j]);

        for (k=0;k<stepSize;k++) {
          /* select the grib with step=step[i] */
          grib_index_select_long(index,"step",step[k]);

		 /* create a new grib_handle from the index with the constraints 
		    imposed by the select statements. It is a loop because
			in the index there could be more than one grib with those
			constrants */
         while ((h=grib_handle_new_from_index(index,&ret))!=NULL){
		   count++;
           if (ret) {printf("error: %d\n",ret); exit(ret);}
           lenshortName=200;
		   grib_get_string(h,"shortName",oshortName,&lenshortName);
		   grib_get_long(h,"level",&olevel);
		   grib_get_long(h,"number",&onumber);
		   grib_get_long(h,"step",&ostep);
		   printf("shortName=%s ",oshortName);
		   printf("level=%ld ",olevel);
		   printf("number=%ld ",onumber);
		   printf("step=%ld \n",ostep);
		   grib_handle_delete(h);
		 }
         if (ret!=GRIB_END_OF_INDEX) {printf("error: %s\n",grib_get_error_message(ret)); exit(ret);}
	    } 
	  }
	}
  }
  printf("  %d messages selected\n",count);


  return 0;
}