mtl 0.1.5

Matrix template library. Dense2D matrix, SparseMatrix.
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

use num::traits::Zero;

use super::bisect_left;

/*
 Get a single item from LIL matrix.
    Doesn't do output type conversion. Checks for bounds errors.
    Parameters
    ----------
    M, N, rows, datas
        Shape and data arrays for a LIL matrix
    i, j : int
        Indices at which to get
    Returns
    -------
    x
        Value at indices.
 */
pub fn get1<'t, T: Copy>(m: usize, n: usize, rows: &[Vec<usize>], datas: &'t [Vec<T>], i: usize, j: usize) -> Option<&'t T> {
    assert!(i < m, "row index {} out of bounds", i);
    assert!(j < n, "column index {} out of bounds", j);

    let row = &rows[i];
    let data = &datas[i];

    let pos = bisect_left(row, &j);

    if pos != data.len() && row[pos] == j {
        Some(&data[pos])
    } else {
        None
    }
}

pub fn get1_mut<'t, T: Copy>(m: usize, n: usize, rows: &[Vec<usize>], datas: &'t mut [Vec<T>], i: usize, j: usize) -> Option<&'t mut T> {
    assert!(i < m, "row index {} out of bounds", i);
    assert!(j < n, "column index {} out of bounds", j);

    let row = &rows[i];
    let data = &mut datas[i];

    let pos = bisect_left(row, &j);

    if pos != data.len() && row[pos] == j {
        Some(&mut data[pos])
    } else {
        None
    }
}


/*
  Insert a single item to LIL matrix.
    Checks for bounds errors and deletes item if x is zero.
    Parameters
    ----------
    M, N, rows, datas
        Shape and data arrays for a LIL matrix
    i, j : int
        Indices at which to get
    x
        Value to insert.
 */
// TODO add PartialEq
pub fn insert<T: Zero + Copy>(m: usize, n: usize, rows: &mut [Vec<usize>], datas: &mut [Vec<T>], i: usize, j: usize, x: T) {
    assert!(i < m, "row index {} out of bounds", i);
    assert!(j < n, "column index {} out of bounds", j);

    let row = &mut rows[i];
    let data = &mut datas[i];

    let pos = bisect_left(row, &j);
    // if x == Zero::zero() {
    //     if pos < row.len() && row[pos] == j {
    //         row.remove(pos);
    //         data.remove(pos);
    //     }
    // } else {
        if pos == row.len() {
            row.push(j);
            data.push(x);
        } else if row[pos] != j {
            row.insert(pos, j);
            data.insert(pos, x);
        } else {
            data[pos] = x;
        }
//    }
}