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
|
/*
* Copyright (C) 1994. James Darrell McCauley. (darrell@mccauley-usa.com)
* http://mccauley-usa.com/
*
* This program is free software under the GPL (>=v2)
* Read the file GPL.TXT coming with GRASS for details.
*/
#include "gis.h"
#include "methods.h"
double nearest ( int fd, struct Cell_head *window, struct Categories *cats,
double north, double east, int usedesc)
{
char *buf;
int row, col;
double predicted;
DCELL *maprow = NULL;
maprow = G_allocate_d_raster_buf ();
/* convert northing and easting to row and col, resp */
row = (int) G_northing_to_row (north, window);
col = (int) G_easting_to_col (east, window);
if (G_get_d_raster_row (fd, maprow, row) < 0)
{
fprintf(stderr,"row = (int) G_northing_to_row (north, &window);\n");
fprintf(stderr,"G_get_map_row (fd, maprow, row) < 0\n");
fprintf(stderr,"DIAG: \tRegion is: n=%g s=%g e=%g w=%g\n",
window->north,window->south,window->east,window->west);
fprintf(stderr," \tData point is north=%g east=%g\n",north,east);
G_fatal_error ("\tProblem reading raster");
}
if (G_is_d_null_value(&(maprow[col]))) {
predicted = 0.0;
}
else if (usedesc)
{
G_squeeze(buf = G_get_cat (maprow[col], cats));
predicted=scancatlabel(buf);
}
else {
predicted = maprow[col];
}
return predicted;
}
|
