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
|
/* interpolation/accel.c
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman
*
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
/* Author: G. Jungman
*/
#include <config.h>
#include <stdlib.h>
#include <gsl/gsl_errno.h>
#include <gsl/gsl_interp.h>
gsl_interp_accel *
gsl_interp_accel_alloc (void)
{
gsl_interp_accel *a = (gsl_interp_accel *) malloc (sizeof (gsl_interp_accel));
if (a == 0)
{
GSL_ERROR_NULL("could not allocate space for gsl_interp_accel", GSL_ENOMEM);
}
a->cache = 0;
a->hit_count = 0;
a->miss_count = 0;
return a;
}
int
gsl_interp_accel_reset (gsl_interp_accel * a)
{
a->cache = 0;
a->hit_count = 0;
a->miss_count = 0;
return GSL_SUCCESS;
}
#ifndef HIDE_INLINE_STATIC
size_t
gsl_interp_accel_find (gsl_interp_accel * a, const double xa[], size_t len, double x)
{
size_t x_index = a->cache;
if (x < xa[x_index])
{
a->miss_count++;
a->cache = gsl_interp_bsearch (xa, x, 0, x_index);
}
else if (x > xa[x_index + 1])
{
a->miss_count++;
a->cache = gsl_interp_bsearch (xa, x, x_index, len - 1);
}
else
{
a->hit_count++;
}
return a->cache;
}
#endif
void
gsl_interp_accel_free (gsl_interp_accel * a)
{
free (a);
}
|
