libmf 0.4.0

Large-scale sparse matrix factorization for Rust
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
53
54
55
56
57
58

use crate::bindings::MfNode;
use alloc::vec::Vec;

/// A matrix.
pub struct Matrix {
    pub(crate) data: Vec<MfNode>,
}

impl Matrix {
    /// Creates a new matrix.
    pub fn new() -> Self {
        Self { data: Vec::new() }
    }

    /// Creates a new matrix with a minimum capacity.
    pub fn with_capacity(capacity: usize) -> Self {
        Self {
            data: Vec::with_capacity(capacity),
        }
    }

    /// Returns if the matrix is empty.
    pub fn is_empty(&self) -> bool {
        self.data.is_empty()
    }

    /// Adds a value to the matrix.
    pub fn push(&mut self, row_index: i32, column_index: i32, value: f32) {
        self.data.push(MfNode {
            u: row_index,
            v: column_index,
            r: value,
        });
    }
}

impl Default for Matrix {
    fn default() -> Self {
        Self::new()
    }
}

#[cfg(test)]
mod tests {
    use crate::Matrix;

    #[test]
    fn test_new() {
        let mut data = Matrix::new();
        data.push(0, 0, 1.0);
    }

    #[test]
    fn test_with_capacity() {
        let mut data = Matrix::with_capacity(1);
        data.push(0, 0, 1.0);
    }
}