Struct na::geometry::Transform

#[repr(C)]
pub struct Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,  { /* fields omitted */ }

A transformation matrix in homogeneous coordinates.

It is stored as a matrix with dimensions (D + 1, D + 1), e.g., it stores a 4x4 matrix for a 3D transformation.

Methods

impl<N, D, C> Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

pub fn from_matrix_unchecked(
    matrix: Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>
) -> Transform<N, D, C>

Creates a new transformation from the given homogeneous matrix. The transformation category of Self is not checked to be verified by the given matrix.

pub fn into_inner(
    self
) -> Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>

Retrieves the underlying matrix.

Examples

let m = Matrix3::new(1.0, 2.0, 0.0,
                     3.0, 4.0, 0.0,
                     0.0, 0.0, 1.0);
let t = Transform2::from_matrix_unchecked(m);
assert_eq!(t.into_inner(), m);

pub fn unwrap(
    self
) -> Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>

Deprecated:

use .into_inner() instead

Retrieves the underlying matrix. Deprecated: Use Transform::into_inner instead.

pub fn matrix(
    &self
) -> &Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>

A reference to the underlying matrix.

Examples

let m = Matrix3::new(1.0, 2.0, 0.0,
                     3.0, 4.0, 0.0,
                     0.0, 0.0, 1.0);
let t = Transform2::from_matrix_unchecked(m);
assert_eq!(*t.matrix(), m);

pub fn matrix_mut_unchecked(
    &mut self
) -> &mut Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>

A mutable reference to the underlying matrix.

It is _unchecked because direct modifications of this matrix may break invariants identified by this transformation category.

Examples

let m = Matrix3::new(1.0, 2.0, 0.0,
                     3.0, 4.0, 0.0,
                     0.0, 0.0, 1.0);
let mut t = Transform2::from_matrix_unchecked(m);
t.matrix_mut_unchecked().m12 = 42.0;
t.matrix_mut_unchecked().m23 = 90.0;


let expected = Matrix3::new(1.0, 42.0, 0.0,
                            3.0, 4.0,  90.0,
                            0.0, 0.0,  1.0);
assert_eq!(*t.matrix(), expected);

pub fn set_category<CNew>(self) -> Transform<N, D, CNew> where
    CNew: SuperTCategoryOf<C>, 

Sets the category of this transform.

This can be done only if the new category is more general than the current one, e.g., a transform with category TProjective cannot be converted to a transform with category TAffine because not all projective transformations are affine (the other way-round is valid though).

pub fn clone_owned(&self) -> Transform<N, D, C>

Deprecated:

This method is redundant with automatic Copy and the .clone() method and will be removed in a future release.

Clones this transform into one that owns its data.

pub fn to_homogeneous(
    &self
) -> Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>

Converts this transform into its equivalent homogeneous transformation matrix.

Examples

let m = Matrix3::new(1.0, 2.0, 0.0,
                     3.0, 4.0, 0.0,
                     0.0, 0.0, 1.0);
let t = Transform2::from_matrix_unchecked(m);
assert_eq!(t.into_inner(), m);

pub fn try_inverse(self) -> Option<Transform<N, D, C>>

Attempts to invert this transformation. You may use .inverse instead of this transformation has a subcategory of TProjective (i.e. if it is a Projective{2,3} or Affine{2,3}).

Examples

let m = Matrix3::new(2.0, 2.0, -0.3,
                     3.0, 4.0, 0.1,
                     0.0, 0.0, 1.0);
let t = Transform2::from_matrix_unchecked(m);
let inv_t = t.try_inverse().unwrap();
assert_relative_eq!(t * inv_t, Transform2::identity());
assert_relative_eq!(inv_t * t, Transform2::identity());

// Non-invertible case.
let m = Matrix3::new(0.0, 2.0, 1.0,
                     3.0, 0.0, 5.0,
                     0.0, 0.0, 0.0);
let t = Transform2::from_matrix_unchecked(m);
assert!(t.try_inverse().is_none());

pub fn inverse(self) -> Transform<N, D, C> where
    C: SubTCategoryOf<TProjective>, 

Inverts this transformation. Use .try_inverse if this transform has the TGeneral category (i.e., a Transform{2,3} may not be invertible).

Examples

let m = Matrix3::new(2.0, 2.0, -0.3,
                     3.0, 4.0, 0.1,
                     0.0, 0.0, 1.0);
let proj = Projective2::from_matrix_unchecked(m);
let inv_t = proj.inverse();
assert_relative_eq!(proj * inv_t, Projective2::identity());
assert_relative_eq!(inv_t * proj, Projective2::identity());

pub fn try_inverse_mut(&mut self) -> bool

Attempts to invert this transformation in-place. You may use .inverse_mut instead of this transformation has a subcategory of TProjective.

Examples

let m = Matrix3::new(2.0, 2.0, -0.3,
                     3.0, 4.0, 0.1,
                     0.0, 0.0, 1.0);
let t = Transform2::from_matrix_unchecked(m);
let mut inv_t = t;
assert!(inv_t.try_inverse_mut());
assert_relative_eq!(t * inv_t, Transform2::identity());
assert_relative_eq!(inv_t * t, Transform2::identity());

// Non-invertible case.
let m = Matrix3::new(0.0, 2.0, 1.0,
                     3.0, 0.0, 5.0,
                     0.0, 0.0, 0.0);
let mut t = Transform2::from_matrix_unchecked(m);
assert!(!t.try_inverse_mut());

pub fn inverse_mut(&mut self) where
    C: SubTCategoryOf<TProjective>, 

Inverts this transformation in-place. Use .try_inverse_mut if this transform has the TGeneral category (it may not be invertible).

Examples

let m = Matrix3::new(2.0, 2.0, -0.3,
                     3.0, 4.0, 0.1,
                     0.0, 0.0, 1.0);
let proj = Projective2::from_matrix_unchecked(m);
let mut inv_t = proj;
inv_t.inverse_mut();
assert_relative_eq!(proj * inv_t, Projective2::identity());
assert_relative_eq!(inv_t * proj, Projective2::identity());

impl<N, D, C> Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, D, U1>, 

pub fn transform_point(&self, pt: &Point<N, D>) -> Point<N, D>

Transform the given point by this transformation.

This is the same as the multiplication self * pt.

pub fn transform_vector(
    &self,
    v: &Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>
) -> Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>

Transform the given vector by this transformation, ignoring the translational component of the transformation.

This is the same as the multiplication self * v.

impl<N, D, C> Transform<N, D, C> where
    C: TCategory + SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, D, U1>, 

pub fn inverse_transform_point(&self, pt: &Point<N, D>) -> Point<N, D>

Transform the given point by the inverse of this transformation. This may be cheaper than inverting the transformation and transforming the point.

pub fn inverse_transform_vector(
    &self,
    v: &Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>
) -> Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>

Transform the given vector by the inverse of this transformation. This may be cheaper than inverting the transformation and transforming the vector.

impl<N, D> Transform<N, D, TGeneral> where
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

pub fn matrix_mut(
    &mut self
) -> &mut Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>

A mutable reference to underlying matrix. Use .matrix_mut_unchecked instead if this transformation category is not TGeneral.

impl<N, D, C> Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

pub fn identity() -> Transform<N, D, C>

Creates a new identity transform.

Example

let pt = Point2::new(1.0, 2.0);
let t = Projective2::identity();
assert_eq!(t * pt, pt);

let aff = Affine2::identity();
assert_eq!(aff * pt, pt);

let aff = Transform2::identity();
assert_eq!(aff * pt, pt);

// Also works in 3D.
let pt = Point3::new(1.0, 2.0, 3.0);
let t = Projective3::identity();
assert_eq!(t * pt, pt);

let aff = Affine3::identity();
assert_eq!(aff * pt, pt);

let aff = Transform3::identity();
assert_eq!(aff * pt, pt);

Trait Implementations

impl<N, D, C> TwoSidedInverse<Multiplicative> for Transform<N, D, C> where
    C: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn two_sided_inverse(&self) -> Transform<N, D, C>

Returns the two_sided_inverse of self, relative to the operator O.

fn two_sided_inverse_mut(&mut self)

In-place inversion of self, relative to the operator O.

impl<'b, N, D, C> MulAssign<&'b Translation<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn mul_assign(&mut self, rhs: &'b Translation<N, D>)

Performs the *= operation.

impl<N, D, CA, CB> MulAssign<Transform<N, D, CB>> for Transform<N, D, CA> where
    CA: TCategory,
    CB: SubTCategoryOf<CA>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn mul_assign(&mut self, rhs: Transform<N, D, CB>)

Performs the *= operation.

impl<N, D, C> MulAssign<Translation<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn mul_assign(&mut self, rhs: Translation<N, D>)

Performs the *= operation.

impl<N, D, C, R> MulAssign<Similarity<N, D, R>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn mul_assign(&mut self, rhs: Similarity<N, D, R>)

Performs the *= operation.

impl<'b, N, C> MulAssign<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
    C: TCategory,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>, 

fn mul_assign(&mut self, rhs: &'b Unit<Quaternion<N>>)

Performs the *= operation.

impl<N, C> MulAssign<Unit<Quaternion<N>>> for Transform<N, U3, C> where
    C: TCategory,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>, 

fn mul_assign(&mut self, rhs: Unit<Quaternion<N>>)

Performs the *= operation.

impl<'b, N, D, C, R> MulAssign<&'b Similarity<N, D, R>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn mul_assign(&mut self, rhs: &'b Similarity<N, D, R>)

Performs the *= operation.

impl<N, D, C, R> MulAssign<Isometry<N, D, R>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn mul_assign(&mut self, rhs: Isometry<N, D, R>)

Performs the *= operation.

impl<'b, N, D, C> MulAssign<&'b Rotation<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>, 

fn mul_assign(&mut self, rhs: &'b Rotation<N, D>)

Performs the *= operation.

impl<'b, N, D, CA, CB> MulAssign<&'b Transform<N, D, CB>> for Transform<N, D, CA> where
    CA: TCategory,
    CB: SubTCategoryOf<CA>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn mul_assign(&mut self, rhs: &'b Transform<N, D, CB>)

Performs the *= operation.

impl<N, D, C> MulAssign<Rotation<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>, 

fn mul_assign(&mut self, rhs: Rotation<N, D>)

Performs the *= operation.

impl<'b, N, D, C, R> MulAssign<&'b Isometry<N, D, R>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn mul_assign(&mut self, rhs: &'b Isometry<N, D, R>)

Performs the *= operation.

impl<N, D, C> AbsDiffEq<Transform<N, D, C>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    <N as AbsDiffEq<N>>::Epsilon: Copy,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

type Epsilon = <N as AbsDiffEq<N>>::Epsilon

Used for specifying relative comparisons.

fn default_epsilon(
) -> <Transform<N, D, C> as AbsDiffEq<Transform<N, D, C>>>::Epsilon

The default tolerance to use when testing values that are close together.

fn abs_diff_eq(
    &self,
    other: &Transform<N, D, C>,
    epsilon: <Transform<N, D, C> as AbsDiffEq<Transform<N, D, C>>>::Epsilon
) -> bool

A test for equality that uses the absolute difference to compute the approximate equality of two numbers.

default fn abs_diff_ne(&self, other: &Rhs, epsilon: Self::Epsilon) -> bool

The inverse of ApproxEq::abs_diff_eq.

impl<N, D, C> Copy for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1> + Copy,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer: Copy, 

impl<N, D, C> Clone for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn clone(&self) -> Transform<N, D, C>

Returns a copy of the value.

default fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N, D, C> One for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn one() -> Transform<N, D, C>

Creates a new identity transform.

default fn is_one(&self) -> bool where
    Self: PartialEq<Self>, 

Returns true if self is equal to the multiplicative identity.

impl<N, D, C> AbstractGroup<Multiplicative> for Transform<N, D, C> where
    C: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

impl<N, D, C> AbstractSemigroup<Multiplicative> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

default fn prop_is_associative_approx(args: (Self, Self, Self)) -> bool where
    Self: RelativeEq<Self>, 

Returns true if associativity holds for the given arguments. Approximate equality is used for verifications.

default fn prop_is_associative(args: (Self, Self, Self)) -> bool where
    Self: Eq, 

Returns true if associativity holds for the given arguments.

impl<N, D, C> PartialEq<Transform<N, D, C>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn eq(&self, right: &Transform<N, D, C>) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]

default fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl<N, D, C> RelativeEq<Transform<N, D, C>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    <N as AbsDiffEq<N>>::Epsilon: Copy,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn default_max_relative(
) -> <Transform<N, D, C> as AbsDiffEq<Transform<N, D, C>>>::Epsilon

The default relative tolerance for testing values that are far-apart.

fn relative_eq(
    &self,
    other: &Transform<N, D, C>,
    epsilon: <Transform<N, D, C> as AbsDiffEq<Transform<N, D, C>>>::Epsilon,
    max_relative: <Transform<N, D, C> as AbsDiffEq<Transform<N, D, C>>>::Epsilon
) -> bool

A test for equality that uses a relative comparison if the values are far apart.

default fn relative_ne(
    &self,
    other: &Rhs,
    epsilon: Self::Epsilon,
    max_relative: Self::Epsilon
) -> bool

The inverse of ApproxEq::relative_eq.

impl<'b, N, D, C> DivAssign<&'b Rotation<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>, 

fn div_assign(&mut self, rhs: &'b Rotation<N, D>)

Performs the /= operation.

impl<N, D, CA, CB> DivAssign<Transform<N, D, CB>> for Transform<N, D, CA> where
    CA: SuperTCategoryOf<CB>,
    CB: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn div_assign(&mut self, rhs: Transform<N, D, CB>)

Performs the /= operation.

impl<N, D, C> DivAssign<Translation<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn div_assign(&mut self, rhs: Translation<N, D>)

Performs the /= operation.

impl<N, C> DivAssign<Unit<Quaternion<N>>> for Transform<N, U3, C> where
    C: TCategory,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>, 

fn div_assign(&mut self, rhs: Unit<Quaternion<N>>)

Performs the /= operation.

impl<N, D, C> DivAssign<Rotation<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>, 

fn div_assign(&mut self, rhs: Rotation<N, D>)

Performs the /= operation.

impl<'b, N, D, CA, CB> DivAssign<&'b Transform<N, D, CB>> for Transform<N, D, CA> where
    CA: SuperTCategoryOf<CB>,
    CB: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn div_assign(&mut self, rhs: &'b Transform<N, D, CB>)

Performs the /= operation.

impl<'b, N, C> DivAssign<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
    C: TCategory,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>, 

fn div_assign(&mut self, rhs: &'b Unit<Quaternion<N>>)

Performs the /= operation.

impl<'b, N, D, C> DivAssign<&'b Translation<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn div_assign(&mut self, rhs: &'b Translation<N, D>)

Performs the /= operation.

impl<N, D, C> Identity<Multiplicative> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn identity() -> Transform<N, D, C>

The identity element.

default fn id(O) -> Self

Specific identity.

impl<N, D, C> ProjectiveTransformation<Point<N, D>> for Transform<N, D, C> where
    C: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn inverse_transform_point(&self, pt: &Point<N, D>) -> Point<N, D>

Applies this group's two_sided_inverse action on a point from the euclidean space.

fn inverse_transform_vector(
    &self,
    v: &Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>
) -> Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>

Applies this group's two_sided_inverse action on a vector from the euclidean space.

impl<N, D, C> AbstractLoop<Multiplicative> for Transform<N, D, C> where
    C: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

impl<'a, 'b, N, D, C, R> Mul<&'b Isometry<N, D, R>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Isometry<N, D, R>
) -> <&'a Transform<N, D, C> as Mul<&'b Isometry<N, D, R>>>::Output

Performs the * operation.

impl<'b, N, D, CA, CB> Mul<&'b Transform<N, D, CB>> for Transform<N, D, CA> where
    CA: TCategoryMul<CB>,
    CB: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <CA as TCategoryMul<CB>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, D, CB>
) -> <Transform<N, D, CA> as Mul<&'b Transform<N, D, CB>>>::Output

Performs the * operation.

impl<'a, 'b, N, D, C, R> Mul<&'b Transform<N, D, C>> for &'a Isometry<N, D, R> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, D, C>
) -> <&'a Isometry<N, D, R> as Mul<&'b Transform<N, D, C>>>::Output

Performs the * operation.

impl<'a, 'b, N, D, C> Mul<&'b Transform<N, D, C>> for &'a Rotation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, D, C>
) -> <&'a Rotation<N, D> as Mul<&'b Transform<N, D, C>>>::Output

Performs the * operation.

impl<'b, N, D, C, R> Mul<&'b Isometry<N, D, R>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Isometry<N, D, R>
) -> <Transform<N, D, C> as Mul<&'b Isometry<N, D, R>>>::Output

Performs the * operation.

impl<'b, N, D, C> Mul<&'b Transform<N, D, C>> for Translation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, D, C>
) -> <Translation<N, D> as Mul<&'b Transform<N, D, C>>>::Output

Performs the * operation.

impl<'a, N, D, C> Mul<Point<N, D>> for &'a Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>,
    DefaultAllocator: Allocator<N, D, D>, 

type Output = Point<N, D>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Point<N, D>
) -> <&'a Transform<N, D, C> as Mul<Point<N, D>>>::Output

Performs the * operation.

impl<N, C> Mul<Unit<Quaternion<N>>> for Transform<N, U3, C> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Mul<Unit<Quaternion<N>>>>::Output

Performs the * operation.

impl<'a, 'b, N, D, C> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>
) -> <&'a Transform<N, D, C> as Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>::Output

Performs the * operation.

impl<N, D, C> Mul<Rotation<N, D>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, D>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Rotation<N, D>
) -> <Transform<N, D, C> as Mul<Rotation<N, D>>>::Output

Performs the * operation.

impl<'a, 'b, N, C> Mul<&'b Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Mul<&'b Unit<Quaternion<N>>>>::Output

Performs the * operation.

impl<'b, N, D, C> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>
) -> <Transform<N, D, C> as Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>::Output

Performs the * operation.

impl<'a, N, D, C> Mul<Rotation<N, D>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, D>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Rotation<N, D>
) -> <&'a Transform<N, D, C> as Mul<Rotation<N, D>>>::Output

Performs the * operation.

impl<'b, N, D, C, R> Mul<&'b Transform<N, D, C>> for Isometry<N, D, R> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, D, C>
) -> <Isometry<N, D, R> as Mul<&'b Transform<N, D, C>>>::Output

Performs the * operation.

impl<'a, N, D, C, R> Mul<Isometry<N, D, R>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Isometry<N, D, R>
) -> <&'a Transform<N, D, C> as Mul<Isometry<N, D, R>>>::Output

Performs the * operation.

impl<'a, 'b, N, D, CA, CB> Mul<&'b Transform<N, D, CB>> for &'a Transform<N, D, CA> where
    CA: TCategoryMul<CB>,
    CB: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <CA as TCategoryMul<CB>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, D, CB>
) -> <&'a Transform<N, D, CA> as Mul<&'b Transform<N, D, CB>>>::Output

Performs the * operation.

impl<'a, 'b, N, D, C, R> Mul<&'b Transform<N, D, C>> for &'a Similarity<N, D, R> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, D, C>
) -> <&'a Similarity<N, D, R> as Mul<&'b Transform<N, D, C>>>::Output

Performs the * operation.

impl<'a, 'b, N, C> Mul<&'b Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U4>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Transform<N, U3, C>>>::Output

Performs the * operation.

impl<N, D, CA, CB> Mul<Transform<N, D, CB>> for Transform<N, D, CA> where
    CA: TCategoryMul<CB>,
    CB: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <CA as TCategoryMul<CB>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, D, CB>
) -> <Transform<N, D, CA> as Mul<Transform<N, D, CB>>>::Output

Performs the * operation.

impl<'b, N, D, C, R> Mul<&'b Similarity<N, D, R>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Similarity<N, D, R>
) -> <Transform<N, D, C> as Mul<&'b Similarity<N, D, R>>>::Output

Performs the * operation.

impl<'a, N, D, C> Mul<Transform<N, D, C>> for &'a Rotation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, D, C>
) -> <&'a Rotation<N, D> as Mul<Transform<N, D, C>>>::Output

Performs the * operation.

impl<'b, N, C> Mul<&'b Transform<N, U3, C>> for Unit<Quaternion<N>> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U4>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Mul<&'b Transform<N, U3, C>>>::Output

Performs the * operation.

impl<N, D, C, R> Mul<Transform<N, D, C>> for Isometry<N, D, R> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, D, C>
) -> <Isometry<N, D, R> as Mul<Transform<N, D, C>>>::Output

Performs the * operation.

impl<'a, N, D, C, R> Mul<Transform<N, D, C>> for &'a Similarity<N, D, R> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, D, C>
) -> <&'a Similarity<N, D, R> as Mul<Transform<N, D, C>>>::Output

Performs the * operation.

impl<'b, N, D, C> Mul<&'b Transform<N, D, C>> for Rotation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, D, C>
) -> <Rotation<N, D> as Mul<&'b Transform<N, D, C>>>::Output

Performs the * operation.

impl<'b, N, D, C> Mul<&'b Point<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>,
    DefaultAllocator: Allocator<N, D, D>, 

type Output = Point<N, D>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Point<N, D>
) -> <Transform<N, D, C> as Mul<&'b Point<N, D>>>::Output

Performs the * operation.

impl<'a, N, D, CA, CB> Mul<Transform<N, D, CB>> for &'a Transform<N, D, CA> where
    CA: TCategoryMul<CB>,
    CB: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <CA as TCategoryMul<CB>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, D, CB>
) -> <&'a Transform<N, D, CA> as Mul<Transform<N, D, CB>>>::Output

Performs the * operation.

impl<N, D, C> Mul<Point<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>,
    DefaultAllocator: Allocator<N, D, D>, 

type Output = Point<N, D>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Point<N, D>
) -> <Transform<N, D, C> as Mul<Point<N, D>>>::Output

Performs the * operation.

impl<'a, 'b, N, D, C> Mul<&'b Point<N, D>> for &'a Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>,
    DefaultAllocator: Allocator<N, D, D>, 

type Output = Point<N, D>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Point<N, D>
) -> <&'a Transform<N, D, C> as Mul<&'b Point<N, D>>>::Output

Performs the * operation.

impl<'b, N, D, C, R> Mul<&'b Transform<N, D, C>> for Similarity<N, D, R> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, D, C>
) -> <Similarity<N, D, R> as Mul<&'b Transform<N, D, C>>>::Output

Performs the * operation.

impl<N, D, C> Mul<Transform<N, D, C>> for Rotation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, D, C>
) -> <Rotation<N, D> as Mul<Transform<N, D, C>>>::Output

Performs the * operation.

impl<N, D, C> Mul<Transform<N, D, C>> for Translation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, D, C>
) -> <Translation<N, D> as Mul<Transform<N, D, C>>>::Output

Performs the * operation.

impl<'a, N, D, C> Mul<Transform<N, D, C>> for &'a Translation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, D, C>
) -> <&'a Translation<N, D> as Mul<Transform<N, D, C>>>::Output

Performs the * operation.

impl<'a, N, D, C, R> Mul<Transform<N, D, C>> for &'a Isometry<N, D, R> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, D, C>
) -> <&'a Isometry<N, D, R> as Mul<Transform<N, D, C>>>::Output

Performs the * operation.

impl<N, D, C> Mul<Translation<N, D>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Translation<N, D>
) -> <Transform<N, D, C> as Mul<Translation<N, D>>>::Output

Performs the * operation.

impl<'a, N, D, C, R> Mul<Similarity<N, D, R>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Similarity<N, D, R>
) -> <&'a Transform<N, D, C> as Mul<Similarity<N, D, R>>>::Output

Performs the * operation.

impl<'a, 'b, N, D, C> Mul<&'b Transform<N, D, C>> for &'a Translation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Transform<N, D, C>
) -> <&'a Translation<N, D> as Mul<&'b Transform<N, D, C>>>::Output

Performs the * operation.

impl<N, D, C, R> Mul<Isometry<N, D, R>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Isometry<N, D, R>
) -> <Transform<N, D, C> as Mul<Isometry<N, D, R>>>::Output

Performs the * operation.

impl<N, C> Mul<Transform<N, U3, C>> for Unit<Quaternion<N>> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U4>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Mul<Transform<N, U3, C>>>::Output

Performs the * operation.

impl<N, D, C, R> Mul<Similarity<N, D, R>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Similarity<N, D, R>
) -> <Transform<N, D, C> as Mul<Similarity<N, D, R>>>::Output

Performs the * operation.

impl<'a, 'b, N, D, C, R> Mul<&'b Similarity<N, D, R>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Similarity<N, D, R>
) -> <&'a Transform<N, D, C> as Mul<&'b Similarity<N, D, R>>>::Output

Performs the * operation.

impl<'b, N, D, C> Mul<&'b Rotation<N, D>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, D>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Rotation<N, D>
) -> <Transform<N, D, C> as Mul<&'b Rotation<N, D>>>::Output

Performs the * operation.

impl<'b, N, D, C> Mul<&'b Translation<N, D>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Translation<N, D>
) -> <Transform<N, D, C> as Mul<&'b Translation<N, D>>>::Output

Performs the * operation.

impl<'a, N, C> Mul<Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Mul<Unit<Quaternion<N>>>>::Output

Performs the * operation.

impl<'a, 'b, N, D, C> Mul<&'b Rotation<N, D>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, D>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Rotation<N, D>
) -> <&'a Transform<N, D, C> as Mul<&'b Rotation<N, D>>>::Output

Performs the * operation.

impl<'b, N, C> Mul<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Mul<&'b Unit<Quaternion<N>>>>::Output

Performs the * operation.

impl<N, D, C, R> Mul<Transform<N, D, C>> for Similarity<N, D, R> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    R: SubsetOf<Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, D, C>
) -> <Similarity<N, D, R> as Mul<Transform<N, D, C>>>::Output

Performs the * operation.

impl<'a, 'b, N, D, C> Mul<&'b Translation<N, D>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: &'b Translation<N, D>
) -> <&'a Transform<N, D, C> as Mul<&'b Translation<N, D>>>::Output

Performs the * operation.

impl<'a, N, D, C> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>
) -> <&'a Transform<N, D, C> as Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>::Output

Performs the * operation.

impl<N, D, C> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>
) -> <Transform<N, D, C> as Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>::Output

Performs the * operation.

impl<'a, N, D, C> Mul<Translation<N, D>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Translation<N, D>
) -> <&'a Transform<N, D, C> as Mul<Translation<N, D>>>::Output

Performs the * operation.

impl<'a, N, C> Mul<Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U4>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the * operator.

fn mul(
    self,
    rhs: Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Mul<Transform<N, U3, C>>>::Output

Performs the * operation.

impl<N, D, C> Debug for Transform<N, D, C> where
    C: TCategory + Debug,
    D: DimNameAdd<U1> + Debug,
    N: Debug + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn fmt(&self, f: &mut Formatter) -> Result<(), Error>

Formats the value using the given formatter.

impl<N1, N2, D, C> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Transform<N1, D, C> where
    C: TCategory,
    D: DimName + DimNameAdd<U1>,
    N1: RealField + SubsetOf<N2>,
    N2: RealField,
    DefaultAllocator: Allocator<N1, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    <N1 as AbsDiffEq<N1>>::Epsilon: Copy,
    <N2 as AbsDiffEq<N2>>::Epsilon: Copy, 

fn to_superset(
    &self
) -> Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>

The inclusion map: converts self to the equivalent element of its superset.

fn is_in_subset(
    m: &Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>
) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

unsafe fn from_superset_unchecked(
    m: &Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>
) -> Transform<N1, D, C>

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

default fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl<N1, N2, C> SubsetOf<Transform<N2, U3, C>> for Unit<Quaternion<N1>> where
    C: SuperTCategoryOf<TAffine>,
    N1: RealField,
    N2: RealField + SupersetOf<N1>, 

fn to_superset(&self) -> Transform<N2, U3, C>

The inclusion map: converts self to the equivalent element of its superset.

fn is_in_subset(t: &Transform<N2, U3, C>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

unsafe fn from_superset_unchecked(
    t: &Transform<N2, U3, C>
) -> Unit<Quaternion<N1>>

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

default fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl<N1, N2, D, C> SubsetOf<Transform<N2, D, C>> for Rotation<N1, D> where
    C: SuperTCategoryOf<TAffine>,
    D: DimNameAdd<U1> + DimMin<D, Output = D>,
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    DefaultAllocator: Allocator<N1, D, D>,
    DefaultAllocator: Allocator<N2, D, D>,
    DefaultAllocator: Allocator<N1, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<(usize, usize), D, U1>, 

fn to_superset(&self) -> Transform<N2, D, C>

The inclusion map: converts self to the equivalent element of its superset.

fn is_in_subset(t: &Transform<N2, D, C>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

unsafe fn from_superset_unchecked(t: &Transform<N2, D, C>) -> Rotation<N1, D>

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

default fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl<N1, N2, D, R, C> SubsetOf<Transform<N2, D, C>> for Similarity<N1, D, R> where
    C: SuperTCategoryOf<TAffine>,
    D: DimNameAdd<U1> + DimMin<D, Output = D>,
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    R: Rotation<Point<N1, D>> + SubsetOf<Matrix<N1, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N1, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> + SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N1, D, U1>,
    DefaultAllocator: Allocator<N1, D, D>,
    DefaultAllocator: Allocator<N1, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<(usize, usize), D, U1>,
    DefaultAllocator: Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N2, D, D>,
    DefaultAllocator: Allocator<N2, D, U1>, 

fn to_superset(&self) -> Transform<N2, D, C>

The inclusion map: converts self to the equivalent element of its superset.

fn is_in_subset(t: &Transform<N2, D, C>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

unsafe fn from_superset_unchecked(
    t: &Transform<N2, D, C>
) -> Similarity<N1, D, R>

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

default fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl<N1, N2, D, C1, C2> SubsetOf<Transform<N2, D, C2>> for Transform<N1, D, C1> where
    C1: TCategory,
    C2: SuperTCategoryOf<C1>,
    D: DimName + DimNameAdd<U1>,
    N1: RealField + SubsetOf<N2>,
    N2: RealField,
    DefaultAllocator: Allocator<N1, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    <N1 as AbsDiffEq<N1>>::Epsilon: Copy,
    <N2 as AbsDiffEq<N2>>::Epsilon: Copy, 

fn to_superset(&self) -> Transform<N2, D, C2>

The inclusion map: converts self to the equivalent element of its superset.

fn is_in_subset(t: &Transform<N2, D, C2>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

unsafe fn from_superset_unchecked(
    t: &Transform<N2, D, C2>
) -> Transform<N1, D, C1>

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

default fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl<N1, N2, C> SubsetOf<Transform<N2, U2, C>> for Unit<Complex<N1>> where
    C: SuperTCategoryOf<TAffine>,
    N1: RealField,
    N2: RealField + SupersetOf<N1>, 

fn to_superset(&self) -> Transform<N2, U2, C>

The inclusion map: converts self to the equivalent element of its superset.

fn is_in_subset(t: &Transform<N2, U2, C>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

unsafe fn from_superset_unchecked(t: &Transform<N2, U2, C>) -> Unit<Complex<N1>>

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

default fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl<N1, N2, D, R, C> SubsetOf<Transform<N2, D, C>> for Isometry<N1, D, R> where
    C: SuperTCategoryOf<TAffine>,
    D: DimNameAdd<U1> + DimMin<D, Output = D>,
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    R: Rotation<Point<N1, D>> + SubsetOf<Matrix<N1, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N1, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> + SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>>,
    DefaultAllocator: Allocator<N1, D, U1>,
    DefaultAllocator: Allocator<N1, D, D>,
    DefaultAllocator: Allocator<N1, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<(usize, usize), D, U1>,
    DefaultAllocator: Allocator<N2, D, D>,
    DefaultAllocator: Allocator<N2, D, U1>, 

fn to_superset(&self) -> Transform<N2, D, C>

The inclusion map: converts self to the equivalent element of its superset.

fn is_in_subset(t: &Transform<N2, D, C>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

unsafe fn from_superset_unchecked(t: &Transform<N2, D, C>) -> Isometry<N1, D, R>

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

default fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl<N1, N2, D, C> SubsetOf<Transform<N2, D, C>> for Translation<N1, D> where
    C: SuperTCategoryOf<TAffine>,
    D: DimNameAdd<U1>,
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    DefaultAllocator: Allocator<N1, D, U1>,
    DefaultAllocator: Allocator<N2, D, U1>,
    DefaultAllocator: Allocator<N1, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn to_superset(&self) -> Transform<N2, D, C>

The inclusion map: converts self to the equivalent element of its superset.

fn is_in_subset(t: &Transform<N2, D, C>) -> bool

Checks if element is actually part of the subset Self (and can be converted to it).

unsafe fn from_superset_unchecked(t: &Transform<N2, D, C>) -> Translation<N1, D>

Use with care! Same as self.to_superset but without any property checks. Always succeeds.

default fn from_superset(element: &T) -> Option<Self>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset.

impl<N, D, C> AbstractMagma<Multiplicative> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn operate(&self, rhs: &Transform<N, D, C>) -> Transform<N, D, C>

Performs an operation.

default fn op(&self, O, lhs: &Self) -> Self

Performs specific operation.

impl<N, D, C> Transformation<Point<N, D>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, D, U1>, 

fn transform_point(&self, pt: &Point<N, D>) -> Point<N, D>

Applies this group's action on a point from the euclidean space.

fn transform_vector(
    &self,
    v: &Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>
) -> Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>

Applies this group's action on a vector from the euclidean space.

impl<N, D, C> UlpsEq<Transform<N, D, C>> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    <N as AbsDiffEq<N>>::Epsilon: Copy,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn default_max_ulps() -> u32

The default ULPs to tolerate when testing values that are far-apart.

fn ulps_eq(
    &self,
    other: &Transform<N, D, C>,
    epsilon: <Transform<N, D, C> as AbsDiffEq<Transform<N, D, C>>>::Epsilon,
    max_ulps: u32
) -> bool

A test for equality that uses units in the last place (ULP) if the values are far apart.

default fn ulps_ne(
    &self,
    other: &Rhs,
    epsilon: Self::Epsilon,
    max_ulps: u32
) -> bool

The inverse of ApproxEq::ulps_eq.

impl<'a, N, D, CA, CB> Div<Transform<N, D, CB>> for &'a Transform<N, D, CA> where
    CA: TCategoryMul<CB>,
    CB: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <CA as TCategoryMul<CB>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Transform<N, D, CB>
) -> <&'a Transform<N, D, CA> as Div<Transform<N, D, CB>>>::Output

Performs the / operation.

impl<'b, N, D, C> Div<&'b Rotation<N, D>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, D>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Rotation<N, D>
) -> <Transform<N, D, C> as Div<&'b Rotation<N, D>>>::Output

Performs the / operation.

impl<'b, N, C> Div<&'b Transform<N, U3, C>> for Unit<Quaternion<N>> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U4>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Div<&'b Transform<N, U3, C>>>::Output

Performs the / operation.

impl<'a, 'b, N, D, C> Div<&'b Translation<N, D>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Translation<N, D>
) -> <&'a Transform<N, D, C> as Div<&'b Translation<N, D>>>::Output

Performs the / operation.

impl<N, D, C> Div<Transform<N, D, C>> for Translation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Transform<N, D, C>
) -> <Translation<N, D> as Div<Transform<N, D, C>>>::Output

Performs the / operation.

impl<N, D, C> Div<Translation<N, D>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Translation<N, D>
) -> <Transform<N, D, C> as Div<Translation<N, D>>>::Output

Performs the / operation.

impl<N, C> Div<Transform<N, U3, C>> for Unit<Quaternion<N>> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U4>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Div<Transform<N, U3, C>>>::Output

Performs the / operation.

impl<'b, N, D, C> Div<&'b Translation<N, D>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Translation<N, D>
) -> <Transform<N, D, C> as Div<&'b Translation<N, D>>>::Output

Performs the / operation.

impl<'b, N, D, C> Div<&'b Transform<N, D, C>> for Translation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Transform<N, D, C>
) -> <Translation<N, D> as Div<&'b Transform<N, D, C>>>::Output

Performs the / operation.

impl<'a, 'b, N, D, C> Div<&'b Transform<N, D, C>> for &'a Translation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Transform<N, D, C>
) -> <&'a Translation<N, D> as Div<&'b Transform<N, D, C>>>::Output

Performs the / operation.

impl<'a, 'b, N, D, C> Div<&'b Transform<N, D, C>> for &'a Rotation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Transform<N, D, C>
) -> <&'a Rotation<N, D> as Div<&'b Transform<N, D, C>>>::Output

Performs the / operation.

impl<N, C> Div<Unit<Quaternion<N>>> for Transform<N, U3, C> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Div<Unit<Quaternion<N>>>>::Output

Performs the / operation.

impl<'b, N, D, CA, CB> Div<&'b Transform<N, D, CB>> for Transform<N, D, CA> where
    CA: TCategoryMul<CB>,
    CB: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <CA as TCategoryMul<CB>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Transform<N, D, CB>
) -> <Transform<N, D, CA> as Div<&'b Transform<N, D, CB>>>::Output

Performs the / operation.

impl<N, D, C> Div<Transform<N, D, C>> for Rotation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Transform<N, D, C>
) -> <Rotation<N, D> as Div<Transform<N, D, C>>>::Output

Performs the / operation.

impl<'b, N, D, C> Div<&'b Transform<N, D, C>> for Rotation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Transform<N, D, C>
) -> <Rotation<N, D> as Div<&'b Transform<N, D, C>>>::Output

Performs the / operation.

impl<'b, N, C> Div<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Div<&'b Unit<Quaternion<N>>>>::Output

Performs the / operation.

impl<'a, N, D, C> Div<Transform<N, D, C>> for &'a Translation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Transform<N, D, C>
) -> <&'a Translation<N, D> as Div<Transform<N, D, C>>>::Output

Performs the / operation.

impl<'a, 'b, N, C> Div<&'b Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Div<&'b Unit<Quaternion<N>>>>::Output

Performs the / operation.

impl<'a, 'b, N, D, CA, CB> Div<&'b Transform<N, D, CB>> for &'a Transform<N, D, CA> where
    CA: TCategoryMul<CB>,
    CB: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <CA as TCategoryMul<CB>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Transform<N, D, CB>
) -> <&'a Transform<N, D, CA> as Div<&'b Transform<N, D, CB>>>::Output

Performs the / operation.

impl<'a, 'b, N, C> Div<&'b Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U4>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Transform<N, U3, C>>>::Output

Performs the / operation.

impl<N, D, CA, CB> Div<Transform<N, D, CB>> for Transform<N, D, CA> where
    CA: TCategoryMul<CB>,
    CB: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <CA as TCategoryMul<CB>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Transform<N, D, CB>
) -> <Transform<N, D, CA> as Div<Transform<N, D, CB>>>::Output

Performs the / operation.

impl<'a, N, C> Div<Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Div<Unit<Quaternion<N>>>>::Output

Performs the / operation.

impl<N, D, C> Div<Rotation<N, D>> for Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, D>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Rotation<N, D>
) -> <Transform<N, D, C> as Div<Rotation<N, D>>>::Output

Performs the / operation.

impl<'a, 'b, N, D, C> Div<&'b Rotation<N, D>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, D>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: &'b Rotation<N, D>
) -> <&'a Transform<N, D, C> as Div<&'b Rotation<N, D>>>::Output

Performs the / operation.

impl<'a, N, D, C> Div<Transform<N, D, C>> for &'a Rotation<N, D> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, <D as DimNameAdd<U1>>::Output>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Transform<N, D, C>
) -> <&'a Rotation<N, D> as Div<Transform<N, D, C>>>::Output

Performs the / operation.

impl<'a, N, C> Div<Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
    C: TCategoryMul<TAffine>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U4>,
    DefaultAllocator: Allocator<N, U4, U4>, 

type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Div<Transform<N, U3, C>>>::Output

Performs the / operation.

impl<'a, N, D, C> Div<Translation<N, D>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, U1>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Translation<N, D>
) -> <&'a Transform<N, D, C> as Div<Translation<N, D>>>::Output

Performs the / operation.

impl<'a, N, D, C> Div<Rotation<N, D>> for &'a Transform<N, D, C> where
    C: TCategoryMul<TAffine>,
    D: DimNameAdd<U1>,
    N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>,
    DefaultAllocator: Allocator<N, D, D>,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, D>, 

type Output = Transform<N, D, <C as TCategoryMul<TAffine>>::Representative>

The resulting type after applying the / operator.

fn div(
    self,
    rhs: Rotation<N, D>
) -> <&'a Transform<N, D, C> as Div<Rotation<N, D>>>::Output

Performs the / operation.

impl<N, D, C> AbstractMonoid<Multiplicative> for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

default fn prop_operating_identity_element_is_noop_approx(args: (Self,)) -> bool where
    Self: RelativeEq<Self>, 

Checks whether operating with the identity element is a no-op for the given argument. Approximate equality is used for verifications.

default fn prop_operating_identity_element_is_noop(args: (Self,)) -> bool where
    Self: Eq, 

Checks whether operating with the identity element is a no-op for the given argument.

impl<N, D> IndexMut<(usize, usize)> for Transform<N, D, TGeneral> where
    D: DimName + DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn index_mut(&mut self, ij: (usize, usize)) -> &mut N

Performs the mutable indexing (container[index]) operation.

impl<N, D, C> AbstractQuasigroup<Multiplicative> for Transform<N, D, C> where
    C: SubTCategoryOf<TProjective>,
    D: DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

default fn prop_inv_is_latin_square_approx(args: (Self, Self)) -> bool where
    Self: RelativeEq<Self>, 

Returns true if latin squareness holds for the given arguments. Approximate equality is used for verifications.

default fn prop_inv_is_latin_square(args: (Self, Self)) -> bool where
    Self: Eq, 

Returns true if latin squareness holds for the given arguments.

impl<N, D, C> Index<(usize, usize)> for Transform<N, D, C> where
    C: TCategory,
    D: DimName + DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

type Output = N

The returned type after indexing.

fn index(&self, ij: (usize, usize)) -> &N

Performs the indexing (container[index]) operation.

impl<N, D, C> Eq for Transform<N, D, C> where
    C: TCategory,
    D: DimNameAdd<U1>,
    N: Eq + RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

impl<N, D, C> From<Transform<N, D, C>> for Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer> where
    C: TCategory,
    D: DimName + DimNameAdd<U1>,
    N: RealField,
    DefaultAllocator: Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>, 

fn from(
    t: Transform<N, D, C>
) -> Matrix<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>

Performs the conversion.