Stack<T> class

Stack data structure for managing recursive operations.

Stack is used internally by the reactive system to manage recursive traversal of the dependency graph during updates.

Example:

final link = Link(version: 0, dep: ReactiveNode(flags: 0), sub: ReactiveNode(flags: 0));
var stack = Stack(value: link);
stack = Stack(value: link.nextSub, prev: stack);

Constructors

Stack({required T value, Stack<T>? prev})
Creates a stack node with the given value and previous node.

Properties

hashCode → int
The hash code for this object.
no setterinherited
prev ↔ Stack<T>?
The previous node in the stack.
getter/setter pair
runtimeType → Type
A representation of the runtime type of the object.
no setterinherited
value ↔ T
The value stored in this stack node.
getter/setter pair

Methods

noSuchMethod(Invocation invocation) → dynamic
Invoked when a nonexistent method or property is accessed.
inherited
toString() → String
A string representation of this object.
inherited

Operators

operator ==(Object other) → bool
The equality operator.
inherited