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
117
118
119
120

use std::ops::{Deref, DerefMut};

use serde::{Deserialize, Deserializer, Serialize, Serializer};


#[derive(Default, Clone, Debug, Serialize, Deserialize)]
#[cfg_attr(feature = "rkyv", derive(rkyv::Archive, rkyv::Serialize, rkyv::Deserialize))]
pub(crate) struct NodeAdjacencyData
{
    pub(crate) zero_index: usize,
    pub(crate) data: Vec<NodeAdjacencyInner>,
    pub(crate) left_zero: Vec<u32>,
    pub(crate) right_zero: Vec<u32>,
}

impl Deref for NodeAdjacencyData
{
    type Target=Vec<NodeAdjacencyInner>;

    fn deref(&self) -> &Self::Target {
        &self.data
    }
}

impl DerefMut for NodeAdjacencyData
{
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.data
    }
}


/// Legacy type alias for compatibility - now just the inner bitfield
pub(crate) type NodeAdjacency = NodeAdjacencyInner;


use bitfield_struct::bitfield;

#[bitfield(u128)]
#[derive(PartialEq, Eq)]
pub(crate) struct NodeAdjacencyInner {
    #[bits(32)]
    pub(crate) level_one: u32,
    #[bits(31)]
    pub(crate) up: i64,
    #[bits(31)]
    pub(crate) down_left: i64,
    #[bits(32)]
    pub(crate) down_right: i64,
    #[bits(1)]
    pub(crate) has_parent: bool,
    #[bits(1)]
    pub(crate) is_leaf: bool,
}
impl NodeAdjacencyInner
{ 
    #[inline]
    pub fn is_complete(&self) -> bool {
        self.has_left_child() && self.has_right_child() && self.has_parent()
    }
    
    #[inline]
    pub fn has_left_child(&self) -> bool {
        self.down_left() != 0
    }
    
    #[inline]
    pub fn has_right_child(&self) -> bool {
        self.down_right() != 0
    }
}

// Serialize Implementation
impl Serialize for NodeAdjacencyInner {
    fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
    {
        // Serialize as a single `u128` field
        serializer.serialize_u128(self.0)
    }
}

// Deserialize Implementation
impl<'de> Deserialize<'de> for NodeAdjacencyInner {
    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
    where
        D: Deserializer<'de>,
    {
        let raw = u128::deserialize(deserializer)?;
        Ok(Self(raw))
    }
}

// rkyv implementations for NodeAdjacencyInner (bitfield type)
#[cfg(feature = "rkyv")]
mod rkyv_impl {
    use super::NodeAdjacencyInner;
    
    impl rkyv::Archive for NodeAdjacencyInner {
        type Archived = rkyv::rend::u128_le;
        type Resolver = ();

        fn resolve(&self, _resolver: Self::Resolver, out: rkyv::Place<Self::Archived>) {
            out.write(rkyv::rend::u128_le::from_native(self.0));
        }
    }

    impl<S: rkyv::rancor::Fallible + ?Sized> rkyv::Serialize<S> for NodeAdjacencyInner {
        fn serialize(&self, _serializer: &mut S) -> Result<Self::Resolver, S::Error> {
            Ok(())
        }
    }

    impl<D: rkyv::rancor::Fallible + ?Sized> rkyv::Deserialize<NodeAdjacencyInner, D> for rkyv::rend::u128_le {
        fn deserialize(&self, _deserializer: &mut D) -> Result<NodeAdjacencyInner, D::Error> {
            Ok(NodeAdjacencyInner(self.to_native()))
        }
    }
}