Trait DAGStore 

pub trait DAGStore {
    // Required methods
    fn get(&self, cid: &Hash) -> Option<&MerkleNode>;
    fn put(&mut self, node: MerkleNode) -> Result<Hash, DAGError>;
    fn put_unchecked(&mut self, node: MerkleNode) -> Result<Hash, DAGError>;
    fn heads(&self) -> Vec<Hash>;
    fn contains(&self, cid: &Hash) -> bool;
    fn ancestors(&self, cid: &Hash) -> HashSet<Hash>;
    fn children(&self, cid: &Hash) -> Vec<Hash>;
    fn topological_order(&self) -> Vec<Hash>;
    fn missing_nodes(&self) -> HashSet<Hash>;
    fn len(&self) -> usize;

    // Provided method
    fn is_empty(&self) -> bool { ... }
}

Trait for content-addressed DAG storage.

Required Methods

fn get(&self, cid: &Hash) -> Option<&MerkleNode>

Get a node by its CID.

fn put(&mut self, node: MerkleNode) -> Result<Hash, DAGError>

Store a node, returning its CID.

The node’s CID is verified before storage. Returns an error if verification fails or parents are missing.

fn put_unchecked(&mut self, node: MerkleNode) -> Result<Hash, DAGError>

Store a node without checking for missing parents.

Used during sync when parents may arrive out of order.

fn heads(&self) -> Vec<Hash>

Get the current heads (nodes without children).

fn contains(&self, cid: &Hash) -> bool

Check if a node exists in the store.

fn ancestors(&self, cid: &Hash) -> HashSet<Hash>

Get all ancestors of a node (transitive closure).

fn children(&self, cid: &Hash) -> Vec<Hash>

Get immediate children of a node.

fn topological_order(&self) -> Vec<Hash>

Get all nodes in topological order (parents before children).

fn missing_nodes(&self) -> HashSet<Hash>

Get nodes that are missing (referenced but not present).

fn len(&self) -> usize

Get the total number of nodes.

Provided Methods

fn is_empty(&self) -> bool

Check if the store is empty.

Implementors

impl DAGStore for MemoryDAGStore