Struct CompiledQueryGraph 

pub struct CompiledQueryGraph { /* private fields */ }

A graph of compiled segments connected by Ring 1 operators.

Each segment is a compiled pipeline; between segments sit BreakerExecutors that handle stateful operations. The graph executes in topological order: segment 0 → executor 0 → segment 1 → executor 1 → …

For the MVP, this is a linear chain (no fan-out or fan-in).

Implementations

impl CompiledQueryGraph

pub fn new( executors: Vec<BreakerExecutor>, input_schema: SchemaRef, output_schema: SchemaRef, ) -> Self

Creates a new graph with the given executors.

pub fn empty(schema: SchemaRef) -> Self

Creates an empty graph (no breakers — passthrough).

pub fn executor_count(&self) -> usize

Returns the number of breaker executors in the graph.

pub fn executors(&self) -> &[BreakerExecutor]

Returns a reference to the executors.

pub fn executors_mut(&mut self) -> &mut [BreakerExecutor]

Returns a mutable reference to the executors.

pub fn input_schema(&self) -> &SchemaRef

Returns the input schema.

pub fn output_schema(&self) -> &SchemaRef

Returns the output schema.

pub fn process_batch(&mut self, batch: RecordBatch) -> Vec<RecordBatch>

Processes a batch through all executors in sequence.

The batch enters the first executor; its output feeds the next, and so on. Returns the final output batches after all executors have processed.

pub fn advance_watermark(&mut self, timestamp: i64) -> Vec<RecordBatch>

Advances watermark through all executors.

pub fn checkpoint(&self) -> Vec<Vec<u8>>

Checkpoints all executor states.

pub fn restore(&mut self, states: &[Vec<u8>])

Restores all executor states from checkpoint data.

Panics

Panics if states.len() != self.executor_count().

Trait Implementations

impl Debug for CompiledQueryGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.