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
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

use crate::{const_generic::{iterators::grid_iterator::{GridIteratorT, HashMapGridIterator}, storage::SparseGridData}, errors::SGError};

pub trait SweepFunction<const D: usize, T, R>
{
    fn execute_in_place(&mut self, values: &mut [R], iterator: &mut HashMapGridIterator<D>, storage: &SparseGridData<D>, dimension: usize) -> Result<(), SGError>;
}

#[allow(unused)]
fn sweep_recursive_in_place<const D: usize, T, R, F: SweepFunction<D, T, R>>(function: &mut F, storage: &SparseGridData<D>, values: &mut [R], iterator: &mut HashMapGridIterator<D>, 
    dim_list: &Vec<usize>, dim_rem: usize, dim_sweep: usize)
    {
        function.execute_in_place(values, iterator, storage, dim_sweep);
        for d in 0..dim_rem
        {
            let cur_dim = dim_list[d];
            if iterator.is_leaf()
            {
                continue;
            }
            iterator.left_child(cur_dim);
            if iterator.seq().is_some()
            {
                sweep_recursive_in_place(function, storage, values, iterator, dim_list, d + 1, dim_sweep);
            }
            iterator.step_right(cur_dim);
            if iterator.seq().is_some()
            {
                sweep_recursive_in_place(function, storage, values, iterator, dim_list, d + 1, dim_sweep);
            }
            iterator.up(cur_dim);
        }
    }


pub(crate) fn sweep_boundary_recursive_in_place<const D: usize, T, R, F: SweepFunction<D, T, R>>(function: &mut F, storage: &SparseGridData<D>, values: &mut [R], iterator: &mut HashMapGridIterator<D>, 
    dim_list: &Vec<usize>, dim_rem: usize, dim_sweep: usize) -> Result<(), SGError>
    {
        if dim_rem == 0
        {
            function.execute_in_place(values, iterator, storage, dim_sweep)?;
        }
        else
        {
            let current_index = iterator.point();
            let d = dim_list[dim_rem - 1];
            let current_level = current_index.level[d];
            if current_level > 0
            {
                sweep_boundary_recursive_in_place(function, storage, values, iterator, dim_list, dim_rem - 1, dim_sweep)?;
                if !iterator.is_leaf()
                {
                    iterator.left_child(d);
                    if iterator.seq().is_some()
                    {
                        sweep_boundary_recursive_in_place(function, storage, values, iterator, dim_list, dim_rem, dim_sweep)?;
                    }
                    iterator.step_right(d);
                    if iterator.seq().is_some()
                    {
                        sweep_boundary_recursive_in_place(function, storage, values, iterator, dim_list, dim_rem, dim_sweep)?;
                    }
                    iterator.up(d);
                }
            }
            else 
            {
                sweep_boundary_recursive_in_place(function, storage, values, iterator, dim_list, dim_rem - 1, dim_sweep)?;
                iterator.reset_to_right_level_zero(d);
                sweep_boundary_recursive_in_place(function, storage, values, iterator, dim_list, dim_rem - 1, dim_sweep)?;
                if !iterator.is_leaf()
                {
                    iterator.reset_to_level_one(d);
                    if iterator.seq().is_some()
                    {
                        sweep_boundary_recursive_in_place(function, storage, values, iterator, dim_list, dim_rem, dim_sweep)?;
                    }
                }
                iterator.reset_to_left_level_zero(d);
            }                   
        }
        Ok(())
    }
pub(crate) fn sweep_1d_in_place<const D: usize, T, R, F: SweepFunction<D, T, R>>(function: &mut F, storage: &SparseGridData<D>, values: &mut [R],
    dim_sweep: usize)
{
    let mut dim_list = vec![0; D-1];
    let mut idx = 0;
    for i in 0..D
    {
        if i != dim_sweep
        {
            dim_list[idx] = i;
            idx += 1;
        }
    }
    let mut iterator = HashMapGridIterator::<D>::new(storage);
    sweep_recursive_in_place(function, storage, values, &mut iterator, &dim_list, D-1, dim_sweep);
}

pub(crate) fn sweep_1d_boundary_in_place<const D: usize, T, R, F: SweepFunction<D, T, R>>(function: &mut F, storage: &SparseGridData<D>, values: &mut [R],
    dim_sweep: usize) -> Result<(), SGError>
{
    let mut dim_list = vec![0; D-1];
    let mut idx = 0;
    for i in 0..D
    {
        if i != dim_sweep
        {
            dim_list[idx] = i;
            idx += 1;
        }
    }
    let mut iterator = HashMapGridIterator::<D>::new(storage);
    iterator.reset_to_level_zero();
    sweep_boundary_recursive_in_place(function, storage, values, &mut iterator, &dim_list, D-1, dim_sweep)
}