pub struct Trapezoid {
pub x_left: f64,
pub x_right: f64,
pub bottom_seg: usize,
pub top_seg: usize,
pub face: Option<usize>,
}Expand description
A trapezoid in the trapezoidal decomposition of a planar subdivision.
Bounded by left and right endpoints and top/bottom line segments.
Fields§
§x_left: f64Left x-boundary.
x_right: f64Right x-boundary.
bottom_seg: usizeBottom edge index (index into segment list, or usize::MAX for floor).
top_seg: usizeTop edge index (index into segment list, or usize::MAX for ceiling).
face: Option<usize>Face label (e.g., triangle index).
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Trapezoid
impl RefUnwindSafe for Trapezoid
impl Send for Trapezoid
impl Sync for Trapezoid
impl Unpin for Trapezoid
impl UnsafeUnpin for Trapezoid
impl UnwindSafe for Trapezoid
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<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.