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

use crate::topology::sieve::{traversal_iter::ClosureIter, InMemorySieve, Sieve};

#[test]
fn points_sorted_is_stable() {
    let mut s = InMemorySieve::<u32, ()>::default();
    s.add_arrow(10, 20, ());
    s.add_arrow(30, 20, ());
    let a = s.points_sorted();
    let b = s.points_sorted();
    assert_eq!(a, b);
    let mut expected = vec![10, 20, 30];
    expected.sort();
    assert_eq!(a, expected);
}

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

    let run = || -> Vec<u32> { s.closure_iter_sorted([3, 1, 2]).collect() };
    let a = run();
    let b = run();
    assert_eq!(a, b);
}

#[test]
fn closure_iter_sorted_neighbors_is_lexicographic() {
    let mut s = InMemorySieve::<u32, ()>::default();
    // insert edges in non-lexicographic order
    s.add_arrow(1, 3, ());
    s.add_arrow(1, 2, ());
    s.add_arrow(2, 5, ());
    s.add_arrow(2, 4, ());

    let v: Vec<_> = ClosureIter::new_sorted_neighbors(&s, [1]).collect();
    assert_eq!(v, vec![1, 2, 4, 5, 3]);
}

#[test]
fn points_chart_order_is_height_major() {
    let mut s = InMemorySieve::<u32, ()>::default();
    s.add_arrow(1, 2, ());
    s.add_arrow(2, 4, ());
    s.add_arrow(1, 3, ());
    s.add_arrow(3, 5, ());
    let chart = s.points_chart_order().unwrap();
    assert_eq!(chart, vec![1, 2, 3, 4, 5]);
}