nalgebra 0.18.0

Linear algebra library with transformations and statically-sized or dynamically-sized matrices.
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

// This module implement several methods to fill some
// missing features of num-complex when it comes to randomness.

use quickcheck::{Arbitrary, Gen};
use rand::distributions::{Standard, Distribution};
use rand::Rng;
use num_complex::Complex;
use na::RealField;

#[derive(Copy, Clone, Debug, PartialEq, Eq)]
pub struct RandComplex<N>(pub Complex<N>);

impl<N: Arbitrary + RealField> Arbitrary for RandComplex<N> {
    #[inline]
    fn arbitrary<G: Gen>(rng: &mut G) -> Self {
        let im = Arbitrary::arbitrary(rng);
        let re = Arbitrary::arbitrary(rng);
        RandComplex(Complex::new(re, im))
    }
}

impl<N: RealField> Distribution<RandComplex<N>> for Standard
    where
        Standard: Distribution<N>,
{
    #[inline]
    fn sample<'a, G: Rng + ?Sized>(&self, rng: &'a mut G) -> RandComplex<N> {
        let re = rng.gen();
        let im = rng.gen();
        RandComplex(Complex::new(re, im))
    }
}

// This is a wrapper similar to RandComplex, but for non-complex.
// This exists only to make generic tests easier to write.
#[derive(Copy, Clone, Debug, PartialEq, Eq)]
pub struct RandScalar<N>(pub N);

impl<N: Arbitrary> Arbitrary for RandScalar<N> {
    #[inline]
    fn arbitrary<G: Gen>(rng: &mut G) -> Self {
        RandScalar(Arbitrary::arbitrary(rng))
    }
}

impl<N: RealField> Distribution<RandScalar<N>> for Standard
    where
        Standard: Distribution<N>,
{
    #[inline]
    fn sample<'a, G: Rng + ?Sized>(&self, rng: &'a mut G) -> RandScalar<N> {
        RandScalar(self.sample(rng))
    }
}