Struct MemOrdered

pub struct MemOrdered<T: ?Sized>(pub T);

A type that implements comparison traits via MemEq and MemOrd.

Examples

use mem_cmp::MemOrdered;

let mut values = [-1, 4, 7, 3];

MemOrdered::from_mut_slice(&mut values).sort();

assert_eq!(values, [3, 4, 7, -1]);

Tuple Fields

0: T

Implementations

impl<T> MemOrdered<T>

Slice conversions.

Safety

All types used must adhere to these safety rules.

pub fn from_slice(slice: &[T]) -> &[MemOrdered<T>]

Creates a slice of memory-ordered elements.

pub fn from_mut_slice(slice: &mut [T]) -> &mut [MemOrdered<T>]

Creates a mutable slice of memory-ordered elements.

Trait Implementations

impl<T: ?Sized> AsMut<T> for MemOrdered<T>

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

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

impl<T: ?Sized> AsRef<T> for MemOrdered<T>

fn as_ref(&self) -> &T

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

impl<T: Clone + ?Sized> Clone for MemOrdered<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + ?Sized> Debug for MemOrdered<T>

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

Formats the value using the given formatter.

impl<T: Default + ?Sized> Default for MemOrdered<T>

fn default() -> MemOrdered<T>

Returns the “default value” for a type.

impl<'a, T: ?Sized> From<&'a T> for &'a MemOrdered<T>

fn from(inner: &T) -> Self

Converts to this type from the input type.

impl<'a, T: ?Sized> From<&'a mut T> for &'a mut MemOrdered<T>

fn from(inner: &mut T) -> Self

Converts to this type from the input type.

impl<T> From<T> for MemOrdered<T>

fn from(inner: T) -> Self

Converts to this type from the input type.

impl<T: Hash + ?Sized> Hash for MemOrdered<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: MemOrd> Ord for MemOrdered<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, U: ?Sized> PartialEq<MemOrdered<U>> for MemOrdered<T>

where T: MemEq<U> + ?Sized,

fn eq(&self, other: &MemOrdered<U>) -> 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, U: ?Sized> PartialOrd<MemOrdered<U>> for MemOrdered<T>

where T: MemOrd<U> + ?Sized,

fn partial_cmp(&self, other: &MemOrdered<U>) -> 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: Copy + ?Sized> Copy for MemOrdered<T>

impl<T> Eq for MemOrdered<T>