Struct nalgebra::proptest::MatrixStrategy [−][src]
A strategy for generating matrices.
Trait Implementations
impl<NStrategy: Clone, R: Clone + Dim, C: Clone + Dim> Clone for MatrixStrategy<NStrategy, R, C> where
NStrategy: Strategy,
NStrategy::Value: Scalar,
DefaultAllocator: Allocator<NStrategy::Value, R, C>,
NStrategy::Value: Clone,
[src]
NStrategy: Strategy,
NStrategy::Value: Scalar,
DefaultAllocator: Allocator<NStrategy::Value, R, C>,
NStrategy::Value: Clone,
fn clone(&self) -> MatrixStrategy<NStrategy, R, C>
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<NStrategy: Debug, R: Debug + Dim, C: Debug + Dim> Debug for MatrixStrategy<NStrategy, R, C> where
NStrategy: Strategy,
NStrategy::Value: Scalar,
DefaultAllocator: Allocator<NStrategy::Value, R, C>,
NStrategy::Value: Debug,
[src]
NStrategy: Strategy,
NStrategy::Value: Scalar,
DefaultAllocator: Allocator<NStrategy::Value, R, C>,
NStrategy::Value: Debug,
impl<NStrategy, R, C> Strategy for MatrixStrategy<NStrategy, R, C> where
NStrategy: Strategy,
NStrategy::Value: Scalar,
R: Dim,
C: Dim,
DefaultAllocator: Allocator<NStrategy::Value, R, C>,
[src]
NStrategy: Strategy,
NStrategy::Value: Scalar,
R: Dim,
C: Dim,
DefaultAllocator: Allocator<NStrategy::Value, R, C>,
type Tree = MatrixValueTree<NStrategy::Value, R, C>
The value tree generated by this Strategy
.
type Value = MatrixMN<NStrategy::Value, R, C>
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self>
[src]
pub fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
pub fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
pub fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
pub fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
S: Strategy,
F: Fn(Self::Value) -> S,
[src]
S: Strategy,
F: Fn(Self::Value) -> S,
pub fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
S: Strategy,
F: Fn(Self::Value) -> S,
[src]
S: Strategy,
F: Fn(Self::Value) -> S,
pub fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
S: Strategy,
F: Fn(Self::Value) -> S,
[src]
S: Strategy,
F: Fn(Self::Value) -> S,
pub fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
R: Into<Reason>,
F: Fn(&Self::Value) -> bool,
[src]
R: Into<Reason>,
F: Fn(&Self::Value) -> bool,
pub fn prop_filter_map<F, O>(
self,
whence: impl Into<Reason>,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
[src]
self,
whence: impl Into<Reason>,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
pub fn prop_union(self, other: Self) -> Union<Self>
[src]
pub fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
Self: 'static,
R: 'static + Strategy<Value = Self::Value>,
F: Fn(BoxedStrategy<Self::Value>) -> R,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
Self: 'static,
R: 'static + Strategy<Value = Self::Value>,
F: Fn(BoxedStrategy<Self::Value>) -> R,
pub fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
pub fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
pub fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
pub fn no_shrink(self) -> NoShrink<Self>
[src]
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
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Same<T> for T
[src]
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
SS: SubsetOf<SP>,
pub fn to_subset(&self) -> Option<SS>
[src]
pub fn is_in_subset(&self) -> bool
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn from_subset(element: &SS) -> SP
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,