1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
|
/*
* (C) Copyright 2005- ECMWF.
*
* This software is licensed under the terms of the Apache Licence Version 2.0
* which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
*
* In applying this licence, ECMWF does not waive the privileges and immunities granted to it by
* virtue of its status as an intergovernmental organisation nor does it submit to any jurisdiction.
*/
/*
* C Implementation: nearest
*
* Description: How to get nearest point(s).
* Assumes all input GRIB messages have the same grid geometry
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "eccodes.h"
static void usage(const char* prog)
{
printf("Usage: %s grib_file grib_file ...\n", prog);
exit(1);
}
int main(int argc, char** argv)
{
int err = 0;
long step = 0;
size_t nfiles;
int i = 0;
codes_fieldset* set = NULL;
codes_handle* h = NULL;
char param[20] = {0,};
size_t len = 20;
double lats[4] = {0,};
double lons[4] = {0,};
double values[4] = {0,};
double distances[4] = {0,};
int indexes[4] = {0,};
char* order_by = "param,step";
size_t size = 4;
double lat = -40, lon = 15;
int mode = 0;
int count;
char** filenames;
codes_nearest* nearest = NULL;
if (argc < 2) usage(argv[0]);
nfiles = argc - 1;
filenames = (char**)malloc(sizeof(char*) * nfiles);
for (i = 0; i < nfiles; i++)
filenames[i] = (char*)strdup(argv[i + 1]);
set = codes_fieldset_new_from_files(0, filenames, nfiles, 0, 0, 0, order_by, &err);
CODES_CHECK(err, 0);
printf("\nordering by %s\n", order_by);
printf("\n%d fields in the fieldset\n", codes_fieldset_count(set));
printf("n,step,param\n");
mode = CODES_NEAREST_SAME_GRID | CODES_NEAREST_SAME_POINT;
count = 1;
while ((h = codes_fieldset_next_handle(set, &err)) != NULL) {
CODES_CHECK(codes_get_long(h, "step", &step), 0);
len = 20;
CODES_CHECK(codes_get_string(h, "shortName", param, &len), 0);
printf("%d %ld %s ", count, step, param);
if (!nearest) nearest = codes_grib_nearest_new(h, &err);
CODES_CHECK(err, 0);
CODES_CHECK(codes_grib_nearest_find(nearest, h, lat, lon, mode, lats, lons, values, distances, indexes, &size), 0);
printf("\nIdx\tlat\tlon\tdist\tval\n");
for (i = 0; i < 4; i++)
printf("%d\t%.2f\t%.2f\t%g\t%g\n",
(int)indexes[i], lats[i], lons[i], distances[i], values[i]);
printf("\n");
codes_handle_delete(h);
count++;
}
if (nearest) codes_grib_nearest_delete(nearest);
if (set) codes_fieldset_delete(set);
return 0;
}
|
