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

use crate::topology::sieve::{InMemoryOrientedSieve, InMemorySieve, Sieve};

#[test]
fn remove_point_scrubs_both_sides_and_preserves_presence() {
    let mut s = InMemorySieve::<u32, ()>::default();

    s.add_point(1);
    s.add_point(2);
    s.add_point(3);

    s.add_arrow(1, 2, ());
    s.add_arrow(2, 3, ());

    assert_eq!(s.cone(1).count(), 1);
    assert_eq!(s.support(3).count(), 1);

    s.remove_point(2);

    assert!(s.cone(1).next().is_none());
    assert!(s.support(3).next().is_none());

    assert!(s.adjacency_out.contains_key(&2));
    assert!(s.adjacency_in.contains_key(&2));
    assert!(s.adjacency_out.contains_key(&1));
    assert!(s.adjacency_in.contains_key(&3));
}

#[test]
fn remove_base_point_removes_outgoing_and_base_key() {
    let mut s = InMemorySieve::<u32, ()>::default();
    s.add_arrow(1, 2, ());
    s.add_arrow(1, 3, ());
    s.add_arrow(4, 1, ());

    s.remove_base_point(1);

    assert!(!s.adjacency_out.contains_key(&1));
    for ins in s.adjacency_in.values() {
        assert!(ins.iter().all(|(src, _)| *src != 1));
    }
    assert!(s.adjacency_in.get(&1).is_some());
    assert_eq!(s.support(1).count(), 1);
}

#[test]
fn remove_cap_point_removes_incoming_and_cap_key() {
    let mut s = InMemorySieve::<u32, ()>::default();
    s.add_arrow(1, 2, ());
    s.add_arrow(3, 2, ());
    s.add_arrow(2, 5, ());

    s.remove_cap_point(2);

    assert!(!s.adjacency_in.contains_key(&2));
    for outs in s.adjacency_out.values() {
        assert!(outs.iter().all(|(dst, _)| *dst != 2));
    }
    assert!(s.adjacency_out.get(&2).is_some());
    assert_eq!(s.cone(2).count(), 1);
}

#[test]
fn oriented_remove_point_scrubs_both_sides_and_preserves_presence() {
    let mut s = InMemoryOrientedSieve::<u32, ()>::default();

    s.add_point(1);
    s.add_point(2);
    s.add_point(3);

    s.add_arrow(1, 2, ());
    s.add_arrow(2, 3, ());

    assert_eq!(s.cone(1).count(), 1);
    assert_eq!(s.support(3).count(), 1);

    s.remove_point(2);

    assert!(s.cone(1).next().is_none());
    assert!(s.support(3).next().is_none());

    assert!(s.adjacency_out.contains_key(&2));
    assert!(s.adjacency_in.contains_key(&2));
    assert!(s.adjacency_out.contains_key(&1));
    assert!(s.adjacency_in.contains_key(&3));
}