Struct libpijul::pristine::Vertex

#[repr(C)]
pub struct Vertex<H> {
    pub change: H,
    pub start: ChangePosition,
    pub end: ChangePosition,
}

A node in the repository graph, made of a change internal identifier, and a line identifier in that change.

Fields

change: H

The change that introduced this node.

start: ChangePosition

The line identifier of the node in that change. Here, “line” does not imply anything on the contents of the chunk.

end: ChangePosition

Implementations

impl Vertex<ChangeId>

pub const ROOT: Vertex<ChangeId> = _

The node at the root of the repository graph.

pub fn is_root(&self) -> bool

Is this the root key? (the root key is all 0s).

pub fn to_option(&self) -> Vertex<Option<ChangeId>>

impl<H: Clone> Vertex<H>

pub fn start_pos(&self) -> Position<H>

Convenience function to get the start position of a Vertex<ChangeId> as a Position.

pub fn end_pos(&self) -> Position<H>

Convenience function to get the end position of a Vertex<ChangeId> as a Position.

pub fn is_empty(&self) -> bool

Is this vertex of zero length?

pub fn len(&self) -> usize

Length of this key, in bytes.

impl<H> Vertex<Option<H>>

pub fn unwrap(self) -> Vertex<H>

Trait Implementations

impl<H: Clone> Clone for Vertex<H>

fn clone(&self) -> Vertex<H>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Vertex<T>

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

Formats the value using the given formatter.

impl<'de, H> Deserialize<'de> for Vertex<H>where H: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<H: Hash> Hash for Vertex<H>

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<H: Ord> Ord for Vertex<H>

fn cmp(&self, other: &Vertex<H>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<H: PartialEq> PartialEq for Vertex<H>

fn eq(&self, other: &Vertex<H>) -> 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<H: PartialOrd> PartialOrd for Vertex<H>

fn partial_cmp(&self, other: &Vertex<H>) -> 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<H> Serialize for Vertex<H>where H: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<H: Copy> Copy for Vertex<H>

impl<H: Eq> Eq for Vertex<H>

impl<H> StructuralEq for Vertex<H>

impl<H> StructuralPartialEq for Vertex<H>