Struct libpijul::graph::Graph
[−]
[src]
pub struct Graph { pub lines: Vec<Line>, // some fields omitted }
A graph, representing the whole content of the repository state at
a point in time. The encoding is a "flat adjacency list", where
each vertex contains a index children
and a number of children
n_children
. The children of that vertex are then
&g.children[children .. children + n_children]
.
Fields
lines: Vec<Line>
Array of all alive lines in the graph. Line 0 is a dummy line at the end, so that all nodes have a common successor
Methods
impl Graph
[src]
Trait Implementations
impl Debug for Graph
[src]
impl Index<VertexId> for Graph
[src]
type Output = Line
The returned type after indexing
fn index(&self, idx: VertexId) -> &Self::Output
The method for the indexing (container[index]
) operation