Struct rdx::KeyStrategy

pub struct KeyStrategy<F, T, K> {
    pub key: F,
    // some fields omitted
}

A key-based unordered sort on a type

Fields

key: F

The underlying key extraction function

Trait Implementations

impl<F: Clone, T: Clone, K: Clone> Clone for KeyStrategy<F, T, K>

fn clone(&self) -> KeyStrategy<F, T, K>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Copy, T: Copy, K: Copy> Copy for KeyStrategy<F, T, K>

impl<F: Debug, T: Debug, K: Debug> Debug for KeyStrategy<F, T, K>

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

Formats the value using the given formatter.

impl<F, T, K> KeyBytes<T> for KeyStrategy<F, T, K> where
    K: RadixSortKey,
    F: Fn(&T) -> K, 

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: &T) -> usize

The length of a given key

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

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

impl<F, T, K> TrySorter<T> for KeyStrategy<F, T, K> where
    F: FnMut(&T) -> K,
    K: RadixSortKey, 

fn try_sort(
    &mut self,
    arr: &mut [T],
    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.