sukker 2.0.1

Linear Algebra and Matrices made easy!
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

use std::collections::HashMap;
use sukker::{SparseMatrix, SparseMatrixData};

fn old() {
    let matrix = SparseMatrix::<i32>::eye(100);

    println!("Sparcity: {}", matrix.sparcity());

    // matrix.print(3);

    let sparse1 = SparseMatrix::<i32>::eye(3);
    let sparse2 = SparseMatrix::<i32>::eye(3);

    let res = sparse1.add(&sparse2).unwrap();

    assert_eq!(res.shape(), (3, 3));
    assert_eq!(res.get(0, 0).unwrap(), 2);
    assert_eq!(res.get(1, 1).unwrap(), 2);
    assert_eq!(res.get(2, 2).unwrap(), 2);
    assert_eq!(res.get(1, 2).unwrap(), 0);

    println!("{}", res);
    res.print(5);
}

fn main() {
    let mut indexes: SparseMatrixData<f64> = HashMap::new();

    indexes.insert((0, 1), 2.0);
    indexes.insert((1, 0), 4.0);
    indexes.insert((2, 3), 6.0);
    indexes.insert((3, 3), 8.0);

    let sparse = SparseMatrix::<f64>::init(indexes, (4, 4));

    let mut indexes2: SparseMatrixData<f64> = HashMap::new();

    indexes2.insert((0, 0), 2.0);
    indexes2.insert((1, 0), 4.0);
    indexes2.insert((1, 1), 8.0);
    indexes2.insert((2, 3), 6.0);

    let sparse2 = SparseMatrix::<f64>::init(indexes2, (4, 4));

    let res = sparse.add(&sparse2).unwrap();

    res.print(3);

    assert_eq!(res.at(0, 0), 2.0);
    assert_eq!(res.at(0, 1), 2.0);
    assert_eq!(res.at(1, 0), 8.0);
    assert_eq!(res.at(1, 1), 8.0);
    assert_eq!(res.at(2, 3), 12.0);
    assert_eq!(res.at(3, 3), 8.0);
    assert_eq!(res.at(2, 2), 0f64);
}