Struct Scale

#[repr(C)]
pub struct Scale<T, const D: usize> {
    pub vector: Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>,
}

A scale which supports non-uniform scaling.

Fields

vector: Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>

The scale coordinates, i.e., how much is multiplied to a point’s coordinates when it is scaled.

Implementations

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

where T: Scalar,

pub fn try_inverse(&self) -> Option<Scale<T, D>>

where T: ClosedDiv + One + Zero,

Inverts self.

Example

let t = Scale3::new(1.0, 2.0, 3.0);
assert_eq!(t * t.try_inverse().unwrap(), Scale3::identity());
assert_eq!(t.try_inverse().unwrap() * t, Scale3::identity());

// Work in all dimensions.
let t = Scale2::new(1.0, 2.0);
assert_eq!(t * t.try_inverse().unwrap(), Scale2::identity());
assert_eq!(t.try_inverse().unwrap() * t, Scale2::identity());

// Returns None if any coordinate is 0.
let t = Scale2::new(0.0, 2.0);
assert_eq!(t.try_inverse(), None);

pub unsafe fn inverse_unchecked(&self) -> Scale<T, D>

where T: ClosedDiv + One,

Inverts self.

Example

unsafe {
    let t = Scale3::new(1.0, 2.0, 3.0);
    assert_eq!(t * t.inverse_unchecked(), Scale3::identity());
    assert_eq!(t.inverse_unchecked() * t, Scale3::identity());

    // Work in all dimensions.
    let t = Scale2::new(1.0, 2.0);
    assert_eq!(t * t.inverse_unchecked(), Scale2::identity());
    assert_eq!(t.inverse_unchecked() * t, Scale2::identity());
}

pub fn pseudo_inverse(&self) -> Scale<T, D>

where T: ClosedDiv + One + Zero,

Inverts self.

Example

let t = Scale3::new(1.0, 2.0, 3.0);
assert_eq!(t * t.pseudo_inverse(), Scale3::identity());
assert_eq!(t.pseudo_inverse() * t, Scale3::identity());

// Work in all dimensions.
let t = Scale2::new(1.0, 2.0);
assert_eq!(t * t.pseudo_inverse(), Scale2::identity());
assert_eq!(t.pseudo_inverse() * t, Scale2::identity());

// Inverts only non-zero coordinates.
let t = Scale2::new(0.0, 2.0);
assert_eq!(t * t.pseudo_inverse(), Scale2::new(0.0, 1.0));
assert_eq!(t.pseudo_inverse() * t, Scale2::new(0.0, 1.0));

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

where T: Zero + One + Clone, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output>,

Converts this Scale into its equivalent homogeneous transformation matrix.

Example

let t = Scale3::new(10.0, 20.0, 30.0);
let expected = Matrix4::new(10.0, 0.0, 0.0, 0.0,
                            0.0, 20.0, 0.0, 0.0,
                            0.0, 0.0, 30.0, 0.0,
                            0.0, 0.0, 0.0, 1.0);
assert_eq!(t.to_homogeneous(), expected);

let t = Scale2::new(10.0, 20.0);
let expected = Matrix3::new(10.0, 0.0, 0.0,
                            0.0, 20.0, 0.0,
                            0.0, 0.0, 1.0);
assert_eq!(t.to_homogeneous(), expected);

pub fn try_inverse_mut(&mut self) -> bool

where T: ClosedDiv + One + Zero,

Inverts self in-place.

Example

let t = Scale3::new(1.0, 2.0, 3.0);
let mut inv_t = Scale3::new(1.0, 2.0, 3.0);
assert!(inv_t.try_inverse_mut());
assert_eq!(t * inv_t, Scale3::identity());
assert_eq!(inv_t * t, Scale3::identity());

// Work in all dimensions.
let t = Scale2::new(1.0, 2.0);
let mut inv_t = Scale2::new(1.0, 2.0);
assert!(inv_t.try_inverse_mut());
assert_eq!(t * inv_t, Scale2::identity());
assert_eq!(inv_t * t, Scale2::identity());

// Does not perform any operation if a coordinate is 0.
let mut t = Scale2::new(0.0, 2.0);
assert!(!t.try_inverse_mut());

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

where T: Scalar + ClosedMul,

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

Translate the given point.

This is the same as the multiplication self * pt.

Example

let t = Scale3::new(1.0, 2.0, 3.0);
let transformed_point = t.transform_point(&Point3::new(4.0, 5.0, 6.0));
assert_eq!(transformed_point, Point3::new(4.0, 10.0, 18.0));

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

where T: Scalar + ClosedDiv + ClosedMul + One + Zero,

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

Translate the given point by the inverse of this Scale.

Example

let t = Scale3::new(1.0, 2.0, 3.0);
let transformed_point = t.try_inverse_transform_point(&Point3::new(4.0, 6.0, 6.0)).unwrap();
assert_eq!(transformed_point, Point3::new(4.0, 3.0, 2.0));

// Returns None if the inverse doesn't exist.
let t = Scale3::new(1.0, 0.0, 3.0);
let transformed_point = t.try_inverse_transform_point(&Point3::new(4.0, 6.0, 6.0));
assert_eq!(transformed_point, None);

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

where T: Scalar,

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

where T: One,

Creates a new identity scale.

Example

let t = Scale2::identity();
let p = Point2::new(1.0, 2.0);
assert_eq!(t * p, p);

// Works in all dimensions.
let t = Scale3::identity();
let p = Point3::new(1.0, 2.0, 3.0);
assert_eq!(t * p, p);

pub fn cast<To>(self) -> Scale<To, D>

where To: Scalar, Scale<To, D>: SupersetOf<Scale<T, D>>,

Cast the components of self to another type.

Example

let tra = Scale2::new(1.0f64, 2.0);
let tra2 = tra.cast::<f32>();
assert_eq!(tra2, Scale2::new(1.0f32, 2.0));

impl<T> Scale<T, 1>

pub const fn new(x: T) -> Scale<T, 1>

Initializes this Scale from its components.

Example

let t = Scale1::new(1.0);
assert!(t.vector.x == 1.0);

impl<T> Scale<T, 2>

pub const fn new(x: T, y: T) -> Scale<T, 2>

Initializes this Scale from its components.

Example

let t = Scale2::new(1.0, 2.0);
assert!(t.vector.x == 1.0 && t.vector.y == 2.0);

impl<T> Scale<T, 3>

pub const fn new(x: T, y: T, z: T) -> Scale<T, 3>

Initializes this Scale from its components.

Example

let t = Scale3::new(1.0, 2.0, 3.0);
assert!(t.vector.x == 1.0 && t.vector.y == 2.0 && t.vector.z == 3.0);

impl<T> Scale<T, 4>

pub const fn new(x: T, y: T, z: T, w: T) -> Scale<T, 4>

Initializes this Scale from its components.

Example

let t = Scale4::new(1.0, 2.0, 3.0, 4.0);
assert!(t.vector.x == 1.0 && t.vector.y == 2.0 && t.vector.z == 3.0 && t.vector.w == 4.0);

impl<T> Scale<T, 5>

pub const fn new(x: T, y: T, z: T, w: T, a: T) -> Scale<T, 5>

Initializes this Scale from its components.

Example

let t = Scale5::new(1.0, 2.0, 3.0, 4.0, 5.0);
assert!(t.vector.x == 1.0 && t.vector.y == 2.0 && t.vector.z == 3.0 && t.vector.w == 4.0 && t.vector.a == 5.0);

impl<T> Scale<T, 6>

pub const fn new(x: T, y: T, z: T, w: T, a: T, b: T) -> Scale<T, 6>

Initializes this Scale from its components.

Example

let t = Scale6::new(1.0, 2.0, 3.0, 4.0, 5.0, 6.0);
assert!(t.vector.x == 1.0 && t.vector.y == 2.0 && t.vector.z == 3.0 && t.vector.w == 4.0 && t.vector.a == 5.0 && t.vector.b == 6.0);

Trait Implementations

impl<T, const D: usize> AbsDiffEq for Scale<T, D>

where T: Scalar + AbsDiffEq, <T as AbsDiffEq>::Epsilon: Clone,

type Epsilon = <T as AbsDiffEq>::Epsilon

Used for specifying relative comparisons.

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

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

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

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

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

The inverse of AbsDiffEq::abs_diff_eq.

impl<T, const D: usize> Clone for Scale<T, D>

where T: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T, const D: usize> Debug for Scale<T, D>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Deref for Scale<T, 1>

where T: Scalar,

type Target = X<T>

The resulting type after dereferencing.

fn deref(&self) -> &<Scale<T, 1> as Deref>::Target

Dereferences the value.

impl<T> Deref for Scale<T, 2>

where T: Scalar,

type Target = XY<T>

The resulting type after dereferencing.

fn deref(&self) -> &<Scale<T, 2> as Deref>::Target

Dereferences the value.

impl<T> Deref for Scale<T, 3>

where T: Scalar,

type Target = XYZ<T>

The resulting type after dereferencing.

fn deref(&self) -> &<Scale<T, 3> as Deref>::Target

Dereferences the value.

impl<T> Deref for Scale<T, 4>

where T: Scalar,

type Target = XYZW<T>

The resulting type after dereferencing.

fn deref(&self) -> &<Scale<T, 4> as Deref>::Target

Dereferences the value.

impl<T> Deref for Scale<T, 5>

where T: Scalar,

type Target = XYZWA<T>

The resulting type after dereferencing.

fn deref(&self) -> &<Scale<T, 5> as Deref>::Target

Dereferences the value.

impl<T> Deref for Scale<T, 6>

where T: Scalar,

type Target = XYZWAB<T>

The resulting type after dereferencing.

fn deref(&self) -> &<Scale<T, 6> as Deref>::Target

Dereferences the value.

impl<T> DerefMut for Scale<T, 1>

where T: Scalar,

fn deref_mut(&mut self) -> &mut <Scale<T, 1> as Deref>::Target

Mutably dereferences the value.

impl<T> DerefMut for Scale<T, 2>

where T: Scalar,

fn deref_mut(&mut self) -> &mut <Scale<T, 2> as Deref>::Target

Mutably dereferences the value.

impl<T> DerefMut for Scale<T, 3>

where T: Scalar,

fn deref_mut(&mut self) -> &mut <Scale<T, 3> as Deref>::Target

Mutably dereferences the value.

impl<T> DerefMut for Scale<T, 4>

where T: Scalar,

fn deref_mut(&mut self) -> &mut <Scale<T, 4> as Deref>::Target

Mutably dereferences the value.

impl<T> DerefMut for Scale<T, 5>

where T: Scalar,

fn deref_mut(&mut self) -> &mut <Scale<T, 5> as Deref>::Target

Mutably dereferences the value.

impl<T> DerefMut for Scale<T, 6>

where T: Scalar,

fn deref_mut(&mut self) -> &mut <Scale<T, 6> as Deref>::Target

Mutably dereferences the value.

impl<T, const D: usize> Display for Scale<T, D>

where T: Scalar + Display,

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

Formats the value using the given formatter.

impl<T, const D: usize> From<[Scale<<T as SimdValue>::Element, D>; 16]> for Scale<T, D>

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

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

Converts to this type from the input type.

impl<T, const D: usize> From<[Scale<<T as SimdValue>::Element, D>; 2]> for Scale<T, D>

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

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

Converts to this type from the input type.

impl<T, const D: usize> From<[Scale<<T as SimdValue>::Element, D>; 4]> for Scale<T, D>

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

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

Converts to this type from the input type.

impl<T, const D: usize> From<[Scale<<T as SimdValue>::Element, D>; 8]> for Scale<T, D>

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

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

Converts to this type from the input type.

impl<T, const D: usize> From<[T; D]> for Scale<T, D>

where T: Scalar,

fn from(coords: [T; D]) -> Scale<T, D>

Converts to this type from the input type.

impl<T, const D: usize> From<Matrix<T, Const<D>, Const<1>, <DefaultAllocator as Allocator<T, Const<D>>>::Buffer>> for Scale<T, D>

where T: Scalar,

fn from( vector: Matrix<T, Const<D>, Const<1>, <DefaultAllocator as Allocator<T, Const<D>>>::Buffer>, ) -> Scale<T, D>

Converts to this type from the input type.

impl<T, const D: usize> From<OPoint<T, Const<D>>> for Scale<T, D>

where T: Scalar,

fn from(pt: OPoint<T, Const<D>>) -> Scale<T, D>

Converts to this type from the input type.

impl<T, const D: usize> From<Scale<T, D>> for Matrix<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer>

where T: Scalar + Zero + One, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T, Const<D>>,

fn from( t: Scale<T, D>, ) -> Matrix<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer>

Converts to this type from the input type.

impl<T, const D: usize> Hash for Scale<T, D>

where T: Scalar + Hash, <DefaultAllocator as Allocator<T, Const<D>>>::Buffer: Hash,

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

where H: Hasher,

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, 'b, T, const D: usize> Mul<&'b Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for &'a Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T, const D: usize> Mul<&'b OPoint<T, Const<D>>> for &'a Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b OPoint<T, Const<D>>> for Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, 'b, T, const D: usize> Mul<&'b Scale<T, D>> for &'a Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

type Output = Scale<T, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Scale<T, D>> for Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

type Output = Scale<T, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T, const D: usize> Mul<Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for &'a Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, const D: usize> Mul<Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

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

The resulting type after applying the * operator.

fn mul( self, right: Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>, ) -> <Scale<T, D> as Mul<Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>>>::Output

Performs the * operation.

impl<'a, T, const D: usize> Mul<OPoint<T, Const<D>>> for &'a Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, const D: usize> Mul<OPoint<T, Const<D>>> for Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

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

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T, const D: usize> Mul<Scale<T, D>> for &'a Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

type Output = Scale<T, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'a, T, const D: usize> Mul<T> for &'a Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

type Output = Scale<T, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, const D: usize> Mul<T> for Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

type Output = Scale<T, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T, const D: usize> Mul for Scale<T, D>

where T: Scalar + ClosedMul, ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,

type Output = Scale<T, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<'b, T, const D: usize> MulAssign<&'b Scale<T, D>> for Scale<T, D>

where T: Scalar + ClosedMul,

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

Performs the *= operation.

impl<T, const D: usize> MulAssign<T> for Scale<T, D>

where T: Scalar + ClosedMul,

fn mul_assign(&mut self, right: T)

Performs the *= operation.

impl<T, const D: usize> MulAssign for Scale<T, D>

where T: Scalar + ClosedMul,

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

Performs the *= operation.

impl<T, const D: usize> One for Scale<T, D>

where T: Scalar + One + ClosedMul,

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

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

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

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

impl<T, const D: usize> PartialEq for Scale<T, D>

where T: Scalar + PartialEq,

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T, const D: usize> RelativeEq for Scale<T, D>

where T: Scalar + RelativeEq, <T as AbsDiffEq>::Epsilon: Clone,

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

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

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

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

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

The inverse of RelativeEq::relative_eq.

impl<T, const D: usize> SimdValue for Scale<T, D>

where T: Scalar + SimdValue, <T as SimdValue>::Element: Scalar,

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

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

type SimdBool = <T as SimdValue>::SimdBool

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

fn lanes() -> usize

The number of lanes of this SIMD value.

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

Initializes an SIMD value with each lanes set to val.

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

Extracts the i-th lane of self.

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

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

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

Replaces the i-th lane of self by val.

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

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

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

Merges self and other depending on the lanes of cond.

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

where Self: Clone,

Applies a function to each lane of self.

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

where Self: Clone,

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

impl<T1, T2, const D: usize> SubsetOf<Matrix<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>>::Buffer>> for Scale<T1, D>

where T1: RealField, T2: RealField + SupersetOf<T1>, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T1, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

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

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

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

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

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

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

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

impl<T1, T2, const D: usize> SubsetOf<Scale<T2, D>> for Scale<T1, D>

where T1: Scalar, T2: Scalar + SupersetOf<T1>,

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

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

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

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

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

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

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

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

impl<T1, T2, C, const D: usize> SubsetOf<Transform<T2, C, D>> for Scale<T1, D>

where T1: RealField, T2: RealField + SupersetOf<T1>, C: SuperTCategoryOf<TAffine>, Const<D>: DimNameAdd<Const<1>>, DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T1, <Const<D> as DimNameAdd<Const<1>>>::Output> + Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,

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

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

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

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

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

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

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

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

impl<T, const D: usize> UlpsEq for Scale<T, D>

where T: Scalar + UlpsEq, <T as AbsDiffEq>::Epsilon: Clone,

fn default_max_ulps() -> u32

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

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

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

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

The inverse of UlpsEq::ulps_eq.

impl<T, const D: usize> Copy for Scale<T, D>

where T: Copy,

impl<T, const D: usize> Eq for Scale<T, D>

where T: Scalar + Eq,