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
35

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

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

use super::GenericGraph;
use crate::{
    impls::{CSR2D, SquareCSR2D},
    traits::{Matrix2D, PositiveInteger, TryFromUsize},
};

impl<'a, SparseIndex, Idx> Arbitrary<'a>
    for GenericGraph<Idx, SquareCSR2D<CSR2D<SparseIndex, Idx, Idx>>>
where
    SparseIndex: TryFromUsize + AsPrimitive<usize> + PositiveInteger,
    Idx: PositiveInteger
        + for<'b> Arbitrary<'b>
        + TryFrom<SparseIndex>
        + AsPrimitive<usize>
        + TryFromUsize
        + num_traits::ConstOne
        + num_traits::ConstZero
        + core::ops::MulAssign
        + num_traits::CheckedMul
        + num_traits::ToPrimitive
        + num_traits::SaturatingSub
        + 'static,
{
    #[inline]
    fn arbitrary(u: &mut Unstructured<'a>) -> arbitrary::Result<Self> {
        let edges = SquareCSR2D::arbitrary(u)?;
        let nodes: Idx = edges.number_of_rows();
        Ok(Self { nodes, edges })
    }
}