Struct RadixSortStrategyWith

pub struct RadixSortStrategyWith<B, S> {
    pub bytes: B,
    pub sort: S,
}

A radix sort strategy with a given byte extraction function and fallback sort

Fields

bytes: B

The byte-extraction method of this strategy

sort: S

The fallback sort used by this strategy

Trait Implementations

impl<B: Clone, S: Clone> Clone for RadixSortStrategyWith<B, S>

fn clone(&self) -> RadixSortStrategyWith<B, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<B: Debug, S: Debug> Debug for RadixSortStrategyWith<B, S>

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

Formats the value using the given formatter.

impl<B, S, K> KeyBytes<K> for RadixSortStrategyWith<B, S>

where B: KeyBytes<K>,

const HAS_CONST_KEY_LEN: bool = B::HAS_CONST_KEY_LEN

Get whether the key length for this type is always constant

const MAX_KEY_LEN: Option<usize> = B::MAX_KEY_LEN

Get the maximum key length for this type

fn has_const_key_len(&self) -> bool

Whether this key length is constant

fn max_key_len(&self) -> Option<usize>

The maximum key length

fn key_len(&self, key: &K) -> usize

The length of a given key

fn key_byte(&self, key: &K, byte: usize) -> u8

Get the nth byte of a given key. byte must be less than self.len(key)

impl<B, S, K> TrySorter<K> for RadixSortStrategyWith<B, S>

where S: TrySorter<K>,

fn try_sort( &mut self, arr: &mut [K], depth: isize, iteration: usize, force: bool, ) -> bool

Try to sort arr, assuming we’re at a given depth and iteration. Return whether the array was sorted. If force is true, then should always sort.

impl<B: Copy, S: Copy> Copy for RadixSortStrategyWith<B, S>