Type Alias Point

pub type Point<T, const D: usize> = OPoint<T, Const<D>>;

A point with D elements.

Aliased Type

struct Point<T, const D: usize> {
    pub coords: Matrix<T, Const<D>, Const<1>, <DefaultAllocator as Allocator<T, Const<D>>>::Buffer>,
}

Fields

coords: Matrix<T, Const<D>, Const<1>, <DefaultAllocator as Allocator<T, Const<D>>>::Buffer>

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

Implementations

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.

impl<T: Scalar> OPoint<T, Const<1>>

Construction from individual components

pub 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: Scalar> OPoint<T, Const<2>>

pub 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: Scalar> OPoint<T, Const<3>>

pub 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: Scalar> OPoint<T, Const<4>>

pub 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: Scalar> OPoint<T, Const<5>>

pub 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: Scalar> OPoint<T, Const<6>>

pub 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, D: DimName> OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

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

where DefaultAllocator: Allocator<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(&mut 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 = *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 = *e * 10.0);
assert_eq!(p, Point3::new(10.0, 20.0, 30.0));

pub fn to_homogeneous(&self) -> OVector<T, DimNameSum<D, U1>>

where T: One, D: DimNameAdd<U1>, DefaultAllocator: Allocator<T, DimNameSum<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: OVector<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, D, Const<1>, <DefaultAllocator as Allocator<T, 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, D, Const<1>, <DefaultAllocator as Allocator<T, 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, D: DimName> OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

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

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

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

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

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

Computes the (infimum, supremum) of two points.

impl<T: Scalar, D: DimName> OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

Other construction methods

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<D, U1>>) -> Option<Self>

where T: Scalar + Zero + One + ClosedDiv, D: DimNameAdd<U1>, DefaultAllocator: Allocator<T, DimNameSum<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) -> OPoint<To, D>

where OPoint<To, D>: SupersetOf<Self>, DefaultAllocator: Allocator<To, D>,

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));

Trait Implementations

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

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

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

Converts to this type from the input type.

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

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

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

Converts to this type from the input type.

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

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

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

Converts to this type from the input type.

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

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

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

Converts to this type from the input type.

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

fn from(coords: [T; D]) -> Self

Converts to this type from the input type.

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

where T::Element: Scalar,

type Element = OPoint<<T as SimdValue>::Element, Const<D>>

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

type SimdBool = <T as SimdValue>::SimdBool

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

fn lanes() -> usize

The number of lanes of this SIMD value.

fn splat(val: 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.

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

where Self: Clone,

Applies a function to each lane of self.

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

where Self: Clone,

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

impl<T: Scalar + AbsDiffEq, D: DimName> AbsDiffEq for OPoint<T, D>

where T::Epsilon: Clone, DefaultAllocator: Allocator<T, D>,

type Epsilon = <T as AbsDiffEq>::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.

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

The inverse of AbsDiffEq::abs_diff_eq.

impl<'b, T, D1, D2, SB> Add<&'b Matrix<T, D2, Const<1>, SB>> for OPoint<T, D1>

where T: Scalar + ClosedAdd, ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1, Representative = U1>, D1: DimName, D2: Dim, SB: Storage<T, D2>, DefaultAllocator: Allocator<T, D1>,

type Output = OPoint<T, D1>

The resulting type after applying the + operator.

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

Performs the + operation.

impl<T, D1, D2, SB> Add<Matrix<T, D2, Const<1>, SB>> for OPoint<T, D1>

where T: Scalar + ClosedAdd, ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1, Representative = U1>, D1: DimName, D2: Dim, SB: Storage<T, D2>, DefaultAllocator: Allocator<T, D1>,

type Output = OPoint<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, D1: DimName, D2: Dim, SB> AddAssign<&'b Matrix<T, D2, Const<1>, SB>> for OPoint<T, D1>

where T: Scalar + ClosedAdd, SB: Storage<T, D2>, ShapeConstraint: SameNumberOfRows<D1, D2>, DefaultAllocator: Allocator<T, D1>,

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

Performs the += operation.

impl<T, D1: DimName, D2: Dim, SB> AddAssign<Matrix<T, D2, Const<1>, SB>> for OPoint<T, D1>

where T: Scalar + ClosedAdd, SB: Storage<T, D2>, ShapeConstraint: SameNumberOfRows<D1, D2>, DefaultAllocator: Allocator<T, D1>,

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

Performs the += operation.

impl<T: Scalar + Bounded, D: DimName> Bounded for OPoint<T, D>

where DefaultAllocator: Allocator<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 + Scalar, D: Clone + DimName> Clone for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Scalar + Debug, D: DimName> Debug for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

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

Formats the value using the given formatter.

impl<T: Scalar + Zero, D: DimName> Default for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

fn default() -> Self

Returns the “default value” for a type.

impl<T: Scalar> Deref for OPoint<T, U2>

type Target = XY<T>

The resulting type after dereferencing.

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

Dereferences the value.

impl<T: Scalar> Deref for OPoint<T, U3>

type Target = XYZ<T>

The resulting type after dereferencing.

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

Dereferences the value.

impl<T: Scalar> Deref for OPoint<T, U4>

type Target = XYZW<T>

The resulting type after dereferencing.

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

Dereferences the value.

impl<T: Scalar> Deref for OPoint<T, U5>

type Target = XYZWA<T>

The resulting type after dereferencing.

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

Dereferences the value.

impl<T: Scalar> Deref for OPoint<T, U6>

type Target = XYZWAB<T>

The resulting type after dereferencing.

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

Dereferences the value.

impl<T: Scalar> Deref for OPoint<T, U1>

type Target = X<T>

The resulting type after dereferencing.

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

Dereferences the value.

impl<T: Scalar> DerefMut for OPoint<T, U2>

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

Mutably dereferences the value.

impl<T: Scalar> DerefMut for OPoint<T, U3>

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

Mutably dereferences the value.

impl<T: Scalar> DerefMut for OPoint<T, U4>

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

Mutably dereferences the value.

impl<T: Scalar> DerefMut for OPoint<T, U5>

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

Mutably dereferences the value.

impl<T: Scalar> DerefMut for OPoint<T, U6>

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

Mutably dereferences the value.

impl<T: Scalar> DerefMut for OPoint<T, U1>

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

Mutably dereferences the value.

impl<'a, T: Scalar, D: DimName> Deserialize<'a> for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>, <DefaultAllocator as Allocator<T, D>>::Buffer: Deserialize<'a>,

fn deserialize<Des>(deserializer: Des) -> Result<Self, Des::Error>

where Des: Deserializer<'a>,

Deserialize this value from the given Serde deserializer.

impl<T: Scalar + Display, D: DimName> Display for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

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

Formats the value using the given formatter.

impl<T: Scalar + ClosedDiv, D: DimName> Div<T> for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

type Output = OPoint<T, D>

The resulting type after applying the / operator.

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

Performs the / operation.

impl<T: Scalar + ClosedDiv, D: DimName> DivAssign<T> for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

fn div_assign(&mut self, right: T)

Performs the /= operation.

impl<T: Scalar, D: DimName> From<Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<T, D>>::Buffer>> for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

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

Converts to this type from the input type.

impl<T: Scalar + Hash, D: DimName> Hash for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: Scalar, D: DimName> Index<usize> for OPoint<T, D>

where DefaultAllocator: Allocator<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, D: DimName> IndexMut<usize> for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

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

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

impl<T: Scalar + ClosedMul, D: DimName> Mul<T> for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

type Output = OPoint<T, D>

The resulting type after applying the * operator.

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

Performs the * operation.

impl<T: Scalar + ClosedMul, D: DimName> MulAssign<T> for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

fn mul_assign(&mut self, right: T)

Performs the *= operation.

impl<T: Scalar + ClosedNeg, D: DimName> Neg for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

type Output = OPoint<T, D>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<T: Scalar, D: DimName> PartialEq for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,

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

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

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

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

impl<T: Scalar + PartialOrd, D: DimName> PartialOrd for OPoint<T, D>

where DefaultAllocator: Allocator<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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<T: Scalar + RelativeEq, D: DimName> RelativeEq for OPoint<T, D>

where T::Epsilon: Clone, DefaultAllocator: Allocator<T, D>,

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.

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

The inverse of RelativeEq::relative_eq.

impl<T: Scalar, D: DimName> Serialize for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>, <DefaultAllocator as Allocator<T, D>>::Buffer: Serialize,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<'b, T, D1, D2, SB> Sub<&'b Matrix<T, D2, Const<1>, SB>> for OPoint<T, D1>

where T: Scalar + ClosedSub, ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1, Representative = U1>, D1: DimName, D2: Dim, SB: Storage<T, D2>, DefaultAllocator: Allocator<T, D1>,

type Output = OPoint<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, D> Sub<&'b OPoint<T, D>> for OPoint<T, D>

where T: Scalar + ClosedSub, ShapeConstraint: SameNumberOfRows<D, D, Representative = D> + SameNumberOfColumns<U1, U1, Representative = U1>, D: DimName, DefaultAllocator: Allocator<T, D>,

type Output = Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<T, D>>::Buffer>

The resulting type after applying the - operator.

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

Performs the - operation.

impl<T, D1, D2, SB> Sub<Matrix<T, D2, Const<1>, SB>> for OPoint<T, D1>

where T: Scalar + ClosedSub, ShapeConstraint: SameNumberOfRows<D1, D2, Representative = D1> + SameNumberOfColumns<U1, U1, Representative = U1>, D1: DimName, D2: Dim, SB: Storage<T, D2>, DefaultAllocator: Allocator<T, D1>,

type Output = OPoint<T, D1>

The resulting type after applying the - operator.

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

Performs the - operation.

impl<T, D> Sub for OPoint<T, D>

where T: Scalar + ClosedSub, ShapeConstraint: SameNumberOfRows<D, D, Representative = D> + SameNumberOfColumns<U1, U1, Representative = U1>, D: DimName, DefaultAllocator: Allocator<T, D>,

type Output = Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<T, D>>::Buffer>

The resulting type after applying the - operator.

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

Performs the - operation.

impl<'b, T, D1: DimName, D2: Dim, SB> SubAssign<&'b Matrix<T, D2, Const<1>, SB>> for OPoint<T, D1>

where T: Scalar + ClosedSub, SB: Storage<T, D2>, ShapeConstraint: SameNumberOfRows<D1, D2>, DefaultAllocator: Allocator<T, D1>,

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

Performs the -= operation.

impl<T, D1: DimName, D2: Dim, SB> SubAssign<Matrix<T, D2, Const<1>, SB>> for OPoint<T, D1>

where T: Scalar + ClosedSub, SB: Storage<T, D2>, ShapeConstraint: SameNumberOfRows<D1, D2>, DefaultAllocator: Allocator<T, D1>,

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

Performs the -= operation.

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

where D: DimNameAdd<U1>, T1: Scalar, T2: Scalar + Zero + One + ClosedDiv + SupersetOf<T1>, DefaultAllocator: Allocator<T1, D> + Allocator<T2, D> + Allocator<T1, DimNameSum<D, U1>> + Allocator<T2, DimNameSum<D, U1>>,

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

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

fn is_in_subset(v: &OVector<T2, DimNameSum<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<D, U1>>) -> Self

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

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

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

impl<T1, T2, D: DimName> SubsetOf<OPoint<T2, D>> for OPoint<T1, D>

where T1: Scalar, T2: Scalar + SupersetOf<T1>, DefaultAllocator: Allocator<T1, D> + Allocator<T2, D>,

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

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

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

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

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

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

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

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

impl<T: Scalar + UlpsEq, D: DimName> UlpsEq for OPoint<T, D>

where T::Epsilon: Clone, DefaultAllocator: Allocator<T, D>,

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.

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

The inverse of UlpsEq::ulps_eq.

impl<T: Scalar + Copy, D: DimName> Copy for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>, OVector<T, D>: Copy,

impl<T: Scalar + Eq, D: DimName> Eq for OPoint<T, D>

where DefaultAllocator: Allocator<T, D>,