oxihuman-mesh 0.2.1

Mesh processing, topology, and geometry algorithms 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
146
147
148
149

// Copyright (C) 2026 COOLJAPAN OU (Team KitaSan)
// SPDX-License-Identifier: Apache-2.0

#[allow(dead_code)]
#[derive(Debug, Clone)]
pub struct EdgeLoop {
    pub edges: Vec<(u32, u32)>,
    pub closed: bool,
}

#[allow(dead_code)]
#[derive(Debug, Clone)]
pub struct EdgeLoopConfig {
    pub max_length: usize,
}

#[allow(dead_code)]
pub fn default_edge_loop_config() -> EdgeLoopConfig {
    EdgeLoopConfig { max_length: 256 }
}

#[allow(dead_code)]
pub fn new_edge_loop() -> EdgeLoop {
    EdgeLoop { edges: Vec::new(), closed: false }
}

#[allow(dead_code)]
pub fn el_add_edge(loop_: &mut EdgeLoop, a: u32, b: u32) {
    loop_.edges.push((a, b));
}

#[allow(dead_code)]
pub fn el_edge_count(loop_: &EdgeLoop) -> usize {
    loop_.edges.len()
}

#[allow(dead_code)]
pub fn el_is_closed(loop_: &EdgeLoop) -> bool {
    loop_.closed
}

#[allow(dead_code)]
pub fn el_close_loop(loop_: &mut EdgeLoop) {
    loop_.closed = true;
}

#[allow(dead_code)]
pub fn el_reverse(loop_: &mut EdgeLoop) {
    loop_.edges.reverse();
    for e in &mut loop_.edges {
        *e = (e.1, e.0);
    }
}

#[allow(dead_code)]
pub fn el_to_json(loop_: &EdgeLoop) -> String {
    format!(
        r#"{{"edge_count":{},"closed":{}}}"#,
        loop_.edges.len(),
        loop_.closed
    )
}

#[allow(dead_code)]
pub fn el_contains_vertex(loop_: &EdgeLoop, v: u32) -> bool {
    loop_.edges.iter().any(|&(a, b)| a == v || b == v)
}

#[allow(dead_code)]
pub fn el_vertex_count(loop_: &EdgeLoop) -> usize {
    let mut verts: Vec<u32> = Vec::new();
    for &(a, b) in &loop_.edges {
        if !verts.contains(&a) {
            verts.push(a);
        }
        if !verts.contains(&b) {
            verts.push(b);
        }
    }
    verts.len()
}

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

    #[test]
    fn test_default_config() {
        let cfg = default_edge_loop_config();
        assert_eq!(cfg.max_length, 256);
    }

    #[test]
    fn test_new_loop_empty() {
        let lp = new_edge_loop();
        assert_eq!(el_edge_count(&lp), 0);
        assert!(!el_is_closed(&lp));
    }

    #[test]
    fn test_add_edge() {
        let mut lp = new_edge_loop();
        el_add_edge(&mut lp, 0, 1);
        el_add_edge(&mut lp, 1, 2);
        assert_eq!(el_edge_count(&lp), 2);
    }

    #[test]
    fn test_close_loop() {
        let mut lp = new_edge_loop();
        el_close_loop(&mut lp);
        assert!(el_is_closed(&lp));
    }

    #[test]
    fn test_contains_vertex() {
        let mut lp = new_edge_loop();
        el_add_edge(&mut lp, 3, 7);
        assert!(el_contains_vertex(&lp, 3));
        assert!(el_contains_vertex(&lp, 7));
        assert!(!el_contains_vertex(&lp, 99));
    }

    #[test]
    fn test_vertex_count() {
        let mut lp = new_edge_loop();
        el_add_edge(&mut lp, 0, 1);
        el_add_edge(&mut lp, 1, 2);
        assert_eq!(el_vertex_count(&lp), 3);
    }

    #[test]
    fn test_reverse() {
        let mut lp = new_edge_loop();
        el_add_edge(&mut lp, 0, 1);
        el_add_edge(&mut lp, 1, 2);
        el_reverse(&mut lp);
        assert_eq!(lp.edges[0], (2, 1));
    }

    #[test]
    fn test_to_json() {
        let mut lp = new_edge_loop();
        el_add_edge(&mut lp, 0, 1);
        let j = el_to_json(&lp);
        assert!(j.contains("edge_count"));
        assert!(j.contains("closed"));
    }
}