amd 0.2.2

Approximate Minimum Degree ordering
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

use crate::amd::*;
use crate::internal::*;
use num_traits::PrimInt;

pub fn valid<I: PrimInt>(n_row: I, n_col: I, a_p: &[I], a_i: &[I]) -> Status {
    if a_p[0] != I::zero() {
        // Column pointers must start at `Ap[0] = 0`, and `Ap[n]` must be `>= 0`.
        debug1_println!("column 0 pointer bad or nz < 0");
        return Status::Invalid;
    }

    let mut status = Status::OK;

    for j in 0..n_col.to_usize().unwrap() {
        let p1 = a_p[j].to_usize().unwrap();
        let p2 = a_p[j + 1].to_usize().unwrap();
        debug2_print!("\nColumn: {} p1: {} p2: {}\n", j, p1, p2);

        if p1 > p2 {
            // Column pointers must be ascending.
            debug1_print!("column {} pointer bad\n", j);
            return Status::Invalid;
        }

        let mut ilast: isize = EMPTY;

        for p in p1..p2 {
            let i = a_i[p].to_isize().unwrap();
            debug3_print!("row: {}\n", i);

            if i < 0 || i >= n_row.to_isize().unwrap() {
                // Row index out of range.
                debug1_print!("index out of range, col {} row {}\n", j, i);
                return Status::Invalid;
            }
            if i <= ilast {
                // Row index unsorted, or duplicate entry present.
                debug1_print!("index unsorted/dupl col {} row {}\n", j, i);
                status = Status::OkButJumbled;
            }
            ilast = i
        }
    }

    status
}