Struct BranchesConn 

pub struct BranchesConn<T: 'static, K: 'static> { /* private fields */ }

Branches’ connection: the current data snapshot plus its derived shape.

Trait Implementations

impl<T: Clone + 'static, K: Clone + Hash + Eq + 'static> TreeConn for BranchesConn<T, K>

type Slot = ItemSlot<T, K>

type Key = K

fn refresh(&self) -> Vec<(u64, Option<u64>)>

Refresh the snapshot and return the tree’s shape: (token, parent) pairs in walk order. A tracked read: the enclosing watch re-runs exactly when something this read depends on changes.

fn tokens_now(&self) -> Vec<u64>

Every token in the current snapshot, walk order, no refresh and no tracking.

fn children_len(&self, parent: Option<u64>) -> usize

fn child_token(&self, parent: Option<u64>, index: usize) -> u64

fn parent_of(&self, token: u64) -> Option<Option<u64>>

Some(parent) for a known token (Some(None) = a root row), None for an unknown one.

fn key_of(&self, token: u64) -> Option<K>

fn token_of(&self, key: &K) -> u64

The token a key maps to (pure: no snapshot lookup).

fn slot_for(&self, token: u64) -> Option<ItemSlot<T, K>>

A fresh slot for token (None on a stale mid-animation pull). Call inside the row’s scope: plain-data slots allocate their signals here.

fn rebind(&self, slot: &ItemSlot<T, K>, token: u64)

Point an existing slot at token: the recycle write.

fn values_flow_by_reload(&self) -> bool

Whether row VALUES reach existing rows only through reload→rebind (see RowConn::values_flow_by_reload).