Struct CompactPair 

#[repr(C)]
pub struct CompactPair<A, B> {
    pub _phantom_0: PhantomData<UnsafeCell<A>>,
    pub _phantom_1: PhantomData<UnsafeCell<B>>,
    pub mFirst: A,
    pub mSecond: B,
}

CompactPair is the logical concatenation of an instance of A with an instance B. Space is conserved when possible.

In general if space conservation is not critical is preferred to use std::pair.

Fields

_phantom_0: PhantomData<UnsafeCell<A>>

_phantom_1: PhantomData<UnsafeCell<B>>

mFirst: A

mSecond: B

Trait Implementations

impl<A, B> Clone for CompactPair<A, B>

where A: Clone, B: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A, B> Debug for CompactPair<A, B>

where A: Debug, B: Debug,

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

Formats the value using the given formatter.

impl<A, B> PartialEq for CompactPair<A, B>

where A: PartialEq, B: PartialEq,

fn eq(&self, other: &CompactPair<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, B> Copy for CompactPair<A, B>

where A: Copy, B: Copy,

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