Struct tc_value::ComplexCollator

pub struct ComplexCollator { /* fields omitted */ }

Defines a collation order for Complex.

Trait Implementations

impl Clone for ComplexCollator

pub fn clone(&self) -> ComplexCollator

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Collate for ComplexCollator

type Value = Complex

pub fn compare(
    &self,
    left: &<ComplexCollator as Collate>::Value,
    right: &<ComplexCollator as Collate>::Value
) -> Ordering

Define the relative ordering of Self::Value.

fn bisect<V, B>(
    &self,
    slice: &[V],
    range: &Range<Self::Value, B>
) -> (usize, usize) where
    V: AsRef<[Self::Value]>,
    B: Borrow<[Self::Value]>, 

Given a collection of slices, return the start and end indices which match the given range.

fn bisect_left<V>(&self, slice: &[V], key: &[Self::Value]) -> usize where
    V: AsRef<[Self::Value]>, 

Given a collection of slices, return the leftmost insert point matching the given key.

fn bisect_right<V>(&self, slice: &[V], key: &[Self::Value]) -> usize where
    V: AsRef<[Self::Value]>, 

Given a collection of slices, return the rightmost insert point matching the given key.

fn compare_range<B>(
    &self,
    key: &[Self::Value],
    range: &Range<Self::Value, B>
) -> Ordering where
    B: Borrow<[Self::Value]>, 

Returns the ordering of the given key relative to the given range.

fn compare_slice<L, R>(&self, left: L, right: R) -> Ordering where
    R: AsRef<[Self::Value]>,
    L: AsRef<[Self::Value]>, 

Returns the relative ordering of the left slice with respect to right.

fn is_sorted<V>(&self, slice: &[V]) -> bool where
    V: AsRef<[Self::Value]>, 

Returns true if the given slice is in sorted order.

impl Default for ComplexCollator

pub fn default() -> ComplexCollator

Returns the “default value” for a type.