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

use crate::topology::labels::{LabelSet, propagate_label_set_closure, propagate_label_set_star};
use crate::topology::point::PointId;
use crate::topology::sieve::InMemorySieve;
use crate::topology::sieve::sieve_trait::Sieve;

#[test]
fn label_set_roundtrip() {
    let mut labels = LabelSet::new();
    let p1 = PointId::new(1).unwrap();
    let p2 = PointId::new(2).unwrap();

    assert_eq!(labels.set_label(p1, "boundary", 7), None);
    assert_eq!(labels.set_label(p2, "boundary", 7), None);
    assert_eq!(labels.set_label(p1, "material", 3), None);

    assert_eq!(labels.get_label(p1, "boundary"), Some(7));
    assert_eq!(labels.get_label(p2, "boundary"), Some(7));
    assert_eq!(labels.get_label(p1, "material"), Some(3));
    assert_eq!(labels.get_label(p2, "material"), None);

    let mut pts: Vec<_> = labels.points_with_label("boundary", 7).collect();
    pts.sort_unstable();
    assert_eq!(pts, vec![p1, p2]);
}

#[test]
fn label_set_strata_and_values() {
    let mut labels = LabelSet::new();
    let p1 = PointId::new(10).unwrap();
    let p2 = PointId::new(4).unwrap();
    let p3 = PointId::new(7).unwrap();
    let p4 = PointId::new(2).unwrap();

    labels.set_label(p1, "phase", 2);
    labels.set_label(p2, "phase", 1);
    labels.set_label(p3, "phase", 2);
    labels.set_label(p4, "phase", 1);

    assert_eq!(labels.stratum_size("phase", 2), 2);
    assert_eq!(labels.stratum_points("phase", 2), vec![p3, p1]);
    assert_eq!(labels.stratum_values("phase"), vec![1, 2]);
    assert_eq!(labels.values("phase"), vec![1, 2]);
}

#[test]
fn label_set_clear_label_value() {
    let mut labels = LabelSet::new();
    let p1 = PointId::new(1).unwrap();
    let p2 = PointId::new(2).unwrap();
    let p3 = PointId::new(3).unwrap();

    labels.set_label(p1, "boundary", 5);
    labels.set_label(p2, "boundary", 9);
    labels.set_label(p3, "boundary", 5);
    labels.set_label(p1, "material", 1);

    assert_eq!(labels.clear_label_value("boundary", 5), 2);
    assert_eq!(labels.get_label(p1, "boundary"), None);
    assert_eq!(labels.get_label(p3, "boundary"), None);
    assert_eq!(labels.get_label(p2, "boundary"), Some(9));
    assert_eq!(labels.values("boundary"), vec![9]);

    assert_eq!(labels.clear_label_value("boundary", 9), 1);
    assert_eq!(labels.values("boundary"), Vec::<i32>::new());
    assert_eq!(labels.get_label(p1, "material"), Some(1));
}

#[test]
fn label_set_range_queries_and_set_ops() {
    let mut left = LabelSet::new();
    let mut right = LabelSet::new();
    let p1 = PointId::new(1).unwrap();
    let p2 = PointId::new(2).unwrap();
    let p3 = PointId::new(3).unwrap();
    let p4 = PointId::new(4).unwrap();

    left.set_label(p1, "region", 1);
    left.set_label(p2, "region", 2);
    left.set_label(p3, "region", 3);
    right.set_label(p2, "region", 2);
    right.set_label(p4, "region", 2);

    assert_eq!(left.stratum_points_in_range("region", 2..=3), vec![p2, p3]);
    assert_eq!(left.stratum_union(&right, "region", 2), vec![p2, p4]);
    assert_eq!(left.stratum_intersection(&right, "region", 2), vec![p2]);
    assert_eq!(
        left.stratum_difference(&right, "region", 2),
        Vec::<PointId>::new()
    );
}

#[test]
fn label_propagation_closure_and_star() {
    let mut sieve = InMemorySieve::<PointId, ()>::default();
    let cell = PointId::new(10).unwrap();
    let face = PointId::new(20).unwrap();
    let vertex = PointId::new(30).unwrap();

    sieve.add_arrow(cell, face, ());
    sieve.add_arrow(face, vertex, ());

    let mut labels = LabelSet::new();
    labels.set_label(face, "boundary", 1);
    labels.set_label(vertex, "seed", 9);

    let closure_labels = propagate_label_set_closure(&sieve, &labels);
    let mut boundary_pts = closure_labels.stratum_points("boundary", 1);
    boundary_pts.sort_unstable();
    assert_eq!(boundary_pts, vec![face, vertex]);

    let star_labels = propagate_label_set_star(&sieve, &labels);
    let mut seed_pts = star_labels.stratum_points("seed", 9);
    seed_pts.sort_unstable();
    assert_eq!(seed_pts, vec![cell, face, vertex]);
}

#[test]
fn label_algebra_and_remap_and_seed_propagation() {
    let mut sieve = InMemorySieve::<PointId, ()>::default();
    let c = PointId::new(1).unwrap();
    let f = PointId::new(2).unwrap();
    let v = PointId::new(3).unwrap();
    sieve.add_arrow(c, f, ());
    sieve.add_arrow(f, v, ());

    let mut a = LabelSet::new();
    let mut b = LabelSet::new();
    a.set_label(f, "bd", 1);
    b.set_label(v, "bd", 1);

    a.apply_to_closure(&sieve, "seed", 9, [f]);
    assert_eq!(a.stratum_points("seed", 9), vec![f, v]);
    a.apply_to_star(&sieve, "seed", 10, [v]);
    assert_eq!(a.stratum_points("seed", 10), vec![c, f, v]);

    a.union_into(&b, "bd", 1, "bd", 1);
    assert_eq!(a.stratum_points("bd", 1), vec![f, v]);
    a.intersect_with(&b, "bd", 1, "bd", 1);
    assert_eq!(a.stratum_points("bd", 1), vec![v]);
    a.subtract(&b, "bd", 1, "bd", 1);
    assert!(a.stratum_points("bd", 1).is_empty());

    b.remap_value("bd", 1, 5);
    assert_eq!(b.stratum_points("bd", 5), vec![v]);
}