Struct libpijul::pristine::SerializedEdge

pub struct SerializedEdge(_);

The target half of an edge in the repository graph.

Implementations

impl SerializedEdge

pub fn flag(&self) -> EdgeFlags

pub fn dest(&self) -> Position<ChangeId>

pub fn introduced_by(&self) -> ChangeId

impl SerializedEdge

pub fn empty(dest: Position<ChangeId>, intro: ChangeId) -> Self

pub fn new(
    flag: EdgeFlags,
    change: ChangeId,
    pos: ChangePosition,
    intro: ChangeId
) -> Self

Trait Implementations

impl Clone for SerializedEdge

fn clone(&self) -> SerializedEdge

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for SerializedEdge

impl Debug for SerializedEdge

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

Formats the value using the given formatter.

impl Eq for SerializedEdge

impl Hash for SerializedEdge

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl Ord for SerializedEdge

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

fn eq(&self, other: &SerializedEdge) -> bool

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

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

This method tests for !=.

impl PartialOrd<SerializedEdge> for SerializedEdge

fn partial_cmp(&self, other: &SerializedEdge) -> 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 Storable for SerializedEdge

type PageReferences = Empty<u64>

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>(&self, _: &T, b: &Self) -> Ordering

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

impl StructuralEq for SerializedEdge

impl StructuralPartialEq for SerializedEdge

impl SubAssign<EdgeFlags> for SerializedEdge

fn sub_assign(&mut self, e: EdgeFlags)

Performs the -= operation.

impl UnsizedStorable for SerializedEdge

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(_: *const u8) -> usize

Read the size from an on-page entry.

unsafe fn write_to_page(&self, 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 from_raw_ptr<'a, T>(_: &T, p: *const u8) -> &'a Self