Struct ink_storage::collections::binary_heap::Reverse

pub struct Reverse<T>(_);

Wrapper for core::cmp::Reverse for using a BinaryHeap as a min-heap.

Implementations

impl<T> Reverse<T> where
    T: PackedLayout + Ord, 

pub fn new(value: T) -> Self

Construct a new Reverse from the given value.

pub fn value(&self) -> &T

Return a shared reference to the inner value.

Trait Implementations

impl<T: Clone> Clone for Reverse<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Copy> Copy for Reverse<T>

impl<T: Debug> Debug for Reverse<T>

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

Formats the value using the given formatter.

impl<T> Decode for Reverse<T> where
    T: PackedLayout + Ord + Decode, 

fn decode<I: Input>(value: &mut I) -> Result<Self, Error>

Attempt to deserialise the value from input.

pub fn skip<I>(input: &mut I) -> Result<(), Error> where
    I: Input, 

Attempt to skip the encoded value from input.

pub fn encoded_fixed_size() -> Option<usize>

Returns the fixed encoded size of the type.

impl<T: Default> Default for Reverse<T>

fn default() -> Reverse<T>

Returns the “default value” for a type.

impl<T> Encode for Reverse<T> where
    T: PackedLayout + Ord + Encode, 

fn size_hint(&self) -> usize

If possible give a hint of expected size of the encoding.

fn encode_to<O: Output + ?Sized>(&self, dest: &mut O)

Convert self to a slice and append it to the destination.

fn encode(&self) -> Vec<u8>

Convert self to an owned vector.

fn using_encoded<R, F: FnOnce(&[u8]) -> R>(&self, f: F) -> R

Convert self to a slice and then invoke the given closure with it.

pub fn encoded_size(&self) -> usize

Calculates the encoded size.

impl<T: Eq> Eq for Reverse<T>

impl<T: Ord> Ord for Reverse<T>

fn cmp(&self, other: &Reverse<T>) -> Ordering

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<T> PackedLayout for Reverse<T> where
    T: PackedLayout + Ord, 

fn pull_packed(&mut self, at: &Key)

Indicates to self that is has just been pulled from the storage.

fn push_packed(&self, at: &Key)

Indicates to self that it is about to be pushed to contract storage.

fn clear_packed(&self, at: &Key)

Indicates to self that it is about to be cleared from contract storage.

impl<T: PartialEq> PartialEq<Reverse<T>> for Reverse<T>

fn eq(&self, other: &Reverse<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Reverse<T>) -> bool

This method tests for !=.

impl<T: PartialOrd> PartialOrd<Reverse<T>> for Reverse<T>

fn partial_cmp(&self, other: &Reverse<T>) -> Option<Ordering>

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

#[must_use]pub fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

#[must_use]pub fn le(&self, other: &Rhs) -> bool

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

#[must_use]pub fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]pub fn ge(&self, other: &Rhs) -> bool

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

impl<T> SpreadLayout for Reverse<T> where
    T: PackedLayout + Ord, 

const FOOTPRINT: u64

The footprint of the type.

fn pull_spread(ptr: &mut KeyPtr) -> Self

Pulls an instance of Self from the contract storage.

fn push_spread(&self, ptr: &mut KeyPtr)

Pushes an instance of Self to the contract storage.

fn clear_spread(&self, ptr: &mut KeyPtr)

Clears an instance of Self from the contract storage.

const REQUIRES_DEEP_CLEAN_UP: bool

Indicates whether a type requires deep clean-up of its state meaning that a clean-up routine has to decode an entity into an instance in order to eventually recurse upon its tear-down. This is not required for the majority of primitive data types such as i32, however types such as storage::Box that might want to forward the clean-up procedure to their inner T require a deep clean-up.

impl<T> StructuralEq for Reverse<T>

impl<T> StructuralPartialEq for Reverse<T>