Struct OrdGraph 

pub struct OrdGraph {
    pub ords: Vec<u32>,
    pub tree: Vec<u32>,
    pub parents: Vec<Vec<u32>>,
    pub generation: Vec<u32>,
    /* private fields */
}

The commit graph in integers: one row per commit, rows in the order the CommitNode list came in (parents before children, as crate::graph::assign_generations guarantees).

Fields

ords: Vec<u32>

row → the commit’s ordinal.

tree: Vec<u32>

row → the root tree’s ordinal, or NONE.

parents: Vec<Vec<u32>>

row → parent rows (a parent outside the graph contributes nothing).

generation: Vec<u32>

row → generation.

Implementations

impl OrdGraph

pub fn from_nodes(nodes: &[CommitNode], space: &OrdinalSpace<'_>) -> Self

Decode each node’s hex once and resolve it against the space. A node whose oid the space does not hold is kept as a row with no ordinal (it cannot be asked for by ordinal, and its children still see it as a parent row).

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn commits(&self) -> &RoaringBitmap

The set of commit ordinals.

pub fn is_commit(&self, ordinal: u32) -> bool

pub fn row_of(&self, ordinal: u32) -> Option<u32>

ordinal → row, for a commit.

pub fn tip_rows(&self) -> Vec<u32>

Rows with no child in the graph — the tips.

Trait Implementations

impl Clone for OrdGraph

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for OrdGraph

fn default() -> Self

Returns the “default value” for a type.