Struct na::geometry::Rotation

#[repr(C)]
pub struct Rotation<T, const D: usize> { /* private fields */ }

A rotation matrix.

This is also known as an element of a Special Orthogonal (SO) group. The Rotation type can either represent a 2D or 3D rotation, represented as a matrix. For a rotation based on quaternions, see UnitQuaternion instead.

Note that instead of using the Rotation type in your code directly, you should use one of its aliases: Rotation2, or Rotation3. Though keep in mind that all the documentation of all the methods of these aliases will also appears on this page.

Construction

• Identity identity
• From a 2D rotation angle new…
• From an existing 2D matrix or rotations from_matrix, rotation_between, powf…
• From a 3D axis and/or angles new, from_euler_angles, from_axis_angle…
• From a 3D eye position and target point look_at, look_at_lh, rotation_between…
• From an existing 3D matrix or rotations from_matrix, rotation_between, powf…

Transformation and composition

Note that transforming vectors and points can be done by multiplication, e.g., rotation * point. Composing an rotation with another transformation can also be done by multiplication or division.

• 3D axis and angle extraction angle, euler_angles, scaled_axis, angle_to…
• 2D angle extraction angle, angle_to…
• Transformation of a vector or a point transform_vector, inverse_transform_point…
• Transposition and inversion transpose, inverse…
• Interpolation slerp…

Conversion

• Conversion to a matrix matrix, to_homogeneous…

Implementations

impl<T, const D: usize> Rotation<T, D>

pub const fn from_matrix_unchecked( matrix: Matrix<T, Const<D>, Const<D>, ArrayStorage<T, D, D>> ) -> Rotation<T, D>

Creates a new rotation from the given square matrix.

The matrix orthonormality is not checked.

Example

let mat = Matrix3::new(0.8660254, -0.5,      0.0,
                       0.5,       0.8660254, 0.0,
                       0.0,       0.0,       1.0);
let rot = Rotation3::from_matrix_unchecked(mat);

assert_eq!(*rot.matrix(), mat);


let mat = Matrix2::new(0.8660254, -0.5,
                       0.5,       0.8660254);
let rot = Rotation2::from_matrix_unchecked(mat);

assert_eq!(*rot.matrix(), mat);

impl<T, const D: usize> Rotation<T, D>where T: Scalar,

Conversion to a matrix

pub fn matrix(&self) -> &Matrix<T, Const<D>, Const<D>, ArrayStorage<T, D, D>>

A reference to the underlying matrix representation of this rotation.

Example

let rot = Rotation3::from_axis_angle(&Vector3::z_axis(), 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.matrix(), expected);


let rot = Rotation2::new(f32::consts::FRAC_PI_6);
let expected = Matrix2::new(0.8660254, -0.5,
                            0.5,       0.8660254);
assert_eq!(*rot.matrix(), expected);

pub unsafe fn matrix_mut( &mut self ) -> &mut Matrix<T, Const<D>, Const<D>, ArrayStorage<T, D, D>>

👎Deprecated: Use .matrix_mut_unchecked() instead.

A mutable reference to the underlying matrix representation of this rotation.

pub fn matrix_mut_unchecked( &mut self ) -> &mut Matrix<T, Const<D>, Const<D>, ArrayStorage<T, D, D>>

A mutable reference to the underlying matrix representation of this rotation.

This is suffixed by “_unchecked” because this allows the user to replace the matrix by another one that is non-inversible or non-orthonormal. If one of those properties is broken, subsequent method calls may return bogus results.

pub fn into_inner(self) -> Matrix<T, Const<D>, Const<D>, ArrayStorage<T, D, D>>

Unwraps the underlying matrix.

Example

let rot = Rotation3::from_axis_angle(&Vector3::z_axis(), f32::consts::FRAC_PI_6);
let mat = rot.into_inner();
let expected = Matrix3::new(0.8660254, -0.5,      0.0,
                            0.5,       0.8660254, 0.0,
                            0.0,       0.0,       1.0);
assert_eq!(mat, expected);


let rot = Rotation2::new(f32::consts::FRAC_PI_6);
let mat = rot.into_inner();
let expected = Matrix2::new(0.8660254, -0.5,
                            0.5,       0.8660254);
assert_eq!(mat, expected);

pub fn unwrap(self) -> Matrix<T, Const<D>, Const<D>, ArrayStorage<T, D, D>>

👎Deprecated: use .into_inner() instead

Unwraps the underlying matrix. Deprecated: Use Rotation::into_inner instead.

pub fn to_homogeneous( &self ) -> Matrix<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer>where T: Zero + One, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

Converts this rotation into its equivalent homogeneous transformation matrix.

This is the same as self.into().

Example

let rot = Rotation3::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_eq!(rot.to_homogeneous(), expected);


let rot = Rotation2::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, const D: usize> Rotation<T, D>where T: Scalar,

Transposition and inversion

pub fn transpose(&self) -> Rotation<T, D>

Transposes self.

Same as .inverse() because the inverse of a rotation matrix is its transform.

Example

let rot = Rotation3::new(Vector3::new(1.0, 2.0, 3.0));
let tr_rot = rot.transpose();
assert_relative_eq!(rot * tr_rot, Rotation3::identity(), epsilon = 1.0e-6);
assert_relative_eq!(tr_rot * rot, Rotation3::identity(), epsilon = 1.0e-6);

let rot = Rotation2::new(1.2);
let tr_rot = rot.transpose();
assert_relative_eq!(rot * tr_rot, Rotation2::identity(), epsilon = 1.0e-6);
assert_relative_eq!(tr_rot * rot, Rotation2::identity(), epsilon = 1.0e-6);

pub fn inverse(&self) -> Rotation<T, D>

Inverts self.

Same as .transpose() because the inverse of a rotation matrix is its transform.

Example

let rot = Rotation3::new(Vector3::new(1.0, 2.0, 3.0));
let inv = rot.inverse();
assert_relative_eq!(rot * inv, Rotation3::identity(), epsilon = 1.0e-6);
assert_relative_eq!(inv * rot, Rotation3::identity(), epsilon = 1.0e-6);

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

pub fn transpose_mut(&mut self)

Transposes self in-place.

Same as .inverse_mut() because the inverse of a rotation matrix is its transform.

Example

let rot = Rotation3::new(Vector3::new(1.0, 2.0, 3.0));
let mut tr_rot = Rotation3::new(Vector3::new(1.0, 2.0, 3.0));
tr_rot.transpose_mut();

assert_relative_eq!(rot * tr_rot, Rotation3::identity(), epsilon = 1.0e-6);
assert_relative_eq!(tr_rot * rot, Rotation3::identity(), epsilon = 1.0e-6);

let rot = Rotation2::new(1.2);
let mut tr_rot = Rotation2::new(1.2);
tr_rot.transpose_mut();

assert_relative_eq!(rot * tr_rot, Rotation2::identity(), epsilon = 1.0e-6);
assert_relative_eq!(tr_rot * rot, Rotation2::identity(), epsilon = 1.0e-6);

pub fn inverse_mut(&mut self)

Inverts self in-place.

Same as .transpose_mut() because the inverse of a rotation matrix is its transform.

Example

let rot = Rotation3::new(Vector3::new(1.0, 2.0, 3.0));
let mut inv = Rotation3::new(Vector3::new(1.0, 2.0, 3.0));
inv.inverse_mut();

assert_relative_eq!(rot * inv, Rotation3::identity(), epsilon = 1.0e-6);
assert_relative_eq!(inv * rot, Rotation3::identity(), epsilon = 1.0e-6);

let rot = Rotation2::new(1.2);
let mut inv = Rotation2::new(1.2);
inv.inverse_mut();

assert_relative_eq!(rot * inv, Rotation2::identity(), epsilon = 1.0e-6);
assert_relative_eq!(inv * rot, Rotation2::identity(), epsilon = 1.0e-6);

impl<T, const D: usize> Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Transformation of a vector or a point

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

Rotate the given point.

This is the same as the multiplication self * pt.

Example

let rot = Rotation3::new(Vector3::y() * 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<D>, Const<1>, ArrayStorage<T, D, 1>> ) -> Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>

Rotate the given vector.

This is the same as the multiplication self * v.

Example

let rot = Rotation3::new(Vector3::y() * 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<D>> ) -> OPoint<T, Const<D>>

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

Example

let rot = Rotation3::new(Vector3::y() * 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<D>, Const<1>, ArrayStorage<T, D, 1>> ) -> Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>

Rotate the given vector by the inverse of this rotation. This may be cheaper than inverting the rotation and then transforming the given vector.

Example

let rot = Rotation3::new(Vector3::y() * 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<D>, Const<1>, ArrayStorage<T, D, 1>>> ) -> Unit<Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>>

Rotate the given vector by the inverse of this rotation. This may be cheaper than inverting the rotation and then transforming the given vector.

Example

let rot = Rotation3::new(Vector3::z() * 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);

impl<T, const D: usize> Rotation<T, D>where T: Scalar + Zero + One,

Identity

pub fn identity() -> Rotation<T, D>

Creates a new square identity rotation of the given dimension.

Example

let rot1 = Rotation2::identity();
let rot2 = Rotation2::new(std::f32::consts::FRAC_PI_2);

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

let rot1 = Rotation3::identity();
let rot2 = Rotation3::from_axis_angle(&Vector3::z_axis(), std::f32::consts::FRAC_PI_2);

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

impl<T, const D: usize> Rotation<T, D>where T: Scalar,

pub fn cast<To>(self) -> Rotation<To, D>where To: Scalar, Rotation<To, D>: SupersetOf<Rotation<T, D>>,

Cast the components of self to another type.

Example

let rot = Rotation2::<f64>::identity();
let rot2 = rot.cast::<f32>();
assert_eq!(rot2, Rotation2::<f32>::identity());

impl<T> Rotation<T, 2>where T: SimdRealField,

Interpolation

pub fn slerp(&self, other: &Rotation<T, 2>, t: T) -> Rotation<T, 2>where <T as SimdValue>::Element: SimdRealField,

Spherical linear interpolation between two rotation matrices.

Examples:

let rot1 = Rotation2::new(std::f32::consts::FRAC_PI_4);
let rot2 = Rotation2::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> Rotation<T, 3>where T: SimdRealField,

pub fn slerp(&self, other: &Rotation<T, 3>, t: T) -> Rotation<T, 3>where T: RealField,

Spherical linear interpolation between two rotation matrices.

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

Examples:

let q1 = Rotation3::from_euler_angles(std::f32::consts::FRAC_PI_4, 0.0, 0.0);
let q2 = Rotation3::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: &Rotation<T, 3>, t: T, epsilon: T ) -> Option<Rotation<T, 3>>where T: RealField,

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

Arguments

• self: the first rotation to interpolate from.
• other: the second rotation 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 rotations must be to return None.

impl<T> Rotation<T, 2>where T: SimdRealField,

Construction from a 2D rotation angle

pub fn new(angle: T) -> Rotation<T, 2>

Builds a 2 dimensional rotation matrix from an angle in radian.

Example

let rot = Rotation2::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_scaled_axis<SB>( axisangle: Matrix<T, Const<1>, Const<1>, SB> ) -> Rotation<T, 2>where SB: Storage<T, Const<1>, Const<1>>,

Builds a 2 dimensional rotation matrix 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> Rotation<T, 2>where T: SimdRealField,

Construction from an existing 2D matrix or rotations

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

Builds a rotation from a basis assumed to be orthonormal.

In order to get a valid rotation matrix, 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>> ) -> Rotation<T, 2>where T: RealField,

Builds a rotation matrix 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: Rotation<T, 2> ) -> Rotation<T, 2>where T: RealField,

Builds a rotation matrix 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 Rotation2::identity() if no other guesses come to mind.

pub fn rotation_between<SB, SC>( a: &Matrix<T, Const<2>, Const<1>, SB>, b: &Matrix<T, Const<2>, Const<1>, SC> ) -> Rotation<T, 2>where T: RealField, SB: Storage<T, Const<2>, Const<1>>, SC: Storage<T, Const<2>, Const<1>>,

The rotation matrix required to align a and b but with its angle.

This is the rotation R such that (R * a).angle(b) == 0 && (R * a).dot(b).is_positive().

Example

let a = Vector2::new(1.0, 2.0);
let b = Vector2::new(2.0, 1.0);
let rot = Rotation2::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 ) -> Rotation<T, 2>where T: RealField, SB: Storage<T, Const<2>, Const<1>>, SC: Storage<T, Const<2>, Const<1>>,

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 = Rotation2::scaled_rotation_between(&a, &b, 0.2);
let rot5 = Rotation2::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_to(&self, other: &Rotation<T, 2>) -> Rotation<T, 2>

The rotation matrix needed to make self and other coincide.

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

Example

let rot1 = Rotation2::new(0.1);
let rot2 = Rotation2::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 renormalize(&mut self)where T: RealField,

Ensure this rotation is an orthonormal rotation matrix. This is useful when repeated computations might cause the matrix from progressively not being orthonormal anymore.

pub fn powf(&self, n: T) -> Rotation<T, 2>

Raise the rotation to a given floating power, i.e., returns the rotation with the angle of self multiplied by n.

Example

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

impl<T> Rotation<T, 2>where T: SimdRealField,

2D angle extraction

pub fn angle(&self) -> T

The rotation angle.

Example

let rot = Rotation2::new(1.78);
assert_relative_eq!(rot.angle(), 1.78);

pub fn angle_to(&self, other: &Rotation<T, 2>) -> T

The rotation angle needed to make self and other coincide.

Example

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

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.

impl<T> Rotation<T, 3>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Construction from a 3D axis and/or angles

pub fn new<SB>(axisangle: Matrix<T, Const<3>, Const<1>, SB>) -> Rotation<T, 3>where SB: Storage<T, Const<3>, Const<1>>,

Builds a 3 dimensional rotation matrix from an axis and an angle.

Arguments

• axisangle - A vector representing the rotation. Its magnitude is the amount of rotation in radian. Its direction is the axis of 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 rot = Rotation3::new(axisangle);

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

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

pub fn from_scaled_axis<SB>( axisangle: Matrix<T, Const<3>, Const<1>, SB> ) -> Rotation<T, 3>where SB: Storage<T, Const<3>, Const<1>>,

Builds a 3D rotation matrix from an axis scaled by the rotation angle.

This is the 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 rot = Rotation3::new(axisangle);

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

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

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

Builds a 3D rotation matrix from an axis and a 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 rot = Rotation3::from_axis_angle(&axis, angle);

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

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

pub fn from_euler_angles(roll: T, pitch: T, yaw: T) -> Rotation<T, 3>

Creates a new rotation from Euler angles.

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

Example

let rot = Rotation3::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);

impl<T> Rotation<T, 3>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Construction from a 3D eye position and target point

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

Creates a rotation 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, that is, direction the matrix z axis will be aligned with.
• up - The vertical direction. The only requirement of this parameter is to not be collinear to dir. Non-collinearity is not checked.

Example

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

let rot = Rotation3::face_towards(&dir, &up);
assert_relative_eq!(rot * 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> ) -> Rotation<T, 3>where SB: Storage<T, Const<3>, Const<1>>, SC: Storage<T, Const<3>, Const<1>>,

👎Deprecated: renamed to face_towards

Deprecated: Use Rotation3::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> ) -> Rotation<T, 3>where SB: Storage<T, Const<3>, Const<1>>, SC: Storage<T, Const<3>, Const<1>>,

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 direction toward which the camera looks.
• 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 rot = Rotation3::look_at_rh(&dir, &up);
assert_relative_eq!(rot * 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> ) -> Rotation<T, 3>where SB: Storage<T, Const<3>, Const<1>>, SC: Storage<T, Const<3>, Const<1>>,

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 direction toward which the camera looks.
• 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 rot = Rotation3::look_at_lh(&dir, &up);
assert_relative_eq!(rot * dir.normalize(), Vector3::z());

impl<T> Rotation<T, 3>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

Construction from an existing 3D matrix or rotations

pub fn rotation_between<SB, SC>( a: &Matrix<T, Const<3>, Const<1>, SB>, b: &Matrix<T, Const<3>, Const<1>, SC> ) -> Option<Rotation<T, 3>>where T: RealField, SB: Storage<T, Const<3>, Const<1>>, SC: Storage<T, Const<3>, Const<1>>,

The rotation matrix required to align a and b but with its angle.

This is the rotation R such that (R * a).angle(b) == 0 && (R * a).dot(b).is_positive().

Example

let a = Vector3::new(1.0, 2.0, 3.0);
let b = Vector3::new(3.0, 1.0, 2.0);
let rot = Rotation3::rotation_between(&a, &b).unwrap();
assert_relative_eq!(rot * a, b, epsilon = 1.0e-6);
assert_relative_eq!(rot.inverse() * b, a, epsilon = 1.0e-6);

pub fn scaled_rotation_between<SB, SC>( a: &Matrix<T, Const<3>, Const<1>, SB>, b: &Matrix<T, Const<3>, Const<1>, SC>, n: T ) -> Option<Rotation<T, 3>>where T: RealField, SB: Storage<T, Const<3>, Const<1>>, SC: Storage<T, Const<3>, Const<1>>,

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 rot2 = Rotation3::scaled_rotation_between(&a, &b, 0.2).unwrap();
let rot5 = Rotation3::scaled_rotation_between(&a, &b, 0.5).unwrap();
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_to(&self, other: &Rotation<T, 3>) -> Rotation<T, 3>

The rotation matrix needed to make self and other coincide.

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

Example

let rot1 = Rotation3::from_axis_angle(&Vector3::y_axis(), 1.0);
let rot2 = Rotation3::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 powf(&self, n: T) -> Rotation<T, 3>where T: RealField,

Raise the rotation to a given floating power, i.e., returns the rotation with the same axis as self and an angle equal to self.angle() multiplied by n.

Example

let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let angle = 1.2;
let rot = Rotation3::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 from_basis_unchecked( basis: &[Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>; 3] ) -> Rotation<T, 3>

Builds a rotation from a basis assumed to be orthonormal.

In order to get a valid rotation matrix, 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<3>, Const<3>, ArrayStorage<T, 3, 3>> ) -> Rotation<T, 3>where T: RealField,

Builds a rotation matrix 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: Rotation<T, 3> ) -> Rotation<T, 3>where T: RealField,

Builds a rotation matrix 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: a guess of the solution. Convergence will be significantly faster if an initial solution close to the actual solution is provided. Can be set to Rotation3::identity() if no other guesses come to mind.

pub fn renormalize(&mut self)where T: RealField,

Ensure this rotation is an orthonormal rotation matrix. This is useful when repeated computations might cause the matrix from progressively not being orthonormal anymore.

impl<T> Rotation<T, 3>where T: SimdRealField,

3D axis and angle extraction

pub fn angle(&self) -> T

The rotation angle in [0; pi].

Example

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

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

The rotation axis. Returns None if the rotation angle is zero or PI.

Example

let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let angle = 1.2;
let rot = Rotation3::from_axis_angle(&axis, angle);
assert_relative_eq!(rot.axis().unwrap(), axis);

// Case with a zero angle.
let rot = Rotation3::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 multiplied by the rotation angle.

Example

let axisangle = Vector3::new(0.1, 0.2, 0.3);
let rot = Rotation3::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 rotation matrix.

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 = Rotation3::from_axis_angle(&axis, angle);
let axis_angle = rot.axis_angle().unwrap();
assert_relative_eq!(axis_angle.0, axis);
assert_relative_eq!(axis_angle.1, angle);

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

pub fn angle_to(&self, other: &Rotation<T, 3>) -> Twhere <T as SimdValue>::Element: SimdRealField,

The rotation angle needed to make self and other coincide.

Example

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

pub fn to_euler_angles(self) -> (T, T, T)where T: RealField,

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

Creates Euler angles from a rotation.

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

pub fn euler_angles(&self) -> (T, T, T)where T: RealField,

Euler angles corresponding to this rotation from a rotation.

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

Example

let rot = Rotation3::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 euler_angles_ordered( &self, seq: [Unit<Matrix<T, Const<3>, Const<1>, ArrayStorage<T, 3, 1>>>; 3], extrinsic: bool ) -> ([T; 3], bool)where T: RealField + Copy,

Represent this rotation as Euler angles.

Returns the angles produced in the order provided by seq parameter, along with the observability flag. The Euler axes passed to seq must form an orthonormal basis. If the rotation is gimbal locked, then the observability flag is false.

Panics

Panics if the Euler axes in seq are not orthonormal.

Example 1:

use std::f64::consts::PI;
use approx::assert_relative_eq;
use nalgebra::{Matrix3, Rotation3, Unit, Vector3};

// 3-1-2
let n = [
    Unit::new_unchecked(Vector3::new(0.0, 0.0, 1.0)),
    Unit::new_unchecked(Vector3::new(1.0, 0.0, 0.0)),
    Unit::new_unchecked(Vector3::new(0.0, 1.0, 0.0)),
];

let r1 = Rotation3::from_axis_angle(&n[2], 20.0 * PI / 180.0);
let r2 = Rotation3::from_axis_angle(&n[1], 30.0 * PI / 180.0);
let r3 = Rotation3::from_axis_angle(&n[0], 45.0 * PI / 180.0);

let d = r3 * r2 * r1;

let (angles, observable) = d.euler_angles_ordered(n, false);
assert!(observable);
assert_relative_eq!(angles[0] * 180.0 / PI, 45.0, epsilon = 1e-12);
assert_relative_eq!(angles[1] * 180.0 / PI, 30.0, epsilon = 1e-12);
assert_relative_eq!(angles[2] * 180.0 / PI, 20.0, epsilon = 1e-12);

Example 2:

use std::f64::consts::PI;
use approx::assert_relative_eq;
use nalgebra::{Matrix3, Rotation3, Unit, Vector3};

let sqrt_2 = 2.0_f64.sqrt();
let n = [
    Unit::new_unchecked(Vector3::new(1.0 / sqrt_2, 1.0 / sqrt_2, 0.0)),
    Unit::new_unchecked(Vector3::new(1.0 / sqrt_2, -1.0 / sqrt_2, 0.0)),
    Unit::new_unchecked(Vector3::new(0.0, 0.0, 1.0)),
];

let r1 = Rotation3::from_axis_angle(&n[2], 20.0 * PI / 180.0);
let r2 = Rotation3::from_axis_angle(&n[1], 30.0 * PI / 180.0);
let r3 = Rotation3::from_axis_angle(&n[0], 45.0 * PI / 180.0);

let d = r3 * r2 * r1;

let (angles, observable) = d.euler_angles_ordered(n, false);
assert!(observable);
assert_relative_eq!(angles[0] * 180.0 / PI, 45.0, epsilon = 1e-12);
assert_relative_eq!(angles[1] * 180.0 / PI, 30.0, epsilon = 1e-12);
assert_relative_eq!(angles[2] * 180.0 / PI, 20.0, epsilon = 1e-12);

Algorithm based on: Malcolm D. Shuster, F. Landis Markley, “General formula for extraction the Euler angles”, Journal of guidance, control, and dynamics, vol. 29.1, pp. 215-221. 2006, and modified to be able to produce extrinsic rotations.

Trait Implementations

impl<T, const D: usize> AbsDiffEq<Rotation<T, D>> for Rotation<T, D>where T: Scalar + AbsDiffEq<T>, <T as AbsDiffEq<T>>::Epsilon: Clone,

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

Used for specifying relative comparisons.

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

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

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

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

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

The inverse of [AbsDiffEq::abs_diff_eq].

impl<T, const D: usize> AbstractRotation<T, D> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

fn identity() -> Rotation<T, D>

The rotation identity.

fn inverse(&self) -> Rotation<T, D>

The rotation inverse.

fn inverse_mut(&mut self)

Change self to its inverse.

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

Apply the rotation to the given vector.

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

Apply the rotation to the given point.

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

Apply the inverse rotation to the given vector.

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.

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

Apply the inverse rotation to the given point.

impl<T, const D: usize> Clone for Rotation<T, D>where T: Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T, const D: usize> Debug for Rotation<T, D>where T: Debug,

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

Formats the value using the given formatter.

impl<T, const D: usize> Default for Rotation<T, D>where T: Scalar + Zero + One,

fn default() -> Rotation<T, D>

Returns the “default value” for a type.

impl<T, const D: usize> Display for Rotation<T, D>where T: RealField + Display,

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

Formats the value using the given formatter.

impl<'a, 'b, T, const D: usize> Div<&'b Isometry<T, Rotation<T, D>, D>> for &'a Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T, const D: usize> Div<&'b Isometry<T, Rotation<T, D>, D>> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the / operator.

fn div( self, right: &'b Isometry<T, Rotation<T, D>, D> ) -> <Rotation<T, D> as Div<&'b Isometry<T, Rotation<T, D>, D>>>::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, const D: usize> Div<&'b Rotation<T, D>> for &'a Isometry<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T, const D: usize> Div<&'b Rotation<T, D>> for &'a Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

type Output = Rotation<T, D>

The resulting type after applying the / operator.

fn div( self, right: &'b Rotation<T, D> ) -> <&'a Rotation<T, D> as Div<&'b Rotation<T, D>>>::Output

Performs the / operation.

impl<'a, 'b, T, const D: usize> Div<&'b Rotation<T, D>> for &'a Similarity<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the / operator.

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

Performs the / operation.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T, const D: usize> Div<&'b Rotation<T, D>> for Isometry<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T, const D: usize> Div<&'b Rotation<T, D>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

type Output = Rotation<T, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T, const D: usize> Div<&'b Rotation<T, D>> for Similarity<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the / operator.

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

Performs the / operation.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T, R1, C1, SA, const D2: usize> Div<&'b Rotation<T, D2>> for &'a Matrix<T, R1, C1, SA>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R1: Dim, C1: Dim, SA: Storage<T, R1, C1>, DefaultAllocator: Allocator<T, R1, Const<D2>>, ShapeConstraint: AreMultipliable<R1, C1, Const<D2>, Const<D2>>,

type Output = Matrix<T, R1, Const<D2>, <DefaultAllocator as Allocator<T, R1, Const<D2>>>::Buffer>

The resulting type after applying the / operator.

fn div( self, right: &'b Rotation<T, D2> ) -> <&'a Matrix<T, R1, C1, SA> as Div<&'b Rotation<T, D2>>>::Output

Performs the / operation.

impl<'b, T, R1, C1, SA, const D2: usize> Div<&'b Rotation<T, D2>> for Matrix<T, R1, C1, SA>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R1: Dim, C1: Dim, SA: Storage<T, R1, C1>, DefaultAllocator: Allocator<T, R1, Const<D2>>, ShapeConstraint: AreMultipliable<R1, C1, Const<D2>, Const<D2>>,

type Output = Matrix<T, R1, Const<D2>, <DefaultAllocator as Allocator<T, R1, Const<D2>>>::Buffer>

The resulting type after applying the / operator.

fn div( self, right: &'b Rotation<T, D2> ) -> <Matrix<T, R1, C1, SA> as Div<&'b Rotation<T, D2>>>::Output

Performs the / operation.

impl<'a, 'b, T, const D: usize> Div<&'b Similarity<T, Rotation<T, D>, D>> for &'a Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, T, const D: usize> Div<&'b Similarity<T, Rotation<T, D>, D>> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the / operator.

fn div( self, right: &'b Similarity<T, Rotation<T, D>, D> ) -> <Rotation<T, D> as Div<&'b Similarity<T, Rotation<T, D>, D>>>::Output

Performs the / operation.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, T> Div<&'b Unit<Complex<T>>> for &'a Rotation<T, 2>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 Rotation<T, 2> as Div<&'b Unit<Complex<T>>>>::Output

Performs the / operation.

impl<'b, T> Div<&'b Unit<Complex<T>>> for Rotation<T, 2>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>> ) -> <Rotation<T, 2> as Div<&'b Unit<Complex<T>>>>::Output

Performs the / operation.

impl<'a, 'b, T> Div<&'b Unit<Quaternion<T>>> for &'a Rotation<T, 3>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 Rotation<T, 3> as Div<&'b Unit<Quaternion<T>>>>::Output

Performs the / operation.

impl<'b, T> Div<&'b Unit<Quaternion<T>>> for Rotation<T, 3>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>> ) -> <Rotation<T, 3> as Div<&'b Unit<Quaternion<T>>>>::Output

Performs the / operation.

impl<'a, T, const D: usize> Div<Isometry<T, Rotation<T, D>, D>> for &'a Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the / operator.

fn div( self, right: Isometry<T, Rotation<T, D>, D> ) -> <&'a Rotation<T, D> as Div<Isometry<T, Rotation<T, D>, D>>>::Output

Performs the / operation.

impl<T, const D: usize> Div<Isometry<T, Rotation<T, D>, D>> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the / operator.

fn div( self, right: Isometry<T, Rotation<T, D>, D> ) -> <Rotation<T, D> as Div<Isometry<T, Rotation<T, D>, D>>>::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, const D: usize> Div<Rotation<T, D>> for &'a Isometry<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the / operator.

fn div( self, rhs: Rotation<T, D> ) -> <&'a Isometry<T, Rotation<T, D>, D> as Div<Rotation<T, D>>>::Output

Performs the / operation.

impl<'a, T, const D: usize> Div<Rotation<T, D>> for &'a Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

type Output = Rotation<T, D>

The resulting type after applying the / operator.

fn div( self, right: Rotation<T, D> ) -> <&'a Rotation<T, D> as Div<Rotation<T, D>>>::Output

Performs the / operation.

impl<'a, T, const D: usize> Div<Rotation<T, D>> for &'a Similarity<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the / operator.

fn div( self, rhs: Rotation<T, D> ) -> <&'a Similarity<T, Rotation<T, D>, D> as Div<Rotation<T, D>>>::Output

Performs the / operation.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T, const D: usize> Div<Rotation<T, D>> for Isometry<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T, const D: usize> Div<Rotation<T, D>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

type Output = Rotation<T, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T, const D: usize> Div<Rotation<T, D>> for Similarity<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the / operator.

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

Performs the / operation.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T, R1, C1, SA, const D2: usize> Div<Rotation<T, D2>> for &'a Matrix<T, R1, C1, SA>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R1: Dim, C1: Dim, SA: Storage<T, R1, C1>, DefaultAllocator: Allocator<T, R1, Const<D2>>, ShapeConstraint: AreMultipliable<R1, C1, Const<D2>, Const<D2>>,

type Output = Matrix<T, R1, Const<D2>, <DefaultAllocator as Allocator<T, R1, Const<D2>>>::Buffer>

The resulting type after applying the / operator.

fn div( self, right: Rotation<T, D2> ) -> <&'a Matrix<T, R1, C1, SA> as Div<Rotation<T, D2>>>::Output

Performs the / operation.

impl<T, R1, C1, SA, const D2: usize> Div<Rotation<T, D2>> for Matrix<T, R1, C1, SA>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R1: Dim, C1: Dim, SA: Storage<T, R1, C1>, DefaultAllocator: Allocator<T, R1, Const<D2>>, ShapeConstraint: AreMultipliable<R1, C1, Const<D2>, Const<D2>>,

type Output = Matrix<T, R1, Const<D2>, <DefaultAllocator as Allocator<T, R1, Const<D2>>>::Buffer>

The resulting type after applying the / operator.

fn div( self, right: Rotation<T, D2> ) -> <Matrix<T, R1, C1, SA> as Div<Rotation<T, D2>>>::Output

Performs the / operation.

impl<'a, T, const D: usize> Div<Similarity<T, Rotation<T, D>, D>> for &'a Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the / operator.

fn div( self, right: Similarity<T, Rotation<T, D>, D> ) -> <&'a Rotation<T, D> as Div<Similarity<T, Rotation<T, D>, D>>>::Output

Performs the / operation.

impl<T, const D: usize> Div<Similarity<T, Rotation<T, D>, D>> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the / operator.

fn div( self, right: Similarity<T, Rotation<T, D>, D> ) -> <Rotation<T, D> as Div<Similarity<T, Rotation<T, D>, D>>>::Output

Performs the / operation.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

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

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, T> Div<Unit<Complex<T>>> for &'a Rotation<T, 2>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 Rotation<T, 2> as Div<Unit<Complex<T>>>>::Output

Performs the / operation.

impl<T> Div<Unit<Complex<T>>> for Rotation<T, 2>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>> ) -> <Rotation<T, 2> as Div<Unit<Complex<T>>>>::Output

Performs the / operation.

impl<'a, T> Div<Unit<Quaternion<T>>> for &'a Rotation<T, 3>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 Rotation<T, 3> as Div<Unit<Quaternion<T>>>>::Output

Performs the / operation.

impl<T> Div<Unit<Quaternion<T>>> for Rotation<T, 3>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>> ) -> <Rotation<T, 3> as Div<Unit<Quaternion<T>>>>::Output

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, const R1: usize, const C1: usize> DivAssign<&'b Rotation<T, C1>> for Matrix<T, Const<R1>, Const<C1>, ArrayStorage<T, R1, C1>>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

fn div_assign(&mut self, right: &'b Rotation<T, C1>)

Performs the /= operation.

impl<'b, T, const D: usize> DivAssign<&'b Rotation<T, D>> for Isometry<T, Rotation<T, D>, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<'b, T, const D: usize> DivAssign<&'b Rotation<T, D>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

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

Performs the /= operation.

impl<'b, T, const D: usize> DivAssign<&'b Rotation<T, D>> for Similarity<T, Rotation<T, D>, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

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

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

Performs the /= operation.

impl<'b, T> DivAssign<&'b Unit<Complex<T>>> for Rotation<T, 2>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

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, const R1: usize, const C1: usize> DivAssign<Rotation<T, C1>> for Matrix<T, Const<R1>, Const<C1>, ArrayStorage<T, R1, C1>>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

fn div_assign(&mut self, right: Rotation<T, C1>)

Performs the /= operation.

impl<T, const D: usize> DivAssign<Rotation<T, D>> for Isometry<T, Rotation<T, D>, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T, const D: usize> DivAssign<Rotation<T, D>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

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

Performs the /= operation.

impl<T, const D: usize> DivAssign<Rotation<T, D>> for Similarity<T, Rotation<T, D>, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

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

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

Performs the /= operation.

impl<T> DivAssign<Unit<Complex<T>>> for Rotation<T, 2>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the /= operation.

impl<T, const D: usize> From<[Rotation<<T as SimdValue>::Element, D>; 16]> for Rotation<T, D>where T: Scalar + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 16]>, <T as SimdValue>::Element: Scalar + Copy,

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

Converts to this type from the input type.

impl<T, const D: usize> From<[Rotation<<T as SimdValue>::Element, D>; 2]> for Rotation<T, D>where T: Scalar + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 2]>, <T as SimdValue>::Element: Scalar + Copy,

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

Converts to this type from the input type.

impl<T, const D: usize> From<[Rotation<<T as SimdValue>::Element, D>; 4]> for Rotation<T, D>where T: Scalar + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 4]>, <T as SimdValue>::Element: Scalar + Copy,

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

Converts to this type from the input type.

impl<T, const D: usize> From<[Rotation<<T as SimdValue>::Element, D>; 8]> for Rotation<T, D>where T: Scalar + PrimitiveSimdValue + From<[<T as SimdValue>::Element; 8]>, <T as SimdValue>::Element: Scalar + Copy,

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

Converts to this type from the input type.

impl<T> From<Rotation<T, 2>> for Matrix<T, Const<2>, Const<2>, ArrayStorage<T, 2, 2>>where T: RealField,

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

Converts to this type from the input type.

impl<T> From<Rotation<T, 2>> for Matrix<T, Const<3>, Const<3>, ArrayStorage<T, 3, 3>>where T: RealField,

fn from( q: Rotation<T, 2> ) -> Matrix<T, Const<3>, Const<3>, ArrayStorage<T, 3, 3>>

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 Matrix<T, Const<3>, Const<3>, ArrayStorage<T, 3, 3>>where T: RealField,

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

Converts to this type from the input type.

impl<T> From<Rotation<T, 3>> for Matrix<T, Const<4>, Const<4>, ArrayStorage<T, 4, 4>>where T: RealField,

fn from( q: Rotation<T, 3> ) -> Matrix<T, Const<4>, Const<4>, ArrayStorage<T, 4, 4>>

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 Rotation<T, 2>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Converts to this type from the input type.

impl<T> From<Unit<Quaternion<T>>> for Rotation<T, 3>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Converts to this type from the input type.

impl<T, const D: usize> Hash for Rotation<T, D>where T: Scalar + Hash, <DefaultAllocator as Allocator<T, Const<D>, Const<D>>>::Buffer: Hash,

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<T, const D: usize> Index<(usize, usize)> for Rotation<T, D>where T: Scalar,

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<'a, 'b, T, const D: usize> Mul<&'b Isometry<T, Rotation<T, D>, D>> for &'a Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Isometry<T, Rotation<T, D>, D>> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: &'b Isometry<T, Rotation<T, D>, D> ) -> <Rotation<T, D> as Mul<&'b Isometry<T, Rotation<T, D>, D>>>::Output

Performs the * operation.

impl<'a, 'b, T, R2, C2, SB, const D1: usize> Mul<&'b Matrix<T, R2, C2, SB>> for &'a Rotation<T, D1>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R2: Dim, C2: Dim, SB: Storage<T, R2, C2>, DefaultAllocator: Allocator<T, Const<D1>, C2>, ShapeConstraint: AreMultipliable<Const<D1>, Const<D1>, R2, C2>,

type Output = Matrix<T, Const<D1>, C2, <DefaultAllocator as Allocator<T, Const<D1>, C2>>::Buffer>

The resulting type after applying the * operator.

fn mul( self, right: &'b Matrix<T, R2, C2, SB> ) -> <&'a Rotation<T, D1> as Mul<&'b Matrix<T, R2, C2, SB>>>::Output

Performs the * operation.

impl<'b, T, R2, C2, SB, const D1: usize> Mul<&'b Matrix<T, R2, C2, SB>> for Rotation<T, D1>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R2: Dim, C2: Dim, SB: Storage<T, R2, C2>, DefaultAllocator: Allocator<T, Const<D1>, C2>, ShapeConstraint: AreMultipliable<Const<D1>, Const<D1>, R2, C2>,

type Output = Matrix<T, Const<D1>, C2, <DefaultAllocator as Allocator<T, Const<D1>, C2>>::Buffer>

The resulting type after applying the * operator.

fn mul( self, right: &'b Matrix<T, R2, C2, SB> ) -> <Rotation<T, D1> as Mul<&'b Matrix<T, R2, C2, SB>>>::Output

Performs the * operation.

impl<'a, 'b, T, const D: usize> Mul<&'b OPoint<T, Const<D>>> for &'a Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, Const<1>>,

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

The resulting type after applying the * operator.

fn mul( self, right: &'b OPoint<T, Const<D>> ) -> <&'a Rotation<T, D> as Mul<&'b OPoint<T, Const<D>>>>::Output

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b OPoint<T, Const<D>>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, Const<1>>,

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

The resulting type after applying the * operator.

fn mul( self, right: &'b OPoint<T, Const<D>> ) -> <Rotation<T, D> as Mul<&'b OPoint<T, Const<D>>>>::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, const D: usize> Mul<&'b Rotation<T, D>> for &'a Isometry<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T, const D: usize> Mul<&'b Rotation<T, D>> for &'a Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

type Output = Rotation<T, D>

The resulting type after applying the * operator.

fn mul( self, right: &'b Rotation<T, D> ) -> <&'a Rotation<T, D> as Mul<&'b Rotation<T, D>>>::Output

Performs the * operation.

impl<'a, 'b, T, const D: usize> Mul<&'b Rotation<T, D>> for &'a Similarity<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T, const D: usize> Mul<&'b Rotation<T, D>> for &'a Translation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: &'b Rotation<T, D> ) -> <&'a Translation<T, D> as Mul<&'b Rotation<T, D>>>::Output

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Rotation<T, D>> for Isometry<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Rotation<T, D>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

type Output = Rotation<T, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Rotation<T, D>> for Similarity<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Rotation<T, D>> for Translation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: &'b Rotation<T, D> ) -> <Translation<T, D> as Mul<&'b Rotation<T, D>>>::Output

Performs the * operation.

impl<'a, 'b, T, R1, C1, SA, const D2: usize> Mul<&'b Rotation<T, D2>> for &'a Matrix<T, R1, C1, SA>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R1: Dim, C1: Dim, SA: Storage<T, R1, C1>, DefaultAllocator: Allocator<T, R1, Const<D2>>, ShapeConstraint: AreMultipliable<R1, C1, Const<D2>, Const<D2>>,

type Output = Matrix<T, R1, Const<D2>, <DefaultAllocator as Allocator<T, R1, Const<D2>>>::Buffer>

The resulting type after applying the * operator.

fn mul( self, right: &'b Rotation<T, D2> ) -> <&'a Matrix<T, R1, C1, SA> as Mul<&'b Rotation<T, D2>>>::Output

Performs the * operation.

impl<'b, T, R1, C1, SA, const D2: usize> Mul<&'b Rotation<T, D2>> for Matrix<T, R1, C1, SA>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R1: Dim, C1: Dim, SA: Storage<T, R1, C1>, DefaultAllocator: Allocator<T, R1, Const<D2>>, ShapeConstraint: AreMultipliable<R1, C1, Const<D2>, Const<D2>>,

type Output = Matrix<T, R1, Const<D2>, <DefaultAllocator as Allocator<T, R1, Const<D2>>>::Buffer>

The resulting type after applying the * operator.

fn mul( self, right: &'b Rotation<T, D2> ) -> <Matrix<T, R1, C1, SA> as Mul<&'b Rotation<T, D2>>>::Output

Performs the * operation.

impl<'a, 'b, T, const D: usize> Mul<&'b Similarity<T, Rotation<T, D>, D>> for &'a Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, right: &'b Similarity<T, Rotation<T, D>, D> ) -> <&'a Rotation<T, D> as Mul<&'b Similarity<T, Rotation<T, D>, D>>>::Output

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Similarity<T, Rotation<T, D>, D>> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, right: &'b Similarity<T, Rotation<T, D>, D> ) -> <Rotation<T, D> as Mul<&'b Similarity<T, Rotation<T, D>, D>>>::Output

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T, const D: usize> Mul<&'b Translation<T, D>> for &'a Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: &'b Translation<T, D> ) -> <&'a Rotation<T, D> as Mul<&'b Translation<T, D>>>::Output

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Translation<T, D>> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: &'b Translation<T, D> ) -> <Rotation<T, D> as Mul<&'b Translation<T, D>>>::Output

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Unit<Complex<T>>> for &'a Rotation<T, 2>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 Rotation<T, 2> as Mul<&'b Unit<Complex<T>>>>::Output

Performs the * operation.

impl<'b, T> Mul<&'b Unit<Complex<T>>> for Rotation<T, 2>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>> ) -> <Rotation<T, 2> as Mul<&'b Unit<Complex<T>>>>::Output

Performs the * operation.

impl<'a, 'b, T, S, const D: usize> Mul<&'b Unit<Matrix<T, Const<D>, Const<1>, S>>> for &'a Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, S: Storage<T, Const<D>, Const<1>>, ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, Const<1>>,

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

The resulting type after applying the * operator.

fn mul( self, right: &'b Unit<Matrix<T, Const<D>, Const<1>, S>> ) -> <&'a Rotation<T, D> as Mul<&'b Unit<Matrix<T, Const<D>, Const<1>, S>>>>::Output

Performs the * operation.

impl<'b, T, S, const D: usize> Mul<&'b Unit<Matrix<T, Const<D>, Const<1>, S>>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, S: Storage<T, Const<D>, Const<1>>, ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, Const<1>>,

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

The resulting type after applying the * operator.

fn mul( self, right: &'b Unit<Matrix<T, Const<D>, Const<1>, S>> ) -> <Rotation<T, D> as Mul<&'b Unit<Matrix<T, Const<D>, Const<1>, S>>>>::Output

Performs the * operation.

impl<'a, 'b, T> Mul<&'b Unit<Quaternion<T>>> for &'a Rotation<T, 3>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 Rotation<T, 3> as Mul<&'b Unit<Quaternion<T>>>>::Output

Performs the * operation.

impl<'b, T> Mul<&'b Unit<Quaternion<T>>> for Rotation<T, 3>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>> ) -> <Rotation<T, 3> as Mul<&'b Unit<Quaternion<T>>>>::Output

Performs the * operation.

impl<'a, T, const D: usize> Mul<Isometry<T, Rotation<T, D>, D>> for &'a Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: Isometry<T, Rotation<T, D>, D> ) -> <&'a Rotation<T, D> as Mul<Isometry<T, Rotation<T, D>, D>>>::Output

Performs the * operation.

impl<T, const D: usize> Mul<Isometry<T, Rotation<T, D>, D>> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: Isometry<T, Rotation<T, D>, D> ) -> <Rotation<T, D> as Mul<Isometry<T, Rotation<T, D>, D>>>::Output

Performs the * operation.

impl<'a, T, R2, C2, SB, const D1: usize> Mul<Matrix<T, R2, C2, SB>> for &'a Rotation<T, D1>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R2: Dim, C2: Dim, SB: Storage<T, R2, C2>, DefaultAllocator: Allocator<T, Const<D1>, C2>, ShapeConstraint: AreMultipliable<Const<D1>, Const<D1>, R2, C2>,

type Output = Matrix<T, Const<D1>, C2, <DefaultAllocator as Allocator<T, Const<D1>, C2>>::Buffer>

The resulting type after applying the * operator.

fn mul( self, right: Matrix<T, R2, C2, SB> ) -> <&'a Rotation<T, D1> as Mul<Matrix<T, R2, C2, SB>>>::Output

Performs the * operation.

impl<T, R2, C2, SB, const D1: usize> Mul<Matrix<T, R2, C2, SB>> for Rotation<T, D1>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R2: Dim, C2: Dim, SB: Storage<T, R2, C2>, DefaultAllocator: Allocator<T, Const<D1>, C2>, ShapeConstraint: AreMultipliable<Const<D1>, Const<D1>, R2, C2>,

type Output = Matrix<T, Const<D1>, C2, <DefaultAllocator as Allocator<T, Const<D1>, C2>>::Buffer>

The resulting type after applying the * operator.

fn mul( self, right: Matrix<T, R2, C2, SB> ) -> <Rotation<T, D1> as Mul<Matrix<T, R2, C2, SB>>>::Output

Performs the * operation.

impl<'a, T, const D: usize> Mul<OPoint<T, Const<D>>> for &'a Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, Const<1>>,

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

The resulting type after applying the * operator.

fn mul( self, right: OPoint<T, Const<D>> ) -> <&'a Rotation<T, D> as Mul<OPoint<T, Const<D>>>>::Output

Performs the * operation.

impl<T, const D: usize> Mul<OPoint<T, Const<D>>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, Const<1>>,

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

The resulting type after applying the * operator.

fn mul( self, right: OPoint<T, Const<D>> ) -> <Rotation<T, D> as Mul<OPoint<T, Const<D>>>>::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, const D: usize> Mul<Rotation<T, D>> for &'a Isometry<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, rhs: Rotation<T, D> ) -> <&'a Isometry<T, Rotation<T, D>, D> as Mul<Rotation<T, D>>>::Output

Performs the * operation.

impl<'a, T, const D: usize> Mul<Rotation<T, D>> for &'a Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

type Output = Rotation<T, D>

The resulting type after applying the * operator.

fn mul( self, right: Rotation<T, D> ) -> <&'a Rotation<T, D> as Mul<Rotation<T, D>>>::Output

Performs the * operation.

impl<'a, T, const D: usize> Mul<Rotation<T, D>> for &'a Similarity<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, rhs: Rotation<T, D> ) -> <&'a Similarity<T, Rotation<T, D>, D> as Mul<Rotation<T, D>>>::Output

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T, const D: usize> Mul<Rotation<T, D>> for &'a Translation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: Rotation<T, D> ) -> <&'a Translation<T, D> as Mul<Rotation<T, D>>>::Output

Performs the * operation.

impl<T, const D: usize> Mul<Rotation<T, D>> for Isometry<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, const D: usize> Mul<Rotation<T, D>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

type Output = Rotation<T, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, const D: usize> Mul<Rotation<T, D>> for Similarity<T, Rotation<T, D>, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, const D: usize> Mul<Rotation<T, D>> for Translation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: Rotation<T, D> ) -> <Translation<T, D> as Mul<Rotation<T, D>>>::Output

Performs the * operation.

impl<'a, T, R1, C1, SA, const D2: usize> Mul<Rotation<T, D2>> for &'a Matrix<T, R1, C1, SA>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R1: Dim, C1: Dim, SA: Storage<T, R1, C1>, DefaultAllocator: Allocator<T, R1, Const<D2>>, ShapeConstraint: AreMultipliable<R1, C1, Const<D2>, Const<D2>>,

type Output = Matrix<T, R1, Const<D2>, <DefaultAllocator as Allocator<T, R1, Const<D2>>>::Buffer>

The resulting type after applying the * operator.

fn mul( self, right: Rotation<T, D2> ) -> <&'a Matrix<T, R1, C1, SA> as Mul<Rotation<T, D2>>>::Output

Performs the * operation.

impl<T, R1, C1, SA, const D2: usize> Mul<Rotation<T, D2>> for Matrix<T, R1, C1, SA>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, R1: Dim, C1: Dim, SA: Storage<T, R1, C1>, DefaultAllocator: Allocator<T, R1, Const<D2>>, ShapeConstraint: AreMultipliable<R1, C1, Const<D2>, Const<D2>>,

type Output = Matrix<T, R1, Const<D2>, <DefaultAllocator as Allocator<T, R1, Const<D2>>>::Buffer>

The resulting type after applying the * operator.

fn mul( self, right: Rotation<T, D2> ) -> <Matrix<T, R1, C1, SA> as Mul<Rotation<T, D2>>>::Output

Performs the * operation.

impl<'a, T, const D: usize> Mul<Similarity<T, Rotation<T, D>, D>> for &'a Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, right: Similarity<T, Rotation<T, D>, D> ) -> <&'a Rotation<T, D> as Mul<Similarity<T, Rotation<T, D>, D>>>::Output

Performs the * operation.

impl<T, const D: usize> Mul<Similarity<T, Rotation<T, D>, D>> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

The resulting type after applying the * operator.

fn mul( self, right: Similarity<T, Rotation<T, D>, D> ) -> <Rotation<T, D> as Mul<Similarity<T, Rotation<T, D>, D>>>::Output

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T, const D: usize> Mul<Translation<T, D>> for &'a Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: Translation<T, D> ) -> <&'a Rotation<T, D> as Mul<Translation<T, D>>>::Output

Performs the * operation.

impl<T, const D: usize> Mul<Translation<T, D>> for Rotation<T, D>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

type Output = Isometry<T, Rotation<T, D>, D>

The resulting type after applying the * operator.

fn mul( self, right: Translation<T, D> ) -> <Rotation<T, D> as Mul<Translation<T, D>>>::Output

Performs the * operation.

impl<'a, T> Mul<Unit<Complex<T>>> for &'a Rotation<T, 2>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 Rotation<T, 2> as Mul<Unit<Complex<T>>>>::Output

Performs the * operation.

impl<T> Mul<Unit<Complex<T>>> for Rotation<T, 2>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>> ) -> <Rotation<T, 2> as Mul<Unit<Complex<T>>>>::Output

Performs the * operation.

impl<'a, T, S, const D: usize> Mul<Unit<Matrix<T, Const<D>, Const<1>, S>>> for &'a Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, S: Storage<T, Const<D>, Const<1>>, ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, Const<1>>,

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

The resulting type after applying the * operator.

fn mul( self, right: Unit<Matrix<T, Const<D>, Const<1>, S>> ) -> <&'a Rotation<T, D> as Mul<Unit<Matrix<T, Const<D>, Const<1>, S>>>>::Output

Performs the * operation.

impl<T, S, const D: usize> Mul<Unit<Matrix<T, Const<D>, Const<1>, S>>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>, S: Storage<T, Const<D>, Const<1>>, ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, Const<1>>,

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

The resulting type after applying the * operator.

fn mul( self, right: Unit<Matrix<T, Const<D>, Const<1>, S>> ) -> <Rotation<T, D> as Mul<Unit<Matrix<T, Const<D>, Const<1>, S>>>>::Output

Performs the * operation.

impl<'a, T> Mul<Unit<Quaternion<T>>> for &'a Rotation<T, 3>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 Rotation<T, 3> as Mul<Unit<Quaternion<T>>>>::Output

Performs the * operation.

impl<T> Mul<Unit<Quaternion<T>>> for Rotation<T, 3>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>> ) -> <Rotation<T, 3> as Mul<Unit<Quaternion<T>>>>::Output

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, const R1: usize, const C1: usize> MulAssign<&'b Rotation<T, C1>> for Matrix<T, Const<R1>, Const<C1>, ArrayStorage<T, R1, C1>>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

fn mul_assign(&mut self, right: &'b Rotation<T, C1>)

Performs the *= operation.

impl<'b, T, const D: usize> MulAssign<&'b Rotation<T, D>> for Isometry<T, Rotation<T, D>, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<'b, T, const D: usize> MulAssign<&'b Rotation<T, D>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

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

Performs the *= operation.

impl<'b, T, const D: usize> MulAssign<&'b Rotation<T, D>> for Similarity<T, Rotation<T, D>, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

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

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

Performs the *= operation.

impl<'b, T> MulAssign<&'b Unit<Complex<T>>> for Rotation<T, 2>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

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, const R1: usize, const C1: usize> MulAssign<Rotation<T, C1>> for Matrix<T, Const<R1>, Const<C1>, ArrayStorage<T, R1, C1>>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

fn mul_assign(&mut self, right: Rotation<T, C1>)

Performs the *= operation.

impl<T, const D: usize> MulAssign<Rotation<T, D>> for Isometry<T, Rotation<T, D>, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<T, const D: usize> MulAssign<Rotation<T, D>> for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

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

Performs the *= operation.

impl<T, const D: usize> MulAssign<Rotation<T, D>> for Similarity<T, Rotation<T, D>, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T> + SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

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

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

Performs the *= operation.

impl<T> MulAssign<Unit<Complex<T>>> for Rotation<T, 2>where T: SimdRealField, <T as SimdValue>::Element: SimdRealField,

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

Performs the *= operation.

impl<T, const D: usize> One for Rotation<T, D>where T: Scalar + Zero + One + ClosedAdd<T> + ClosedMul<T>,

fn one() -> Rotation<T, D>

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) -> boolwhere Self: PartialEq<Self>,

Returns true if self is equal to the multiplicative identity.

impl<T, const D: usize> PartialEq<Rotation<T, D>> for Rotation<T, D>where T: Scalar + PartialEq<T>,

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

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

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

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

impl<T, const D: usize> RelativeEq<Rotation<T, D>> for Rotation<T, D>where T: Scalar + RelativeEq<T>, <T as AbsDiffEq<T>>::Epsilon: Clone,

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

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

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

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

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

The inverse of [RelativeEq::relative_eq].

impl<T, const D: usize> SimdValue for Rotation<T, D>where T: Scalar + SimdValue, <T as SimdValue>::Element: Scalar,

type Element = Rotation<<T as SimdValue>::Element, D>

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

type SimdBool = <T as SimdValue>::SimdBool

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

fn lanes() -> usize

The number of lanes of this SIMD value.

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

Initializes an SIMD value with each lanes set to val.

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

Extracts the i-th lane of self.

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

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

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

Replaces the i-th lane of self by val.

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

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

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

Merges self and other depending on the lanes of cond.

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

Applies a function to each lane of self.

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

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

impl<T1, T2, R, const D: usize> SubsetOf<Isometry<T2, R, D>> for Rotation<T1, D>where T1: RealField, T2: RealField + SupersetOf<T1>, R: AbstractRotation<T2, D> + SupersetOf<Rotation<T1, D>>,

fn to_superset(&self) -> Isometry<T2, R, D>

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

fn is_in_subset(iso: &Isometry<T2, R, D>) -> 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, D>) -> Rotation<T1, D>

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

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

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

impl<T1, T2, const D: usize> SubsetOf<Matrix<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer>> for Rotation<T1, D>where T1: RealField, T2: RealField + SupersetOf<T1>, Const<D>: DimNameAdd<Const<1>> + DimMin<Const<D>, Output = Const<D>>, DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

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

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

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

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

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

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

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

impl<T1, T2> 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, const D: usize> SubsetOf<Rotation<T2, D>> for Rotation<T1, D>where T1: RealField, T2: RealField + SupersetOf<T1>,

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

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

fn is_in_subset(rot: &Rotation<T2, D>) -> bool

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

fn from_superset_unchecked(rot: &Rotation<T2, D>) -> Rotation<T1, D>

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

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

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

impl<T1, T2, R, const D: usize> SubsetOf<Similarity<T2, R, D>> for Rotation<T1, D>where T1: RealField, T2: RealField + SupersetOf<T1>, R: AbstractRotation<T2, D> + SupersetOf<Rotation<T1, D>>,

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

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

fn is_in_subset(sim: &Similarity<T2, R, D>) -> 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, D>) -> Rotation<T1, D>

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

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

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

impl<T1, T2, C, const D: usize> SubsetOf<Transform<T2, C, D>> for Rotation<T1, D>where T1: RealField, T2: RealField + SupersetOf<T1>, C: SuperTCategoryOf<TAffine>, Const<D>: DimNameAdd<Const<1>> + DimMin<Const<D>, Output = Const<D>>, DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

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

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

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

fn from_superset_unchecked(t: &Transform<T2, C, D>) -> Rotation<T1, D>

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

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

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

impl<T1, T2> SubsetOf<Unit<Complex<T2>>> for Rotation<T1, 2>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(q: &Unit<Complex<T2>>) -> bool

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

fn from_superset_unchecked(q: &Unit<Complex<T2>>) -> Rotation<T1, 2>

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 Rotation<T1, 3>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>>) -> Rotation<T1, 3>

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 Rotation<T1, 3>where T1: RealField, T2: RealField + 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(q: &Unit<Quaternion<T2>>) -> bool

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

fn from_superset_unchecked(q: &Unit<Quaternion<T2>>) -> Rotation<T1, 3>

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, const D: usize> UlpsEq<Rotation<T, D>> for Rotation<T, D>where T: Scalar + UlpsEq<T>, <T as AbsDiffEq<T>>::Epsilon: Clone,

fn default_max_ulps() -> u32

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

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

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

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

The inverse of [UlpsEq::ulps_eq].

impl<T, const D: usize> Copy for Rotation<T, D>where T: Copy,

impl<T, const D: usize> Eq for Rotation<T, D>where T: Scalar + Eq,