Struct nalgebra::proptest::MatrixValueTree[−][src]

pub struct MatrixValueTree<N, R, C> where
    N: Scalar,
    R: Dim,
    C: Dim,
    DefaultAllocator: Allocator<N, R, C>,  { /* fields omitted */ }

A value tree for matrices.

Trait Implementations

`impl<N, R, C> ValueTree for MatrixValueTree<N, R, C> where N: Scalar, R: Dim, C: Dim, DefaultAllocator: Allocator<N, R, C>,` [src]

`type Value = MatrixMN<N, R, C>`

The type of the value produced by this ValueTree.

`fn current(&self) -> Self::Value`[src]

`fn simplify(&mut self) -> bool`[src]

`fn complicate(&mut self) -> bool`[src]

Auto Trait Implementations

`impl<N, R, C> !RefUnwindSafe for MatrixValueTree<N, R, C>`

`impl<N, R, C> !Send for MatrixValueTree<N, R, C>`

`impl<N, R, C> !Sync for MatrixValueTree<N, R, C>`

`impl<N, R, C> Unpin for MatrixValueTree<N, R, C>`

`impl<N, R, C> !UnwindSafe for MatrixValueTree<N, R, C>`

Blanket Implementations

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`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]

`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, U> TryFrom for T where U: Into<T>,` [src]

`type Error = Infallible`

The type returned in the event of a conversion error.

`pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>`[src]

`impl<T, U> TryInto for T where U: TryFrom<T>,` [src]

`type Error = >::Error`

The type returned in the event of a conversion error.

`pub fn try_into(self) -> Result<U, >::Error>`[src]

`impl<V, T> VZip<V> for T where V: MultiLane<T>,`

`pub fn vzip(self) -> V`

Struct nalgebra::proptest::MatrixValueTree[−][src]

Trait Implementations

`impl<N, R, C> ValueTree for MatrixValueTree<N, R, C> where N: Scalar, R: Dim, C: Dim, DefaultAllocator: Allocator<N, R, C>,` [src]

`type Value = MatrixMN<N, R, C>`

`fn current(&self) -> Self::Value`[src]

`fn simplify(&mut self) -> bool`[src]

`fn complicate(&mut self) -> bool`[src]

Auto Trait Implementations

`impl<N, R, C> !RefUnwindSafe for MatrixValueTree<N, R, C>`

`impl<N, R, C> !Send for MatrixValueTree<N, R, C>`

`impl<N, R, C> !Sync for MatrixValueTree<N, R, C>`

`impl<N, R, C> Unpin for MatrixValueTree<N, R, C>`

`impl<N, R, C> !UnwindSafe for MatrixValueTree<N, R, C>`

Blanket Implementations

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into<U> for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T> Same<T> for T`[src]

`type Output = T`

`impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>,` [src]

`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, U> TryFrom<U> for T where U: Into<T>,` [src]

`type Error = Infallible`

`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]

`type Error = <U as TryFrom<T>>::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>,`

`pub fn vzip(self) -> V`

Struct nalgebra::proptest::MatrixValueTree[−][src]

Trait Implementations

impl<N, R, C> ValueTree for MatrixValueTree<N, R, C> where N: Scalar, R: Dim, C: Dim, DefaultAllocator: Allocator<N, R, C>, [src]

type Value = MatrixMN<N, R, C>

fn current(&self) -> Self::Value[src]

fn simplify(&mut self) -> bool[src]

fn complicate(&mut self) -> bool[src]

Auto Trait Implementations

impl<N, R, C> !RefUnwindSafe for MatrixValueTree<N, R, C>

impl<N, R, C> !Send for MatrixValueTree<N, R, C>

impl<N, R, C> !Sync for MatrixValueTree<N, R, C>

impl<N, R, C> Unpin for MatrixValueTree<N, R, C>

impl<N, R, C> !UnwindSafe for MatrixValueTree<N, R, C>

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized, [src]

pub fn type_id(&self) -> TypeId[src]

impl<T> Borrow<T> for T where T: ?Sized, [src]

pub fn borrow(&self) -> &T[src]

impl<T> BorrowMut<T> for T where T: ?Sized, [src]

pub fn borrow_mut(&mut self) -> &mut T[src]

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

impl<T, U> Into<U> for T where U: From<T>, [src]

pub fn into(self) -> U[src]

impl<T> Same<T> for T[src]

type Output = T

impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>, [src]

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, U> TryFrom<U> for T where U: Into<T>, [src]

type Error = Infallible

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]

type Error = <U as TryFrom<T>>::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>,

pub fn vzip(self) -> V

`impl<N, R, C> ValueTree for MatrixValueTree<N, R, C> where N: Scalar, R: Dim, C: Dim, DefaultAllocator: Allocator<N, R, C>,` [src]

`type Value = MatrixMN<N, R, C>`

`fn current(&self) -> Self::Value`[src]

`fn simplify(&mut self) -> bool`[src]

`fn complicate(&mut self) -> bool`[src]

`impl<N, R, C> !RefUnwindSafe for MatrixValueTree<N, R, C>`

`impl<N, R, C> !Send for MatrixValueTree<N, R, C>`

`impl<N, R, C> !Sync for MatrixValueTree<N, R, C>`

`impl<N, R, C> Unpin for MatrixValueTree<N, R, C>`

`impl<N, R, C> !UnwindSafe for MatrixValueTree<N, R, C>`

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into<U> for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<T> Same<T> for T`[src]

`type Output = T`

`impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>,` [src]

`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, U> TryFrom<U> for T where U: Into<T>,` [src]

`type Error = Infallible`

`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]

`type Error = <U as TryFrom<T>>::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>,`

`pub fn vzip(self) -> V`