Struct libpijul::Vertex

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).

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 len(&self) -> usize

Length of this key, in bytes.

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

impl<H: Debug> Debug for Vertex<H>

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

Formats the value using the given formatter.

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

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

Deserialize this value from the given Serde deserializer.

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

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

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

pub fn cmp(&self, other: &Vertex<H>) -> 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

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

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

pub fn eq(&self, other: &Vertex<H>) -> bool

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

pub fn ne(&self, other: &Vertex<H>) -> bool

This method tests for !=.

impl<H: PartialOrd> PartialOrd<Vertex<H>> for Vertex<H>

pub fn partial_cmp(&self, other: &Vertex<H>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

pub fn lt(&self, other: &Vertex<H>) -> bool

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

pub fn le(&self, other: &Vertex<H>) -> bool

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

pub fn gt(&self, other: &Vertex<H>) -> bool

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

pub fn ge(&self, other: &Vertex<H>) -> bool

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

impl Representable for Vertex<ChangeId>

pub fn alignment() -> Alignment

Alignment of this type. Allowed values are 1, 2, 4 and 8.

pub fn onpage_size(&self) -> u16

How much space this value occupies on the page (not counting alignment padding).

pub unsafe fn write_value(&self, p: *mut u8)

Write this value to a u8 pointer, guaranteed to be a multiple of self.alignment().

pub unsafe fn read_value(p: *const u8) -> Self

Read value from an onpage pointer, guaranteed to be a multiple of self.alignment().

pub unsafe fn cmp_value<T>(&self, _: &T, x: Self) -> Ordering

Compare a value with an onpage value. The current transaction is sometimes helpful, for instance when the page only stores a pointer to another page.

type PageOffsets = 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.

pub fn page_offsets(&self) -> Self::PageOffsets

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

pub unsafe fn skip(p: *mut u8) -> *mut u8

First pointer strictly after this value's pointer. The default implementation is basically p.offset(self.onpage_size() as isize), but their might be more efficient implementations in some cases.

pub fn drop_value<E, T, R>(
    &self,
    &mut MutTxn<E, T>,
    &mut R
) -> Result<(), Error> where
    E: Borrow<Env<Exclusive>>,
    R: Rng, 

How to free the pages used by this value. The default implementation doesn't do anything, which is fine for types stored directly on B tree pages.

impl<H> Serialize for Vertex<H> where
    H: Serialize, 

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

Serialize this value into the given Serde serializer.

impl<H> StructuralEq for Vertex<H>

impl<H> StructuralPartialEq for Vertex<H>