Struct MemoryDAGStore 

pub struct MemoryDAGStore {
    nodes: HashMap<Hash, MerkleNode>,
    heads: HashSet<Hash>,
    children_index: HashMap<Hash, HashSet<Hash>>,
    missing: HashSet<Hash>,
    cached_topo_order: RwLock<Option<Vec<Hash>>>,
}

In-memory implementation of DAGStore.

Fields

nodes: HashMap<Hash, MerkleNode>

All nodes indexed by CID.

heads: HashSet<Hash>

Current heads (nodes without children).

children_index: HashMap<Hash, HashSet<Hash>>

Reverse index: parent -> children.

missing: HashSet<Hash>

Referenced but missing nodes.

cached_topo_order: RwLock<Option<Vec<Hash>>>

Cached topological order (invalidated on put/put_unchecked).

Implementations

impl MemoryDAGStore

pub fn new() -> Self

Create a new empty DAG store.

pub fn with_genesis(creator: impl Into<String>) -> (Self, Hash)

Create a store with a genesis node.

fn update_heads(&mut self, node: &MerkleNode)

Update the heads set after adding a node.

fn update_children_index(&mut self, node: &MerkleNode)

Update the children index after adding a node.

pub fn stats(&self) -> DAGStats

Get statistics about the DAG.

fn compute_max_depth(&self) -> usize

Compute the maximum depth of the DAG.

fn compute_branching_stats(&self) -> f64

Compute average branching factor.

Trait Implementations

impl Clone for MemoryDAGStore

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl DAGStore for MemoryDAGStore

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.

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

Store a node without checking for missing parents.

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.

fn is_empty(&self) -> bool

Check if the store is empty.

impl Debug for MemoryDAGStore

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

Formats the value using the given formatter.

impl Default for MemoryDAGStore

fn default() -> MemoryDAGStore

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for MemoryDAGStore

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for MemoryDAGStore

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

where __S: Serializer,

Serialize this value into the given Serde serializer.