geometric-traits 0.1.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
34

//! Submodule providing an implementation of the `Arbitrary` trait for the
//! `GenericMatrix2DWithPaddedDiagonal` struct.

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

use crate::{
    impls::GenericMatrix2DWithPaddedDiagonal,
    traits::{Matrix2D, SparseMatrix2D, TryFromUsize, ValuedMatrix2D},
};

fn one<R, V: One>(_a: R) -> V {
    V::one()
}

impl<'a, M> Arbitrary<'a> for GenericMatrix2DWithPaddedDiagonal<M, fn(M::RowIndex) -> M::Value>
where
    M: for<'b> Arbitrary<'b> + ValuedMatrix2D + Matrix2D + SparseMatrix2D,
    M::Value: One,
    M::ColumnIndex: AsPrimitive<usize> + TryFromUsize,
{
    #[inline]
    fn arbitrary(u: &mut Unstructured<'a>) -> arbitrary::Result<Self> {
        let matrix = M::arbitrary(u)?;

        let padded = GenericMatrix2DWithPaddedDiagonal::new(
            matrix,
            one::<M::RowIndex, M::Value> as fn(M::RowIndex) -> M::Value,
        )
        .map_err(|_| arbitrary::Error::IncorrectFormat)?;

        Ok(padded)
    }
}