pub struct Points<Coords: CoordinateSystem, R: RealField, NPTS: Dim, STORAGE> {
pub data: Matrix<R, NPTS, U3, STORAGE>,
/* private fields */
}Expand description
3D points. Can be in any CoordinateSystem.
This is a newtype wrapping an nalgebra::Matrix.
Fields§
§data: Matrix<R, NPTS, U3, STORAGE>The matrix storing point locations.
Implementations§
Auto Trait Implementations§
impl<Coords, R, NPTS, STORAGE> RefUnwindSafe for Points<Coords, R, NPTS, STORAGE>where
Coords: RefUnwindSafe,
NPTS: RefUnwindSafe,
R: RefUnwindSafe,
STORAGE: RefUnwindSafe,
impl<Coords, R, NPTS, STORAGE> Send for Points<Coords, R, NPTS, STORAGE>where
Coords: Send,
STORAGE: Send,
impl<Coords, R, NPTS, STORAGE> Sync for Points<Coords, R, NPTS, STORAGE>where
Coords: Sync,
STORAGE: Sync,
impl<Coords, R, NPTS, STORAGE> Unpin for Points<Coords, R, NPTS, STORAGE>where
Coords: Unpin,
NPTS: Unpin,
R: Unpin,
STORAGE: Unpin,
impl<Coords, R, NPTS, STORAGE> UnwindSafe for Points<Coords, R, NPTS, STORAGE>where
Coords: UnwindSafe,
NPTS: UnwindSafe,
R: UnwindSafe,
STORAGE: UnwindSafe,
Blanket Implementations§
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.