Enum grenad::SortAlgorithm

source ·

pub enum SortAlgorithm {
    Stable,
    Unstable,
}

Expand description

The kind of sort algorithm used by the sorter to sort its internal vector.

Variants

`Stable`

The stable sort algorithm maintains the relative order of values with equal keys, but it is slower than the unstable algorithm.

`Unstable`

The unstable sort algorithm is faster than the unstable algorithm, but it does not keep the relative order of values with equal keys.

Trait Implementations

source

impl Clone for SortAlgorithm

source

fn clone(&self) -> SortAlgorithm

Returns a copy of the value. Read more

1.0.0 · source

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

source

impl Debug for SortAlgorithm

source

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

source

impl Copy for SortAlgorithm

Auto Trait Implementations

impl RefUnwindSafe for SortAlgorithm

impl Send for SortAlgorithm

impl Sync for SortAlgorithm

impl Unpin for SortAlgorithm

impl UnwindSafe for SortAlgorithm

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> ToOwned for Twhere
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Enum grenad::SortAlgorithm

Variants

`Stable`

`Unstable`

Trait Implementations

impl Clone for SortAlgorithm

fn clone(&self) -> SortAlgorithm

fn clone_from(&mut self, source: &Self)

impl Debug for SortAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl Copy for SortAlgorithm

Auto Trait Implementations

impl RefUnwindSafe for SortAlgorithm

impl Send for SortAlgorithm

impl Sync for SortAlgorithm

impl Unpin for SortAlgorithm

impl UnwindSafe for SortAlgorithm

Blanket Implementations

impl<T> Any for Twhere
T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere
T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere
U: From<T>,

fn into(self) -> U

impl<T> ToOwned for Twhere
T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Enum grenad::SortAlgorithm

Variants

Stable

Unstable

Trait Implementations

impl Clone for SortAlgorithm

fn clone(&self) -> SortAlgorithm

fn clone_from(&mut self, source: &Self)

impl Debug for SortAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl Copy for SortAlgorithm

Auto Trait Implementations

impl RefUnwindSafe for SortAlgorithm

impl Send for SortAlgorithm

impl Sync for SortAlgorithm

impl Unpin for SortAlgorithm

impl UnwindSafe for SortAlgorithm

Blanket Implementations

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> ToOwned for Twhere T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

`Stable`

`Unstable`

impl<T> Any for Twhere
T: 'static + ?Sized,

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

impl<T, U> Into<U> for Twhere
U: From<T>,

impl<T> ToOwned for Twhere
T: Clone,

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,