nalgebra-sparse 0.11.0

Sparse matrix computation based on nalgebra.
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

/// Examples of *valid* raw CS data `(offsets, indices, values)`.
pub struct ValidCsDataExamples {
    pub valid_cs_data: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub valid_unsorted_cs_data: (Vec<usize>, Vec<usize>, Vec<i32>),
}

impl ValidCsDataExamples {
    pub fn new() -> Self {
        let valid_cs_data = (
            vec![0, 3, 5, 8, 11],
            vec![1, 3, 4, 1, 3, 0, 2, 3, 1, 3, 4],
            vec![1, 4, 5, 4, 7, 1, 2, 3, 6, 8, 9],
        );
        let valid_unsorted_cs_data = (
            vec![0, 3, 5, 8, 11],
            vec![4, 1, 3, 3, 1, 2, 3, 0, 3, 4, 1],
            vec![5, 1, 4, 7, 4, 2, 3, 1, 8, 9, 6],
        );

        return Self {
            valid_cs_data,
            valid_unsorted_cs_data,
        };
    }
}

/// Examples of *invalid* raw CS data `(offsets, indices, values)`.
pub struct InvalidCsDataExamples {
    pub empty_offset_array: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub offset_array_invalid_length_for_arbitrary_data: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub invalid_first_entry_in_offsets_array: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub invalid_last_entry_in_offsets_array: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub invalid_length_of_offsets_array: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub nonmonotonic_offsets: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub nonmonotonic_minor_indices: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub major_offset_out_of_bounds: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub minor_index_out_of_bounds: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub duplicate_entry: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub duplicate_entry_unsorted: (Vec<usize>, Vec<usize>, Vec<i32>),
    pub wrong_values_length: (Vec<usize>, Vec<usize>, Vec<i32>),
}

impl InvalidCsDataExamples {
    pub fn new() -> Self {
        let empty_offset_array = (Vec::<usize>::new(), Vec::<usize>::new(), Vec::<i32>::new());
        let offset_array_invalid_length_for_arbitrary_data =
            (vec![0, 3, 5], vec![0, 1, 2, 3, 5], vec![0, 1, 2, 3, 4]);
        let invalid_first_entry_in_offsets_array =
            (vec![1, 2, 2, 5], vec![0, 5, 1, 2, 3], vec![0, 1, 2, 3, 4]);
        let invalid_last_entry_in_offsets_array =
            (vec![0, 2, 2, 4], vec![0, 5, 1, 2, 3], vec![0, 1, 2, 3, 4]);
        let invalid_length_of_offsets_array =
            (vec![0, 2, 2], vec![0, 5, 1, 2, 3], vec![0, 1, 2, 3, 4]);
        let nonmonotonic_offsets = (vec![0, 3, 2, 5], vec![0, 1, 2, 3, 4], vec![0, 1, 2, 3, 4]);
        let nonmonotonic_minor_indices =
            (vec![0, 2, 2, 5], vec![0, 2, 3, 1, 4], vec![0, 1, 2, 3, 4]);
        let major_offset_out_of_bounds =
            (vec![0, 7, 2, 5], vec![0, 2, 3, 1, 4], vec![0, 1, 2, 3, 4]);
        let minor_index_out_of_bounds =
            (vec![0, 2, 2, 5], vec![0, 6, 1, 2, 3], vec![0, 1, 2, 3, 4]);
        let duplicate_entry = (vec![0, 1, 2, 5], vec![1, 3, 2, 3, 3], vec![0, 1, 2, 3, 4]);
        let duplicate_entry_unsorted = (vec![0, 1, 4, 5], vec![1, 3, 2, 3, 3], vec![0, 1, 2, 3, 4]);
        let wrong_values_length = (vec![0, 1, 2, 5], vec![1, 3, 2, 3, 0], vec![5, 4]);

        return Self {
            empty_offset_array,
            offset_array_invalid_length_for_arbitrary_data,
            invalid_first_entry_in_offsets_array,
            invalid_last_entry_in_offsets_array,
            invalid_length_of_offsets_array,
            nonmonotonic_minor_indices,
            nonmonotonic_offsets,
            major_offset_out_of_bounds,
            minor_index_out_of_bounds,
            duplicate_entry,
            duplicate_entry_unsorted,
            wrong_values_length,
        };
    }
}