oxihuman-core 0.1.2

Core data structures, algorithms, and asset management for OxiHuman
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145

#![allow(dead_code)]
// Copyright (C) 2026 COOLJAPAN OU (Team KitaSan)
// SPDX-License-Identifier: Apache-2.0

//! 2D AABB tree for spatial queries.

#[allow(dead_code)]
#[derive(Debug, Clone)]
pub struct AabbNode2 {
    pub min: [f32; 2],
    pub max: [f32; 2],
    pub id: u32,
    pub left: Option<usize>,
    pub right: Option<usize>,
}

#[allow(dead_code)]
#[derive(Debug, Clone, Default)]
pub struct AabbTree2 {
    pub nodes: Vec<AabbNode2>,
}

#[allow(dead_code)]
pub fn new_aabb_tree2() -> AabbTree2 {
    AabbTree2 { nodes: Vec::new() }
}

#[allow(dead_code)]
pub fn aabb2_insert(tree: &mut AabbTree2, min: [f32; 2], max: [f32; 2], id: u32) -> usize {
    let idx = tree.nodes.len();
    tree.nodes.push(AabbNode2 {
        min,
        max,
        id,
        left: None,
        right: None,
    });
    idx
}

#[allow(dead_code)]
pub fn aabb2_query_point(tree: &AabbTree2, pt: [f32; 2]) -> Vec<u32> {
    tree.nodes
        .iter()
        .filter(|n| {
            (n.min[0]..=n.max[0]).contains(&pt[0]) && (n.min[1]..=n.max[1]).contains(&pt[1])
        })
        .map(|n| n.id)
        .collect()
}

#[allow(dead_code)]
pub fn aabb2_overlaps(
    a_min: [f32; 2],
    a_max: [f32; 2],
    b_min: [f32; 2],
    b_max: [f32; 2],
) -> bool {
    a_min[0] <= b_max[0]
        && a_max[0] >= b_min[0]
        && a_min[1] <= b_max[1]
        && a_max[1] >= b_min[1]
}

#[allow(dead_code)]
pub fn aabb2_node_count(tree: &AabbTree2) -> usize {
    tree.nodes.len()
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_new_tree_empty() {
        let tree = new_aabb_tree2();
        assert_eq!(aabb2_node_count(&tree), 0);
    }

    #[test]
    fn test_insert_returns_index() {
        let mut tree = new_aabb_tree2();
        let idx = aabb2_insert(&mut tree, [0.0, 0.0], [1.0, 1.0], 42);
        assert_eq!(idx, 0);
    }

    #[test]
    fn test_node_count_after_insert() {
        let mut tree = new_aabb_tree2();
        aabb2_insert(&mut tree, [0.0, 0.0], [1.0, 1.0], 1);
        aabb2_insert(&mut tree, [2.0, 2.0], [3.0, 3.0], 2);
        assert_eq!(aabb2_node_count(&tree), 2);
    }

    #[test]
    fn test_query_point_hit() {
        let mut tree = new_aabb_tree2();
        aabb2_insert(&mut tree, [0.0, 0.0], [2.0, 2.0], 7);
        let hits = aabb2_query_point(&tree, [1.0, 1.0]);
        assert!(hits.contains(&7));
    }

    #[test]
    fn test_query_point_miss() {
        let mut tree = new_aabb_tree2();
        aabb2_insert(&mut tree, [0.0, 0.0], [1.0, 1.0], 5);
        let hits = aabb2_query_point(&tree, [5.0, 5.0]);
        assert!(hits.is_empty());
    }

    #[test]
    fn test_query_point_boundary() {
        let mut tree = new_aabb_tree2();
        aabb2_insert(&mut tree, [0.0, 0.0], [1.0, 1.0], 3);
        let hits = aabb2_query_point(&tree, [1.0, 1.0]);
        assert!(hits.contains(&3));
    }

    #[test]
    fn test_overlaps_true() {
        assert!(aabb2_overlaps([0.0, 0.0], [2.0, 2.0], [1.0, 1.0], [3.0, 3.0]));
    }

    #[test]
    fn test_overlaps_false() {
        assert!(!aabb2_overlaps([0.0, 0.0], [1.0, 1.0], [2.0, 2.0], [3.0, 3.0]));
    }

    #[test]
    fn test_overlaps_touching() {
        assert!(aabb2_overlaps([0.0, 0.0], [1.0, 1.0], [1.0, 0.0], [2.0, 1.0]));
    }

    #[test]
    fn test_multiple_hits() {
        let mut tree = new_aabb_tree2();
        aabb2_insert(&mut tree, [0.0, 0.0], [3.0, 3.0], 10);
        aabb2_insert(&mut tree, [1.0, 1.0], [4.0, 4.0], 11);
        aabb2_insert(&mut tree, [5.0, 5.0], [6.0, 6.0], 12);
        let hits = aabb2_query_point(&tree, [2.0, 2.0]);
        assert_eq!(hits.len(), 2);
        assert!(hits.contains(&10));
        assert!(hits.contains(&11));
    }
}