kryst 3.2.1

Krylov subspace and preconditioned iterative solvers for dense and sparse linear systems, with shared and distributed memory parallelism.
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

use std::ops::Range;

#[derive(Clone, Default)]
pub struct RowRanges {
    pub spans: Vec<Range<usize>>,
}

impl RowRanges {
    pub fn from_mask(mask: &[bool], value: bool) -> Self {
        let mut spans = Vec::new();
        if mask.is_empty() {
            return Self { spans };
        }
        let mut i = 0usize;
        while i < mask.len() {
            if mask[i] == value {
                let start = i;
                i += 1;
                while i < mask.len() && mask[i] == value {
                    i += 1;
                }
                spans.push(start..i);
            } else {
                i += 1;
            }
        }
        Self { spans }
    }

    pub fn is_empty(&self) -> bool {
        self.spans.is_empty()
    }
}