rustebra 0.3.1

A hybrid no_std/alloc linear algebra crate for Rust, scaling from embedded targets to dynamic Krylov subspace solvers.
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
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184

use rustebra::sparse::{CooMatrix, CsrMatrix, coo_to_csr, csr_to_coo};

// ── coo_to_csr ──────────────────────────────────────────────────────────────

#[test]
fn coo_to_csr_basic_no_duplicates() {
    // 3×3 diagonal: entries are supplied out of row-order to verify sorting.
    let coo = CooMatrix::new(3, 3, vec![2, 0, 1], vec![2, 0, 1], vec![3.0_f64, 1.0, 2.0]).unwrap();

    let csr = coo_to_csr(coo);
    assert_eq!(csr.rows(), 3);
    assert_eq!(csr.cols(), 3);
    assert_eq!(csr.nnz(), 3);
    assert_eq!(csr.row_ptr(), &[0, 1, 2, 3]);
    assert_eq!(csr.col_indices(), &[0, 1, 2]);
    assert_eq!(csr.values(), &[1.0, 2.0, 3.0]);
}

#[test]
fn coo_to_csr_sums_duplicate_positions() {
    // (0,0) appears three times; the values must be summed.
    let coo = CooMatrix::new(
        2,
        2,
        vec![0, 0, 0, 1],
        vec![0, 0, 0, 1],
        vec![1.0_f64, 2.0, 4.0, 9.0],
    )
    .unwrap();

    let csr = coo_to_csr(coo);
    assert_eq!(csr.nnz(), 2);
    assert_eq!(csr.row_ptr(), &[0, 1, 2]);
    assert_eq!(csr.col_indices(), &[0, 1]);
    assert_eq!(csr.values(), &[7.0, 9.0]); // 1 + 2 + 4 = 7
}

#[test]
fn coo_to_csr_empty_coo_gives_empty_csr() {
    let coo = CooMatrix::<f64>::new(4, 5, vec![], vec![], vec![]).unwrap();
    let csr = coo_to_csr(coo);
    assert_eq!(csr.rows(), 4);
    assert_eq!(csr.cols(), 5);
    assert_eq!(csr.nnz(), 0);
    assert_eq!(csr.row_ptr(), &[0, 0, 0, 0, 0]);
}

#[test]
fn coo_to_csr_zero_row_matrix() {
    let coo = CooMatrix::<f64>::new(0, 3, vec![], vec![], vec![]).unwrap();
    let csr = coo_to_csr(coo);
    assert_eq!(csr.rows(), 0);
    assert_eq!(csr.nnz(), 0);
    assert_eq!(csr.row_ptr(), &[0]);
}

#[test]
fn coo_to_csr_matrix_with_empty_rows() {
    // Row 1 has no entries.
    let coo = CooMatrix::new(3, 3, vec![0, 2], vec![1, 0], vec![5.0_f64, 8.0]).unwrap();
    let csr = coo_to_csr(coo);
    assert_eq!(csr.row_ptr(), &[0, 1, 1, 2]);
    assert_eq!(csr.col_indices(), &[1, 0]);
    assert_eq!(csr.values(), &[5.0, 8.0]);
}

#[test]
fn coo_to_csr_out_of_order_same_row_entries_are_sorted_by_col() {
    // Two entries in row 0: col 2 given before col 0.
    let coo = CooMatrix::new(1, 3, vec![0, 0], vec![2, 0], vec![9.0_f64, 3.0]).unwrap();
    let csr = coo_to_csr(coo);
    assert_eq!(csr.row_ptr(), &[0, 2]);
    assert_eq!(csr.col_indices(), &[0, 2]);
    assert_eq!(csr.values(), &[3.0, 9.0]);
}

// ── csr_to_coo ──────────────────────────────────────────────────────────────

#[test]
fn csr_to_coo_basic() {
    let csr = CsrMatrix::new(
        3,
        3,
        vec![0, 1, 2, 3],
        vec![0, 1, 2],
        vec![1.0_f64, 2.0, 3.0],
    )
    .unwrap();

    let coo = csr_to_coo(csr);
    assert_eq!(coo.rows(), 3);
    assert_eq!(coo.cols(), 3);
    assert_eq!(coo.nnz(), 3);
    assert_eq!(coo.row_indices(), &[0, 1, 2]);
    assert_eq!(coo.col_indices(), &[0, 1, 2]);
    assert_eq!(coo.values(), &[1.0, 2.0, 3.0]);
}

#[test]
fn csr_to_coo_with_empty_rows() {
    // Row 1 is empty; row 2 has two entries.
    let csr = CsrMatrix::new(
        3,
        3,
        vec![0, 1, 1, 3],
        vec![0, 1, 2],
        vec![5.0_f64, 6.0, 7.0],
    )
    .unwrap();

    let coo = csr_to_coo(csr);
    assert_eq!(coo.row_indices(), &[0, 2, 2]);
    assert_eq!(coo.col_indices(), &[0, 1, 2]);
    assert_eq!(coo.values(), &[5.0, 6.0, 7.0]);
}

#[test]
fn csr_to_coo_empty_matrix_gives_empty_coo() {
    let csr = CsrMatrix::<f64>::new(3, 4, vec![0, 0, 0, 0], vec![], vec![]).unwrap();
    let coo = csr_to_coo(csr);
    assert_eq!(coo.nnz(), 0);
    assert_eq!(coo.rows(), 3);
    assert_eq!(coo.cols(), 4);
}

#[test]
fn csr_to_coo_zero_row_matrix() {
    let csr = CsrMatrix::<f64>::new(0, 2, vec![0], vec![], vec![]).unwrap();
    let coo = csr_to_coo(csr);
    assert_eq!(coo.rows(), 0);
    assert_eq!(coo.nnz(), 0);
}

// ── round-trips ─────────────────────────────────────────────────────────────

#[test]
fn round_trip_coo_to_csr_to_coo_no_duplicates() {
    // Starting COO with entries already in (row, col) order; the round-trip must
    // reproduce the same row/col/value arrays.
    let original =
        CooMatrix::new(3, 3, vec![0, 1, 2], vec![2, 0, 1], vec![7.0_f64, 3.0, 9.0]).unwrap();

    let coo2 = csr_to_coo(coo_to_csr(original).into_inner());
    // coo_to_csr sorts by (row,col), so within each row the col indices are ascending.
    assert_eq!(coo2.row_indices(), &[0, 1, 2]);
    assert_eq!(coo2.col_indices(), &[2, 0, 1]);
    assert_eq!(coo2.values(), &[7.0, 3.0, 9.0]);
}

#[test]
fn round_trip_csr_to_coo_to_csr_no_duplicate_cols() {
    // Identity-like CSR (col indices already sorted within rows) must survive the round-trip.
    let csr = CsrMatrix::new(
        3,
        3,
        vec![0, 1, 2, 3],
        vec![0, 1, 2],
        vec![4.0_f64, 5.0, 6.0],
    )
    .unwrap();
    let expected = CsrMatrix::new(
        3,
        3,
        vec![0, 1, 2, 3],
        vec![0, 1, 2],
        vec![4.0_f64, 5.0, 6.0],
    )
    .unwrap();

    let csr2 = coo_to_csr(csr_to_coo(csr));
    assert_eq!(csr2, expected);
}

#[test]
fn round_trip_coo_with_duplicates_then_back_to_coo_has_summed_values() {
    // After COO → CSR (which sums duplicates) → COO, duplicates are gone.
    let coo = CooMatrix::new(2, 2, vec![0, 0, 1], vec![1, 1, 0], vec![2.0_f64, 3.0, 8.0]).unwrap();

    let coo2 = csr_to_coo(coo_to_csr(coo).into_inner());
    assert_eq!(coo2.nnz(), 2); // duplicate at (0,1) was merged
    assert_eq!(coo2.row_indices(), &[0, 1]);
    assert_eq!(coo2.col_indices(), &[1, 0]);
    assert_eq!(coo2.values(), &[5.0, 8.0]); // 2 + 3 = 5
}