The state of searches can be stored in a
which is a kind of iterator for interpolation lookups. It caches the
previous value of an index lookup. When the subsequent interpolation
point falls in the same interval its index value can be returned
This function returns the index i of the array x_array such that
x_array[i] <= x < x_array[i+1]. The index is searched for in the range [index_lo,index_hi]. An inline version of this function is used when
This function performs a lookup action on the data array x_array of size size, using the given accelerator a. This is how lookups are performed during evaluation of an interpolation. The function returns an index i such that
x_array[i] <= x < x_array[i+1]. An inline version of this function is used when
This function reinitializes the accelerator object acc. It should be used when the cached information is no longer applicable—for example, when switching to a new dataset.
This function frees the accelerator object acc.