Struct TreeOrdBytes 

pub struct TreeOrdBytes<'a>(pub &'a [u8]);

The generic [T] impl is not performant for [u8]. We can’t specialize the [T] impl on stable, so this exists to compare bytes in chunks of bytes. However, it seems this is only more performant for very long slices and deep trees, you should benchmark to see if this is faster for your usecase.

Tuple Fields

0: &'a [u8]

Trait Implementations

impl<'a> Debug for TreeOrdBytes<'a>

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

Formats the value using the given formatter.

impl<'a> Ord for TreeOrdBytes<'a>

fn cmp(&self, other: &TreeOrdBytes<'a>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'a> PartialEq for TreeOrdBytes<'a>

fn eq(&self, other: &TreeOrdBytes<'a>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a> PartialOrd for TreeOrdBytes<'a>

fn partial_cmp(&self, other: &TreeOrdBytes<'a>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a> TreeOrd for TreeOrdBytes<'a>

type Tracker = LexicographicTracker<u8>

fn tree_cmp(&self, rhs: &Self, tracker: &mut Self::Tracker) -> Ordering

impl<'a> Eq for TreeOrdBytes<'a>

impl<'a> StructuralPartialEq for TreeOrdBytes<'a>