Struct nalgebra::geometry::Rotation

[+] Show declaration

[+] Expand attributes
#[repr(C)]
pub struct Rotation<N: Scalar, D: DimName> where
    DefaultAllocator: Allocator<N, D, D>,  { /* fields omitted */ }

[−] Expand description

A rotation matrix.

Methods

impl<N: Scalar, D: DimName> Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, [−]

pub fn matrix(&self) -> &MatrixN<N, 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 MatrixN<N, 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 MatrixN<N, 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-square, non-inversible, or non-orthonormal. If one of those properties is broken, subsequent method calls may be UB.

pub fn into_inner(self) -> MatrixN<N, 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) -> MatrixN<N, D>[−]

Deprecated:

use .into_inner() instead

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

pub fn to_homogeneous(&self) -> MatrixN<N, DimNameSum<D, U1>> where
    N: Zero + One,
    D: DimNameAdd<U1>,
    DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>>, [−]

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

pub fn from_matrix_unchecked(matrix: MatrixN<N, D>) -> Self[−]

Creates a new rotation from the given square matrix.

The matrix squareness is checked but not its orthonormality.

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

[+] Expand attributes

#[must_use = "Did you mean to use transpose_mut()?"] pub fn transpose(&self) -> Self[−]

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

[+] Expand attributes

#[must_use = "Did you mean to use inverse_mut()?"] pub fn inverse(&self) -> Self[−]

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<N: RealField, D: DimName> Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>, [−]

pub fn transform_point(&self, pt: &Point<N, D>) -> Point<N, 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: &VectorN<N, D>) -> VectorN<N, D>[−]

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: &Point<N, D>) -> Point<N, 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: &VectorN<N, D>) -> VectorN<N, D>[−]

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

impl<N, D: DimName> Rotation<N, D> where
    N: Scalar + Zero + One,
    DefaultAllocator: Allocator<N, D, D>, [−]

pub fn identity() -> Rotation<N, D>[−]

Creates a new square identity rotation of the given dimension.

Example

let rot1 = Quaternion::identity();
let rot2 = Quaternion::new(1.0, 2.0, 3.0, 4.0);

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

impl<N: RealField> Rotation<N, U2>[−]

pub fn new(angle: N) -> Self[−]

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: Storage<N, U1>>(
    axisangle: Vector<N, U1, SB>
) -> Self[−]

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.

pub fn from_matrix(m: &Matrix2<N>) -> Self[−]

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: &Matrix2<N>,
    eps: N,
    max_iter: usize,
    guess: Self
) -> Self[−]

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: &Vector<N, U2, SB>,
    b: &Vector<N, U2, SC>
) -> Self where
    SB: Storage<N, U2>,
    SC: Storage<N, U2>, [−]

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: &Vector<N, U2, SB>,
    b: &Vector<N, U2, SC>,
    s: N
) -> Self where
    SB: Storage<N, U2>,
    SC: Storage<N, U2>, [−]

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 angle(&self) -> N[−]

The rotation angle.

Example

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

pub fn angle_to(&self, other: &Self) -> N[−]

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 rotation_to(&self, other: &Self) -> Self[−]

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)[−]

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: N) -> Self[−]

Raise the quaternion 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);

pub fn scaled_axis(&self) -> VectorN<N, U1>[−]

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<N: RealField> Rotation<N, U3>[−]

pub fn new<SB: Storage<N, U3>>(axisangle: Vector<N, U3, SB>) -> Self[−]

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_matrix(m: &Matrix3<N>) -> Self[−]

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: &Matrix3<N>,
    eps: N,
    max_iter: usize,
    guess: Self
) -> Self[−]

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 from_scaled_axis<SB: Storage<N, U3>>(
    axisangle: Vector<N, U3, SB>
) -> Self[−]

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<Vector<N, U3, SB>>, angle: N) -> Self where
    SB: Storage<N, U3>, [−]

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: N, pitch: N, yaw: N) -> Self[−]

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

pub fn to_euler_angles(&self) -> (N, N, N)[−]

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) -> (N, N, N)[−]

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 renormalize(&mut self)[−]

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 face_towards<SB, SC>(
    dir: &Vector<N, U3, SB>,
    up: &Vector<N, U3, SC>
) -> Self where
    SB: Storage<N, U3>,
    SC: Storage<N, U3>, [−]

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: &Vector<N, U3, SB>,
    up: &Vector<N, U3, SC>
) -> Self where
    SB: Storage<N, U3>,
    SC: Storage<N, U3>, [−]

Deprecated:

renamed to face_towards

Deprecated: Use [Rotation3::face_towards] instead.

pub fn look_at_rh<SB, SC>(
    dir: &Vector<N, U3, SB>,
    up: &Vector<N, U3, SC>
) -> Self where
    SB: Storage<N, U3>,
    SC: Storage<N, U3>, [−]

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: &Vector<N, U3, SB>,
    up: &Vector<N, U3, SC>
) -> Self where
    SB: Storage<N, U3>,
    SC: Storage<N, U3>, [−]

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());

pub fn rotation_between<SB, SC>(
    a: &Vector<N, U3, SB>,
    b: &Vector<N, U3, SC>
) -> Option<Self> where
    SB: Storage<N, U3>,
    SC: Storage<N, U3>, [−]

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: &Vector<N, U3, SB>,
    b: &Vector<N, U3, SC>,
    n: N
) -> Option<Self> where
    SB: Storage<N, U3>,
    SC: Storage<N, U3>, [−]

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 angle(&self) -> N[−]

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<Vector3<N>>>[−]

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) -> Vector3<N>[−]

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<Vector3<N>>, N)>[−]

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

Returns None if the angle is zero.

Example

let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0));
let angle = 1.2;
let rot = 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: &Self) -> N[−]

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 rotation_to(&self, other: &Self) -> Self[−]

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: N) -> Self[−]

Raise the quaternion 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);

Trait Implementations

impl<N, D: DimName> AbsDiffEq<Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + AbsDiffEq,
    DefaultAllocator: Allocator<N, D, D>,
    N::Epsilon: Copy, [+]

[+] Show hidden undocumented items

type Epsilon = N::Epsilon

Used for specifying relative comparisons.

fn default_epsilon() -> Self::Epsilon[−]

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

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

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

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

The inverse of ApproxEq::abs_diff_eq.

impl<N: RealField, D: DimName> AbstractGroup<Multiplicative> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, 

impl<N: RealField, D: DimName> AbstractLoop<Multiplicative> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, 

impl<N: RealField, D: DimName> AbstractMagma<Multiplicative> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn operate(&self, rhs: &Self) -> Self[−]

Performs an operation.

fn op(&self, O, lhs: &Self) -> Self[−]

Performs specific operation.

impl<N: RealField, D: DimName> AbstractMonoid<Multiplicative> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn prop_operating_identity_element_is_noop_approx(args: (Self,)) -> bool where
    Self: RelativeEq<Self>, [−]

Checks whether operating with the identity element is a no-op for the given argument. Approximate equality is used for verifications.

fn prop_operating_identity_element_is_noop(args: (Self,)) -> bool where
    Self: Eq, [−]

Checks whether operating with the identity element is a no-op for the given argument.

impl<N: RealField, D: DimName> AbstractQuasigroup<Multiplicative> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn prop_inv_is_latin_square_approx(args: (Self, Self)) -> bool where
    Self: RelativeEq<Self>, [−]

Returns true if latin squareness holds for the given arguments. Approximate equality is used for verifications.

fn prop_inv_is_latin_square(args: (Self, Self)) -> bool where
    Self: Eq, [−]

Returns true if latin squareness holds for the given arguments.

impl<N: RealField, D: DimName> AbstractSemigroup<Multiplicative> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn prop_is_associative_approx(args: (Self, Self, Self)) -> bool where
    Self: RelativeEq<Self>, [−]

Returns true if associativity holds for the given arguments. Approximate equality is used for verifications.

fn prop_is_associative(args: (Self, Self, Self)) -> bool where
    Self: Eq, [−]

Returns true if associativity holds for the given arguments.

impl<N: RealField, D: DimName> AffineTransformation<Point<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>, [+]

[+] Show hidden undocumented items

type Rotation = Self

Type of the first rotation to be applied.

type NonUniformScaling = Id

Type of the non-uniform scaling to be applied.

type Translation = Id

The type of the pure translation part of this affine transformation.

fn decompose(&self) -> (Id, Self, Id, Self)[−]

Decomposes this affine transformation into a rotation followed by a non-uniform scaling, followed by a rotation, followed by a translation.

fn append_translation(&self, _: &Self::Translation) -> Self[−]

Appends a translation to this similarity.

fn prepend_translation(&self, _: &Self::Translation) -> Self[−]

Prepends a translation to this similarity.

fn append_rotation(&self, r: &Self::Rotation) -> Self[−]

Appends a rotation to this similarity.

fn prepend_rotation(&self, r: &Self::Rotation) -> Self[−]

Prepends a rotation to this similarity.

fn append_scaling(&self, _: &Self::NonUniformScaling) -> Self[−]

Appends a scaling factor to this similarity.

fn prepend_scaling(&self, _: &Self::NonUniformScaling) -> Self[−]

Prepends a scaling factor to this similarity.

fn append_rotation_wrt_point(&self, r: &Self::Rotation, p: &E) -> Option<Self>[−]

Appends to this similarity a rotation centered at the point p, i.e., this point is left invariant.

impl<N: Scalar, D: DimName> Clone for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>,
    <DefaultAllocator as Allocator<N, D, D>>::Buffer: Clone, [+]

[+] Show hidden undocumented items

fn clone(&self) -> Self[−]

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)[−]

Performs copy-assignment from source.

impl<N: Scalar + Copy, D: DimName> Copy for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>,
    <DefaultAllocator as Allocator<N, D, D>>::Buffer: Copy, 

impl<N: Debug + Scalar, D: Debug + DimName> Debug for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn fmt(&self, f: &mut Formatter) -> Result[−]

Formats the value using the given formatter.

impl<N: RealField, D: DimName> DirectIsometry<Point<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>, 

impl<N, D: DimName> Display for Rotation<N, D> where
    N: RealField + Display,
    DefaultAllocator: Allocator<N, D, D> + Allocator<usize, D, D>, [+]

[+] Show hidden undocumented items

fn fmt(&self, f: &mut Formatter) -> Result[−]

Formats the value using the given formatter.

impl<N: RealField> Distribution<Rotation<N, U2>> for Standard where
    OpenClosed01: Distribution<N>, [+]

[+] Show hidden undocumented items

fn sample<'a, R: Rng + ?Sized>(&self, rng: &'a mut R) -> Rotation2<N>[−]

Generate a uniformly distributed random rotation.

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

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

impl<N: RealField> Distribution<Rotation<N, U3>> for Standard where
    OpenClosed01: Distribution<N>, [+]

[+] Show hidden undocumented items

fn sample<'a, R: Rng + ?Sized>(&self, rng: &mut R) -> Rotation3<N>[−]

Generate a uniformly distributed random rotation.

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

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

impl<'b, N: RealField, D: DimName> Div<&'b Isometry<N, D, Rotation<N, D>>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

fn div(self, right: &'b Isometry<N, D, Rotation<N, D>>) -> Self::Output[−]

Performs the / operation.

impl<'a, 'b, N: RealField, D: DimName> Div<&'b Isometry<N, D, Rotation<N, D>>> for &'a Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

fn div(self, right: &'b Isometry<N, D, Rotation<N, D>>) -> Self::Output[−]

Performs the / operation.

impl<'b, N, D: DimName> Div<&'b Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

type Output = Rotation<N, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, N, D: DimName> Div<&'b Rotation<N, D>> for &'a Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

type Output = Rotation<N, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, N, D: DimNameAdd<U1>, C: TCategoryMul<TAffine>> Div<&'b Rotation<N, D>> for Transform<N, D, C> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, D> + Allocator<N, DimNameSum<D, U1>, D>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, N, D: DimNameAdd<U1>, C: TCategoryMul<TAffine>> Div<&'b Rotation<N, D>> for &'a Transform<N, D, C> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, D> + Allocator<N, DimNameSum<D, U1>, D>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<&'b Rotation<N, D2>> for Matrix<N, R1, C1, SA> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
    DefaultAllocator: Allocator<N, R1, D2>,
    ShapeConstraint: AreMultipliable<R1, C1, D2, D2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, R1, D2>

The resulting type after applying the / operator.

fn div(self, right: &'b Rotation<N, D2>) -> Self::Output[−]

Performs the / operation.

impl<'a, 'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<&'b Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
    DefaultAllocator: Allocator<N, R1, D2>,
    ShapeConstraint: AreMultipliable<R1, C1, D2, D2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, R1, D2>

The resulting type after applying the / operator.

fn div(self, right: &'b Rotation<N, D2>) -> Self::Output[−]

Performs the / operation.

impl<'b, N: RealField> Div<&'b Rotation<N, U2>> for UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Rotation<N, U2>) -> Self::Output[−]

Performs the / operation.

impl<'a, 'b, N: RealField> Div<&'b Rotation<N, U2>> for &'a UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Rotation<N, U2>) -> Self::Output[−]

Performs the / operation.

impl<'a, 'b, N: RealField> Div<&'b Rotation<N, U3>> for &'a UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Rotation<N, U3>) -> Self::Output[−]

Performs the / operation.

impl<'b, N: RealField> Div<&'b Rotation<N, U3>> for UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the / operator.

fn div(self, rhs: &'b Rotation<N, U3>) -> Self::Output[−]

Performs the / operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

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

Performs the / operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, N, D: DimNameAdd<U1>, C: TCategoryMul<TAffine>> Div<&'b Transform<N, D, C>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, DimNameSum<D, U1>>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

fn div(self, rhs: &'b Transform<N, D, C>) -> Self::Output[−]

Performs the / operation.

impl<'a, 'b, N, D: DimNameAdd<U1>, C: TCategoryMul<TAffine>> Div<&'b Transform<N, D, C>> for &'a Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, DimNameSum<D, U1>>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

fn div(self, rhs: &'b Transform<N, D, C>) -> Self::Output[−]

Performs the / operation.

impl<'b, N: RealField> Div<&'b Unit<Complex<N>>> for Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, 'b, N: RealField> Div<&'b Unit<Complex<N>>> for &'a Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the / operator.

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

Performs the / operation.

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

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the / operator.

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

Performs the / operation.

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

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<N: RealField, D: DimName> Div<Isometry<N, D, Rotation<N, D>>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

fn div(self, right: Isometry<N, D, Rotation<N, D>>) -> Self::Output[−]

Performs the / operation.

impl<'a, N: RealField, D: DimName> Div<Isometry<N, D, Rotation<N, D>>> for &'a Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

fn div(self, right: Isometry<N, D, Rotation<N, D>>) -> Self::Output[−]

Performs the / operation.

impl<N, D: DimName> Div<Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

type Output = Rotation<N, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, N, D: DimName> Div<Rotation<N, D>> for &'a Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

type Output = Rotation<N, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<N, D: DimNameAdd<U1>, C: TCategoryMul<TAffine>> Div<Rotation<N, D>> for Transform<N, D, C> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, D> + Allocator<N, DimNameSum<D, U1>, D>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, N, D: DimNameAdd<U1>, C: TCategoryMul<TAffine>> Div<Rotation<N, D>> for &'a Transform<N, D, C> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, D> + Allocator<N, DimNameSum<D, U1>, D>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<Rotation<N, D2>> for Matrix<N, R1, C1, SA> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
    DefaultAllocator: Allocator<N, R1, D2>,
    ShapeConstraint: AreMultipliable<R1, C1, D2, D2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, R1, D2>

The resulting type after applying the / operator.

fn div(self, right: Rotation<N, D2>) -> Self::Output[−]

Performs the / operation.

impl<'a, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Div<Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
    DefaultAllocator: Allocator<N, R1, D2>,
    ShapeConstraint: AreMultipliable<R1, C1, D2, D2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, R1, D2>

The resulting type after applying the / operator.

fn div(self, right: Rotation<N, D2>) -> Self::Output[−]

Performs the / operation.

impl<N: RealField> Div<Rotation<N, U2>> for UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the / operator.

fn div(self, rhs: Rotation<N, U2>) -> Self::Output[−]

Performs the / operation.

impl<'a, N: RealField> Div<Rotation<N, U2>> for &'a UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the / operator.

fn div(self, rhs: Rotation<N, U2>) -> Self::Output[−]

Performs the / operation.

impl<'a, N: RealField> Div<Rotation<N, U3>> for &'a UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the / operator.

fn div(self, rhs: Rotation<N, U3>) -> Self::Output[−]

Performs the / operation.

impl<N: RealField> Div<Rotation<N, U3>> for UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the / operator.

fn div(self, rhs: Rotation<N, U3>) -> Self::Output[−]

Performs the / operation.

impl<N: RealField, D: DimName> Div<Similarity<N, D, Rotation<N, D>>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

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

Performs the / operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

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

Performs the / operation.

impl<N, D: DimNameAdd<U1>, C: TCategoryMul<TAffine>> Div<Transform<N, D, C>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, DimNameSum<D, U1>>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

fn div(self, rhs: Transform<N, D, C>) -> Self::Output[−]

Performs the / operation.

impl<'a, N, D: DimNameAdd<U1>, C: TCategoryMul<TAffine>> Div<Transform<N, D, C>> for &'a Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, DimNameSum<D, U1>>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the / operator.

fn div(self, rhs: Transform<N, D, C>) -> Self::Output[−]

Performs the / operation.

impl<N: RealField> Div<Unit<Complex<N>>> for Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'a, N: RealField> Div<Unit<Complex<N>>> for &'a Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the / operator.

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

Performs the / operation.

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

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<N: RealField> Div<Unit<Quaternion<N>>> for Rotation<N, U3> where
    DefaultAllocator: Allocator<N, U3, U3> + Allocator<N, U4, U1>, [+]

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<'b, N, R1: DimName, C1: DimName> DivAssign<&'b Rotation<N, C1>> for MatrixMN<N, R1, C1> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, C1, C1>, [+]

[+] Show hidden undocumented items

fn div_assign(&mut self, right: &'b Rotation<N, C1>)[−]

Performs the /= operation.

impl<'b, N, D: DimName> DivAssign<&'b Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn div_assign(&mut self, right: &'b Rotation<N, D>)[−]

Performs the /= operation.

impl<'b, N, D: DimNameAdd<U1>, C: TCategory> DivAssign<&'b Rotation<N, D>> for Transform<N, D, C> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

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

Performs the /= operation.

impl<'b, N: RealField> DivAssign<&'b Rotation<N, U2>> for UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

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

Performs the /= operation.

impl<'b, N: RealField> DivAssign<&'b Rotation<N, U3>> for UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

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

Performs the /= operation.

impl<'b, N: RealField> DivAssign<&'b Unit<Complex<N>>> for Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

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

Performs the /= operation.

impl<N, R1: DimName, C1: DimName> DivAssign<Rotation<N, C1>> for MatrixMN<N, R1, C1> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, C1, C1>, [+]

[+] Show hidden undocumented items

fn div_assign(&mut self, right: Rotation<N, C1>)[−]

Performs the /= operation.

impl<N, D: DimName> DivAssign<Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn div_assign(&mut self, right: Rotation<N, D>)[−]

Performs the /= operation.

impl<N, D: DimNameAdd<U1>, C: TCategory> DivAssign<Rotation<N, D>> for Transform<N, D, C> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

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

Performs the /= operation.

impl<N: RealField> DivAssign<Rotation<N, U2>> for UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

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

Performs the /= operation.

impl<N: RealField> DivAssign<Rotation<N, U3>> for UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

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

Performs the /= operation.

impl<N: RealField> DivAssign<Unit<Complex<N>>> for Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

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

Performs the /= operation.

impl<N: Scalar + Eq, D: DimName> Eq for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, 

impl<N: RealField> From<Rotation<N, U2>> for Matrix3<N>[+]

[+] Show hidden undocumented items

fn from(q: Rotation2<N>) -> Self[−]

Performs the conversion.

impl<N: RealField> From<Rotation<N, U2>> for Matrix2<N>[+]

[+] Show hidden undocumented items

fn from(q: Rotation2<N>) -> Self[−]

Performs the conversion.

impl<N: RealField> From<Rotation<N, U2>> for UnitComplex<N>[+]

[+] Show hidden undocumented items

fn from(q: Rotation2<N>) -> Self[−]

Performs the conversion.

impl<N: RealField> From<Rotation<N, U3>> for Matrix4<N>[+]

[+] Show hidden undocumented items

fn from(q: Rotation3<N>) -> Self[−]

Performs the conversion.

impl<N: RealField> From<Rotation<N, U3>> for Matrix3<N>[+]

[+] Show hidden undocumented items

fn from(q: Rotation3<N>) -> Self[−]

Performs the conversion.

impl<N: RealField> From<Rotation<N, U3>> for UnitQuaternion<N>[+]

[+] Show hidden undocumented items

fn from(q: Rotation3<N>) -> Self[−]

Performs the conversion.

impl<N: Scalar + Hash, D: DimName + Hash> Hash for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>,
    <DefaultAllocator as Allocator<N, D, D>>::Buffer: Hash, [+]

[+] Show hidden undocumented items

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

Feeds this value into the given [Hasher].

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

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

impl<N: RealField, D: DimName> Identity<Multiplicative> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn identity() -> Self[−]

The identity element.

fn id(O) -> Self[−]

Specific identity.

impl<N: Scalar, D: DimName> Index<(usize, usize)> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

type Output = N

The returned type after indexing.

fn index(&self, row_col: (usize, usize)) -> &N[−]

Performs the indexing (container[index]) operation.

impl<N: RealField, D: DimName> Isometry<Point<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>, 

impl<'b, N: RealField, D: DimName> Mul<&'b Isometry<N, D, Rotation<N, D>>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

fn mul(self, right: &'b Isometry<N, D, Rotation<N, D>>) -> Self::Output[−]

Performs the * operation.

impl<'a, 'b, N: RealField, D: DimName> Mul<&'b Isometry<N, D, Rotation<N, D>>> for &'a Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

fn mul(self, right: &'b Isometry<N, D, Rotation<N, D>>) -> Self::Output[−]

Performs the * operation.

impl<'b, N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<&'b Matrix<N, R2, C2, SB>> for Rotation<N, D1> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
    DefaultAllocator: Allocator<N, D1, C2>,
    ShapeConstraint: AreMultipliable<D1, D1, R2, C2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, D1, C2>

The resulting type after applying the * operator.

fn mul(self, right: &'b Matrix<N, R2, C2, SB>) -> Self::Output[−]

Performs the * operation.

impl<'a, 'b, N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<&'b Matrix<N, R2, C2, SB>> for &'a Rotation<N, D1> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
    DefaultAllocator: Allocator<N, D1, C2>,
    ShapeConstraint: AreMultipliable<D1, D1, R2, C2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, D1, C2>

The resulting type after applying the * operator.

fn mul(self, right: &'b Matrix<N, R2, C2, SB>) -> Self::Output[−]

Performs the * operation.

impl<'b, N, D: DimName> Mul<&'b Point<N, D>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, D>,
    ShapeConstraint: AreMultipliable<D, D, D, U1>, [+]

[+] Show hidden undocumented items

type Output = Point<N, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, N, D: DimName> Mul<&'b Point<N, D>> for &'a Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, D>,
    ShapeConstraint: AreMultipliable<D, D, D, U1>, [+]

[+] Show hidden undocumented items

type Output = Point<N, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, N, D: DimName> Mul<&'b Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

type Output = Rotation<N, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, N, D: DimName> Mul<&'b Rotation<N, D>> for &'a Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

type Output = Rotation<N, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, N: RealField, D: DimName> Mul<&'b Rotation<N, D>> for Translation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, N: RealField, D: DimName> Mul<&'b Rotation<N, D>> for &'a Translation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<&'b Rotation<N, D2>> for Matrix<N, R1, C1, SA> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
    DefaultAllocator: Allocator<N, R1, D2>,
    ShapeConstraint: AreMultipliable<R1, C1, D2, D2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, R1, D2>

The resulting type after applying the * operator.

fn mul(self, right: &'b Rotation<N, D2>) -> Self::Output[−]

Performs the * operation.

impl<'a, 'b, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<&'b Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
    DefaultAllocator: Allocator<N, R1, D2>,
    ShapeConstraint: AreMultipliable<R1, C1, D2, D2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, R1, D2>

The resulting type after applying the * operator.

fn mul(self, right: &'b Rotation<N, D2>) -> Self::Output[−]

Performs the * operation.

impl<'b, N: RealField> Mul<&'b Rotation<N, U2>> for UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Rotation<N, U2>) -> Self::Output[−]

Performs the * operation.

impl<'a, 'b, N: RealField> Mul<&'b Rotation<N, U2>> for &'a UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Rotation<N, U2>) -> Self::Output[−]

Performs the * operation.

impl<'a, 'b, N: RealField> Mul<&'b Rotation<N, U3>> for &'a UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Rotation<N, U3>) -> Self::Output[−]

Performs the * operation.

impl<'b, N: RealField> Mul<&'b Rotation<N, U3>> for UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Rotation<N, U3>) -> Self::Output[−]

Performs the * operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, N: RealField, D: DimName> Mul<&'b Translation<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, N: RealField, D: DimName> Mul<&'b Translation<N, D>> for &'a Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, N: RealField> Mul<&'b Unit<Complex<N>>> for Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, N: RealField> Mul<&'b Unit<Complex<N>>> for &'a Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, N, D: DimName, S: Storage<N, D>> Mul<&'b Unit<Matrix<N, D, U1, S>>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, D>,
    ShapeConstraint: AreMultipliable<D, D, D, U1>, [+]

[+] Show hidden undocumented items

type Output = Unit<VectorN<N, D>>

The resulting type after applying the * operator.

fn mul(self, right: &'b Unit<Vector<N, D, S>>) -> Self::Output[−]

Performs the * operation.

impl<'a, 'b, N, D: DimName, S: Storage<N, D>> Mul<&'b Unit<Matrix<N, D, U1, S>>> for &'a Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, D>,
    ShapeConstraint: AreMultipliable<D, D, D, U1>, [+]

[+] Show hidden undocumented items

type Output = Unit<VectorN<N, D>>

The resulting type after applying the * operator.

fn mul(self, right: &'b Unit<Vector<N, D, S>>) -> Self::Output[−]

Performs the * operation.

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

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the * operator.

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

Performs the * operation.

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

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N: RealField, D: DimName> Mul<Isometry<N, D, Rotation<N, D>>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

fn mul(self, right: Isometry<N, D, Rotation<N, D>>) -> Self::Output[−]

Performs the * operation.

impl<'a, N: RealField, D: DimName> Mul<Isometry<N, D, Rotation<N, D>>> for &'a Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

fn mul(self, right: Isometry<N, D, Rotation<N, D>>) -> Self::Output[−]

Performs the * operation.

impl<N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<Matrix<N, R2, C2, SB>> for Rotation<N, D1> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
    DefaultAllocator: Allocator<N, D1, C2>,
    ShapeConstraint: AreMultipliable<D1, D1, R2, C2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, D1, C2>

The resulting type after applying the * operator.

fn mul(self, right: Matrix<N, R2, C2, SB>) -> Self::Output[−]

Performs the * operation.

impl<'a, N, D1: DimName, R2: Dim, C2: Dim, SB: Storage<N, R2, C2>> Mul<Matrix<N, R2, C2, SB>> for &'a Rotation<N, D1> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D1, D1> + Allocator<N, R2, C2> + Allocator<N, D1, C2>,
    DefaultAllocator: Allocator<N, D1, C2>,
    ShapeConstraint: AreMultipliable<D1, D1, R2, C2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, D1, C2>

The resulting type after applying the * operator.

fn mul(self, right: Matrix<N, R2, C2, SB>) -> Self::Output[−]

Performs the * operation.

impl<N, D: DimName> Mul<Point<N, D>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, D>,
    ShapeConstraint: AreMultipliable<D, D, D, U1>, [+]

[+] Show hidden undocumented items

type Output = Point<N, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, N, D: DimName> Mul<Point<N, D>> for &'a Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, D>,
    ShapeConstraint: AreMultipliable<D, D, D, U1>, [+]

[+] Show hidden undocumented items

type Output = Point<N, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N, D: DimName> Mul<Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

type Output = Rotation<N, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, N, D: DimName> Mul<Rotation<N, D>> for &'a Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

type Output = Rotation<N, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N: RealField, D: DimName> Mul<Rotation<N, D>> for Translation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, N: RealField, D: DimName> Mul<Rotation<N, D>> for &'a Translation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N, D: DimNameAdd<U1>, C: TCategoryMul<TAffine>> Mul<Rotation<N, D>> for Transform<N, D, C> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, D> + Allocator<N, DimNameSum<D, U1>, D>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<Rotation<N, D2>> for Matrix<N, R1, C1, SA> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
    DefaultAllocator: Allocator<N, R1, D2>,
    ShapeConstraint: AreMultipliable<R1, C1, D2, D2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, R1, D2>

The resulting type after applying the * operator.

fn mul(self, right: Rotation<N, D2>) -> Self::Output[−]

Performs the * operation.

impl<'a, N, R1: Dim, C1: Dim, D2: DimName, SA: Storage<N, R1, C1>> Mul<Rotation<N, D2>> for &'a Matrix<N, R1, C1, SA> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, D2, D2> + Allocator<N, R1, D2>,
    DefaultAllocator: Allocator<N, R1, D2>,
    ShapeConstraint: AreMultipliable<R1, C1, D2, D2>, [+]

[+] Show hidden undocumented items

type Output = MatrixMN<N, R1, D2>

The resulting type after applying the * operator.

fn mul(self, right: Rotation<N, D2>) -> Self::Output[−]

Performs the * operation.

impl<N: RealField> Mul<Rotation<N, U2>> for UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the * operator.

fn mul(self, rhs: Rotation<N, U2>) -> Self::Output[−]

Performs the * operation.

impl<'a, N: RealField> Mul<Rotation<N, U2>> for &'a UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the * operator.

fn mul(self, rhs: Rotation<N, U2>) -> Self::Output[−]

Performs the * operation.

impl<'a, N: RealField> Mul<Rotation<N, U3>> for &'a UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the * operator.

fn mul(self, rhs: Rotation<N, U3>) -> Self::Output[−]

Performs the * operation.

impl<N: RealField> Mul<Rotation<N, U3>> for UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the * operator.

fn mul(self, rhs: Rotation<N, U3>) -> Self::Output[−]

Performs the * operation.

impl<N: RealField, D: DimName> Mul<Similarity<N, D, Rotation<N, D>>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N, D: DimNameAdd<U1>, C: TCategoryMul<TAffine>> Mul<Transform<N, D, C>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, DimNameSum<D, U1>>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

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

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N: RealField, D: DimName> Mul<Translation<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, N: RealField, D: DimName> Mul<Translation<N, D>> for &'a Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>, [+]

[+] Show hidden undocumented items

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N: RealField> Mul<Unit<Complex<N>>> for Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, N: RealField> Mul<Unit<Complex<N>>> for &'a Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

type Output = UnitComplex<N>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N, D: DimName, S: Storage<N, D>> Mul<Unit<Matrix<N, D, U1, S>>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, D>,
    ShapeConstraint: AreMultipliable<D, D, D, U1>, [+]

[+] Show hidden undocumented items

type Output = Unit<VectorN<N, D>>

The resulting type after applying the * operator.

fn mul(self, right: Unit<Vector<N, D, S>>) -> Self::Output[−]

Performs the * operation.

impl<'a, N, D: DimName, S: Storage<N, D>> Mul<Unit<Matrix<N, D, U1, S>>> for &'a Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D, U1>,
    DefaultAllocator: Allocator<N, D>,
    ShapeConstraint: AreMultipliable<D, D, D, U1>, [+]

[+] Show hidden undocumented items

type Output = Unit<VectorN<N, D>>

The resulting type after applying the * operator.

fn mul(self, right: Unit<Vector<N, D, S>>) -> Self::Output[−]

Performs the * operation.

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

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<N: RealField> Mul<Unit<Quaternion<N>>> for Rotation<N, U3> where
    DefaultAllocator: Allocator<N, U3, U3> + Allocator<N, U4, U1>, [+]

[+] Show hidden undocumented items

type Output = UnitQuaternion<N>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, N, R1: DimName, C1: DimName> MulAssign<&'b Rotation<N, C1>> for MatrixMN<N, R1, C1> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, C1, C1>, [+]

[+] Show hidden undocumented items

fn mul_assign(&mut self, right: &'b Rotation<N, C1>)[−]

Performs the *= operation.

impl<'b, N, D: DimName> MulAssign<&'b Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn mul_assign(&mut self, right: &'b Rotation<N, D>)[−]

Performs the *= operation.

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

[+] Show hidden undocumented items

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

Performs the *= operation.

impl<'b, N: RealField> MulAssign<&'b Rotation<N, U2>> for UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

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

Performs the *= operation.

impl<'b, N: RealField> MulAssign<&'b Rotation<N, U3>> for UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

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

Performs the *= operation.

impl<'b, N: RealField> MulAssign<&'b Unit<Complex<N>>> for Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

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

Performs the *= operation.

impl<N, R1: DimName, C1: DimName> MulAssign<Rotation<N, C1>> for MatrixMN<N, R1, C1> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, C1, C1>, [+]

[+] Show hidden undocumented items

fn mul_assign(&mut self, right: Rotation<N, C1>)[−]

Performs the *= operation.

impl<N, D: DimName> MulAssign<Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn mul_assign(&mut self, right: Rotation<N, D>)[−]

Performs the *= operation.

impl<N, D: DimNameAdd<U1>, C: TCategory> MulAssign<Rotation<N, D>> for Transform<N, D, C> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    DefaultAllocator: Allocator<N, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

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

Performs the *= operation.

impl<N: RealField> MulAssign<Rotation<N, U2>> for UnitComplex<N> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

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

Performs the *= operation.

impl<N: RealField> MulAssign<Rotation<N, U3>> for UnitQuaternion<N> where
    DefaultAllocator: Allocator<N, U4, U1> + Allocator<N, U3, U3>, [+]

[+] Show hidden undocumented items

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

Performs the *= operation.

impl<N: RealField> MulAssign<Unit<Complex<N>>> for Rotation<N, U2> where
    DefaultAllocator: Allocator<N, U2, U2>, [+]

[+] Show hidden undocumented items

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

Performs the *= operation.

impl<N, D: DimName> One for Rotation<N, D> where
    N: Scalar + Zero + One + ClosedAdd + ClosedMul,
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

fn one() -> Self[−]

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)[−]

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

fn is_one(&self) -> bool where
    Self: PartialEq<Self>, [−]

Returns true if self is equal to the multiplicative identity.

impl<N: RealField, D: DimName> OrthogonalTransformation<Point<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>, 

impl<N: Scalar + PartialEq, D: DimName> PartialEq<Rotation<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

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

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

[+] Expand attributes

#[must_use] fn ne(&self, other: &Rhs) -> bool[−]

This method tests for !=.

impl<N: RealField, D: DimName> ProjectiveTransformation<Point<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>, [+]

[+] Show hidden undocumented items

fn inverse_transform_point(&self, pt: &Point<N, D>) -> Point<N, D>[−]

Applies this group's two_sided_inverse action on a point from the euclidean space.

fn inverse_transform_vector(&self, v: &VectorN<N, D>) -> VectorN<N, D>[−]

Applies this group's two_sided_inverse action on a vector from the euclidean space.

impl<N, D: DimName> RelativeEq<Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + RelativeEq,
    DefaultAllocator: Allocator<N, D, D>,
    N::Epsilon: Copy, [+]

[+] Show hidden undocumented items

fn default_max_relative() -> Self::Epsilon[−]

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

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

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

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

The inverse of ApproxEq::relative_eq.

impl<N: RealField, D: DimName> Rotation<Point<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>, [+]

Subgroups of the n-dimensional rotation group SO(n).

[+] Show hidden undocumented items

fn powf(&self, _: N) -> Option<Self>[−]

Raises this rotation to a power. If this is a simple rotation, the result must be equivalent to multiplying the rotation angle by n.

fn rotation_between(_: &VectorN<N, D>, _: &VectorN<N, D>) -> Option<Self>[−]

Computes a simple rotation that makes the angle between a and b equal to zero, i.e., b.angle(a * delta_rotation(a, b)) = 0. If a and b are collinear, the computed rotation may not be unique. Returns None if no such simple rotation exists in the subgroup represented by Self.

fn scaled_rotation_between(
    _: &VectorN<N, D>,
    _: &VectorN<N, D>,
    _: N
) -> Option<Self>[−]

Computes the rotation between a and b and raises it to the power n.

impl<N: RealField, D: DimName> Similarity<Point<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>, [+]

[+] Show hidden undocumented items

type Scaling = Id

The type of the pure (uniform) scaling part of this similarity transformation.

fn translation(&self) -> Id[−]

The pure translational component of this similarity transformation.

fn rotation(&self) -> Self[−]

The pure rotational component of this similarity transformation.

fn scaling(&self) -> Id[−]

The pure scaling component of this similarity transformation.

fn translate_point(&self, pt: &E) -> E[−]

Applies this transformation's pure translational part to a point.

fn rotate_point(&self, pt: &E) -> E[−]

Applies this transformation's pure rotational part to a point.

fn scale_point(&self, pt: &E) -> E[−]

Applies this transformation's pure scaling part to a point.

fn rotate_vector(
    &self,
    pt: &<E as EuclideanSpace>::Coordinates
) -> <E as EuclideanSpace>::Coordinates[−]

Applies this transformation's pure rotational part to a vector.

fn scale_vector(
    &self,
    pt: &<E as EuclideanSpace>::Coordinates
) -> <E as EuclideanSpace>::Coordinates[−]

Applies this transformation's pure scaling part to a vector.

fn inverse_translate_point(&self, pt: &E) -> E[−]

Applies this transformation inverse's pure translational part to a point.

fn inverse_rotate_point(&self, pt: &E) -> E[−]

Applies this transformation inverse's pure rotational part to a point.

fn inverse_scale_point(&self, pt: &E) -> E[−]

Applies this transformation inverse's pure scaling part to a point.

fn inverse_rotate_vector(
    &self,
    pt: &<E as EuclideanSpace>::Coordinates
) -> <E as EuclideanSpace>::Coordinates[−]

Applies this transformation inverse's pure rotational part to a vector.

fn inverse_scale_vector(
    &self,
    pt: &<E as EuclideanSpace>::Coordinates
) -> <E as EuclideanSpace>::Coordinates[−]

Applies this transformation inverse's pure scaling part to a vector.

impl<N1, N2, D: DimName, R> SubsetOf<Isometry<N2, D, R>> for Rotation<N1, D> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    R: AlgaRotation<Point<N2, D>> + SupersetOf<Self>,
    DefaultAllocator: Allocator<N1, D, D> + Allocator<N2, D>, [+]

[+] Show hidden undocumented items

fn to_superset(&self) -> Isometry<N2, D, R>[−]

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

fn is_in_subset(iso: &Isometry<N2, D, R>) -> bool[−]

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

unsafe fn from_superset_unchecked(iso: &Isometry<N2, D, R>) -> Self[−]

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<N1, N2, D> SubsetOf<Matrix<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output, <DefaultAllocator as Allocator<N2, <D as DimNameAdd<U1>>::Output, <D as DimNameAdd<U1>>::Output>>::Buffer>> for Rotation<N1, D> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    D: DimNameAdd<U1> + DimMin<D, Output = D>,
    DefaultAllocator: Allocator<N1, D, D> + Allocator<N2, D, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<(usize, usize), D>, [+]

[+] Show hidden undocumented items

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

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

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

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

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

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

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

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

impl<N1, N2, D: DimName> SubsetOf<Rotation<N2, D>> for Rotation<N1, D> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    DefaultAllocator: Allocator<N1, D, D> + Allocator<N2, D, D>, [+]

[+] Show hidden undocumented items

fn to_superset(&self) -> Rotation<N2, D>[−]

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

fn is_in_subset(rot: &Rotation<N2, D>) -> bool[−]

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

unsafe fn from_superset_unchecked(rot: &Rotation<N2, D>) -> Self[−]

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<N1, N2> SubsetOf<Rotation<N2, U2>> for UnitComplex<N1> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>, [+]

[+] Show hidden undocumented items

fn to_superset(&self) -> Rotation2<N2>[−]

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

fn is_in_subset(rot: &Rotation2<N2>) -> bool[−]

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

unsafe fn from_superset_unchecked(rot: &Rotation2<N2>) -> Self[−]

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<N1, N2> SubsetOf<Rotation<N2, U3>> for UnitQuaternion<N1> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>, [+]

[+] Show hidden undocumented items

fn to_superset(&self) -> Rotation3<N2>[−]

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

fn is_in_subset(rot: &Rotation3<N2>) -> bool[−]

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

unsafe fn from_superset_unchecked(rot: &Rotation3<N2>) -> Self[−]

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

[+] Show hidden undocumented items

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

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

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

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

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

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

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

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

impl<N1, N2, D, C> SubsetOf<Transform<N2, D, C>> for Rotation<N1, D> where
    N1: RealField,
    N2: RealField + SupersetOf<N1>,
    C: SuperTCategoryOf<TAffine>,
    D: DimNameAdd<U1> + DimMin<D, Output = D>,
    DefaultAllocator: Allocator<N1, D, D> + Allocator<N2, D, D> + Allocator<N1, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<N2, DimNameSum<D, U1>, DimNameSum<D, U1>> + Allocator<(usize, usize), D>, [+]

[+] Show hidden undocumented items

fn to_superset(&self) -> Transform<N2, D, C>[−]

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

fn is_in_subset(t: &Transform<N2, D, C>) -> bool[−]

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

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

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

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

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

impl<N: RealField, D: DimName> Transformation<Point<N, D>> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D> + Allocator<N, D>, [+]

[+] Show hidden undocumented items

fn transform_point(&self, pt: &Point<N, D>) -> Point<N, D>[−]

Applies this group's action on a point from the euclidean space.

fn transform_vector(&self, v: &VectorN<N, D>) -> VectorN<N, D>[−]

Applies this group's action on a vector from the euclidean space.

impl<N: RealField, D: DimName> TwoSidedInverse<Multiplicative> for Rotation<N, D> where
    DefaultAllocator: Allocator<N, D, D>, [+]

[+] Show hidden undocumented items

[+] Expand attributes

#[must_use = "Did you mean to use two_sided_inverse_mut()?"] fn two_sided_inverse(&self) -> Self[−]

Returns the two_sided_inverse of self, relative to the operator O.

fn two_sided_inverse_mut(&mut self)[−]

In-place inversion of self, relative to the operator O.

impl<N, D: DimName> UlpsEq<Rotation<N, D>> for Rotation<N, D> where
    N: Scalar + UlpsEq,
    DefaultAllocator: Allocator<N, D, D>,
    N::Epsilon: Copy, [+]

[+] Show hidden undocumented items

fn default_max_ulps() -> u32[−]

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

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

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

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

The inverse of ApproxEq::ulps_eq.