Struct DirectoryGraphBuilder 

pub struct DirectoryGraphBuilder {
    insertion_order: DirectoryOrder,
    graph: DiGraph<Directory, ()>,
    digest_to_node_idx_size: HashMap<B3Digest, (NodeIndex, u64)>,
    rtl_edges_todo: HashMap<B3Digest, (u64, Vec<NodeIndex>)>,
    first_idx: Option<NodeIndex>,
}

This allows constructing a DirectoryGraph. After deciding on the insertion order (via Self::new_with_insertion_order), different Directory can be passed to Self::insert. A Self::build consumes the builder, returning a validated DirectoryGraph, or an error. The resulting DirectoryGraph can be used to drain the graph in either order.

It does do the same checks as RootToLeavesValidator and LeavesToRootValidator (insertion order, completeness, connectivity, correct sizes referenced).

Fields

insertion_order: DirectoryOrder

The order of Directory elements Self::insert is called with.

graph: DiGraph<Directory, ()>

A directed graph, using Directory as node weight. Edges point from parents to children.

digest_to_node_idx_size: HashMap<B3Digest, (NodeIndex, u64)>

A lookup table from directory digest to node index and size. The size is stored to avoid having to calculate it multiple times.

rtl_edges_todo: HashMap<B3Digest, (u64, Vec<NodeIndex>)>

A map from digest to size and all node indexes that are pointing to it. Used in the RTL case for all unfinished edges.

first_idx: Option<NodeIndex>

Points to the first node index. Populated in the RTL case only.

Implementations

impl DirectoryGraphBuilder

pub fn new_with_insertion_order(insertion_order: DirectoryOrder) -> Self

pub fn insert(&mut self, directory: Directory) -> Result<(), OrderingError>

pub fn build(self) -> Result<DirectoryGraph, OrderingError>