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

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

//! Simple interval overlap query structure.

pub struct IntervalSimple {
    pub lo: f32,
    pub hi: f32,
    pub id: usize,
}

pub struct IntervalTreeSimple {
    pub intervals: Vec<IntervalSimple>,
}

pub fn new_interval_tree_simple() -> IntervalTreeSimple {
    IntervalTreeSimple {
        intervals: Vec::new(),
    }
}

pub fn itree_simple_insert(t: &mut IntervalTreeSimple, lo: f32, hi: f32, id: usize) {
    t.intervals.push(IntervalSimple { lo, hi, id });
}

pub fn itree_simple_query_overlaps(t: &IntervalTreeSimple, lo: f32, hi: f32) -> Vec<usize> {
    t.intervals
        .iter()
        .filter(|i| i.lo <= hi && i.hi >= lo)
        .map(|i| i.id)
        .collect()
}

pub fn itree_simple_count_overlaps(t: &IntervalTreeSimple, lo: f32, hi: f32) -> usize {
    t.intervals
        .iter()
        .filter(|i| i.lo <= hi && i.hi >= lo)
        .count()
}

pub fn itree_simple_size(t: &IntervalTreeSimple) -> usize {
    t.intervals.len()
}

pub fn itree_simple_contains_point(t: &IntervalTreeSimple, pt: f32) -> Vec<usize> {
    t.intervals
        .iter()
        .filter(|i| i.lo <= pt && i.hi >= pt)
        .map(|i| i.id)
        .collect()
}

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

    #[test]
    fn test_new_interval_tree_simple() {
        /* empty tree has size 0 */
        let t = new_interval_tree_simple();
        assert_eq!(itree_simple_size(&t), 0);
    }

    #[test]
    fn test_insert_and_size() {
        /* inserting intervals increases size */
        let mut t = new_interval_tree_simple();
        itree_simple_insert(&mut t, 0.0, 5.0, 1);
        itree_simple_insert(&mut t, 3.0, 8.0, 2);
        assert_eq!(itree_simple_size(&t), 2);
    }

    #[test]
    fn test_query_overlaps() {
        /* overlapping interval query returns correct ids */
        let mut t = new_interval_tree_simple();
        itree_simple_insert(&mut t, 0.0, 5.0, 1);
        itree_simple_insert(&mut t, 6.0, 10.0, 2);
        let overlaps = itree_simple_query_overlaps(&t, 4.0, 7.0);
        assert!(overlaps.contains(&1));
        assert!(overlaps.contains(&2));
    }

    #[test]
    fn test_no_overlap() {
        /* non-overlapping intervals not returned */
        let mut t = new_interval_tree_simple();
        itree_simple_insert(&mut t, 0.0, 3.0, 1);
        itree_simple_insert(&mut t, 7.0, 10.0, 2);
        let overlaps = itree_simple_query_overlaps(&t, 4.0, 5.0);
        assert!(overlaps.is_empty());
    }

    #[test]
    fn test_count_overlaps() {
        /* count returns correct number */
        let mut t = new_interval_tree_simple();
        itree_simple_insert(&mut t, 0.0, 10.0, 1);
        itree_simple_insert(&mut t, 5.0, 15.0, 2);
        itree_simple_insert(&mut t, 20.0, 30.0, 3);
        assert_eq!(itree_simple_count_overlaps(&t, 6.0, 7.0), 2);
    }

    #[test]
    fn test_contains_point() {
        /* point query returns intervals that contain the point */
        let mut t = new_interval_tree_simple();
        itree_simple_insert(&mut t, 0.0, 10.0, 1);
        itree_simple_insert(&mut t, 5.0, 15.0, 2);
        itree_simple_insert(&mut t, 20.0, 30.0, 3);
        let ids = itree_simple_contains_point(&t, 7.0);
        assert!(ids.contains(&1) && ids.contains(&2));
        assert!(!ids.contains(&3));
    }

    #[test]
    fn test_point_boundary() {
        /* boundary points are included */
        let mut t = new_interval_tree_simple();
        itree_simple_insert(&mut t, 0.0, 5.0, 1);
        let ids = itree_simple_contains_point(&t, 5.0);
        assert!(ids.contains(&1));
    }
}