Struct Unit

pub struct Unit<T> { /* private fields */ }

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

It is likely that the only piece of documentation that you need in this page are:

• The construction with normalization
• Data extraction and construction without normalization
• Interpolation between two unit vectors

All the other impl blocks you will see in this page are about UnitComplex and UnitQuaternion; both built on top of Unit. If you are interested in their documentation, read their dedicated pages directly.

Implementations

impl<T, D, S> Unit<Matrix<T, D, Const<1>, S>>

where T: Scalar, D: Dim, S: RawStorage<T, D>,

pub fn cast<T2>( self, ) -> Unit<Matrix<T2, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T2>>>

where T2: Scalar, T: Scalar, Matrix<T2, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T2>>: SupersetOf<Matrix<T, D, Const<1>, S>>, DefaultAllocator: Allocator<D>,

Cast the components of self to another type.

Example

let v = Vector3::<f64>::y_axis();
let v2 = v.cast::<f32>();
assert_eq!(v2, Vector3::<f32>::y_axis());

impl<T> Unit<T>

where T: Normed,

Construction with normalization

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

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

pub fn try_new(value: T, min_norm: <T as Normed>::Norm) -> Option<Unit<T>>

where <T as Normed>::Norm: RealField,

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

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

pub fn new_and_get(value: T) -> (Unit<T>, <T as Normed>::Norm)

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

pub fn try_new_and_get( value: T, min_norm: <T as Normed>::Norm, ) -> Option<(Unit<T>, <T as Normed>::Norm)>

where <T as Normed>::Norm: RealField,

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

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

pub fn renormalize(&mut self) -> <T as Normed>::Norm

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

Returns the norm before re-normalization. See .renormalize_fast for a faster alternative that may be slightly less accurate if self drifted significantly from having a unit length.

pub fn renormalize_fast(&mut self)

Normalizes this vector again using a first-order Taylor approximation. This is useful when repeated computations might cause a drift in the norm because of float inaccuracies.

impl<T> Unit<T>

Data extraction and construction without normalization

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

Wraps the given value, assuming it is already normalized.

pub fn from_ref_unchecked(value: &T) -> &Unit<T>

Wraps the given reference, assuming it is already normalized.

pub fn into_inner(self) -> T

Retrieves the underlying value.

pub fn unwrap(self) -> T

👎Deprecated: use .into_inner() instead

Retrieves the underlying value. Deprecated: use Unit::into_inner instead.

pub 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<T, D, S> Unit<Matrix<T, D, Const<1>, S>>

where T: RealField, D: Dim, S: Storage<T, D>,

Interpolation between two unit vectors

pub fn slerp<S2>( &self, rhs: &Unit<Matrix<T, D, Const<1>, S2>>, t: T, ) -> Unit<Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T>>>

where S2: Storage<T, D>, DefaultAllocator: Allocator<D>,

Computes the spherical linear interpolation between two unit vectors.

Examples:

let v1 = Unit::new_normalize(Vector2::new(1.0, 2.0));
let v2 = Unit::new_normalize(Vector2::new(2.0, -3.0));

let v = v1.slerp(&v2, 1.0);

assert_eq!(v, v2);

pub fn try_slerp<S2>( &self, rhs: &Unit<Matrix<T, D, Const<1>, S2>>, t: T, epsilon: T, ) -> Option<Unit<Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T>>>>

where S2: Storage<T, D>, DefaultAllocator: Allocator<D>,

Computes the spherical linear interpolation between two unit vectors.

Returns None if the two vectors are almost collinear and with opposite direction (in this case, there is an infinity of possible results).

impl<T> Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

pub fn angle(&self) -> T

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

Example

let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let rot = UnitQuaternion::from_axis_angle(&axis, 1.78);
assert_eq!(rot.angle(), 1.78);

pub fn quaternion(&self) -> &Quaternion<T>

The underlying quaternion.

Same as self.as_ref().

Example

let axis = UnitQuaternion::identity();
assert_eq!(*axis.quaternion(), Quaternion::new(1.0, 0.0, 0.0, 0.0));

pub fn conjugate(&self) -> Unit<Quaternion<T>>

Compute the conjugate of this unit quaternion.

Example

let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let rot = UnitQuaternion::from_axis_angle(&axis, 1.78);
let conj = rot.conjugate();
assert_eq!(conj, UnitQuaternion::from_axis_angle(&-axis, 1.78));

pub fn inverse(&self) -> Unit<Quaternion<T>>

Inverts this quaternion if it is not zero.

Example

let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let rot = UnitQuaternion::from_axis_angle(&axis, 1.78);
let inv = rot.inverse();
assert_eq!(rot * inv, UnitQuaternion::identity());
assert_eq!(inv * rot, UnitQuaternion::identity());

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

The rotation angle needed to make self and other coincide.

Example

let rot1 = UnitQuaternion::from_axis_angle(&Vector3::y_axis(), 1.0);
let rot2 = UnitQuaternion::from_axis_angle(&Vector3::x_axis(), 0.1);
assert_relative_eq!(rot1.angle_to(&rot2), 1.0045657, epsilon = 1.0e-6);

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

The unit quaternion needed to make self and other coincide.

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

Example

let rot1 = UnitQuaternion::from_axis_angle(&Vector3::y_axis(), 1.0);
let rot2 = UnitQuaternion::from_axis_angle(&Vector3::x_axis(), 0.1);
let rot_to = rot1.rotation_to(&rot2);
assert_relative_eq!(rot_to * rot1, rot2, epsilon = 1.0e-6);

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

Linear interpolation between two unit quaternions.

The result is not normalized.

Example

let q1 = UnitQuaternion::new_normalize(Quaternion::new(1.0, 0.0, 0.0, 0.0));
let q2 = UnitQuaternion::new_normalize(Quaternion::new(0.0, 1.0, 0.0, 0.0));
assert_eq!(q1.lerp(&q2, 0.1), Quaternion::new(0.9, 0.1, 0.0, 0.0));

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

Normalized linear interpolation between two unit quaternions.

This is the same as self.lerp except that the result is normalized.

Example

let q1 = UnitQuaternion::new_normalize(Quaternion::new(1.0, 0.0, 0.0, 0.0));
let q2 = UnitQuaternion::new_normalize(Quaternion::new(0.0, 1.0, 0.0, 0.0));
assert_eq!(q1.nlerp(&q2, 0.1), UnitQuaternion::new_normalize(Quaternion::new(0.9, 0.1, 0.0, 0.0)));

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

where T: RealField,

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). Use .try_slerp instead to avoid the panic.

Example

let q1 = UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_4, 0.0, 0.0);
let q2 = UnitQuaternion::from_euler_angles(-std::f32::consts::PI, 0.0, 0.0);

let q = q1.slerp(&q2, 1.0 / 3.0);

assert_eq!(q.euler_angles(), (std::f32::consts::FRAC_PI_2, 0.0, 0.0));

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

where T: RealField,

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 below which the sinus of the angle separating both quaternion must be to return None.

pub fn conjugate_mut(&mut self)

Compute the conjugate of this unit quaternion in-place.

pub fn inverse_mut(&mut self)

Inverts this quaternion if it is not zero.

Example

let axisangle = Vector3::new(0.1, 0.2, 0.3);
let mut rot = UnitQuaternion::new(axisangle);
rot.inverse_mut();
assert_relative_eq!(rot * UnitQuaternion::new(axisangle), UnitQuaternion::identity());
assert_relative_eq!(UnitQuaternion::new(axisangle) * rot, UnitQuaternion::identity());

pub fn axis( &self, ) -> Option<Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>>

where T: RealField,

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

Example

let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let angle = 1.2;
let rot = UnitQuaternion::from_axis_angle(&axis, angle);
assert_eq!(rot.axis(), Some(axis));

// Case with a zero angle.
let rot = UnitQuaternion::from_axis_angle(&axis, 0.0);
assert!(rot.axis().is_none());

pub fn scaled_axis( &self, ) -> Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>

where T: RealField,

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

Example

let axisangle = Vector3::new(0.1, 0.2, 0.3);
let rot = UnitQuaternion::new(axisangle);
assert_relative_eq!(rot.scaled_axis(), axisangle, epsilon = 1.0e-6);

pub fn axis_angle( &self, ) -> Option<(Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>, T)>

where T: RealField,

The rotation axis and angle in (0, pi] of this unit quaternion.

Returns None if the angle is zero.

Example

let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let angle = 1.2;
let rot = UnitQuaternion::from_axis_angle(&axis, angle);
assert_eq!(rot.axis_angle(), Some((axis, angle)));

// Case with a zero angle.
let rot = UnitQuaternion::from_axis_angle(&axis, 0.0);
assert!(rot.axis_angle().is_none());

pub fn exp(&self) -> Quaternion<T>

Compute the exponential of a quaternion.

Note that this function yields a Quaternion<T> because it loses the unit property.

pub fn ln(&self) -> Quaternion<T>

where T: RealField,

Compute the natural logarithm of a quaternion.

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

Example

let axisangle = Vector3::new(0.1, 0.2, 0.3);
let q = UnitQuaternion::new(axisangle);
assert_relative_eq!(q.ln().vector().into_owned(), axisangle, epsilon = 1.0e-6);

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

where T: RealField,

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.

Example

let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let angle = 1.2;
let rot = UnitQuaternion::from_axis_angle(&axis, angle);
let pow = rot.powf(2.0);
assert_relative_eq!(pow.axis().unwrap(), axis, epsilon = 1.0e-6);
assert_eq!(pow.angle(), 2.4);

pub fn to_rotation_matrix(self) -> Rotation<T, 3>

Builds a rotation matrix from this unit quaternion.

Example

let q = UnitQuaternion::from_axis_angle(&Vector3::z_axis(), f32::consts::FRAC_PI_6);
let rot = q.to_rotation_matrix();
let expected = Matrix3::new(0.8660254, -0.5,      0.0,
                            0.5,       0.8660254, 0.0,
                            0.0,       0.0,       1.0);

assert_relative_eq!(*rot.matrix(), expected, epsilon = 1.0e-6);

pub fn to_euler_angles(self) -> (T, T, T)

where T: RealField,

👎Deprecated: This is renamed to use .euler_angles().

Converts this unit quaternion into its equivalent Euler angles.

The angles are produced in the form (roll, pitch, yaw).

pub fn euler_angles(&self) -> (T, T, T)

where T: RealField,

Retrieves the euler angles corresponding to this unit quaternion.

The angles are produced in the form (roll, pitch, yaw).

Example

let rot = UnitQuaternion::from_euler_angles(0.1, 0.2, 0.3);
let euler = rot.euler_angles();
assert_relative_eq!(euler.0, 0.1, epsilon = 1.0e-6);
assert_relative_eq!(euler.1, 0.2, epsilon = 1.0e-6);
assert_relative_eq!(euler.2, 0.3, epsilon = 1.0e-6);

pub fn to_homogeneous( self, ) -> Matrix<T, Const<4>, Const<4>, ArrayStorage<T, 4, 4>>

Converts this unit quaternion into its equivalent homogeneous transformation matrix.

Example

let rot = UnitQuaternion::from_axis_angle(&Vector3::z_axis(), f32::consts::FRAC_PI_6);
let expected = Matrix4::new(0.8660254, -0.5,      0.0, 0.0,
                            0.5,       0.8660254, 0.0, 0.0,
                            0.0,       0.0,       1.0, 0.0,
                            0.0,       0.0,       0.0, 1.0);

assert_relative_eq!(rot.to_homogeneous(), expected, epsilon = 1.0e-6);

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

Rotate a point by this unit quaternion.

This is the same as the multiplication self * pt.

Example

let rot = UnitQuaternion::from_axis_angle(&Vector3::y_axis(), f32::consts::FRAC_PI_2);
let transformed_point = rot.transform_point(&Point3::new(1.0, 2.0, 3.0));

assert_relative_eq!(transformed_point, Point3::new(3.0, 2.0, -1.0), epsilon = 1.0e-6);

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

Rotate a vector by this unit quaternion.

This is the same as the multiplication self * v.

Example

let rot = UnitQuaternion::from_axis_angle(&Vector3::y_axis(), f32::consts::FRAC_PI_2);
let transformed_vector = rot.transform_vector(&Vector3::new(1.0, 2.0, 3.0));

assert_relative_eq!(transformed_vector, Vector3::new(3.0, 2.0, -1.0), epsilon = 1.0e-6);

pub fn inverse_transform_point( &self, pt: &OPoint<T, Const<3>>, ) -> OPoint<T, Const<3>>

Rotate a point by the inverse of this unit quaternion. This may be cheaper than inverting the unit quaternion and transforming the point.

Example

let rot = UnitQuaternion::from_axis_angle(&Vector3::y_axis(), f32::consts::FRAC_PI_2);
let transformed_point = rot.inverse_transform_point(&Point3::new(1.0, 2.0, 3.0));

assert_relative_eq!(transformed_point, Point3::new(-3.0, 2.0, 1.0), epsilon = 1.0e-6);

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

Rotate a vector by the inverse of this unit quaternion. This may be cheaper than inverting the unit quaternion and transforming the vector.

Example

let rot = UnitQuaternion::from_axis_angle(&Vector3::y_axis(), f32::consts::FRAC_PI_2);
let transformed_vector = rot.inverse_transform_vector(&Vector3::new(1.0, 2.0, 3.0));

assert_relative_eq!(transformed_vector, Vector3::new(-3.0, 2.0, 1.0), epsilon = 1.0e-6);

pub fn inverse_transform_unit_vector( &self, v: &Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>, ) -> Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>

Rotate a vector by the inverse of this unit quaternion. This may be cheaper than inverting the unit quaternion and transforming the vector.

Example

let rot = UnitQuaternion::from_axis_angle(&Vector3::z_axis(), f32::consts::FRAC_PI_2);
let transformed_vector = rot.inverse_transform_unit_vector(&Vector3::x_axis());

assert_relative_eq!(transformed_vector, -Vector3::y_axis(), epsilon = 1.0e-6);

pub fn append_axisangle_linearized( &self, axisangle: &Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>, ) -> Unit<Quaternion<T>>

Appends to self a rotation given in the axis-angle form, using a linearized formulation.

This is faster, but approximate, way to compute UnitQuaternion::new(axisangle) * self.

impl<T> Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

pub fn identity() -> Unit<Quaternion<T>>

The rotation identity.

Example

let q = UnitQuaternion::identity();
let q2 = UnitQuaternion::new(Vector3::new(1.0, 2.0, 3.0));
let v = Vector3::new_random();
let p = Point3::from(v);

assert_eq!(q * q2, q2);
assert_eq!(q2 * q, q2);
assert_eq!(q * v, v);
assert_eq!(q * p, p);

pub fn cast<To>(self) -> Unit<Quaternion<To>>

where To: Scalar + SupersetOf<T>,

Cast the components of self to another type.

Example

let q = UnitQuaternion::from_euler_angles(1.0f64, 2.0, 3.0);
let q2 = q.cast::<f32>();
assert_relative_eq!(q2, UnitQuaternion::from_euler_angles(1.0f32, 2.0, 3.0), epsilon = 1.0e-6);

pub fn from_axis_angle<SB>( axis: &Unit<Matrix<T, Const<3>, Const<1>, SB>>, angle: T, ) -> Unit<Quaternion<T>>

where SB: Storage<T, Const<3>>,

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

Example

let axis = Vector3::y_axis();
let angle = f32::consts::FRAC_PI_2;
// 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);
let q = UnitQuaternion::from_axis_angle(&axis, angle);

assert_eq!(q.axis().unwrap(), axis);
assert_eq!(q.angle(), angle);
assert_relative_eq!(q * pt, Point3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6);
assert_relative_eq!(q * vec, Vector3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6);

// A zero vector yields an identity.
assert_eq!(UnitQuaternion::from_scaled_axis(Vector3::<f32>::zeros()), UnitQuaternion::identity());

pub fn from_quaternion(q: Quaternion<T>) -> Unit<Quaternion<T>>

Creates a new unit quaternion from a quaternion.

The input quaternion will be normalized.

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

Creates a new unit quaternion from Euler angles.

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

Example

let rot = UnitQuaternion::from_euler_angles(0.1, 0.2, 0.3);
let euler = rot.euler_angles();
assert_relative_eq!(euler.0, 0.1, epsilon = 1.0e-6);
assert_relative_eq!(euler.1, 0.2, epsilon = 1.0e-6);
assert_relative_eq!(euler.2, 0.3, epsilon = 1.0e-6);

pub fn from_basis_unchecked( basis: &[Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>; 3], ) -> Unit<Quaternion<T>>

Builds an unit quaternion from a basis assumed to be orthonormal.

In order to get a valid unit-quaternion, the input must be an orthonormal basis, i.e., all vectors are normalized, and the are all orthogonal to each other. These invariants are not checked by this method.

pub fn from_rotation_matrix(rotmat: &Rotation<T, 3>) -> Unit<Quaternion<T>>

Builds an unit quaternion from a rotation matrix.

Example

let axis = Vector3::y_axis();
let angle = 0.1;
let rot = Rotation3::from_axis_angle(&axis, angle);
let q = UnitQuaternion::from_rotation_matrix(&rot);
assert_relative_eq!(q.to_rotation_matrix(), rot, epsilon = 1.0e-6);
assert_relative_eq!(q.axis().unwrap(), rot.axis().unwrap(), epsilon = 1.0e-6);
assert_relative_eq!(q.angle(), rot.angle(), epsilon = 1.0e-6);

pub fn from_matrix( m: &Matrix<T, Const<3>, Const<3>, ArrayStorage<T, 3, 3>>, ) -> Unit<Quaternion<T>>

where T: RealField,

Builds an unit quaternion by extracting the rotation part of the given transformation m.

This is an iterative method. See .from_matrix_eps to provide mover convergence parameters and starting solution. This implements “A Robust Method to Extract the Rotational Part of Deformations” by Müller et al.

pub fn from_matrix_eps( m: &Matrix<T, Const<3>, Const<3>, ArrayStorage<T, 3, 3>>, eps: T, max_iter: usize, guess: Unit<Quaternion<T>>, ) -> Unit<Quaternion<T>>

where T: RealField,

Builds an unit quaternion by extracting the rotation part of the given transformation m.

This implements “A Robust Method to Extract the Rotational Part of Deformations” by Müller et al.

Parameters

• m: the matrix from which the rotational part is to be extracted.
• eps: the angular errors tolerated between the current rotation and the optimal one.
• max_iter: the maximum number of iterations. Loops indefinitely until convergence if set to 0.
• guess: an estimate of the solution. Convergence will be significantly faster if an initial solution close to the actual solution is provided. Can be set to UnitQuaternion::identity() if no other guesses come to mind.

pub fn rotation_between<SB, SC>( a: &Matrix<T, Const<3>, Const<1>, SB>, b: &Matrix<T, Const<3>, Const<1>, SC>, ) -> Option<Unit<Quaternion<T>>>

where T: RealField, SB: Storage<T, Const<3>>, SC: Storage<T, Const<3>>,

The unit quaternion needed to make a and b be collinear and point toward the same direction. Returns None if both a and b are collinear and point to opposite directions, as then the rotation desired is not unique.

Example

let a = Vector3::new(1.0, 2.0, 3.0);
let b = Vector3::new(3.0, 1.0, 2.0);
let q = UnitQuaternion::rotation_between(&a, &b).unwrap();
assert_relative_eq!(q * a, b);
assert_relative_eq!(q.inverse() * b, a);

pub fn scaled_rotation_between<SB, SC>( a: &Matrix<T, Const<3>, Const<1>, SB>, b: &Matrix<T, Const<3>, Const<1>, SC>, s: T, ) -> Option<Unit<Quaternion<T>>>

where T: RealField, SB: Storage<T, Const<3>>, SC: Storage<T, Const<3>>,

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

Example

let a = Vector3::new(1.0, 2.0, 3.0);
let b = Vector3::new(3.0, 1.0, 2.0);
let q2 = UnitQuaternion::scaled_rotation_between(&a, &b, 0.2).unwrap();
let q5 = UnitQuaternion::scaled_rotation_between(&a, &b, 0.5).unwrap();
assert_relative_eq!(q2 * q2 * q2 * q2 * q2 * a, b, epsilon = 1.0e-6);
assert_relative_eq!(q5 * q5 * a, b, epsilon = 1.0e-6);

pub fn rotation_between_axis<SB, SC>( a: &Unit<Matrix<T, Const<3>, Const<1>, SB>>, b: &Unit<Matrix<T, Const<3>, Const<1>, SC>>, ) -> Option<Unit<Quaternion<T>>>

where T: RealField, SB: Storage<T, Const<3>>, SC: Storage<T, Const<3>>,

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

Example

let a = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let b = Unit::new_normalize(Vector3::new(3.0, 1.0, 2.0));
let q = UnitQuaternion::rotation_between(&a, &b).unwrap();
assert_relative_eq!(q * a, b);
assert_relative_eq!(q.inverse() * b, a);

pub fn scaled_rotation_between_axis<SB, SC>( na: &Unit<Matrix<T, Const<3>, Const<1>, SB>>, nb: &Unit<Matrix<T, Const<3>, Const<1>, SC>>, s: T, ) -> Option<Unit<Quaternion<T>>>

where T: RealField, SB: Storage<T, Const<3>>, SC: Storage<T, Const<3>>,

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

Example

let a = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let b = Unit::new_normalize(Vector3::new(3.0, 1.0, 2.0));
let q2 = UnitQuaternion::scaled_rotation_between(&a, &b, 0.2).unwrap();
let q5 = UnitQuaternion::scaled_rotation_between(&a, &b, 0.5).unwrap();
assert_relative_eq!(q2 * q2 * q2 * q2 * q2 * a, b, epsilon = 1.0e-6);
assert_relative_eq!(q5 * q5 * a, b, epsilon = 1.0e-6);

pub fn face_towards<SB, SC>( dir: &Matrix<T, Const<3>, Const<1>, SB>, up: &Matrix<T, Const<3>, Const<1>, SC>, ) -> Unit<Quaternion<T>>

where SB: Storage<T, Const<3>>, SC: Storage<T, Const<3>>,

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

It maps the z axis to the direction dir.

Arguments

• dir - The look direction. It does not need to be normalized.
• up - The vertical direction. It does not need to be normalized. The only requirement of this parameter is to not be collinear to dir. Non-collinearity is not checked.

Example

let dir = Vector3::new(1.0, 2.0, 3.0);
let up = Vector3::y();

let q = UnitQuaternion::face_towards(&dir, &up);
assert_relative_eq!(q * Vector3::z(), dir.normalize());

pub fn new_observer_frames<SB, SC>( dir: &Matrix<T, Const<3>, Const<1>, SB>, up: &Matrix<T, Const<3>, Const<1>, SC>, ) -> Unit<Quaternion<T>>

where SB: Storage<T, Const<3>>, SC: Storage<T, Const<3>>,

👎Deprecated: renamed to face_towards

Deprecated: Use UnitQuaternion::face_towards instead.

pub fn look_at_rh<SB, SC>( dir: &Matrix<T, Const<3>, Const<1>, SB>, up: &Matrix<T, Const<3>, Const<1>, SC>, ) -> Unit<Quaternion<T>>

where SB: Storage<T, Const<3>>, SC: Storage<T, Const<3>>,

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

It maps the view direction dir to the negative z axis. This conforms to the common notion of right handed look-at matrix from the computer graphics community.

Arguments

• dir − The view direction. It does not need to be normalized.
• up - A vector approximately aligned with required the vertical axis. It does not need to be normalized. The only requirement of this parameter is to not be collinear to dir.

Example

let dir = Vector3::new(1.0, 2.0, 3.0);
let up = Vector3::y();

let q = UnitQuaternion::look_at_rh(&dir, &up);
assert_relative_eq!(q * dir.normalize(), -Vector3::z());

pub fn look_at_lh<SB, SC>( dir: &Matrix<T, Const<3>, Const<1>, SB>, up: &Matrix<T, Const<3>, Const<1>, SC>, ) -> Unit<Quaternion<T>>

where SB: Storage<T, Const<3>>, SC: Storage<T, Const<3>>,

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

It maps the view direction dir to the positive z axis. This conforms to the common notion of left handed look-at matrix from the computer graphics community.

Arguments

• dir − The view direction. It does not need to be normalized.
• up - A vector approximately aligned with required the vertical axis. The only requirement of this parameter is to not be collinear to dir.

Example

let dir = Vector3::new(1.0, 2.0, 3.0);
let up = Vector3::y();

let q = UnitQuaternion::look_at_lh(&dir, &up);
assert_relative_eq!(q * dir.normalize(), Vector3::z());

pub fn new<SB>( axisangle: Matrix<T, Const<3>, Const<1>, SB>, ) -> Unit<Quaternion<T>>

where SB: Storage<T, Const<3>>,

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

If axisangle has a magnitude smaller than T::default_epsilon(), this returns the identity rotation.

Example

let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
// 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);
let q = UnitQuaternion::new(axisangle);

assert_relative_eq!(q * pt, Point3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6);
assert_relative_eq!(q * vec, Vector3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6);

// A zero vector yields an identity.
assert_eq!(UnitQuaternion::new(Vector3::<f32>::zeros()), UnitQuaternion::identity());

pub fn new_eps<SB>( axisangle: Matrix<T, Const<3>, Const<1>, SB>, eps: T, ) -> Unit<Quaternion<T>>

where SB: Storage<T, Const<3>>,

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

If axisangle has a magnitude smaller than eps, this returns the identity rotation.

Example

let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
// 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);
let q = UnitQuaternion::new_eps(axisangle, 1.0e-6);

assert_relative_eq!(q * pt, Point3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6);
assert_relative_eq!(q * vec, Vector3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6);

// An almost zero vector yields an identity.
assert_eq!(UnitQuaternion::new_eps(Vector3::new(1.0e-8, 1.0e-9, 1.0e-7), 1.0e-6), UnitQuaternion::identity());

pub fn from_scaled_axis<SB>( axisangle: Matrix<T, Const<3>, Const<1>, SB>, ) -> Unit<Quaternion<T>>

where SB: Storage<T, Const<3>>,

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

If axisangle has a magnitude smaller than T::default_epsilon(), this returns the identity rotation. Same as Self::new(axisangle).

Example

let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
// 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);
let q = UnitQuaternion::from_scaled_axis(axisangle);

assert_relative_eq!(q * pt, Point3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6);
assert_relative_eq!(q * vec, Vector3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6);

// A zero vector yields an identity.
assert_eq!(UnitQuaternion::from_scaled_axis(Vector3::<f32>::zeros()), UnitQuaternion::identity());

pub fn from_scaled_axis_eps<SB>( axisangle: Matrix<T, Const<3>, Const<1>, SB>, eps: T, ) -> Unit<Quaternion<T>>

where SB: Storage<T, Const<3>>,

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

If axisangle has a magnitude smaller than eps, this returns the identity rotation. Same as Self::new_eps(axisangle, eps).

Example

let axisangle = Vector3::y() * f32::consts::FRAC_PI_2;
// 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);
let q = UnitQuaternion::from_scaled_axis_eps(axisangle, 1.0e-6);

assert_relative_eq!(q * pt, Point3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6);
assert_relative_eq!(q * vec, Vector3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6);

// An almost zero vector yields an identity.
assert_eq!(UnitQuaternion::from_scaled_axis_eps(Vector3::new(1.0e-8, 1.0e-9, 1.0e-7), 1.0e-6), UnitQuaternion::identity());

pub fn mean_of( unit_quaternions: impl IntoIterator<Item = Unit<Quaternion<T>>>, ) -> Unit<Quaternion<T>>

where T: RealField,

Create the mean unit quaternion from a data structure implementing IntoIterator returning unit quaternions.

The method will panic if the iterator does not return any quaternions.

Algorithm from: Oshman, Yaakov, and Avishy Carmi. “Attitude estimation from vector observations using a genetic-algorithm-embedded quaternion particle filter.” Journal of Guidance, Control, and Dynamics 29.4 (2006): 879-891.

Example

let q1 = UnitQuaternion::from_euler_angles(0.0, 0.0, 0.0);
let q2 = UnitQuaternion::from_euler_angles(-0.1, 0.0, 0.0);
let q3 = UnitQuaternion::from_euler_angles(0.1, 0.0, 0.0);

let quat_vec = vec![q1, q2, q3];
let q_mean = UnitQuaternion::mean_of(quat_vec);

let euler_angles_mean = q_mean.euler_angles();
assert_relative_eq!(euler_angles_mean.0, 0.0, epsilon = 1.0e-7)

impl<T> Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

pub fn dual_quaternion(&self) -> &DualQuaternion<T>

The underlying dual quaternion.

Same as self.as_ref().

Example

let id = UnitDualQuaternion::identity();
assert_eq!(*id.dual_quaternion(), DualQuaternion::from_real_and_dual(
    Quaternion::new(1.0, 0.0, 0.0, 0.0),
    Quaternion::new(0.0, 0.0, 0.0, 0.0)
));

pub fn conjugate(&self) -> Unit<DualQuaternion<T>>

Compute the conjugate of this unit quaternion.

Example

let qr = Quaternion::new(1.0, 2.0, 3.0, 4.0);
let qd = Quaternion::new(5.0, 6.0, 7.0, 8.0);
let unit = UnitDualQuaternion::new_normalize(
    DualQuaternion::from_real_and_dual(qr, qd)
);
let conj = unit.conjugate();
assert_eq!(conj.real, unit.real.conjugate());
assert_eq!(conj.dual, unit.dual.conjugate());

pub fn conjugate_mut(&mut self)

Compute the conjugate of this unit quaternion in-place.

Example

let qr = Quaternion::new(1.0, 2.0, 3.0, 4.0);
let qd = Quaternion::new(5.0, 6.0, 7.0, 8.0);
let unit = UnitDualQuaternion::new_normalize(
    DualQuaternion::from_real_and_dual(qr, qd)
);
let mut conj = unit.clone();
conj.conjugate_mut();
assert_eq!(conj.as_ref().real, unit.as_ref().real.conjugate());
assert_eq!(conj.as_ref().dual, unit.as_ref().dual.conjugate());

pub fn inverse(&self) -> Unit<DualQuaternion<T>>

Inverts this dual quaternion if it is not zero.

Example

let qr = Quaternion::new(1.0, 2.0, 3.0, 4.0);
let qd = Quaternion::new(5.0, 6.0, 7.0, 8.0);
let unit = UnitDualQuaternion::new_normalize(DualQuaternion::from_real_and_dual(qr, qd));
let inv = unit.inverse();
assert_relative_eq!(unit * inv, UnitDualQuaternion::identity(), epsilon = 1.0e-6);
assert_relative_eq!(inv * unit, UnitDualQuaternion::identity(), epsilon = 1.0e-6);

pub fn inverse_mut(&mut self)

Inverts this dual quaternion in place if it is not zero.

Example

let qr = Quaternion::new(1.0, 2.0, 3.0, 4.0);
let qd = Quaternion::new(5.0, 6.0, 7.0, 8.0);
let unit = UnitDualQuaternion::new_normalize(DualQuaternion::from_real_and_dual(qr, qd));
let mut inv = unit.clone();
inv.inverse_mut();
assert_relative_eq!(unit * inv, UnitDualQuaternion::identity(), epsilon = 1.0e-6);
assert_relative_eq!(inv * unit, UnitDualQuaternion::identity(), epsilon = 1.0e-6);

pub fn isometry_to( &self, other: &Unit<DualQuaternion<T>>, ) -> Unit<DualQuaternion<T>>

The unit dual quaternion needed to make self and other coincide.

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

Example

let qr = Quaternion::new(1.0, 2.0, 3.0, 4.0);
let qd = Quaternion::new(5.0, 6.0, 7.0, 8.0);
let dq1 = UnitDualQuaternion::new_normalize(DualQuaternion::from_real_and_dual(qr, qd));
let dq2 = UnitDualQuaternion::new_normalize(DualQuaternion::from_real_and_dual(qd, qr));
let dq_to = dq1.isometry_to(&dq2);
assert_relative_eq!(dq_to * dq1, dq2, epsilon = 1.0e-6);

pub fn lerp(&self, other: &Unit<DualQuaternion<T>>, t: T) -> DualQuaternion<T>

Linear interpolation between two unit dual quaternions.

The result is not normalized.

Example

let dq1 = UnitDualQuaternion::new_normalize(DualQuaternion::from_real_and_dual(
    Quaternion::new(0.5, 0.0, 0.5, 0.0),
    Quaternion::new(0.0, 0.5, 0.0, 0.5)
));
let dq2 = UnitDualQuaternion::new_normalize(DualQuaternion::from_real_and_dual(
    Quaternion::new(0.5, 0.0, 0.0, 0.5),
    Quaternion::new(0.5, 0.0, 0.5, 0.0)
));
assert_relative_eq!(
    UnitDualQuaternion::new_normalize(dq1.lerp(&dq2, 0.5)),
    UnitDualQuaternion::new_normalize(
        DualQuaternion::from_real_and_dual(
            Quaternion::new(0.5, 0.0, 0.25, 0.25),
            Quaternion::new(0.25, 0.25, 0.25, 0.25)
        )
    ),
    epsilon = 1.0e-6
);

pub fn nlerp( &self, other: &Unit<DualQuaternion<T>>, t: T, ) -> Unit<DualQuaternion<T>>

Normalized linear interpolation between two unit quaternions.

This is the same as self.lerp except that the result is normalized.

Example

let dq1 = UnitDualQuaternion::new_normalize(DualQuaternion::from_real_and_dual(
    Quaternion::new(0.5, 0.0, 0.5, 0.0),
    Quaternion::new(0.0, 0.5, 0.0, 0.5)
));
let dq2 = UnitDualQuaternion::new_normalize(DualQuaternion::from_real_and_dual(
    Quaternion::new(0.5, 0.0, 0.0, 0.5),
    Quaternion::new(0.5, 0.0, 0.5, 0.0)
));
assert_relative_eq!(dq1.nlerp(&dq2, 0.2), UnitDualQuaternion::new_normalize(
    DualQuaternion::from_real_and_dual(
        Quaternion::new(0.5, 0.0, 0.4, 0.1),
        Quaternion::new(0.1, 0.4, 0.1, 0.4)
    )
), epsilon = 1.0e-6);

pub fn sclerp( &self, other: &Unit<DualQuaternion<T>>, t: T, ) -> Unit<DualQuaternion<T>>

where T: RealField,

Screw linear interpolation between two unit quaternions. This creates a smooth arc from one dual-quaternion to another.

Panics if the angle between both quaternion is 180 degrees (in which case the interpolation is not well-defined). Use .try_sclerp instead to avoid the panic.

Example

let dq1 = UnitDualQuaternion::from_parts(
    Vector3::new(0.0, 3.0, 0.0).into(),
    UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_4, 0.0, 0.0),
);

let dq2 = UnitDualQuaternion::from_parts(
    Vector3::new(0.0, 0.0, 3.0).into(),
    UnitQuaternion::from_euler_angles(-std::f32::consts::PI, 0.0, 0.0),
);

let dq = dq1.sclerp(&dq2, 1.0 / 3.0);

assert_relative_eq!(
    dq.rotation().euler_angles().0, std::f32::consts::FRAC_PI_2, epsilon = 1.0e-6
);
assert_relative_eq!(dq.translation().vector.y, 3.0, epsilon = 1.0e-6);

pub fn try_sclerp( &self, other: &Unit<DualQuaternion<T>>, t: T, epsilon: T, ) -> Option<Unit<DualQuaternion<T>>>

where T: RealField,

Computes the screw-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 below which the sinus of the angle separating both quaternion must be to return None.

pub fn rotation(&self) -> Unit<Quaternion<T>>

Return the rotation part of this unit dual quaternion.

Example

let dq = UnitDualQuaternion::from_parts(
    Vector3::new(0.0, 3.0, 0.0).into(),
    UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_4, 0.0, 0.0)
);

assert_relative_eq!(
    dq.rotation().angle(), std::f32::consts::FRAC_PI_4, epsilon = 1.0e-6
);

pub fn translation(&self) -> Translation<T, 3>

Return the translation part of this unit dual quaternion.

Example

let dq = UnitDualQuaternion::from_parts(
    Vector3::new(0.0, 3.0, 0.0).into(),
    UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_4, 0.0, 0.0)
);

assert_relative_eq!(
    dq.translation().vector, Vector3::new(0.0, 3.0, 0.0), epsilon = 1.0e-6
);

pub fn to_isometry(self) -> Isometry<T, Unit<Quaternion<T>>, 3>

Builds an isometry from this unit dual quaternion.

Example

let rotation = UnitQuaternion::from_euler_angles(std::f32::consts::PI, 0.0, 0.0);
let translation = Vector3::new(1.0, 3.0, 2.5);
let dq = UnitDualQuaternion::from_parts(
    translation.into(),
    rotation
);
let iso = dq.to_isometry();

assert_relative_eq!(iso.rotation.angle(), std::f32::consts::PI, epsilon = 1.0e-6);
assert_relative_eq!(iso.translation.vector, translation, epsilon = 1.0e-6);

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

Rotate and translate a point by this unit dual quaternion interpreted as an isometry.

This is the same as the multiplication self * pt.

Example

let dq = UnitDualQuaternion::from_parts(
    Vector3::new(0.0, 3.0, 0.0).into(),
    UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_2, 0.0, 0.0)
);
let point = Point3::new(1.0, 2.0, 3.0);

assert_relative_eq!(
    dq.transform_point(&point), Point3::new(1.0, 0.0, 2.0), epsilon = 1.0e-6
);

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

Rotate a vector by this unit dual quaternion, ignoring the translational component.

This is the same as the multiplication self * v.

Example

let dq = UnitDualQuaternion::from_parts(
    Vector3::new(0.0, 3.0, 0.0).into(),
    UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_2, 0.0, 0.0)
);
let vector = Vector3::new(1.0, 2.0, 3.0);

assert_relative_eq!(
    dq.transform_vector(&vector), Vector3::new(1.0, -3.0, 2.0), epsilon = 1.0e-6
);

pub fn inverse_transform_point( &self, pt: &OPoint<T, Const<3>>, ) -> OPoint<T, Const<3>>

Rotate and translate a point by the inverse of this unit quaternion.

This may be cheaper than inverting the unit dual quaternion and transforming the point.

Example

let dq = UnitDualQuaternion::from_parts(
    Vector3::new(0.0, 3.0, 0.0).into(),
    UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_2, 0.0, 0.0)
);
let point = Point3::new(1.0, 2.0, 3.0);

assert_relative_eq!(
    dq.inverse_transform_point(&point), Point3::new(1.0, 3.0, 1.0), epsilon = 1.0e-6
);

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

Rotate a vector by the inverse of this unit quaternion, ignoring the translational component.

This may be cheaper than inverting the unit dual quaternion and transforming the vector.

Example

let dq = UnitDualQuaternion::from_parts(
    Vector3::new(0.0, 3.0, 0.0).into(),
    UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_2, 0.0, 0.0)
);
let vector = Vector3::new(1.0, 2.0, 3.0);

assert_relative_eq!(
    dq.inverse_transform_vector(&vector), Vector3::new(1.0, 3.0, -2.0), epsilon = 1.0e-6
);

pub fn inverse_transform_unit_vector( &self, v: &Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>, ) -> Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>

Rotate a unit vector by the inverse of this unit quaternion, ignoring the translational component. This may be cheaper than inverting the unit dual quaternion and transforming the vector.

Example

let dq = UnitDualQuaternion::from_parts(
    Vector3::new(0.0, 3.0, 0.0).into(),
    UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_2, 0.0, 0.0)
);
let vector = Unit::new_unchecked(Vector3::new(0.0, 1.0, 0.0));

assert_relative_eq!(
    dq.inverse_transform_unit_vector(&vector),
    Unit::new_unchecked(Vector3::new(0.0, 0.0, -1.0)),
    epsilon = 1.0e-6
);

impl<T> Unit<DualQuaternion<T>>

where T: SimdRealField + RealField, <T as SimdValue>::Element: SimdRealField,

pub fn to_homogeneous( self, ) -> Matrix<T, Const<4>, Const<4>, ArrayStorage<T, 4, 4>>

Converts this unit dual quaternion interpreted as an isometry into its equivalent homogeneous transformation matrix.

Example

let dq = UnitDualQuaternion::from_parts(
    Vector3::new(1.0, 3.0, 2.0).into(),
    UnitQuaternion::from_axis_angle(&Vector3::z_axis(), std::f32::consts::FRAC_PI_6)
);
let expected = Matrix4::new(0.8660254, -0.5,      0.0, 1.0,
                            0.5,       0.8660254, 0.0, 3.0,
                            0.0,       0.0,       1.0, 2.0,
                            0.0,       0.0,       0.0, 1.0);

assert_relative_eq!(dq.to_homogeneous(), expected, epsilon = 1.0e-6);

impl<T> Unit<DualQuaternion<T>>

where T: SimdRealField,

pub fn identity() -> Unit<DualQuaternion<T>>

The unit dual quaternion multiplicative identity, which also represents the identity transformation as an isometry.

Example

let ident = UnitDualQuaternion::identity();
let point = Point3::new(1.0, -4.3, 3.33);

assert_eq!(ident * point, point);
assert_eq!(ident, ident.inverse());

pub fn cast<To>(self) -> Unit<DualQuaternion<To>>

where To: Scalar, Unit<DualQuaternion<To>>: SupersetOf<Unit<DualQuaternion<T>>>,

Cast the components of self to another type.

Example

let q = UnitDualQuaternion::<f64>::identity();
let q2 = q.cast::<f32>();
assert_eq!(q2, UnitDualQuaternion::<f32>::identity());

impl<T> Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

pub fn from_parts( translation: Translation<T, 3>, rotation: Unit<Quaternion<T>>, ) -> Unit<DualQuaternion<T>>

Return a dual quaternion representing the translation and orientation given by the provided rotation quaternion and translation vector.

Example

let dq = UnitDualQuaternion::from_parts(
    Vector3::new(0.0, 3.0, 0.0).into(),
    UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_2, 0.0, 0.0)
);
let point = Point3::new(1.0, 2.0, 3.0);

assert_relative_eq!(dq * point, Point3::new(1.0, 0.0, 2.0), epsilon = 1.0e-6);

pub fn from_isometry( isometry: &Isometry<T, Unit<Quaternion<T>>, 3>, ) -> Unit<DualQuaternion<T>>

Return a unit dual quaternion representing the translation and orientation given by the provided isometry.

Example

let iso = Isometry3::from_parts(
    Vector3::new(0.0, 3.0, 0.0).into(),
    UnitQuaternion::from_euler_angles(std::f32::consts::FRAC_PI_2, 0.0, 0.0)
);
let dq = UnitDualQuaternion::from_isometry(&iso);
let point = Point3::new(1.0, 2.0, 3.0);

assert_relative_eq!(dq * point, iso * point, epsilon = 1.0e-6);

pub fn from_rotation(rotation: Unit<Quaternion<T>>) -> Unit<DualQuaternion<T>>

Creates a dual quaternion from a unit quaternion rotation.

Example

let q = Quaternion::new(1.0, 2.0, 3.0, 4.0);
let rot = UnitQuaternion::new_normalize(q);

let dq = UnitDualQuaternion::from_rotation(rot);
assert_relative_eq!(dq.as_ref().real.norm(), 1.0, epsilon = 1.0e-6);
assert_eq!(dq.as_ref().dual.norm(), 0.0);

impl<T> Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Angle extraction

pub fn angle(&self) -> T

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

Example

let rot = UnitComplex::new(1.78);
assert_eq!(rot.angle(), 1.78);

pub fn sin_angle(&self) -> T

The sine of the rotation angle.

Example

let angle = 1.78f32;
let rot = UnitComplex::new(angle);
assert_eq!(rot.sin_angle(), angle.sin());

pub fn cos_angle(&self) -> T

The cosine of the rotation angle.

Example

let angle = 1.78f32;
let rot = UnitComplex::new(angle);
assert_eq!(rot.cos_angle(),angle.cos());

pub fn scaled_axis( &self, ) -> Matrix<T, Const<1>, Const<1>, ArrayStorage<T, 1, 1>>

The rotation angle returned as a 1-dimensional vector.

This is generally used in the context of generic programming. Using the .angle() method instead is more common.

pub fn axis_angle( &self, ) -> Option<(Unit<Matrix<T, Const<1>, Const<1>, ArrayStorage<T, 1, 1>>>, T)>

where T: RealField,

The rotation axis and angle in (0, pi] of this complex number.

This is generally used in the context of generic programming. Using the .angle() method instead is more common. Returns None if the angle is zero.

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

The rotation angle needed to make self and other coincide.

Example

let rot1 = UnitComplex::new(0.1);
let rot2 = UnitComplex::new(1.7);
assert_relative_eq!(rot1.angle_to(&rot2), 1.6);

impl<T> Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Conjugation and inversion

pub fn conjugate(&self) -> Unit<Complex<T>>

Compute the conjugate of this unit complex number.

Example

let rot = UnitComplex::new(1.78);
let conj = rot.conjugate();
assert_eq!(rot.complex().im, -conj.complex().im);
assert_eq!(rot.complex().re, conj.complex().re);

pub fn inverse(&self) -> Unit<Complex<T>>

Inverts this complex number if it is not zero.

Example

let rot = UnitComplex::new(1.2);
let inv = rot.inverse();
assert_relative_eq!(rot * inv, UnitComplex::identity(), epsilon = 1.0e-6);
assert_relative_eq!(inv * rot, UnitComplex::identity(), epsilon = 1.0e-6);

pub fn conjugate_mut(&mut self)

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

Example

let angle = 1.7;
let rot = UnitComplex::new(angle);
let mut conj = UnitComplex::new(angle);
conj.conjugate_mut();
assert_eq!(rot.complex().im, -conj.complex().im);
assert_eq!(rot.complex().re, conj.complex().re);

pub fn inverse_mut(&mut self)

Inverts in-place this unit complex number.

Example

let angle = 1.7;
let mut rot = UnitComplex::new(angle);
rot.inverse_mut();
assert_relative_eq!(rot * UnitComplex::new(angle), UnitComplex::identity());
assert_relative_eq!(UnitComplex::new(angle) * rot, UnitComplex::identity());

impl<T> Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Conversion to a matrix

pub fn to_rotation_matrix(self) -> Rotation<T, 2>

Builds the rotation matrix corresponding to this unit complex number.

Example

let rot = UnitComplex::new(f32::consts::FRAC_PI_6);
let expected = Rotation2::new(f32::consts::FRAC_PI_6);
assert_eq!(rot.to_rotation_matrix(), expected);

pub fn to_homogeneous( self, ) -> Matrix<T, Const<3>, Const<3>, ArrayStorage<T, 3, 3>>

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

Example

let rot = UnitComplex::new(f32::consts::FRAC_PI_6);
let expected = Matrix3::new(0.8660254, -0.5,      0.0,
                            0.5,       0.8660254, 0.0,
                            0.0,       0.0,       1.0);
assert_eq!(rot.to_homogeneous(), expected);

impl<T> Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Transformation of a vector or a point

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

Rotate the given point by this unit complex number.

This is the same as the multiplication self * pt.

Example

let rot = UnitComplex::new(f32::consts::FRAC_PI_2);
let transformed_point = rot.transform_point(&Point2::new(1.0, 2.0));
assert_relative_eq!(transformed_point, Point2::new(-2.0, 1.0), epsilon = 1.0e-6);

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

Rotate the given vector by this unit complex number.

This is the same as the multiplication self * v.

Example

let rot = UnitComplex::new(f32::consts::FRAC_PI_2);
let transformed_vector = rot.transform_vector(&Vector2::new(1.0, 2.0));
assert_relative_eq!(transformed_vector, Vector2::new(-2.0, 1.0), epsilon = 1.0e-6);

pub fn inverse_transform_point( &self, pt: &OPoint<T, Const<2>>, ) -> OPoint<T, Const<2>>

Rotate the given point by the inverse of this unit complex number.

Example

let rot = UnitComplex::new(f32::consts::FRAC_PI_2);
let transformed_point = rot.inverse_transform_point(&Point2::new(1.0, 2.0));
assert_relative_eq!(transformed_point, Point2::new(2.0, -1.0), epsilon = 1.0e-6);

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

Rotate the given vector by the inverse of this unit complex number.

Example

let rot = UnitComplex::new(f32::consts::FRAC_PI_2);
let transformed_vector = rot.inverse_transform_vector(&Vector2::new(1.0, 2.0));
assert_relative_eq!(transformed_vector, Vector2::new(2.0, -1.0), epsilon = 1.0e-6);

pub fn inverse_transform_unit_vector( &self, v: &Unit<Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>>, ) -> Unit<Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>>

Rotate the given vector by the inverse of this unit complex number.

Example

let rot = UnitComplex::new(f32::consts::FRAC_PI_2);
let transformed_vector = rot.inverse_transform_unit_vector(&Vector2::x_axis());
assert_relative_eq!(transformed_vector, -Vector2::y_axis(), epsilon = 1.0e-6);

impl<T> Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Interpolation

pub fn slerp(&self, other: &Unit<Complex<T>>, t: T) -> Unit<Complex<T>>

Spherical linear interpolation between two rotations represented as unit complex numbers.

Examples:

let rot1 = UnitComplex::new(std::f32::consts::FRAC_PI_4);
let rot2 = UnitComplex::new(-std::f32::consts::PI);

let rot = rot1.slerp(&rot2, 1.0 / 3.0);

assert_relative_eq!(rot.angle(), std::f32::consts::FRAC_PI_2);

impl<T> Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Identity

pub fn identity() -> Unit<Complex<T>>

The unit complex number multiplicative identity.

Example

let rot1 = UnitComplex::identity();
let rot2 = UnitComplex::new(1.7);

assert_eq!(rot1 * rot2, rot2);
assert_eq!(rot2 * rot1, rot2);

impl<T> Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Construction from a 2D rotation angle

pub fn new(angle: T) -> Unit<Complex<T>>

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

Example

let rot = UnitComplex::new(f32::consts::FRAC_PI_2);

assert_relative_eq!(rot * Point2::new(3.0, 4.0), Point2::new(-4.0, 3.0));

pub fn from_angle(angle: T) -> Unit<Complex<T>>

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

Same as Self::new(angle).

Example

let rot = UnitComplex::from_angle(f32::consts::FRAC_PI_2);

assert_relative_eq!(rot * Point2::new(3.0, 4.0), Point2::new(-4.0, 3.0));

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

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

The input values are not checked to actually be cosines and sine of the same value. Is is generally preferable to use the ::new(angle) constructor instead.

Example

let angle = f32::consts::FRAC_PI_2;
let rot = UnitComplex::from_cos_sin_unchecked(angle.cos(), angle.sin());

assert_relative_eq!(rot * Point2::new(3.0, 4.0), Point2::new(-4.0, 3.0));

pub fn from_scaled_axis<SB>( axisangle: Matrix<T, Const<1>, Const<1>, SB>, ) -> Unit<Complex<T>>

where SB: Storage<T, Const<1>>,

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

This is generally used in the context of generic programming. Using the ::new(angle) method instead is more common.

impl<T> Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Construction from an existing 2D matrix or complex number

pub fn cast<To>(self) -> Unit<Complex<To>>

where To: Scalar, Unit<Complex<To>>: SupersetOf<Unit<Complex<T>>>,

Cast the components of self to another type.

Example

#[macro_use] extern crate approx;
let c = UnitComplex::new(1.0f64);
let c2 = c.cast::<f32>();
assert_relative_eq!(c2, UnitComplex::new(1.0f32));

pub fn complex(&self) -> &Complex<T>

The underlying complex number.

Same as self.as_ref().

Example

let angle = 1.78f32;
let rot = UnitComplex::new(angle);
assert_eq!(*rot.complex(), Complex::new(angle.cos(), angle.sin()));

pub fn from_complex(q: Complex<T>) -> Unit<Complex<T>>

Creates a new unit complex number from a complex number.

The input complex number will be normalized.

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

Creates a new unit complex number from a complex number.

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

pub fn from_rotation_matrix(rotmat: &Rotation<T, 2>) -> Unit<Complex<T>>

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

Example

let rot = Rotation2::new(1.7);
let complex = UnitComplex::from_rotation_matrix(&rot);
assert_eq!(complex, UnitComplex::new(1.7));

pub fn from_basis_unchecked( basis: &[Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>; 2], ) -> Unit<Complex<T>>

Builds a rotation from a basis assumed to be orthonormal.

In order to get a valid unit-quaternion, the input must be an orthonormal basis, i.e., all vectors are normalized, and the are all orthogonal to each other. These invariants are not checked by this method.

pub fn from_matrix( m: &Matrix<T, Const<2>, Const<2>, ArrayStorage<T, 2, 2>>, ) -> Unit<Complex<T>>

where T: RealField,

Builds an unit complex by extracting the rotation part of the given transformation m.

This is an iterative method. See .from_matrix_eps to provide mover convergence parameters and starting solution. This implements “A Robust Method to Extract the Rotational Part of Deformations” by Müller et al.

pub fn from_matrix_eps( m: &Matrix<T, Const<2>, Const<2>, ArrayStorage<T, 2, 2>>, eps: T, max_iter: usize, guess: Unit<Complex<T>>, ) -> Unit<Complex<T>>

where T: RealField,

Builds an unit complex by extracting the rotation part of the given transformation m.

This implements “A Robust Method to Extract the Rotational Part of Deformations” by Müller et al.

Parameters

• m: the matrix from which the rotational part is to be extracted.
• eps: the angular errors tolerated between the current rotation and the optimal one.
• max_iter: the maximum number of iterations. Loops indefinitely until convergence if set to 0.
• guess: an estimate of the solution. Convergence will be significantly faster if an initial solution close to the actual solution is provided. Can be set to UnitQuaternion::identity() if no other guesses come to mind.

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

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

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

Example

let rot1 = UnitComplex::new(0.1);
let rot2 = UnitComplex::new(1.7);
let rot_to = rot1.rotation_to(&rot2);

assert_relative_eq!(rot_to * rot1, rot2);
assert_relative_eq!(rot_to.inverse() * rot2, rot1);

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

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.

Example

let rot = UnitComplex::new(0.78);
let pow = rot.powf(2.0);
assert_relative_eq!(pow.angle(), 2.0 * 0.78);

impl<T> Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Construction from two vectors

pub fn rotation_between<SB, SC>( a: &Matrix<T, Const<2>, Const<1>, SB>, b: &Matrix<T, Const<2>, Const<1>, SC>, ) -> Unit<Complex<T>>

where T: RealField, SB: Storage<T, Const<2>>, SC: Storage<T, Const<2>>,

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

Example

let a = Vector2::new(1.0, 2.0);
let b = Vector2::new(2.0, 1.0);
let rot = UnitComplex::rotation_between(&a, &b);
assert_relative_eq!(rot * a, b);
assert_relative_eq!(rot.inverse() * b, a);

pub fn scaled_rotation_between<SB, SC>( a: &Matrix<T, Const<2>, Const<1>, SB>, b: &Matrix<T, Const<2>, Const<1>, SC>, s: T, ) -> Unit<Complex<T>>

where T: RealField, SB: Storage<T, Const<2>>, SC: Storage<T, Const<2>>,

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

Example

let a = Vector2::new(1.0, 2.0);
let b = Vector2::new(2.0, 1.0);
let rot2 = UnitComplex::scaled_rotation_between(&a, &b, 0.2);
let rot5 = UnitComplex::scaled_rotation_between(&a, &b, 0.5);
assert_relative_eq!(rot2 * rot2 * rot2 * rot2 * rot2 * a, b, epsilon = 1.0e-6);
assert_relative_eq!(rot5 * rot5 * a, b, epsilon = 1.0e-6);

pub fn rotation_between_axis<SB, SC>( a: &Unit<Matrix<T, Const<2>, Const<1>, SB>>, b: &Unit<Matrix<T, Const<2>, Const<1>, SC>>, ) -> Unit<Complex<T>>

where SB: Storage<T, Const<2>>, SC: Storage<T, Const<2>>,

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

Example

let a = Unit::new_normalize(Vector2::new(1.0, 2.0));
let b = Unit::new_normalize(Vector2::new(2.0, 1.0));
let rot = UnitComplex::rotation_between_axis(&a, &b);
assert_relative_eq!(rot * a, b);
assert_relative_eq!(rot.inverse() * b, a);

pub fn scaled_rotation_between_axis<SB, SC>( na: &Unit<Matrix<T, Const<2>, Const<1>, SB>>, nb: &Unit<Matrix<T, Const<2>, Const<1>, SC>>, s: T, ) -> Unit<Complex<T>>

where SB: Storage<T, Const<2>>, SC: Storage<T, Const<2>>,

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

Example

let a = Unit::new_normalize(Vector2::new(1.0, 2.0));
let b = Unit::new_normalize(Vector2::new(2.0, 1.0));
let rot2 = UnitComplex::scaled_rotation_between_axis(&a, &b, 0.2);
let rot5 = UnitComplex::scaled_rotation_between_axis(&a, &b, 0.5);
assert_relative_eq!(rot2 * rot2 * rot2 * rot2 * rot2 * a, b, epsilon = 1.0e-6);
assert_relative_eq!(rot5 * rot5 * a, b, epsilon = 1.0e-6);

Trait Implementations

impl<T> AbsDiffEq for Unit<Complex<T>>

where T: RealField,

type Epsilon = T

Used for specifying relative comparisons.

fn default_epsilon() -> <Unit<Complex<T>> as AbsDiffEq>::Epsilon

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

fn abs_diff_eq( &self, other: &Unit<Complex<T>>, epsilon: <Unit<Complex<T>> as AbsDiffEq>::Epsilon, ) -> bool

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

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

The inverse of [AbsDiffEq::abs_diff_eq].

impl<T> AbsDiffEq for Unit<DualQuaternion<T>>

where T: RealField<Epsilon = T> + AbsDiffEq,

type Epsilon = T

Used for specifying relative comparisons.

fn default_epsilon() -> <Unit<DualQuaternion<T>> as AbsDiffEq>::Epsilon

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

fn abs_diff_eq( &self, other: &Unit<DualQuaternion<T>>, epsilon: <Unit<DualQuaternion<T>> as AbsDiffEq>::Epsilon, ) -> bool

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

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

The inverse of [AbsDiffEq::abs_diff_eq].

impl<T, R, C, S> AbsDiffEq for Unit<Matrix<T, R, C, S>>

where R: Dim, C: Dim, T: Scalar + AbsDiffEq, S: RawStorage<T, R, C>, <T as AbsDiffEq>::Epsilon: Clone,

type Epsilon = <T as AbsDiffEq>::Epsilon

Used for specifying relative comparisons.

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

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

fn abs_diff_eq( &self, other: &Unit<Matrix<T, R, C, S>>, epsilon: <Unit<Matrix<T, R, C, S>> as AbsDiffEq>::Epsilon, ) -> bool

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

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

The inverse of [AbsDiffEq::abs_diff_eq].

impl<T> AbsDiffEq for Unit<Quaternion<T>>

where T: RealField<Epsilon = T> + AbsDiffEq,

type Epsilon = T

Used for specifying relative comparisons.

fn default_epsilon() -> <Unit<Quaternion<T>> as AbsDiffEq>::Epsilon

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

fn abs_diff_eq( &self, other: &Unit<Quaternion<T>>, epsilon: <Unit<Quaternion<T>> as AbsDiffEq>::Epsilon, ) -> bool

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

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

The inverse of [AbsDiffEq::abs_diff_eq].

impl<T> AbstractRotation<T, 2> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The rotation identity.

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

The rotation inverse.

fn inverse_mut(&mut self)

Change self to its inverse.

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

Apply the rotation to the given vector.

fn transform_point(&self, p: &OPoint<T, Const<2>>) -> OPoint<T, Const<2>>

Apply the rotation to the given point.

fn inverse_transform_vector( &self, v: &Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>, ) -> Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>

Apply the inverse rotation to the given vector.

fn inverse_transform_point( &self, p: &OPoint<T, Const<2>>, ) -> OPoint<T, Const<2>>

Apply the inverse rotation to the given point.

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

Apply the inverse rotation to the given unit vector.

impl<T> AbstractRotation<T, 3> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The rotation identity.

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

The rotation inverse.

fn inverse_mut(&mut self)

Change self to its inverse.

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

Apply the rotation to the given vector.

fn transform_point(&self, p: &OPoint<T, Const<3>>) -> OPoint<T, Const<3>>

Apply the rotation to the given point.

fn inverse_transform_vector( &self, v: &Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>, ) -> Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>

Apply the inverse rotation to the given vector.

fn inverse_transform_point( &self, p: &OPoint<T, Const<3>>, ) -> OPoint<T, Const<3>>

Apply the inverse rotation to the given point.

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

Apply the inverse rotation to the given unit vector.

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

fn as_ref(&self) -> &T

Converts this type into a shared reference of the (usually inferred) input type.

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<T> Debug for Unit<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Default for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

fn default() -> Unit<Complex<T>>

Returns the “default value” for a type.

impl<T> Default for Unit<DualQuaternion<T>>

where T: RealField,

fn default() -> Unit<DualQuaternion<T>>

Returns the “default value” for a type.

impl<T> Default for Unit<Quaternion<T>>

where T: RealField,

fn default() -> Unit<Quaternion<T>>

Returns the “default value” for a type.

impl<T> Deref for Unit<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

impl<'de, T> Deserialize<'de> for Unit<T>

where T: Deserialize<'de>,

fn deserialize<D>( deserializer: D, ) -> Result<Unit<T>, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Display for Unit<Complex<T>>

where T: RealField + Display,

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

Formats the value using the given formatter.

impl<T> Display for Unit<DualQuaternion<T>>

where T: RealField + Display,

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

Formats the value using the given formatter.

impl<T> Display for Unit<Quaternion<T>>

where T: RealField + Display,

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

Formats the value using the given formatter.

impl<'a, 'b, T> Div<&'b Isometry<T, Unit<Quaternion<T>>, 3>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Isometry<T, Unit<Quaternion<T>>, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> Div<&'b Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> Div<&'b Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Rotation<T, 2>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> Div<&'b Rotation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Rotation<T, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> Div<&'b Rotation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Similarity<T, Unit<Quaternion<T>>, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> Div<&'b Similarity<T, Unit<Quaternion<T>>, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T, C> Div<&'b Transform<T, C, 3>> for &'a Unit<Quaternion<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T, C> Div<&'b Transform<T, C, 3>> for Unit<Quaternion<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Translation<T, 3>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

fn div( self, rhs: &'b Translation<T, 3>, ) -> <&'a Unit<DualQuaternion<T>> as Div<&'b Translation<T, 3>>>::Output

Performs the / operation.

impl<'b, T> Div<&'b Translation<T, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Unit<Complex<T>>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> Div<&'b Unit<Complex<T>>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Unit<DualQuaternion<T>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Unit<DualQuaternion<T>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> Div<&'b Unit<DualQuaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> Div<&'b Unit<DualQuaternion<T>>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Unit<Quaternion<T>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Unit<Quaternion<T>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> Div<&'b Unit<Quaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> Div<&'b Unit<Quaternion<T>>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T> Div<Isometry<T, Unit<Quaternion<T>>, 3>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

fn div( self, rhs: Isometry<T, Unit<Quaternion<T>>, 3>, ) -> <&'a Unit<DualQuaternion<T>> as Div<Isometry<T, Unit<Quaternion<T>>, 3>>>::Output

Performs the / operation.

impl<'a, T> Div<Isometry<T, Unit<Quaternion<T>>, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T> Div<Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T> Div<Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T> Div<Rotation<T, 2>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T> Div<Rotation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T> Div<Rotation<T, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T> Div<Rotation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T> Div<Similarity<T, Unit<Quaternion<T>>, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T> Div<Similarity<T, Unit<Quaternion<T>>, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T, C> Div<Transform<T, C, 3>> for &'a Unit<Quaternion<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T, C> Div<Transform<T, C, 3>> for Unit<Quaternion<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T> Div<Translation<T, 3>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

fn div( self, rhs: Translation<T, 3>, ) -> <&'a Unit<DualQuaternion<T>> as Div<Translation<T, 3>>>::Output

Performs the / operation.

impl<T> Div<Translation<T, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

fn div( self, rhs: Translation<T, 3>, ) -> <Unit<DualQuaternion<T>> as Div<Translation<T, 3>>>::Output

Performs the / operation.

impl<'a, T> Div<Unit<Complex<T>>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T> Div<Unit<DualQuaternion<T>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T> Div<Unit<DualQuaternion<T>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T> Div<Unit<DualQuaternion<T>>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T> Div<Unit<Quaternion<T>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T> Div<Unit<Quaternion<T>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T> Div<Unit<Quaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T> Div for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T> Div for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the / operator.

fn div( self, rhs: Unit<DualQuaternion<T>>, ) -> <Unit<DualQuaternion<T>> as Div>::Output

Performs the / operation.

impl<T> Div for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T> DivAssign<&'b Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<'b, T> DivAssign<&'b Rotation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<'b, T> DivAssign<&'b Rotation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<'b, T> DivAssign<&'b Translation<T, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<'b, T> DivAssign<&'b Unit<Complex<T>>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<'b, T> DivAssign<&'b Unit<DualQuaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<'b, T> DivAssign<&'b Unit<Quaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<'b, T> DivAssign<&'b Unit<Quaternion<T>>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T> DivAssign<Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T> DivAssign<Rotation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T> DivAssign<Rotation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T> DivAssign<Translation<T, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T> DivAssign<Unit<Quaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T> DivAssign for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T> DivAssign for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T> DivAssign for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T> From<[Unit<Complex<<T as SimdValue>::Element>>; 16]> for Unit<Complex<T>>

where T: Scalar + Copy + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 16]>, <T as SimdValue>::Element: Scalar + Copy,

fn from(arr: [Unit<Complex<<T as SimdValue>::Element>>; 16]) -> Unit<Complex<T>>

Converts to this type from the input type.

impl<T> From<[Unit<Complex<<T as SimdValue>::Element>>; 2]> for Unit<Complex<T>>

where T: Scalar + Copy + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 2]>, <T as SimdValue>::Element: Scalar + Copy,

fn from(arr: [Unit<Complex<<T as SimdValue>::Element>>; 2]) -> Unit<Complex<T>>

Converts to this type from the input type.

impl<T> From<[Unit<Complex<<T as SimdValue>::Element>>; 4]> for Unit<Complex<T>>

where T: Scalar + Copy + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 4]>, <T as SimdValue>::Element: Scalar + Copy,

fn from(arr: [Unit<Complex<<T as SimdValue>::Element>>; 4]) -> Unit<Complex<T>>

Converts to this type from the input type.

impl<T> From<[Unit<Complex<<T as SimdValue>::Element>>; 8]> for Unit<Complex<T>>

where T: Scalar + Copy + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 8]>, <T as SimdValue>::Element: Scalar + Copy,

fn from(arr: [Unit<Complex<<T as SimdValue>::Element>>; 8]) -> Unit<Complex<T>>

Converts to this type from the input type.

impl<T, R, C> From<[Unit<Matrix<<T as SimdValue>::Element, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<<T as SimdValue>::Element>>>; 16]> for Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>>

where T: Scalar + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 16]>, R: Dim, C: Dim, <T as SimdValue>::Element: Scalar, DefaultAllocator: Allocator<R, C>,

fn from( arr: [Unit<Matrix<<T as SimdValue>::Element, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<<T as SimdValue>::Element>>>; 16], ) -> Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>>

Converts to this type from the input type.

impl<T, R, C> From<[Unit<Matrix<<T as SimdValue>::Element, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<<T as SimdValue>::Element>>>; 2]> for Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>>

where T: Scalar + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 2]>, R: Dim, C: Dim, <T as SimdValue>::Element: Scalar, DefaultAllocator: Allocator<R, C>,

fn from( arr: [Unit<Matrix<<T as SimdValue>::Element, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<<T as SimdValue>::Element>>>; 2], ) -> Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>>

Converts to this type from the input type.

impl<T, R, C> From<[Unit<Matrix<<T as SimdValue>::Element, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<<T as SimdValue>::Element>>>; 4]> for Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>>

where T: Scalar + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 4]>, R: Dim, C: Dim, <T as SimdValue>::Element: Scalar, DefaultAllocator: Allocator<R, C>,

fn from( arr: [Unit<Matrix<<T as SimdValue>::Element, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<<T as SimdValue>::Element>>>; 4], ) -> Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>>

Converts to this type from the input type.

impl<T, R, C> From<[Unit<Matrix<<T as SimdValue>::Element, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<<T as SimdValue>::Element>>>; 8]> for Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>>

where T: Scalar + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 8]>, R: Dim, C: Dim, <T as SimdValue>::Element: Scalar, DefaultAllocator: Allocator<R, C>,

fn from( arr: [Unit<Matrix<<T as SimdValue>::Element, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<<T as SimdValue>::Element>>>; 8], ) -> Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>>

Converts to this type from the input type.

impl<T> From<[Unit<Quaternion<<T as SimdValue>::Element>>; 16]> for Unit<Quaternion<T>>

where T: Scalar + Copy + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 16]>, <T as SimdValue>::Element: Scalar + Copy,

fn from( arr: [Unit<Quaternion<<T as SimdValue>::Element>>; 16], ) -> Unit<Quaternion<T>>

Converts to this type from the input type.

impl<T> From<[Unit<Quaternion<<T as SimdValue>::Element>>; 2]> for Unit<Quaternion<T>>

where T: Scalar + Copy + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 2]>, <T as SimdValue>::Element: Scalar + Copy,

fn from( arr: [Unit<Quaternion<<T as SimdValue>::Element>>; 2], ) -> Unit<Quaternion<T>>

Converts to this type from the input type.

impl<T> From<[Unit<Quaternion<<T as SimdValue>::Element>>; 4]> for Unit<Quaternion<T>>

where T: Scalar + Copy + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 4]>, <T as SimdValue>::Element: Scalar + Copy,

fn from( arr: [Unit<Quaternion<<T as SimdValue>::Element>>; 4], ) -> Unit<Quaternion<T>>

Converts to this type from the input type.

impl<T> From<[Unit<Quaternion<<T as SimdValue>::Element>>; 8]> for Unit<Quaternion<T>>

where T: Scalar + Copy + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 8]>, <T as SimdValue>::Element: Scalar + Copy,

fn from( arr: [Unit<Quaternion<<T as SimdValue>::Element>>; 8], ) -> Unit<Quaternion<T>>

Converts to this type from the input type.

impl<T> From<Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

fn from(iso: Isometry<T, Unit<Quaternion<T>>, 3>) -> Unit<DualQuaternion<T>>

Converts to this type from the input type.

impl<T> From<Rotation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

fn from(q: Rotation<T, 2>) -> Unit<Complex<T>>

Converts to this type from the input type.

impl<T> From<Rotation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

fn from(q: Rotation<T, 3>) -> Unit<Quaternion<T>>

Converts to this type from the input type.

impl<T> From<Unit<Complex<T>>> for Matrix<T, Const<2>, Const<2>, ArrayStorage<T, 2, 2>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

fn from( q: Unit<Complex<T>>, ) -> Matrix<T, Const<2>, Const<2>, ArrayStorage<T, 2, 2>>

Converts to this type from the input type.

impl<T> From<Unit<Complex<T>>> for Matrix<T, Const<3>, Const<3>, ArrayStorage<T, 3, 3>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

fn from( q: Unit<Complex<T>>, ) -> Matrix<T, Const<3>, Const<3>, ArrayStorage<T, 3, 3>>

Converts to this type from the input type.

impl<T> From<Unit<DualQuaternion<T>>> for Matrix<T, Const<4>, Const<4>, ArrayStorage<T, 4, 4>>

where T: SimdRealField + RealField, <T as SimdValue>::Element: SimdRealField,

fn from( dq: Unit<DualQuaternion<T>>, ) -> Matrix<T, Const<4>, Const<4>, ArrayStorage<T, 4, 4>>

Converts to this type from the input type.

impl<T> From<Unit<Quaternion<T>>> for Matrix<T, Const<3>, Const<3>, ArrayStorage<T, 3, 3>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

fn from( q: Unit<Quaternion<T>>, ) -> Matrix<T, Const<3>, Const<3>, ArrayStorage<T, 3, 3>>

Converts to this type from the input type.

impl<T> From<Unit<Quaternion<T>>> for Matrix<T, Const<4>, Const<4>, ArrayStorage<T, 4, 4>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

fn from( q: Unit<Quaternion<T>>, ) -> Matrix<T, Const<4>, Const<4>, ArrayStorage<T, 4, 4>>

Converts to this type from the input type.

impl<T> Hash for Unit<T>

where T: Hash,

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

where __H: Hasher,

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, 'b, T> Mul<&'b DualQuaternion<T>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = DualQuaternion<T>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b DualQuaternion<T>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = DualQuaternion<T>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Isometry<T, Unit<Complex<T>>, 2>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Isometry<T, Unit<Complex<T>>, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Isometry<T, Unit<Quaternion<T>>, 3>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Isometry<T, Unit<Quaternion<T>>, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T, S> Mul<&'b Matrix<T, Const<2>, Const<1>, S>> for &'a Unit<Complex<T>>

where T: SimdRealField, S: Storage<T, Const<2>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Matrix<T, Const<2>, Const<1>, S>, ) -> <&'a Unit<Complex<T>> as Mul<&'b Matrix<T, Const<2>, Const<1>, S>>>::Output

Performs the * operation.

impl<'b, T, S> Mul<&'b Matrix<T, Const<2>, Const<1>, S>> for Unit<Complex<T>>

where T: SimdRealField, S: Storage<T, Const<2>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Matrix<T, Const<2>, Const<1>, S>, ) -> <Unit<Complex<T>> as Mul<&'b Matrix<T, Const<2>, Const<1>, S>>>::Output

Performs the * operation.

impl<'a, 'b, T, SB> Mul<&'b Matrix<T, Const<3>, Const<1>, SB>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Matrix<T, Const<3>, Const<1>, SB>, ) -> <&'a Unit<DualQuaternion<T>> as Mul<&'b Matrix<T, Const<3>, Const<1>, SB>>>::Output

Performs the * operation.

impl<'a, 'b, T, SB> Mul<&'b Matrix<T, Const<3>, Const<1>, SB>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Matrix<T, Const<3>, Const<1>, SB>, ) -> <&'a Unit<Quaternion<T>> as Mul<&'b Matrix<T, Const<3>, Const<1>, SB>>>::Output

Performs the * operation.

impl<'b, T, SB> Mul<&'b Matrix<T, Const<3>, Const<1>, SB>> for Unit<DualQuaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Matrix<T, Const<3>, Const<1>, SB>, ) -> <Unit<DualQuaternion<T>> as Mul<&'b Matrix<T, Const<3>, Const<1>, SB>>>::Output

Performs the * operation.

impl<'b, T, SB> Mul<&'b Matrix<T, Const<3>, Const<1>, SB>> for Unit<Quaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Matrix<T, Const<3>, Const<1>, SB>, ) -> <Unit<Quaternion<T>> as Mul<&'b Matrix<T, Const<3>, Const<1>, SB>>>::Output

Performs the * operation.

impl<'a, 'b, T> Mul<&'b OPoint<T, Const<2>>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: &'b OPoint<T, Const<2>>, ) -> <&'a Unit<Complex<T>> as Mul<&'b OPoint<T, Const<2>>>>::Output

Performs the * operation.

impl<'b, T> Mul<&'b OPoint<T, Const<2>>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: &'b OPoint<T, Const<2>>, ) -> <Unit<Complex<T>> as Mul<&'b OPoint<T, Const<2>>>>::Output

Performs the * operation.

impl<'a, 'b, T> Mul<&'b OPoint<T, Const<3>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: &'b OPoint<T, Const<3>>, ) -> <&'a Unit<DualQuaternion<T>> as Mul<&'b OPoint<T, Const<3>>>>::Output

Performs the * operation.

impl<'a, 'b, T> Mul<&'b OPoint<T, Const<3>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b OPoint<T, Const<3>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: &'b OPoint<T, Const<3>>, ) -> <Unit<DualQuaternion<T>> as Mul<&'b OPoint<T, Const<3>>>>::Output

Performs the * operation.

impl<'b, T> Mul<&'b OPoint<T, Const<3>>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Rotation<T, 2>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Rotation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Rotation<T, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Rotation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Similarity<T, Unit<Complex<T>>, 2>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Similarity<T, Unit<Complex<T>>, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Similarity<T, Unit<Quaternion<T>>, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Similarity<T, Unit<Quaternion<T>>, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T, C> Mul<&'b Transform<T, C, 2>> for &'a Unit<Complex<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, C> Mul<&'b Transform<T, C, 2>> for Unit<Complex<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T, C> Mul<&'b Transform<T, C, 3>> for &'a Unit<Quaternion<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, C> Mul<&'b Transform<T, C, 3>> for Unit<Quaternion<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Translation<T, 2>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Translation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Translation<T, 3>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Translation<T, 3>, ) -> <&'a Unit<DualQuaternion<T>> as Mul<&'b Translation<T, 3>>>::Output

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Translation<T, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Translation<T, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Translation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Unit<Complex<T>>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Unit<Complex<T>>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Unit<DualQuaternion<T>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Unit<DualQuaternion<T>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Unit<DualQuaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Unit<DualQuaternion<T>>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T, S> Mul<&'b Unit<Matrix<T, Const<2>, Const<1>, S>>> for &'a Unit<Complex<T>>

where T: SimdRealField, S: Storage<T, Const<2>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Unit<Matrix<T, Const<2>, Const<1>, S>>, ) -> <&'a Unit<Complex<T>> as Mul<&'b Unit<Matrix<T, Const<2>, Const<1>, S>>>>::Output

Performs the * operation.

impl<'b, T, S> Mul<&'b Unit<Matrix<T, Const<2>, Const<1>, S>>> for Unit<Complex<T>>

where T: SimdRealField, S: Storage<T, Const<2>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Unit<Matrix<T, Const<2>, Const<1>, S>>, ) -> <Unit<Complex<T>> as Mul<&'b Unit<Matrix<T, Const<2>, Const<1>, S>>>>::Output

Performs the * operation.

impl<'a, 'b, T, SB> Mul<&'b Unit<Matrix<T, Const<3>, Const<1>, SB>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Unit<Matrix<T, Const<3>, Const<1>, SB>>, ) -> <&'a Unit<DualQuaternion<T>> as Mul<&'b Unit<Matrix<T, Const<3>, Const<1>, SB>>>>::Output

Performs the * operation.

impl<'a, 'b, T, SB> Mul<&'b Unit<Matrix<T, Const<3>, Const<1>, SB>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Unit<Matrix<T, Const<3>, Const<1>, SB>>, ) -> <&'a Unit<Quaternion<T>> as Mul<&'b Unit<Matrix<T, Const<3>, Const<1>, SB>>>>::Output

Performs the * operation.

impl<'b, T, SB> Mul<&'b Unit<Matrix<T, Const<3>, Const<1>, SB>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Unit<Matrix<T, Const<3>, Const<1>, SB>>, ) -> <Unit<DualQuaternion<T>> as Mul<&'b Unit<Matrix<T, Const<3>, Const<1>, SB>>>>::Output

Performs the * operation.

impl<'b, T, SB> Mul<&'b Unit<Matrix<T, Const<3>, Const<1>, SB>>> for Unit<Quaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: &'b Unit<Matrix<T, Const<3>, Const<1>, SB>>, ) -> <Unit<Quaternion<T>> as Mul<&'b Unit<Matrix<T, Const<3>, Const<1>, SB>>>>::Output

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Unit<Quaternion<T>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Unit<Quaternion<T>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Unit<Quaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> Mul<&'b Unit<Quaternion<T>>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<DualQuaternion<T>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = DualQuaternion<T>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<DualQuaternion<T>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = DualQuaternion<T>

The resulting type after applying the * operator.

fn mul( self, rhs: DualQuaternion<T>, ) -> <Unit<DualQuaternion<T>> as Mul<DualQuaternion<T>>>::Output

Performs the * operation.

impl<'a, T> Mul<Isometry<T, Unit<Complex<T>>, 2>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Isometry<T, Unit<Complex<T>>, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Isometry<T, Unit<Quaternion<T>>, 3>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

fn mul( self, rhs: Isometry<T, Unit<Quaternion<T>>, 3>, ) -> <&'a Unit<DualQuaternion<T>> as Mul<Isometry<T, Unit<Quaternion<T>>, 3>>>::Output

Performs the * operation.

impl<'a, T> Mul<Isometry<T, Unit<Quaternion<T>>, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T, S> Mul<Matrix<T, Const<2>, Const<1>, S>> for &'a Unit<Complex<T>>

where T: SimdRealField, S: Storage<T, Const<2>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: Matrix<T, Const<2>, Const<1>, S>, ) -> <&'a Unit<Complex<T>> as Mul<Matrix<T, Const<2>, Const<1>, S>>>::Output

Performs the * operation.

impl<T, S> Mul<Matrix<T, Const<2>, Const<1>, S>> for Unit<Complex<T>>

where T: SimdRealField, S: Storage<T, Const<2>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: Matrix<T, Const<2>, Const<1>, S>, ) -> <Unit<Complex<T>> as Mul<Matrix<T, Const<2>, Const<1>, S>>>::Output

Performs the * operation.

impl<'a, T, SB> Mul<Matrix<T, Const<3>, Const<1>, SB>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: Matrix<T, Const<3>, Const<1>, SB>, ) -> <&'a Unit<DualQuaternion<T>> as Mul<Matrix<T, Const<3>, Const<1>, SB>>>::Output

Performs the * operation.

impl<'a, T, SB> Mul<Matrix<T, Const<3>, Const<1>, SB>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: Matrix<T, Const<3>, Const<1>, SB>, ) -> <&'a Unit<Quaternion<T>> as Mul<Matrix<T, Const<3>, Const<1>, SB>>>::Output

Performs the * operation.

impl<T, SB> Mul<Matrix<T, Const<3>, Const<1>, SB>> for Unit<DualQuaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: Matrix<T, Const<3>, Const<1>, SB>, ) -> <Unit<DualQuaternion<T>> as Mul<Matrix<T, Const<3>, Const<1>, SB>>>::Output

Performs the * operation.

impl<T, SB> Mul<Matrix<T, Const<3>, Const<1>, SB>> for Unit<Quaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: Matrix<T, Const<3>, Const<1>, SB>, ) -> <Unit<Quaternion<T>> as Mul<Matrix<T, Const<3>, Const<1>, SB>>>::Output

Performs the * operation.

impl<'a, T> Mul<OPoint<T, Const<2>>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: OPoint<T, Const<2>>, ) -> <&'a Unit<Complex<T>> as Mul<OPoint<T, Const<2>>>>::Output

Performs the * operation.

impl<T> Mul<OPoint<T, Const<2>>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: OPoint<T, Const<2>>, ) -> <Unit<Complex<T>> as Mul<OPoint<T, Const<2>>>>::Output

Performs the * operation.

impl<'a, T> Mul<OPoint<T, Const<3>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: OPoint<T, Const<3>>, ) -> <&'a Unit<DualQuaternion<T>> as Mul<OPoint<T, Const<3>>>>::Output

Performs the * operation.

impl<'a, T> Mul<OPoint<T, Const<3>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: OPoint<T, Const<3>>, ) -> <&'a Unit<Quaternion<T>> as Mul<OPoint<T, Const<3>>>>::Output

Performs the * operation.

impl<T> Mul<OPoint<T, Const<3>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: OPoint<T, Const<3>>, ) -> <Unit<DualQuaternion<T>> as Mul<OPoint<T, Const<3>>>>::Output

Performs the * operation.

impl<T> Mul<OPoint<T, Const<3>>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Rotation<T, 2>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Rotation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Rotation<T, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Rotation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Similarity<T, Unit<Complex<T>>, 2>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Similarity<T, Unit<Complex<T>>, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Similarity<T, Unit<Quaternion<T>>, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Similarity<T, Unit<Quaternion<T>>, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Similarity<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T, C> Mul<Transform<T, C, 2>> for &'a Unit<Complex<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the * operator.

fn mul( self, rhs: Transform<T, C, 2>, ) -> <&'a Unit<Complex<T>> as Mul<Transform<T, C, 2>>>::Output

Performs the * operation.

impl<T, C> Mul<Transform<T, C, 2>> for Unit<Complex<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T, C> Mul<Transform<T, C, 3>> for &'a Unit<Quaternion<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, C> Mul<Transform<T, C, 3>> for Unit<Quaternion<T>>

where T: Scalar + Zero + One + ClosedAddAssign + ClosedMulAssign + RealField, C: TCategoryMul<TAffine>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Translation<T, 2>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Translation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Complex<T>>, 2>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Translation<T, 3>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

fn mul( self, rhs: Translation<T, 3>, ) -> <&'a Unit<DualQuaternion<T>> as Mul<Translation<T, 3>>>::Output

Performs the * operation.

impl<'a, T> Mul<Translation<T, 3>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Translation<T, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

fn mul( self, rhs: Translation<T, 3>, ) -> <Unit<DualQuaternion<T>> as Mul<Translation<T, 3>>>::Output

Performs the * operation.

impl<T> Mul<Translation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Unit<Quaternion<T>>, 3>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Unit<Complex<T>>> for &'a Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Unit<DualQuaternion<T>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Unit<DualQuaternion<T>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Unit<DualQuaternion<T>>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T, S> Mul<Unit<Matrix<T, Const<2>, Const<1>, S>>> for &'a Unit<Complex<T>>

where T: SimdRealField, S: Storage<T, Const<2>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: Unit<Matrix<T, Const<2>, Const<1>, S>>, ) -> <&'a Unit<Complex<T>> as Mul<Unit<Matrix<T, Const<2>, Const<1>, S>>>>::Output

Performs the * operation.

impl<T, S> Mul<Unit<Matrix<T, Const<2>, Const<1>, S>>> for Unit<Complex<T>>

where T: SimdRealField, S: Storage<T, Const<2>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<2>, Const<1>, ArrayStorage<T, 2, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: Unit<Matrix<T, Const<2>, Const<1>, S>>, ) -> <Unit<Complex<T>> as Mul<Unit<Matrix<T, Const<2>, Const<1>, S>>>>::Output

Performs the * operation.

impl<'a, T, SB> Mul<Unit<Matrix<T, Const<3>, Const<1>, SB>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: Unit<Matrix<T, Const<3>, Const<1>, SB>>, ) -> <&'a Unit<DualQuaternion<T>> as Mul<Unit<Matrix<T, Const<3>, Const<1>, SB>>>>::Output

Performs the * operation.

impl<'a, T, SB> Mul<Unit<Matrix<T, Const<3>, Const<1>, SB>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: Unit<Matrix<T, Const<3>, Const<1>, SB>>, ) -> <&'a Unit<Quaternion<T>> as Mul<Unit<Matrix<T, Const<3>, Const<1>, SB>>>>::Output

Performs the * operation.

impl<T, SB> Mul<Unit<Matrix<T, Const<3>, Const<1>, SB>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: Unit<Matrix<T, Const<3>, Const<1>, SB>>, ) -> <Unit<DualQuaternion<T>> as Mul<Unit<Matrix<T, Const<3>, Const<1>, SB>>>>::Output

Performs the * operation.

impl<T, SB> Mul<Unit<Matrix<T, Const<3>, Const<1>, SB>>> for Unit<Quaternion<T>>

where T: SimdRealField, SB: Storage<T, Const<3>>, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>

The resulting type after applying the * operator.

fn mul( self, rhs: Unit<Matrix<T, Const<3>, Const<1>, SB>>, ) -> <Unit<Quaternion<T>> as Mul<Unit<Matrix<T, Const<3>, Const<1>, SB>>>>::Output

Performs the * operation.

impl<'a, T> Mul<Unit<Quaternion<T>>> for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T> Mul<Unit<Quaternion<T>>> for &'a Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul<Unit<Quaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul for Unit<Complex<T>>

where T: SimdRealField,

type Output = Unit<Complex<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T> Mul for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the * operator.

fn mul( self, rhs: Unit<DualQuaternion<T>>, ) -> <Unit<DualQuaternion<T>> as Mul>::Output

Performs the * operation.

impl<T> Mul for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<Quaternion<T>>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T> MulAssign<&'b Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<'b, T> MulAssign<&'b Rotation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<'b, T> MulAssign<&'b Rotation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<'b, T> MulAssign<&'b Translation<T, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<'b, T> MulAssign<&'b Unit<Complex<T>>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<'b, T> MulAssign<&'b Unit<DualQuaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<'b, T> MulAssign<&'b Unit<Quaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<'b, T> MulAssign<&'b Unit<Quaternion<T>>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<T> MulAssign<Isometry<T, Unit<Quaternion<T>>, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<T> MulAssign<Rotation<T, 2>> for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<T> MulAssign<Rotation<T, 3>> for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<T> MulAssign<Translation<T, 3>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<T> MulAssign<Unit<Quaternion<T>>> for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<T> MulAssign for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<T> MulAssign for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<T> MulAssign for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<'a, T> Neg for &'a Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the - operator.

fn neg(self) -> <&'a Unit<DualQuaternion<T>> as Neg>::Output

Performs the unary - operation.

impl<T> Neg for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Unit<DualQuaternion<T>>

The resulting type after applying the - operator.

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

Performs the unary - operation.

impl<T, R, C> Neg for Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>>

where T: Scalar + ClosedNeg, R: Dim, C: Dim, DefaultAllocator: Allocator<R, C>,

type Output = Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>>

The resulting type after applying the - operator.

fn neg( self, ) -> <Unit<Matrix<T, R, C, <DefaultAllocator as Allocator<R, C>>::Buffer<T>>> as Neg>::Output

Performs the unary - operation.

impl<T> One for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

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

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

impl<T> One for Unit<DualQuaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

fn one() -> Unit<DualQuaternion<T>>

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

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

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

impl<T> One for Unit<Quaternion<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

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

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

impl<T> PartialEq for Unit<Complex<T>>

where T: Scalar + PartialEq,

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T> PartialEq for Unit<DualQuaternion<T>>

where T: Scalar + ClosedNeg + PartialEq + SimdRealField,

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T, R, C, S> PartialEq for Unit<Matrix<T, R, C, S>>

where T: Scalar + PartialEq, R: Dim, C: Dim, S: RawStorage<T, R, C>,

fn eq(&self, rhs: &Unit<Matrix<T, R, C, S>>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T> PartialEq for Unit<Quaternion<T>>

where T: Scalar + ClosedNeg + PartialEq,

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T> RelativeEq for Unit<Complex<T>>

where T: RealField,

fn default_max_relative() -> <Unit<Complex<T>> as AbsDiffEq>::Epsilon

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

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

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

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

The inverse of [RelativeEq::relative_eq].

impl<T> RelativeEq for Unit<DualQuaternion<T>>

where T: RealField<Epsilon = T> + RelativeEq,

fn default_max_relative() -> <Unit<DualQuaternion<T>> as AbsDiffEq>::Epsilon

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

fn relative_eq( &self, other: &Unit<DualQuaternion<T>>, epsilon: <Unit<DualQuaternion<T>> as AbsDiffEq>::Epsilon, max_relative: <Unit<DualQuaternion<T>> as AbsDiffEq>::Epsilon, ) -> bool

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

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

The inverse of [RelativeEq::relative_eq].

impl<T, R, C, S> RelativeEq for Unit<Matrix<T, R, C, S>>

where R: Dim, C: Dim, T: Scalar + RelativeEq, S: Storage<T, R, C>, <T as AbsDiffEq>::Epsilon: Clone,

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

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

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

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

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

The inverse of [RelativeEq::relative_eq].

impl<T> RelativeEq for Unit<Quaternion<T>>

where T: RealField<Epsilon = T> + RelativeEq,

fn default_max_relative() -> <Unit<Quaternion<T>> as AbsDiffEq>::Epsilon

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

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

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

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

The inverse of [RelativeEq::relative_eq].

impl<T> Serialize for Unit<T>

where T: Serialize,

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

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> SimdValue for Unit<Complex<T>>

where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

const LANES: usize = T::LANES

The number of lanes of this SIMD value.

type Element = Unit<Complex<<T as SimdValue>::Element>>

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

type SimdBool = <T as SimdValue>::SimdBool

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

fn splat(val: <Unit<Complex<T>> as SimdValue>::Element) -> Unit<Complex<T>>

Initializes an SIMD value with each lanes set to val.

fn extract(&self, i: usize) -> <Unit<Complex<T>> as SimdValue>::Element

Extracts the i-th lane of self.

unsafe fn extract_unchecked( &self, i: usize, ) -> <Unit<Complex<T>> as SimdValue>::Element

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

fn replace(&mut self, i: usize, val: <Unit<Complex<T>> as SimdValue>::Element)

Replaces the i-th lane of self by val.

unsafe fn replace_unchecked( &mut self, i: usize, val: <Unit<Complex<T>> as SimdValue>::Element, )

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

fn select( self, cond: <Unit<Complex<T>> as SimdValue>::SimdBool, other: Unit<Complex<T>>, ) -> Unit<Complex<T>>

Merges self and other depending on the lanes of cond.

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

where Self: Clone,

Applies a function to each lane of self.

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

where Self: Clone,

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

impl<T> SimdValue for Unit<Quaternion<T>>

where T: Scalar + SimdValue, <T as SimdValue>::Element: Scalar,

const LANES: usize = T::LANES

The number of lanes of this SIMD value.

type Element = Unit<Quaternion<<T as SimdValue>::Element>>

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

type SimdBool = <T as SimdValue>::SimdBool

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

fn splat( val: <Unit<Quaternion<T>> as SimdValue>::Element, ) -> Unit<Quaternion<T>>

Initializes an SIMD value with each lanes set to val.

fn extract(&self, i: usize) -> <Unit<Quaternion<T>> as SimdValue>::Element

Extracts the i-th lane of self.

unsafe fn extract_unchecked( &self, i: usize, ) -> <Unit<Quaternion<T>> as SimdValue>::Element

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

fn replace( &mut self, i: usize, val: <Unit<Quaternion<T>> as SimdValue>::Element, )

Replaces the i-th lane of self by val.

unsafe fn replace_unchecked( &mut self, i: usize, val: <Unit<Quaternion<T>> as SimdValue>::Element, )

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

fn select( self, cond: <Unit<Quaternion<T>> as SimdValue>::SimdBool, other: Unit<Quaternion<T>>, ) -> Unit<Quaternion<T>>

Merges self and other depending on the lanes of cond.

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

where Self: Clone,

Applies a function to each lane of self.

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

where Self: Clone,

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

impl<T1, T2, R> SubsetOf<Isometry<T2, R, 2>> for Unit<Complex<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>, R: AbstractRotation<T2, 2> + SupersetOf<Unit<Complex<T1>>>,

fn to_superset(&self) -> Isometry<T2, R, 2>

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

fn is_in_subset(iso: &Isometry<T2, R, 2>) -> bool

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

fn from_superset_unchecked(iso: &Isometry<T2, R, 2>) -> Unit<Complex<T1>>

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

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

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

impl<T1, T2, R> SubsetOf<Isometry<T2, R, 3>> for Unit<Quaternion<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>, R: AbstractRotation<T2, 3> + SupersetOf<Unit<Quaternion<T1>>>,

fn to_superset(&self) -> Isometry<T2, R, 3>

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

fn is_in_subset(iso: &Isometry<T2, R, 3>) -> bool

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

fn from_superset_unchecked(iso: &Isometry<T2, R, 3>) -> Unit<Quaternion<T1>>

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

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

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

impl<T1, T2> SubsetOf<Isometry<T2, Unit<Quaternion<T2>>, 3>> for Unit<DualQuaternion<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>,

fn to_superset(&self) -> Isometry<T2, Unit<Quaternion<T2>>, 3>

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

fn is_in_subset(iso: &Isometry<T2, Unit<Quaternion<T2>>, 3>) -> bool

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

fn from_superset_unchecked( iso: &Isometry<T2, Unit<Quaternion<T2>>, 3>, ) -> Unit<DualQuaternion<T1>>

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

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

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

impl<T1, T2> SubsetOf<Matrix<T2, Const<3>, Const<3>, ArrayStorage<T2, 3, 3>>> for Unit<Complex<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>,

fn to_superset(&self) -> Matrix<T2, Const<3>, Const<3>, ArrayStorage<T2, 3, 3>>

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

fn is_in_subset( m: &Matrix<T2, Const<3>, Const<3>, ArrayStorage<T2, 3, 3>>, ) -> bool

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

fn from_superset_unchecked( m: &Matrix<T2, Const<3>, Const<3>, ArrayStorage<T2, 3, 3>>, ) -> Unit<Complex<T1>>

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

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

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

impl<T1, T2> SubsetOf<Matrix<T2, Const<4>, Const<4>, ArrayStorage<T2, 4, 4>>> for Unit<DualQuaternion<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>,

fn to_superset(&self) -> Matrix<T2, Const<4>, Const<4>, ArrayStorage<T2, 4, 4>>

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

fn is_in_subset( m: &Matrix<T2, Const<4>, Const<4>, ArrayStorage<T2, 4, 4>>, ) -> bool

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

fn from_superset_unchecked( m: &Matrix<T2, Const<4>, Const<4>, ArrayStorage<T2, 4, 4>>, ) -> Unit<DualQuaternion<T1>>

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

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

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

impl<T1, T2> SubsetOf<Matrix<T2, Const<4>, Const<4>, ArrayStorage<T2, 4, 4>>> for Unit<Quaternion<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>,

fn to_superset(&self) -> Matrix<T2, Const<4>, Const<4>, ArrayStorage<T2, 4, 4>>

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

fn is_in_subset( m: &Matrix<T2, Const<4>, Const<4>, ArrayStorage<T2, 4, 4>>, ) -> bool

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

fn from_superset_unchecked( m: &Matrix<T2, Const<4>, Const<4>, ArrayStorage<T2, 4, 4>>, ) -> Unit<Quaternion<T1>>

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

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

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

impl<T1, T2> SubsetOf<Rotation<T2, 2>> for Unit<Complex<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>,

fn to_superset(&self) -> Rotation<T2, 2>

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

fn is_in_subset(rot: &Rotation<T2, 2>) -> bool

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

fn from_superset_unchecked(rot: &Rotation<T2, 2>) -> Unit<Complex<T1>>

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

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

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

impl<T1, T2> SubsetOf<Rotation<T2, 3>> for Unit<Quaternion<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>,

fn to_superset(&self) -> Rotation<T2, 3>

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

fn is_in_subset(rot: &Rotation<T2, 3>) -> bool

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

fn from_superset_unchecked(rot: &Rotation<T2, 3>) -> Unit<Quaternion<T1>>

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

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

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

impl<T1, T2, R> SubsetOf<Similarity<T2, R, 2>> for Unit<Complex<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>, R: AbstractRotation<T2, 2> + SupersetOf<Unit<Complex<T1>>>,

fn to_superset(&self) -> Similarity<T2, R, 2>

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

fn is_in_subset(sim: &Similarity<T2, R, 2>) -> bool

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

fn from_superset_unchecked(sim: &Similarity<T2, R, 2>) -> Unit<Complex<T1>>

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

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

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

impl<T1, T2, R> SubsetOf<Similarity<T2, R, 3>> for Unit<Quaternion<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>, R: AbstractRotation<T2, 3> + SupersetOf<Unit<Quaternion<T1>>>,

fn to_superset(&self) -> Similarity<T2, R, 3>

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

fn is_in_subset(sim: &Similarity<T2, R, 3>) -> bool

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

fn from_superset_unchecked(sim: &Similarity<T2, R, 3>) -> Unit<Quaternion<T1>>

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

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

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

impl<T1, T2> SubsetOf<Similarity<T2, Unit<Quaternion<T2>>, 3>> for Unit<DualQuaternion<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>,

fn to_superset(&self) -> Similarity<T2, Unit<Quaternion<T2>>, 3>

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

fn is_in_subset(sim: &Similarity<T2, Unit<Quaternion<T2>>, 3>) -> bool

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

fn from_superset_unchecked( sim: &Similarity<T2, Unit<Quaternion<T2>>, 3>, ) -> Unit<DualQuaternion<T1>>

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

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

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

impl<T1, T2, C> SubsetOf<Transform<T2, C, 2>> for Unit<Complex<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>, C: SuperTCategoryOf<TAffine>,

fn to_superset(&self) -> Transform<T2, C, 2>

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

fn is_in_subset(t: &Transform<T2, C, 2>) -> bool

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

fn from_superset_unchecked(t: &Transform<T2, C, 2>) -> Unit<Complex<T1>>

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

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

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

impl<T1, T2, C> SubsetOf<Transform<T2, C, 3>> for Unit<DualQuaternion<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>, C: SuperTCategoryOf<TAffine>,

fn to_superset(&self) -> Transform<T2, C, 3>

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

fn is_in_subset(t: &Transform<T2, C, 3>) -> bool

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

fn from_superset_unchecked(t: &Transform<T2, C, 3>) -> Unit<DualQuaternion<T1>>

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

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

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

impl<T1, T2, C> SubsetOf<Transform<T2, C, 3>> for Unit<Quaternion<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>, C: SuperTCategoryOf<TAffine>,

fn to_superset(&self) -> Transform<T2, C, 3>

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

fn is_in_subset(t: &Transform<T2, C, 3>) -> bool

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

fn from_superset_unchecked(t: &Transform<T2, C, 3>) -> Unit<Quaternion<T1>>

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

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

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

impl<T1, T2> SubsetOf<Unit<Complex<T2>>> for Unit<Complex<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>,

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

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

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

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

fn from_superset_unchecked(uq: &Unit<Complex<T2>>) -> Unit<Complex<T1>>

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

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

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

impl<T1, T2> SubsetOf<Unit<DualQuaternion<T2>>> for Unit<DualQuaternion<T1>>

where T1: SimdRealField, T2: SimdRealField + SupersetOf<T1>,

fn to_superset(&self) -> Unit<DualQuaternion<T2>>

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

fn is_in_subset(dq: &Unit<DualQuaternion<T2>>) -> bool

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

fn from_superset_unchecked( dq: &Unit<DualQuaternion<T2>>, ) -> Unit<DualQuaternion<T1>>

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

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

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

impl<T1, T2> SubsetOf<Unit<DualQuaternion<T2>>> for Unit<Quaternion<T1>>

where T1: RealField, T2: RealField + SupersetOf<T1>,

fn to_superset(&self) -> Unit<DualQuaternion<T2>>

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

fn is_in_subset(dq: &Unit<DualQuaternion<T2>>) -> bool

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

fn from_superset_unchecked( dq: &Unit<DualQuaternion<T2>>, ) -> Unit<Quaternion<T1>>

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

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

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

impl<T1, T2> SubsetOf<Unit<Quaternion<T2>>> for Unit<Quaternion<T1>>

where T1: Scalar, T2: Scalar + SupersetOf<T1>,

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

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

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

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

fn from_superset_unchecked(uq: &Unit<Quaternion<T2>>) -> Unit<Quaternion<T1>>

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

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

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

impl<T> UlpsEq for Unit<Complex<T>>

where T: RealField,

fn default_max_ulps() -> u32

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

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

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

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

The inverse of [UlpsEq::ulps_eq].

impl<T> UlpsEq for Unit<DualQuaternion<T>>

where T: RealField<Epsilon = T> + UlpsEq,

fn default_max_ulps() -> u32

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

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

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

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

The inverse of [UlpsEq::ulps_eq].

impl<T, R, C, S> UlpsEq for Unit<Matrix<T, R, C, S>>

where R: Dim, C: Dim, T: Scalar + UlpsEq, S: RawStorage<T, R, C>, <T as AbsDiffEq>::Epsilon: Clone,

fn default_max_ulps() -> u32

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

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

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

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

The inverse of [UlpsEq::ulps_eq].

impl<T> UlpsEq for Unit<Quaternion<T>>

where T: RealField<Epsilon = T> + UlpsEq,

fn default_max_ulps() -> u32

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

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

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

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

The inverse of [UlpsEq::ulps_eq].

impl<T> Copy for Unit<T>

where T: Copy,

impl<T> Eq for Unit<Complex<T>>

where T: Scalar + Eq,

impl<T> Eq for Unit<DualQuaternion<T>>

where T: Scalar + ClosedNeg + Eq + SimdRealField,

impl<T, R, C, S> Eq for Unit<Matrix<T, R, C, S>>

where T: Scalar + Eq, R: Dim, C: Dim, S: RawStorage<T, R, C>,

impl<T> Eq for Unit<Quaternion<T>>

where T: Scalar + ClosedNeg + Eq,