sgrust 0.8.6

A sparse grid library written in Rust.
Documentation 
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

//! Interpolation state for zero-allocation repeated interpolation.
//!
//! This module provides `InterpolationState` which can be reused across multiple
//! interpolation calls to avoid per-call setup overhead.

use crate::dynamic::iterators::grid_iterator_cache::AdjacencyGridIterator;
use crate::dynamic::iterators::dynamic_grid_iterator::GridIteratorT;
use crate::dynamic::storage::SparseGridData;

/// Reusable state for interpolation to eliminate per-call overhead.
/// 
/// Create once from a grid and reuse for many interpolation calls.
/// This avoids recreating the iterator and scratch arrays each call.
/// 
/// # Example
/// ```ignore
/// let state = grid.create_interpolation_state();
/// for point in points {
///     grid.interpolate_with_state(&mut state, &point, &mut result)?;
/// }
/// ```
pub struct InterpolationState<'a> {
    /// The iterator used for tree traversal
    pub(crate) iterator: AdjacencyGridIterator<'a>
}

impl<'a> InterpolationState<'a> {
    /// Create a new interpolation state from storage data
    #[inline]
    pub fn new(storage: &'a SparseGridData) -> Self {
        Self {
            iterator: AdjacencyGridIterator::new(storage),
        }
    }
    
    /// Reset the state for a new interpolation (called internally)
    #[inline]
    #[allow(unused)]
    pub(crate) fn reset(&mut self) {
        self.iterator.reset_to_level_zero();
    }
}