Struct DepGraph 

pub struct DepGraph {
    pub deps: HashMap<CellAddress, HashSet<CellAddress>>,
    pub rdeps: HashMap<CellAddress, HashSet<CellAddress>>,
}

Bidirectional dependency graph between cells

Fields

deps: HashMap<CellAddress, HashSet<CellAddress>>

cell → set of cells it directly depends on (reads from)

rdeps: HashMap<CellAddress, HashSet<CellAddress>>

cell → set of cells that depend on it (readers)

Implementations

impl DepGraph

pub fn new() -> Self

pub fn set_deps( &mut self, cell: CellAddress, dependencies: HashSet<CellAddress>, )

Register that cell depends on all cells in dependencies

pub fn remove_cell(&mut self, cell: &CellAddress)

Remove all dependency information for a cell (when cell content changes to non-formula)

pub fn dirty_set(&self, changed: &CellAddress) -> Vec<CellAddress>

Compute the minimal ordered set of cells that need recalculation when changed is modified. Returns cells in topological order.

pub fn would_create_cycle( &self, cell: &CellAddress, new_dep: &CellAddress, ) -> bool

Check if adding new_dep for cell would create a circular reference

pub fn dep_count(&self) -> usize

pub fn rdep_count(&self) -> usize

Trait Implementations

impl Clone for DepGraph

fn clone(&self) -> DepGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DepGraph

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

Formats the value using the given formatter.

impl Default for DepGraph

fn default() -> DepGraph

Returns the “default value” for a type.