/
approx.c
131 lines (105 loc) · 3.25 KB
/
approx.c
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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
/*
* R : A Computer Language for Statistical Data Analysis
* Copyright (C) 1995-2001 Robert Gentleman, Ross Ihaka and the
* R Development Core Team
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <R_ext/Arith.h>
#include <R_ext/Error.h>
#include <R_ext/Applic.h>
#ifdef ENABLE_NLS
#include <libintl.h>
#define _(String) gettext (String)
#else
#define _(String) (String)
#endif
/* Linear and Step Function Interpolation */
/* Assumes that ordinates are in ascending order
* The right interval is found by bisection
* Linear/constant interpolation then takes place on that interval
*/
/* NB: R_interv(.) in ./interv.c is conceptually a special case of
* this, where y = 1:n */
typedef struct {
double ylow;
double yhigh;
double f1;
double f2;
int kind;
} appr_meth;
static double approx1(double v, double *x, double *y, int n,
appr_meth *Meth)
{
/* Approximate y(v), given (x,y)[i], i = 0,..,n-1 */
int i, j, ij;
if(!n) return R_NaN;
i = 0;
j = n - 1;
/* handle out-of-domain points */
if(v < x[i]) return Meth->ylow;
if(v > x[j]) return Meth->yhigh;
/* find the correct interval by bisection */
while(i < j - 1) { /* x[i] <= v <= x[j] */
ij = (i + j)/2; /* i+1 <= ij <= j-1 */
if(v < x[ij]) j = ij;
else i = ij;
/* still i < j */
}
/* provably have i == j-1 */
/* interpolation */
if(v == x[j]) return y[j];
if(v == x[i]) return y[i];
/* impossible: if(x[j] == x[i]) return y[i]; */
if(Meth->kind == 1) { /* linear */
return y[i] + (y[j] - y[i]) * ((v - x[i])/(x[j] - x[i]));
}
else { /* 2 : constant */
return y[i] * Meth->f1 + y[j] * Meth->f2;
}
}/* approx1() */
/* R Frontend for Linear and Constant Interpolation */
void R_approx(double *x, double *y, int *nxy, double *xout, int *nout,
int *method, double *yleft, double *yright, double *f)
{
int i;
appr_meth M = {0.0, 0.0, 0.0, 0.0, 0}; /* -Wall */
/* check interpolation method */
switch(*method) {
case 1: /* linear */
break;
case 2: /* constant */
if(!R_FINITE(*f) || *f < 0 || *f > 1)
error(_("approx(): invalid f value"));
M.f2 = *f;
M.f1 = 1 - *f;
break;
default:
error(_("approx(): invalid interpolation method"));
break;
}
for(i=0 ; i<*nxy ; i++)
if(ISNA(x[i]) || ISNA(y[i]))
error(_("approx(): attempted to interpolate NA values"));
M.kind = *method;
M.ylow = *yleft;
M.yhigh = *yright;
for(i=0 ; i < *nout; i++)
if(!ISNA(xout[i]))
xout[i] = approx1(xout[i], x, y, *nxy, &M);
}