Expand description
Fixed-point coordinate rectangle. The Min bound is inclusive and the Max bound is exclusive. It is well-formed if Min.X <= Max.X and likewise for Y.
Fields
min: P26_6
max: P26_6
Implementations
sourceimpl R26_6
impl R26_6
sourcepub fn intersect(self, other: Self) -> Self
pub fn intersect(self, other: Self) -> Self
Returns the largest rectangle contained by both r and s. If the two rectangles do not overlap then the zero rectangle will be returned.
sourcepub fn maybe_intersect(self, other: Self) -> Option<Self>
pub fn maybe_intersect(self, other: Self) -> Option<Self>
Returns the largest rectangle contained by both r and s. If the two rectangles do not overlap then the zero rectangle will be returned.
Trait Implementations
impl Copy for R26_6
impl Eq for R26_6
impl StructuralEq for R26_6
impl StructuralPartialEq for R26_6
Auto Trait Implementations
impl RefUnwindSafe for R26_6
impl Send for R26_6
impl Sync for R26_6
impl Unpin for R26_6
impl UnwindSafe for R26_6
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more