Enum Precedent 

pub enum Precedent {
    Cell(CellRef),
    Range(RangeRef),
    Name(String),
    Unresolved(String),
}

One resolved precedent of a formula cell: what a single Ref in the formula points at, after sheet/name resolution.

extract_refs yields one Ref per reference occurrence (duplicates preserved); the graph maps each to one of these. Unresolved keeps a reference that has no concrete target (unknown sheet/name, unparseable formula) so the recalc engine can still emit the right Sheets error.

Variants

Cell(CellRef)

A single cell (A1 on the formula’s own sheet, or Sheet1!A1).

Range(RangeRef)

A rectangular range (A1:D4, Sheet1!A1:B2) — a compressed range node.

Name(String)

A workbook-scoped named range, by its case-folded name. The name’s current target (cell or range) supplies the transitive edges.

Unresolved(String)

A reference that did not resolve to a concrete target: an unknown sheet or name, or a formula that failed to parse. Carries the canonical reference text for diagnostics; it produces no dirty-propagation edge.

Trait Implementations

impl Clone for Precedent

fn clone(&self) -> Precedent

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Precedent

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

Formats the value using the given formatter.

impl Eq for Precedent

impl Hash for Precedent

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Precedent

fn eq(&self, other: &Precedent) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Precedent