pub struct Scale<T, const D: usize> {
pub vector: Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>,
}
Expand description
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
sourceimpl<T, const D: usize> Scale<T, D>where
T: Scalar,
impl<T, const D: usize> Scale<T, D>where
T: Scalar,
sourcepub fn try_inverse(&self) -> Option<Scale<T, D>>where
T: ClosedDiv<T> + One + Zero,
pub fn try_inverse(&self) -> Option<Scale<T, D>>where
T: ClosedDiv<T> + 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);
sourcepub unsafe fn inverse_unchecked(&self) -> Scale<T, D>where
T: ClosedDiv<T> + One,
pub unsafe fn inverse_unchecked(&self) -> Scale<T, D>where
T: ClosedDiv<T> + 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());
}
sourcepub fn pseudo_inverse(&self) -> Scale<T, D>where
T: ClosedDiv<T> + One + Zero,
pub fn pseudo_inverse(&self) -> Scale<T, D>where
T: ClosedDiv<T> + 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));
sourcepub 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, Const<1>>,
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, Const<1>>,
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);
sourcepub fn try_inverse_mut(&mut self) -> boolwhere
T: ClosedDiv<T> + One + Zero,
pub fn try_inverse_mut(&mut self) -> boolwhere
T: ClosedDiv<T> + 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());
sourceimpl<T, const D: usize> Scale<T, D>where
T: Scalar + ClosedMul<T>,
impl<T, const D: usize> Scale<T, D>where
T: Scalar + ClosedMul<T>,
sourcepub fn transform_point(&self, pt: &OPoint<T, Const<D>>) -> OPoint<T, Const<D>>
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));
sourceimpl<T, const D: usize> Scale<T, D>where
T: Scalar + ClosedDiv<T> + ClosedMul<T> + One + Zero,
impl<T, const D: usize> Scale<T, D>where
T: Scalar + ClosedDiv<T> + ClosedMul<T> + One + Zero,
sourcepub fn try_inverse_transform_point(
&self,
pt: &OPoint<T, Const<D>>
) -> Option<OPoint<T, Const<D>>>
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);
sourceimpl<T, const D: usize> Scale<T, D>where
T: Scalar,
impl<T, const D: usize> Scale<T, D>where
T: Scalar,
sourceimpl<T> Scale<T, 6>
impl<T> Scale<T, 6>
sourcepub const fn new(x: T, y: T, z: T, w: T, a: T, b: 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
sourceimpl<T, const D: usize> AbsDiffEq<Scale<T, D>> for Scale<T, D>where
T: Scalar + AbsDiffEq<T>,
<T as AbsDiffEq<T>>::Epsilon: Clone,
impl<T, const D: usize> AbsDiffEq<Scale<T, D>> for Scale<T, D>where
T: Scalar + AbsDiffEq<T>,
<T as AbsDiffEq<T>>::Epsilon: Clone,
type Epsilon = <T as AbsDiffEq<T>>::Epsilon
type Epsilon = <T as AbsDiffEq<T>>::Epsilon
Used for specifying relative comparisons.
sourcefn default_epsilon() -> <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
fn default_epsilon() -> <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
The default tolerance to use when testing values that are close together. Read more
sourcefn abs_diff_eq(
&self,
other: &Scale<T, D>,
epsilon: <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
) -> bool
fn abs_diff_eq(
&self,
other: &Scale<T, D>,
epsilon: <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
) -> bool
A test for equality that uses the absolute difference to compute the approximate
equality of two numbers. Read more
fn abs_diff_ne(&self, other: &Rhs, epsilon: Self::Epsilon) -> bool
fn abs_diff_ne(&self, other: &Rhs, epsilon: Self::Epsilon) -> bool
The inverse of [
AbsDiffEq::abs_diff_eq
].sourceimpl<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,
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,
sourceimpl<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,
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,
sourceimpl<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,
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,
sourceimpl<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,
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,
sourceimpl<T, const D: usize> From<Matrix<T, Const<D>, Const<1>, <DefaultAllocator as Allocator<T, Const<D>, Const<1>>>::Buffer>> for Scale<T, D>where
T: Scalar,
impl<T, const D: usize> From<Matrix<T, Const<D>, Const<1>, <DefaultAllocator as Allocator<T, Const<D>, Const<1>>>::Buffer>> for Scale<T, D>where
T: Scalar,
sourceimpl<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, Const<1>> + Allocator<T, Const<D>, Const<1>>,
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, Const<1>> + Allocator<T, Const<D>, Const<1>>,
sourcefn 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>
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.
sourceimpl<T, const D: usize> Hash for Scale<T, D>where
T: Scalar + Hash,
<DefaultAllocator as Allocator<T, Const<D>, Const<1>>>::Buffer: Hash,
impl<T, const D: usize> Hash for Scale<T, D>where
T: Scalar + Hash,
<DefaultAllocator as Allocator<T, Const<D>, Const<1>>>::Buffer: Hash,
sourceimpl<'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: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
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: ClosedMul<T> + Scalar,
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>>
type Output = Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>
The resulting type after applying the
*
operator.sourceimpl<'b, T, const D: usize> Mul<&'b Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<'b, T, const D: usize> Mul<&'b Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
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>>
type Output = Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>
The resulting type after applying the
*
operator.sourceimpl<'a, 'b, T, const D: usize> Mul<&'b OPoint<T, Const<D>>> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<'a, 'b, T, const D: usize> Mul<&'b OPoint<T, Const<D>>> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
sourceimpl<'b, T, const D: usize> Mul<&'b OPoint<T, Const<D>>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<'b, T, const D: usize> Mul<&'b OPoint<T, Const<D>>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
sourceimpl<'a, 'b, T, const D: usize> Mul<&'b Scale<T, D>> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<'a, 'b, T, const D: usize> Mul<&'b Scale<T, D>> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
sourceimpl<'b, T, const D: usize> Mul<&'b Scale<T, D>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<'b, T, const D: usize> Mul<&'b Scale<T, D>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
sourceimpl<'a, T, const D: usize> Mul<Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<'a, T, const D: usize> Mul<Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
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>>
type Output = Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>
The resulting type after applying the
*
operator.sourceimpl<T, const D: usize> Mul<Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<T, const D: usize> Mul<Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
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>>
type Output = Matrix<T, Const<D>, Const<1>, ArrayStorage<T, D, 1>>
The resulting type after applying the
*
operator.sourceimpl<'a, T, const D: usize> Mul<OPoint<T, Const<D>>> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<'a, T, const D: usize> Mul<OPoint<T, Const<D>>> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
sourceimpl<T, const D: usize> Mul<OPoint<T, Const<D>>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<T, const D: usize> Mul<OPoint<T, Const<D>>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
sourceimpl<'a, T, const D: usize> Mul<Scale<T, D>> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<'a, T, const D: usize> Mul<Scale<T, D>> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
sourceimpl<T, const D: usize> Mul<Scale<T, D>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<T, const D: usize> Mul<Scale<T, D>> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
sourceimpl<'a, T, const D: usize> Mul<T> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<'a, T, const D: usize> Mul<T> for &'a Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
sourceimpl<T, const D: usize> Mul<T> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
impl<T, const D: usize> Mul<T> for Scale<T, D>where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<Const<1>, Const<1>, Representative = Const<1>>,
sourceimpl<'b, T, const D: usize> MulAssign<&'b Scale<T, D>> for Scale<T, D>where
T: Scalar + ClosedMul<T>,
impl<'b, T, const D: usize> MulAssign<&'b Scale<T, D>> for Scale<T, D>where
T: Scalar + ClosedMul<T>,
sourcefn mul_assign(&mut self, right: &'b Scale<T, D>)
fn mul_assign(&mut self, right: &'b Scale<T, D>)
Performs the
*=
operation. Read moresourceimpl<T, const D: usize> MulAssign<Scale<T, D>> for Scale<T, D>where
T: Scalar + ClosedMul<T>,
impl<T, const D: usize> MulAssign<Scale<T, D>> for Scale<T, D>where
T: Scalar + ClosedMul<T>,
sourcefn mul_assign(&mut self, right: Scale<T, D>)
fn mul_assign(&mut self, right: Scale<T, D>)
Performs the
*=
operation. Read moresourceimpl<T, const D: usize> MulAssign<T> for Scale<T, D>where
T: Scalar + ClosedMul<T>,
impl<T, const D: usize> MulAssign<T> for Scale<T, D>where
T: Scalar + ClosedMul<T>,
sourcefn mul_assign(&mut self, right: T)
fn mul_assign(&mut self, right: T)
Performs the
*=
operation. Read moresourceimpl<T, const D: usize> PartialEq<Scale<T, D>> for Scale<T, D>where
T: Scalar + PartialEq<T>,
impl<T, const D: usize> PartialEq<Scale<T, D>> for Scale<T, D>where
T: Scalar + PartialEq<T>,
sourceimpl<T, const D: usize> RelativeEq<Scale<T, D>> for Scale<T, D>where
T: Scalar + RelativeEq<T>,
<T as AbsDiffEq<T>>::Epsilon: Clone,
impl<T, const D: usize> RelativeEq<Scale<T, D>> for Scale<T, D>where
T: Scalar + RelativeEq<T>,
<T as AbsDiffEq<T>>::Epsilon: Clone,
sourcefn default_max_relative() -> <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
fn default_max_relative() -> <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
The default relative tolerance for testing values that are far-apart. Read more
sourcefn relative_eq(
&self,
other: &Scale<T, D>,
epsilon: <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon,
max_relative: <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
) -> bool
fn relative_eq(
&self,
other: &Scale<T, D>,
epsilon: <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon,
max_relative: <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
) -> bool
A test for equality that uses a relative comparison if the values are far apart.
fn relative_ne(
&self,
other: &Rhs,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon
) -> bool
fn relative_ne(
&self,
other: &Rhs,
epsilon: Self::Epsilon,
max_relative: Self::Epsilon
) -> bool
The inverse of [
RelativeEq::relative_eq
].sourceimpl<T, const D: usize> SimdValue for Scale<T, D>where
T: Scalar + SimdValue,
<T as SimdValue>::Element: Scalar,
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>
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 SimdBool = <T as SimdValue>::SimdBool
Type of the result of comparing two SIMD values like
self
.sourcefn splat(val: <Scale<T, D> as SimdValue>::Element) -> Scale<T, D>
fn splat(val: <Scale<T, D> as SimdValue>::Element) -> Scale<T, D>
Initializes an SIMD value with each lanes set to
val
.sourcefn extract(&self, i: usize) -> <Scale<T, D> as SimdValue>::Element
fn extract(&self, i: usize) -> <Scale<T, D> as SimdValue>::Element
Extracts the i-th lane of
self
. Read moresourceunsafe fn extract_unchecked(
&self,
i: usize
) -> <Scale<T, D> as SimdValue>::Element
unsafe fn extract_unchecked(
&self,
i: usize
) -> <Scale<T, D> as SimdValue>::Element
Extracts the i-th lane of
self
without bound-checking.sourceunsafe fn replace_unchecked(
&mut self,
i: usize,
val: <Scale<T, D> as SimdValue>::Element
)
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.sourcefn select(
self,
cond: <Scale<T, D> as SimdValue>::SimdBool,
other: Scale<T, D>
) -> Scale<T, D>
fn select(
self,
cond: <Scale<T, D> as SimdValue>::SimdBool,
other: Scale<T, D>
) -> Scale<T, D>
sourceimpl<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, Const<1>> + Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,
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, Const<1>> + Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,
sourcefn 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>
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.sourcefn 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
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).sourcefn 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>
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>
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresourceimpl<T1, T2, const D: usize> SubsetOf<Scale<T2, D>> for Scale<T1, D>where
T1: Scalar,
T2: Scalar + SupersetOf<T1>,
impl<T1, T2, const D: usize> SubsetOf<Scale<T2, D>> for Scale<T1, D>where
T1: Scalar,
T2: Scalar + SupersetOf<T1>,
sourcefn to_superset(&self) -> Scale<T2, D>
fn to_superset(&self) -> Scale<T2, D>
The inclusion map: converts
self
to the equivalent element of its superset.sourcefn is_in_subset(rot: &Scale<T2, D>) -> bool
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).sourcefn from_superset_unchecked(rot: &Scale<T2, D>) -> Scale<T1, D>
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>
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresourceimpl<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, Const<1>> + Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,
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, Const<1>> + Allocator<T2, <Const<D> as DimNameAdd<Const<1>>>::Output, <Const<D> as DimNameAdd<Const<1>>>::Output>,
sourcefn to_superset(&self) -> Transform<T2, C, D>
fn to_superset(&self) -> Transform<T2, C, D>
The inclusion map: converts
self
to the equivalent element of its superset.sourcefn is_in_subset(t: &Transform<T2, C, D>) -> bool
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).sourcefn from_superset_unchecked(t: &Transform<T2, C, D>) -> Scale<T1, D>
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>
fn from_superset(element: &T) -> Option<Self>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moresourceimpl<T, const D: usize> UlpsEq<Scale<T, D>> for Scale<T, D>where
T: Scalar + UlpsEq<T>,
<T as AbsDiffEq<T>>::Epsilon: Clone,
impl<T, const D: usize> UlpsEq<Scale<T, D>> for Scale<T, D>where
T: Scalar + UlpsEq<T>,
<T as AbsDiffEq<T>>::Epsilon: Clone,
sourcefn default_max_ulps() -> u32
fn default_max_ulps() -> u32
The default ULPs to tolerate when testing values that are far-apart. Read more
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,
Auto Trait Implementations
impl<T, const D: usize> RefUnwindSafe for Scale<T, D>where
T: RefUnwindSafe,
impl<T, const D: usize> Send for Scale<T, D>where
T: Send,
impl<T, const D: usize> Sync for Scale<T, D>where
T: Sync,
impl<T, const D: usize> Unpin for Scale<T, D>where
T: Unpin,
impl<T, const D: usize> UnwindSafe for Scale<T, D>where
T: UnwindSafe,
Blanket Implementations
impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
impl<T, U> AsBindGroupShaderType<U> for Twhere
U: ShaderType,
&'a T: for<'a> Into<U>,
fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U
fn as_bind_group_shader_type(
&self,
_images: &HashMap<Handle<Image>, <Image as RenderAsset>::PreparedAsset, RandomState, Global>
) -> U
Return the
T
[ShaderType
] for self
. When used in [AsBindGroup
]
derives, it is safe to assume that all images in self
exist. Read moresourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read morefn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read morefn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read morefn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read moreimpl<T> DynHash for Twhere
T: DynEq + Hash,
impl<T> DynHash for Twhere
T: DynEq + Hash,
sourceimpl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
sourcefn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read morefn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.