Struct nalgebra::proptest::MatrixValueTree [−][src]
pub struct MatrixValueTree<T, R, C> where
T: Scalar,
R: Dim,
C: Dim,
DefaultAllocator: Allocator<T, R, C>, { /* fields omitted */ }Expand description
A value tree for matrices.
Trait Implementations
impl<T, R, C> ValueTree for MatrixValueTree<T, R, C> where
T: Scalar,
R: Dim,
C: Dim,
DefaultAllocator: Allocator<T, R, C>,
impl<T, R, C> ValueTree for MatrixValueTree<T, R, C> where
T: Scalar,
R: Dim,
C: Dim,
DefaultAllocator: Allocator<T, R, C>,
Attempts to simplify the current value. Notionally, this sets the “high” value to the current value, and the current value to a “halfway point” between high and low, rounding towards low. Read more
Attempts to partially undo the last simplification. Notionally, this sets the “low” value to one plus the current value, and the current value to a “halfway point” between high and the new low, rounding towards low. Read more
Auto Trait Implementations
impl<T, R, C> !RefUnwindSafe for MatrixValueTree<T, R, C>
impl<T, R, C> !Send for MatrixValueTree<T, R, C>
impl<T, R, C> !Sync for MatrixValueTree<T, R, C>
impl<T, R, C> Unpin for MatrixValueTree<T, R, C>
impl<T, R, C> !UnwindSafe for MatrixValueTree<T, 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.