SimplexComputation<T> class abstract base

A high-performance custom node computation optimized for a single inbound dependency (1:1).

Unlike ComplexComputation which manages an N:1 list of inbound dependencies, SimplexComputation binds directly to a single upstream CoralNode returned by manifest.

Design Philosophy: Single-input transformation nodes (such as map, where, or distinct) constitute the majority of reactive graph nodes. SimplexComputation eliminates array allocations and loop overhead by storing a direct field reference to its single inbound node.

Extreme Performance Optimization:

• Zero Extra Heap Allocation: Avoids allocating List.unmodifiable containers.
• Direct Field Reference: Accesses _inbound directly without array index lookups.
• Hot-Path Inlining: Enables Dart VM method inlining on graph activation loops.

AI & Developer Note: Use SimplexComputation whenever a computation has exactly one upstream source. If your node requires multiple dependencies or dynamic manifest lists, use ComplexComputation.

Example:

class DoubleComputation extends SimplexComputation<int> {
  DoubleComputation(this.source);
  final Coral<int> source;

  @override
  @manifestSync
  CoralNode manifest() => source;

  @override
  int compute() => source.data * 2;
}