Struct Pair 

pub struct Pair<A, B> {
    pub fst: A,
    pub snd: B,
}

A symmetric product (non-dependent pair) for use with Sum.

Fields

fst: A

First component.

snd: B

Second component.

Implementations

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

pub fn new(fst: A, snd: B) -> Self

Construct a Pair.

pub fn swap(self) -> Pair<B, A>

Swap the pair.

pub fn map_fst<C>(self, f: impl FnOnce(A) -> C) -> Pair<C, B>

Map the first component.

pub fn map_snd<D>(self, g: impl FnOnce(B) -> D) -> Pair<A, D>

Map the second component.

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

Convert to a tuple.

pub fn from_tuple(t: (A, B)) -> Self

Convert from a tuple.

Trait Implementations

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

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

Returns a duplicate 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: 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: Eq, B: Eq> Eq for Pair<A, B>

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