pub struct BBox<T> { /* private fields */ }Expand description
General purpose bounding box structure.
Implementations§
Source§impl<T: Float> BBox<T>
impl<T: Float> BBox<T>
Sourcepub fn new(minb: [T; 3], maxb: [T; 3]) -> Self
pub fn new(minb: [T; 3], maxb: [T; 3]) -> Self
Construct a bounding box containing points minb and maxb.
§Examples
let min_p = [0.0; 3];
let max_p = [1.5, 0.5, 1.0];
let sample_box = BBox::<f32>::new(min_p, max_p);
assert_eq!(sample_box.min_corner(), min_p);
assert_eq!(sample_box.max_corner(), max_p);Sourcepub fn unit() -> BBox<T>
pub fn unit() -> BBox<T>
Construct a unit bounding box from zero to one in each dimension.
§Examples
let unit_box = BBox::<f32>::new(
[0.0; 3],
[1.0; 3]);
assert_eq!(BBox::<f32>::unit(), unit_box);Sourcepub fn size(&self) -> [T; 3]
pub fn size(&self) -> [T; 3]
Get the size of the box in each dimension.
§Examples
let unit_box = BBox::<f32>::unit();
assert_eq!(unit_box.size(), [1.0, 1.0, 1.0]);Sourcepub fn max_axis(&self) -> (u8, T)
pub fn max_axis(&self) -> (u8, T)
Determine the axis of the maximum side length of the box and return both: the axis index (x => 0, y => 1, z => 2) and the length.
§Examples
let min_p = [0.0; 3];
let max_p = [1.5, 0.5, 1.0];
let sample_box = BBox::<f32>::new(min_p, max_p);
assert_eq!(sample_box.max_axis(), (0, 1.5));pub fn min_corner(&self) -> [T; 3]
pub fn max_corner(&self) -> [T; 3]
Sourcepub fn diameter(&self) -> Twhere
T: RealField,
pub fn diameter(&self) -> Twhere
T: RealField,
Diameter of the bounding box is the distance between the min and max corners.
pub fn corner<C: Copy + Into<Corner>>(&self, which: C) -> [T; 3]
Trait Implementations§
Source§impl<T: Float> Intersect for BBox<T>
impl<T: Float> Intersect for BBox<T>
type Output = BBox<T>
Source§fn intersect(self, other: Self) -> Self
fn intersect(self, other: Self) -> Self
Intersect on one object with another, producing the resulting intersection.
For example if [-1, 2] and [0, 4] are two closed intervals, then their
intersection is a closed interval [0, 2].
Note that the intersection object can be of a different type
Source§fn intersects(self, other: Self) -> bool
fn intersects(self, other: Self) -> bool
Check if this object intersects another.
impl<T: Copy> Copy for BBox<T>
impl<T> StructuralPartialEq for BBox<T>
Auto Trait Implementations§
impl<T> Freeze for BBox<T>where
T: Freeze,
impl<T> RefUnwindSafe for BBox<T>where
T: RefUnwindSafe,
impl<T> Send for BBox<T>where
T: Send,
impl<T> Sync for BBox<T>where
T: Sync,
impl<T> Unpin for BBox<T>where
T: Unpin,
impl<T> UnwindSafe for BBox<T>where
T: UnwindSafe,
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> CloneBytes for Twhere
T: Clone + 'static,
impl<T> CloneBytes for Twhere
T: Clone + 'static,
unsafe fn clone_bytes(src: &[MaybeUninit<u8>]) -> Box<[MaybeUninit<u8>]>
unsafe fn clone_from_bytes(dst: &mut [MaybeUninit<u8>], src: &[MaybeUninit<u8>])
unsafe fn clone_into_raw_bytes( src: &[MaybeUninit<u8>], dst: &mut [MaybeUninit<u8>], )
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DebugBytes for Twhere
T: Debug + 'static,
impl<T> DebugBytes for Twhere
T: Debug + 'static,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> DropBytes for Twhere
T: 'static,
impl<T> DropBytes for Twhere
T: 'static,
unsafe fn drop_bytes(bytes: &mut [MaybeUninit<u8>])
Source§impl<'a, S, I> Get<'a, I> for Swhere
I: GetIndex<'a, S>,
impl<'a, S, I> Get<'a, I> for Swhere
I: GetIndex<'a, S>,
type Output = <I as GetIndex<'a, S>>::Output
fn get(&self, idx: I) -> Option<<I as GetIndex<'a, S>>::Output>
Source§fn at(&self, idx: I) -> Self::Output
fn at(&self, idx: I) -> Self::Output
Return a value at the given index. This is provided as the checked
version of
get that will panic if the equivalent get call is None,
which typically means that the given index is out of bounds. Read moreSource§unsafe fn at_unchecked(&self, idx: I) -> Self::Output
unsafe fn at_unchecked(&self, idx: I) -> Self::Output
Return a value at the given index. Read more
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<S, I> Isolate<I> for Swhere
I: IsolateIndex<S>,
impl<S, I> Isolate<I> for Swhere
I: IsolateIndex<S>,
Source§impl<T> PartialEqBytes for Twhere
T: PartialEq + 'static,
impl<T> PartialEqBytes for Twhere
T: PartialEq + 'static,
unsafe fn eq_bytes(a: &[MaybeUninit<u8>], b: &[MaybeUninit<u8>]) -> bool
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T, N> PushArrayToVec<N> for T
impl<T, N> PushArrayToVec<N> 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.