mesh-sieve 4.0.1

Modular, high-performance Rust library for mesh and data management, designed for scientific computing and PDE codes.
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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171

// Trait-level and minimal separator tests for Sieve
use crate::topology::point::PointId;
use crate::topology::sieve::{InMemorySieve, Sieve};

fn v(i: u64) -> PointId {
    PointId::new(i)
}

#[test]
fn meet_two_triangles_shared_vertices() {
    // Two triangles: 10 (1,2,3), 11 (2,3,4), sharing vertices 2 and 3
    let mut s = InMemorySieve::<PointId, ()>::default();
    // triangle 10
    s.add_arrow(v(10), v(1), ());
    s.add_arrow(v(10), v(2), ());
    s.add_arrow(v(10), v(3), ());
    // triangle 11
    s.add_arrow(v(11), v(2), ());
    s.add_arrow(v(11), v(3), ());
    s.add_arrow(v(11), v(4), ());
    // support edges
    for (src, dsts) in [(v(10), [v(1), v(2), v(3)]), (v(11), [v(2), v(3), v(4)])] {
        for d in dsts {
            s.add_arrow(d, src, ());
        }
    }
    let sep: Vec<_> = s.meet(v(10), v(11)).collect();
    assert!(sep.is_empty());
}

#[test]
fn meet_disjoint_cells() {
    let mut s = InMemorySieve::<PointId, ()>::default();
    s.add_arrow(v(10), v(1), ());
    s.add_arrow(v(10), v(2), ());
    s.add_arrow(v(11), v(3), ());
    s.add_arrow(v(11), v(4), ());
    for (src, dsts) in [(v(10), [v(1), v(2)]), (v(11), [v(3), v(4)])] {
        for d in dsts {
            s.add_arrow(d, src, ());
        }
    }
    let sep: Vec<_> = s.meet(v(10), v(11)).collect();
    assert!(sep.is_empty());
}

#[test]
fn meet_same_cell() {
    let mut s = InMemorySieve::<PointId, ()>::default();
    s.add_arrow(v(10), v(1), ());
    s.add_arrow(v(10), v(2), ());
    for d in [v(1), v(2)] {
        s.add_arrow(d, v(10), ());
    }
    let sep: Vec<_> = s.meet(v(10), v(10)).collect();
    assert!(sep.is_empty());
}

#[test]
fn meet_two_triangles_shared_edge_entity() {
    // Model: triangles 10 (1,2,3), 11 (2,3,4), sharing edge 20 (2,3)
    // Sieve: triangle -> edge(s), edge -> vertex(s)
    let mut s = InMemorySieve::<PointId, ()>::default();
    // triangle 10
    s.add_arrow(v(10), v(21), ()); // edge (1,2)
    s.add_arrow(v(10), v(20), ()); // edge (2,3)
    s.add_arrow(v(10), v(22), ()); // edge (3,1)
                                   // triangle 11
    s.add_arrow(v(11), v(20), ()); // edge (2,3)
    s.add_arrow(v(11), v(23), ()); // edge (3,4)
    s.add_arrow(v(11), v(24), ()); // edge (4,2)
                                   // edge to vertices
    s.add_arrow(v(20), v(2), ());
    s.add_arrow(v(20), v(3), ());
    s.add_arrow(v(21), v(1), ());
    s.add_arrow(v(21), v(2), ());
    s.add_arrow(v(22), v(3), ());
    s.add_arrow(v(22), v(1), ());
    s.add_arrow(v(23), v(3), ());
    s.add_arrow(v(23), v(4), ());
    s.add_arrow(v(24), v(4), ());
    s.add_arrow(v(24), v(2), ());
    // support arrows (optional, for bidirectionality)
    for (src, dsts) in [
        (v(10), vec![v(21), v(20), v(22)]),
        (v(11), vec![v(20), v(23), v(24)]),
        (v(20), vec![v(2), v(3)]),
        (v(21), vec![v(1), v(2)]),
        (v(22), vec![v(3), v(1)]),
        (v(23), vec![v(3), v(4)]),
        (v(24), vec![v(4), v(2)]),
    ] {
        for d in dsts {
            s.add_arrow(d, src, ());
        }
    }
    let sep: Vec<_> = s.meet(v(10), v(11)).collect();
    assert_eq!(sep, vec![]);
}

#[test]
fn meet_two_triangles_shared_edge_entity_refined() {
    // Triangles 10 (1,2,3), 11 (2,3,4), sharing edge 20 (2,3)
    // Only triangles point to edges, and edges point to vertices. No support arrows.
    let mut s = InMemorySieve::<PointId, ()>::default();
    // triangle 10
    s.add_arrow(v(10), v(21), ()); // edge (1,2)
    s.add_arrow(v(10), v(20), ()); // edge (2,3)
    s.add_arrow(v(10), v(22), ()); // edge (3,1)
                                   // triangle 11
    s.add_arrow(v(11), v(20), ()); // edge (2,3)
    s.add_arrow(v(11), v(23), ()); // edge (3,4)
    s.add_arrow(v(11), v(24), ()); // edge (4,2)
                                   // edge to vertices
    s.add_arrow(v(20), v(2), ());
    s.add_arrow(v(20), v(3), ());
    s.add_arrow(v(21), v(1), ());
    s.add_arrow(v(21), v(2), ());
    s.add_arrow(v(22), v(3), ());
    s.add_arrow(v(22), v(1), ());
    s.add_arrow(v(23), v(3), ());
    s.add_arrow(v(23), v(4), ());
    s.add_arrow(v(24), v(4), ());
    s.add_arrow(v(24), v(2), ());
    let sep: Vec<_> = s.meet(v(10), v(11)).collect();
    assert_eq!(sep, vec![]);
}

#[test]
fn join_on_star_graph() {
    // Star: 1→2, 1→3, 1→4
    let mut s = InMemorySieve::<u32, ()>::default();
    s.add_arrow(1, 2, ());
    s.add_arrow(1, 3, ());
    s.add_arrow(1, 4, ());
    let join: Vec<_> = s.join(2, 3).collect();
    // join(2,3) should yield [1,2,3] (closure_both)
    let mut expected = vec![1, 2, 3];
    join.iter().for_each(|x| assert!(expected.contains(x)));
    assert_eq!(join.len(), 3);
}

#[test]
fn meet_and_join_combined() {
    // Two triangles sharing edge 20 (2,3)
    let mut s = InMemorySieve::<u32, ()>::default();
    // triangle 10: 10→21,10→20,10→22; triangle 11: 11→20,11→23,11→24
    s.add_arrow(10, 21, ());
    s.add_arrow(10, 20, ());
    s.add_arrow(10, 22, ());
    s.add_arrow(11, 20, ());
    s.add_arrow(11, 23, ());
    s.add_arrow(11, 24, ());
    // edge to vertices
    s.add_arrow(20, 2, ());
    s.add_arrow(20, 3, ());
    s.add_arrow(21, 1, ());
    s.add_arrow(21, 2, ());
    s.add_arrow(22, 3, ());
    s.add_arrow(22, 1, ());
    s.add_arrow(23, 3, ());
    s.add_arrow(23, 4, ());
    s.add_arrow(24, 4, ());
    s.add_arrow(24, 2, ());
    // meet(10,11) should yield the shared edge {20}
    let sep: Vec<_> = s.meet(10, 11).collect();
    assert_eq!(sep, vec![20]);
    // join(21,20) should yield the shared cell {10}
    let join: Vec<_> = s.join(21, 20).collect();
    assert_eq!(join, vec![10]);
}