pub struct Rectangle { /* private fields */ }Expand description
Rectangle represents a minimum bounding rectangle (MBR) in N-dimensional space.
Implementations§
Source§impl Rectangle
impl Rectangle
Sourcepub fn from_point(point: &ArrayView1<'_, f64>) -> Self
pub fn from_point(point: &ArrayView1<'_, f64>) -> Self
Sourcepub fn contains_point(&self, point: &ArrayView1<'_, f64>) -> SpatialResult<bool>
pub fn contains_point(&self, point: &ArrayView1<'_, f64>) -> SpatialResult<bool>
Sourcepub fn contains_rectangle(&self, other: &Rectangle) -> SpatialResult<bool>
pub fn contains_rectangle(&self, other: &Rectangle) -> SpatialResult<bool>
Sourcepub fn intersects(&self, other: &Rectangle) -> SpatialResult<bool>
pub fn intersects(&self, other: &Rectangle) -> SpatialResult<bool>
Sourcepub fn intersection(&self, other: &Rectangle) -> SpatialResult<Rectangle>
pub fn intersection(&self, other: &Rectangle) -> SpatialResult<Rectangle>
Sourcepub fn enlarge(&self, other: &Rectangle) -> SpatialResult<Rectangle>
pub fn enlarge(&self, other: &Rectangle) -> SpatialResult<Rectangle>
Sourcepub fn enlargement_area(&self, other: &Rectangle) -> SpatialResult<f64>
pub fn enlargement_area(&self, other: &Rectangle) -> SpatialResult<f64>
Sourcepub fn min_distance_to_point(
&self,
point: &ArrayView1<'_, f64>,
) -> SpatialResult<f64>
pub fn min_distance_to_point( &self, point: &ArrayView1<'_, f64>, ) -> SpatialResult<f64>
Sourcepub fn min_distance_to_rectangle(&self, other: &Rectangle) -> SpatialResult<f64>
pub fn min_distance_to_rectangle(&self, other: &Rectangle) -> SpatialResult<f64>
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Rectangle
impl RefUnwindSafe for Rectangle
impl Send for Rectangle
impl Sync for Rectangle
impl Unpin for Rectangle
impl UnwindSafe for Rectangle
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.