octarr 0.1.0

Octarr is a dynamic cubic octree capable of storing class data, accessed via indexers
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::octant_id::OctantId;
#[cfg(feature = "parallel")]
use rayon::prelude::*;
use serde::{Deserialize, Serialize};

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct OctNode<T: Send + Clone> {
    pub data: Option<T>,
    pub sub_nodes: Vec<OctNode<T>>,
    pub position: [i128; 3],
    pub size: u64,
}

impl<T: Send + Clone> OctNode<T> {
    pub fn new(&self, position: [i128; 3], size: u64) -> Self {
        Self {
            data: self.data.clone(),
            sub_nodes: Vec::new(),
            position,
            size,
        }
    }

    pub fn len(&self) -> usize {
        1 + self
            .sub_nodes
            .iter()
            .map(|node| node.len())
            .reduce(|acc, len| acc + len)
            .unwrap_or_default()
    }

    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }

    pub fn set(&mut self, node: &mut Self) {
        std::mem::swap(self, node);
    }

    pub fn is_leaf(&self) -> bool {
        self.sub_nodes.is_empty()
    }

    pub const fn half_size(&self) -> u64 {
        self.size / 2
    }

    pub fn subdivide(&mut self, amount: u32) {
        if self.is_leaf() && self.size > 1 {
            for i in 0..8 {
                let position = self.get_octant(&OctantId::with_index(i));
                self.sub_nodes.push(self.new(position, self.half_size()));
            }
        }

        #[cfg(feature = "parallel")]
        if amount > 1 {
            self.sub_nodes
                .par_iter_mut()
                .for_each(|node| node.subdivide(amount - 1));
        }
        #[cfg(not(feature = "parallel"))]
        if amount > 1 {
            self.sub_nodes
                .iter_mut()
                .for_each(|node| node.subdivide(amount - 1));
        }
    }

    pub fn remove_leaves(&mut self, recursive: bool) {
        if self.is_leaf() {
            return;
        }

        #[cfg(feature = "parallel")]
        if recursive {
            self.sub_nodes
                .par_iter_mut()
                .for_each(|node| node.remove_leaves(true));
        }
        #[cfg(not(feature = "parallel"))]
        if recursive {
            self.sub_nodes
                .iter_mut()
                .for_each(|node| node.remove_leaves(true));
        }

        for node in &self.sub_nodes {
            if !node.is_leaf() || node.data.is_some() {
                return;
            }
        }

        self.sub_nodes.clear();
    }

    pub fn get_octant_at(&self, position: &[i128; 3]) -> OctantId {
        let mut octant = OctantId::new();
        for (i, pos) in position.iter().enumerate() {
            if pos > &(self.position[i] + self.half_size() as i128) {
                octant.set_true(i);
            }
        }

        octant
    }

    pub fn get_octant(&self, octant: &OctantId) -> [i128; 3] {
        [
            self.position[0] + (octant.x() as i128 * self.half_size() as i128),
            self.position[1] + (octant.y() as i128 * self.half_size() as i128),
            self.position[2] + (octant.z() as i128 * self.half_size() as i128),
        ]
    }
}