Struct nalgebra::geometry::Similarity

#[repr(C)]
pub struct Similarity<N: Scalar, D: DimName, R> where
    DefaultAllocator: Allocator<N, D>,  {
    pub isometry: Isometry<N, D, R>,
    // some fields omitted
}

A similarity, i.e., an uniform scaling, followed by a rotation, followed by a translation.

Fields

isometry: Isometry<N, D, R>

The part of this similarity that does not include the scaling factor.

Implementations

impl<N: Scalar + Zero, D: DimName, R> Similarity<N, D, R> where
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

pub fn from_parts(
    translation: Translation<N, D>,
    rotation: R,
    scaling: N
) -> Self

Creates a new similarity from its rotational and translational parts.

pub fn from_isometry(isometry: Isometry<N, D, R>, scaling: N) -> Self

Creates a new similarity from its rotational and translational parts.

pub fn set_scaling(&mut self, scaling: N)

The scaling factor of this similarity transformation.

impl<N: Scalar, D: DimName, R> Similarity<N, D, R> where
    DefaultAllocator: Allocator<N, D>, 

pub fn scaling(&self) -> N

The scaling factor of this similarity transformation.

impl<N: SimdRealField, D: DimName, R> Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

pub fn from_scaling(scaling: N) -> Self

Creates a new similarity that applies only a scaling factor.

#[must_use = "Did you mean to use inverse_mut()?"]

pub fn inverse(&self) -> Self

Inverts self.

pub fn inverse_mut(&mut self)

Inverts self in-place.

#[must_use = "Did you mean to use prepend_scaling_mut()?"]

pub fn prepend_scaling(&self, scaling: N) -> Self

The similarity transformation that applies a scaling factor scaling before self.

#[must_use = "Did you mean to use append_scaling_mut()?"]

pub fn append_scaling(&self, scaling: N) -> Self

The similarity transformation that applies a scaling factor scaling after self.

pub fn prepend_scaling_mut(&mut self, scaling: N)

Sets self to the similarity transformation that applies a scaling factor scaling before self.

pub fn append_scaling_mut(&mut self, scaling: N)

Sets self to the similarity transformation that applies a scaling factor scaling after self.

pub fn append_translation_mut(&mut self, t: &Translation<N, D>)

Appends to self the given translation in-place.

pub fn append_rotation_mut(&mut self, r: &R)

Appends to self the given rotation in-place.

pub fn append_rotation_wrt_point_mut(&mut self, r: &R, p: &Point<N, D>)

Appends in-place to self a rotation centered at the point p, i.e., the rotation that lets p invariant.

pub fn append_rotation_wrt_center_mut(&mut self, r: &R)

Appends in-place to self a rotation centered at the point with coordinates self.translation.

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

Transform the given point by this similarity.

This is the same as the multiplication self * pt.

Example

let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
let translation = Vector3::new(1.0, 2.0, 3.0);
let sim = Similarity3::new(translation, axisangle, 3.0);
let transformed_point = sim.transform_point(&Point3::new(4.0, 5.0, 6.0));
assert_relative_eq!(transformed_point, Point3::new(19.0, 17.0, -9.0), epsilon = 1.0e-5);

pub fn transform_vector(&self, v: &VectorN<N, D>) -> VectorN<N, D>

Transform the given vector by this similarity, ignoring the translational component.

This is the same as the multiplication self * t.

Example

let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
let translation = Vector3::new(1.0, 2.0, 3.0);
let sim = Similarity3::new(translation, axisangle, 3.0);
let transformed_vector = sim.transform_vector(&Vector3::new(4.0, 5.0, 6.0));
assert_relative_eq!(transformed_vector, Vector3::new(18.0, 15.0, -12.0), epsilon = 1.0e-5);

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

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

Example

let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
let translation = Vector3::new(1.0, 2.0, 3.0);
let sim = Similarity3::new(translation, axisangle, 2.0);
let transformed_point = sim.inverse_transform_point(&Point3::new(4.0, 5.0, 6.0));
assert_relative_eq!(transformed_point, Point3::new(-1.5, 1.5, 1.5), epsilon = 1.0e-5);

pub fn inverse_transform_vector(&self, v: &VectorN<N, D>) -> VectorN<N, D>

Transform the given vector by the inverse of this similarity, ignoring the translational component. This may be cheaper than inverting the similarity and then transforming the given vector.

Example

let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
let translation = Vector3::new(1.0, 2.0, 3.0);
let sim = Similarity3::new(translation, axisangle, 2.0);
let transformed_vector = sim.inverse_transform_vector(&Vector3::new(4.0, 5.0, 6.0));
assert_relative_eq!(transformed_vector, Vector3::new(-3.0, 2.5, 2.0), epsilon = 1.0e-5);

impl<N: SimdRealField, D: DimName, R> Similarity<N, D, R> where
    DefaultAllocator: Allocator<N, D>, 

pub fn to_homogeneous(&self) -> MatrixN<N, DimNameSum<D, U1>> where
    D: DimNameAdd<U1>,
    R: SubsetOf<MatrixN<N, DimNameSum<D, U1>>>,
    DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>>, 

Converts this similarity into its equivalent homogeneous transformation matrix.

impl<N: SimdRealField, D: DimName, R> Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

pub fn identity() -> Self

Creates a new identity similarity.

Example

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

let sim = Similarity3::identity();
let pt = Point3::new(1.0, 2.0, 3.0);
assert_eq!(sim * pt, pt);

impl<N: SimdRealField, D: DimName, R> Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

pub fn rotation_wrt_point(r: R, p: Point<N, D>, scaling: N) -> Self

The similarity that applies the scaling factor scaling, followed by the rotation r with its axis passing through the point p.

Example

let rot = UnitComplex::new(f32::consts::FRAC_PI_2);
let pt = Point2::new(3.0, 2.0);
let sim = Similarity2::rotation_wrt_point(rot, pt, 4.0);

assert_relative_eq!(sim * Point2::new(1.0, 2.0), Point2::new(-3.0, 3.0), epsilon = 1.0e-6);

impl<N: SimdRealField> Similarity<N, U2, Rotation2<N>> where
    N::Element: SimdRealField, 

pub fn new(translation: Vector2<N>, angle: N, scaling: N) -> Self

Creates a new similarity from a translation, a rotation, and an uniform scaling factor.

Example

let sim = SimilarityMatrix2::new(Vector2::new(1.0, 2.0), f32::consts::FRAC_PI_2, 3.0);

assert_relative_eq!(sim * Point2::new(2.0, 4.0), Point2::new(-11.0, 8.0), epsilon = 1.0e-6);

impl<N: SimdRealField> Similarity<N, U2, UnitComplex<N>> where
    N::Element: SimdRealField, 

pub fn new(translation: Vector2<N>, angle: N, scaling: N) -> Self

Creates a new similarity from a translation and a rotation angle.

Example

let sim = Similarity2::new(Vector2::new(1.0, 2.0), f32::consts::FRAC_PI_2, 3.0);

assert_relative_eq!(sim * Point2::new(2.0, 4.0), Point2::new(-11.0, 8.0), epsilon = 1.0e-6);

impl<N: SimdRealField> Similarity<N, U3, Rotation3<N>> where
    N::Element: SimdRealField, 

pub fn new(translation: Vector3<N>, axisangle: Vector3<N>, scaling: N) -> Self

Creates a new similarity from a translation, rotation axis-angle, and scaling factor.

Example

let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
let translation = Vector3::new(1.0, 2.0, 3.0);
// Point and vector being transformed in the tests.
let pt = Point3::new(4.0, 5.0, 6.0);
let vec = Vector3::new(4.0, 5.0, 6.0);

// Similarity with its rotation part represented as a UnitQuaternion
let sim = Similarity3::new(translation, axisangle, 3.0);
assert_relative_eq!(sim * pt, Point3::new(19.0, 17.0, -9.0), epsilon = 1.0e-5);
assert_relative_eq!(sim * vec, Vector3::new(18.0, 15.0, -12.0), epsilon = 1.0e-5);

// Similarity with its rotation part represented as a Rotation3 (a 3x3 rotation matrix).
let sim = SimilarityMatrix3::new(translation, axisangle, 3.0);
assert_relative_eq!(sim * pt, Point3::new(19.0, 17.0, -9.0), epsilon = 1.0e-5);
assert_relative_eq!(sim * vec, Vector3::new(18.0, 15.0, -12.0), epsilon = 1.0e-5);

pub fn face_towards(
    eye: &Point3<N>,
    target: &Point3<N>,
    up: &Vector3<N>,
    scaling: N
) -> Self

Creates an similarity that corresponds to a scaling factor and a local frame of an observer standing at the point eye and looking toward target.

It maps the view direction target - eye to the positive z axis and the origin to the eye.

Arguments

• eye - The observer position.
• target - The target position.
• up - Vertical direction. The only requirement of this parameter is to not be collinear to eye - at. Non-collinearity is not checked.

Example

let eye = Point3::new(1.0, 2.0, 3.0);
let target = Point3::new(2.0, 2.0, 3.0);
let up = Vector3::y();

// Similarity with its rotation part represented as a UnitQuaternion
let sim = Similarity3::face_towards(&eye, &target, &up, 3.0);
assert_eq!(sim * Point3::origin(), eye);
assert_relative_eq!(sim * Vector3::z(), Vector3::x() * 3.0, epsilon = 1.0e-6);

// Similarity with its rotation part represented as Rotation3 (a 3x3 rotation matrix).
let sim = SimilarityMatrix3::face_towards(&eye, &target, &up, 3.0);
assert_eq!(sim * Point3::origin(), eye);
assert_relative_eq!(sim * Vector3::z(), Vector3::x() * 3.0, epsilon = 1.0e-6);

pub fn new_observer_frames(
    eye: &Point3<N>,
    target: &Point3<N>,
    up: &Vector3<N>,
    scaling: N
) -> Self

👎 Deprecated:

renamed to face_towards

Deprecated: Use [SimilarityMatrix3::face_towards] instead.

pub fn look_at_rh(
    eye: &Point3<N>,
    target: &Point3<N>,
    up: &Vector3<N>,
    scaling: N
) -> Self

Builds a right-handed look-at view matrix including scaling factor.

This conforms to the common notion of right handed look-at matrix from the computer graphics community.

Arguments

• eye - The eye position.
• target - The target position.
• up - A vector approximately aligned with required the vertical axis. The only requirement of this parameter is to not be collinear to target - eye.

Example

let eye = Point3::new(1.0, 2.0, 3.0);
let target = Point3::new(2.0, 2.0, 3.0);
let up = Vector3::y();

// Similarity with its rotation part represented as a UnitQuaternion
let iso = Similarity3::look_at_rh(&eye, &target, &up, 3.0);
assert_relative_eq!(iso * Vector3::x(), -Vector3::z() * 3.0, epsilon = 1.0e-6);

// Similarity with its rotation part represented as Rotation3 (a 3x3 rotation matrix).
let iso = SimilarityMatrix3::look_at_rh(&eye, &target, &up, 3.0);
assert_relative_eq!(iso * Vector3::x(), -Vector3::z() * 3.0, epsilon = 1.0e-6);

pub fn look_at_lh(
    eye: &Point3<N>,
    target: &Point3<N>,
    up: &Vector3<N>,
    scaling: N
) -> Self

Builds a left-handed look-at view matrix including a scaling factor.

This conforms to the common notion of left handed look-at matrix from the computer graphics community.

Arguments

• eye - The eye position.
• target - The target position.
• up - A vector approximately aligned with required the vertical axis. The only requirement of this parameter is to not be collinear to target - eye.

Example

let eye = Point3::new(1.0, 2.0, 3.0);
let target = Point3::new(2.0, 2.0, 3.0);
let up = Vector3::y();

// Similarity with its rotation part represented as a UnitQuaternion
let sim = Similarity3::look_at_lh(&eye, &target, &up, 3.0);
assert_relative_eq!(sim * Vector3::x(), Vector3::z() * 3.0, epsilon = 1.0e-6);

// Similarity with its rotation part represented as Rotation3 (a 3x3 rotation matrix).
let sim = SimilarityMatrix3::look_at_lh(&eye, &target, &up, 3.0);
assert_relative_eq!(sim * Vector3::x(), Vector3::z() * 3.0, epsilon = 1.0e-6);

impl<N: SimdRealField> Similarity<N, U3, UnitQuaternion<N>> where
    N::Element: SimdRealField, 

pub fn new(translation: Vector3<N>, axisangle: Vector3<N>, scaling: N) -> Self

Creates a new similarity from a translation, rotation axis-angle, and scaling factor.

Example

let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
let translation = Vector3::new(1.0, 2.0, 3.0);
// Point and vector being transformed in the tests.
let pt = Point3::new(4.0, 5.0, 6.0);
let vec = Vector3::new(4.0, 5.0, 6.0);

// Similarity with its rotation part represented as a UnitQuaternion
let sim = Similarity3::new(translation, axisangle, 3.0);
assert_relative_eq!(sim * pt, Point3::new(19.0, 17.0, -9.0), epsilon = 1.0e-5);
assert_relative_eq!(sim * vec, Vector3::new(18.0, 15.0, -12.0), epsilon = 1.0e-5);

// Similarity with its rotation part represented as a Rotation3 (a 3x3 rotation matrix).
let sim = SimilarityMatrix3::new(translation, axisangle, 3.0);
assert_relative_eq!(sim * pt, Point3::new(19.0, 17.0, -9.0), epsilon = 1.0e-5);
assert_relative_eq!(sim * vec, Vector3::new(18.0, 15.0, -12.0), epsilon = 1.0e-5);

pub fn face_towards(
    eye: &Point3<N>,
    target: &Point3<N>,
    up: &Vector3<N>,
    scaling: N
) -> Self

Creates an similarity that corresponds to a scaling factor and a local frame of an observer standing at the point eye and looking toward target.

It maps the view direction target - eye to the positive z axis and the origin to the eye.

Arguments

• eye - The observer position.
• target - The target position.
• up - Vertical direction. The only requirement of this parameter is to not be collinear to eye - at. Non-collinearity is not checked.

Example

let eye = Point3::new(1.0, 2.0, 3.0);
let target = Point3::new(2.0, 2.0, 3.0);
let up = Vector3::y();

// Similarity with its rotation part represented as a UnitQuaternion
let sim = Similarity3::face_towards(&eye, &target, &up, 3.0);
assert_eq!(sim * Point3::origin(), eye);
assert_relative_eq!(sim * Vector3::z(), Vector3::x() * 3.0, epsilon = 1.0e-6);

// Similarity with its rotation part represented as Rotation3 (a 3x3 rotation matrix).
let sim = SimilarityMatrix3::face_towards(&eye, &target, &up, 3.0);
assert_eq!(sim * Point3::origin(), eye);
assert_relative_eq!(sim * Vector3::z(), Vector3::x() * 3.0, epsilon = 1.0e-6);

pub fn new_observer_frames(
    eye: &Point3<N>,
    target: &Point3<N>,
    up: &Vector3<N>,
    scaling: N
) -> Self

👎 Deprecated:

renamed to face_towards

Deprecated: Use [SimilarityMatrix3::face_towards] instead.

pub fn look_at_rh(
    eye: &Point3<N>,
    target: &Point3<N>,
    up: &Vector3<N>,
    scaling: N
) -> Self

Builds a right-handed look-at view matrix including scaling factor.

This conforms to the common notion of right handed look-at matrix from the computer graphics community.

Arguments

• eye - The eye position.
• target - The target position.
• up - A vector approximately aligned with required the vertical axis. The only requirement of this parameter is to not be collinear to target - eye.

Example

let eye = Point3::new(1.0, 2.0, 3.0);
let target = Point3::new(2.0, 2.0, 3.0);
let up = Vector3::y();

// Similarity with its rotation part represented as a UnitQuaternion
let iso = Similarity3::look_at_rh(&eye, &target, &up, 3.0);
assert_relative_eq!(iso * Vector3::x(), -Vector3::z() * 3.0, epsilon = 1.0e-6);

// Similarity with its rotation part represented as Rotation3 (a 3x3 rotation matrix).
let iso = SimilarityMatrix3::look_at_rh(&eye, &target, &up, 3.0);
assert_relative_eq!(iso * Vector3::x(), -Vector3::z() * 3.0, epsilon = 1.0e-6);

pub fn look_at_lh(
    eye: &Point3<N>,
    target: &Point3<N>,
    up: &Vector3<N>,
    scaling: N
) -> Self

Builds a left-handed look-at view matrix including a scaling factor.

This conforms to the common notion of left handed look-at matrix from the computer graphics community.

Arguments

• eye - The eye position.
• target - The target position.
• up - A vector approximately aligned with required the vertical axis. The only requirement of this parameter is to not be collinear to target - eye.

Example

let eye = Point3::new(1.0, 2.0, 3.0);
let target = Point3::new(2.0, 2.0, 3.0);
let up = Vector3::y();

// Similarity with its rotation part represented as a UnitQuaternion
let sim = Similarity3::look_at_lh(&eye, &target, &up, 3.0);
assert_relative_eq!(sim * Vector3::x(), Vector3::z() * 3.0, epsilon = 1.0e-6);

// Similarity with its rotation part represented as Rotation3 (a 3x3 rotation matrix).
let sim = SimilarityMatrix3::look_at_lh(&eye, &target, &up, 3.0);
assert_relative_eq!(sim * Vector3::x(), Vector3::z() * 3.0, epsilon = 1.0e-6);

Trait Implementations

impl<N: RealField, D: DimName, R> AbsDiffEq<Similarity<N, D, R>> for Similarity<N, D, R> where
    R: AbstractRotation<N, D> + AbsDiffEq<Epsilon = N::Epsilon>,
    DefaultAllocator: Allocator<N, D>,
    N::Epsilon: Copy, 

type Epsilon = N::Epsilon

Used for specifying relative comparisons.

fn default_epsilon() -> Self::Epsilon

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

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

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

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

The inverse of AbsDiffEq::abs_diff_eq.

impl<N: Scalar + Zero, D: DimName, R: AbstractRotation<N, D> + Clone> Clone for Similarity<N, D, R> where
    DefaultAllocator: Allocator<N, D>, 

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug + Scalar, D: Debug + DimName, R: Debug> Debug for Similarity<N, D, R> where
    DefaultAllocator: Allocator<N, D>, 

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

Formats the value using the given formatter.

impl<'de, N: Scalar, D: DimName, R> Deserialize<'de> for Similarity<N, D, R> where
    DefaultAllocator: Allocator<N, D>,
    N: Deserialize<'de>,
    R: Deserialize<'de>,
    DefaultAllocator: Allocator<N, D>,
    Owned<N, D>: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<N, D: DimName, R> Display for Similarity<N, D, R> where
    N: RealField + Display,
    R: AbstractRotation<N, D> + Display,
    DefaultAllocator: Allocator<N, D> + Allocator<usize, D>, 

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

Formats the value using the given formatter.

impl<N: RealField, D: DimName, R> Distribution<Similarity<N, D, R>> for Standard where
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>,
    Standard: Distribution<N> + Distribution<R>, 

fn sample<'a, G: Rng + ?Sized>(&self, rng: &mut G) -> Similarity<N, D, R>

Generate a random value of T, using rng as the source of randomness.

pub fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T> where
    R: Rng, 

Create an iterator that generates random values of T, using rng as the source of randomness.

impl<'b, N: SimdRealField, D: DimName, R> Div<&'b Isometry<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Isometry<N, D, R>) -> Self::Output

Performs the / operation.

impl<'a, 'b, N: SimdRealField, D: DimName, R> Div<&'b Isometry<N, D, R>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Isometry<N, D, R>) -> Self::Output

Performs the / operation.

impl<'b, N: SimdRealField, D: DimName> Div<&'b Rotation<N, D>> for Similarity<N, D, Rotation<N, D>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Rotation<N, D>) -> Self::Output

Performs the / operation.

impl<'a, 'b, N: SimdRealField, D: DimName> Div<&'b Rotation<N, D>> for &'a Similarity<N, D, Rotation<N, D>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Rotation<N, D>) -> Self::Output

Performs the / operation.

impl<'b, N: SimdRealField, D: DimName, R> Div<&'b Similarity<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Similarity<N, D, R>) -> Self::Output

Performs the / operation.

impl<'a, 'b, N: SimdRealField, D: DimName, R> Div<&'b Similarity<N, D, R>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Similarity<N, D, R>) -> Self::Output

Performs the / operation.

impl<'b, N: SimdRealField, D: DimName, R> Div<&'b Similarity<N, D, R>> for Isometry<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Similarity<N, D, R>) -> Self::Output

Performs the / operation.

impl<'a, 'b, N: SimdRealField, D: DimName, R> Div<&'b Similarity<N, D, R>> for &'a Isometry<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Similarity<N, D, R>) -> Self::Output

Performs the / operation.

impl<'b, N: SimdRealField, D: DimName> Div<&'b Similarity<N, D, Rotation<N, D>>> for Rotation<N, D> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the / operator.

fn div(self, right: &'b Similarity<N, D, Rotation<N, D>>) -> Self::Output

Performs the / operation.

impl<'a, 'b, N: SimdRealField, D: DimName> Div<&'b Similarity<N, D, Rotation<N, D>>> for &'a Rotation<N, D> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the / operator.

fn div(self, right: &'b Similarity<N, D, Rotation<N, D>>) -> Self::Output

Performs the / operation.

impl<'b, N: SimdRealField> Div<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for UnitQuaternion<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the / operator.

fn div(self, right: &'b Similarity<N, U3, UnitQuaternion<N>>) -> Self::Output

Performs the / operation.

impl<'a, 'b, N: SimdRealField> Div<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for &'a UnitQuaternion<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the / operator.

fn div(self, right: &'b Similarity<N, U3, UnitQuaternion<N>>) -> Self::Output

Performs the / operation.

impl<'b, N: SimdRealField> Div<&'b Unit<Complex<N>>> for Similarity<N, U2, UnitComplex<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the / operator.

fn div(self, rhs: &'b UnitComplex<N>) -> Self::Output

Performs the / operation.

impl<'a, 'b, N: SimdRealField> Div<&'b Unit<Complex<N>>> for &'a Similarity<N, U2, UnitComplex<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the / operator.

fn div(self, rhs: &'b UnitComplex<N>) -> Self::Output

Performs the / operation.

impl<'b, N: SimdRealField> Div<&'b Unit<Quaternion<N>>> for Similarity<N, U3, UnitQuaternion<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the / operator.

fn div(self, rhs: &'b UnitQuaternion<N>) -> Self::Output

Performs the / operation.

impl<'a, 'b, N: SimdRealField> Div<&'b Unit<Quaternion<N>>> for &'a Similarity<N, U3, UnitQuaternion<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the / operator.

fn div(self, rhs: &'b UnitQuaternion<N>) -> Self::Output

Performs the / operation.

impl<N: SimdRealField, D: DimName, R> Div<Isometry<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: Isometry<N, D, R>) -> Self::Output

Performs the / operation.

impl<'a, N: SimdRealField, D: DimName, R> Div<Isometry<N, D, R>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: Isometry<N, D, R>) -> Self::Output

Performs the / operation.

impl<N: SimdRealField, D: DimName> Div<Rotation<N, D>> for Similarity<N, D, Rotation<N, D>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the / operator.

fn div(self, rhs: Rotation<N, D>) -> Self::Output

Performs the / operation.

impl<'a, N: SimdRealField, D: DimName> Div<Rotation<N, D>> for &'a Similarity<N, D, Rotation<N, D>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the / operator.

fn div(self, rhs: Rotation<N, D>) -> Self::Output

Performs the / operation.

impl<N: SimdRealField, D: DimName, R> Div<Similarity<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: Similarity<N, D, R>) -> Self::Output

Performs the / operation.

impl<'a, N: SimdRealField, D: DimName, R> Div<Similarity<N, D, R>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: Similarity<N, D, R>) -> Self::Output

Performs the / operation.

impl<N: SimdRealField, D: DimName, R> Div<Similarity<N, D, R>> for Isometry<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: Similarity<N, D, R>) -> Self::Output

Performs the / operation.

impl<'a, N: SimdRealField, D: DimName, R> Div<Similarity<N, D, R>> for &'a Isometry<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the / operator.

fn div(self, rhs: Similarity<N, D, R>) -> Self::Output

Performs the / operation.

impl<N: SimdRealField, D: DimName> Div<Similarity<N, D, Rotation<N, D>>> for Rotation<N, D> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the / operator.

fn div(self, right: Similarity<N, D, Rotation<N, D>>) -> Self::Output

Performs the / operation.

impl<'a, N: SimdRealField, D: DimName> Div<Similarity<N, D, Rotation<N, D>>> for &'a Rotation<N, D> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the / operator.

fn div(self, right: Similarity<N, D, Rotation<N, D>>) -> Self::Output

Performs the / operation.

impl<N: SimdRealField> Div<Similarity<N, U3, Unit<Quaternion<N>>>> for UnitQuaternion<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the / operator.

fn div(self, right: Similarity<N, U3, UnitQuaternion<N>>) -> Self::Output

Performs the / operation.

impl<'a, N: SimdRealField> Div<Similarity<N, U3, Unit<Quaternion<N>>>> for &'a UnitQuaternion<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the / operator.

fn div(self, right: Similarity<N, U3, UnitQuaternion<N>>) -> Self::Output

Performs the / operation.

impl<N: SimdRealField> Div<Unit<Complex<N>>> for Similarity<N, U2, UnitComplex<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the / operator.

fn div(self, rhs: UnitComplex<N>) -> Self::Output

Performs the / operation.

impl<'a, N: SimdRealField> Div<Unit<Complex<N>>> for &'a Similarity<N, U2, UnitComplex<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the / operator.

fn div(self, rhs: UnitComplex<N>) -> Self::Output

Performs the / operation.

impl<N: SimdRealField> Div<Unit<Quaternion<N>>> for Similarity<N, U3, UnitQuaternion<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the / operator.

fn div(self, rhs: UnitQuaternion<N>) -> Self::Output

Performs the / operation.

impl<'a, N: SimdRealField> Div<Unit<Quaternion<N>>> for &'a Similarity<N, U3, UnitQuaternion<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the / operator.

fn div(self, rhs: UnitQuaternion<N>) -> Self::Output

Performs the / operation.

impl<'b, N: SimdRealField, D: DimName, R> DivAssign<&'b Isometry<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

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

Performs the /= operation.

impl<'b, N, D: DimName> DivAssign<&'b Rotation<N, D>> for Similarity<N, D, Rotation<N, D>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, U1> + Allocator<N, D, D>, 

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

Performs the /= operation.

impl<'b, N: SimdRealField, D: DimName, R> DivAssign<&'b Similarity<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

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

Performs the /= operation.

impl<'b, N> DivAssign<&'b Unit<Complex<N>>> for Similarity<N, U2, UnitComplex<N>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U2>, 

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

Performs the /= operation.

impl<'b, N> DivAssign<&'b Unit<Quaternion<N>>> for Similarity<N, U3, UnitQuaternion<N>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U3, U3>, 

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

Performs the /= operation.

impl<N: SimdRealField, D: DimName, R> DivAssign<Isometry<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

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

Performs the /= operation.

impl<N, D: DimName> DivAssign<Rotation<N, D>> for Similarity<N, D, Rotation<N, D>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, U1> + Allocator<N, D, D>, 

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

Performs the /= operation.

impl<N: SimdRealField, D: DimName, R> DivAssign<Similarity<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

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

Performs the /= operation.

impl<N> DivAssign<Unit<Complex<N>>> for Similarity<N, U2, UnitComplex<N>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U2>, 

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

Performs the /= operation.

impl<N> DivAssign<Unit<Quaternion<N>>> for Similarity<N, U3, UnitQuaternion<N>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U3, U3>, 

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

Performs the /= operation.

impl<N: Scalar + Zero + PrimitiveSimdValue, D: DimName, R> From<[Similarity<<N as SimdValue>::Element, D, <R as SimdValue>::Element>; 16]> for Similarity<N, D, R> where
    N: From<[<N as SimdValue>::Element; 16]>,
    R: SimdValue + AbstractRotation<N, D> + From<[<R as SimdValue>::Element; 16]>,
    R::Element: AbstractRotation<N::Element, D>,
    N::Element: Scalar + Zero + Copy,
    R::Element: Scalar + Zero + Copy,
    DefaultAllocator: Allocator<N, D> + Allocator<N::Element, D>, 

fn from(arr: [Similarity<N::Element, D, R::Element>; 16]) -> Self

Performs the conversion.

impl<N: Scalar + Zero + PrimitiveSimdValue, D: DimName, R> From<[Similarity<<N as SimdValue>::Element, D, <R as SimdValue>::Element>; 2]> for Similarity<N, D, R> where
    N: From<[<N as SimdValue>::Element; 2]>,
    R: SimdValue + AbstractRotation<N, D> + From<[<R as SimdValue>::Element; 2]>,
    R::Element: AbstractRotation<N::Element, D>,
    N::Element: Scalar + Zero + Copy,
    R::Element: Scalar + Zero + Copy,
    DefaultAllocator: Allocator<N, D> + Allocator<N::Element, D>, 

fn from(arr: [Similarity<N::Element, D, R::Element>; 2]) -> Self

Performs the conversion.

impl<N: Scalar + Zero + PrimitiveSimdValue, D: DimName, R> From<[Similarity<<N as SimdValue>::Element, D, <R as SimdValue>::Element>; 4]> for Similarity<N, D, R> where
    N: From<[<N as SimdValue>::Element; 4]>,
    R: SimdValue + AbstractRotation<N, D> + From<[<R as SimdValue>::Element; 4]>,
    R::Element: AbstractRotation<N::Element, D>,
    N::Element: Scalar + Zero + Copy,
    R::Element: Scalar + Zero + Copy,
    DefaultAllocator: Allocator<N, D> + Allocator<N::Element, D>, 

fn from(arr: [Similarity<N::Element, D, R::Element>; 4]) -> Self

Performs the conversion.

impl<N: Scalar + Zero + PrimitiveSimdValue, D: DimName, R> From<[Similarity<<N as SimdValue>::Element, D, <R as SimdValue>::Element>; 8]> for Similarity<N, D, R> where
    N: From<[<N as SimdValue>::Element; 8]>,
    R: SimdValue + AbstractRotation<N, D> + From<[<R as SimdValue>::Element; 8]>,
    R::Element: AbstractRotation<N::Element, D>,
    N::Element: Scalar + Zero + Copy,
    R::Element: Scalar + Zero + Copy,
    DefaultAllocator: Allocator<N, D> + Allocator<N::Element, D>, 

fn from(arr: [Similarity<N::Element, D, R::Element>; 8]) -> Self

Performs the conversion.

impl<N: SimdRealField, D: DimName, R> From<Similarity<N, D, R>> for MatrixN<N, DimNameSum<D, U1>> where
    D: DimNameAdd<U1>,
    R: SubsetOf<MatrixN<N, DimNameSum<D, U1>>>,
    DefaultAllocator: Allocator<N, D> + Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>>, 

fn from(sim: Similarity<N, D, R>) -> Self

Performs the conversion.

impl<N: Scalar + Hash, D: DimName + Hash, R: Hash> Hash for Similarity<N, D, R> where
    DefaultAllocator: Allocator<N, D>,
    Owned<N, D>: Hash, 

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<'b, N: SimdRealField, D: DimName, R> Mul<&'b Isometry<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Isometry<N, D, R>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField, D: DimName, R> Mul<&'b Isometry<N, D, R>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Isometry<N, D, R>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField, D: DimName, R> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = VectorN<N, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b VectorN<N, D>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField, D: DimName, R> Mul<&'b Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = VectorN<N, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b VectorN<N, D>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField, D: DimName, R> Mul<&'b Point<N, D>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Point<N, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<N, D>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField, D: DimName, R> Mul<&'b Point<N, D>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Point<N, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<N, D>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField, D: DimName> Mul<&'b Rotation<N, D>> for Similarity<N, D, Rotation<N, D>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Rotation<N, D>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField, D: DimName> Mul<&'b Rotation<N, D>> for &'a Similarity<N, D, Rotation<N, D>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Rotation<N, D>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField, D: DimName, R> Mul<&'b Similarity<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField, D: DimName, R> Mul<&'b Similarity<N, D, R>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField, D: DimName, R> Mul<&'b Similarity<N, D, R>> for Isometry<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField, D: DimName, R> Mul<&'b Similarity<N, D, R>> for &'a Isometry<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField, D: DimName, R> Mul<&'b Similarity<N, D, R>> for Translation<N, D> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, right: &'b Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField, D: DimName, R> Mul<&'b Similarity<N, D, R>> for &'a Translation<N, D> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, right: &'b Similarity<N, D, R>) -> Self::Output

Performs the * operation.

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

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

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Similarity<N, D, R>) -> Self::Output

Performs the * operation.

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

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

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField, D: DimName> Mul<&'b Similarity<N, D, Rotation<N, D>>> for Rotation<N, D> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the * operator.

fn mul(self, right: &'b Similarity<N, D, Rotation<N, D>>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField, D: DimName> Mul<&'b Similarity<N, D, Rotation<N, D>>> for &'a Rotation<N, D> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the * operator.

fn mul(self, right: &'b Similarity<N, D, Rotation<N, D>>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField> Mul<&'b Similarity<N, U2, Unit<Complex<N>>>> for UnitComplex<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Similarity<N, U2, UnitComplex<N>>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField> Mul<&'b Similarity<N, U2, Unit<Complex<N>>>> for &'a UnitComplex<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Similarity<N, U2, UnitComplex<N>>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField> Mul<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for UnitQuaternion<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the * operator.

fn mul(self, right: &'b Similarity<N, U3, UnitQuaternion<N>>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField> Mul<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for &'a UnitQuaternion<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the * operator.

fn mul(self, right: &'b Similarity<N, U3, UnitQuaternion<N>>) -> Self::Output

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, N: SimdRealField, D: DimName, R> Mul<&'b Translation<N, D>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, right: &'b Translation<N, D>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField, D: DimName, R> Mul<&'b Translation<N, D>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, right: &'b Translation<N, D>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField> Mul<&'b Unit<Complex<N>>> for Similarity<N, U2, UnitComplex<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b UnitComplex<N>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField> Mul<&'b Unit<Complex<N>>> for &'a Similarity<N, U2, UnitComplex<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b UnitComplex<N>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField> Mul<&'b Unit<Quaternion<N>>> for Similarity<N, U3, UnitQuaternion<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b UnitQuaternion<N>) -> Self::Output

Performs the * operation.

impl<'a, 'b, N: SimdRealField> Mul<&'b Unit<Quaternion<N>>> for &'a Similarity<N, U3, UnitQuaternion<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b UnitQuaternion<N>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField, D: DimName, R> Mul<Isometry<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: Isometry<N, D, R>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField, D: DimName, R> Mul<Isometry<N, D, R>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: Isometry<N, D, R>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField, D: DimName, R> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = VectorN<N, D>

The resulting type after applying the * operator.

fn mul(self, right: VectorN<N, D>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField, D: DimName, R> Mul<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = VectorN<N, D>

The resulting type after applying the * operator.

fn mul(self, right: VectorN<N, D>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField, D: DimName, R> Mul<Point<N, D>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Point<N, D>

The resulting type after applying the * operator.

fn mul(self, right: Point<N, D>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField, D: DimName, R> Mul<Point<N, D>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Point<N, D>

The resulting type after applying the * operator.

fn mul(self, right: Point<N, D>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField, D: DimName> Mul<Rotation<N, D>> for Similarity<N, D, Rotation<N, D>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the * operator.

fn mul(self, rhs: Rotation<N, D>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField, D: DimName> Mul<Rotation<N, D>> for &'a Similarity<N, D, Rotation<N, D>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the * operator.

fn mul(self, rhs: Rotation<N, D>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField, D: DimName, R> Mul<Similarity<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField, D: DimName, R> Mul<Similarity<N, D, R>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField, D: DimName, R> Mul<Similarity<N, D, R>> for Isometry<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField, D: DimName, R> Mul<Similarity<N, D, R>> for &'a Isometry<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, rhs: Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField, D: DimName, R> Mul<Similarity<N, D, R>> for Translation<N, D> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, right: Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField, D: DimName, R> Mul<Similarity<N, D, R>> for &'a Translation<N, D> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, right: Similarity<N, D, R>) -> Self::Output

Performs the * operation.

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

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

The resulting type after applying the * operator.

fn mul(self, rhs: Similarity<N, D, R>) -> Self::Output

Performs the * operation.

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

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

The resulting type after applying the * operator.

fn mul(self, rhs: Similarity<N, D, R>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField, D: DimName> Mul<Similarity<N, D, Rotation<N, D>>> for Rotation<N, D> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the * operator.

fn mul(self, right: Similarity<N, D, Rotation<N, D>>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField, D: DimName> Mul<Similarity<N, D, Rotation<N, D>>> for &'a Rotation<N, D> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, 

type Output = Similarity<N, D, Rotation<N, D>>

The resulting type after applying the * operator.

fn mul(self, right: Similarity<N, D, Rotation<N, D>>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField> Mul<Similarity<N, U2, Unit<Complex<N>>>> for UnitComplex<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: Similarity<N, U2, UnitComplex<N>>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField> Mul<Similarity<N, U2, Unit<Complex<N>>>> for &'a UnitComplex<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: Similarity<N, U2, UnitComplex<N>>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField> Mul<Similarity<N, U3, Unit<Quaternion<N>>>> for UnitQuaternion<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the * operator.

fn mul(self, right: Similarity<N, U3, UnitQuaternion<N>>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField> Mul<Similarity<N, U3, Unit<Quaternion<N>>>> for &'a UnitQuaternion<N> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the * operator.

fn mul(self, right: Similarity<N, U3, UnitQuaternion<N>>) -> Self::Output

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N: SimdRealField, D: DimName, R> Mul<Translation<N, D>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, right: Translation<N, D>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField, D: DimName, R> Mul<Translation<N, D>> for &'a Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

type Output = Similarity<N, D, R>

The resulting type after applying the * operator.

fn mul(self, right: Translation<N, D>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField> Mul<Unit<Complex<N>>> for Similarity<N, U2, UnitComplex<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: UnitComplex<N>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField> Mul<Unit<Complex<N>>> for &'a Similarity<N, U2, UnitComplex<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Similarity<N, U2, UnitComplex<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: UnitComplex<N>) -> Self::Output

Performs the * operation.

impl<N: SimdRealField> Mul<Unit<Quaternion<N>>> for Similarity<N, U3, UnitQuaternion<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: UnitQuaternion<N>) -> Self::Output

Performs the * operation.

impl<'a, N: SimdRealField> Mul<Unit<Quaternion<N>>> for &'a Similarity<N, U3, UnitQuaternion<N>> where
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, UnitQuaternion<N>>

The resulting type after applying the * operator.

fn mul(self, rhs: UnitQuaternion<N>) -> Self::Output

Performs the * operation.

impl<'b, N: SimdRealField, D: DimName, R> MulAssign<&'b Isometry<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

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

Performs the *= operation.

impl<'b, N, D: DimName> MulAssign<&'b Rotation<N, D>> for Similarity<N, D, Rotation<N, D>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, U1> + Allocator<N, D, D>, 

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

Performs the *= operation.

impl<'b, N: SimdRealField, D: DimName, R> MulAssign<&'b Similarity<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

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

Performs the *= operation.

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

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

Performs the *= operation.

impl<'b, N: SimdRealField, D: DimName, R> MulAssign<&'b Translation<N, D>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

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

Performs the *= operation.

impl<'b, N> MulAssign<&'b Unit<Complex<N>>> for Similarity<N, U2, UnitComplex<N>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U2>, 

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

Performs the *= operation.

impl<'b, N> MulAssign<&'b Unit<Quaternion<N>>> for Similarity<N, U3, UnitQuaternion<N>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U3, U3>, 

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

Performs the *= operation.

impl<N: SimdRealField, D: DimName, R> MulAssign<Isometry<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

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

Performs the *= operation.

impl<N, D: DimName> MulAssign<Rotation<N, D>> for Similarity<N, D, Rotation<N, D>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, D, U1> + Allocator<N, D, D>, 

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

Performs the *= operation.

impl<N: SimdRealField, D: DimName, R> MulAssign<Similarity<N, D, R>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

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

Performs the *= operation.

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

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

Performs the *= operation.

impl<N: SimdRealField, D: DimName, R> MulAssign<Translation<N, D>> for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

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

Performs the *= operation.

impl<N> MulAssign<Unit<Complex<N>>> for Similarity<N, U2, UnitComplex<N>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U2, U2>, 

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

Performs the *= operation.

impl<N> MulAssign<Unit<Quaternion<N>>> for Similarity<N, U3, UnitQuaternion<N>> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + SimdRealField,
    N::Element: SimdRealField,
    DefaultAllocator: Allocator<N, U3, U3>, 

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

Performs the *= operation.

impl<N: SimdRealField, D: DimName, R> One for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: AbstractRotation<N, D>,
    DefaultAllocator: Allocator<N, D>, 

fn one() -> Self

Creates a new identity similarity.

pub fn set_one(&mut self)

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

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

Returns true if self is equal to the multiplicative identity.

impl<N: SimdRealField, D: DimName, R> PartialEq<Similarity<N, D, R>> for Similarity<N, D, R> where
    R: AbstractRotation<N, D> + PartialEq,
    DefaultAllocator: Allocator<N, D>, 

fn eq(&self, right: &Self) -> bool

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

#[must_use]

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

This method tests for !=.

impl<N: RealField, D: DimName, R> RelativeEq<Similarity<N, D, R>> for Similarity<N, D, R> where
    R: AbstractRotation<N, D> + RelativeEq<Epsilon = N::Epsilon>,
    DefaultAllocator: Allocator<N, D>,
    N::Epsilon: Copy, 

fn default_max_relative() -> Self::Epsilon

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

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

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

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

The inverse of RelativeEq::relative_eq.

impl<N: Scalar, D: DimName, R> Serialize for Similarity<N, D, R> where
    DefaultAllocator: Allocator<N, D>,
    N: Serialize,
    R: Serialize,
    DefaultAllocator: Allocator<N, D>,
    Owned<N, D>: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<N: SimdRealField, D: DimName, R> SimdValue for Similarity<N, D, R> where
    N::Element: SimdRealField,
    R: SimdValue<SimdBool = N::SimdBool> + AbstractRotation<N, D>,
    R::Element: AbstractRotation<N::Element, D>,
    DefaultAllocator: Allocator<N, D> + Allocator<N::Element, D>, 

type Element = Similarity<N::Element, D, R::Element>

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

type SimdBool = N::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: Self::Element) -> Self

Initializes an SIMD value with each lanes set to val.

fn extract(&self, i: usize) -> Self::Element

Extracts the i-th lane of self.

unsafe fn extract_unchecked(&self, i: usize) -> Self::Element

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

fn replace(&mut self, i: usize, val: Self::Element)

Replaces the i-th lane of self by val.

unsafe fn replace_unchecked(&mut self, i: usize, val: Self::Element)

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

fn select(self, cond: Self::SimdBool, other: Self) -> Self

Merges self and other depending on the lanes of cond.

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

Applies a function to each lane of self.

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

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

impl<N1, N2, D, R> 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 Similarity<N1, D, R> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    R: AbstractRotation<N1, D> + SubsetOf<MatrixN<N1, DimNameSum<D, U1>>> + SubsetOf<MatrixN<N2, DimNameSum<D, U1>>>,
    D: DimNameAdd<U1> + DimMin<D, Output = D>,
    DefaultAllocator: Allocator<N1, D> + Allocator<N1, D, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<(usize, usize), D> + Allocator<N2, D, D> + Allocator<N2, D>, 

fn to_superset(&self) -> MatrixN<N2, DimNameSum<D, U1>>

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

fn is_in_subset(m: &MatrixN<N2, DimNameSum<D, U1>>) -> bool

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

fn from_superset_unchecked(m: &MatrixN<N2, DimNameSum<D, U1>>) -> Self

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

pub 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: DimName, R> SubsetOf<Similarity<N2, D, R>> for Rotation<N1, D> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    R: AbstractRotation<N2, D> + SupersetOf<Self>,
    DefaultAllocator: Allocator<N1, D, D> + Allocator<N2, D>, 

fn to_superset(&self) -> Similarity<N2, D, R>

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

fn is_in_subset(sim: &Similarity<N2, D, R>) -> bool

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

fn from_superset_unchecked(sim: &Similarity<N2, D, R>) -> Self

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

pub 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: DimName, R> SubsetOf<Similarity<N2, D, R>> for Translation<N1, D> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    R: AbstractRotation<N2, D>,
    DefaultAllocator: Allocator<N1, D> + Allocator<N2, D>, 

fn to_superset(&self) -> Similarity<N2, D, R>

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

fn is_in_subset(sim: &Similarity<N2, D, R>) -> bool

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

fn from_superset_unchecked(sim: &Similarity<N2, D, R>) -> Self

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

pub 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: DimName, R1, R2> SubsetOf<Similarity<N2, D, R2>> for Isometry<N1, D, R1> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    R1: AbstractRotation<N1, D> + SubsetOf<R2>,
    R2: AbstractRotation<N2, D>,
    DefaultAllocator: Allocator<N1, D> + Allocator<N2, D>, 

fn to_superset(&self) -> Similarity<N2, D, R2>

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

fn is_in_subset(sim: &Similarity<N2, D, R2>) -> bool

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

fn from_superset_unchecked(sim: &Similarity<N2, D, R2>) -> Self

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

pub 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: DimName, R1, R2> SubsetOf<Similarity<N2, D, R2>> for Similarity<N1, D, R1> where
    N1: RealField + SubsetOf<N2>,
    N2: RealField + SupersetOf<N1>,
    R1: AbstractRotation<N1, D> + SubsetOf<R2>,
    R2: AbstractRotation<N2, D>,
    DefaultAllocator: Allocator<N1, D> + Allocator<N2, D>, 

fn to_superset(&self) -> Similarity<N2, D, R2>

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

fn is_in_subset(sim: &Similarity<N2, D, R2>) -> bool

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

fn from_superset_unchecked(sim: &Similarity<N2, D, R2>) -> Self

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

pub 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, R> SubsetOf<Similarity<N2, U2, R>> for UnitComplex<N1> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    R: AbstractRotation<N2, U2> + SupersetOf<Self>, 

fn to_superset(&self) -> Similarity<N2, U2, R>

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

fn is_in_subset(sim: &Similarity<N2, U2, R>) -> bool

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

fn from_superset_unchecked(sim: &Similarity<N2, U2, R>) -> Self

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

pub 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, R> SubsetOf<Similarity<N2, U3, R>> for UnitQuaternion<N1> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    R: AbstractRotation<N2, U3> + SupersetOf<Self>, 

fn to_superset(&self) -> Similarity<N2, U3, R>

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

fn is_in_subset(sim: &Similarity<N2, U3, R>) -> bool

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

fn from_superset_unchecked(sim: &Similarity<N2, U3, R>) -> Self

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

pub 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
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    C: SuperTCategoryOf<TAffine>,
    R: AbstractRotation<N1, D> + SubsetOf<MatrixN<N1, DimNameSum<D, U1>>> + SubsetOf<MatrixN<N2, DimNameSum<D, U1>>>,
    D: DimNameAdd<U1> + DimMin<D, Output = D>,
    DefaultAllocator: Allocator<N1, D> + Allocator<N1, D, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<(usize, usize), D> + Allocator<N2, D, D> + Allocator<N2, D>, 

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).

fn from_superset_unchecked(t: &Transform<N2, D, C>) -> Self

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

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

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

impl<N: RealField, D: DimName, R> UlpsEq<Similarity<N, D, R>> for Similarity<N, D, R> where
    R: AbstractRotation<N, D> + UlpsEq<Epsilon = N::Epsilon>,
    DefaultAllocator: Allocator<N, D>,
    N::Epsilon: Copy, 

fn default_max_ulps() -> u32

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

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

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

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

The inverse of UlpsEq::ulps_eq.

impl<N: Scalar + Copy + Zero, D: DimName + Copy, R: AbstractRotation<N, D> + Copy> Copy for Similarity<N, D, R> where
    DefaultAllocator: Allocator<N, D>,
    Owned<N, D>: Copy, 

impl<N: SimdRealField, D: DimName, R> Eq for Similarity<N, D, R> where
    R: AbstractRotation<N, D> + Eq,
    DefaultAllocator: Allocator<N, D>,