Reads the current data of the supplied capsule, initializing it if needed. Internally forms a dependency graph amongst capsules, so feel free to condi

Performs a *consistent* read on all supplied capsules. Consistency is important here: if you need the current data from a few different capsules, do

Registers the given side effect.

Gets the requested node or panics if it is not in the graph

The basic building block for all side effects.

Runs the supplied callback with a `ContainerReadTxn` that allows you to read the current data in the container. You almost never want to use this fun

Forcefully builds the capsule with the supplied id. Panics if node is not in the graph

Builds only the requested node. Panics if the node is not in the graph

Forcefully disposes only the requested node, cleaning up the node's direct dependencies. Panics if the node is not in the graph.

Runs the supplied callback with a `ContainerWriteTxn` that allows you to read and populate the current data in the container. You almost never want t

Triggers a first build or rebuild for the supplied capsule

Creates the start node's dependent subgraph build order, including start, *as a stack*. Thus, proper iteration order is done by popping off of the sta

Helper function that given a `build_order`, garbage collects all idempotent nodes that have no dependents (i.e., they are entirely disposable) and ret

Creates a new `SideEffectRegistrar`. This is public only to enable easier mocking in your code, or for other libraries looking to integrate deeply wi

A thin wrapper around the state side effect that enables easy state persistence. You provide a `read` function and a `write` function, and you receiv

Tries a capsule read, but doesn't require an instance of the capsule itself