The cell ID
The state on which this one depends
The values contained by this state (i.e.
The values contained by this state (i.e. defined by the cell whose execution state this represents)
Evaluate the given partial function in all states where it's defined, travelling in reverse chronological order and collecting results into a List.
Perform the side effect for each state, moving back through states in reverse chronological order
Insert the given state after the given state, such that the state with the given ID becomes the given state's predecessor.
Insert the given state after the given state, such that the state with the given ID becomes the given state's predecessor. If no state exists with the given ID, it will be inserted after Root.
Replace the state with the same ID as the given state with the given state.
Replace the state with the same ID as the given state with the given state. If a state with the given state's predecessor is found before a state with the same ID as the given state, the given state will be inserted between the predecessor and its successor.
Move a previous state to be after another given previous state.
Move a previous state to be after another given previous state. The state with the given id
will get after
as
its parent.
Find the first state in the chain where the predicate holds
Find the furthest state in the chain where the predicate still holds
a list of states in reverse chronological order, until the predicate is satisfied, *including* the state which satisfied the predicate (if any)
a list of states in reverse chronological order, until (but not including) the predicate fails to hold
a list of states in reverse chronological order
A state of cell execution.