Struct rdx::DefaultStrategy

pub struct DefaultStrategy;

The default radix sort strategy for a type

Trait Implementations

impl Clone for DefaultStrategy

fn clone(&self) -> DefaultStrategy

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for DefaultStrategy

impl Debug for DefaultStrategy

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

Formats the value using the given formatter.

impl<K: RadixSortKey> KeyBytes<K> for DefaultStrategy

const HAS_CONST_KEY_LEN: bool

Get whether the key length for this type is always constant

const MAX_KEY_LEN: Option<usize>

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<K: RadixSortKey> TrySorter<K> for DefaultStrategy

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.