Struct nalgebra::proptest::MatrixStrategy [−][src]
pub struct MatrixStrategy<NStrategy, R: Dim, C: Dim> where
NStrategy: Strategy,
NStrategy::Value: Scalar,
DefaultAllocator: Allocator<NStrategy::Value, R, C>, { /* fields omitted */ }
Expand description
A strategy for generating matrices.
Trait Implementations
type Tree = MatrixValueTree<NStrategy::Value, R, C>
type Tree = MatrixValueTree<NStrategy::Value, R, C>
The value tree generated by this Strategy
.
The type of value used by functions under test generated by this Strategy. Read more
Generate a new value tree from the given runner. Read more
Returns a strategy which produces values transformed by the function
fun
. Read more
Returns a strategy which produces values of type O
by transforming
Self
with Into<O>
. Read more
Returns a strategy which produces values transformed by the function
fun
, which is additionally given a random number generator. Read more
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
S: Strategy,
F: Fn(Self::Value) -> S,
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
S: Strategy,
F: Fn(Self::Value) -> S,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
S: Strategy,
F: Fn(Self::Value) -> S,
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
S: Strategy,
F: Fn(Self::Value) -> S,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input
generated from self
in slot 0 and the derived strategy in slot 1. Read more
Returns a strategy which only produces values accepted by fun
. Read more
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
Returns a strategy which picks uniformly from self
and other
. Read more
Generate a recursive structure with self
items as leaves. Read more
Shuffle the contents of the values produced by this strategy. Read more
Erases the type of this Strategy
so it can be passed around as a
simple trait object. Read more
Erases the type of this Strategy
so it can be passed around as a
simple trait object. Read more
Auto Trait Implementations
impl<NStrategy, R, C> !RefUnwindSafe for MatrixStrategy<NStrategy, R, C>
impl<NStrategy, R, C> !Send for MatrixStrategy<NStrategy, R, C>
impl<NStrategy, R, C> !Sync for MatrixStrategy<NStrategy, R, C>
impl<NStrategy, R, C> Unpin for MatrixStrategy<NStrategy, R, C>
impl<NStrategy, R, C> !UnwindSafe for MatrixStrategy<NStrategy, R, C>
Blanket Implementations
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
Checks if self
is actually part of its subset T
(and can be converted to it).
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
The inclusion map: converts self
to the equivalent element of its superset.
pub fn vzip(self) -> V