grid_trait 0.1.1

2D and 3D grids with combinators.
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

//! Map-with index, aka. enumap, because it's like enumerate + map.

use crate::grid3::*;
use mint::Vector3;
use std::marker::PhantomData;

pub struct Grid3EnuMap<G, F, T, I> 
where
    G: Grid3,
    I: From<Vector3<i32>>,
    F: Fn(I, <G as Grid3>::Item) -> T,
{
    inner: G,
    func: F,
    p: PhantomData<fn(T, I)>
}

impl<G, F, T, I> Grid3EnuMap<G, F, T, I>
where
    G: Grid3,
    I: From<Vector3<i32>>,
    F: Fn(I, <G as Grid3>::Item) -> T,
{
    pub fn new(inner: G, func: F) -> Self {
        Grid3EnuMap {
            inner,
            func,
            p: PhantomData,
        }
    }
}

impl<G, F, T, I> Grid3 for Grid3EnuMap<G, F, T, I>
where
    G: Grid3,
    I: From<Vector3<i32>>,
    F: Fn(I, <G as Grid3>::Item) -> T,
{
    type Item = T;
    type XBound = <G as Grid3>::XBound;
    type YBound = <G as Grid3>::YBound;
    type ZBound = <G as Grid3>::ZBound;
    
    fn x_bound(&self) -> Self::XBound { self.inner.x_bound() }
    fn y_bound(&self) -> Self::YBound { self.inner.y_bound() }
    fn z_bound(&self) -> Self::ZBound { self.inner.z_bound() }
}

impl<G, F, T, I> Grid3Len for Grid3EnuMap<G, F, T, I>
where
    G: Grid3 + Grid3Len,
    I: From<Vector3<i32>>,
    F: Fn(I, <G as Grid3>::Item) -> T,
{}

impl<G, F, T, I> Grid3Get for Grid3EnuMap<G, F, T, I>
where
    G: Grid3 + Grid3Get,
    I: From<Vector3<i32>>,
    F: Fn(I, <G as Grid3>::Item) -> T,
{
    fn get<C>(&self, coord: C) -> Self::Item
    where
        C: Into<Vector3<i32>>
    {
        let coord = coord.into();
        (self.func)(I::from(coord), self.inner.get(coord))
    }
}