Type Alias oxygengine_physics_2d::prelude::nalgebra::geometry::Affine3

pub type Affine3<T> = Transform<T, TAffine, 3>;

A 3D affine transformation. Stored as a homogeneous 4x4 matrix.

Aliased Type

struct Affine3<T> { /* private fields */ }

Implementations

impl<T, C, const D: usize> Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

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<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::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<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer>

👎Deprecated: use .into_inner() instead

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

pub fn matrix( &self ) -> &Matrix<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::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<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::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<T, CNew, D>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<T, C, D>

👎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<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::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<T, C, D>>

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<T, C, D>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<T, C, const D: usize> Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, Const<1>>,

pub fn transform_point(&self, pt: &OPoint<T, Const<D>>) -> OPoint<T, Const<D>>

Transform the given point by this transformation.

This is the same as the multiplication self * pt.

pub fn transform_vector( &self, v: &Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>> ) -> Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>

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

This is the same as the multiplication self * v.

impl<T, C, const D: usize> Transform<T, C, D>where T: RealField, C: TCategory + SubTCategoryOf<TProjective>, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, Const<1>>,

pub fn inverse_transform_point( &self, pt: &OPoint<T, Const<D>> ) -> OPoint<T, Const<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<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>> ) -> Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>

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

impl<T, C, const D: usize> Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

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<T, C, const D: usize> AbsDiffEq<Transform<T, C, D>> for Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, <T as AbsDiffEq<T>>::Epsilon: Clone, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

Used for specifying relative comparisons.

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

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

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

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

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

The inverse of [AbsDiffEq::abs_diff_eq].

impl<T, C, const D: usize> Clone for Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T, C, const D: usize> Debug for Transform<T, C, D>where T: Debug + RealField, C: Debug + TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

Formats the value using the given formatter.

impl<'a, T, C, const D: usize> Deserialize<'a> for Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer: Deserialize<'a>,

fn deserialize<Des>( deserializer: Des ) -> Result<Transform<T, C, D>, <Des as Deserializer<'a>>::Error>where Des: Deserializer<'a>,

Deserialize this value from the given Serde deserializer.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T, C> Div<&'b Unit<Quaternion<T>>> for Transform<T, C, 3>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, C: TCategoryMul<TAffine>,

type Output = Transform<T, <C as TCategoryMul<TAffine>>::Representative, 3>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T, C, const D: usize> Div<Rotation<T, D>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategoryMul<TAffine>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T, CA, CB, const D: usize> Div<Transform<T, CB, D>> for Transform<T, CA, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, CA: TCategoryMul<CB>, CB: SubTCategoryOf<TProjective>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T, C, const D: usize> Div<Translation<T, D>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategoryMul<TAffine>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T, C> Div<Unit<Quaternion<T>>> for Transform<T, C, 3>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, C: TCategoryMul<TAffine>,

type Output = Transform<T, <C as TCategoryMul<TAffine>>::Representative, 3>

The resulting type after applying the / operator.

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

Performs the / operation.

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

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

Performs the /= operation.

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

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

Performs the /= operation.

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

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

Performs the /= operation.

impl<'b, T, C> DivAssign<&'b Unit<Quaternion<T>>> for Transform<T, C, 3>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, C: TCategory,

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

Performs the /= operation.

impl<T, C, const D: usize> DivAssign<Rotation<T, D>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategory, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

Performs the /= operation.

impl<T, CA, CB, const D: usize> DivAssign<Transform<T, CB, D>> for Transform<T, CA, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, CA: SuperTCategoryOf<CB>, CB: SubTCategoryOf<TProjective>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

Performs the /= operation.

impl<T, C, const D: usize> DivAssign<Translation<T, D>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategory, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

Performs the /= operation.

impl<T, C> DivAssign<Unit<Quaternion<T>>> for Transform<T, C, 3>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, C: TCategory,

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

Performs the /= operation.

impl<T, C, const D: usize> Hash for Transform<T, C, D>where T: RealField + Hash, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer: Hash,

fn hash<H>(&self, state: &mut H)where H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T, C, const D: usize> Index<(usize, usize)> for Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, C, const D: usize> Mul<&'b Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategory, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

type Output = Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>> ) -> <Transform<T, C, D> as Mul<&'b Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>>>::Output

Performs the * operation.

impl<'b, T, C, const D: usize> Mul<&'b OPoint<T, Const<D>>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategory, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

type Output = OPoint<T, Const<D>>

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, C> Mul<&'b Unit<Quaternion<T>>> for Transform<T, C, 3>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, C: TCategoryMul<TAffine>,

type Output = Transform<T, <C as TCategoryMul<TAffine>>::Representative, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, C, const D: usize> Mul<Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategory, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

type Output = Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>

The resulting type after applying the * operator.

fn mul( self, rhs: Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>> ) -> <Transform<T, C, D> as Mul<Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>>>::Output

Performs the * operation.

impl<T, C, const D: usize> Mul<OPoint<T, Const<D>>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategory, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

type Output = OPoint<T, Const<D>>

The resulting type after applying the * operator.

fn mul( self, rhs: OPoint<T, Const<D>> ) -> <Transform<T, C, D> as Mul<OPoint<T, Const<D>>>>::Output

Performs the * operation.

impl<T, C, const D: usize> Mul<Rotation<T, D>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategoryMul<TAffine>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, CA, CB, const D: usize> Mul<Transform<T, CB, D>> for Transform<T, CA, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, CA: TCategoryMul<CB>, CB: TCategory, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, C, const D: usize> Mul<Translation<T, D>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategoryMul<TAffine>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, C> Mul<Unit<Quaternion<T>>> for Transform<T, C, 3>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, C: TCategoryMul<TAffine>,

type Output = Transform<T, <C as TCategoryMul<TAffine>>::Representative, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

Performs the *= operation.

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

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

Performs the *= operation.

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

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

Performs the *= operation.

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

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

Performs the *= operation.

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

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

Performs the *= operation.

impl<'b, T, C> MulAssign<&'b Unit<Quaternion<T>>> for Transform<T, C, 3>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, C: TCategory,

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

Performs the *= operation.

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

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

Performs the *= operation.

impl<T, C, const D: usize> MulAssign<Rotation<T, D>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategory, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

Performs the *= operation.

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

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

Performs the *= operation.

impl<T, CA, CB, const D: usize> MulAssign<Transform<T, CB, D>> for Transform<T, CA, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, CA: TCategory, CB: SubTCategoryOf<CA>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

Performs the *= operation.

impl<T, C, const D: usize> MulAssign<Translation<T, D>> for Transform<T, C, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, Const<D>: DimNameAdd<Const<1>>, C: TCategory, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

Performs the *= operation.

impl<T, C> MulAssign<Unit<Quaternion<T>>> for Transform<T, C, 3>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + RealField, C: TCategory,

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

Performs the *= operation.

impl<T, C, const D: usize> One for Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

Creates a new identity transform.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

fn is_one(&self) -> boolwhere Self: PartialEq<Self>,

Returns true if self is equal to the multiplicative identity.

impl<T, C, const D: usize> PartialEq<Transform<T, C, D>> for Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

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

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T, C, const D: usize> RelativeEq<Transform<T, C, D>> for Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, <T as AbsDiffEq<T>>::Epsilon: Clone, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

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

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

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

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

The inverse of [RelativeEq::relative_eq].

impl<T, C, const D: usize> Serialize for Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer: Serialize,

fn serialize<S>( &self, serializer: S ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, C, const D: usize> SimdValue for Transform<T, C, D>where T: RealField, <T as SimdValue>::Element: Scalar, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<<T as SimdValue>::Element, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

type Element = Transform<<T as SimdValue>::Element, C, D>

The type of the elements of each lane of this SIMD value.

type SimdBool = <T as SimdValue>::SimdBool

Type of the result of comparing two SIMD values like self.

fn lanes() -> usize

The number of lanes of this SIMD value.

fn splat(val: <Transform<T, C, D> as SimdValue>::Element) -> Transform<T, C, D>

Initializes an SIMD value with each lanes set to val.

fn extract(&self, i: usize) -> <Transform<T, C, D> as SimdValue>::Element

Extracts the i-th lane of self.

unsafe fn extract_unchecked( &self, i: usize ) -> <Transform<T, C, D> as SimdValue>::Element

Extracts the i-th lane of self without bound-checking.

fn replace(&mut self, i: usize, val: <Transform<T, C, D> as SimdValue>::Element)

Replaces the i-th lane of self by val.

unsafe fn replace_unchecked( &mut self, i: usize, val: <Transform<T, C, D> as SimdValue>::Element )

Replaces the i-th lane of self by val without bound-checking.

fn select( self, cond: <Transform<T, C, D> as SimdValue>::SimdBool, other: Transform<T, C, D> ) -> Transform<T, C, D>

Merges self and other depending on the lanes of cond.

fn map_lanes(self, f: impl Fn(Self::Element) -> Self::Element) -> Selfwhere Self: Clone,

Applies a function to each lane of self.

fn zip_map_lanes( self, b: Self, f: impl Fn(Self::Element, Self::Element) -> Self::Element ) -> Selfwhere Self: Clone,

Applies a function to each lane of self paired with the corresponding lane of b.

impl<T1, T2, C, const D: usize> SubsetOf<Matrix<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer>> for Transform<T1, C, D>where T1: RealField + SubsetOf<T2>, T2: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>, <T1 as AbsDiffEq<T1>>::Epsilon: Copy, <T2 as AbsDiffEq<T2>>::Epsilon: Copy,

fn to_superset( &self ) -> Matrix<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer>

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

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

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

fn from_superset_unchecked( m: &Matrix<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer> ) -> Transform<T1, C, D>

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

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

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

impl<T1, T2, C1, C2, const D: usize> SubsetOf<Transform<T2, C2, D>> for Transform<T1, C1, D>where T1: RealField + SubsetOf<T2>, T2: RealField, C1: TCategory, C2: SuperTCategoryOf<C1>, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>, <T1 as AbsDiffEq<T1>>::Epsilon: Copy, <T2 as AbsDiffEq<T2>>::Epsilon: Copy,

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

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

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

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

fn from_superset_unchecked(t: &Transform<T2, C2, D>) -> Transform<T1, C1, D>

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

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

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

impl<T, C, const D: usize> UlpsEq<Transform<T, C, D>> for Transform<T, C, D>where T: RealField, C: TCategory, Const<D>: DimNameAdd<Const<1>>, <T as AbsDiffEq<T>>::Epsilon: Clone, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

fn default_max_ulps() -> u32

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

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

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

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

The inverse of [UlpsEq::ulps_eq].

impl<T, C, const D: usize> Copy for Transform<T, C, D>where T: RealField + Copy, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer: Copy,

impl<T, C, const D: usize> Eq for Transform<T, C, D>where T: RealField + Eq, C: TCategory, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,