geometric-traits 0.2.0

Trait-based algebraic and graph algorithms for Rust, supporting no_std environments
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

//! Implementation of the `Arbitrary` trait for the `SquareCSR2D` struct.

use arbitrary::{Arbitrary, Unstructured};
use num_traits::AsPrimitive;

use crate::{
    impls::SquareCSR2D,
    prelude::{Matrix2D, MatrixMut},
    traits::{PositiveInteger, SparseMatrix2D, TryFromUsize},
};

impl<'a, M> Arbitrary<'a> for SquareCSR2D<M>
where
    M: Arbitrary<'a> + MatrixMut + SparseMatrix2D<ColumnIndex = <M as Matrix2D>::RowIndex>,
    M::RowIndex: TryFromUsize + AsPrimitive<usize> + PositiveInteger,
{
    #[inline]
    fn arbitrary(u: &mut Unstructured<'a>) -> arbitrary::Result<Self> {
        let mut matrix: M = M::arbitrary(u)?;
        let number_of_diagonal_values = M::RowIndex::try_from_usize(
            matrix
                .sparse_coordinates()
                .filter(|(row_index, column_index)| row_index == column_index)
                .count(),
        )
        .map_err(|_| arbitrary::Error::IncorrectFormat)?;

        let side = matrix.number_of_rows().max(matrix.number_of_columns());
        matrix.increase_shape((side, side)).map_err(|_| arbitrary::Error::IncorrectFormat)?;

        Ok(Self { matrix, number_of_diagonal_values })
    }
}