Struct Greater 

pub struct Greater;

A potential output from Cmp, this is the type equivalent to the enum variant core::cmp::Ordering::Greater.

Trait Implementations

impl Clone for Greater

fn clone(&self) -> Greater

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Greater

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

Formats the value using the given formatter.

impl Default for Greater

fn default() -> Greater

Returns the “default value” for a type.

impl Eq for Greater

#[doc(hidden)] fn assert_receiver_is_total_eq(&self)

impl Hash for Greater

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for Greater

fn cmp(&self, other: &Greater) -> 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 Ord for Greater

Returns core::cmp::Ordering::Greater

fn to_ordering() -> Ordering

impl PartialEq for Greater

fn eq(&self, other: &Greater) -> 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 PartialOrd for Greater

fn partial_cmp(&self, other: &Greater) -> 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.

#[doc(hidden)] fn __chaining_lt(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

If self == other, returns ControlFlow::Continue(()). Otherwise, returns ControlFlow::Break(self < other).

#[doc(hidden)] fn __chaining_le(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for <= instead of <.

#[doc(hidden)] fn __chaining_gt(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for > instead of <.

#[doc(hidden)] fn __chaining_ge(&self, other: &Rhs) -> ControlFlow<bool>

🔬This is a nightly-only experimental API. (partial_ord_chaining_methods)

Same as __chaining_lt, but for >= instead of <.

impl<N, D, Q, R, Ui, Bi> PrivateDivIf<N, D, Q, R, UInt<Ui, Bi>, Greater> for ()

where D: Copy, UInt<Ui, Bi>: Copy + Sub<B1>, R: Sub<D>, Q: SetBit<UInt<Ui, Bi>, B1>, (): PrivateDiv<N, D, SetBitOut<Q, UInt<Ui, Bi>, B1>, Diff<R, D>, Sub1<UInt<Ui, Bi>>>,

type Quotient = <() as PrivateDiv<N, D, <Q as SetBit<UInt<Ui, Bi>, B1>>::Output, <R as Sub<D>>::Output, <UInt<Ui, Bi> as Sub<B1>>::Output>>::Quotient

type Remainder = <() as PrivateDiv<N, D, <Q as SetBit<UInt<Ui, Bi>, B1>>::Output, <R as Sub<D>>::Output, <UInt<Ui, Bi> as Sub<B1>>::Output>>::Remainder

fn private_div_if_quotient( self, n: N, d: D, q: Q, r: R, i: UInt<Ui, Bi>, _: Greater, ) -> Self::Quotient

fn private_div_if_remainder( self, n: N, d: D, q: Q, r: R, i: UInt<Ui, Bi>, _: Greater, ) -> Self::Remainder

impl<N, D, Q, R> PrivateDivIf<N, D, Q, R, UTerm, Greater> for ()

where R: Sub<D>, Q: SetBit<U0, B1>,

type Quotient = <Q as SetBit<UTerm, B1>>::Output

type Remainder = <R as Sub<D>>::Output

fn private_div_if_quotient( self, _: N, _: D, q: Q, _: R, i: U0, _: Greater, ) -> Self::Quotient

fn private_div_if_remainder( self, _: N, d: D, _: Q, r: R, _: U0, _: Greater, ) -> Self::Remainder

impl<Ul, Ur> PrivateDivInt<Greater, NInt<Ur>> for NInt<Ul>

where Ul: Unsigned + NonZero + Div<Ur>, Ur: Unsigned + NonZero, <Ul as Div<Ur>>::Output: Unsigned + NonZero,

type Output = PInt<<Ul as Div<Ur>>::Output>

fn private_div_int(self, _: Greater, d: NInt<Ur>) -> Self::Output

impl<Ul, Ur> PrivateDivInt<Greater, NInt<Ur>> for PInt<Ul>

where Ul: Unsigned + NonZero + Div<Ur>, Ur: Unsigned + NonZero, <Ul as Div<Ur>>::Output: Unsigned + NonZero,

type Output = NInt<<Ul as Div<Ur>>::Output>

fn private_div_int(self, _: Greater, d: NInt<Ur>) -> Self::Output

impl<Ul, Ur> PrivateDivInt<Greater, PInt<Ur>> for NInt<Ul>

where Ul: Unsigned + NonZero + Div<Ur>, Ur: Unsigned + NonZero, <Ul as Div<Ur>>::Output: Unsigned + NonZero,

type Output = NInt<<Ul as Div<Ur>>::Output>

fn private_div_int(self, _: Greater, d: PInt<Ur>) -> Self::Output

impl<Ul, Ur> PrivateDivInt<Greater, PInt<Ur>> for PInt<Ul>

where Ul: Unsigned + NonZero + Div<Ur>, Ur: Unsigned + NonZero, <Ul as Div<Ur>>::Output: Unsigned + NonZero,

type Output = PInt<<Ul as Div<Ur>>::Output>

fn private_div_int(self, _: Greater, d: PInt<Ur>) -> Self::Output

impl<N: Unsigned, P> PrivateIntegerAdd<Greater, N> for P

where P: Sub<N> + Unsigned, <P as Sub<N>>::Output: Unsigned + NonZero,

P + N = Positive where P > N

type Output = PInt<<P as Sub<N>>::Output>

fn private_integer_add(self, _: Greater, n: N) -> Self::Output

impl<U, B, Ur> PrivateMax<Ur, Greater> for UInt<U, B>

where Ur: Unsigned, U: Unsigned, B: Bit,

type Output = UInt<U, B>

fn private_max(self, _: Ur) -> Self::Output

impl<U, B, Ur> PrivateMin<Ur, Greater> for UInt<U, B>

where Ur: Unsigned, U: Unsigned, B: Bit,

type Output = Ur

fn private_min(self, rhs: Ur) -> Self::Output

impl Copy for Greater

impl StructuralPartialEq for Greater

impl TrivialClone for Greater