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

use super::*;
#[path = "partition_property_tests.rs"]
mod partition_property_tests;

#[derive(Debug)]
struct DummyGraph;
impl PartitionableGraph for DummyGraph {
    type VertexId = usize;
    type VertexParIter<'a> = rayon::vec::IntoIter<usize>;
    type NeighParIter<'a> = rayon::vec::IntoIter<usize>;
    type NeighIter<'a> = std::vec::IntoIter<usize>;

    fn vertices(&self) -> Self::VertexParIter<'_> {
        vec![0, 1, 2, 3].into_par_iter()
    }
    fn neighbors(&self, _v: Self::VertexId) -> Self::NeighParIter<'_> {
        Vec::new().into_par_iter()
    }
    fn neighbors_seq(&self, _v: Self::VertexId) -> Self::NeighIter<'_> {
        Vec::new().into_iter()
    }
    fn degree(&self, _v: Self::VertexId) -> usize {
        0
    }
    fn edges(&self) -> rayon::vec::IntoIter<(usize, usize)> {
        Vec::new().into_par_iter()
    }
}

#[test]
fn trivial_partition_compiles() {
    let g = DummyGraph;
    let cfg = PartitionerConfig {
        n_parts: 2,
        ..Default::default()
    };
    match partition(&g, &cfg) {
        Ok(pm) => assert_eq!(pm.len(), 4),
        Err(PartitionerError::NoPositiveMerge) => {}
        Err(e) => panic!("Unexpected error: {:?}", e),
    }
}