pub struct CachedGraph { /* private fields */ }Expand description
A built dependency graph together with the evaluation order derived from
it. Immutable once constructed: invalidation replaces the whole entry, it
never edits one in place, which is what makes sharing it across a
Workbook clone sound.
pub, not pub(crate): Workbook::cached_graph_entry
hands this out to any crate that only holds &Workbook and wants to reuse
a warm graph without rebuilding one (the wasm precedentsOf/dependentsOf
binding). Its fields stay pub(crate) — external callers reach the graph
through graph, not by construction or field access.
Implementations§
Source§impl CachedGraph
impl CachedGraph
Sourcepub fn graph(&self) -> &DependencyGraph
pub fn graph(&self) -> &DependencyGraph
The dependency graph this entry caches.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for CachedGraph
impl RefUnwindSafe for CachedGraph
impl Send for CachedGraph
impl Sync for CachedGraph
impl Unpin for CachedGraph
impl UnsafeUnpin for CachedGraph
impl UnwindSafe for CachedGraph
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more