pub enum Residency {
KeepAll,
ActivePathOnly,
}Expand description
Where session nodes live at runtime.
lash owns RAM; the host owns disk lifecycle. Under ActivePathOnly
the runtime trims orphans from memory on load, but disk-side
retention (tombstoning + vacuum) is the host’s decision — call
LashRuntime::orphaned_node_ids when you want the current orphan
set and feed it into store.tombstone_nodes / store.vacuum on
whatever schedule fits your deployment.
Variants§
KeepAll
Every node resident in RAM. Default. Best for interactive / branching UX where the user may rewind.
ActivePathOnly
Only nodes reachable from leaf_node_id are resident. Orphans
live on disk and are loaded on demand via
LashRuntime::get_historic_node. Best for webserver embedders
with many concurrent idle sessions, and for autonomous agents
(combined with host-scheduled tombstone_nodes + vacuum).
Trait Implementations§
impl Copy for Residency
impl Eq for Residency
impl StructuralPartialEq for Residency
Auto Trait Implementations§
impl Freeze for Residency
impl RefUnwindSafe for Residency
impl Send for Residency
impl Sync for Residency
impl Unpin for Residency
impl UnsafeUnpin for Residency
impl UnwindSafe for Residency
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.