Struct Pair

pub struct Pair<A, B> { /* private fields */ }

Store several pieces of information in each node.

Implementations

impl<A, B> Pair<A, B>

pub fn wrap(a: A, b: B) -> Pair<A, B>

Create a pair operation.

pub fn into_inner(self) -> (A, B)

Returns the inner operations.

Trait Implementations

impl<A: Clone, B: Clone> Clone for Pair<A, B>

fn clone(&self) -> Pair<A, B>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug, B: Debug> Debug for Pair<A, B>

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

Formats the value using the given formatter.

impl<A: Default, B: Default> Default for Pair<A, B>

fn default() -> Pair<A, B>

Returns the “default value” for a type.

impl<A: Hash, B: Hash> Hash for Pair<A, B>

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<TA, TB, A: Identity<TA>, B: Identity<TB>> Identity<(TA, TB)> for Pair<A, B>

fn identity(&self) -> (TA, TB)

Returns an element such that if combined with any element a the result must be a.

impl<TA, TB, A: Invertible<TA>, B: Invertible<TB>> Invertible<(TA, TB)> for Pair<A, B>

fn uncombine(&self, a: &mut (TA, TB), b: &(TA, TB))

A method such that the following code will leave a in the same state as it started.

impl<TA, TB, A: Operation<TA>, B: Operation<TB>> Operation<(TA, TB)> for Pair<A, B>

fn combine(&self, a: &(TA, TB), b: &(TA, TB)) -> (TA, TB)

The operation that is performed to combine two intervals in the segment tree.

fn combine_mut(&self, a: &mut (TA, TB), b: &(TA, TB))

Replace the value in a with combine(a, b). This function exists to allow certain optimizations and by default simply calls combine.

fn combine_mut2(&self, a: &(TA, TB), b: &mut (TA, TB))

Replace the value in b with combine(a, b). This function exists to allow certain optimizations and by default simply calls combine.

fn combine_left(&self, a: (TA, TB), b: &(TA, TB)) -> (TA, TB)

Must return the same as combine. This function exists to allow certain optimizations and by default simply calls combine_mut.

fn combine_right(&self, a: &(TA, TB), b: (TA, TB)) -> (TA, TB)

Must return the same as combine. This function exists to allow certain optimizations and by default simply calls combine_mut2.

fn combine_both(&self, a: (TA, TB), b: (TA, TB)) -> (TA, TB)

Must return the same as combine. This function exists to allow certain optimizations and by default simply calls combine_left.

impl<A: Ord, B: Ord> Ord for Pair<A, B>

fn cmp(&self, other: &Pair<A, B>) -> 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<A: PartialEq, B: PartialEq> PartialEq for Pair<A, B>

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

fn partial_cmp(&self, other: &Pair<A, B>) -> 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<TA, TB, A: Commutative<TA>, B: Commutative<TB>> Commutative<(TA, TB)> for Pair<A, B>

impl<A: Copy, B: Copy> Copy for Pair<A, B>

impl<A: Eq, B: Eq> Eq for Pair<A, B>

impl<A, B> StructuralPartialEq for Pair<A, B>