pub struct ReactiveGraph {
pub cells: HashMap<String, Cell>,
pub dependencies: HashMap<String, HashSet<String>>,
pub dirty: HashSet<String>,
}Fields§
§cells: HashMap<String, Cell>§dependencies: HashMap<String, HashSet<String>>§dirty: HashSet<String>Implementations§
Source§impl ReactiveGraph
impl ReactiveGraph
pub fn new() -> Self
pub fn add(&mut self, name: &str, kind: &str)
pub fn depends_on(&mut self, name: &str, dep: &str)
pub fn mark_dirty(&mut self, name: &str)
pub fn tick_dirty(&mut self) -> usize
pub fn cell_count(&self) -> usize
pub fn dirty_count(&self) -> usize
Trait Implementations§
Source§impl Clone for ReactiveGraph
impl Clone for ReactiveGraph
Source§impl Debug for ReactiveGraph
impl Debug for ReactiveGraph
Auto Trait Implementations§
impl Freeze for ReactiveGraph
impl RefUnwindSafe for ReactiveGraph
impl Send for ReactiveGraph
impl Sync for ReactiveGraph
impl Unpin for ReactiveGraph
impl UnsafeUnpin for ReactiveGraph
impl UnwindSafe for ReactiveGraph
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