Struct nalgebra::geometry::Point

#[repr(C)]pub struct Point<T, const D: usize> {
    pub coords: SVector<T, D>,
}

A point in an euclidean space.

The difference between a point and a vector is only semantic. See the user guide for details on the distinction. The most notable difference that vectors ignore translations. In particular, an Isometry2 or Isometry3 will transform points by applying a rotation and a translation on them. However, these isometries will only apply rotations to vectors (when doing isometry * vector, the translation part of the isometry is ignored).

Construction

• From individual components new…
• Swizzling xx, yxz…
• Other construction methods origin, from_slice, from_homogeneous…

Transformation

Transforming a point by an Isometry, rotation, etc. can be achieved by multiplication, e.g., isometry * point or rotation * point. Some of these transformation may have some other methods, e.g., isometry.inverse_transform_point(&point). See the documentation of said transformations for details.

Fields

coords: SVector<T, D>

The coordinates of this point, i.e., the shift from the origin.

Implementations

impl<T: Scalar, const D: usize> Point<T, D>

pub fn map<T2: Scalar, F: FnMut(T) -> T2>(&self, f: F) -> Point<T2, D>

Returns a point containing the result of f applied to each of its entries.

Example

let p = Point2::new(1.0, 2.0);
assert_eq!(p.map(|e| e * 10.0), Point2::new(10.0, 20.0));

// This works in any dimension.
let p = Point3::new(1.1, 2.1, 3.1);
assert_eq!(p.map(|e| e as u32), Point3::new(1, 2, 3));

pub fn apply<F: FnMut(T) -> T>(&mut self, f: F)

Replaces each component of self by the result of a closure f applied on it.

Example

let mut p = Point2::new(1.0, 2.0);
p.apply(|e| e * 10.0);
assert_eq!(p, Point2::new(10.0, 20.0));

// This works in any dimension.
let mut p = Point3::new(1.0, 2.0, 3.0);
p.apply(|e| e * 10.0);
assert_eq!(p, Point3::new(10.0, 20.0, 30.0));

pub fn to_homogeneous(&self) -> OVector<T, DimNameSum<Const<D>, U1>> where
    T: One,
    Const<D>: DimNameAdd<U1>,
    DefaultAllocator: Allocator<T, DimNameSum<Const<D>, U1>>, 

Converts this point into a vector in homogeneous coordinates, i.e., appends a 1 at the end of it.

This is the same as .into().

Example

let p = Point2::new(10.0, 20.0);
assert_eq!(p.to_homogeneous(), Vector3::new(10.0, 20.0, 1.0));

// This works in any dimension.
let p = Point3::new(10.0, 20.0, 30.0);
assert_eq!(p.to_homogeneous(), Vector4::new(10.0, 20.0, 30.0, 1.0));

pub fn from_coordinates(coords: SVector<T, D>) -> Self

👎 Deprecated:

Use Point::from(vector) instead.

Creates a new point with the given coordinates.

pub fn len(&self) -> usize

The dimension of this point.

Example

let p = Point2::new(1.0, 2.0);
assert_eq!(p.len(), 2);

// This works in any dimension.
let p = Point3::new(10.0, 20.0, 30.0);
assert_eq!(p.len(), 3);

pub fn is_empty(&self) -> bool

Returns true if the point contains no elements.

Example

let p = Point2::new(1.0, 2.0);
assert!(!p.is_empty());

pub fn stride(&self) -> usize

👎 Deprecated:

This methods is no longer significant and will always return 1.

The stride of this point. This is the number of buffer element separating each component of this point.

pub fn iter(
    &self
) -> MatrixIter<'_, T, Const<D>, Const<1>, <DefaultAllocator as Allocator<T, Const<D>>>::Buffer>

Iterates through this point coordinates.

Example

let p = Point3::new(1.0, 2.0, 3.0);
let mut it = p.iter().cloned();

assert_eq!(it.next(), Some(1.0));
assert_eq!(it.next(), Some(2.0));
assert_eq!(it.next(), Some(3.0));
assert_eq!(it.next(), None);

pub unsafe fn get_unchecked(&self, i: usize) -> &T

Gets a reference to i-th element of this point without bound-checking.

pub fn iter_mut(
    &mut self
) -> MatrixIterMut<'_, T, Const<D>, Const<1>, <DefaultAllocator as Allocator<T, Const<D>>>::Buffer>

Mutably iterates through this point coordinates.

Example

let mut p = Point3::new(1.0, 2.0, 3.0);

for e in p.iter_mut() {
    *e *= 10.0;
}

assert_eq!(p, Point3::new(10.0, 20.0, 30.0));

pub unsafe fn get_unchecked_mut(&mut self, i: usize) -> &mut T

Gets a mutable reference to i-th element of this point without bound-checking.

pub unsafe fn swap_unchecked(&mut self, i1: usize, i2: usize)

Swaps two entries without bound-checking.

impl<T: Scalar + SimdPartialOrd, const D: usize> Point<T, D>

pub fn inf(&self, other: &Self) -> Point<T, D>

Computes the infimum (aka. componentwise min) of two points.

pub fn sup(&self, other: &Self) -> Point<T, D>

Computes the supremum (aka. componentwise max) of two points.

pub fn inf_sup(&self, other: &Self) -> (Point<T, D>, Point<T, D>)

Computes the (infimum, supremum) of two points.

impl<T: Scalar, const D: usize> Point<T, D>

Other construction methods

pub unsafe fn new_uninitialized() -> Self

Creates a new point with uninitialized coordinates.

pub fn origin() -> Self where
    T: Zero, 

Creates a new point with all coordinates equal to zero.

Example

// This works in any dimension.
// The explicit crate::<f32> type annotation may not always be needed,
// depending on the context of type inference.
let pt = Point2::<f32>::origin();
assert!(pt.x == 0.0 && pt.y == 0.0);

let pt = Point3::<f32>::origin();
assert!(pt.x == 0.0 && pt.y == 0.0 && pt.z == 0.0);

pub fn from_slice(components: &[T]) -> Self

Creates a new point from a slice.

Example

let data = [ 1.0, 2.0, 3.0 ];

let pt = Point2::from_slice(&data[..2]);
assert_eq!(pt, Point2::new(1.0, 2.0));

let pt = Point3::from_slice(&data);
assert_eq!(pt, Point3::new(1.0, 2.0, 3.0));

pub fn from_homogeneous(v: OVector<T, DimNameSum<Const<D>, U1>>) -> Option<Self> where
    T: Scalar + Zero + One + ClosedDiv,
    Const<D>: DimNameAdd<U1>,
    DefaultAllocator: Allocator<T, DimNameSum<Const<D>, U1>>, 

Creates a new point from its homogeneous vector representation.

In practice, this builds a D-dimensional points with the same first D component as v divided by the last component of v. Returns None if this divisor is zero.

Example

let coords = Vector4::new(1.0, 2.0, 3.0, 1.0);
let pt = Point3::from_homogeneous(coords);
assert_eq!(pt, Some(Point3::new(1.0, 2.0, 3.0)));

// All component of the result will be divided by the
// last component of the vector, here 2.0.
let coords = Vector4::new(1.0, 2.0, 3.0, 2.0);
let pt = Point3::from_homogeneous(coords);
assert_eq!(pt, Some(Point3::new(0.5, 1.0, 1.5)));

// Fails because the last component is zero.
let coords = Vector4::new(1.0, 2.0, 3.0, 0.0);
let pt = Point3::from_homogeneous(coords);
assert!(pt.is_none());

// Works also in other dimensions.
let coords = Vector3::new(1.0, 2.0, 1.0);
let pt = Point2::from_homogeneous(coords);
assert_eq!(pt, Some(Point2::new(1.0, 2.0)));

pub fn cast<To: Scalar>(self) -> Point<To, D> where
    Point<To, D>: SupersetOf<Self>, 

Cast the components of self to another type.

Example

let pt = Point2::new(1.0f64, 2.0);
let pt2 = pt.cast::<f32>();
assert_eq!(pt2, Point2::new(1.0f32, 2.0));

impl<T> Point<T, 1_usize>

Construction from individual components

pub const fn new(x: T) -> Self

Initializes this point from its components.

Example

let p = Point1::new(1.0);
assert_eq!(p.x, 1.0);

impl<T> Point<T, 2_usize>

pub const fn new(x: T, y: T) -> Self

Initializes this point from its components.

Example

let p = Point2::new(1.0, 2.0);
assert!(p.x == 1.0 && p.y == 2.0);

impl<T> Point<T, 3_usize>

pub const fn new(x: T, y: T, z: T) -> Self

Initializes this point from its components.

Example

let p = Point3::new(1.0, 2.0, 3.0);
assert!(p.x == 1.0 && p.y == 2.0 && p.z == 3.0);

impl<T> Point<T, 4_usize>

pub const fn new(x: T, y: T, z: T, w: T) -> Self

Initializes this point from its components.

Example

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

impl<T> Point<T, 5_usize>

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

Initializes this point from its components.

Example

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

impl<T> Point<T, 6_usize>

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

Initializes this point from its components.

Example

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

impl<T: Scalar, const D: usize> Point<T, D> where
    Const<D>: ToTypenum, 

Swizzling

pub fn xx(&self) -> Point2<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U0, Output = Greater>, 

Builds a new point from components of self.

pub fn xxx(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U0, Output = Greater>, 

Builds a new point from components of self.

pub fn xy(&self) -> Point2<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U1, Output = Greater>, 

Builds a new point from components of self.

pub fn yx(&self) -> Point2<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U1, Output = Greater>, 

Builds a new point from components of self.

pub fn yy(&self) -> Point2<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U1, Output = Greater>, 

Builds a new point from components of self.

pub fn xxy(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U1, Output = Greater>, 

Builds a new point from components of self.

pub fn xyx(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U1, Output = Greater>, 

Builds a new point from components of self.

pub fn xyy(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U1, Output = Greater>, 

Builds a new point from components of self.

pub fn yxx(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U1, Output = Greater>, 

Builds a new point from components of self.

pub fn yxy(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U1, Output = Greater>, 

Builds a new point from components of self.

pub fn yyx(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U1, Output = Greater>, 

Builds a new point from components of self.

pub fn yyy(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U1, Output = Greater>, 

Builds a new point from components of self.

pub fn xz(&self) -> Point2<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn yz(&self) -> Point2<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zx(&self) -> Point2<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zy(&self) -> Point2<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zz(&self) -> Point2<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn xxz(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn xyz(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn xzx(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn xzy(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn xzz(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn yxz(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn yyz(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn yzx(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn yzy(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn yzz(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zxx(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zxy(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zxz(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zyx(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zyy(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zyz(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zzx(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zzy(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

pub fn zzz(&self) -> Point3<T> where
    <Const<D> as ToTypenum>::Typenum: Cmp<U2, Output = Greater>, 

Builds a new point from components of self.

Trait Implementations

impl<T: Scalar + AbsDiffEq, const D: usize> AbsDiffEq<Point<T, D>> for Point<T, D> where
    T::Epsilon: Copy, 

type Epsilon = T::Epsilon

Used for specifying relative comparisons.

fn default_epsilon() -> Self::Epsilon

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

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

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

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

The inverse of AbsDiffEq::abs_diff_eq.

impl<'a, 'b, T, D2, SB, const D1: usize> Add<&'b Matrix<T, D2, Const<1_usize>, SB>> for &'a Point<T, D1> where
    T: Scalar + ClosedAdd,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2, Representative = Const<D1>> + SameNumberOfColumns<U1, U1, Representative = U1>,
    D2: Dim,
    SB: Storage<T, D2>, 

type Output = Point<T, D1>

The resulting type after applying the + operator.

fn add(self, right: &'b Vector<T, D2, SB>) -> Self::Output

Performs the + operation.

impl<'b, T, D2, SB, const D1: usize> Add<&'b Matrix<T, D2, Const<1_usize>, SB>> for Point<T, D1> where
    T: Scalar + ClosedAdd,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2, Representative = Const<D1>> + SameNumberOfColumns<U1, U1, Representative = U1>,
    D2: Dim,
    SB: Storage<T, D2>, 

type Output = Point<T, D1>

The resulting type after applying the + operator.

fn add(self, right: &'b Vector<T, D2, SB>) -> Self::Output

Performs the + operation.

impl<'a, T, D2, SB, const D1: usize> Add<Matrix<T, D2, Const<1_usize>, SB>> for &'a Point<T, D1> where
    T: Scalar + ClosedAdd,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2, Representative = Const<D1>> + SameNumberOfColumns<U1, U1, Representative = U1>,
    D2: Dim,
    SB: Storage<T, D2>, 

type Output = Point<T, D1>

The resulting type after applying the + operator.

fn add(self, right: Vector<T, D2, SB>) -> Self::Output

Performs the + operation.

impl<T, D2, SB, const D1: usize> Add<Matrix<T, D2, Const<1_usize>, SB>> for Point<T, D1> where
    T: Scalar + ClosedAdd,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2, Representative = Const<D1>> + SameNumberOfColumns<U1, U1, Representative = U1>,
    D2: Dim,
    SB: Storage<T, D2>, 

type Output = Point<T, D1>

The resulting type after applying the + operator.

fn add(self, right: Vector<T, D2, SB>) -> Self::Output

Performs the + operation.

impl<'b, T, D2: Dim, SB, const D1: usize> AddAssign<&'b Matrix<T, D2, Const<1_usize>, SB>> for Point<T, D1> where
    T: Scalar + ClosedAdd,
    SB: Storage<T, D2>,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2>, 

fn add_assign(&mut self, right: &'b Vector<T, D2, SB>)

Performs the += operation.

impl<T, D2: Dim, SB, const D1: usize> AddAssign<Matrix<T, D2, Const<1_usize>, SB>> for Point<T, D1> where
    T: Scalar + ClosedAdd,
    SB: Storage<T, D2>,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2>, 

fn add_assign(&mut self, right: Vector<T, D2, SB>)

Performs the += operation.

impl<T: Scalar + Bounded, const D: usize> Bounded for Point<T, D>

fn max_value() -> Self

returns the largest finite number this type can represent

fn min_value() -> Self

returns the smallest finite number this type can represent

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Scalar + Copy, const D: usize> Copy for Point<T, D>

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

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

Formats the value using the given formatter.

impl<T: Scalar> Deref for Point<T, 1>

type Target = X<T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Scalar> Deref for Point<T, 2>

type Target = XY<T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Scalar> Deref for Point<T, 3>

type Target = XYZ<T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Scalar> Deref for Point<T, 4>

type Target = XYZW<T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Scalar> Deref for Point<T, 5>

type Target = XYZWA<T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Scalar> Deref for Point<T, 6>

type Target = XYZWAB<T>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Scalar> DerefMut for Point<T, 1>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T: Scalar> DerefMut for Point<T, 2>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T: Scalar> DerefMut for Point<T, 3>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T: Scalar> DerefMut for Point<T, 4>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T: Scalar> DerefMut for Point<T, 5>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T: Scalar> DerefMut for Point<T, 6>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<T: Scalar + Display, const D: usize> Display for Point<T, D>

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

Formats the value using the given formatter.

impl<T: Scalar + ClosedDiv, const D: usize> Div<T> for Point<T, D>

type Output = Point<T, D>

The resulting type after applying the / operator.

fn div(self, right: T) -> Self::Output

Performs the / operation.

impl<'a, T: Scalar + ClosedDiv, const D: usize> Div<T> for &'a Point<T, D>

type Output = Point<T, D>

The resulting type after applying the / operator.

fn div(self, right: T) -> Self::Output

Performs the / operation.

impl<T: Scalar + ClosedDiv, const D: usize> DivAssign<T> for Point<T, D>

fn div_assign(&mut self, right: T)

Performs the /= operation.

impl<T: Scalar + Eq, const D: usize> Eq for Point<T, D>

impl<T: Scalar + Copy + PrimitiveSimdValue, const D: usize> From<[Point<<T as SimdValue>::Element, D>; 16]> for Point<T, D> where
    T: From<[<T as SimdValue>::Element; 16]>,
    T::Element: Scalar + Copy,
    <DefaultAllocator as Allocator<T::Element, Const<D>>>::Buffer: Copy, 

fn from(arr: [Point<T::Element, D>; 16]) -> Self

Performs the conversion.

impl<T: Scalar + Copy + PrimitiveSimdValue, const D: usize> From<[Point<<T as SimdValue>::Element, D>; 2]> for Point<T, D> where
    T: From<[<T as SimdValue>::Element; 2]>,
    T::Element: Scalar + Copy,
    <DefaultAllocator as Allocator<T::Element, Const<D>>>::Buffer: Copy, 

fn from(arr: [Point<T::Element, D>; 2]) -> Self

Performs the conversion.

impl<T: Scalar + Copy + PrimitiveSimdValue, const D: usize> From<[Point<<T as SimdValue>::Element, D>; 4]> for Point<T, D> where
    T: From<[<T as SimdValue>::Element; 4]>,
    T::Element: Scalar + Copy,
    <DefaultAllocator as Allocator<T::Element, Const<D>>>::Buffer: Copy, 

fn from(arr: [Point<T::Element, D>; 4]) -> Self

Performs the conversion.

impl<T: Scalar + Copy + PrimitiveSimdValue, const D: usize> From<[Point<<T as SimdValue>::Element, D>; 8]> for Point<T, D> where
    T: From<[<T as SimdValue>::Element; 8]>,
    T::Element: Scalar + Copy,
    <DefaultAllocator as Allocator<T::Element, Const<D>>>::Buffer: Copy, 

fn from(arr: [Point<T::Element, D>; 8]) -> Self

Performs the conversion.

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

fn from(coords: OVector<T, Const<D>>) -> Self

Performs the conversion.

impl<T: Scalar + Zero + One, const D: usize> From<Point<T, D>> for OVector<T, DimNameSum<Const<D>, U1>> where
    Const<D>: DimNameAdd<U1>,
    DefaultAllocator: Allocator<T, DimNameSum<Const<D>, U1>>, 

fn from(t: Point<T, D>) -> Self

Performs the conversion.

impl<T: Scalar + Hash, const D: usize> Hash for Point<T, D>

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<T: Scalar, const D: usize> Index<usize> for Point<T, D>

type Output = T

The returned type after indexing.

fn index(&self, i: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T: Scalar, const D: usize> IndexMut<usize> for Point<T, D>

fn index_mut(&mut self, i: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'b, T: SimdRealField> Mul<&'b Point<T, 2_usize>> for UnitComplex<T> where
    T::Element: SimdRealField, 

type Output = Point2<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Point2<T>) -> Self::Output

Performs the * operation.

impl<'a, 'b, T: SimdRealField> Mul<&'b Point<T, 2_usize>> for &'a UnitComplex<T> where
    T::Element: SimdRealField, 

type Output = Point2<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Point2<T>) -> Self::Output

Performs the * operation.

impl<'a, 'b, T: SimdRealField> Mul<&'b Point<T, 3_usize>> for &'a UnitQuaternion<T> where
    T::Element: SimdRealField, 

type Output = Point3<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Point3<T>) -> Self::Output

Performs the * operation.

impl<'b, T: SimdRealField> Mul<&'b Point<T, 3_usize>> for UnitQuaternion<T> where
    T::Element: SimdRealField, 

type Output = Point3<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Point3<T>) -> Self::Output

Performs the * operation.

impl<'a, 'b, T: SimdRealField> Mul<&'b Point<T, 3_usize>> for &'a UnitDualQuaternion<T> where
    T::Element: SimdRealField, 

type Output = Point3<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Point3<T>) -> Self::Output

Performs the * operation.

impl<'b, T: SimdRealField> Mul<&'b Point<T, 3_usize>> for UnitDualQuaternion<T> where
    T::Element: SimdRealField, 

type Output = Point3<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Point3<T>) -> Self::Output

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Point<T, D>> for Rotation<T, D> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul,
    ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, U1>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<T, D>) -> Self::Output

Performs the * operation.

impl<'a, 'b, T, const D: usize> Mul<&'b Point<T, D>> for &'a Rotation<T, D> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul,
    ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, U1>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<T, D>) -> Self::Output

Performs the * operation.

impl<'a, 'b, T, const D: usize> Mul<&'b Point<T, D>> for &'a Translation<T, D> where
    T: Scalar + ClosedAdd,
    ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<U1, U1, Representative = U1>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<T, D>) -> Self::Output

Performs the * operation.

impl<'b, T, const D: usize> Mul<&'b Point<T, D>> for Translation<T, D> where
    T: Scalar + ClosedAdd,
    ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<U1, U1, Representative = U1>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<T, D>) -> Self::Output

Performs the * operation.

impl<'b, T: SimdRealField, R, const D: usize> Mul<&'b Point<T, D>> for Isometry<T, R, D> where
    T::Element: SimdRealField,
    R: AbstractRotation<T, D>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<T, D>) -> Self::Output

Performs the * operation.

impl<'a, 'b, T: SimdRealField, R, const D: usize> Mul<&'b Point<T, D>> for &'a Isometry<T, R, D> where
    T::Element: SimdRealField,
    R: AbstractRotation<T, D>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<T, D>) -> Self::Output

Performs the * operation.

impl<'b, T: SimdRealField, R, const D: usize> Mul<&'b Point<T, D>> for Similarity<T, R, D> where
    T::Element: SimdRealField,
    R: AbstractRotation<T, D>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<T, D>) -> Self::Output

Performs the * operation.

impl<'a, 'b, T: SimdRealField, R, const D: usize> Mul<&'b Point<T, D>> for &'a Similarity<T, R, D> where
    T::Element: SimdRealField,
    R: AbstractRotation<T, D>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<T, D>) -> Self::Output

Performs the * operation.

impl<'b, T, C, const D: usize> Mul<&'b Point<T, D>> for Transform<T, C, D> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    Const<D>: DimNameAdd<U1>,
    C: TCategory,
    DefaultAllocator: Allocator<T, DimNameSum<Const<D>, U1>, DimNameSum<Const<D>, U1>>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Point<T, D>) -> Self::Output

Performs the * operation.

impl<'a, 'b, T, C, const D: usize> Mul<&'b Point<T, D>> for &'a Transform<T, C, D> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    Const<D>: DimNameAdd<U1>,
    C: TCategory,
    DefaultAllocator: Allocator<T, DimNameSum<Const<D>, U1>, DimNameSum<Const<D>, U1>>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, rhs: &'b Point<T, D>) -> Self::Output

Performs the * operation.

impl<'b, T, SA, const D2: usize, const R1: usize, const C1: usize> Mul<&'b Point<T, D2>> for Matrix<T, Const<R1>, Const<C1>, SA> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul,
    SA: Storage<T, Const<R1>, Const<C1>>,
    ShapeConstraint: AreMultipliable<Const<R1>, Const<C1>, Const<D2>, U1>, 

type Output = Point<T, R1>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<T, D2>) -> Self::Output

Performs the * operation.

impl<'a, 'b, T, SA, const D2: usize, const R1: usize, const C1: usize> Mul<&'b Point<T, D2>> for &'a Matrix<T, Const<R1>, Const<C1>, SA> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul,
    SA: Storage<T, Const<R1>, Const<C1>>,
    ShapeConstraint: AreMultipliable<Const<R1>, Const<C1>, Const<D2>, U1>, 

type Output = Point<T, R1>

The resulting type after applying the * operator.

fn mul(self, right: &'b Point<T, D2>) -> Self::Output

Performs the * operation.

impl<T: SimdRealField> Mul<Point<T, 2_usize>> for UnitComplex<T> where
    T::Element: SimdRealField, 

type Output = Point2<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Point2<T>) -> Self::Output

Performs the * operation.

impl<'a, T: SimdRealField> Mul<Point<T, 2_usize>> for &'a UnitComplex<T> where
    T::Element: SimdRealField, 

type Output = Point2<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Point2<T>) -> Self::Output

Performs the * operation.

impl<'a, T: SimdRealField> Mul<Point<T, 3_usize>> for &'a UnitQuaternion<T> where
    T::Element: SimdRealField, 

type Output = Point3<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Point3<T>) -> Self::Output

Performs the * operation.

impl<T: SimdRealField> Mul<Point<T, 3_usize>> for UnitQuaternion<T> where
    T::Element: SimdRealField, 

type Output = Point3<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Point3<T>) -> Self::Output

Performs the * operation.

impl<'a, T: SimdRealField> Mul<Point<T, 3_usize>> for &'a UnitDualQuaternion<T> where
    T::Element: SimdRealField, 

type Output = Point3<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Point3<T>) -> Self::Output

Performs the * operation.

impl<T: SimdRealField> Mul<Point<T, 3_usize>> for UnitDualQuaternion<T> where
    T::Element: SimdRealField, 

type Output = Point3<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Point3<T>) -> Self::Output

Performs the * operation.

impl<T, const D: usize> Mul<Point<T, D>> for Rotation<T, D> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul,
    ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, U1>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: Point<T, D>) -> Self::Output

Performs the * operation.

impl<'a, T, const D: usize> Mul<Point<T, D>> for &'a Rotation<T, D> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul,
    ShapeConstraint: AreMultipliable<Const<D>, Const<D>, Const<D>, U1>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: Point<T, D>) -> Self::Output

Performs the * operation.

impl<'a, T, const D: usize> Mul<Point<T, D>> for &'a Translation<T, D> where
    T: Scalar + ClosedAdd,
    ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<U1, U1, Representative = U1>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: Point<T, D>) -> Self::Output

Performs the * operation.

impl<T, const D: usize> Mul<Point<T, D>> for Translation<T, D> where
    T: Scalar + ClosedAdd,
    ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<U1, U1, Representative = U1>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: Point<T, D>) -> Self::Output

Performs the * operation.

impl<T: SimdRealField, R, const D: usize> Mul<Point<T, D>> for Isometry<T, R, D> where
    T::Element: SimdRealField,
    R: AbstractRotation<T, D>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: Point<T, D>) -> Self::Output

Performs the * operation.

impl<'a, T: SimdRealField, R, const D: usize> Mul<Point<T, D>> for &'a Isometry<T, R, D> where
    T::Element: SimdRealField,
    R: AbstractRotation<T, D>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: Point<T, D>) -> Self::Output

Performs the * operation.

impl<T: SimdRealField, R, const D: usize> Mul<Point<T, D>> for Similarity<T, R, D> where
    T::Element: SimdRealField,
    R: AbstractRotation<T, D>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: Point<T, D>) -> Self::Output

Performs the * operation.

impl<'a, T: SimdRealField, R, const D: usize> Mul<Point<T, D>> for &'a Similarity<T, R, D> where
    T::Element: SimdRealField,
    R: AbstractRotation<T, D>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: Point<T, D>) -> Self::Output

Performs the * operation.

impl<T, C, const D: usize> Mul<Point<T, D>> for Transform<T, C, D> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    Const<D>: DimNameAdd<U1>,
    C: TCategory,
    DefaultAllocator: Allocator<T, DimNameSum<Const<D>, U1>, DimNameSum<Const<D>, U1>>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, rhs: Point<T, D>) -> Self::Output

Performs the * operation.

impl<'a, T, C, const D: usize> Mul<Point<T, D>> for &'a Transform<T, C, D> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul + RealField,
    Const<D>: DimNameAdd<U1>,
    C: TCategory,
    DefaultAllocator: Allocator<T, DimNameSum<Const<D>, U1>, DimNameSum<Const<D>, U1>>, 

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, rhs: Point<T, D>) -> Self::Output

Performs the * operation.

impl<T, SA, const D2: usize, const R1: usize, const C1: usize> Mul<Point<T, D2>> for Matrix<T, Const<R1>, Const<C1>, SA> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul,
    SA: Storage<T, Const<R1>, Const<C1>>,
    ShapeConstraint: AreMultipliable<Const<R1>, Const<C1>, Const<D2>, U1>, 

type Output = Point<T, R1>

The resulting type after applying the * operator.

fn mul(self, right: Point<T, D2>) -> Self::Output

Performs the * operation.

impl<'a, T, SA, const D2: usize, const R1: usize, const C1: usize> Mul<Point<T, D2>> for &'a Matrix<T, Const<R1>, Const<C1>, SA> where
    T: Scalar + Zero + One + ClosedAdd + ClosedMul,
    SA: Storage<T, Const<R1>, Const<C1>>,
    ShapeConstraint: AreMultipliable<Const<R1>, Const<C1>, Const<D2>, U1>, 

type Output = Point<T, R1>

The resulting type after applying the * operator.

fn mul(self, right: Point<T, D2>) -> Self::Output

Performs the * operation.

impl<T: Scalar + ClosedMul, const D: usize> Mul<T> for Point<T, D>

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: T) -> Self::Output

Performs the * operation.

impl<'a, T: Scalar + ClosedMul, const D: usize> Mul<T> for &'a Point<T, D>

type Output = Point<T, D>

The resulting type after applying the * operator.

fn mul(self, right: T) -> Self::Output

Performs the * operation.

impl<T: Scalar + ClosedMul, const D: usize> MulAssign<T> for Point<T, D>

fn mul_assign(&mut self, right: T)

Performs the *= operation.

impl<T: Scalar + ClosedNeg, const D: usize> Neg for Point<T, D>

type Output = Self

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<'a, T: Scalar + ClosedNeg, const D: usize> Neg for &'a Point<T, D>

type Output = Point<T, D>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<T: Scalar, const D: usize> PartialEq<Point<T, D>> for Point<T, D>

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

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

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

This method tests for !=.

impl<T: Scalar + PartialOrd, const D: usize> PartialOrd<Point<T, D>> for Point<T, D>

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, right: &Self) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, right: &Self) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, right: &Self) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, right: &Self) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Scalar + RelativeEq, const D: usize> RelativeEq<Point<T, D>> for Point<T, D> where
    T::Epsilon: Copy, 

fn default_max_relative() -> Self::Epsilon

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

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

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

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

The inverse of RelativeEq::relative_eq.

impl<T: Scalar + SimdValue, const D: usize> SimdValue for Point<T, D> where
    T::Element: Scalar, 

type Element = Point<T::Element, D>

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

type SimdBool = T::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: Self::Element) -> Self

Initializes an SIMD value with each lanes set to val.

fn extract(&self, i: usize) -> Self::Element

Extracts the i-th lane of self.

unsafe fn extract_unchecked(&self, i: usize) -> Self::Element

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

fn replace(&mut self, i: usize, val: Self::Element)

Replaces the i-th lane of self by val.

unsafe fn replace_unchecked(&mut self, i: usize, val: Self::Element)

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

fn select(self, cond: Self::SimdBool, other: Self) -> Self

Merges self and other depending on the lanes of cond.

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

Applies a function to each lane of self.

pub 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<'a, 'b, T, D2, SB, const D1: usize> Sub<&'b Matrix<T, D2, Const<1_usize>, SB>> for &'a Point<T, D1> where
    T: Scalar + ClosedSub,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2, Representative = Const<D1>> + SameNumberOfColumns<U1, U1, Representative = U1>,
    D2: Dim,
    SB: Storage<T, D2>, 

type Output = Point<T, D1>

The resulting type after applying the - operator.

fn sub(self, right: &'b Vector<T, D2, SB>) -> Self::Output

Performs the - operation.

impl<'b, T, D2, SB, const D1: usize> Sub<&'b Matrix<T, D2, Const<1_usize>, SB>> for Point<T, D1> where
    T: Scalar + ClosedSub,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2, Representative = Const<D1>> + SameNumberOfColumns<U1, U1, Representative = U1>,
    D2: Dim,
    SB: Storage<T, D2>, 

type Output = Point<T, D1>

The resulting type after applying the - operator.

fn sub(self, right: &'b Vector<T, D2, SB>) -> Self::Output

Performs the - operation.

impl<'a, 'b, T, const D: usize> Sub<&'b Point<T, D>> for &'a Point<T, D> where
    T: Scalar + ClosedSub,
    ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<U1, U1, Representative = U1>, 

type Output = SVector<T, D>

The resulting type after applying the - operator.

fn sub(self, right: &'b Point<T, D>) -> Self::Output

Performs the - operation.

impl<'b, T, const D: usize> Sub<&'b Point<T, D>> for Point<T, D> where
    T: Scalar + ClosedSub,
    ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<U1, U1, Representative = U1>, 

type Output = SVector<T, D>

The resulting type after applying the - operator.

fn sub(self, right: &'b Point<T, D>) -> Self::Output

Performs the - operation.

impl<'a, T, D2, SB, const D1: usize> Sub<Matrix<T, D2, Const<1_usize>, SB>> for &'a Point<T, D1> where
    T: Scalar + ClosedSub,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2, Representative = Const<D1>> + SameNumberOfColumns<U1, U1, Representative = U1>,
    D2: Dim,
    SB: Storage<T, D2>, 

type Output = Point<T, D1>

The resulting type after applying the - operator.

fn sub(self, right: Vector<T, D2, SB>) -> Self::Output

Performs the - operation.

impl<T, D2, SB, const D1: usize> Sub<Matrix<T, D2, Const<1_usize>, SB>> for Point<T, D1> where
    T: Scalar + ClosedSub,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2, Representative = Const<D1>> + SameNumberOfColumns<U1, U1, Representative = U1>,
    D2: Dim,
    SB: Storage<T, D2>, 

type Output = Point<T, D1>

The resulting type after applying the - operator.

fn sub(self, right: Vector<T, D2, SB>) -> Self::Output

Performs the - operation.

impl<'a, T, const D: usize> Sub<Point<T, D>> for &'a Point<T, D> where
    T: Scalar + ClosedSub,
    ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<U1, U1, Representative = U1>, 

type Output = SVector<T, D>

The resulting type after applying the - operator.

fn sub(self, right: Point<T, D>) -> Self::Output

Performs the - operation.

impl<T, const D: usize> Sub<Point<T, D>> for Point<T, D> where
    T: Scalar + ClosedSub,
    ShapeConstraint: SameNumberOfRows<Const<D>, Const<D>, Representative = Const<D>> + SameNumberOfColumns<U1, U1, Representative = U1>, 

type Output = SVector<T, D>

The resulting type after applying the - operator.

fn sub(self, right: Point<T, D>) -> Self::Output

Performs the - operation.

impl<'b, T, D2: Dim, SB, const D1: usize> SubAssign<&'b Matrix<T, D2, Const<1_usize>, SB>> for Point<T, D1> where
    T: Scalar + ClosedSub,
    SB: Storage<T, D2>,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2>, 

fn sub_assign(&mut self, right: &'b Vector<T, D2, SB>)

Performs the -= operation.

impl<T, D2: Dim, SB, const D1: usize> SubAssign<Matrix<T, D2, Const<1_usize>, SB>> for Point<T, D1> where
    T: Scalar + ClosedSub,
    SB: Storage<T, D2>,
    ShapeConstraint: SameNumberOfRows<Const<D1>, D2>, 

fn sub_assign(&mut self, right: Vector<T, D2, SB>)

Performs the -= operation.

impl<T1, T2, const D: usize> SubsetOf<Matrix<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, Const<1_usize>, <DefaultAllocator as Allocator<T2, <Const<D> as DimNameAdd<Const<1_usize>>>::Output, Const<1_usize>>>::Buffer>> for Point<T1, D> where
    Const<D>: DimNameAdd<U1>,
    T1: Scalar,
    T2: Scalar + Zero + One + ClosedDiv + SupersetOf<T1>,
    DefaultAllocator: Allocator<T1, DimNameSum<Const<D>, U1>> + Allocator<T2, DimNameSum<Const<D>, U1>>, 

fn to_superset(&self) -> OVector<T2, DimNameSum<Const<D>, U1>>

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

fn is_in_subset(v: &OVector<T2, DimNameSum<Const<D>, U1>>) -> bool

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

fn from_superset_unchecked(v: &OVector<T2, DimNameSum<Const<D>, U1>>) -> Self

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

pub 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<Point<T2, D>> for Point<T1, D> where
    T1: Scalar,
    T2: Scalar + SupersetOf<T1>, 

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

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

fn is_in_subset(m: &Point<T2, D>) -> bool

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

fn from_superset_unchecked(m: &Point<T2, D>) -> Self

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

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

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

impl<T: Scalar + UlpsEq, const D: usize> UlpsEq<Point<T, D>> for Point<T, D> where
    T::Epsilon: Copy, 

fn default_max_ulps() -> u32

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

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

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

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

The inverse of UlpsEq::ulps_eq.