pub enum SortKind {
Quick,
Stable,
}Expand description
Sorting algorithm selection.
Variants§
Quick
Unstable quicksort (faster but does not preserve order of equal elements).
Stable
Stable merge sort (preserves relative order of equal elements).
Trait Implementations§
impl Copy for SortKind
impl Eq for SortKind
impl StructuralPartialEq for SortKind
Auto Trait Implementations§
impl Freeze for SortKind
impl RefUnwindSafe for SortKind
impl Send for SortKind
impl Sync for SortKind
impl Unpin for SortKind
impl UnsafeUnpin for SortKind
impl UnwindSafe for SortKind
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