#[repr(C)]pub struct Scale<T, const D: usize> {
pub vector: Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>,
}
Expand description
A scale which supports non-uniform scaling.
Fields
vector: Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>
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_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer> where
T: Zero + One + Clone,
Const<D>: DimNameAdd<Const<1_usize>>,
DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, Const<1_usize>>,
pub fn to_homogeneous(
&self
) -> Matrix<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer> where
T: Zero + One + Clone,
Const<D>: DimNameAdd<Const<1_usize>>,
DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, Const<1_usize>>,
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) -> bool where
T: ClosedDiv<T> + One + Zero,
pub fn try_inverse_mut(&mut self) -> bool where
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_usize>
impl<T> Scale<T, 6_usize>
sourcepub const fn new(x: T, y: T, z: T, w: T, a: T, b: T) -> Scale<T, 6_usize>
pub const fn new(x: T, y: T, z: T, w: T, a: T, b: T) -> Scale<T, 6_usize>
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.
sourcepub fn default_epsilon() -> <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
pub 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
sourcepub fn abs_diff_eq(
&self,
other: &Scale<T, D>,
epsilon: <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
) -> bool
pub 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_usize>, <DefaultAllocator as Allocator<T, Const<D>, Const<1_usize>>>::Buffer>> for Scale<T, D> where
T: Scalar,
impl<T, const D: usize> From<Matrix<T, Const<D>, Const<1_usize>, <DefaultAllocator as Allocator<T, Const<D>, Const<1_usize>>>::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_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer> where
T: Scalar + Zero + One,
Const<D>: DimNameAdd<Const<1_usize>>,
DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<T, Const<D>, Const<1_usize>>,
impl<T, const D: usize> From<Scale<T, D>> for Matrix<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer> where
T: Scalar + Zero + One,
Const<D>: DimNameAdd<Const<1_usize>>,
DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
DefaultAllocator: Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<T, Const<D>, Const<1_usize>>,
sourcepub fn from(
t: Scale<T, D>
) -> Matrix<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer>
pub fn from(
t: Scale<T, D>
) -> Matrix<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer>
Performs the conversion.
sourceimpl<T, const D: usize> Hash for Scale<T, D> where
T: Scalar + Hash,
<DefaultAllocator as Allocator<T, Const<D>, Const<1_usize>>>::Buffer: Hash,
impl<T, const D: usize> Hash for Scale<T, D> where
T: Scalar + Hash,
<DefaultAllocator as Allocator<T, Const<D>, Const<1_usize>>>::Buffer: Hash,
sourceimpl<'b, T, const D: usize> Mul<&'b Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>> for Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
impl<'b, T, const D: usize> Mul<&'b Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>> for Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
type Output = Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>
type Output = Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>
The resulting type after applying the *
operator.
sourceimpl<'a, 'b, T, const D: usize> Mul<&'b Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>> for &'a Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
impl<'a, 'b, T, const D: usize> Mul<&'b Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>> for &'a Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
type Output = Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>
type Output = Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
sourceimpl<T, const D: usize> Mul<Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>> for Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
impl<T, const D: usize> Mul<Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>> for Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
type Output = Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>
type Output = Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>
The resulting type after applying the *
operator.
sourceimpl<'a, T, const D: usize> Mul<Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>> for &'a Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
impl<'a, T, const D: usize> Mul<Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>> for &'a Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
type Output = Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>
type Output = Matrix<T, Const<D>, Const<1_usize>, ArrayStorage<T, D, 1_usize>>
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
sourceimpl<T, const D: usize> Mul<Scale<T, D>> for Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
impl<T, const D: usize> Mul<Scale<T, D>> for Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
sourceimpl<'a, T, const D: usize> Mul<T> for &'a Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
impl<'a, T, const D: usize> Mul<T> for &'a Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
sourceimpl<T, const D: usize> Mul<T> for Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
impl<T, const D: usize> Mul<T> for Scale<T, D> where
T: ClosedMul<T> + Scalar,
ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>>,
ShapeConstraint: SameNumberOfColumns<Const<1_usize>, Const<1_usize>>,
<ShapeConstraint as SameNumberOfRows<Const<D>, Const<D>>>::Representative == Const<D>,
<ShapeConstraint as SameNumberOfColumns<Const<1_usize>, Const<1_usize>>>::Representative == Const<1_usize>,
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>,
sourcepub fn mul_assign(&mut self, right: &'b Scale<T, D>)
pub fn mul_assign(&mut self, right: &'b Scale<T, D>)
Performs the *=
operation. Read more
sourceimpl<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>,
sourcepub fn mul_assign(&mut self, right: Scale<T, D>)
pub fn mul_assign(&mut self, right: Scale<T, D>)
Performs the *=
operation. Read more
sourceimpl<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>,
sourcepub fn mul_assign(&mut self, right: T)
pub fn mul_assign(&mut self, right: T)
Performs the *=
operation. Read more
sourceimpl<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,
sourcepub fn default_max_relative(
) -> <Scale<T, D> as AbsDiffEq<Scale<T, D>>>::Epsilon
pub 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
sourcepub 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
pub 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
.
sourcepub fn splat(val: <Scale<T, D> as SimdValue>::Element) -> Scale<T, D>
pub fn splat(val: <Scale<T, D> as SimdValue>::Element) -> Scale<T, D>
Initializes an SIMD value with each lanes set to val
.
sourcepub fn extract(&self, i: usize) -> <Scale<T, D> as SimdValue>::Element
pub fn extract(&self, i: usize) -> <Scale<T, D> as SimdValue>::Element
Extracts the i-th lane of self
. Read more
sourcepub unsafe fn extract_unchecked(
&self,
i: usize
) -> <Scale<T, D> as SimdValue>::Element
pub unsafe fn extract_unchecked(
&self,
i: usize
) -> <Scale<T, D> as SimdValue>::Element
Extracts the i-th lane of self
without bound-checking.
sourcepub fn replace(&mut self, i: usize, val: <Scale<T, D> as SimdValue>::Element)
pub fn replace(&mut self, i: usize, val: <Scale<T, D> as SimdValue>::Element)
Replaces the i-th lane of self
by val
. Read more
sourcepub unsafe fn replace_unchecked(
&mut self,
i: usize,
val: <Scale<T, D> as SimdValue>::Element
)
pub 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.
sourcepub fn select(
self,
cond: <Scale<T, D> as SimdValue>::SimdBool,
other: Scale<T, D>
) -> Scale<T, D>
pub 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
. Read more
sourceimpl<T1, T2, const D: usize> SubsetOf<Matrix<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer>> for Scale<T1, D> where
T1: RealField,
T2: RealField + SupersetOf<T1>,
Const<D>: DimNameAdd<Const<1_usize>>,
DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
impl<T1, T2, const D: usize> SubsetOf<Matrix<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer>> for Scale<T1, D> where
T1: RealField,
T2: RealField + SupersetOf<T1>,
Const<D>: DimNameAdd<Const<1_usize>>,
DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
sourcepub fn to_superset(
&self
) -> Matrix<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer>
pub fn to_superset(
&self
) -> Matrix<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer>
The inclusion map: converts self
to the equivalent element of its superset.
sourcepub fn is_in_subset(
m: &Matrix<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer>
) -> bool
pub fn is_in_subset(
m: &Matrix<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer>
) -> bool
Checks if element
is actually part of the subset Self
(and can be converted to it).
sourcepub fn from_superset_unchecked(
m: &Matrix<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>>::Buffer>
) -> Scale<T1, D>
pub fn from_superset_unchecked(
m: &Matrix<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::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 more
sourceimpl<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>,
sourcepub fn to_superset(&self) -> Scale<T2, D>
pub fn to_superset(&self) -> Scale<T2, D>
The inclusion map: converts self
to the equivalent element of its superset.
sourcepub fn is_in_subset(rot: &Scale<T2, D>) -> bool
pub 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).
sourcepub fn from_superset_unchecked(rot: &Scale<T2, D>) -> Scale<T1, D>
pub 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 more
sourceimpl<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_usize>>,
DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::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_usize>>,
DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
DefaultAllocator: Allocator<T1, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, <Const<D> as DimNameAdd<Const<1_usize>>>::Output>,
sourcepub fn to_superset(&self) -> Transform<T2, C, D>
pub fn to_superset(&self) -> Transform<T2, C, D>
The inclusion map: converts self
to the equivalent element of its superset.
sourcepub fn is_in_subset(t: &Transform<T2, C, D>) -> bool
pub 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).
sourcepub fn from_superset_unchecked(t: &Transform<T2, C, D>) -> Scale<T1, D>
pub 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 more
sourceimpl<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,
sourcepub fn default_max_ulps() -> u32
pub 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
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
pub 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 more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub 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 more
pub fn as_any(&self) -> &(dyn Any + 'static)
pub 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 more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub 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 more
impl<T> DynHash for T where
T: DynEq + Hash,
impl<T> DynHash for T where
T: DynEq + Hash,
sourceimpl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
sourcepub fn equivalent(&self, key: &K) -> bool
pub 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 SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
pub fn to_subset(&self) -> Option<SS>
pub fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more
impl<T> TypeData for T where
T: 'static + Send + Sync + Clone,
impl<T> TypeData for T where
T: 'static + Send + Sync + Clone,
pub fn clone_type_data(&self) -> Box<dyn TypeData + 'static, Global>
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
pub fn vzip(self) -> V
sourceimpl<T> WithSubscriber for T
impl<T> WithSubscriber for T
sourcefn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
sourcefn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more