Struct TreeOrdReverse 

#[repr(transparent)]
pub struct TreeOrdReverse<T: TreeOrd>(pub T);

Like core::cmp::Reverse except for TreeOrd

Tuple Fields

0: T

Trait Implementations

impl<T: Ord + TreeOrd> Ord for TreeOrdReverse<T>

fn cmp(&self, other: &TreeOrdReverse<T>) -> 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<T: PartialEq + TreeOrd> PartialEq for TreeOrdReverse<T>

fn eq(&self, other: &TreeOrdReverse<T>) -> 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<T: PartialOrd + TreeOrd> PartialOrd for TreeOrdReverse<T>

fn partial_cmp(&self, other: &TreeOrdReverse<T>) -> 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<T: TreeOrd> TreeOrd for TreeOrdReverse<T>

type Tracker = <T as TreeOrd>::Tracker

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

impl<T: Eq + TreeOrd> Eq for TreeOrdReverse<T>

impl<T: TreeOrd> StructuralPartialEq for TreeOrdReverse<T>