Struct OrderByInt 

pub struct OrderByInt<T: IntegerId>(pub T);

A wrapper around an IntegerId which implements Eq, Ord, and Hash based on the integer value.

Tuple Fields

0: T

Trait Implementations

impl<T: IntegerId> AsMut<T> for OrderByInt<T>

fn as_mut(&mut self) -> &mut T

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T: IntegerId> AsRef<T> for OrderByInt<T>

fn as_ref(&self) -> &T

Converts this type into a shared reference of the (usually inferred) input type.

impl<T: Clone + IntegerId> Clone for OrderByInt<T>

fn clone(&self) -> OrderByInt<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Copy + IntegerId> Copy for OrderByInt<T>

impl<T: Debug + IntegerId> Debug for OrderByInt<T>

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

Formats the value using the given formatter.

impl<T: Default + IntegerId> Default for OrderByInt<T>

fn default() -> OrderByInt<T>

Returns the “default value” for a type.

impl<T: IntegerId> Eq for OrderByInt<T>

impl<T: IntegerId> EquivalentId<T> for OrderByInt<T>

fn as_id(&self) -> T

Convert this type to an id K.

impl<T: IntegerId> EquivalentId<T> for &OrderByInt<T>

fn as_id(&self) -> T

Convert this type to an id K.

impl<T: IntegerId> From<T> for OrderByInt<T>

fn from(value: T) -> Self

Converts to this type from the input type.

impl<T: IntegerId> Hash for OrderByInt<T>

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<T: IntegerId> IntegerId for OrderByInt<T>

const MIN_ID: Option<Self>

The value of this type with the smallest integer value, or None if this type is uninhabited.

const MAX_ID: Option<Self>

The value of this type with the largest integer value, or None if this type is uninhabited.

const MIN_ID_INT: Option<Self::Int> = <T as crate::IntegerId>::MIN_ID_INT

The value of Self::MIN_ID a primitive integer, or None if this type is uninhabited.

const MAX_ID_INT: Option<Self::Int> = <T as crate::IntegerId>::MAX_ID_INT

The value of Self::MAX_ID a primitive integer, or None if this type is uninhabited.

const TRUSTED_RANGE: Option<TrustedRangeToken<Self>>

Indicates that the type’s implementation of IntegerId::to_int can be trusted to only return values in the range MIN_ID_INT..=MAX_ID_INT.

type Int = <T as IntegerId>::Int

The underlying integer type.

fn from_int(id: Self::Int) -> Self

Create an id from the underlying integer value, panicking if the value is invalid.

fn from_int_checked(id: Self::Int) -> Option<Self>

Create an id from the underlying integer value, returning None if the value is invalid.

unsafe fn from_int_unchecked(id: Self::Int) -> Self

Create an id from the underlying integer value, triggering undefined behavior if the value is invalid.

fn to_int(self) -> Self::Int

Convert this id into an underlying integer type.

impl<T: IntegerIdContiguous> IntegerIdContiguous for OrderByInt<T>

impl<T: IntegerIdCounter> IntegerIdCounter for OrderByInt<T>

const START: Self

Where a counter a should start from.

const START_INT: Self::Int = T::START_INT

The value of Self::START as a T::Int.

fn checked_add(this: Self, offset: Self::Int) -> Option<Self>

Increment this value by the specified offset, returning None if the value overflows or is invalid.

fn checked_sub(this: Self, offset: Self::Int) -> Option<Self>

Increment this value by the specified offset, returning None if the value overflows or is invalid.

impl<T: IntegerId> Ord for OrderByInt<T>

fn cmp(&self, other: &Self) -> 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: IntegerId> PartialEq for OrderByInt<T>

fn eq(&self, other: &Self) -> 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: IntegerId> PartialEq<T> for OrderByInt<T>

fn eq(&self, other: &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: IntegerId> PartialOrd for OrderByInt<T>

fn partial_cmp(&self, other: &Self) -> 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: IntegerId> PartialOrd<T> for OrderByInt<T>

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