[−][src]Struct rin::math::core::Unit
A wrapper that ensures the underlying algebraic entity has a unit norm.
Use .as_ref()
or .unwrap()
to obtain the underlying value by-reference or by-move.
Methods
impl<N, D, S> Unit<Matrix<N, D, U1, S>> where
D: Dim,
N: Real,
S: Storage<N, D, U1>,
[src]
impl<N, D, S> Unit<Matrix<N, D, U1, S>> where
D: Dim,
N: Real,
S: Storage<N, D, U1>,
pub fn slerp<S2>(
&self,
rhs: &Unit<Matrix<N, D, U1, S2>>,
t: N
) -> Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> where
S2: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
[src]
pub fn slerp<S2>(
&self,
rhs: &Unit<Matrix<N, D, U1, S2>>,
t: N
) -> Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>> where
S2: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
Computes the spherical linear interpolation between two unit vectors.
pub fn try_slerp<S2>(
&self,
rhs: &Unit<Matrix<N, D, U1, S2>>,
t: N,
epsilon: N
) -> Option<Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>> where
S2: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
[src]
pub fn try_slerp<S2>(
&self,
rhs: &Unit<Matrix<N, D, U1, S2>>,
t: N,
epsilon: N
) -> Option<Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>> where
S2: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
Computes the spherical linear interpolation between two unit vectors.
Returns None
if the two vectors are almost collinear and with opposite direction
(in this case, there is an infinity of possible results).
impl<T> Unit<T> where
T: NormedSpace,
[src]
impl<T> Unit<T> where
T: NormedSpace,
pub fn new_normalize(value: T) -> Unit<T>
[src]
pub fn new_normalize(value: T) -> Unit<T>
Normalize the given value and return it wrapped on a Unit
structure.
pub fn try_new(value: T, min_norm: <T as VectorSpace>::Field) -> Option<Unit<T>>
[src]
pub fn try_new(value: T, min_norm: <T as VectorSpace>::Field) -> Option<Unit<T>>
Attempts to normalize the given value and return it wrapped on a Unit
structure.
Returns None
if the norm was smaller or equal to min_norm
.
pub fn new_and_get(value: T) -> (Unit<T>, <T as VectorSpace>::Field)
[src]
pub fn new_and_get(value: T) -> (Unit<T>, <T as VectorSpace>::Field)
Normalize the given value and return it wrapped on a Unit
structure and its norm.
pub fn try_new_and_get(
value: T,
min_norm: <T as VectorSpace>::Field
) -> Option<(Unit<T>, <T as VectorSpace>::Field)>
[src]
pub fn try_new_and_get(
value: T,
min_norm: <T as VectorSpace>::Field
) -> Option<(Unit<T>, <T as VectorSpace>::Field)>
Normalize the given value and return it wrapped on a Unit
structure and its norm.
Returns None
if the norm was smaller or equal to min_norm
.
pub fn renormalize(&mut self) -> <T as VectorSpace>::Field
[src]
pub fn renormalize(&mut self) -> <T as VectorSpace>::Field
Normalizes this value again. This is useful when repeated computations might cause a drift in the norm because of float inaccuracies.
Returns the norm before re-normalization (should be close to 1.0
).
impl<T> Unit<T>
[src]
impl<T> Unit<T>
pub fn new_unchecked(value: T) -> Unit<T>
[src]
pub fn new_unchecked(value: T) -> Unit<T>
Wraps the given value, assuming it is already normalized.
pub fn from_ref_unchecked(value: &'a T) -> &'a Unit<T>
[src]
pub fn from_ref_unchecked(value: &'a T) -> &'a Unit<T>
Wraps the given reference, assuming it is already normalized.
pub fn unwrap(self) -> T
[src]
pub fn unwrap(self) -> T
Retrieves the underlying value.
pub fn as_mut_unchecked(&mut self) -> &mut T
[src]
pub fn as_mut_unchecked(&mut self) -> &mut T
Returns a mutable reference to the underlying value. This is _unchecked
because modifying
the underlying value in such a way that it no longer has unit length may lead to unexpected
results.
impl<N> Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> Unit<Quaternion<N>> where
N: Real,
pub fn into_owned(self) -> Unit<Quaternion<N>>
[src]
pub fn into_owned(self) -> Unit<Quaternion<N>>
: This method is unnecessary and will be removed in a future release. Use .clone()
instead.
Moves this unit quaternion into one that owns its data.
pub fn clone_owned(&self) -> Unit<Quaternion<N>>
[src]
pub fn clone_owned(&self) -> Unit<Quaternion<N>>
: This method is unnecessary and will be removed in a future release. Use .clone()
instead.
Clones this unit quaternion into one that owns its data.
pub fn angle(&self) -> N
[src]
pub fn angle(&self) -> N
The rotation angle in [0; pi] of this unit quaternion.
Example
let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0)); let rot = UnitQuaternion::from_axis_angle(&axis, 1.78); assert_eq!(rot.angle(), 1.78);
pub fn quaternion(&self) -> &Quaternion<N>
[src]
pub fn quaternion(&self) -> &Quaternion<N>
The underlying quaternion.
Same as self.as_ref()
.
Example
let axis = UnitQuaternion::identity(); assert_eq!(*axis.quaternion(), Quaternion::new(1.0, 0.0, 0.0, 0.0));
pub fn conjugate(&self) -> Unit<Quaternion<N>>
[src]
pub fn conjugate(&self) -> Unit<Quaternion<N>>
Compute the conjugate of this unit quaternion.
Example
let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0)); let rot = UnitQuaternion::from_axis_angle(&axis, 1.78); let conj = rot.conjugate(); assert_eq!(conj, UnitQuaternion::from_axis_angle(&-axis, 1.78));
pub fn inverse(&self) -> Unit<Quaternion<N>>
[src]
pub fn inverse(&self) -> Unit<Quaternion<N>>
Inverts this quaternion if it is not zero.
Example
let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0)); let rot = UnitQuaternion::from_axis_angle(&axis, 1.78); let inv = rot.inverse(); assert_eq!(rot * inv, UnitQuaternion::identity()); assert_eq!(inv * rot, UnitQuaternion::identity());
pub fn angle_to(&self, other: &Unit<Quaternion<N>>) -> N
[src]
pub fn angle_to(&self, other: &Unit<Quaternion<N>>) -> N
The rotation angle needed to make self
and other
coincide.
Example
let rot1 = UnitQuaternion::from_axis_angle(&Vector3::y_axis(), 1.0); let rot2 = UnitQuaternion::from_axis_angle(&Vector3::x_axis(), 0.1); assert_relative_eq!(rot1.angle_to(&rot2), 1.0045657, epsilon = 1.0e-6);
pub fn rotation_to(&self, other: &Unit<Quaternion<N>>) -> Unit<Quaternion<N>>
[src]
pub fn rotation_to(&self, other: &Unit<Quaternion<N>>) -> Unit<Quaternion<N>>
The unit quaternion needed to make self
and other
coincide.
The result is such that: self.rotation_to(other) * self == other
.
Example
let rot1 = UnitQuaternion::from_axis_angle(&Vector3::y_axis(), 1.0); let rot2 = UnitQuaternion::from_axis_angle(&Vector3::x_axis(), 0.1); let rot_to = rot1.rotation_to(&rot2); assert_relative_eq!(rot_to * rot1, rot2, epsilon = 1.0e-6);
pub fn lerp(&self, other: &Unit<Quaternion<N>>, t: N) -> Quaternion<N>
[src]
pub fn lerp(&self, other: &Unit<Quaternion<N>>, t: N) -> Quaternion<N>
Linear interpolation between two unit quaternions.
The result is not normalized.
Example
let q1 = UnitQuaternion::new_normalize(Quaternion::new(1.0, 0.0, 0.0, 0.0)); let q2 = UnitQuaternion::new_normalize(Quaternion::new(0.0, 1.0, 0.0, 0.0)); assert_eq!(q1.lerp(&q2, 0.1), Quaternion::new(0.9, 0.1, 0.0, 0.0));
pub fn nlerp(&self, other: &Unit<Quaternion<N>>, t: N) -> Unit<Quaternion<N>>
[src]
pub fn nlerp(&self, other: &Unit<Quaternion<N>>, t: N) -> Unit<Quaternion<N>>
Normalized linear interpolation between two unit quaternions.
This is the same as self.lerp
except that the result is normalized.
Example
let q1 = UnitQuaternion::new_normalize(Quaternion::new(1.0, 0.0, 0.0, 0.0)); let q2 = UnitQuaternion::new_normalize(Quaternion::new(0.0, 1.0, 0.0, 0.0)); assert_eq!(q1.nlerp(&q2, 0.1), UnitQuaternion::new_normalize(Quaternion::new(0.9, 0.1, 0.0, 0.0)));
pub fn slerp(&self, other: &Unit<Quaternion<N>>, t: N) -> Unit<Quaternion<N>>
[src]
pub fn slerp(&self, other: &Unit<Quaternion<N>>, t: N) -> Unit<Quaternion<N>>
Spherical linear interpolation between two unit quaternions.
Panics if the angle between both quaternion is 180 degrees (in which case the interpolation
is not well-defined). Use .try_slerp
instead to avoid the panic.
pub fn try_slerp(
&self,
other: &Unit<Quaternion<N>>,
t: N,
epsilon: N
) -> Option<Unit<Quaternion<N>>>
[src]
pub fn try_slerp(
&self,
other: &Unit<Quaternion<N>>,
t: N,
epsilon: N
) -> Option<Unit<Quaternion<N>>>
Computes the spherical linear interpolation between two unit quaternions or returns None
if both quaternions are approximately 180 degrees apart (in which case the interpolation is
not well-defined).
Arguments
self
: the first quaternion to interpolate from.other
: the second quaternion to interpolate toward.t
: the interpolation parameter. Should be between 0 and 1.epsilon
: the value below which the sinus of the angle separating both quaternion must be to returnNone
.
pub fn conjugate_mut(&mut self)
[src]
pub fn conjugate_mut(&mut self)
Compute the conjugate of this unit quaternion in-place.
pub fn inverse_mut(&mut self)
[src]
pub fn inverse_mut(&mut self)
Inverts this quaternion if it is not zero.
Example
let axisangle = Vector3::new(0.1, 0.2, 0.3); let mut rot = UnitQuaternion::new(axisangle); rot.inverse_mut(); assert_relative_eq!(rot * UnitQuaternion::new(axisangle), UnitQuaternion::identity()); assert_relative_eq!(UnitQuaternion::new(axisangle) * rot, UnitQuaternion::identity());
pub fn axis(
&self
) -> Option<Unit<Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>>>
[src]
pub fn axis(
&self
) -> Option<Unit<Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>>>
The rotation axis of this unit quaternion or None
if the rotation is zero.
Example
let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0)); let angle = 1.2; let rot = UnitQuaternion::from_axis_angle(&axis, angle); assert_eq!(rot.axis(), Some(axis)); // Case with a zero angle. let rot = UnitQuaternion::from_axis_angle(&axis, 0.0); assert!(rot.axis().is_none());
pub fn scaled_axis(
&self
) -> Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
[src]
pub fn scaled_axis(
&self
) -> Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
The rotation axis of this unit quaternion multiplied by the rotation angle.
Example
let axisangle = Vector3::new(0.1, 0.2, 0.3); let rot = UnitQuaternion::new(axisangle); assert_relative_eq!(rot.scaled_axis(), axisangle, epsilon = 1.0e-6);
pub fn axis_angle(
&self
) -> Option<(Unit<Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>>, N)>
[src]
pub fn axis_angle(
&self
) -> Option<(Unit<Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>>, 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 = UnitQuaternion::from_axis_angle(&axis, angle); assert_eq!(rot.axis_angle(), Some((axis, angle))); // Case with a zero angle. let rot = UnitQuaternion::from_axis_angle(&axis, 0.0); assert!(rot.axis_angle().is_none());
pub fn exp(&self) -> Quaternion<N>
[src]
pub fn exp(&self) -> Quaternion<N>
Compute the exponential of a quaternion.
Note that this function yields a Quaternion<N>
because it looses the unit property.
pub fn ln(&self) -> Quaternion<N>
[src]
pub fn ln(&self) -> Quaternion<N>
Compute the natural logarithm of a quaternion.
Note that this function yields a Quaternion<N>
because it looses the unit property.
The vector part of the return value corresponds to the axis-angle representation (divided
by 2.0) of this unit quaternion.
Example
let axisangle = Vector3::new(0.1, 0.2, 0.3); let q = UnitQuaternion::new(axisangle); assert_relative_eq!(q.ln().vector().into_owned(), axisangle, epsilon = 1.0e-6);
pub fn powf(&self, n: N) -> Unit<Quaternion<N>>
[src]
pub fn powf(&self, n: N) -> Unit<Quaternion<N>>
Raise the quaternion to a given floating power.
This returns the unit quaternion that identifies a rotation with axis self.axis()
and
angle self.angle() × n
.
Example
let axis = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0)); let angle = 1.2; let rot = UnitQuaternion::from_axis_angle(&axis, angle); let pow = rot.powf(2.0); assert_relative_eq!(pow.axis().unwrap(), axis, epsilon = 1.0e-6); assert_eq!(pow.angle(), 2.4);
pub fn to_rotation_matrix(&self) -> Rotation<N, U3>
[src]
pub fn to_rotation_matrix(&self) -> Rotation<N, U3>
Builds a rotation matrix from this unit quaternion.
Example
let q = UnitQuaternion::from_axis_angle(&Vector3::z_axis(), f32::consts::FRAC_PI_6); let rot = q.to_rotation_matrix(); let expected = Matrix3::new(0.8660254, -0.5, 0.0, 0.5, 0.8660254, 0.0, 0.0, 0.0, 1.0); assert_relative_eq!(*rot.matrix(), expected, epsilon = 1.0e-6);
pub fn to_euler_angles(&self) -> (N, N, N)
[src]
pub fn to_euler_angles(&self) -> (N, N, N)
: This is renamed to use .euler_angles()
.
Converts this unit quaternion into its equivalent Euler angles.
The angles are produced in the form (roll, pitch, yaw).
pub fn euler_angles(&self) -> (N, N, N)
[src]
pub fn euler_angles(&self) -> (N, N, N)
Retrieves the euler angles corresponding to this unit quaternion.
The angles are produced in the form (roll, pitch, yaw).
Example
let rot = UnitQuaternion::from_euler_angles(0.1, 0.2, 0.3); let euler = rot.euler_angles(); assert_relative_eq!(euler.0, 0.1, epsilon = 1.0e-6); assert_relative_eq!(euler.1, 0.2, epsilon = 1.0e-6); assert_relative_eq!(euler.2, 0.3, epsilon = 1.0e-6);
pub fn to_homogeneous(
&self
) -> Matrix<N, U4, U4, <DefaultAllocator as Allocator<N, U4, U4>>::Buffer>
[src]
pub fn to_homogeneous(
&self
) -> Matrix<N, U4, U4, <DefaultAllocator as Allocator<N, U4, U4>>::Buffer>
Converts this unit quaternion into its equivalent homogeneous transformation matrix.
Example
let rot = UnitQuaternion::from_axis_angle(&Vector3::z_axis(), f32::consts::FRAC_PI_6); let expected = Matrix4::new(0.8660254, -0.5, 0.0, 0.0, 0.5, 0.8660254, 0.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 0.0, 1.0); assert_relative_eq!(rot.to_homogeneous(), expected, epsilon = 1.0e-6);
impl<N> Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> Unit<Quaternion<N>> where
N: Real,
pub fn identity() -> Unit<Quaternion<N>>
[src]
pub fn identity() -> Unit<Quaternion<N>>
The rotation identity.
Example
let q = UnitQuaternion::identity(); let q2 = UnitQuaternion::new(Vector3::new(1.0, 2.0, 3.0)); let v = Vector3::new_random(); let p = Point3::from(v); assert_eq!(q * q2, q2); assert_eq!(q2 * q, q2); assert_eq!(q * v, v); assert_eq!(q * p, p);
pub fn from_axis_angle<SB>(
axis: &Unit<Matrix<N, U3, U1, SB>>,
angle: N
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
[src]
pub fn from_axis_angle<SB>(
axis: &Unit<Matrix<N, U3, U1, SB>>,
angle: N
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
Creates a new quaternion from a unit vector (the rotation axis) and an angle (the rotation angle).
Example
let axis = Vector3::y_axis(); let angle = f32::consts::FRAC_PI_2; // Point and vector being transformed in the tests. let pt = Point3::new(4.0, 5.0, 6.0); let vec = Vector3::new(4.0, 5.0, 6.0); let q = UnitQuaternion::from_axis_angle(&axis, angle); assert_eq!(q.axis().unwrap(), axis); assert_eq!(q.angle(), angle); assert_relative_eq!(q * pt, Point3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6); assert_relative_eq!(q * vec, Vector3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6); // A zero vector yields an identity. assert_eq!(UnitQuaternion::from_scaled_axis(Vector3::<f32>::zeros()), UnitQuaternion::identity());
pub fn from_quaternion(q: Quaternion<N>) -> Unit<Quaternion<N>>
[src]
pub fn from_quaternion(q: Quaternion<N>) -> Unit<Quaternion<N>>
Creates a new unit quaternion from a quaternion.
The input quaternion will be normalized.
pub fn from_euler_angles(roll: N, pitch: N, yaw: N) -> Unit<Quaternion<N>>
[src]
pub fn from_euler_angles(roll: N, pitch: N, yaw: N) -> Unit<Quaternion<N>>
Creates a new unit quaternion from Euler angles.
The primitive rotations are applied in order: 1 roll − 2 pitch − 3 yaw.
Example
let rot = UnitQuaternion::from_euler_angles(0.1, 0.2, 0.3); let euler = rot.euler_angles(); assert_relative_eq!(euler.0, 0.1, epsilon = 1.0e-6); assert_relative_eq!(euler.1, 0.2, epsilon = 1.0e-6); assert_relative_eq!(euler.2, 0.3, epsilon = 1.0e-6);
pub fn from_rotation_matrix(rotmat: &Rotation<N, U3>) -> Unit<Quaternion<N>>
[src]
pub fn from_rotation_matrix(rotmat: &Rotation<N, U3>) -> Unit<Quaternion<N>>
Builds an unit quaternion from a rotation matrix.
Example
let axis = Vector3::y_axis(); let angle = 0.1; let rot = Rotation3::from_axis_angle(&axis, angle); let q = UnitQuaternion::from_rotation_matrix(&rot); assert_relative_eq!(q.to_rotation_matrix(), rot, epsilon = 1.0e-6); assert_relative_eq!(q.axis().unwrap(), rot.axis().unwrap(), epsilon = 1.0e-6); assert_relative_eq!(q.angle(), rot.angle(), epsilon = 1.0e-6);
pub fn rotation_between<SB, SC>(
a: &Matrix<N, U3, U1, SB>,
b: &Matrix<N, U3, U1, SC>
) -> Option<Unit<Quaternion<N>>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
[src]
pub fn rotation_between<SB, SC>(
a: &Matrix<N, U3, U1, SB>,
b: &Matrix<N, U3, U1, SC>
) -> Option<Unit<Quaternion<N>>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
The unit quaternion needed to make a
and b
be collinear and point toward the same
direction.
Example
let a = Vector3::new(1.0, 2.0, 3.0); let b = Vector3::new(3.0, 1.0, 2.0); let q = UnitQuaternion::rotation_between(&a, &b).unwrap(); assert_relative_eq!(q * a, b); assert_relative_eq!(q.inverse() * b, a);
pub fn scaled_rotation_between<SB, SC>(
a: &Matrix<N, U3, U1, SB>,
b: &Matrix<N, U3, U1, SC>,
s: N
) -> Option<Unit<Quaternion<N>>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
[src]
pub fn scaled_rotation_between<SB, SC>(
a: &Matrix<N, U3, U1, SB>,
b: &Matrix<N, U3, U1, SC>,
s: N
) -> Option<Unit<Quaternion<N>>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
The smallest rotation needed to make a
and b
collinear and point toward the same
direction, raised to the power s
.
Example
let a = Vector3::new(1.0, 2.0, 3.0); let b = Vector3::new(3.0, 1.0, 2.0); let q2 = UnitQuaternion::scaled_rotation_between(&a, &b, 0.2).unwrap(); let q5 = UnitQuaternion::scaled_rotation_between(&a, &b, 0.5).unwrap(); assert_relative_eq!(q2 * q2 * q2 * q2 * q2 * a, b, epsilon = 1.0e-6); assert_relative_eq!(q5 * q5 * a, b, epsilon = 1.0e-6);
pub fn rotation_between_axis<SB, SC>(
a: &Unit<Matrix<N, U3, U1, SB>>,
b: &Unit<Matrix<N, U3, U1, SC>>
) -> Option<Unit<Quaternion<N>>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
[src]
pub fn rotation_between_axis<SB, SC>(
a: &Unit<Matrix<N, U3, U1, SB>>,
b: &Unit<Matrix<N, U3, U1, SC>>
) -> Option<Unit<Quaternion<N>>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
The unit quaternion needed to make a
and b
be collinear and point toward the same
direction.
Example
let a = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0)); let b = Unit::new_normalize(Vector3::new(3.0, 1.0, 2.0)); let q = UnitQuaternion::rotation_between(&a, &b).unwrap(); assert_relative_eq!(q * a, b); assert_relative_eq!(q.inverse() * b, a);
pub fn scaled_rotation_between_axis<SB, SC>(
na: &Unit<Matrix<N, U3, U1, SB>>,
nb: &Unit<Matrix<N, U3, U1, SC>>,
s: N
) -> Option<Unit<Quaternion<N>>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
[src]
pub fn scaled_rotation_between_axis<SB, SC>(
na: &Unit<Matrix<N, U3, U1, SB>>,
nb: &Unit<Matrix<N, U3, U1, SC>>,
s: N
) -> Option<Unit<Quaternion<N>>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
The smallest rotation needed to make a
and b
collinear and point toward the same
direction, raised to the power s
.
Example
let a = Unit::new_normalize(Vector3::new(1.0, 2.0, 3.0)); let b = Unit::new_normalize(Vector3::new(3.0, 1.0, 2.0)); let q2 = UnitQuaternion::scaled_rotation_between(&a, &b, 0.2).unwrap(); let q5 = UnitQuaternion::scaled_rotation_between(&a, &b, 0.5).unwrap(); assert_relative_eq!(q2 * q2 * q2 * q2 * q2 * a, b, epsilon = 1.0e-6); assert_relative_eq!(q5 * q5 * a, b, epsilon = 1.0e-6);
pub fn new_observer_frame<SB, SC>(
dir: &Matrix<N, U3, U1, SB>,
up: &Matrix<N, U3, U1, SC>
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
[src]
pub fn new_observer_frame<SB, SC>(
dir: &Matrix<N, U3, U1, SB>,
up: &Matrix<N, U3, U1, SC>
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
Creates an unit quaternion that corresponds to the local frame of an observer standing at the
origin and looking toward dir
.
It maps the z
axis to the direction dir
.
Arguments
- dir - The look direction. It does not need to be normalized.
- up - The vertical direction. It does not need to be normalized.
The only requirement of this parameter is to not be collinear to
dir
. Non-collinearity is not checked.
Example
let dir = Vector3::new(1.0, 2.0, 3.0); let up = Vector3::y(); let q = UnitQuaternion::new_observer_frame(&dir, &up); assert_relative_eq!(q * Vector3::z(), dir.normalize());
pub fn look_at_rh<SB, SC>(
dir: &Matrix<N, U3, U1, SB>,
up: &Matrix<N, U3, U1, SC>
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
[src]
pub fn look_at_rh<SB, SC>(
dir: &Matrix<N, U3, U1, SB>,
up: &Matrix<N, U3, U1, SC>
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
Builds a right-handed look-at view matrix without translation.
It maps the view direction dir
to the negative z
axis.
This conforms to the common notion of right handed look-at matrix from the computer
graphics community.
Arguments
- dir − The view direction. It does not need to be normalized.
- up - A vector approximately aligned with required the vertical axis. It does not need
to be normalized. The only requirement of this parameter is to not be collinear to
dir
.
Example
let dir = Vector3::new(1.0, 2.0, 3.0); let up = Vector3::y(); let q = UnitQuaternion::look_at_rh(&dir, &up); assert_relative_eq!(q * dir.normalize(), -Vector3::z());
pub fn look_at_lh<SB, SC>(
dir: &Matrix<N, U3, U1, SB>,
up: &Matrix<N, U3, U1, SC>
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
[src]
pub fn look_at_lh<SB, SC>(
dir: &Matrix<N, U3, U1, SB>,
up: &Matrix<N, U3, U1, SC>
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
SC: Storage<N, U3, U1>,
Builds a left-handed look-at view matrix without translation.
It maps the view direction dir
to the positive z
axis.
This conforms to the common notion of left handed look-at matrix from the computer
graphics community.
Arguments
- dir − The view direction. It does not need to be normalized.
- up - A vector approximately aligned with required the vertical axis. The only
requirement of this parameter is to not be collinear to
dir
.
Example
let dir = Vector3::new(1.0, 2.0, 3.0); let up = Vector3::y(); let q = UnitQuaternion::look_at_lh(&dir, &up); assert_relative_eq!(q * dir.normalize(), Vector3::z());
pub fn new<SB>(axisangle: Matrix<N, U3, U1, SB>) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
[src]
pub fn new<SB>(axisangle: Matrix<N, U3, U1, SB>) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
Creates a new unit quaternion rotation from a rotation axis scaled by the rotation angle.
If axisangle
has a magnitude smaller than N::default_epsilon()
, this returns the identity rotation.
Example
let axisangle = Vector3::y() * f32::consts::FRAC_PI_2; // Point and vector being transformed in the tests. let pt = Point3::new(4.0, 5.0, 6.0); let vec = Vector3::new(4.0, 5.0, 6.0); let q = UnitQuaternion::new(axisangle); assert_relative_eq!(q * pt, Point3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6); assert_relative_eq!(q * vec, Vector3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6); // A zero vector yields an identity. assert_eq!(UnitQuaternion::new(Vector3::<f32>::zeros()), UnitQuaternion::identity());
pub fn new_eps<SB>(
axisangle: Matrix<N, U3, U1, SB>,
eps: N
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
[src]
pub fn new_eps<SB>(
axisangle: Matrix<N, U3, U1, SB>,
eps: N
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
Creates a new unit quaternion rotation from a rotation axis scaled by the rotation angle.
If axisangle
has a magnitude smaller than eps
, this returns the identity rotation.
Example
let axisangle = Vector3::y() * f32::consts::FRAC_PI_2; // Point and vector being transformed in the tests. let pt = Point3::new(4.0, 5.0, 6.0); let vec = Vector3::new(4.0, 5.0, 6.0); let q = UnitQuaternion::new_eps(axisangle, 1.0e-6); assert_relative_eq!(q * pt, Point3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6); assert_relative_eq!(q * vec, Vector3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6); // An almost zero vector yields an identity. assert_eq!(UnitQuaternion::new_eps(Vector3::new(1.0e-8, 1.0e-9, 1.0e-7), 1.0e-6), UnitQuaternion::identity());
pub fn from_scaled_axis<SB>(
axisangle: Matrix<N, U3, U1, SB>
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
[src]
pub fn from_scaled_axis<SB>(
axisangle: Matrix<N, U3, U1, SB>
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
Creates a new unit quaternion rotation from a rotation axis scaled by the rotation angle.
If axisangle
has a magnitude smaller than N::default_epsilon()
, this returns the identity rotation.
Same as Self::new(axisangle)
.
Example
let axisangle = Vector3::y() * f32::consts::FRAC_PI_2; // Point and vector being transformed in the tests. let pt = Point3::new(4.0, 5.0, 6.0); let vec = Vector3::new(4.0, 5.0, 6.0); let q = UnitQuaternion::from_scaled_axis(axisangle); assert_relative_eq!(q * pt, Point3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6); assert_relative_eq!(q * vec, Vector3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6); // A zero vector yields an identity. assert_eq!(UnitQuaternion::from_scaled_axis(Vector3::<f32>::zeros()), UnitQuaternion::identity());
pub fn from_scaled_axis_eps<SB>(
axisangle: Matrix<N, U3, U1, SB>,
eps: N
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
[src]
pub fn from_scaled_axis_eps<SB>(
axisangle: Matrix<N, U3, U1, SB>,
eps: N
) -> Unit<Quaternion<N>> where
SB: Storage<N, U3, U1>,
Creates a new unit quaternion rotation from a rotation axis scaled by the rotation angle.
If axisangle
has a magnitude smaller than eps
, this returns the identity rotation.
Same as Self::new_eps(axisangle, eps)
.
Example
let axisangle = Vector3::y() * f32::consts::FRAC_PI_2; // Point and vector being transformed in the tests. let pt = Point3::new(4.0, 5.0, 6.0); let vec = Vector3::new(4.0, 5.0, 6.0); let q = UnitQuaternion::from_scaled_axis_eps(axisangle, 1.0e-6); assert_relative_eq!(q * pt, Point3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6); assert_relative_eq!(q * vec, Vector3::new(6.0, 5.0, -4.0), epsilon = 1.0e-6); // An almost zero vector yields an identity. assert_eq!(UnitQuaternion::from_scaled_axis_eps(Vector3::new(1.0e-8, 1.0e-9, 1.0e-7), 1.0e-6), UnitQuaternion::identity());
impl<N> Unit<Complex<N>> where
N: Real,
[src]
impl<N> Unit<Complex<N>> where
N: Real,
pub fn angle(&self) -> N
[src]
pub fn angle(&self) -> N
The rotation angle in ]-pi; pi]
of this unit complex number.
Example
let rot = UnitComplex::new(1.78); assert_eq!(rot.angle(), 1.78);
pub fn sin_angle(&self) -> N
[src]
pub fn sin_angle(&self) -> N
The sine of the rotation angle.
Example
let angle = 1.78f32; let rot = UnitComplex::new(angle); assert_eq!(rot.sin_angle(), angle.sin());
pub fn cos_angle(&self) -> N
[src]
pub fn cos_angle(&self) -> N
The cosine of the rotation angle.
Example
let angle = 1.78f32; let rot = UnitComplex::new(angle); assert_eq!(rot.cos_angle(),angle.cos());
pub fn scaled_axis(
&self
) -> Matrix<N, U1, U1, <DefaultAllocator as Allocator<N, U1, U1>>::Buffer>
[src]
pub fn scaled_axis(
&self
) -> Matrix<N, U1, U1, <DefaultAllocator as Allocator<N, U1, U1>>::Buffer>
The rotation angle returned as a 1-dimensional vector.
This is generally used in the context of generic programming. Using
the .angle()
method instead is more common.
pub fn axis_angle(
&self
) -> Option<(Unit<Matrix<N, U1, U1, <DefaultAllocator as Allocator<N, U1, U1>>::Buffer>>, N)>
[src]
pub fn axis_angle(
&self
) -> Option<(Unit<Matrix<N, U1, U1, <DefaultAllocator as Allocator<N, U1, U1>>::Buffer>>, N)>
The rotation axis and angle in ]0, pi] of this complex number.
This is generally used in the context of generic programming. Using
the .angle()
method instead is more common.
Returns None
if the angle is zero.
pub fn complex(&self) -> &Complex<N>
[src]
pub fn complex(&self) -> &Complex<N>
The underlying complex number.
Same as self.as_ref()
.
Example
let angle = 1.78f32; let rot = UnitComplex::new(angle); assert_eq!(*rot.complex(), Complex::new(angle.cos(), angle.sin()));
pub fn conjugate(&self) -> Unit<Complex<N>>
[src]
pub fn conjugate(&self) -> Unit<Complex<N>>
Compute the conjugate of this unit complex number.
Example
let rot = UnitComplex::new(1.78); let conj = rot.conjugate(); assert_eq!(rot.complex().im, -conj.complex().im); assert_eq!(rot.complex().re, conj.complex().re);
pub fn inverse(&self) -> Unit<Complex<N>>
[src]
pub fn inverse(&self) -> Unit<Complex<N>>
Inverts this complex number if it is not zero.
Example
let rot = UnitComplex::new(1.2); let inv = rot.inverse(); assert_relative_eq!(rot * inv, UnitComplex::identity(), epsilon = 1.0e-6); assert_relative_eq!(inv * rot, UnitComplex::identity(), epsilon = 1.0e-6);
pub fn angle_to(&self, other: &Unit<Complex<N>>) -> N
[src]
pub fn angle_to(&self, other: &Unit<Complex<N>>) -> N
The rotation angle needed to make self
and other
coincide.
Example
let rot1 = UnitComplex::new(0.1); let rot2 = UnitComplex::new(1.7); assert_relative_eq!(rot1.angle_to(&rot2), 1.6);
pub fn rotation_to(&self, other: &Unit<Complex<N>>) -> Unit<Complex<N>>
[src]
pub fn rotation_to(&self, other: &Unit<Complex<N>>) -> Unit<Complex<N>>
The unit complex number needed to make self
and other
coincide.
The result is such that: self.rotation_to(other) * self == other
.
Example
let rot1 = UnitComplex::new(0.1); let rot2 = UnitComplex::new(1.7); let rot_to = rot1.rotation_to(&rot2); assert_relative_eq!(rot_to * rot1, rot2); assert_relative_eq!(rot_to.inverse() * rot2, rot1);
pub fn conjugate_mut(&mut self)
[src]
pub fn conjugate_mut(&mut self)
Compute in-place the conjugate of this unit complex number.
Example
let angle = 1.7; let rot = UnitComplex::new(angle); let mut conj = UnitComplex::new(angle); conj.conjugate_mut(); assert_eq!(rot.complex().im, -conj.complex().im); assert_eq!(rot.complex().re, conj.complex().re);
pub fn inverse_mut(&mut self)
[src]
pub fn inverse_mut(&mut self)
Inverts in-place this unit complex number.
Example
let angle = 1.7; let mut rot = UnitComplex::new(angle); rot.inverse_mut(); assert_relative_eq!(rot * UnitComplex::new(angle), UnitComplex::identity()); assert_relative_eq!(UnitComplex::new(angle) * rot, UnitComplex::identity());
pub fn powf(&self, n: N) -> Unit<Complex<N>>
[src]
pub fn powf(&self, n: N) -> Unit<Complex<N>>
Raise this unit complex number to a given floating power.
This returns the unit complex number that identifies a rotation angle equal to
self.angle() × n
.
Example
let rot = UnitComplex::new(0.78); let pow = rot.powf(2.0); assert_eq!(pow.angle(), 2.0 * 0.78);
pub fn to_rotation_matrix(&self) -> Rotation<N, U2>
[src]
pub fn to_rotation_matrix(&self) -> Rotation<N, U2>
Builds the rotation matrix corresponding to this unit complex number.
Example
let rot = UnitComplex::new(f32::consts::FRAC_PI_6); let expected = Rotation2::new(f32::consts::FRAC_PI_6); assert_eq!(rot.to_rotation_matrix(), expected);
pub fn to_homogeneous(
&self
) -> Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer>
[src]
pub fn to_homogeneous(
&self
) -> Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer>
Converts this unit complex number into its equivalent homogeneous transformation matrix.
Example
let rot = UnitComplex::new(f32::consts::FRAC_PI_6); let expected = Matrix3::new(0.8660254, -0.5, 0.0, 0.5, 0.8660254, 0.0, 0.0, 0.0, 1.0); assert_eq!(rot.to_homogeneous(), expected);
impl<N> Unit<Complex<N>> where
N: Real,
[src]
impl<N> Unit<Complex<N>> where
N: Real,
pub fn identity() -> Unit<Complex<N>>
[src]
pub fn identity() -> Unit<Complex<N>>
The unit complex number multiplicative identity.
Example
let rot1 = UnitComplex::identity(); let rot2 = UnitComplex::new(1.7); assert_eq!(rot1 * rot2, rot2); assert_eq!(rot2 * rot1, rot2);
pub fn new(angle: N) -> Unit<Complex<N>>
[src]
pub fn new(angle: N) -> Unit<Complex<N>>
Builds the unit complex number corresponding to the rotation with the given angle.
Example
let rot = UnitComplex::new(f32::consts::FRAC_PI_2); assert_relative_eq!(rot * Point2::new(3.0, 4.0), Point2::new(-4.0, 3.0));
pub fn from_angle(angle: N) -> Unit<Complex<N>>
[src]
pub fn from_angle(angle: N) -> Unit<Complex<N>>
Builds the unit complex number corresponding to the rotation with the angle.
Same as Self::new(angle)
.
Example
let rot = UnitComplex::from_angle(f32::consts::FRAC_PI_2); assert_relative_eq!(rot * Point2::new(3.0, 4.0), Point2::new(-4.0, 3.0));
pub fn from_cos_sin_unchecked(cos: N, sin: N) -> Unit<Complex<N>>
[src]
pub fn from_cos_sin_unchecked(cos: N, sin: N) -> Unit<Complex<N>>
Builds the unit complex number from the sinus and cosinus of the rotation angle.
The input values are not checked to actually be cosines and sine of the same value.
Is is generally preferable to use the ::new(angle)
constructor instead.
Example
let angle = f32::consts::FRAC_PI_2; let rot = UnitComplex::from_cos_sin_unchecked(angle.cos(), angle.sin()); assert_relative_eq!(rot * Point2::new(3.0, 4.0), Point2::new(-4.0, 3.0));
pub fn from_scaled_axis<SB>(
axisangle: Matrix<N, U1, U1, SB>
) -> Unit<Complex<N>> where
SB: Storage<N, U1, U1>,
[src]
pub fn from_scaled_axis<SB>(
axisangle: Matrix<N, U1, U1, SB>
) -> Unit<Complex<N>> where
SB: Storage<N, U1, U1>,
Builds a unit complex rotation from an angle in radian wrapped in a 1-dimensional vector.
This is generally used in the context of generic programming. Using
the ::new(angle)
method instead is more common.
pub fn from_complex(q: Complex<N>) -> Unit<Complex<N>>
[src]
pub fn from_complex(q: Complex<N>) -> Unit<Complex<N>>
Creates a new unit complex number from a complex number.
The input complex number will be normalized.
pub fn from_complex_and_get(q: Complex<N>) -> (Unit<Complex<N>>, N)
[src]
pub fn from_complex_and_get(q: Complex<N>) -> (Unit<Complex<N>>, N)
Creates a new unit complex number from a complex number.
The input complex number will be normalized. Returns the norm of the complex number as well.
pub fn from_rotation_matrix(rotmat: &Rotation<N, U2>) -> Unit<Complex<N>>
[src]
pub fn from_rotation_matrix(rotmat: &Rotation<N, U2>) -> Unit<Complex<N>>
Builds the unit complex number from the corresponding 2D rotation matrix.
Example
let rot = Rotation2::new(1.7); let complex = UnitComplex::from_rotation_matrix(&rot); assert_eq!(complex, UnitComplex::new(1.7));
pub fn rotation_between<SB, SC>(
a: &Matrix<N, U2, U1, SB>,
b: &Matrix<N, U2, U1, SC>
) -> Unit<Complex<N>> where
SB: Storage<N, U2, U1>,
SC: Storage<N, U2, U1>,
[src]
pub fn rotation_between<SB, SC>(
a: &Matrix<N, U2, U1, SB>,
b: &Matrix<N, U2, U1, SC>
) -> Unit<Complex<N>> where
SB: Storage<N, U2, U1>,
SC: Storage<N, U2, U1>,
The unit complex needed to make a
and b
be collinear and point toward the same
direction.
Example
let a = Vector2::new(1.0, 2.0); let b = Vector2::new(2.0, 1.0); let rot = UnitComplex::rotation_between(&a, &b); assert_relative_eq!(rot * a, b); assert_relative_eq!(rot.inverse() * b, a);
pub fn scaled_rotation_between<SB, SC>(
a: &Matrix<N, U2, U1, SB>,
b: &Matrix<N, U2, U1, SC>,
s: N
) -> Unit<Complex<N>> where
SB: Storage<N, U2, U1>,
SC: Storage<N, U2, U1>,
[src]
pub fn scaled_rotation_between<SB, SC>(
a: &Matrix<N, U2, U1, SB>,
b: &Matrix<N, U2, U1, SC>,
s: N
) -> Unit<Complex<N>> where
SB: Storage<N, U2, U1>,
SC: Storage<N, U2, U1>,
The smallest rotation needed to make a
and b
collinear and point toward the same
direction, raised to the power s
.
Example
let a = Vector2::new(1.0, 2.0); let b = Vector2::new(2.0, 1.0); let rot2 = UnitComplex::scaled_rotation_between(&a, &b, 0.2); let rot5 = UnitComplex::scaled_rotation_between(&a, &b, 0.5); assert_relative_eq!(rot2 * rot2 * rot2 * rot2 * rot2 * a, b, epsilon = 1.0e-6); assert_relative_eq!(rot5 * rot5 * a, b, epsilon = 1.0e-6);
pub fn rotation_between_axis<SB, SC>(
a: &Unit<Matrix<N, U2, U1, SB>>,
b: &Unit<Matrix<N, U2, U1, SC>>
) -> Unit<Complex<N>> where
SB: Storage<N, U2, U1>,
SC: Storage<N, U2, U1>,
[src]
pub fn rotation_between_axis<SB, SC>(
a: &Unit<Matrix<N, U2, U1, SB>>,
b: &Unit<Matrix<N, U2, U1, SC>>
) -> Unit<Complex<N>> where
SB: Storage<N, U2, U1>,
SC: Storage<N, U2, U1>,
The unit complex needed to make a
and b
be collinear and point toward the same
direction.
Example
let a = Unit::new_normalize(Vector2::new(1.0, 2.0)); let b = Unit::new_normalize(Vector2::new(2.0, 1.0)); let rot = UnitComplex::rotation_between_axis(&a, &b); assert_relative_eq!(rot * a, b); assert_relative_eq!(rot.inverse() * b, a);
pub fn scaled_rotation_between_axis<SB, SC>(
na: &Unit<Matrix<N, U2, U1, SB>>,
nb: &Unit<Matrix<N, U2, U1, SC>>,
s: N
) -> Unit<Complex<N>> where
SB: Storage<N, U2, U1>,
SC: Storage<N, U2, U1>,
[src]
pub fn scaled_rotation_between_axis<SB, SC>(
na: &Unit<Matrix<N, U2, U1, SB>>,
nb: &Unit<Matrix<N, U2, U1, SC>>,
s: N
) -> Unit<Complex<N>> where
SB: Storage<N, U2, U1>,
SC: Storage<N, U2, U1>,
The smallest rotation needed to make a
and b
collinear and point toward the same
direction, raised to the power s
.
Example
let a = Unit::new_normalize(Vector2::new(1.0, 2.0)); let b = Unit::new_normalize(Vector2::new(2.0, 1.0)); let rot2 = UnitComplex::scaled_rotation_between_axis(&a, &b, 0.2); let rot5 = UnitComplex::scaled_rotation_between_axis(&a, &b, 0.5); assert_relative_eq!(rot2 * rot2 * rot2 * rot2 * rot2 * a, b, epsilon = 1.0e-6); assert_relative_eq!(rot5 * rot5 * a, b, epsilon = 1.0e-6);
impl<N> Unit<Complex<N>> where
N: Real,
[src]
impl<N> Unit<Complex<N>> where
N: Real,
pub fn rotate<R2, C2, S2>(&self, rhs: &mut Matrix<N, R2, C2, S2>) where
C2: Dim,
R2: Dim,
S2: StorageMut<N, R2, C2>,
ShapeConstraint: DimEq<R2, U2>,
[src]
pub fn rotate<R2, C2, S2>(&self, rhs: &mut Matrix<N, R2, C2, S2>) where
C2: Dim,
R2: Dim,
S2: StorageMut<N, R2, C2>,
ShapeConstraint: DimEq<R2, U2>,
Performs the multiplication rhs = self * rhs
in-place.
pub fn rotate_rows<R2, C2, S2>(&self, lhs: &mut Matrix<N, R2, C2, S2>) where
C2: Dim,
R2: Dim,
S2: StorageMut<N, R2, C2>,
ShapeConstraint: DimEq<C2, U2>,
[src]
pub fn rotate_rows<R2, C2, S2>(&self, lhs: &mut Matrix<N, R2, C2, S2>) where
C2: Dim,
R2: Dim,
S2: StorageMut<N, R2, C2>,
ShapeConstraint: DimEq<C2, U2>,
Performs the multiplication lhs = lhs * self
in-place.
Trait Implementations
impl<N> From<Unit<Quaternion<N>>> for Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer> where
N: Real,
[src]
impl<N> From<Unit<Quaternion<N>>> for Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer> where
N: Real,
fn from(
q: Unit<Quaternion<N>>
) -> Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer>
[src]
fn from(
q: Unit<Quaternion<N>>
) -> Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer>
impl<N> From<Unit<Complex<N>>> for Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer> where
N: Real,
[src]
impl<N> From<Unit<Complex<N>>> for Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer> where
N: Real,
fn from(
q: Unit<Complex<N>>
) -> Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer>
[src]
fn from(
q: Unit<Complex<N>>
) -> Matrix<N, U3, U3, <DefaultAllocator as Allocator<N, U3, U3>>::Buffer>
impl<N> From<Unit<Complex<N>>> for Matrix<N, U2, U2, <DefaultAllocator as Allocator<N, U2, U2>>::Buffer> where
N: Real,
[src]
impl<N> From<Unit<Complex<N>>> for Matrix<N, U2, U2, <DefaultAllocator as Allocator<N, U2, U2>>::Buffer> where
N: Real,
fn from(
q: Unit<Complex<N>>
) -> Matrix<N, U2, U2, <DefaultAllocator as Allocator<N, U2, U2>>::Buffer>
[src]
fn from(
q: Unit<Complex<N>>
) -> Matrix<N, U2, U2, <DefaultAllocator as Allocator<N, U2, U2>>::Buffer>
impl<N> From<Unit<Quaternion<N>>> for Matrix<N, U4, U4, <DefaultAllocator as Allocator<N, U4, U4>>::Buffer> where
N: Real,
[src]
impl<N> From<Unit<Quaternion<N>>> for Matrix<N, U4, U4, <DefaultAllocator as Allocator<N, U4, U4>>::Buffer> where
N: Real,
fn from(
q: Unit<Quaternion<N>>
) -> Matrix<N, U4, U4, <DefaultAllocator as Allocator<N, U4, U4>>::Buffer>
[src]
fn from(
q: Unit<Quaternion<N>>
) -> Matrix<N, U4, U4, <DefaultAllocator as Allocator<N, U4, U4>>::Buffer>
impl<T> PartialEq<Unit<T>> for Unit<T> where
T: PartialEq<T>,
[src]
impl<T> PartialEq<Unit<T>> for Unit<T> where
T: PartialEq<T>,
impl<N> Rotation<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> Rotation<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
fn powf(&self, n: N) -> Option<Unit<Complex<N>>>
[src]
fn powf(&self, n: N) -> Option<Unit<Complex<N>>>
fn rotation_between(
a: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>,
b: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
) -> Option<Unit<Complex<N>>>
[src]
fn rotation_between(
a: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>,
b: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
) -> Option<Unit<Complex<N>>>
fn scaled_rotation_between(
a: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>,
b: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>,
s: N
) -> Option<Unit<Complex<N>>>
[src]
fn scaled_rotation_between(
a: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>,
b: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>,
s: N
) -> Option<Unit<Complex<N>>>
impl<N> Rotation<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> Rotation<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
fn powf(&self, n: N) -> Option<Unit<Quaternion<N>>>
[src]
fn powf(&self, n: N) -> Option<Unit<Quaternion<N>>>
fn rotation_between(
a: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>,
b: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
) -> Option<Unit<Quaternion<N>>>
[src]
fn rotation_between(
a: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>,
b: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
) -> Option<Unit<Quaternion<N>>>
fn scaled_rotation_between(
a: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>,
b: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>,
s: N
) -> Option<Unit<Quaternion<N>>>
[src]
fn scaled_rotation_between(
a: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>,
b: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>,
s: N
) -> Option<Unit<Quaternion<N>>>
impl<N> AbstractSemigroup<Multiplicative> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> AbstractSemigroup<Multiplicative> for Unit<Complex<N>> where
N: Real,
fn prop_is_associative_approx(args: (Self, Self, Self)) -> bool where
Self: RelativeEq,
[src]
fn prop_is_associative_approx(args: (Self, Self, Self)) -> bool where
Self: RelativeEq,
Returns true
if associativity holds for the given arguments. Approximate equality is used for verifications. Read more
fn prop_is_associative(args: (Self, Self, Self)) -> bool where
Self: Eq,
[src]
fn prop_is_associative(args: (Self, Self, Self)) -> bool where
Self: Eq,
Returns true
if associativity holds for the given arguments.
impl<N> AbstractSemigroup<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> AbstractSemigroup<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
fn prop_is_associative_approx(args: (Self, Self, Self)) -> bool where
Self: RelativeEq,
[src]
fn prop_is_associative_approx(args: (Self, Self, Self)) -> bool where
Self: RelativeEq,
Returns true
if associativity holds for the given arguments. Approximate equality is used for verifications. Read more
fn prop_is_associative(args: (Self, Self, Self)) -> bool where
Self: Eq,
[src]
fn prop_is_associative(args: (Self, Self, Self)) -> bool where
Self: Eq,
Returns true
if associativity holds for the given arguments.
impl<N> RelativeEq for Unit<Quaternion<N>> where
N: RelativeEq<Epsilon = N> + Real,
[src]
impl<N> RelativeEq for Unit<Quaternion<N>> where
N: RelativeEq<Epsilon = N> + Real,
fn default_max_relative() -> <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon
[src]
fn default_max_relative() -> <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon
fn relative_eq(
&self,
other: &Unit<Quaternion<N>>,
epsilon: <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon,
max_relative: <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon
) -> bool
[src]
fn relative_eq(
&self,
other: &Unit<Quaternion<N>>,
epsilon: <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon,
max_relative: <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon
) -> bool
fn relative_ne(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon
) -> bool
[src]
fn relative_ne(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon
) -> bool
The inverse of ApproxEq::relative_eq
.
impl<N> RelativeEq for Unit<Complex<N>> where
N: Real,
[src]
impl<N> RelativeEq for Unit<Complex<N>> where
N: Real,
fn default_max_relative() -> <Unit<Complex<N>> as AbsDiffEq>::Epsilon
[src]
fn default_max_relative() -> <Unit<Complex<N>> as AbsDiffEq>::Epsilon
fn relative_eq(
&self,
other: &Unit<Complex<N>>,
epsilon: <Unit<Complex<N>> as AbsDiffEq>::Epsilon,
max_relative: <Unit<Complex<N>> as AbsDiffEq>::Epsilon
) -> bool
[src]
fn relative_eq(
&self,
other: &Unit<Complex<N>>,
epsilon: <Unit<Complex<N>> as AbsDiffEq>::Epsilon,
max_relative: <Unit<Complex<N>> as AbsDiffEq>::Epsilon
) -> bool
fn relative_ne(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon
) -> bool
[src]
fn relative_ne(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon
) -> bool
The inverse of ApproxEq::relative_eq
.
impl<N, R, C, S> RelativeEq for Unit<Matrix<N, R, C, S>> where
C: Dim,
N: Scalar + RelativeEq,
R: Dim,
S: Storage<N, R, C>,
<N as AbsDiffEq>::Epsilon: Copy,
[src]
impl<N, R, C, S> RelativeEq for Unit<Matrix<N, R, C, S>> where
C: Dim,
N: Scalar + RelativeEq,
R: Dim,
S: Storage<N, R, C>,
<N as AbsDiffEq>::Epsilon: Copy,
fn default_max_relative() -> <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon
[src]
fn default_max_relative() -> <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon
fn relative_eq(
&self,
other: &Unit<Matrix<N, R, C, S>>,
epsilon: <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon,
max_relative: <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon
) -> bool
[src]
fn relative_eq(
&self,
other: &Unit<Matrix<N, R, C, S>>,
epsilon: <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon,
max_relative: <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon
) -> bool
fn relative_ne(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon
) -> bool
[src]
fn relative_ne(
&self,
other: &Self,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon
) -> bool
The inverse of ApproxEq::relative_eq
.
impl<N> Display for Unit<Complex<N>> where
N: Display + Real,
[src]
impl<N> Display for Unit<Complex<N>> where
N: Display + Real,
impl<N> Display for Unit<Quaternion<N>> where
N: Display + Real,
[src]
impl<N> Display for Unit<Quaternion<N>> where
N: Display + Real,
impl<N> AbstractLoop<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> AbstractLoop<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
impl<N> AbstractLoop<Multiplicative> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> AbstractLoop<Multiplicative> for Unit<Complex<N>> where
N: Real,
impl<N, C> MulAssign<Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategory,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<N, C> MulAssign<Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategory,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
fn mul_assign(&mut self, rhs: Unit<Quaternion<N>>)
[src]
fn mul_assign(&mut self, rhs: Unit<Quaternion<N>>)
impl<'b, N> MulAssign<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<'b, N> MulAssign<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
fn mul_assign(&mut self, rhs: &'b Rotation<N, U3>)
[src]
fn mul_assign(&mut self, rhs: &'b Rotation<N, U3>)
impl<N> MulAssign<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<N> MulAssign<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
fn mul_assign(&mut self, rhs: Unit<Quaternion<N>>)
[src]
fn mul_assign(&mut self, rhs: Unit<Quaternion<N>>)
impl<N> MulAssign<Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<N> MulAssign<Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
fn mul_assign(&mut self, rhs: Unit<Complex<N>>)
[src]
fn mul_assign(&mut self, rhs: Unit<Complex<N>>)
impl<'b, N> MulAssign<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'b, N> MulAssign<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
fn mul_assign(&mut self, rhs: &'b Unit<Quaternion<N>>)
[src]
fn mul_assign(&mut self, rhs: &'b Unit<Quaternion<N>>)
impl<N> MulAssign<Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<N> MulAssign<Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
fn mul_assign(&mut self, rhs: Rotation<N, U2>)
[src]
fn mul_assign(&mut self, rhs: Rotation<N, U2>)
impl<'b, N, C> MulAssign<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategory,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'b, N, C> MulAssign<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategory,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
fn mul_assign(&mut self, rhs: &'b Unit<Quaternion<N>>)
[src]
fn mul_assign(&mut self, rhs: &'b Unit<Quaternion<N>>)
impl<'b, N> MulAssign<&'b Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'b, N> MulAssign<&'b Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
fn mul_assign(&mut self, rhs: &'b Rotation<N, U2>)
[src]
fn mul_assign(&mut self, rhs: &'b Rotation<N, U2>)
impl<N> MulAssign<Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<N> MulAssign<Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
fn mul_assign(&mut self, rhs: Rotation<N, U3>)
[src]
fn mul_assign(&mut self, rhs: Rotation<N, U3>)
impl<'b, N> MulAssign<&'b Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'b, N> MulAssign<&'b Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
fn mul_assign(&mut self, rhs: &'b Unit<Complex<N>>)
[src]
fn mul_assign(&mut self, rhs: &'b Unit<Complex<N>>)
impl<'b, N> MulAssign<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
[src]
impl<'b, N> MulAssign<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
fn mul_assign(&mut self, rhs: &'b Unit<Complex<N>>)
[src]
fn mul_assign(&mut self, rhs: &'b Unit<Complex<N>>)
impl<N> MulAssign<Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> MulAssign<Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
fn mul_assign(&mut self, rhs: Unit<Complex<N>>)
[src]
fn mul_assign(&mut self, rhs: Unit<Complex<N>>)
impl<N> Transformation<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> Transformation<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
fn transform_point(&self, pt: &Point<N, U3>) -> Point<N, U3>
[src]
fn transform_point(&self, pt: &Point<N, U3>) -> Point<N, U3>
fn transform_vector(
&self,
v: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
) -> Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
[src]
fn transform_vector(
&self,
v: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
) -> Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
impl<N> Transformation<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> Transformation<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
fn transform_point(&self, pt: &Point<N, U2>) -> Point<N, U2>
[src]
fn transform_point(&self, pt: &Point<N, U2>) -> Point<N, U2>
fn transform_vector(
&self,
v: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
) -> Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
[src]
fn transform_vector(
&self,
v: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
) -> Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
impl<N> AffineTransformation<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> AffineTransformation<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Rotation = Unit<Complex<N>>
Type of the first rotation to be applied.
type NonUniformScaling = Id<Multiplicative>
Type of the non-uniform scaling to be applied.
type Translation = Id<Multiplicative>
The type of the pure translation part of this affine transformation.
fn decompose(
&self
) -> (Id<Multiplicative>, Unit<Complex<N>>, Id<Multiplicative>, Unit<Complex<N>>)
[src]
fn decompose(
&self
) -> (Id<Multiplicative>, Unit<Complex<N>>, Id<Multiplicative>, Unit<Complex<N>>)
fn append_translation(
&self,
&<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Translation
) -> Unit<Complex<N>>
[src]
fn append_translation(
&self,
&<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Translation
) -> Unit<Complex<N>>
fn prepend_translation(
&self,
&<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Translation
) -> Unit<Complex<N>>
[src]
fn prepend_translation(
&self,
&<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Translation
) -> Unit<Complex<N>>
fn append_rotation(
&self,
r: &<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Rotation
) -> Unit<Complex<N>>
[src]
fn append_rotation(
&self,
r: &<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Rotation
) -> Unit<Complex<N>>
fn prepend_rotation(
&self,
r: &<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Rotation
) -> Unit<Complex<N>>
[src]
fn prepend_rotation(
&self,
r: &<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::Rotation
) -> Unit<Complex<N>>
fn append_scaling(
&self,
&<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::NonUniformScaling
) -> Unit<Complex<N>>
[src]
fn append_scaling(
&self,
&<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::NonUniformScaling
) -> Unit<Complex<N>>
fn prepend_scaling(
&self,
&<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::NonUniformScaling
) -> Unit<Complex<N>>
[src]
fn prepend_scaling(
&self,
&<Unit<Complex<N>> as AffineTransformation<Point<N, U2>>>::NonUniformScaling
) -> Unit<Complex<N>>
fn append_rotation_wrt_point(&self, r: &Self::Rotation, p: &E) -> Option<Self>
[src]
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. Read more
impl<N> AffineTransformation<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> AffineTransformation<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
type Rotation = Unit<Quaternion<N>>
Type of the first rotation to be applied.
type NonUniformScaling = Id<Multiplicative>
Type of the non-uniform scaling to be applied.
type Translation = Id<Multiplicative>
The type of the pure translation part of this affine transformation.
fn decompose(
&self
) -> (Id<Multiplicative>, Unit<Quaternion<N>>, Id<Multiplicative>, Unit<Quaternion<N>>)
[src]
fn decompose(
&self
) -> (Id<Multiplicative>, Unit<Quaternion<N>>, Id<Multiplicative>, Unit<Quaternion<N>>)
fn append_translation(
&self,
&<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Translation
) -> Unit<Quaternion<N>>
[src]
fn append_translation(
&self,
&<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Translation
) -> Unit<Quaternion<N>>
fn prepend_translation(
&self,
&<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Translation
) -> Unit<Quaternion<N>>
[src]
fn prepend_translation(
&self,
&<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Translation
) -> Unit<Quaternion<N>>
fn append_rotation(
&self,
r: &<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Rotation
) -> Unit<Quaternion<N>>
[src]
fn append_rotation(
&self,
r: &<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Rotation
) -> Unit<Quaternion<N>>
fn prepend_rotation(
&self,
r: &<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Rotation
) -> Unit<Quaternion<N>>
[src]
fn prepend_rotation(
&self,
r: &<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::Rotation
) -> Unit<Quaternion<N>>
fn append_scaling(
&self,
&<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::NonUniformScaling
) -> Unit<Quaternion<N>>
[src]
fn append_scaling(
&self,
&<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::NonUniformScaling
) -> Unit<Quaternion<N>>
fn prepend_scaling(
&self,
&<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::NonUniformScaling
) -> Unit<Quaternion<N>>
[src]
fn prepend_scaling(
&self,
&<Unit<Quaternion<N>> as AffineTransformation<Point<N, U3>>>::NonUniformScaling
) -> Unit<Quaternion<N>>
fn append_rotation_wrt_point(&self, r: &Self::Rotation, p: &E) -> Option<Self>
[src]
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. Read more
impl<T> Neg for Unit<T> where
T: Neg,
[src]
impl<T> Neg for Unit<T> where
T: Neg,
type Output = Unit<<T as Neg>::Output>
The resulting type after applying the -
operator.
fn neg(self) -> <Unit<T> as Neg>::Output
[src]
fn neg(self) -> <Unit<T> as Neg>::Output
impl<N> AbsDiffEq for Unit<Quaternion<N>> where
N: AbsDiffEq<Epsilon = N> + Real,
[src]
impl<N> AbsDiffEq for Unit<Quaternion<N>> where
N: AbsDiffEq<Epsilon = N> + Real,
type Epsilon = N
Used for specifying relative comparisons.
fn default_epsilon() -> <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon
[src]
fn default_epsilon() -> <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon
fn abs_diff_eq(
&self,
other: &Unit<Quaternion<N>>,
epsilon: <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon
) -> bool
[src]
fn abs_diff_eq(
&self,
other: &Unit<Quaternion<N>>,
epsilon: <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon
) -> bool
fn abs_diff_ne(&self, other: &Self, epsilon: Self::Epsilon) -> bool
[src]
fn abs_diff_ne(&self, other: &Self, epsilon: Self::Epsilon) -> bool
The inverse of ApproxEq::abs_diff_eq
.
impl<N> AbsDiffEq for Unit<Complex<N>> where
N: Real,
[src]
impl<N> AbsDiffEq for Unit<Complex<N>> where
N: Real,
type Epsilon = N
Used for specifying relative comparisons.
fn default_epsilon() -> <Unit<Complex<N>> as AbsDiffEq>::Epsilon
[src]
fn default_epsilon() -> <Unit<Complex<N>> as AbsDiffEq>::Epsilon
fn abs_diff_eq(
&self,
other: &Unit<Complex<N>>,
epsilon: <Unit<Complex<N>> as AbsDiffEq>::Epsilon
) -> bool
[src]
fn abs_diff_eq(
&self,
other: &Unit<Complex<N>>,
epsilon: <Unit<Complex<N>> as AbsDiffEq>::Epsilon
) -> bool
fn abs_diff_ne(&self, other: &Self, epsilon: Self::Epsilon) -> bool
[src]
fn abs_diff_ne(&self, other: &Self, epsilon: Self::Epsilon) -> bool
The inverse of ApproxEq::abs_diff_eq
.
impl<N, R, C, S> AbsDiffEq for Unit<Matrix<N, R, C, S>> where
C: Dim,
N: Scalar + AbsDiffEq,
R: Dim,
S: Storage<N, R, C>,
<N as AbsDiffEq>::Epsilon: Copy,
[src]
impl<N, R, C, S> AbsDiffEq for Unit<Matrix<N, R, C, S>> where
C: Dim,
N: Scalar + AbsDiffEq,
R: Dim,
S: Storage<N, R, C>,
<N as AbsDiffEq>::Epsilon: Copy,
type Epsilon = <N as AbsDiffEq>::Epsilon
Used for specifying relative comparisons.
fn default_epsilon() -> <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon
[src]
fn default_epsilon() -> <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon
fn abs_diff_eq(
&self,
other: &Unit<Matrix<N, R, C, S>>,
epsilon: <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon
) -> bool
[src]
fn abs_diff_eq(
&self,
other: &Unit<Matrix<N, R, C, S>>,
epsilon: <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon
) -> bool
fn abs_diff_ne(&self, other: &Self, epsilon: Self::Epsilon) -> bool
[src]
fn abs_diff_ne(&self, other: &Self, epsilon: Self::Epsilon) -> bool
The inverse of ApproxEq::abs_diff_eq
.
impl<T> Hash for Unit<T> where
T: Hash,
[src]
impl<T> Hash for Unit<T> where
T: Hash,
fn hash<__HT>(&self, state: &mut __HT) where
__HT: Hasher,
[src]
fn hash<__HT>(&self, state: &mut __HT) where
__HT: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<T> Eq for Unit<T> where
T: Eq,
[src]
impl<T> Eq for Unit<T> where
T: Eq,
impl<'b, N> Mul<&'b Similarity<N, U2, Unit<Complex<N>>>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'b, N> Mul<&'b Similarity<N, U2, Unit<Complex<N>>>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Similarity<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Similarity<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<&'b Similarity<N, U2, Unit<Complex<N>>>>>::Output
[src]
fn mul(
self,
rhs: &'b Similarity<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<&'b Similarity<N, U2, Unit<Complex<N>>>>>::Output
impl<N, S> Mul<Matrix<N, U2, U1, S>> for Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N, S> Mul<Matrix<N, U2, U1, S>> for Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Matrix<N, U2, U1, S>
) -> <Unit<Complex<N>> as Mul<Matrix<N, U2, U1, S>>>::Output
[src]
fn mul(
self,
rhs: Matrix<N, U2, U1, S>
) -> <Unit<Complex<N>> as Mul<Matrix<N, U2, U1, S>>>::Output
impl<'b, N> Mul<&'b Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'b, N> Mul<&'b Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Complex<N>>
) -> <Rotation<N, U2> as Mul<&'b Unit<Complex<N>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Complex<N>>
) -> <Rotation<N, U2> as Mul<&'b Unit<Complex<N>>>>::Output
impl<'a, 'b, N> Mul<&'b Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Unit<Quaternion<N>>>>::Output
impl<'a, N, S> Mul<Matrix<N, U2, U1, S>> for &'a Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, N, S> Mul<Matrix<N, U2, U1, S>> for &'a Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Matrix<N, U2, U1, S>
) -> <&'a Unit<Complex<N>> as Mul<Matrix<N, U2, U1, S>>>::Output
[src]
fn mul(
self,
rhs: Matrix<N, U2, U1, S>
) -> <&'a Unit<Complex<N>> as Mul<Matrix<N, U2, U1, S>>>::Output
impl<'a, 'b, N> Mul<&'b Rotation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'a, 'b, N> Mul<&'b Rotation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<&'b Rotation<N, U2>>>::Output
[src]
fn mul(
self,
rhs: &'b Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<&'b Rotation<N, U2>>>::Output
impl<'b, N> Mul<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<'b, N> Mul<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Rotation<N, U3>
) -> <Unit<Quaternion<N>> as Mul<&'b Rotation<N, U3>>>::Output
[src]
fn mul(
self,
rhs: &'b Rotation<N, U3>
) -> <Unit<Quaternion<N>> as Mul<&'b Rotation<N, U3>>>::Output
impl<'b, N, SB> Mul<&'b Matrix<N, U3, U1, SB>> for Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'b, N, SB> Mul<&'b Matrix<N, U3, U1, SB>> for Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Matrix<N, U3, U1, SB>
) -> <Unit<Quaternion<N>> as Mul<&'b Matrix<N, U3, U1, SB>>>::Output
[src]
fn mul(
self,
rhs: &'b Matrix<N, U3, U1, SB>
) -> <Unit<Quaternion<N>> as Mul<&'b Matrix<N, U3, U1, SB>>>::Output
impl<'a, 'b, N, D, S> Mul<&'b Unit<Matrix<N, D, U1, S>>> for &'a Rotation<N, D> where
D: DimName,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N>,
S: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
ShapeConstraint: AreMultipliable<D, D, D, U1>,
[src]
impl<'a, 'b, N, D, S> Mul<&'b Unit<Matrix<N, D, U1, S>>> for &'a Rotation<N, D> where
D: DimName,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N>,
S: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
ShapeConstraint: AreMultipliable<D, D, D, U1>,
type Output = Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Unit<Matrix<N, D, U1, S>>
) -> <&'a Rotation<N, D> as Mul<&'b Unit<Matrix<N, D, U1, S>>>>::Output
[src]
fn mul(
self,
right: &'b Unit<Matrix<N, D, U1, S>>
) -> <&'a Rotation<N, D> as Mul<&'b Unit<Matrix<N, D, U1, S>>>>::Output
impl<N, S> Mul<Unit<Matrix<N, U2, U1, S>>> for Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N, S> Mul<Unit<Matrix<N, U2, U1, S>>> for Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Unit<Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Matrix<N, U2, U1, S>>
) -> <Unit<Complex<N>> as Mul<Unit<Matrix<N, U2, U1, S>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Matrix<N, U2, U1, S>>
) -> <Unit<Complex<N>> as Mul<Unit<Matrix<N, U2, U1, S>>>>::Output
impl<'a, N> Mul<Unit<Complex<N>>> for &'a Translation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, N> Mul<Unit<Complex<N>>> for &'a Translation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Unit<Complex<N>>
) -> <&'a Translation<N, U2> as Mul<Unit<Complex<N>>>>::Output
[src]
fn mul(
self,
right: Unit<Complex<N>>
) -> <&'a Translation<N, U2> as Mul<Unit<Complex<N>>>>::Output
impl<'b, N> Mul<&'b Isometry<N, U2, Unit<Complex<N>>>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'b, N> Mul<&'b Isometry<N, U2, Unit<Complex<N>>>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Isometry<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<&'b Isometry<N, U2, Unit<Complex<N>>>>>::Output
[src]
fn mul(
self,
rhs: &'b Isometry<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<&'b Isometry<N, U2, Unit<Complex<N>>>>>::Output
impl<'b, N, C> Mul<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'b, N, C> Mul<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Mul<&'b Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Mul<&'b Unit<Quaternion<N>>>>::Output
impl<N> Mul<Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<N> Mul<Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Isometry<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Mul<Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn mul(
self,
right: Isometry<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Mul<Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
impl<'a, N> Mul<Similarity<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, N> Mul<Similarity<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Similarity<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Similarity<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Mul<Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn mul(
self,
right: Similarity<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Mul<Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
impl<'b, N> Mul<&'b Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'b, N> Mul<&'b Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Point<N, U3>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Point<N, U3>
) -> <Unit<Quaternion<N>> as Mul<&'b Point<N, U3>>>::Output
[src]
fn mul(
self,
rhs: &'b Point<N, U3>
) -> <Unit<Quaternion<N>> as Mul<&'b Point<N, U3>>>::Output
impl<'b, N, S> Mul<&'b Matrix<N, U2, U1, S>> for Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'b, N, S> Mul<&'b Matrix<N, U2, U1, S>> for Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Matrix<N, U2, U1, S>
) -> <Unit<Complex<N>> as Mul<&'b Matrix<N, U2, U1, S>>>::Output
[src]
fn mul(
self,
rhs: &'b Matrix<N, U2, U1, S>
) -> <Unit<Complex<N>> as Mul<&'b Matrix<N, U2, U1, S>>>::Output
impl<'a, 'b, N, C> Mul<&'b Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
[src]
impl<'a, 'b, N, C> Mul<&'b Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Transform<N, U3, C>>>::Output
[src]
fn mul(
self,
rhs: &'b Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Transform<N, U3, C>>>::Output
impl<'b, N> Mul<&'b Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'b, N> Mul<&'b Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Rotation<N, U2>
) -> <Unit<Complex<N>> as Mul<&'b Rotation<N, U2>>>::Output
[src]
fn mul(
self,
rhs: &'b Rotation<N, U2>
) -> <Unit<Complex<N>> as Mul<&'b Rotation<N, U2>>>::Output
impl<'a, 'b, N> Mul<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Similarity<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Similarity<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn mul(
self,
right: &'b Similarity<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
impl<N> Mul<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<N> Mul<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <Unit<Quaternion<N>> as Mul<Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <Unit<Quaternion<N>> as Mul<Unit<Quaternion<N>>>>::Output
impl<N> Mul<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> Mul<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Point<N, U2>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Point<N, U2>
) -> <Unit<Complex<N>> as Mul<Point<N, U2>>>::Output
[src]
fn mul(
self,
rhs: Point<N, U2>
) -> <Unit<Complex<N>> as Mul<Point<N, U2>>>::Output
impl<'a, N, SB> Mul<Unit<Matrix<N, U3, U1, SB>>> for &'a Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, N, SB> Mul<Unit<Matrix<N, U3, U1, SB>>> for &'a Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Unit<Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Matrix<N, U3, U1, SB>>
) -> <&'a Unit<Quaternion<N>> as Mul<Unit<Matrix<N, U3, U1, SB>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Matrix<N, U3, U1, SB>>
) -> <&'a Unit<Quaternion<N>> as Mul<Unit<Matrix<N, U3, U1, SB>>>>::Output
impl<'a, N, SB> Mul<Matrix<N, U3, U1, SB>> for &'a Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, N, SB> Mul<Matrix<N, U3, U1, SB>> for &'a Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Matrix<N, U3, U1, SB>
) -> <&'a Unit<Quaternion<N>> as Mul<Matrix<N, U3, U1, SB>>>::Output
[src]
fn mul(
self,
rhs: Matrix<N, U3, U1, SB>
) -> <&'a Unit<Quaternion<N>> as Mul<Matrix<N, U3, U1, SB>>>::Output
impl<'a, 'b, N> Mul<&'b Unit<Quaternion<N>>> for &'a Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Unit<Quaternion<N>>> for &'a Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Rotation<N, U3> as Mul<&'b Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Rotation<N, U3> as Mul<&'b Unit<Quaternion<N>>>>::Output
impl<'a, N> Mul<Rotation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'a, N> Mul<Rotation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<Rotation<N, U2>>>::Output
[src]
fn mul(
self,
rhs: Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<Rotation<N, U2>>>::Output
impl<'b, N> Mul<&'b Unit<Quaternion<N>>> for Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'b, N> Mul<&'b Unit<Quaternion<N>>> for Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Rotation<N, U3> as Mul<&'b Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Rotation<N, U3> as Mul<&'b Unit<Quaternion<N>>>>::Output
impl<'a, N> Mul<Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, N> Mul<Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Unit<Quaternion<N>> as Mul<Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Unit<Quaternion<N>> as Mul<Unit<Quaternion<N>>>>::Output
impl<'a, N> Mul<Translation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, N> Mul<Translation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Translation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<Translation<N, U2>>>::Output
[src]
fn mul(
self,
rhs: Translation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<Translation<N, U2>>>::Output
impl<'a, 'b, N, D, R> Mul<&'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>> for &'a Isometry<N, D, R> where
D: DimName,
N: Real,
R: Rotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D, U1>,
[src]
impl<'a, 'b, N, D, R> Mul<&'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>> for &'a Isometry<N, D, R> where
D: DimName,
N: Real,
R: Rotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D, U1>,
type Output = Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
) -> <&'a Isometry<N, D, R> as Mul<&'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>>::Output
[src]
fn mul(
self,
right: &'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
) -> <&'a Isometry<N, D, R> as Mul<&'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>>::Output
impl<N> Mul<Unit<Quaternion<N>>> for Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<N> Mul<Unit<Quaternion<N>>> for Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <Rotation<N, U3> as Mul<Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <Rotation<N, U3> as Mul<Unit<Quaternion<N>>>>::Output
impl<'a, N> Mul<Point<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, N> Mul<Point<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Point<N, U3>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Point<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<Point<N, U3>>>::Output
[src]
fn mul(
self,
rhs: Point<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<Point<N, U3>>>::Output
impl<'a, N, C> Mul<Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, N, C> Mul<Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Mul<Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Mul<Unit<Quaternion<N>>>>::Output
impl<'a, N> Mul<Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<'a, N> Mul<Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Rotation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<Rotation<N, U3>>>::Output
[src]
fn mul(
self,
rhs: Rotation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<Rotation<N, U3>>>::Output
impl<N, C> Mul<Transform<N, U3, C>> for Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
[src]
impl<N, C> Mul<Transform<N, U3, C>> for Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Mul<Transform<N, U3, C>>>::Output
[src]
fn mul(
self,
rhs: Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Mul<Transform<N, U3, C>>>::Output
impl<'b, N> Mul<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'b, N> Mul<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Unit<Quaternion<N>> as Mul<&'b Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Unit<Quaternion<N>> as Mul<&'b Unit<Quaternion<N>>>>::Output
impl<N> Mul<Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<N> Mul<Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Complex<N>>
) -> <Rotation<N, U2> as Mul<Unit<Complex<N>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Complex<N>>
) -> <Rotation<N, U2> as Mul<Unit<Complex<N>>>>::Output
impl<'b, N> Mul<&'b Unit<Complex<N>>> for Translation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'b, N> Mul<&'b Unit<Complex<N>>> for Translation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Unit<Complex<N>>
) -> <Translation<N, U2> as Mul<&'b Unit<Complex<N>>>>::Output
[src]
fn mul(
self,
right: &'b Unit<Complex<N>>
) -> <Translation<N, U2> as Mul<&'b Unit<Complex<N>>>>::Output
impl<'a, 'b, N, S> Mul<&'b Matrix<N, U2, U1, S>> for &'a Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, 'b, N, S> Mul<&'b Matrix<N, U2, U1, S>> for &'a Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Matrix<N, U2, U1, S>
) -> <&'a Unit<Complex<N>> as Mul<&'b Matrix<N, U2, U1, S>>>::Output
[src]
fn mul(
self,
rhs: &'b Matrix<N, U2, U1, S>
) -> <&'a Unit<Complex<N>> as Mul<&'b Matrix<N, U2, U1, S>>>::Output
impl<N, D, S> Mul<Unit<Matrix<N, D, U1, S>>> for Rotation<N, D> where
D: DimName,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N>,
S: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
ShapeConstraint: AreMultipliable<D, D, D, U1>,
[src]
impl<N, D, S> Mul<Unit<Matrix<N, D, U1, S>>> for Rotation<N, D> where
D: DimName,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N>,
S: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
ShapeConstraint: AreMultipliable<D, D, D, U1>,
type Output = Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Unit<Matrix<N, D, U1, S>>
) -> <Rotation<N, D> as Mul<Unit<Matrix<N, D, U1, S>>>>::Output
[src]
fn mul(
self,
right: Unit<Matrix<N, D, U1, S>>
) -> <Rotation<N, D> as Mul<Unit<Matrix<N, D, U1, S>>>>::Output
impl<'b, N> Mul<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
[src]
impl<'b, N> Mul<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>
[src]
fn mul(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>
impl<'a, 'b, N> Mul<&'b Isometry<N, U2, Unit<Complex<N>>>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Isometry<N, U2, Unit<Complex<N>>>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Isometry<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<&'b Isometry<N, U2, Unit<Complex<N>>>>>::Output
[src]
fn mul(
self,
rhs: &'b Isometry<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<&'b Isometry<N, U2, Unit<Complex<N>>>>>::Output
impl<'a, 'b, N> Mul<&'b Point<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Point<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Point<N, U2>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Point<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<&'b Point<N, U2>>>::Output
[src]
fn mul(
self,
rhs: &'b Point<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<&'b Point<N, U2>>>::Output
impl<'a, N> Mul<Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, N> Mul<Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Isometry<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Mul<Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn mul(
self,
right: Isometry<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Mul<Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
impl<'b, N> Mul<&'b Translation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'b, N> Mul<&'b Translation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Translation<N, U3>
) -> <Unit<Quaternion<N>> as Mul<&'b Translation<N, U3>>>::Output
[src]
fn mul(
self,
right: &'b Translation<N, U3>
) -> <Unit<Quaternion<N>> as Mul<&'b Translation<N, U3>>>::Output
impl<'a, 'b, N> Mul<&'b Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<'a, 'b, N> Mul<&'b Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Rotation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Rotation<N, U3>>>::Output
[src]
fn mul(
self,
rhs: &'b Rotation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Rotation<N, U3>>>::Output
impl<N> Mul<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<N> Mul<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Point<N, U3>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Point<N, U3>
) -> <Unit<Quaternion<N>> as Mul<Point<N, U3>>>::Output
[src]
fn mul(
self,
rhs: Point<N, U3>
) -> <Unit<Quaternion<N>> as Mul<Point<N, U3>>>::Output
impl<'a, 'b, N, SB> Mul<&'b Unit<Matrix<N, U3, U1, SB>>> for &'a Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, 'b, N, SB> Mul<&'b Unit<Matrix<N, U3, U1, SB>>> for &'a Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Unit<Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Matrix<N, U3, U1, SB>>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Unit<Matrix<N, U3, U1, SB>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Matrix<N, U3, U1, SB>>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Unit<Matrix<N, U3, U1, SB>>>>::Output
impl<'a, N> Mul<Unit<Quaternion<N>>> for &'a Translation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, N> Mul<Unit<Quaternion<N>>> for &'a Translation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Unit<Quaternion<N>>
) -> <&'a Translation<N, U3> as Mul<Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
right: Unit<Quaternion<N>>
) -> <&'a Translation<N, U3> as Mul<Unit<Quaternion<N>>>>::Output
impl<'b, N> Mul<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'b, N> Mul<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Similarity<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Similarity<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Mul<&'b Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn mul(
self,
right: &'b Similarity<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Mul<&'b Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
impl<N> Mul<Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<N> Mul<Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Rotation<N, U3>
) -> <Unit<Quaternion<N>> as Mul<Rotation<N, U3>>>::Output
[src]
fn mul(
self,
rhs: Rotation<N, U3>
) -> <Unit<Quaternion<N>> as Mul<Rotation<N, U3>>>::Output
impl<'a, N, C> Mul<Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
[src]
impl<'a, N, C> Mul<Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Mul<Transform<N, U3, C>>>::Output
[src]
fn mul(
self,
rhs: Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Mul<Transform<N, U3, C>>>::Output
impl<'b, N> Mul<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'b, N> Mul<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Isometry<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Mul<&'b Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn mul(
self,
right: &'b Isometry<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Mul<&'b Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
impl<N, SB> Mul<Matrix<N, U3, U1, SB>> for Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<N, SB> Mul<Matrix<N, U3, U1, SB>> for Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Matrix<N, U3, U1, SB>
) -> <Unit<Quaternion<N>> as Mul<Matrix<N, U3, U1, SB>>>::Output
[src]
fn mul(
self,
rhs: Matrix<N, U3, U1, SB>
) -> <Unit<Quaternion<N>> as Mul<Matrix<N, U3, U1, SB>>>::Output
impl<'a, N> Mul<Translation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, N> Mul<Translation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Translation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<Translation<N, U3>>>::Output
[src]
fn mul(
self,
right: Translation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<Translation<N, U3>>>::Output
impl<'b, N, SB> Mul<&'b Unit<Matrix<N, U3, U1, SB>>> for Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'b, N, SB> Mul<&'b Unit<Matrix<N, U3, U1, SB>>> for Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Unit<Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Matrix<N, U3, U1, SB>>
) -> <Unit<Quaternion<N>> as Mul<&'b Unit<Matrix<N, U3, U1, SB>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Matrix<N, U3, U1, SB>>
) -> <Unit<Quaternion<N>> as Mul<&'b Unit<Matrix<N, U3, U1, SB>>>>::Output
impl<'b, N, D, S> Mul<&'b Unit<Matrix<N, D, U1, S>>> for Rotation<N, D> where
D: DimName,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N>,
S: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
ShapeConstraint: AreMultipliable<D, D, D, U1>,
[src]
impl<'b, N, D, S> Mul<&'b Unit<Matrix<N, D, U1, S>>> for Rotation<N, D> where
D: DimName,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N>,
S: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
ShapeConstraint: AreMultipliable<D, D, D, U1>,
type Output = Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Unit<Matrix<N, D, U1, S>>
) -> <Rotation<N, D> as Mul<&'b Unit<Matrix<N, D, U1, S>>>>::Output
[src]
fn mul(
self,
right: &'b Unit<Matrix<N, D, U1, S>>
) -> <Rotation<N, D> as Mul<&'b Unit<Matrix<N, D, U1, S>>>>::Output
impl<'a, 'b, N> Mul<&'b Point<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Point<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Point<N, U3>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Point<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Point<N, U3>>>::Output
[src]
fn mul(
self,
rhs: &'b Point<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Point<N, U3>>>::Output
impl<N> Mul<Similarity<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<N> Mul<Similarity<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Similarity<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Similarity<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Mul<Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn mul(
self,
right: Similarity<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Mul<Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
impl<'a, 'b, N, C> Mul<&'b Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, 'b, N, C> Mul<&'b Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Mul<&'b Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Mul<&'b Unit<Quaternion<N>>>>::Output
impl<'a, 'b, N> Mul<&'b Translation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Translation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Translation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<&'b Translation<N, U2>>>::Output
[src]
fn mul(
self,
rhs: &'b Translation<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<&'b Translation<N, U2>>>::Output
impl<N> Mul<Unit<Complex<N>>> for Translation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> Mul<Unit<Complex<N>>> for Translation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Unit<Complex<N>>
) -> <Translation<N, U2> as Mul<Unit<Complex<N>>>>::Output
[src]
fn mul(
self,
right: Unit<Complex<N>>
) -> <Translation<N, U2> as Mul<Unit<Complex<N>>>>::Output
impl<N> Mul<Translation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<N> Mul<Translation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Translation<N, U3>
) -> <Unit<Quaternion<N>> as Mul<Translation<N, U3>>>::Output
[src]
fn mul(
self,
right: Translation<N, U3>
) -> <Unit<Quaternion<N>> as Mul<Translation<N, U3>>>::Output
impl<'a, N> Mul<Unit<Complex<N>>> for &'a Unit<Complex<N>> where
N: Real,
[src]
impl<'a, N> Mul<Unit<Complex<N>>> for &'a Unit<Complex<N>> where
N: Real,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>
[src]
fn mul(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>
impl<'a, N, D, S> Mul<Unit<Matrix<N, D, U1, S>>> for &'a Rotation<N, D> where
D: DimName,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N>,
S: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
ShapeConstraint: AreMultipliable<D, D, D, U1>,
[src]
impl<'a, N, D, S> Mul<Unit<Matrix<N, D, U1, S>>> for &'a Rotation<N, D> where
D: DimName,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N>,
S: Storage<N, D, U1>,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, D, U1>,
ShapeConstraint: AreMultipliable<D, D, D, U1>,
type Output = Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Unit<Matrix<N, D, U1, S>>
) -> <&'a Rotation<N, D> as Mul<Unit<Matrix<N, D, U1, S>>>>::Output
[src]
fn mul(
self,
right: Unit<Matrix<N, D, U1, S>>
) -> <&'a Rotation<N, D> as Mul<Unit<Matrix<N, D, U1, S>>>>::Output
impl<N, SB> Mul<Unit<Matrix<N, U3, U1, SB>>> for Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<N, SB> Mul<Unit<Matrix<N, U3, U1, SB>>> for Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Unit<Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Matrix<N, U3, U1, SB>>
) -> <Unit<Quaternion<N>> as Mul<Unit<Matrix<N, U3, U1, SB>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Matrix<N, U3, U1, SB>>
) -> <Unit<Quaternion<N>> as Mul<Unit<Matrix<N, U3, U1, SB>>>>::Output
impl<'a, 'b, N, S> Mul<&'b Unit<Matrix<N, U2, U1, S>>> for &'a Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, 'b, N, S> Mul<&'b Unit<Matrix<N, U2, U1, S>>> for &'a Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Unit<Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Matrix<N, U2, U1, S>>
) -> <&'a Unit<Complex<N>> as Mul<&'b Unit<Matrix<N, U2, U1, S>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Matrix<N, U2, U1, S>>
) -> <&'a Unit<Complex<N>> as Mul<&'b Unit<Matrix<N, U2, U1, S>>>>::Output
impl<'a, 'b, N> Mul<&'b Unit<Complex<N>>> for &'a Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'a, 'b, N> Mul<&'b Unit<Complex<N>>> for &'a Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Complex<N>>
) -> <&'a Rotation<N, U2> as Mul<&'b Unit<Complex<N>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Complex<N>>
) -> <&'a Rotation<N, U2> as Mul<&'b Unit<Complex<N>>>>::Output
impl<'b, N> Mul<&'b Unit<Quaternion<N>>> for Translation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'b, N> Mul<&'b Unit<Quaternion<N>>> for Translation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Unit<Quaternion<N>>
) -> <Translation<N, U3> as Mul<&'b Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
right: &'b Unit<Quaternion<N>>
) -> <Translation<N, U3> as Mul<&'b Unit<Quaternion<N>>>>::Output
impl<N> Mul<Isometry<N, U2, Unit<Complex<N>>>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> Mul<Isometry<N, U2, Unit<Complex<N>>>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Isometry<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<Isometry<N, U2, Unit<Complex<N>>>>>::Output
[src]
fn mul(
self,
rhs: Isometry<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<Isometry<N, U2, Unit<Complex<N>>>>>::Output
impl<N> Mul<Translation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> Mul<Translation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Translation<N, U2>
) -> <Unit<Complex<N>> as Mul<Translation<N, U2>>>::Output
[src]
fn mul(
self,
rhs: Translation<N, U2>
) -> <Unit<Complex<N>> as Mul<Translation<N, U2>>>::Output
impl<'a, 'b, N> Mul<&'b Unit<Quaternion<N>>> for &'a Translation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Unit<Quaternion<N>>> for &'a Translation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Unit<Quaternion<N>>
) -> <&'a Translation<N, U3> as Mul<&'b Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
right: &'b Unit<Quaternion<N>>
) -> <&'a Translation<N, U3> as Mul<&'b Unit<Quaternion<N>>>>::Output
impl<'a, N, S> Mul<Unit<Matrix<N, U2, U1, S>>> for &'a Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, N, S> Mul<Unit<Matrix<N, U2, U1, S>>> for &'a Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Unit<Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Matrix<N, U2, U1, S>>
) -> <&'a Unit<Complex<N>> as Mul<Unit<Matrix<N, U2, U1, S>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Matrix<N, U2, U1, S>>
) -> <&'a Unit<Complex<N>> as Mul<Unit<Matrix<N, U2, U1, S>>>>::Output
impl<'b, N, D, R> Mul<&'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>> for Isometry<N, D, R> where
D: DimName,
N: Real,
R: Rotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D, U1>,
[src]
impl<'b, N, D, R> Mul<&'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>> for Isometry<N, D, R> where
D: DimName,
N: Real,
R: Rotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D, U1>,
type Output = Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
) -> <Isometry<N, D, R> as Mul<&'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>>::Output
[src]
fn mul(
self,
right: &'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
) -> <Isometry<N, D, R> as Mul<&'b Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>>::Output
impl<'b, N, C> Mul<&'b Transform<N, U3, C>> for Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
[src]
impl<'b, N, C> Mul<&'b Transform<N, U3, C>> for Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Mul<&'b Transform<N, U3, C>>>::Output
[src]
fn mul(
self,
rhs: &'b Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Mul<&'b Transform<N, U3, C>>>::Output
impl<'a, 'b, N> Mul<&'b Unit<Complex<N>>> for &'a Translation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Unit<Complex<N>>> for &'a Translation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Unit<Complex<N>>
) -> <&'a Translation<N, U2> as Mul<&'b Unit<Complex<N>>>>::Output
[src]
fn mul(
self,
right: &'b Unit<Complex<N>>
) -> <&'a Translation<N, U2> as Mul<&'b Unit<Complex<N>>>>::Output
impl<N> Mul<Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<N> Mul<Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Rotation<N, U2>
) -> <Unit<Complex<N>> as Mul<Rotation<N, U2>>>::Output
[src]
fn mul(
self,
rhs: Rotation<N, U2>
) -> <Unit<Complex<N>> as Mul<Rotation<N, U2>>>::Output
impl<'a, 'b, N> Mul<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Isometry<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn mul(
self,
right: &'b Isometry<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
impl<'a, 'b, N> Mul<&'b Translation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Translation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: &'b Translation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Translation<N, U3>>>::Output
[src]
fn mul(
self,
right: &'b Translation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Translation<N, U3>>>::Output
impl<N> Mul<Similarity<N, U2, Unit<Complex<N>>>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> Mul<Similarity<N, U2, Unit<Complex<N>>>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Similarity<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Similarity<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<Similarity<N, U2, Unit<Complex<N>>>>>::Output
[src]
fn mul(
self,
rhs: Similarity<N, U2, Unit<Complex<N>>>
) -> <Unit<Complex<N>> as Mul<Similarity<N, U2, Unit<Complex<N>>>>>::Output
impl<N> Mul<Unit<Quaternion<N>>> for Translation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<N> Mul<Unit<Quaternion<N>>> for Translation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Unit<Quaternion<N>>
) -> <Translation<N, U3> as Mul<Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
right: Unit<Quaternion<N>>
) -> <Translation<N, U3> as Mul<Unit<Quaternion<N>>>>::Output
impl<'a, N> Mul<Similarity<N, U2, Unit<Complex<N>>>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, N> Mul<Similarity<N, U2, Unit<Complex<N>>>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Similarity<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Similarity<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<Similarity<N, U2, Unit<Complex<N>>>>>::Output
[src]
fn mul(
self,
rhs: Similarity<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<Similarity<N, U2, Unit<Complex<N>>>>>::Output
impl<'a, N, D, R> Mul<Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>> for &'a Isometry<N, D, R> where
D: DimName,
N: Real,
R: Rotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D, U1>,
[src]
impl<'a, N, D, R> Mul<Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>> for &'a Isometry<N, D, R> where
D: DimName,
N: Real,
R: Rotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D, U1>,
type Output = Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
) -> <&'a Isometry<N, D, R> as Mul<Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>>::Output
[src]
fn mul(
self,
right: Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
) -> <&'a Isometry<N, D, R> as Mul<Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>>::Output
impl<'a, N> Mul<Unit<Quaternion<N>>> for &'a Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, N> Mul<Unit<Quaternion<N>>> for &'a Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Rotation<N, U3> as Mul<Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Rotation<N, U3> as Mul<Unit<Quaternion<N>>>>::Output
impl<'b, N> Mul<&'b Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'b, N> Mul<&'b Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Point<N, U2>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Point<N, U2>
) -> <Unit<Complex<N>> as Mul<&'b Point<N, U2>>>::Output
[src]
fn mul(
self,
rhs: &'b Point<N, U2>
) -> <Unit<Complex<N>> as Mul<&'b Point<N, U2>>>::Output
impl<N, D, R> Mul<Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>> for Isometry<N, D, R> where
D: DimName,
N: Real,
R: Rotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D, U1>,
[src]
impl<N, D, R> Mul<Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>> for Isometry<N, D, R> where
D: DimName,
N: Real,
R: Rotation<Point<N, D>>,
DefaultAllocator: Allocator<N, D, U1>,
type Output = Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
right: Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
) -> <Isometry<N, D, R> as Mul<Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>>::Output
[src]
fn mul(
self,
right: Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
) -> <Isometry<N, D, R> as Mul<Unit<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>>>::Output
impl<N> Mul<Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> Mul<Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>
[src]
fn mul(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>
impl<'a, N> Mul<Isometry<N, U2, Unit<Complex<N>>>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, N> Mul<Isometry<N, U2, Unit<Complex<N>>>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Isometry<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<Isometry<N, U2, Unit<Complex<N>>>>>::Output
[src]
fn mul(
self,
rhs: Isometry<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<Isometry<N, U2, Unit<Complex<N>>>>>::Output
impl<'a, N> Mul<Point<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, N> Mul<Point<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Point<N, U2>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Point<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<Point<N, U2>>>::Output
[src]
fn mul(
self,
rhs: Point<N, U2>
) -> <&'a Unit<Complex<N>> as Mul<Point<N, U2>>>::Output
impl<N, C> Mul<Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<N, C> Mul<Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Mul<Unit<Quaternion<N>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Mul<Unit<Quaternion<N>>>>::Output
impl<'a, 'b, N> Mul<&'b Unit<Complex<N>>> for &'a Unit<Complex<N>> where
N: Real,
[src]
impl<'a, 'b, N> Mul<&'b Unit<Complex<N>>> for &'a Unit<Complex<N>> where
N: Real,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>
[src]
fn mul(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>
impl<'b, N, S> Mul<&'b Unit<Matrix<N, U2, U1, S>>> for Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'b, N, S> Mul<&'b Unit<Matrix<N, U2, U1, S>>> for Unit<Complex<N>> where
N: Real,
S: Storage<N, U2, U1>,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Unit<Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Unit<Matrix<N, U2, U1, S>>
) -> <Unit<Complex<N>> as Mul<&'b Unit<Matrix<N, U2, U1, S>>>>::Output
[src]
fn mul(
self,
rhs: &'b Unit<Matrix<N, U2, U1, S>>
) -> <Unit<Complex<N>> as Mul<&'b Unit<Matrix<N, U2, U1, S>>>>::Output
impl<'a, N> Mul<Unit<Complex<N>>> for &'a Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'a, N> Mul<Unit<Complex<N>>> for &'a Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: Unit<Complex<N>>
) -> <&'a Rotation<N, U2> as Mul<Unit<Complex<N>>>>::Output
[src]
fn mul(
self,
rhs: Unit<Complex<N>>
) -> <&'a Rotation<N, U2> as Mul<Unit<Complex<N>>>>::Output
impl<'b, N> Mul<&'b Translation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'b, N> Mul<&'b Translation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Isometry<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Translation<N, U2>
) -> <Unit<Complex<N>> as Mul<&'b Translation<N, U2>>>::Output
[src]
fn mul(
self,
rhs: &'b Translation<N, U2>
) -> <Unit<Complex<N>> as Mul<&'b Translation<N, U2>>>::Output
impl<'a, 'b, N, SB> Mul<&'b Matrix<N, U3, U1, SB>> for &'a Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, 'b, N, SB> Mul<&'b Matrix<N, U3, U1, SB>> for &'a Unit<Quaternion<N>> where
N: Real,
SB: Storage<N, U3, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Matrix<N, U3, U1, SB>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Matrix<N, U3, U1, SB>>>::Output
[src]
fn mul(
self,
rhs: &'b Matrix<N, U3, U1, SB>
) -> <&'a Unit<Quaternion<N>> as Mul<&'b Matrix<N, U3, U1, SB>>>::Output
impl<'a, 'b, N> Mul<&'b Similarity<N, U2, Unit<Complex<N>>>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<'a, 'b, N> Mul<&'b Similarity<N, U2, Unit<Complex<N>>>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Output = Similarity<N, U2, Unit<Complex<N>>>
The resulting type after applying the *
operator.
fn mul(
self,
rhs: &'b Similarity<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<&'b Similarity<N, U2, Unit<Complex<N>>>>>::Output
[src]
fn mul(
self,
rhs: &'b Similarity<N, U2, Unit<Complex<N>>>
) -> <&'a Unit<Complex<N>> as Mul<&'b Similarity<N, U2, Unit<Complex<N>>>>>::Output
impl<T> AsRef<T> for Unit<T>
[src]
impl<T> AsRef<T> for Unit<T>
impl<N1, N2, R> SubsetOf<Similarity<N2, U2, R>> for Unit<Complex<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N2, U2>> + SupersetOf<Unit<Complex<N1>>>,
[src]
impl<N1, N2, R> SubsetOf<Similarity<N2, U2, R>> for Unit<Complex<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N2, U2>> + SupersetOf<Unit<Complex<N1>>>,
fn to_superset(&self) -> Similarity<N2, U2, R>
[src]
fn to_superset(&self) -> Similarity<N2, U2, R>
fn is_in_subset(sim: &Similarity<N2, U2, R>) -> bool
[src]
fn is_in_subset(sim: &Similarity<N2, U2, R>) -> bool
unsafe fn from_superset_unchecked(
sim: &Similarity<N2, U2, R>
) -> Unit<Complex<N1>>
[src]
unsafe fn from_superset_unchecked(
sim: &Similarity<N2, U2, R>
) -> Unit<Complex<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2> SubsetOf<Unit<Complex<N2>>> for Unit<Complex<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
[src]
impl<N1, N2> SubsetOf<Unit<Complex<N2>>> for Unit<Complex<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
fn to_superset(&self) -> Unit<Complex<N2>>
[src]
fn to_superset(&self) -> Unit<Complex<N2>>
fn is_in_subset(uq: &Unit<Complex<N2>>) -> bool
[src]
fn is_in_subset(uq: &Unit<Complex<N2>>) -> bool
unsafe fn from_superset_unchecked(uq: &Unit<Complex<N2>>) -> Unit<Complex<N1>>
[src]
unsafe fn from_superset_unchecked(uq: &Unit<Complex<N2>>) -> Unit<Complex<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2> SubsetOf<Rotation<N2, U3>> for Unit<Quaternion<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
[src]
impl<N1, N2> SubsetOf<Rotation<N2, U3>> for Unit<Quaternion<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
fn to_superset(&self) -> Rotation<N2, U3>
[src]
fn to_superset(&self) -> Rotation<N2, U3>
fn is_in_subset(rot: &Rotation<N2, U3>) -> bool
[src]
fn is_in_subset(rot: &Rotation<N2, U3>) -> bool
unsafe fn from_superset_unchecked(
rot: &Rotation<N2, U3>
) -> Unit<Quaternion<N1>>
[src]
unsafe fn from_superset_unchecked(
rot: &Rotation<N2, U3>
) -> Unit<Quaternion<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2> SubsetOf<Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>> for Unit<Quaternion<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
[src]
impl<N1, N2> SubsetOf<Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>> for Unit<Quaternion<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
fn to_superset(
&self
) -> Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>
[src]
fn to_superset(
&self
) -> Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>
fn is_in_subset(
m: &Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>
) -> bool
[src]
fn is_in_subset(
m: &Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>
) -> bool
unsafe fn from_superset_unchecked(
m: &Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>
) -> Unit<Quaternion<N1>>
[src]
unsafe fn from_superset_unchecked(
m: &Matrix<N2, U4, U4, <DefaultAllocator as Allocator<N2, U4, U4>>::Buffer>
) -> Unit<Quaternion<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2> SubsetOf<Unit<Quaternion<N2>>> for Rotation<N1, U3> where
N1: Real,
N2: Real + SupersetOf<N1>,
[src]
impl<N1, N2> SubsetOf<Unit<Quaternion<N2>>> for Rotation<N1, U3> where
N1: Real,
N2: Real + SupersetOf<N1>,
fn to_superset(&self) -> Unit<Quaternion<N2>>
[src]
fn to_superset(&self) -> Unit<Quaternion<N2>>
fn is_in_subset(q: &Unit<Quaternion<N2>>) -> bool
[src]
fn is_in_subset(q: &Unit<Quaternion<N2>>) -> bool
unsafe fn from_superset_unchecked(q: &Unit<Quaternion<N2>>) -> Rotation<N1, U3>
[src]
unsafe fn from_superset_unchecked(q: &Unit<Quaternion<N2>>) -> Rotation<N1, U3>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2, C> SubsetOf<Transform<N2, U2, C>> for Unit<Complex<N1>> where
C: SuperTCategoryOf<TAffine>,
N1: Real,
N2: Real + SupersetOf<N1>,
[src]
impl<N1, N2, C> SubsetOf<Transform<N2, U2, C>> for Unit<Complex<N1>> where
C: SuperTCategoryOf<TAffine>,
N1: Real,
N2: Real + SupersetOf<N1>,
fn to_superset(&self) -> Transform<N2, U2, C>
[src]
fn to_superset(&self) -> Transform<N2, U2, C>
fn is_in_subset(t: &Transform<N2, U2, C>) -> bool
[src]
fn is_in_subset(t: &Transform<N2, U2, C>) -> bool
unsafe fn from_superset_unchecked(t: &Transform<N2, U2, C>) -> Unit<Complex<N1>>
[src]
unsafe fn from_superset_unchecked(t: &Transform<N2, U2, C>) -> Unit<Complex<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2> SubsetOf<Unit<Complex<N2>>> for Rotation<N1, U2> where
N1: Real,
N2: Real + SupersetOf<N1>,
[src]
impl<N1, N2> SubsetOf<Unit<Complex<N2>>> for Rotation<N1, U2> where
N1: Real,
N2: Real + SupersetOf<N1>,
fn to_superset(&self) -> Unit<Complex<N2>>
[src]
fn to_superset(&self) -> Unit<Complex<N2>>
fn is_in_subset(q: &Unit<Complex<N2>>) -> bool
[src]
fn is_in_subset(q: &Unit<Complex<N2>>) -> bool
unsafe fn from_superset_unchecked(q: &Unit<Complex<N2>>) -> Rotation<N1, U2>
[src]
unsafe fn from_superset_unchecked(q: &Unit<Complex<N2>>) -> Rotation<N1, U2>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<T> SubsetOf<T> for Unit<T> where
T: NormedSpace,
<T as VectorSpace>::Field: RelativeEq,
[src]
impl<T> SubsetOf<T> for Unit<T> where
T: NormedSpace,
<T as VectorSpace>::Field: RelativeEq,
fn to_superset(&self) -> T
[src]
fn to_superset(&self) -> T
fn is_in_subset(value: &T) -> bool
[src]
fn is_in_subset(value: &T) -> bool
unsafe fn from_superset_unchecked(value: &T) -> Unit<T>
[src]
unsafe fn from_superset_unchecked(value: &T) -> Unit<T>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2, R> SubsetOf<Similarity<N2, U3, R>> for Unit<Quaternion<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N2, U3>> + SupersetOf<Unit<Quaternion<N1>>>,
[src]
impl<N1, N2, R> SubsetOf<Similarity<N2, U3, R>> for Unit<Quaternion<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N2, U3>> + SupersetOf<Unit<Quaternion<N1>>>,
fn to_superset(&self) -> Similarity<N2, U3, R>
[src]
fn to_superset(&self) -> Similarity<N2, U3, R>
fn is_in_subset(sim: &Similarity<N2, U3, R>) -> bool
[src]
fn is_in_subset(sim: &Similarity<N2, U3, R>) -> bool
unsafe fn from_superset_unchecked(
sim: &Similarity<N2, U3, R>
) -> Unit<Quaternion<N1>>
[src]
unsafe fn from_superset_unchecked(
sim: &Similarity<N2, U3, R>
) -> Unit<Quaternion<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2, C> SubsetOf<Transform<N2, U3, C>> for Unit<Quaternion<N1>> where
C: SuperTCategoryOf<TAffine>,
N1: Real,
N2: Real + SupersetOf<N1>,
[src]
impl<N1, N2, C> SubsetOf<Transform<N2, U3, C>> for Unit<Quaternion<N1>> where
C: SuperTCategoryOf<TAffine>,
N1: Real,
N2: Real + SupersetOf<N1>,
fn to_superset(&self) -> Transform<N2, U3, C>
[src]
fn to_superset(&self) -> Transform<N2, U3, C>
fn is_in_subset(t: &Transform<N2, U3, C>) -> bool
[src]
fn is_in_subset(t: &Transform<N2, U3, C>) -> bool
unsafe fn from_superset_unchecked(
t: &Transform<N2, U3, C>
) -> Unit<Quaternion<N1>>
[src]
unsafe fn from_superset_unchecked(
t: &Transform<N2, U3, C>
) -> Unit<Quaternion<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2> SubsetOf<Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>> for Unit<Complex<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
[src]
impl<N1, N2> SubsetOf<Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>> for Unit<Complex<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
fn to_superset(
&self
) -> Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>
[src]
fn to_superset(
&self
) -> Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>
fn is_in_subset(
m: &Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>
) -> bool
[src]
fn is_in_subset(
m: &Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>
) -> bool
unsafe fn from_superset_unchecked(
m: &Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>
) -> Unit<Complex<N1>>
[src]
unsafe fn from_superset_unchecked(
m: &Matrix<N2, U3, U3, <DefaultAllocator as Allocator<N2, U3, U3>>::Buffer>
) -> Unit<Complex<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2> SubsetOf<Rotation<N2, U2>> for Unit<Complex<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
[src]
impl<N1, N2> SubsetOf<Rotation<N2, U2>> for Unit<Complex<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
fn to_superset(&self) -> Rotation<N2, U2>
[src]
fn to_superset(&self) -> Rotation<N2, U2>
fn is_in_subset(rot: &Rotation<N2, U2>) -> bool
[src]
fn is_in_subset(rot: &Rotation<N2, U2>) -> bool
unsafe fn from_superset_unchecked(rot: &Rotation<N2, U2>) -> Unit<Complex<N1>>
[src]
unsafe fn from_superset_unchecked(rot: &Rotation<N2, U2>) -> Unit<Complex<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2> SubsetOf<Unit<Quaternion<N2>>> for Unit<Quaternion<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
[src]
impl<N1, N2> SubsetOf<Unit<Quaternion<N2>>> for Unit<Quaternion<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
fn to_superset(&self) -> Unit<Quaternion<N2>>
[src]
fn to_superset(&self) -> Unit<Quaternion<N2>>
fn is_in_subset(uq: &Unit<Quaternion<N2>>) -> bool
[src]
fn is_in_subset(uq: &Unit<Quaternion<N2>>) -> bool
unsafe fn from_superset_unchecked(
uq: &Unit<Quaternion<N2>>
) -> Unit<Quaternion<N1>>
[src]
unsafe fn from_superset_unchecked(
uq: &Unit<Quaternion<N2>>
) -> Unit<Quaternion<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2, R> SubsetOf<Isometry<N2, U3, R>> for Unit<Quaternion<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N2, U3>> + SupersetOf<Unit<Quaternion<N1>>>,
[src]
impl<N1, N2, R> SubsetOf<Isometry<N2, U3, R>> for Unit<Quaternion<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N2, U3>> + SupersetOf<Unit<Quaternion<N1>>>,
fn to_superset(&self) -> Isometry<N2, U3, R>
[src]
fn to_superset(&self) -> Isometry<N2, U3, R>
fn is_in_subset(iso: &Isometry<N2, U3, R>) -> bool
[src]
fn is_in_subset(iso: &Isometry<N2, U3, R>) -> bool
unsafe fn from_superset_unchecked(
iso: &Isometry<N2, U3, R>
) -> Unit<Quaternion<N1>>
[src]
unsafe fn from_superset_unchecked(
iso: &Isometry<N2, U3, R>
) -> Unit<Quaternion<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N1, N2, R> SubsetOf<Isometry<N2, U2, R>> for Unit<Complex<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N2, U2>> + SupersetOf<Unit<Complex<N1>>>,
[src]
impl<N1, N2, R> SubsetOf<Isometry<N2, U2, R>> for Unit<Complex<N1>> where
N1: Real,
N2: Real + SupersetOf<N1>,
R: Rotation<Point<N2, U2>> + SupersetOf<Unit<Complex<N1>>>,
fn to_superset(&self) -> Isometry<N2, U2, R>
[src]
fn to_superset(&self) -> Isometry<N2, U2, R>
fn is_in_subset(iso: &Isometry<N2, U2, R>) -> bool
[src]
fn is_in_subset(iso: &Isometry<N2, U2, R>) -> bool
unsafe fn from_superset_unchecked(
iso: &Isometry<N2, U2, R>
) -> Unit<Complex<N1>>
[src]
unsafe fn from_superset_unchecked(
iso: &Isometry<N2, U2, R>
) -> Unit<Complex<N1>>
fn from_superset(element: &T) -> Option<Self>
[src]
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct self
from the equivalent element of its superset. Read more
impl<N> Inverse<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> Inverse<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
fn inverse(&self) -> Unit<Quaternion<N>>
[src]
fn inverse(&self) -> Unit<Quaternion<N>>
fn inverse_mut(&mut self)
[src]
fn inverse_mut(&mut self)
impl<N> Inverse<Multiplicative> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> Inverse<Multiplicative> for Unit<Complex<N>> where
N: Real,
impl<N> ProjectiveTransformation<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> ProjectiveTransformation<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
fn inverse_transform_point(&self, pt: &Point<N, U2>) -> Point<N, U2>
[src]
fn inverse_transform_point(&self, pt: &Point<N, U2>) -> Point<N, U2>
fn inverse_transform_vector(
&self,
v: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
) -> Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
[src]
fn inverse_transform_vector(
&self,
v: &Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
) -> Matrix<N, U2, U1, <DefaultAllocator as Allocator<N, U2, U1>>::Buffer>
impl<N> ProjectiveTransformation<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> ProjectiveTransformation<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
fn inverse_transform_point(&self, pt: &Point<N, U3>) -> Point<N, U3>
[src]
fn inverse_transform_point(&self, pt: &Point<N, U3>) -> Point<N, U3>
fn inverse_transform_vector(
&self,
v: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
) -> Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
[src]
fn inverse_transform_vector(
&self,
v: &Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
) -> Matrix<N, U3, U1, <DefaultAllocator as Allocator<N, U3, U1>>::Buffer>
impl<T> Copy for Unit<T> where
T: Copy,
[src]
impl<T> Copy for Unit<T> where
T: Copy,
impl<N> AbstractMonoid<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> AbstractMonoid<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
fn prop_operating_identity_element_is_noop_approx(args: (Self,)) -> bool where
Self: RelativeEq,
[src]
fn prop_operating_identity_element_is_noop_approx(args: (Self,)) -> bool where
Self: RelativeEq,
Checks whether operating with the identity element is a no-op for the given argument. Approximate equality is used for verifications. Read more
fn prop_operating_identity_element_is_noop(args: (Self,)) -> bool where
Self: Eq,
[src]
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. Read more
impl<N> AbstractMonoid<Multiplicative> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> AbstractMonoid<Multiplicative> for Unit<Complex<N>> where
N: Real,
fn prop_operating_identity_element_is_noop_approx(args: (Self,)) -> bool where
Self: RelativeEq,
[src]
fn prop_operating_identity_element_is_noop_approx(args: (Self,)) -> bool where
Self: RelativeEq,
Checks whether operating with the identity element is a no-op for the given argument. Approximate equality is used for verifications. Read more
fn prop_operating_identity_element_is_noop(args: (Self,)) -> bool where
Self: Eq,
[src]
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. Read more
impl<T> Deref for Unit<T>
[src]
impl<T> Deref for Unit<T>
impl<T> Clone for Unit<T> where
T: Clone,
[src]
impl<T> Clone for Unit<T> where
T: Clone,
fn clone(&self) -> Unit<T>
[src]
fn clone(&self) -> Unit<T>
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
impl<N> Identity<Multiplicative> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> Identity<Multiplicative> for Unit<Complex<N>> where
N: Real,
impl<N> Identity<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> Identity<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
impl<N> DirectIsometry<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> DirectIsometry<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
impl<N> DirectIsometry<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> DirectIsometry<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
impl<N> AbstractMagma<Multiplicative> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> AbstractMagma<Multiplicative> for Unit<Complex<N>> where
N: Real,
fn operate(&self, rhs: &Unit<Complex<N>>) -> Unit<Complex<N>>
[src]
fn operate(&self, rhs: &Unit<Complex<N>>) -> Unit<Complex<N>>
fn op(&self, O, lhs: &Self) -> Self
[src]
fn op(&self, O, lhs: &Self) -> Self
Performs specific operation.
impl<N> AbstractMagma<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> AbstractMagma<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
fn operate(&self, rhs: &Unit<Quaternion<N>>) -> Unit<Quaternion<N>>
[src]
fn operate(&self, rhs: &Unit<Quaternion<N>>) -> Unit<Quaternion<N>>
fn op(&self, O, lhs: &Self) -> Self
[src]
fn op(&self, O, lhs: &Self) -> Self
Performs specific operation.
impl<N> AbstractQuasigroup<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> AbstractQuasigroup<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
fn prop_inv_is_latin_square_approx(args: (Self, Self)) -> bool where
Self: RelativeEq,
[src]
fn prop_inv_is_latin_square_approx(args: (Self, Self)) -> bool where
Self: RelativeEq,
Returns true
if latin squareness holds for the given arguments. Approximate equality is used for verifications. Read more
fn prop_inv_is_latin_square(args: (Self, Self)) -> bool where
Self: Eq,
[src]
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> AbstractQuasigroup<Multiplicative> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> AbstractQuasigroup<Multiplicative> for Unit<Complex<N>> where
N: Real,
fn prop_inv_is_latin_square_approx(args: (Self, Self)) -> bool where
Self: RelativeEq,
[src]
fn prop_inv_is_latin_square_approx(args: (Self, Self)) -> bool where
Self: RelativeEq,
Returns true
if latin squareness holds for the given arguments. Approximate equality is used for verifications. Read more
fn prop_inv_is_latin_square(args: (Self, Self)) -> bool where
Self: Eq,
[src]
fn prop_inv_is_latin_square(args: (Self, Self)) -> bool where
Self: Eq,
Returns true
if latin squareness holds for the given arguments.
impl<T> Debug for Unit<T> where
T: Debug,
[src]
impl<T> Debug for Unit<T> where
T: Debug,
impl<N> AbstractGroup<Multiplicative> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> AbstractGroup<Multiplicative> for Unit<Complex<N>> where
N: Real,
impl<N> AbstractGroup<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> AbstractGroup<Multiplicative> for Unit<Quaternion<N>> where
N: Real,
impl<'b, N> DivAssign<&'b Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'b, N> DivAssign<&'b Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
fn div_assign(&mut self, rhs: &'b Unit<Complex<N>>)
[src]
fn div_assign(&mut self, rhs: &'b Unit<Complex<N>>)
impl<'b, N> DivAssign<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
[src]
impl<'b, N> DivAssign<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
fn div_assign(&mut self, rhs: &'b Unit<Complex<N>>)
[src]
fn div_assign(&mut self, rhs: &'b Unit<Complex<N>>)
impl<N> DivAssign<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<N> DivAssign<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
fn div_assign(&mut self, rhs: Unit<Quaternion<N>>)
[src]
fn div_assign(&mut self, rhs: Unit<Quaternion<N>>)
impl<N> DivAssign<Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> DivAssign<Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
fn div_assign(&mut self, rhs: Unit<Complex<N>>)
[src]
fn div_assign(&mut self, rhs: Unit<Complex<N>>)
impl<N> DivAssign<Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<N> DivAssign<Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
fn div_assign(&mut self, rhs: Rotation<N, U3>)
[src]
fn div_assign(&mut self, rhs: Rotation<N, U3>)
impl<N, C> DivAssign<Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategory,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<N, C> DivAssign<Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategory,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
fn div_assign(&mut self, rhs: Unit<Quaternion<N>>)
[src]
fn div_assign(&mut self, rhs: Unit<Quaternion<N>>)
impl<'b, N> DivAssign<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'b, N> DivAssign<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
fn div_assign(&mut self, rhs: &'b Unit<Quaternion<N>>)
[src]
fn div_assign(&mut self, rhs: &'b Unit<Quaternion<N>>)
impl<'b, N> DivAssign<&'b Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'b, N> DivAssign<&'b Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
fn div_assign(&mut self, rhs: &'b Rotation<N, U2>)
[src]
fn div_assign(&mut self, rhs: &'b Rotation<N, U2>)
impl<'b, N, C> DivAssign<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategory,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'b, N, C> DivAssign<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategory,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
fn div_assign(&mut self, rhs: &'b Unit<Quaternion<N>>)
[src]
fn div_assign(&mut self, rhs: &'b Unit<Quaternion<N>>)
impl<N> DivAssign<Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<N> DivAssign<Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
fn div_assign(&mut self, rhs: Rotation<N, U2>)
[src]
fn div_assign(&mut self, rhs: Rotation<N, U2>)
impl<N> DivAssign<Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<N> DivAssign<Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
fn div_assign(&mut self, rhs: Unit<Complex<N>>)
[src]
fn div_assign(&mut self, rhs: Unit<Complex<N>>)
impl<'b, N> DivAssign<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<'b, N> DivAssign<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
fn div_assign(&mut self, rhs: &'b Rotation<N, U3>)
[src]
fn div_assign(&mut self, rhs: &'b Rotation<N, U3>)
impl<T> Serialize for Unit<T> where
T: Serialize,
[src]
impl<T> Serialize for Unit<T> where
T: Serialize,
fn serialize<S>(
&self,
serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> where
S: Serializer,
[src]
fn serialize<S>(
&self,
serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> where
S: Serializer,
impl<'de, T> Deserialize<'de> for Unit<T> where
T: Deserialize<'de>,
[src]
impl<'de, T> Deserialize<'de> for Unit<T> where
T: Deserialize<'de>,
fn deserialize<D>(
deserializer: D
) -> Result<Unit<T>, <D as Deserializer<'de>>::Error> where
D: Deserializer<'de>,
[src]
fn deserialize<D>(
deserializer: D
) -> Result<Unit<T>, <D as Deserializer<'de>>::Error> where
D: Deserializer<'de>,
impl<N> One for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> One for Unit<Quaternion<N>> where
N: Real,
fn one() -> Unit<Quaternion<N>>
[src]
fn one() -> Unit<Quaternion<N>>
fn is_one(&self) -> bool where
Self: PartialEq<Self>,
[src]
fn is_one(&self) -> bool where
Self: PartialEq<Self>,
Returns true
if self
is equal to the multiplicative identity. Read more
impl<N> One for Unit<Complex<N>> where
N: Real,
[src]
impl<N> One for Unit<Complex<N>> where
N: Real,
fn one() -> Unit<Complex<N>>
[src]
fn one() -> Unit<Complex<N>>
fn is_one(&self) -> bool where
Self: PartialEq<Self>,
[src]
fn is_one(&self) -> bool where
Self: PartialEq<Self>,
Returns true
if self
is equal to the multiplicative identity. Read more
impl<'a, 'b, N> Div<&'b Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<'a, 'b, N> Div<&'b Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Rotation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Rotation<N, U3>>>::Output
[src]
fn div(
self,
rhs: &'b Rotation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Rotation<N, U3>>>::Output
impl<'a, 'b, N, C> Div<&'b Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
[src]
impl<'a, 'b, N, C> Div<&'b Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Transform<N, U3, C>>>::Output
[src]
fn div(
self,
rhs: &'b Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Transform<N, U3, C>>>::Output
impl<'a, 'b, N> Div<&'b Rotation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'a, 'b, N> Div<&'b Rotation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Div<&'b Rotation<N, U2>>>::Output
[src]
fn div(
self,
rhs: &'b Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Div<&'b Rotation<N, U2>>>::Output
impl<'a, N> Div<Unit<Quaternion<N>>> for &'a Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, N> Div<Unit<Quaternion<N>>> for &'a Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Rotation<N, U3> as Div<Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Rotation<N, U3> as Div<Unit<Quaternion<N>>>>::Output
impl<'a, N> Div<Unit<Complex<N>>> for &'a Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'a, N> Div<Unit<Complex<N>>> for &'a Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Unit<Complex<N>>
) -> <&'a Rotation<N, U2> as Div<Unit<Complex<N>>>>::Output
[src]
fn div(
self,
rhs: Unit<Complex<N>>
) -> <&'a Rotation<N, U2> as Div<Unit<Complex<N>>>>::Output
impl<N> Div<Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<N> Div<Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Rotation<N, U3>
) -> <Unit<Quaternion<N>> as Div<Rotation<N, U3>>>::Output
[src]
fn div(
self,
rhs: Rotation<N, U3>
) -> <Unit<Quaternion<N>> as Div<Rotation<N, U3>>>::Output
impl<'b, N> Div<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<'b, N> Div<&'b Rotation<N, U3>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Rotation<N, U3>
) -> <Unit<Quaternion<N>> as Div<&'b Rotation<N, U3>>>::Output
[src]
fn div(
self,
rhs: &'b Rotation<N, U3>
) -> <Unit<Quaternion<N>> as Div<&'b Rotation<N, U3>>>::Output
impl<'b, N> Div<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'b, N> Div<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the /
operator.
fn div(
self,
right: &'b Isometry<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Div<&'b Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn div(
self,
right: &'b Isometry<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Div<&'b Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
impl<N> Div<Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<N> Div<Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Rotation<N, U2>
) -> <Unit<Complex<N>> as Div<Rotation<N, U2>>>::Output
[src]
fn div(
self,
rhs: Rotation<N, U2>
) -> <Unit<Complex<N>> as Div<Rotation<N, U2>>>::Output
impl<'a, N> Div<Unit<Complex<N>>> for &'a Unit<Complex<N>> where
N: Real,
[src]
impl<'a, N> Div<Unit<Complex<N>>> for &'a Unit<Complex<N>> where
N: Real,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>
[src]
fn div(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>
impl<'a, 'b, N> Div<&'b Unit<Complex<N>>> for &'a Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'a, 'b, N> Div<&'b Unit<Complex<N>>> for &'a Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Unit<Complex<N>>
) -> <&'a Rotation<N, U2> as Div<&'b Unit<Complex<N>>>>::Output
[src]
fn div(
self,
rhs: &'b Unit<Complex<N>>
) -> <&'a Rotation<N, U2> as Div<&'b Unit<Complex<N>>>>::Output
impl<'b, N> Div<&'b Unit<Quaternion<N>>> for Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'b, N> Div<&'b Unit<Quaternion<N>>> for Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Rotation<N, U3> as Div<&'b Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Rotation<N, U3> as Div<&'b Unit<Quaternion<N>>>>::Output
impl<N, C> Div<Transform<N, U3, C>> for Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
[src]
impl<N, C> Div<Transform<N, U3, C>> for Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Div<Transform<N, U3, C>>>::Output
[src]
fn div(
self,
rhs: Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Div<Transform<N, U3, C>>>::Output
impl<'b, N> Div<&'b Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'b, N> Div<&'b Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Unit<Complex<N>>
) -> <Rotation<N, U2> as Div<&'b Unit<Complex<N>>>>::Output
[src]
fn div(
self,
rhs: &'b Unit<Complex<N>>
) -> <Rotation<N, U2> as Div<&'b Unit<Complex<N>>>>::Output
impl<'b, N> Div<&'b Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'b, N> Div<&'b Rotation<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Rotation<N, U2>
) -> <Unit<Complex<N>> as Div<&'b Rotation<N, U2>>>::Output
[src]
fn div(
self,
rhs: &'b Rotation<N, U2>
) -> <Unit<Complex<N>> as Div<&'b Rotation<N, U2>>>::Output
impl<'a, N, C> Div<Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
[src]
impl<'a, N, C> Div<Transform<N, U3, C>> for &'a Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Div<Transform<N, U3, C>>>::Output
[src]
fn div(
self,
rhs: Transform<N, U3, C>
) -> <&'a Unit<Quaternion<N>> as Div<Transform<N, U3, C>>>::Output
impl<'a, 'b, N> Div<&'b Unit<Quaternion<N>>> for &'a Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, 'b, N> Div<&'b Unit<Quaternion<N>>> for &'a Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Rotation<N, U3> as Div<&'b Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Rotation<N, U3> as Div<&'b Unit<Quaternion<N>>>>::Output
impl<'b, N> Div<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'b, N> Div<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Similarity<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the /
operator.
fn div(
self,
right: &'b Similarity<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Div<&'b Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn div(
self,
right: &'b Similarity<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Div<&'b Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
impl<'a, 'b, N> Div<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, 'b, N> Div<&'b Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the /
operator.
fn div(
self,
right: &'b Isometry<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn div(
self,
right: &'b Isometry<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
impl<'b, N, C> Div<&'b Transform<N, U3, C>> for Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
[src]
impl<'b, N, C> Div<&'b Transform<N, U3, C>> for Unit<Quaternion<N>> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U4>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Div<&'b Transform<N, U3, C>>>::Output
[src]
fn div(
self,
rhs: &'b Transform<N, U3, C>
) -> <Unit<Quaternion<N>> as Div<&'b Transform<N, U3, C>>>::Output
impl<N> Div<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<N> Div<Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <Unit<Quaternion<N>> as Div<Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <Unit<Quaternion<N>> as Div<Unit<Quaternion<N>>>>::Output
impl<'b, N> Div<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'b, N> Div<&'b Unit<Quaternion<N>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Unit<Quaternion<N>> as Div<&'b Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Unit<Quaternion<N>> as Div<&'b Unit<Quaternion<N>>>>::Output
impl<'a, N> Div<Similarity<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, N> Div<Similarity<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Similarity<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the /
operator.
fn div(
self,
right: Similarity<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Div<Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn div(
self,
right: Similarity<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Div<Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
impl<N> Div<Similarity<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<N> Div<Similarity<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Similarity<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the /
operator.
fn div(
self,
right: Similarity<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Div<Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn div(
self,
right: Similarity<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Div<Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
impl<'a, 'b, N> Div<&'b Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, 'b, N> Div<&'b Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Unit<Quaternion<N>>>>::Output
impl<'a, N> Div<Rotation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<'a, N> Div<Rotation<N, U2>> for &'a Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Div<Rotation<N, U2>>>::Output
[src]
fn div(
self,
rhs: Rotation<N, U2>
) -> <&'a Unit<Complex<N>> as Div<Rotation<N, U2>>>::Output
impl<'a, N> Div<Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, N> Div<Unit<Quaternion<N>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Unit<Quaternion<N>> as Div<Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Unit<Quaternion<N>> as Div<Unit<Quaternion<N>>>>::Output
impl<N> Div<Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
[src]
impl<N> Div<Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>
[src]
fn div(self, rhs: Unit<Complex<N>>) -> Unit<Complex<N>>
impl<N> Div<Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<N> Div<Isometry<N, U3, Unit<Quaternion<N>>>> for Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the /
operator.
fn div(
self,
right: Isometry<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Div<Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn div(
self,
right: Isometry<N, U3, Unit<Quaternion<N>>>
) -> <Unit<Quaternion<N>> as Div<Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
impl<N, C> Div<Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<N, C> Div<Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Div<Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Div<Unit<Quaternion<N>>>>::Output
impl<'a, N, C> Div<Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, N, C> Div<Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Div<Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Div<Unit<Quaternion<N>>>>::Output
impl<N> Div<Unit<Quaternion<N>>> for Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<N> Div<Unit<Quaternion<N>>> for Rotation<N, U3> where
N: Real,
DefaultAllocator: Allocator<N, U3, U3>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <Rotation<N, U3> as Div<Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: Unit<Quaternion<N>>
) -> <Rotation<N, U3> as Div<Unit<Quaternion<N>>>>::Output
impl<'b, N, C> Div<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'b, N, C> Div<&'b Unit<Quaternion<N>>> for Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Div<&'b Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <Transform<N, U3, C> as Div<&'b Unit<Quaternion<N>>>>::Output
impl<'a, N> Div<Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, N> Div<Isometry<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Isometry<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the /
operator.
fn div(
self,
right: Isometry<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Div<Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn div(
self,
right: Isometry<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Div<Isometry<N, U3, Unit<Quaternion<N>>>>>::Output
impl<'b, N> Div<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
[src]
impl<'b, N> Div<&'b Unit<Complex<N>>> for Unit<Complex<N>> where
N: Real,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>
[src]
fn div(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>
impl<'a, 'b, N, C> Div<&'b Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
[src]
impl<'a, 'b, N, C> Div<&'b Unit<Quaternion<N>>> for &'a Transform<N, U3, C> where
C: TCategoryMul<TAffine>,
N: Scalar + Zero + One + ClosedAdd<N> + ClosedMul<N> + Real,
DefaultAllocator: Allocator<N, U4, U4>,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U4, U1>,
type Output = Transform<N, U3, <C as TCategoryMul<TAffine>>::Representative>
The resulting type after applying the /
operator.
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Div<&'b Unit<Quaternion<N>>>>::Output
[src]
fn div(
self,
rhs: &'b Unit<Quaternion<N>>
) -> <&'a Transform<N, U3, C> as Div<&'b Unit<Quaternion<N>>>>::Output
impl<'a, 'b, N> Div<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
[src]
impl<'a, 'b, N> Div<&'b Similarity<N, U3, Unit<Quaternion<N>>>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U1>,
type Output = Similarity<N, U3, Unit<Quaternion<N>>>
The resulting type after applying the /
operator.
fn div(
self,
right: &'b Similarity<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
[src]
fn div(
self,
right: &'b Similarity<N, U3, Unit<Quaternion<N>>>
) -> <&'a Unit<Quaternion<N>> as Div<&'b Similarity<N, U3, Unit<Quaternion<N>>>>>::Output
impl<N> Div<Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
[src]
impl<N> Div<Unit<Complex<N>>> for Rotation<N, U2> where
N: Real,
DefaultAllocator: Allocator<N, U2, U2>,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Unit<Complex<N>>
) -> <Rotation<N, U2> as Div<Unit<Complex<N>>>>::Output
[src]
fn div(
self,
rhs: Unit<Complex<N>>
) -> <Rotation<N, U2> as Div<Unit<Complex<N>>>>::Output
impl<'a, 'b, N> Div<&'b Unit<Complex<N>>> for &'a Unit<Complex<N>> where
N: Real,
[src]
impl<'a, 'b, N> Div<&'b Unit<Complex<N>>> for &'a Unit<Complex<N>> where
N: Real,
type Output = Unit<Complex<N>>
The resulting type after applying the /
operator.
fn div(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>
[src]
fn div(self, rhs: &'b Unit<Complex<N>>) -> Unit<Complex<N>>
impl<'a, N> Div<Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
[src]
impl<'a, N> Div<Rotation<N, U3>> for &'a Unit<Quaternion<N>> where
N: Real,
DefaultAllocator: Allocator<N, U4, U1>,
DefaultAllocator: Allocator<N, U3, U3>,
type Output = Unit<Quaternion<N>>
The resulting type after applying the /
operator.
fn div(
self,
rhs: Rotation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Div<Rotation<N, U3>>>::Output
[src]
fn div(
self,
rhs: Rotation<N, U3>
) -> <&'a Unit<Quaternion<N>> as Div<Rotation<N, U3>>>::Output
impl<N> Similarity<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> Similarity<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
type Scaling = Id<Multiplicative>
The type of the pure (uniform) scaling part of this similarity transformation.
fn translation(&self) -> Id<Multiplicative>
[src]
fn translation(&self) -> Id<Multiplicative>
fn rotation(&self) -> Unit<Complex<N>>
[src]
fn rotation(&self) -> Unit<Complex<N>>
fn scaling(&self) -> Id<Multiplicative>
[src]
fn scaling(&self) -> Id<Multiplicative>
fn translate_point(&self, pt: &E) -> E
[src]
fn translate_point(&self, pt: &E) -> E
Applies this transformation's pure translational part to a point.
fn rotate_point(&self, pt: &E) -> E
[src]
fn rotate_point(&self, pt: &E) -> E
Applies this transformation's pure rotational part to a point.
fn scale_point(&self, pt: &E) -> E
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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<N> Similarity<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> Similarity<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
type Scaling = Id<Multiplicative>
The type of the pure (uniform) scaling part of this similarity transformation.
fn translation(&self) -> Id<Multiplicative>
[src]
fn translation(&self) -> Id<Multiplicative>
fn rotation(&self) -> Unit<Quaternion<N>>
[src]
fn rotation(&self) -> Unit<Quaternion<N>>
fn scaling(&self) -> Id<Multiplicative>
[src]
fn scaling(&self) -> Id<Multiplicative>
fn translate_point(&self, pt: &E) -> E
[src]
fn translate_point(&self, pt: &E) -> E
Applies this transformation's pure translational part to a point.
fn rotate_point(&self, pt: &E) -> E
[src]
fn rotate_point(&self, pt: &E) -> E
Applies this transformation's pure rotational part to a point.
fn scale_point(&self, pt: &E) -> E
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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<N> UlpsEq for Unit<Complex<N>> where
N: Real,
[src]
impl<N> UlpsEq for Unit<Complex<N>> where
N: Real,
fn default_max_ulps() -> u32
[src]
fn default_max_ulps() -> u32
fn ulps_eq(
&self,
other: &Unit<Complex<N>>,
epsilon: <Unit<Complex<N>> as AbsDiffEq>::Epsilon,
max_ulps: u32
) -> bool
[src]
fn ulps_eq(
&self,
other: &Unit<Complex<N>>,
epsilon: <Unit<Complex<N>> as AbsDiffEq>::Epsilon,
max_ulps: u32
) -> bool
fn ulps_ne(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool
[src]
fn ulps_ne(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool
The inverse of ApproxEq::ulps_eq
.
impl<N> UlpsEq for Unit<Quaternion<N>> where
N: UlpsEq<Epsilon = N> + Real,
[src]
impl<N> UlpsEq for Unit<Quaternion<N>> where
N: UlpsEq<Epsilon = N> + Real,
fn default_max_ulps() -> u32
[src]
fn default_max_ulps() -> u32
fn ulps_eq(
&self,
other: &Unit<Quaternion<N>>,
epsilon: <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon,
max_ulps: u32
) -> bool
[src]
fn ulps_eq(
&self,
other: &Unit<Quaternion<N>>,
epsilon: <Unit<Quaternion<N>> as AbsDiffEq>::Epsilon,
max_ulps: u32
) -> bool
fn ulps_ne(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool
[src]
fn ulps_ne(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool
The inverse of ApproxEq::ulps_eq
.
impl<N, R, C, S> UlpsEq for Unit<Matrix<N, R, C, S>> where
C: Dim,
N: Scalar + UlpsEq,
R: Dim,
S: Storage<N, R, C>,
<N as AbsDiffEq>::Epsilon: Copy,
[src]
impl<N, R, C, S> UlpsEq for Unit<Matrix<N, R, C, S>> where
C: Dim,
N: Scalar + UlpsEq,
R: Dim,
S: Storage<N, R, C>,
<N as AbsDiffEq>::Epsilon: Copy,
fn default_max_ulps() -> u32
[src]
fn default_max_ulps() -> u32
fn ulps_eq(
&self,
other: &Unit<Matrix<N, R, C, S>>,
epsilon: <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon,
max_ulps: u32
) -> bool
[src]
fn ulps_eq(
&self,
other: &Unit<Matrix<N, R, C, S>>,
epsilon: <Unit<Matrix<N, R, C, S>> as AbsDiffEq>::Epsilon,
max_ulps: u32
) -> bool
fn ulps_ne(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool
[src]
fn ulps_ne(&self, other: &Self, epsilon: Self::Epsilon, max_ulps: u32) -> bool
The inverse of ApproxEq::ulps_eq
.
impl<N> OrthogonalTransformation<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> OrthogonalTransformation<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
impl<N> OrthogonalTransformation<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> OrthogonalTransformation<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
impl<N> Isometry<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
[src]
impl<N> Isometry<Point<N, U2>> for Unit<Complex<N>> where
N: Real,
DefaultAllocator: Allocator<N, U2, U1>,
impl<N> Isometry<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
[src]
impl<N> Isometry<Point<N, U3>> for Unit<Quaternion<N>> where
N: Real,
impl From<Unit<Quaternion<f32>>> for Node
[src]
impl From<Unit<Quaternion<f32>>> for Node
fn from(q: UnitQuaternion<f32>) -> Node
[src]
fn from(q: UnitQuaternion<f32>) -> Node
impl<'a> From<&'a Unit<Quaternion<f32>>> for Model
[src]
impl<'a> From<&'a Unit<Quaternion<f32>>> for Model
fn from(q: &UnitQuaternion<f32>) -> Model
[src]
fn from(q: &UnitQuaternion<f32>) -> Model
Auto Trait Implementations
Blanket Implementations
impl<T, U> Into for T where
U: From<T>,
[src]
impl<T, U> Into for T where
U: From<T>,
impl<T> ToString for T where
T: Display + ?Sized,
[src]
impl<T> ToString for T where
T: Display + ?Sized,
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
impl<T> From for T
[src]
impl<T> From for T
impl<T, U> TryFrom for T where
T: From<U>,
[src]
impl<T, U> TryFrom for T where
T: From<U>,
type Error = !
try_from
)The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T> Borrow for T where
T: ?Sized,
[src]
impl<T> Borrow for T where
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
impl<T> Any for T where
T: 'static + ?Sized,
fn get_type_id(&self) -> TypeId
[src]
fn get_type_id(&self) -> TypeId
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
try_from
)The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
impl<T> BorrowMut for T where
T: ?Sized,
[src]
impl<T> BorrowMut for T where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
fn borrow_mut(&mut self) -> &mut T
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[u32; 3]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[u32; 3]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<A> AsUniform for A where
A: AsRef<u32>,
[src]
impl<A> AsUniform for A where
A: AsRef<u32>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[u32; 2]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[u32; 2]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<[i32; 2]>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<[i32; 2]>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[f32; 4]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[f32; 4]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[f32; 4]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[f32; 4]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[i32; 2]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[i32; 2]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[i32; 3]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[i32; 3]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[f32; 2]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[f32; 2]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[u32; 4]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[u32; 4]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[u32; 4]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[u32; 4]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<u32> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<u32> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<[u32; 2]>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<[u32; 2]>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[i32; 4]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[i32; 4]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<A> AsUniform for A where
A: AsRef<i32>,
[src]
impl<A> AsUniform for A where
A: AsRef<i32>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<[f32; 2]>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<[f32; 2]>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<[u32; 3]>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<[u32; 3]>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<[[f32; 4]; 4]>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<[[f32; 4]; 4]>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<[[f32; 3]; 3]>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<[[f32; 3]; 3]>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[f32; 3]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[f32; 3]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[u32; 2]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[u32; 2]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[[f32; 4]; 4]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[[f32; 4]; 4]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<u32>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<u32>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<i32> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<i32> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[[f32; 3]; 3]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[[f32; 3]; 3]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[i32; 4]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[i32; 4]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<i32>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<i32>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[[f32; 3]; 3]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[[f32; 3]; 3]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[f32; 3]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[f32; 3]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[i32; 2]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[i32; 2]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<[f32; 3]>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<[f32; 3]>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<[i32; 3]>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<[i32; 3]>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[f32; 2]> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<[f32; 2]> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[f32; 9]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[f32; 9]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[u32; 3]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[u32; 3]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[[f32; 4]; 4]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[[f32; 4]; 4]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<A> AsUniform for A where
A: AsRef<f32>,
[src]
impl<A> AsUniform for A where
A: AsRef<f32>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> AsUniform for T where
T: AsRef<[i32; 3]>,
[src]
impl<T> AsUniform for T where
T: AsRef<[i32; 3]>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<f32> + 'static>,
U: Deref<Target = T>,
[src]
impl<U, T> AsUniform for U where
T: AsUniform<dyn AsRef<f32> + 'static>,
U: Deref<Target = T>,
fn as_uniform(&self) -> UniformValue
[src]
fn as_uniform(&self) -> UniformValue
impl<T> Any for T where
T: Any,
[src]
impl<T> Any for T where
T: Any,
fn get_type_id(&self) -> TypeId
[src]
fn get_type_id(&self) -> TypeId
impl<T> SetParameter for T
[src]
impl<T> SetParameter for T
fn set<T>(&mut self, value: T) -> <T as Parameter<Self>>::Result where
T: Parameter<Self>,
[src]
fn set<T>(&mut self, value: T) -> <T as Parameter<Self>>::Result where
T: Parameter<Self>,
Sets value
as a parameter of self
.
impl<T> DeserializeOwned for T where
T: Deserialize<'de>,
[src]
impl<T> DeserializeOwned for T where
T: Deserialize<'de>,
impl<V> IntoVec for V
[src]
impl<V> IntoVec for V
impl<T> IntoPnt for T where
T: Scalar,
[src]
impl<T> IntoPnt for T where
T: Scalar,
impl<T> IntoPnt for T where
T: Scalar,
[src]
impl<T> IntoPnt for T where
T: Scalar,
impl<T> IntoPnt for T where
T: Scalar,
[src]
impl<T> IntoPnt for T where
T: Scalar,
impl<V> IntoPnt for V
[src]
impl<V> IntoPnt for V
impl<T> Scalar for T where
T: Copy + PartialEq<T> + Any + Debug,
[src]
impl<T> Scalar for T where
T: Copy + PartialEq<T> + Any + Debug,
impl<T, Right> ClosedDiv for T where
T: Div<Right, Output = T> + DivAssign<Right>,
[src]
impl<T, Right> ClosedDiv for T where
T: Div<Right, Output = T> + DivAssign<Right>,
impl<SS, SP> SupersetOf for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf for SP where
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
[src]
fn to_subset(&self) -> Option<SS>
fn is_in_subset(&self) -> bool
[src]
fn is_in_subset(&self) -> bool
unsafe fn to_subset_unchecked(&self) -> SS
[src]
unsafe fn to_subset_unchecked(&self) -> SS
fn from_subset(element: &SS) -> SP
[src]
fn from_subset(element: &SS) -> SP
impl<T, Right> ClosedMul for T where
T: Mul<Right, Output = T> + MulAssign<Right>,
[src]
impl<T, Right> ClosedMul for T where
T: Mul<Right, Output = T> + MulAssign<Right>,
impl<T> ClosedNeg for T where
T: Neg<Output = T>,
[src]
impl<T> ClosedNeg for T where
T: Neg<Output = T>,
impl<R, E> Transformation for R where
E: EuclideanSpace<Real = R>,
R: Real,
<E as EuclideanSpace>::Coordinates: ClosedMul<R>,
<E as EuclideanSpace>::Coordinates: ClosedDiv<R>,
<E as EuclideanSpace>::Coordinates: ClosedNeg,
[src]
impl<R, E> Transformation for R where
E: EuclideanSpace<Real = R>,
R: Real,
<E as EuclideanSpace>::Coordinates: ClosedMul<R>,
<E as EuclideanSpace>::Coordinates: ClosedDiv<R>,
<E as EuclideanSpace>::Coordinates: ClosedNeg,
fn transform_point(&self, pt: &E) -> E
[src]
fn transform_point(&self, pt: &E) -> E
fn transform_vector(
&self,
v: &<E as EuclideanSpace>::Coordinates
) -> <E as EuclideanSpace>::Coordinates
[src]
fn transform_vector(
&self,
v: &<E as EuclideanSpace>::Coordinates
) -> <E as EuclideanSpace>::Coordinates
impl<R, E> ProjectiveTransformation for R where
E: EuclideanSpace<Real = R>,
R: Real,
<E as EuclideanSpace>::Coordinates: ClosedMul<R>,
<E as EuclideanSpace>::Coordinates: ClosedDiv<R>,
<E as EuclideanSpace>::Coordinates: ClosedNeg,
[src]
impl<R, E> ProjectiveTransformation for R where
E: EuclideanSpace<Real = R>,
R: Real,
<E as EuclideanSpace>::Coordinates: ClosedMul<R>,
<E as EuclideanSpace>::Coordinates: ClosedDiv<R>,
<E as EuclideanSpace>::Coordinates: ClosedNeg,
fn inverse_transform_point(&self, pt: &E) -> E
[src]
fn inverse_transform_point(&self, pt: &E) -> E
fn inverse_transform_vector(
&self,
v: &<E as EuclideanSpace>::Coordinates
) -> <E as EuclideanSpace>::Coordinates
[src]
fn inverse_transform_vector(
&self,
v: &<E as EuclideanSpace>::Coordinates
) -> <E as EuclideanSpace>::Coordinates
impl<R, E> AffineTransformation for R where
E: EuclideanSpace<Real = R>,
R: Real,
<E as EuclideanSpace>::Coordinates: ClosedMul<R>,
<E as EuclideanSpace>::Coordinates: ClosedDiv<R>,
<E as EuclideanSpace>::Coordinates: ClosedNeg,
[src]
impl<R, E> AffineTransformation for R where
E: EuclideanSpace<Real = R>,
R: Real,
<E as EuclideanSpace>::Coordinates: ClosedMul<R>,
<E as EuclideanSpace>::Coordinates: ClosedDiv<R>,
<E as EuclideanSpace>::Coordinates: ClosedNeg,
type Rotation = Id<Multiplicative>
Type of the first rotation to be applied.
type NonUniformScaling = R
Type of the non-uniform scaling to be applied.
type Translation = Id<Multiplicative>
The type of the pure translation part of this affine transformation.
fn decompose(
&self
) -> (Id<Multiplicative>, Id<Multiplicative>, R, Id<Multiplicative>)
[src]
fn decompose(
&self
) -> (Id<Multiplicative>, Id<Multiplicative>, R, Id<Multiplicative>)
fn append_translation(&self, &<R as AffineTransformation<E>>::Translation) -> R
[src]
fn append_translation(&self, &<R as AffineTransformation<E>>::Translation) -> R
fn prepend_translation(&self, &<R as AffineTransformation<E>>::Translation) -> R
[src]
fn prepend_translation(&self, &<R as AffineTransformation<E>>::Translation) -> R
fn append_rotation(&self, &<R as AffineTransformation<E>>::Rotation) -> R
[src]
fn append_rotation(&self, &<R as AffineTransformation<E>>::Rotation) -> R
fn prepend_rotation(&self, &<R as AffineTransformation<E>>::Rotation) -> R
[src]
fn prepend_rotation(&self, &<R as AffineTransformation<E>>::Rotation) -> R
fn append_scaling(
&self,
s: &<R as AffineTransformation<E>>::NonUniformScaling
) -> R
[src]
fn append_scaling(
&self,
s: &<R as AffineTransformation<E>>::NonUniformScaling
) -> R
fn prepend_scaling(
&self,
s: &<R as AffineTransformation<E>>::NonUniformScaling
) -> R
[src]
fn prepend_scaling(
&self,
s: &<R as AffineTransformation<E>>::NonUniformScaling
) -> R
fn append_rotation_wrt_point(&self, r: &Self::Rotation, p: &E) -> Option<Self>
[src]
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. Read more
impl<R, E> Similarity for R where
E: EuclideanSpace<Real = R>,
R: Real + SubsetOf<R>,
<E as EuclideanSpace>::Coordinates: ClosedMul<R>,
<E as EuclideanSpace>::Coordinates: ClosedDiv<R>,
<E as EuclideanSpace>::Coordinates: ClosedNeg,
[src]
impl<R, E> Similarity for R where
E: EuclideanSpace<Real = R>,
R: Real + SubsetOf<R>,
<E as EuclideanSpace>::Coordinates: ClosedMul<R>,
<E as EuclideanSpace>::Coordinates: ClosedDiv<R>,
<E as EuclideanSpace>::Coordinates: ClosedNeg,
type Scaling = R
The type of the pure (uniform) scaling part of this similarity transformation.
fn translation(&self) -> <R as AffineTransformation<E>>::Translation
[src]
fn translation(&self) -> <R as AffineTransformation<E>>::Translation
fn rotation(&self) -> <R as AffineTransformation<E>>::Rotation
[src]
fn rotation(&self) -> <R as AffineTransformation<E>>::Rotation
fn scaling(&self) -> <R as Similarity<E>>::Scaling
[src]
fn scaling(&self) -> <R as Similarity<E>>::Scaling
fn translate_point(&self, pt: &E) -> E
[src]
fn translate_point(&self, pt: &E) -> E
Applies this transformation's pure translational part to a point.
fn rotate_point(&self, pt: &E) -> E
[src]
fn rotate_point(&self, pt: &E) -> E
Applies this transformation's pure rotational part to a point.
fn scale_point(&self, pt: &E) -> E
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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
[src]
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<T> MultiplicativeMonoid for T where
T: AbstractMonoid<Multiplicative> + MultiplicativeSemigroup + One,
[src]
impl<T> MultiplicativeMonoid for T where
T: AbstractMonoid<Multiplicative> + MultiplicativeSemigroup + One,
impl<T> MultiplicativeGroup for T where
T: AbstractGroup<Multiplicative> + MultiplicativeLoop + MultiplicativeMonoid,
[src]
impl<T> MultiplicativeGroup for T where
T: AbstractGroup<Multiplicative> + MultiplicativeLoop + MultiplicativeMonoid,
impl<T> Same for T
[src]
impl<T> Same for T
type Output = T
Should always be Self
impl<T> Rand for T where
Standard: Distribution<T>,
[src]
impl<T> Rand for T where
Standard: Distribution<T>,
impl<T> MultiplicativeMagma for T where
T: AbstractMagma<Multiplicative>,
[src]
impl<T> MultiplicativeMagma for T where
T: AbstractMagma<Multiplicative>,
impl<T> MultiplicativeQuasigroup for T where
T: AbstractQuasigroup<Multiplicative> + ClosedDiv<T> + MultiplicativeMagma,
[src]
impl<T> MultiplicativeQuasigroup for T where
T: AbstractQuasigroup<Multiplicative> + ClosedDiv<T> + MultiplicativeMagma,
impl<T> MultiplicativeLoop for T where
T: AbstractLoop<Multiplicative> + MultiplicativeQuasigroup + One,
[src]
impl<T> MultiplicativeLoop for T where
T: AbstractLoop<Multiplicative> + MultiplicativeQuasigroup + One,
impl<T> MultiplicativeSemigroup for T where
T: AbstractSemigroup<Multiplicative> + ClosedMul<T> + MultiplicativeMagma,
[src]
impl<T> MultiplicativeSemigroup for T where
T: AbstractSemigroup<Multiplicative> + ClosedMul<T> + MultiplicativeMagma,