Struct ggez::graphics::na::Unit

#[repr(C)]
pub struct Unit<T> { /* fields omitted */ }

A wrapper that ensures the undelying algebraic entity has a unit norm.

Use .as_ref() or .unwrap() to obtain the undelying value by-reference or by-move.

Methods

impl<T> Unit<T> where
    T: NormedSpace, 

fn new_normalize(value: T) -> Unit<T>

Normalize the given value and return it wrapped on a Unit structure.

fn try_new(value: T, min_norm: <T as VectorSpace>::Field) -> Option<Unit<T>>

Attempts to normalize the given value and return it wrapped on a Unit structure.

Returns None if the norm was smaller or equal to min_norm.

fn new_and_get(value: T) -> (Unit<T>, <T as VectorSpace>::Field)

Normalize the given value and return it wrapped on a Unit structure and its norm.

fn try_new_and_get(
    value: T,
    min_norm: <T as VectorSpace>::Field
) -> Option<(Unit<T>, <T as VectorSpace>::Field)>

Normalize the given value and return it wrapped on a Unit structure and its norm.

Returns None if the norm was smaller or equal to min_norm.

fn renormalize(&mut self) -> <T as VectorSpace>::Field

Normalizes this value again. This is useful when repeated computations might cause a drift in the norm because of float inaccuracies.

Returns the norm before re-normalization (should be close to 1.0).

impl<T> Unit<T>

fn new_unchecked(value: T) -> Unit<T>

Wraps the given value, assuming it is already normalized.

This function is not safe because value is not verified to be actually normalized.

fn unwrap(self) -> T

Retrieves the underlying value.

fn as_mut_unchecked(&mut self) -> &mut T

Returns a mutable reference to the underlying value. This is _unchecked because modifying the underlying value in such a way that it no longer has unit length may lead to unexpected results.

impl<N> Unit<Quaternion<N>> where
    N: Real, 

fn into_owned(self) -> Unit<Quaternion<N>>

Deprecated

: This method is a no-op and will be removed in a future release.

Moves this unit quaternion into one that owns its data.

fn clone_owned(&self) -> Unit<Quaternion<N>>

Deprecated

: This method is a no-op and will be removed in a future release.

Clones this unit quaternion into one that owns its data.

fn angle(&self) -> N

The rotation angle in [0; pi] of this unit quaternion.

fn quaternion(&self) -> &Quaternion<N>

The underlying quaternion.

Same as self.as_ref().

fn conjugate(&self) -> Unit<Quaternion<N>>

Compute the conjugate of this unit quaternion.

fn inverse(&self) -> Unit<Quaternion<N>>

Inverts this quaternion if it is not zero.

fn angle_to(&self, other: &Unit<Quaternion<N>>) -> N

The rotation angle needed to make self and other coincide.

fn rotation_to(&self, other: &Unit<Quaternion<N>>) -> Unit<Quaternion<N>>

The unit quaternion needed to make self and other coincide.

The result is such that: self.rotation_to(other) * self == other.

fn lerp(&self, other: &Unit<Quaternion<N>>, t: N) -> Quaternion<N>

Linear interpolation between two unit quaternions.

The result is not normalized.

fn nlerp(&self, other: &Unit<Quaternion<N>>, t: N) -> Unit<Quaternion<N>>

Normalized linear interpolation between two unit quaternions.

fn slerp(&self, other: &Unit<Quaternion<N>>, t: N) -> Unit<Quaternion<N>>

Spherical linear interpolation between two unit quaternions.

Panics if the angle between both quaternion is 180 degrees (in which case the interpolation is not well-defined).

fn try_slerp(
    &self,
    other: &Unit<Quaternion<N>>,
    t: N,
    epsilon: N
) -> Option<Unit<Quaternion<N>>>

Computes the spherical linear interpolation between two unit quaternions or returns None if both quaternions are approximately 180 degrees apart (in which case the interpolation is not well-defined).

Arguments

• self: the first quaternion to interpolate from.
• other: the second quaternion to interpolate toward.
• t: the interpolation parameter. Should be between 0 and 1.
• epsilon: the value bellow which the sinus of the angle separating both quaternion must be to return None.

fn conjugate_mut(&mut self)

Compute the conjugate of this unit quaternion in-place.

fn inverse_mut(&mut self)

Inverts this quaternion if it is not zero.

fn axis(
    &self
) -> Option<Unit<Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>>>

The rotation axis of this unit quaternion or None if the rotation is zero.

fn scaled_axis(
    &self
) -> Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>

The rotation axis of this unit quaternion multiplied by the rotation agle.

fn exp(&self) -> Quaternion<N>

Compute the exponential of a quaternion.

Note that this function yields a Quaternion<N> because it looses the unit property.

fn ln(&self) -> Quaternion<N>

Compute the natural logarithm of a quaternion.

Note that this function yields a Quaternion<N> because it looses the unit property. The vector part of the return value corresponds to the axis-angle representation (divided by 2.0) of this unit quaternion.

fn powf(&self, n: N) -> Unit<Quaternion<N>>

Raise the quaternion to a given floating power.

This returns the unit quaternion that identifies a rotation with axis self.axis() and angle self.angle() × n.

fn to_rotation_matrix(&self) -> Rotation<N, U3>

Builds a rotation matrix from this unit quaternion.

fn to_homogeneous(
    &self
) -> Matrix<N, U4, U4, <DefaultAllocator as Allocator<N, U4, U4>>::Buffer>

Converts this unit quaternion into its equivalent homogeneous transformation matrix.

impl<N> Unit<Quaternion<N>> where
    N: Real, 

fn identity() -> Unit<Quaternion<N>>

The quaternion multiplicative identity.

fn from_axis_angle<SB>(
    axis: &Unit<Matrix<N, U3, U1, SB>>,
    angle: N
) -> Unit<Quaternion<N>> where
    SB: Storage<N, U3, U1>, 

Creates a new quaternion from a unit vector (the rotation axis) and an angle (the rotation angle).

fn from_quaternion(q: Quaternion<N>) -> Unit<Quaternion<N>>

Creates a new unit quaternion from a quaternion.

The input quaternion will be normalized.

fn from_euler_angles(roll: N, pitch: N, yaw: N) -> Unit<Quaternion<N>>

Creates a new unit quaternion from Euler angles.

The primitive rotations are applied in order: 1 roll − 2 pitch − 3 yaw.

fn from_rotation_matrix(rotmat: &Rotation<N, U3>) -> Unit<Quaternion<N>>

Builds an unit quaternion from a rotation matrix.

fn rotation_between<SB, SC>(
    a: &Matrix<N, U3, U1, SB>,
    b: &Matrix<N, U3, U1, SC>
) -> Option<Unit<Quaternion<N>>> where
    SB: Storage<N, U3, U1>,
    SC: Storage<N, U3, U1>, 

The unit quaternion needed to make a and b be collinear and point toward the same direction.

fn scaled_rotation_between<SB, SC>(
    a: &Matrix<N, U3, U1, SB>,
    b: &Matrix<N, U3, U1, SC>,
    s: N
) -> Option<Unit<Quaternion<N>>> where
    SB: Storage<N, U3, U1>,
    SC: Storage<N, U3, U1>, 

The smallest rotation needed to make a and b collinear and point toward the same direction, raised to the power s.

fn new_observer_frame<SB, SC>(
    dir: &Matrix<N, U3, U1, SB>,
    up: &Matrix<N, U3, U1, SC>
) -> Unit<Quaternion<N>> where
    SB: Storage<N, U3, U1>,
    SC: Storage<N, U3, U1>, 

Creates an unit quaternion that corresponds to the local frame of an observer standing at the origin and looking toward dir.

It maps the view direction dir to the positive z axis.

Arguments

• dir - The look direction, that is, direction the matrix z axis will be aligned with.
• up - The vertical direction. The only requirement of this parameter is to not be collinear to dir. Non-collinearity is not checked.

fn look_at_rh<SB, SC>(
    dir: &Matrix<N, U3, U1, SB>,
    up: &Matrix<N, U3, U1, SC>
) -> Unit<Quaternion<N>> where
    SB: Storage<N, U3, U1>,
    SC: Storage<N, U3, U1>, 

Builds a right-handed look-at view matrix without translation.

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.

fn look_at_lh<SB, SC>(
    dir: &Matrix<N, U3, U1, SB>,
    up: &Matrix<N, U3, U1, SC>
) -> Unit<Quaternion<N>> where
    SB: Storage<N, U3, U1>,
    SC: Storage<N, U3, U1>, 

Builds a left-handed look-at view matrix without translation.

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.

fn new<SB>(axisangle: Matrix<N, U3, U1, SB>) -> Unit<Quaternion<N>> where
    SB: Storage<N, U3, U1>, 

Creates a new unit quaternion rotation from a rotation axis scaled by the rotation angle.

If axisangle is zero, this returns the indentity rotation.

fn from_scaled_axis<SB>(axisangle: Matrix<N, U3, U1, SB>) -> Unit<Quaternion<N>> where
    SB: Storage<N, U3, U1>, 

Creates a new unit quaternion rotation from a rotation axis scaled by the rotation angle.

If axisangle is zero, this returns the indentity rotation. Same as Self::new(axisangle).

impl<N> Unit<Complex<N>> where
    N: Real, 

fn angle(&self) -> N

The rotation angle in ]-pi; pi] of this unit complex number.

fn sin_angle(&self) -> N

The sine of the rotation angle.

fn cos_angle(&self) -> N

The cosine of the rotation angle.

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

The rotation angle returned as a 1-dimensional vector.

fn complex(&self) -> &Complex<N>

The underlying complex number.

Same as self.as_ref().

fn conjugate(&self) -> Unit<Complex<N>>

Compute the conjugate of this unit complex number.

fn inverse(&self) -> Unit<Complex<N>>

Inverts this complex number if it is not zero.

fn angle_to(&self, other: &Unit<Complex<N>>) -> N

The rotation angle needed to make self and other coincide.

fn rotation_to(&self, other: &Unit<Complex<N>>) -> Unit<Complex<N>>

The unit complex number needed to make self and other coincide.

The result is such that: self.rotation_to(other) * self == other.

fn conjugate_mut(&mut self)

Compute in-place the conjugate of this unit complex number.

fn inverse_mut(&mut self)

Inverts in-place this unit complex number.

fn powf(&self, n: N) -> Unit<Complex<N>>

Raise this unit complex number to a given floating power.

This returns the unit complex number that identifies a rotation angle equal to self.angle() × n.

fn to_rotation_matrix(&self) -> Rotation<N, U2>

Builds the rotation matrix corresponding to this unit complex number.

fn to_homogeneous(
    &self
) -> Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer>

Converts this unit complex number into its equivalent homogeneous transformation matrix.

impl<N> Unit<Complex<N>> where
    N: Real, 

fn identity() -> Unit<Complex<N>>

The unit complex number multiplicative identity.

fn new(angle: N) -> Unit<Complex<N>>

Builds the unit complex number corresponding to the rotation with the angle.

fn from_angle(angle: N) -> Unit<Complex<N>>

Builds the unit complex number corresponding to the rotation with the angle.

Same as Self::new(angle).

fn from_cos_sin_unchecked(cos: N, sin: N) -> Unit<Complex<N>>

Builds the unit complex number frow the sinus and cosinus of the rotation angle.

The input values are not checked.

fn from_scaled_axis<SB>(axisangle: Matrix<N, U1, U1, SB>) -> Unit<Complex<N>> where
    SB: Storage<N, U1, U1>, 

Builds a unit complex rotation from an angle in radian wrapped in a 1-dimensional vector.

Equivalent to Self::new(axisangle[0]).

fn from_complex(q: Complex<N>) -> Unit<Complex<N>>

Creates a new unit complex number from a complex number.

The input complex number will be normalized.

fn from_complex_and_get(q: Complex<N>) -> (Unit<Complex<N>>, N)

Creates a new unit complex number from a complex number.

The input complex number will be normalized. Returns the complex number norm as well.

fn from_rotation_matrix(rotmat: &Rotation<N, U2>) -> Unit<Complex<N>> where
    DefaultAllocator: Allocator<N, U2, U2>, 

Builds the unit complex number from the corresponding 2D rotation matrix.

fn rotation_between<SB, SC>(
    a: &Matrix<N, U2, U1, SB>,
    b: &Matrix<N, U2, U1, SC>
) -> Unit<Complex<N>> where
    SB: Storage<N, U2, U1>,
    SC: Storage<N, U2, U1>, 

The unit complex needed to make a and b be collinear and point toward the same direction.

fn scaled_rotation_between<SB, SC>(
    a: &Matrix<N, U2, U1, SB>,
    b: &Matrix<N, U2, U1, SC>,
    s: N
) -> Unit<Complex<N>> where
    SB: Storage<N, U2, U1>,
    SC: Storage<N, U2, U1>, 

The smallest rotation needed to make a and b collinear and point toward the same direction, raised to the power s.

impl<N> Unit<Complex<N>> where
    N: Real, 

fn rotate<R2, C2, S2>(&self, rhs: &mut Matrix<N, R2, C2, S2>) where
    C2: Dim,
    R2: Dim,
    S2: StorageMut<N, R2, C2>,
    ShapeConstraint: DimEq<R2, U2>, 

Performs the multiplication rhs = self * rhs in-place.

fn rotate_rows<R2, C2, S2>(&self, lhs: &mut Matrix<N, R2, C2, S2>) where
    C2: Dim,
    R2: Dim,
    S2: StorageMut<N, R2, C2>,
    ShapeConstraint: DimEq<C2, U2>, 

Performs the multiplication lhs = lhs * self in-place.

Trait Implementations

impl<T> Neg for Unit<T> where
    T: Neg, 

type Output = Unit<<T as Neg>::Output>

fn neg(self) -> <Unit<T> as Neg>::Output

impl<N> Rand for Unit<Complex<N>> where
    N: Rand + Real, 

fn rand<R>(rng: &mut R) -> Unit<Complex<N>> where
    R: Rng, 

impl<N> Rand for Unit<Quaternion<N>> where
    N: Rand + Real, 

fn rand<R>(rng: &mut R) -> Unit<Quaternion<N>> where
    R: Rng, 

impl<T> Copy for Unit<T> where
    T: Copy, 

impl<T> Clone for Unit<T> where
    T: Clone, 

fn clone(&self) -> Unit<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N> AbstractMonoid<Multiplicative> for Unit<Complex<N>> where
    N: Real, 

impl<N> AbstractMonoid<Multiplicative> for Unit<Quaternion<N>> where
    N: Real, 

impl<N1, N2, R> SubsetOf<Similarity<N2, U3, R>> for Unit<Quaternion<N1>> where
    N1: Real,
    N2: Real + SupersetOf<N1>,
    R: Rotation<Point<N2, U3>> + SupersetOf<Unit<Quaternion<N1>>>, 

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

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

unsafe fn from_superset_unchecked(
    sim: &Similarity<N2, U3, R>
) -> Unit<Quaternion<N1>>

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

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

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

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

impl<N1, N2> SubsetOf<Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>> for Unit<Quaternion<N1>> where
    N1: Real,
    N2: Real + SupersetOf<N1>, 

fn to_superset(
    &self
) -> Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>

fn is_in_subset(
    m: &Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>
) -> bool

unsafe fn from_superset_unchecked(
    m: &Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>
) -> Unit<Quaternion<N1>>

impl<N1, N2> SubsetOf<Unit<Quaternion<N2>>> for Unit<Quaternion<N1>> where
    N1: Real,
    N2: Real + SupersetOf<N1>, 

fn to_superset(&self) -> Unit<Quaternion<N2>>

fn is_in_subset(uq: &Unit<Quaternion<N2>>) -> bool

unsafe fn from_superset_unchecked(
    uq: &Unit<Quaternion<N2>>
) -> Unit<Quaternion<N1>>

impl<N1, N2, R> SubsetOf<Isometry<N2, U3, R>> for Unit<Quaternion<N1>> where
    N1: Real,
    N2: Real + SupersetOf<N1>,
    R: Rotation<Point<N2, U3>> + SupersetOf<Unit<Quaternion<N1>>>, 

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

fn is_in_subset(iso: &Isometry<N2, U3, R>) -> bool

unsafe fn from_superset_unchecked(
    iso: &Isometry<N2, U3, R>
) -> Unit<Quaternion<N1>>

impl<N1, N2> SubsetOf<Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>> for Unit<Complex<N1>> where
    N1: Real,
    N2: Real + SupersetOf<N1>, 

fn to_superset(
    &self
) -> Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>

fn is_in_subset(
    m: &Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>
) -> bool

unsafe fn from_superset_unchecked(
    m: &Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>
) -> Unit<Complex<N1>>

impl<N1, N2> SubsetOf<Unit<Complex<N2>>> for Unit<Complex<N1>> where
    N1: Real,
    N2: Real + SupersetOf<N1>, 

fn to_superset(&self) -> Unit<Complex<N2>>

fn is_in_subset(uq: &Unit<Complex<N2>>) -> bool

unsafe fn from_superset_unchecked(uq: &Unit<Complex<N2>>) -> Unit<Complex<N1>>

impl<T> SubsetOf<T> for Unit<T> where
    T: NormedSpace,
    <T as VectorSpace>::Field: ApproxEq, 

fn to_superset(&self) -> T

fn is_in_subset(value: &T) -> bool

unsafe fn from_superset_unchecked(value: &T) -> Unit<T>

impl<N1, N2> SubsetOf<Rotation<N2, U2>> for Unit<Complex<N1>> where
    N1: Real,
    N2: Real + SupersetOf<N1>, 

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

fn is_in_subset(rot: &Rotation<N2, U2>) -> bool

unsafe fn from_superset_unchecked(rot: &Rotation<N2, U2>) -> Unit<Complex<N1>>

impl<N1, N2, R> SubsetOf<Similarity<N2, U2, R>> for Unit<Complex<N1>> where
    N1: Real,
    N2: Real + SupersetOf<N1>,
    R: Rotation<Point<N2, U2>> + SupersetOf<Unit<Complex<N1>>>, 

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

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

unsafe fn from_superset_unchecked(
    sim: &Similarity<N2, U2, R>
) -> Unit<Complex<N1>>

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

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

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

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

impl<N1, N2> SubsetOf<Rotation<N2, U3>> for Unit<Quaternion<N1>> where
    N1: Real,
    N2: Real + SupersetOf<N1>, 

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

fn is_in_subset(rot: &Rotation<N2, U3>) -> bool

unsafe fn from_superset_unchecked(
    rot: &Rotation<N2, U3>
) -> Unit<Quaternion<N1>>

impl<N1, N2, R> SubsetOf<Isometry<N2, U2, R>> for Unit<Complex<N1>> where
    N1: Real,
    N2: Real + SupersetOf<N1>,
    R: Rotation<Point<N2, U2>> + SupersetOf<Unit<Complex<N1>>>, 

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

fn is_in_subset(iso: &Isometry<N2, U2, R>) -> bool

unsafe fn from_superset_unchecked(
    iso: &Isometry<N2, U2, R>
) -> Unit<Complex<N1>>

impl<N> Inverse<Multiplicative> for Unit<Quaternion<N>> where
    N: Real, 

fn inverse(&self) -> Unit<Quaternion<N>>

fn inverse_mut(&mut self)

impl<N> Inverse<Multiplicative> for Unit<Complex<N>> where
    N: Real, 

fn inverse(&self) -> Unit<Complex<N>>

fn inverse_mut(&mut self)

impl<N> ProjectiveTransformation<Point<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

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

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

impl<N> ProjectiveTransformation<Point<N, U3>> for Unit<Quaternion<N>> where
    N: Real, 

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

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

impl<N> Isometry<Point<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

impl<N> Isometry<Point<N, U3>> for Unit<Quaternion<N>> where
    N: Real, 

impl<N> AffineTransformation<Point<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Rotation = Unit<Complex<N>>

type NonUniformScaling = Id<Multiplicative>

type Translation = Id<Multiplicative>

fn decompose(
    &self
) -> (Id<Multiplicative>, Unit<Complex<N>>, Id<Multiplicative>, Unit<Complex<N>>)

fn append_translation(
    &self,
    &<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Translation
) -> Unit<Complex<N>>

fn prepend_translation(
    &self,
    &<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Translation
) -> Unit<Complex<N>>

fn append_rotation(
    &self,
    r: &<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Rotation
) -> Unit<Complex<N>>

fn prepend_rotation(
    &self,
    r: &<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Rotation
) -> Unit<Complex<N>>

fn append_scaling(
    &self,
    &<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::NonUniformScaling
) -> Unit<Complex<N>>

fn prepend_scaling(
    &self,
    &<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::NonUniformScaling
) -> Unit<Complex<N>>

impl<N> AffineTransformation<Point<N, U3>> for Unit<Quaternion<N>> where
    N: Real, 

type Rotation = Unit<Quaternion<N>>

type NonUniformScaling = Id<Multiplicative>

type Translation = Id<Multiplicative>

fn decompose(
    &self
) -> (Id<Multiplicative>, Unit<Quaternion<N>>, Id<Multiplicative>, Unit<Quaternion<N>>)

fn append_translation(
    &self,
    &<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Translation
) -> Unit<Quaternion<N>>

fn prepend_translation(
    &self,
    &<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Translation
) -> Unit<Quaternion<N>>

fn append_rotation(
    &self,
    r: &<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Rotation
) -> Unit<Quaternion<N>>

fn prepend_rotation(
    &self,
    r: &<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Rotation
) -> Unit<Quaternion<N>>

fn append_scaling(
    &self,
    &<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::NonUniformScaling
) -> Unit<Quaternion<N>>

fn prepend_scaling(
    &self,
    &<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::NonUniformScaling
) -> Unit<Quaternion<N>>

impl<N> Transformation<Point<N, U3>> for Unit<Quaternion<N>> where
    N: Real, 

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

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

impl<N> Transformation<Point<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

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

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

impl<'a, N> Div<Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

type Output = Unit<Quaternion<N>>

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

impl<N> Div<Rotation<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

type Output = Unit<Complex<N>>

fn div(
    self,
    rhs: Rotation<N, U2>
) -> <Unit<Complex<N>> as Div<Rotation<N, U2>>>::Output

impl<'a, N> Div<Unit<Complex<N>>> for &'a Unit<Complex<N>> where
    N: Real, 

type Output = Unit<Complex<N>>

fn div(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>

impl<'b, N> Div<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

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

impl<'b, N> Div<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Unit<Quaternion<N>>

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

impl<'b, N> Div<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
    N: Real, 

type Output = Unit<Complex<N>>

fn div(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>

impl<'a, 'b, N> Div<&'b Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Unit<Quaternion<N>>

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

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

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

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

impl<'a, 'b, N> Div<&'b Rotation<N, U2>> for &'a Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

type Output = Unit<Complex<N>>

fn div(
    self,
    rhs: &'b Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Div<&'b Rotation<N, U2>>>::Output

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

type Output = Similarity<N, U3, Unit<Quaternion<N>>>

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

impl<'a, N> Div<Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Unit<Quaternion<N>>

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

impl<'a, N> Div<Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

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

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

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

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

impl<'a, 'b, N> Div<&'b Unit<Complex<N>>> for &'a Unit<Complex<N>> where
    N: Real, 

type Output = Unit<Complex<N>>

fn div(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>

impl<'a, 'b, N> Div<&'b Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

type Output = Unit<Quaternion<N>>

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

impl<N> Div<Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

fn div(
    self,
    right: Isometry<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Div<Isometry<N, U3, Unit<Quaternion<N>>>>>::Output

impl<'b, N> Div<&'b Rotation<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

type Output = Unit<Complex<N>>

fn div(
    self,
    rhs: &'b Rotation<N, U2>
) -> <Unit<Complex<N>> as Div<&'b Rotation<N, U2>>>::Output

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

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

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

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

type Output = Similarity<N, U3, Unit<Quaternion<N>>>

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

impl<'a, N> Div<Rotation<N, U2>> for &'a Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

type Output = Unit<Complex<N>>

fn div(
    self,
    rhs: Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Div<Rotation<N, U2>>>::Output

impl<N> Div<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Unit<Quaternion<N>>

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

impl<N> Div<Similarity<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, Unit<Quaternion<N>>>

fn div(
    self,
    right: Similarity<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Div<Similarity<N, U3, Unit<Quaternion<N>>>>>::Output

impl<'b, N> Div<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

type Output = Unit<Quaternion<N>>

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

impl<N> Div<Unit<Complex<N>>> for Unit<Complex<N>> where
    N: Real, 

type Output = Unit<Complex<N>>

fn div(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>

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

type Output = Similarity<N, U3, Unit<Quaternion<N>>>

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

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

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

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

impl<'a, 'b, N> Div<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

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

impl<N> Div<Rotation<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

type Output = Unit<Quaternion<N>>

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

impl<N> AbstractSemigroup<Multiplicative> for Unit<Quaternion<N>> where
    N: Real, 

impl<N> AbstractSemigroup<Multiplicative> for Unit<Complex<N>> where
    N: Real, 

impl<N> AbstractLoop<Multiplicative> for Unit<Complex<N>> where
    N: Real, 

impl<N> AbstractLoop<Multiplicative> for Unit<Quaternion<N>> where
    N: Real, 

impl<N> DivAssign<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

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

impl<N> DivAssign<Rotation<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

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

impl<N> DivAssign<Unit<Complex<N>>> for Unit<Complex<N>> where
    N: Real, 

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

impl<'b, N> DivAssign<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

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

impl<'b, N> DivAssign<&'b Rotation<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

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

impl<N> DivAssign<Rotation<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

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

impl<'b, N> DivAssign<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

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

impl<'b, N> DivAssign<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
    N: Real, 

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

impl<N, R, C, S> ApproxEq for Unit<Matrix<N, R, C, S>> where
    C: Dim,
    N: Scalar + ApproxEq,
    R: Dim,
    S: Storage<N, R, C>,
    <N as ApproxEq>::Epsilon: Copy, 

type Epsilon = <N as ApproxEq>::Epsilon

fn default_epsilon() -> <Unit<Matrix<N, R, C, S>> as ApproxEq>::Epsilon

fn default_max_relative() -> <Unit<Matrix<N, R, C, S>> as ApproxEq>::Epsilon

fn default_max_ulps() -> u32

fn relative_eq(
    &self,
    other: &Unit<Matrix<N, R, C, S>>,
    epsilon: <Unit<Matrix<N, R, C, S>> as ApproxEq>::Epsilon,
    max_relative: <Unit<Matrix<N, R, C, S>> as ApproxEq>::Epsilon
) -> bool

fn ulps_eq(
    &self,
    other: &Unit<Matrix<N, R, C, S>>,
    epsilon: <Unit<Matrix<N, R, C, S>> as ApproxEq>::Epsilon,
    max_ulps: u32
) -> bool

impl<N> ApproxEq for Unit<Quaternion<N>> where
    N: ApproxEq<Epsilon = N> + Real, 

type Epsilon = N

fn default_epsilon() -> <Unit<Quaternion<N>> as ApproxEq>::Epsilon

fn default_max_relative() -> <Unit<Quaternion<N>> as ApproxEq>::Epsilon

fn default_max_ulps() -> u32

fn relative_eq(
    &self,
    other: &Unit<Quaternion<N>>,
    epsilon: <Unit<Quaternion<N>> as ApproxEq>::Epsilon,
    max_relative: <Unit<Quaternion<N>> as ApproxEq>::Epsilon
) -> bool

fn ulps_eq(
    &self,
    other: &Unit<Quaternion<N>>,
    epsilon: <Unit<Quaternion<N>> as ApproxEq>::Epsilon,
    max_ulps: u32
) -> bool

impl<N> ApproxEq for Unit<Complex<N>> where
    N: Real, 

type Epsilon = N

fn default_epsilon() -> <Unit<Complex<N>> as ApproxEq>::Epsilon

fn default_max_relative() -> <Unit<Complex<N>> as ApproxEq>::Epsilon

fn default_max_ulps() -> u32

fn relative_eq(
    &self,
    other: &Unit<Complex<N>>,
    epsilon: <Unit<Complex<N>> as ApproxEq>::Epsilon,
    max_relative: <Unit<Complex<N>> as ApproxEq>::Epsilon
) -> bool

fn ulps_eq(
    &self,
    other: &Unit<Complex<N>>,
    epsilon: <Unit<Complex<N>> as ApproxEq>::Epsilon,
    max_ulps: u32
) -> bool

impl<T> Hash for Unit<T> where
    T: Hash, 

fn hash<__HT>(&self, __arg_0: &mut __HT) where
    __HT: Hasher, 

Feeds this value into the given [Hasher].

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

Feeds a slice of this type into the given [Hasher].

impl<N> Similarity<Point<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Scaling = Id<Multiplicative>

fn translation(&self) -> Id<Multiplicative>

fn rotation(&self) -> Unit<Complex<N>>

fn scaling(&self) -> Id<Multiplicative>

impl<N> Similarity<Point<N, U3>> for Unit<Quaternion<N>> where
    N: Real, 

type Scaling = Id<Multiplicative>

fn translation(&self) -> Id<Multiplicative>

fn rotation(&self) -> Unit<Quaternion<N>>

fn scaling(&self) -> Id<Multiplicative>

impl<T> PartialEq<Unit<T>> for Unit<T> where
    T: PartialEq<T>, 

fn eq(&self, __arg_0: &Unit<T>) -> bool

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

fn ne(&self, __arg_0: &Unit<T>) -> bool

This method tests for !=.

impl<T> Debug for Unit<T> where
    T: Debug, 

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

Formats the value using the given formatter.

impl<N> Rotation<Point<N, U3>> for Unit<Quaternion<N>> where
    N: Real, 

fn powf(&self, n: N) -> Option<Unit<Quaternion<N>>>

fn rotation_between(
    a: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>,
    b: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
) -> Option<Unit<Quaternion<N>>>

fn scaled_rotation_between(
    a: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>,
    b: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>,
    s: N
) -> Option<Unit<Quaternion<N>>>

impl<N> Rotation<Point<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

fn powf(&self, n: N) -> Option<Unit<Complex<N>>>

fn rotation_between(
    a: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>,
    b: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
) -> Option<Unit<Complex<N>>>

fn scaled_rotation_between(
    a: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>,
    b: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>,
    s: N
) -> Option<Unit<Complex<N>>>

impl<N> DirectIsometry<Point<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

impl<N> DirectIsometry<Point<N, U3>> for Unit<Quaternion<N>> where
    N: Real, 

impl<N> AbstractQuasigroup<Multiplicative> for Unit<Complex<N>> where
    N: Real, 

impl<N> AbstractQuasigroup<Multiplicative> for Unit<Quaternion<N>> where
    N: Real, 

impl<N> AbstractGroup<Multiplicative> for Unit<Quaternion<N>> where
    N: Real, 

impl<N> AbstractGroup<Multiplicative> for Unit<Complex<N>> where
    N: Real, 

impl<N> One for Unit<Quaternion<N>> where
    N: Real, 

fn one() -> Unit<Quaternion<N>>

impl<N> One for Unit<Complex<N>> where
    N: Real, 

fn one() -> Unit<Complex<N>>

impl<N> Identity<Multiplicative> for Unit<Quaternion<N>> where
    N: Real, 

fn identity() -> Unit<Quaternion<N>>

impl<N> Identity<Multiplicative> for Unit<Complex<N>> where
    N: Real, 

fn identity() -> Unit<Complex<N>>

impl<T> Eq for Unit<T> where
    T: Eq, 

impl<T> Deref for Unit<T>

type Target = T

fn deref(&self) -> &T

impl<N> OrthogonalTransformation<Point<N, U3>> for Unit<Quaternion<N>> where
    N: Real, 

impl<N> OrthogonalTransformation<Point<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

impl<T> AsRef<T> for Unit<T>

fn as_ref(&self) -> &T

Performs the conversion.

impl<'b, N> MulAssign<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

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

impl<N> MulAssign<Rotation<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

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

impl<N> MulAssign<Unit<Complex<N>>> for Unit<Complex<N>> where
    N: Real, 

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

impl<'b, N> MulAssign<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

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

impl<'b, N> MulAssign<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
    N: Real, 

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

impl<'b, N> MulAssign<&'b Rotation<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

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

impl<N> MulAssign<Rotation<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

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

impl<N> MulAssign<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

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

impl<N> AbstractMagma<Multiplicative> for Unit<Complex<N>> where
    N: Real, 

fn operate(&self, rhs: &Unit<Complex<N>>) -> Unit<Complex<N>>

impl<N> AbstractMagma<Multiplicative> for Unit<Quaternion<N>> where
    N: Real, 

fn operate(&self, rhs: &Unit<Quaternion<N>>) -> Unit<Quaternion<N>>

impl<'a, N> Mul<Unit<Complex<N>>> for &'a Unit<Complex<N>> where
    N: Real, 

type Output = Unit<Complex<N>>

fn mul(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>

impl<'a, 'b, N> Mul<&'b Rotation<N, U2>> for &'a Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

type Output = Unit<Complex<N>>

fn mul(
    self,
    rhs: &'b Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<&'b Rotation<N, U2>>>::Output

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

type Output = Similarity<N, U3, Unit<Quaternion<N>>>

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

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

type Output = Similarity<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: Similarity<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<Similarity<N, U2, Unit<Complex<N>>>>>::Output

impl<'b, N, SB> Mul<&'b Matrix<N, U3, U1, SB>> for Unit<Quaternion<N>> where
    N: Real,
    SB: Storage<N, U3, U1>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

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

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

impl<'a, 'b, N> Mul<&'b Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

type Output = Unit<Quaternion<N>>

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

impl<N> Mul<Translation<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Isometry<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: Translation<N, U2>
) -> <Unit<Complex<N>> as Mul<Translation<N, U2>>>::Output

impl<'a, 'b, N> Mul<&'b Point<N, U3>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Point<N, U3>

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

impl<N, S> Mul<Unit<Matrix<N, U2, U1, S>>> for Unit<Complex<N>> where
    N: Real,
    S: Storage<N, U2, U1>,
    DefaultAllocator: Allocator<N, U2, U1>, 

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

fn mul(
    self,
    rhs: Unit<Matrix<N, U2, U1, S>>
) -> <Unit<Complex<N>> as Mul<Unit<Matrix<N, U2, U1, S>>>>::Output

impl<'b, N> Mul<&'b Point<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Point<N, U2>

fn mul(
    self,
    rhs: &'b Point<N, U2>
) -> <Unit<Complex<N>> as Mul<&'b Point<N, U2>>>::Output

impl<'b, N> Mul<&'b Translation<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Isometry<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: &'b Translation<N, U2>
) -> <Unit<Complex<N>> as Mul<&'b Translation<N, U2>>>::Output

impl<'a, 'b, N, S> Mul<&'b Unit<Matrix<N, U2, U1, S>>> for &'a Unit<Complex<N>> where
    N: Real,
    S: Storage<N, U2, U1>,
    DefaultAllocator: Allocator<N, U2, U1>, 

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

fn mul(
    self,
    rhs: &'b Unit<Matrix<N, U2, U1, S>>
) -> <&'a Unit<Complex<N>> as Mul<&'b Unit<Matrix<N, U2, U1, S>>>>::Output

impl<'b, N> Mul<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Unit<Quaternion<N>>

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

impl<N> Mul<Unit<Complex<N>>> for Unit<Complex<N>> where
    N: Real, 

type Output = Unit<Complex<N>>

fn mul(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>

impl<'a, N> Mul<Translation<N, U2>> for &'a Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Isometry<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: Translation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<Translation<N, U2>>>::Output

impl<'a, N> Mul<Translation<N, U3>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

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

impl<'a, 'b, N> Mul<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

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

impl<N> Mul<Translation<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

fn mul(
    self,
    right: Translation<N, U3>
) -> <Unit<Quaternion<N>> as Mul<Translation<N, U3>>>::Output

impl<'a, N> Mul<Isometry<N, U2, Unit<Complex<N>>>> for &'a Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Isometry<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: Isometry<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<Isometry<N, U2, Unit<Complex<N>>>>>::Output

impl<'a, N> Mul<Point<N, U2>> for &'a Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Point<N, U2>

fn mul(
    self,
    rhs: Point<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<Point<N, U2>>>::Output

impl<N, SB> Mul<Matrix<N, U3, U1, SB>> for Unit<Quaternion<N>> where
    N: Real,
    SB: Storage<N, U3, U1>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

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

fn mul(
    self,
    rhs: Matrix<N, U3, U1, SB>
) -> <Unit<Quaternion<N>> as Mul<Matrix<N, U3, U1, SB>>>::Output

impl<'b, N, S> Mul<&'b Unit<Matrix<N, U2, U1, S>>> for Unit<Complex<N>> where
    N: Real,
    S: Storage<N, U2, U1>,
    DefaultAllocator: Allocator<N, U2, U1>, 

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

fn mul(
    self,
    rhs: &'b Unit<Matrix<N, U2, U1, S>>
) -> <Unit<Complex<N>> as Mul<&'b Unit<Matrix<N, U2, U1, S>>>>::Output

impl<'a, N, SB> Mul<Unit<Matrix<N, U3, U1, SB>>> for &'a Unit<Quaternion<N>> where
    N: Real,
    SB: Storage<N, U3, U1>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

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

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

impl<'a, 'b, N> Mul<&'b Translation<N, U3>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

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

impl<'b, N> Mul<&'b Isometry<N, U2, Unit<Complex<N>>>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Isometry<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: &'b Isometry<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<&'b Isometry<N, U2, Unit<Complex<N>>>>>::Output

impl<'b, N> Mul<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
    N: Real, 

type Output = Unit<Complex<N>>

fn mul(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>

impl<N> Mul<Isometry<N, U2, Unit<Complex<N>>>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Isometry<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: Isometry<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<Isometry<N, U2, Unit<Complex<N>>>>>::Output

impl<'b, N> Mul<&'b Point<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Point<N, U3>

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

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

type Output = Similarity<N, U3, Unit<Quaternion<N>>>

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

impl<'a, N, S> Mul<Unit<Matrix<N, U2, U1, S>>> for &'a Unit<Complex<N>> where
    N: Real,
    S: Storage<N, U2, U1>,
    DefaultAllocator: Allocator<N, U2, U1>, 

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

fn mul(
    self,
    rhs: Unit<Matrix<N, U2, U1, S>>
) -> <&'a Unit<Complex<N>> as Mul<Unit<Matrix<N, U2, U1, S>>>>::Output

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

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

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

impl<'a, N> Mul<Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

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

impl<'a, 'b, N, S> Mul<&'b Matrix<N, U2, U1, S>> for &'a Unit<Complex<N>> where
    N: Real,
    S: Storage<N, U2, U1>,
    DefaultAllocator: Allocator<N, U2, U1>, 

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

fn mul(
    self,
    rhs: &'b Matrix<N, U2, U1, S>
) -> <&'a Unit<Complex<N>> as Mul<&'b Matrix<N, U2, U1, S>>>::Output

impl<'b, N> Mul<&'b Translation<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

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

impl<N> Mul<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Unit<Quaternion<N>>

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

impl<'a, N> Mul<Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

type Output = Unit<Quaternion<N>>

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

impl<'b, N> Mul<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

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

impl<'a, 'b, N> Mul<&'b Isometry<N, U2, Unit<Complex<N>>>> for &'a Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Isometry<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: &'b Isometry<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<&'b Isometry<N, U2, Unit<Complex<N>>>>>::Output

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

type Output = Similarity<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: &'b Similarity<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<&'b Similarity<N, U2, Unit<Complex<N>>>>>::Output

impl<'a, N> Mul<Rotation<N, U2>> for &'a Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

type Output = Unit<Complex<N>>

fn mul(
    self,
    rhs: Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<Rotation<N, U2>>>::Output

impl<N> Mul<Point<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Point<N, U3>

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

impl<N> Mul<Point<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Point<N, U2>

fn mul(
    self,
    rhs: Point<N, U2>
) -> <Unit<Complex<N>> as Mul<Point<N, U2>>>::Output

impl<'a, 'b, N> Mul<&'b Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Unit<Quaternion<N>>

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

impl<N, SB> Mul<Unit<Matrix<N, U3, U1, SB>>> for Unit<Quaternion<N>> where
    N: Real,
    SB: Storage<N, U3, U1>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

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

fn mul(
    self,
    rhs: Unit<Matrix<N, U3, U1, SB>>
) -> <Unit<Quaternion<N>> as Mul<Unit<Matrix<N, U3, U1, SB>>>>::Output

impl<'b, N> Mul<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

type Output = Unit<Quaternion<N>>

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

impl<'b, N, S> Mul<&'b Matrix<N, U2, U1, S>> for Unit<Complex<N>> where
    N: Real,
    S: Storage<N, U2, U1>,
    DefaultAllocator: Allocator<N, U2, U1>, 

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

fn mul(
    self,
    rhs: &'b Matrix<N, U2, U1, S>
) -> <Unit<Complex<N>> as Mul<&'b Matrix<N, U2, U1, S>>>::Output

impl<N> Mul<Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Isometry<N, U3, Unit<Quaternion<N>>>

fn mul(
    self,
    right: Isometry<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Mul<Isometry<N, U3, Unit<Quaternion<N>>>>>::Output

impl<'b, N> Mul<&'b Rotation<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

type Output = Unit<Complex<N>>

fn mul(
    self,
    rhs: &'b Rotation<N, U2>
) -> <Unit<Complex<N>> as Mul<&'b Rotation<N, U2>>>::Output

impl<'b, N, SB> Mul<&'b Unit<Matrix<N, U3, U1, SB>>> for Unit<Quaternion<N>> where
    N: Real,
    SB: Storage<N, U3, U1>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

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

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

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

type Output = Similarity<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: Similarity<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<Similarity<N, U2, Unit<Complex<N>>>>>::Output

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

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

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

impl<N, S> Mul<Matrix<N, U2, U1, S>> for Unit<Complex<N>> where
    N: Real,
    S: Storage<N, U2, U1>,
    DefaultAllocator: Allocator<N, U2, U1>, 

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

fn mul(
    self,
    rhs: Matrix<N, U2, U1, S>
) -> <Unit<Complex<N>> as Mul<Matrix<N, U2, U1, S>>>::Output

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

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

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

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

type Output = Similarity<N, U3, Unit<Quaternion<N>>>

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

impl<'a, N> Mul<Point<N, U3>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Point<N, U3>

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

impl<'a, 'b, N, SB> Mul<&'b Unit<Matrix<N, U3, U1, SB>>> for &'a Unit<Quaternion<N>> where
    N: Real,
    SB: Storage<N, U3, U1>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

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

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

impl<'a, N, S> Mul<Matrix<N, U2, U1, S>> for &'a Unit<Complex<N>> where
    N: Real,
    S: Storage<N, U2, U1>,
    DefaultAllocator: Allocator<N, U2, U1>, 

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

fn mul(
    self,
    rhs: Matrix<N, U2, U1, S>
) -> <&'a Unit<Complex<N>> as Mul<Matrix<N, U2, U1, S>>>::Output

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

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

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

impl<'a, 'b, N, SB> Mul<&'b Matrix<N, U3, U1, SB>> for &'a Unit<Quaternion<N>> where
    N: Real,
    SB: Storage<N, U3, U1>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

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

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

impl<N> Mul<Rotation<N, U2>> for Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U2>, 

type Output = Unit<Complex<N>>

fn mul(
    self,
    rhs: Rotation<N, U2>
) -> <Unit<Complex<N>> as Mul<Rotation<N, U2>>>::Output

impl<N> Mul<Rotation<N, U3>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U3>, 

type Output = Unit<Quaternion<N>>

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

impl<'a, N, SB> Mul<Matrix<N, U3, U1, SB>> for &'a Unit<Quaternion<N>> where
    N: Real,
    SB: Storage<N, U3, U1>,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

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

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

impl<'a, 'b, N> Mul<&'b Point<N, U2>> for &'a Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Point<N, U2>

fn mul(
    self,
    rhs: &'b Point<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<&'b Point<N, U2>>>::Output

impl<'a, 'b, N> Mul<&'b Unit<Complex<N>>> for &'a Unit<Complex<N>> where
    N: Real, 

type Output = Unit<Complex<N>>

fn mul(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>

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

type Output = Similarity<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: &'b Similarity<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<&'b Similarity<N, U2, Unit<Complex<N>>>>>::Output

impl<'a, N> Mul<Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U4, U1>, 

type Output = Unit<Quaternion<N>>

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

impl<N> Mul<Similarity<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U4, U1>,
    DefaultAllocator: Allocator<N, U3, U1>, 

type Output = Similarity<N, U3, Unit<Quaternion<N>>>

fn mul(
    self,
    right: Similarity<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Mul<Similarity<N, U3, Unit<Quaternion<N>>>>>::Output

impl<'a, 'b, N> Mul<&'b Translation<N, U2>> for &'a Unit<Complex<N>> where
    N: Real,
    DefaultAllocator: Allocator<N, U2, U1>, 

type Output = Isometry<N, U2, Unit<Complex<N>>>

fn mul(
    self,
    rhs: &'b Translation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<&'b Translation<N, U2>>>::Output

impl<N> Display for Unit<Complex<N>> where
    N: Display + Real, 

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

Formats the value using the given formatter.

impl<N> Display for Unit<Quaternion<N>> where
    N: Display + Real, 

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

Formats the value using the given formatter.