Struct libpijul::pristine::Pair

#[repr(C)]
pub struct Pair<A, B> {
    pub a: A,
    pub b: B,
}

Fields

a: A

b: B

Trait Implementations

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

fn add_refs<T: LoadPage>( &self, txn: &T, pages: &mut BTreeMap<u64, usize> ) -> Result<(), T::Error>

where T::Error: Debug,

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: 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 + PartialOrd,

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

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

fn ne(&self, other: &Rhs) -> bool

This method 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

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

fn le(&self, other: &Rhs) -> bool

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

fn gt(&self, other: &Rhs) -> bool

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

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<A: Storable, B: Storable> Storable for Pair<A, B>

type PageReferences = Chain<<A as Storable>::PageReferences, <B as Storable>::PageReferences>

An iterator over the offsets to pages contained in this value. Only values from this crate can generate non-empty iterators, but combined values (like tuples) must chain the iterators returned by method page_offsets.

fn page_references(&self) -> Self::PageReferences

If this value is an offset to another page at offset offset, return Some(offset). Return None else.

fn compare<T: LoadPage>(&self, t: &T, b: &Self) -> Ordering

This is required for B trees, not necessarily for other structures. The default implementation panics.

unsafe fn drop<T>(&self, txn: &mut T) -> Result<(), <T as LoadPage>::Error>

where T: AllocPage,

If this value is an offset to another page at offset offset, return Some(offset). Return None else.

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

const ALIGN: usize = _

fn size(&self) -> usize

If Self::SIZE.is_some(), this must return the same value. The default implementation is Self;:SIZE.unwrap().

unsafe fn onpage_size(p: *const u8) -> usize

Read the size from an on-page entry. If Self::SIZE.is_some() this must be the same value.

unsafe fn from_raw_ptr<'a, T>(_: &T, p: *const u8) -> &'a Self

unsafe fn write_to_page_alloc<T: AllocPage>(&self, t: &mut T, p: *mut u8)

Write to a page. Must not overwrite the allocated size, but this isn’t checked (which is why it’s unsafe).

unsafe fn write_to_page(&self, _: *mut u8)

Write to a page. Must not overwrite the allocated size, but this isn’t checked (which is why it’s unsafe).

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>