csr_matrix 0.1.0

Simple implementation of a generic Compressed Sparse Row (CSR) matrix.
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 csr_matrix::CsrMatrixBuilder;
use itertools::Itertools;

#[test]
fn test_row_iter() {
    let m = 3;
    let n = 3;

    let matrix = {
        let mut builder = CsrMatrixBuilder::<usize>::new(m, n);

        builder.add_entry(0, 0, 0);
        builder.add_entry(1, 1, 1);
        builder.add_entry(2, 2, 2);

        builder.build()
    };

    for i in 0..m {
        let mut row_iter = matrix.row_iter(i);
        assert_eq!(Some(&(i, i)), row_iter.next());
        assert!(row_iter.next().is_none());
    }
}

#[test]
fn test_entries_iter() {
    let m = 9;
    let n = 9;

    for permutation in (0..m).permutations(m) {
        test_entries_iter_helper(m, n, permutation);
    }
}

fn test_entries_iter_helper(m: usize, n: usize, permutation: Vec<usize>) {
    let matrix = {
        let mut builder = CsrMatrixBuilder::<usize>::new(m, n);

        for i in permutation.into_iter() {
            builder.add_entry(i, i, i);
        }

        builder.build()
    };

    let mut entries_iter = matrix.entries_iter();
    for i in 0..m {
        assert_eq!(Some((i, &(i, i))), entries_iter.next());
    }
    assert_eq!(None, entries_iter.next());
}