pub enum SortKey3D {
Hilbert,
}Expand description
Which key to use when sorting 3D boxes before packing the tree.
SortKey3D::Hilbert is the default and currently the only stable public
ordering. Additional sort-key implementations are available only through the
hidden benchmark support API.
Variants§
Hilbert
Hilbert curve order.
Trait Implementations§
impl Copy for SortKey3D
impl Eq for SortKey3D
impl StructuralPartialEq for SortKey3D
Auto Trait Implementations§
impl Freeze for SortKey3D
impl RefUnwindSafe for SortKey3D
impl Send for SortKey3D
impl Sync for SortKey3D
impl Unpin for SortKey3D
impl UnsafeUnpin for SortKey3D
impl UnwindSafe for SortKey3D
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 more