reifydb-flow 0.9.0

Flow execution substrate: the flow transaction/state layer and the operator contract
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
// SPDX-License-Identifier: Apache-2.0
// Copyright (c) 2026 ReifyDB

use std::collections::BTreeMap;

use reifydb_core::interface::catalog::{
	flow::{FlowId, OperatorId},
	object::ObjectId,
};
use reifydb_rql::flow::flow::FlowDag;
use reifydb_value::{Result, value::datetime::DateTime};

use crate::{
	engine::FlowEngineInner,
	operator::{BoxedHostOperator, state::seal::policy::seal_horizon},
	transaction::FlowTransaction,
};

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct WatermarkHold {
	pub object: ObjectId,
	pub frontier: DateTime,
}

pub type WatermarkHolds = Vec<WatermarkHold>;

impl FlowEngineInner {
	pub fn holds<T: FlowTransaction>(&self, txn: &mut T, flow_id: FlowId) -> Result<WatermarkHolds> {
		let Some(flow) = self.flows.get(&flow_id) else {
			return Ok(Vec::new());
		};

		let sinks: Vec<(ObjectId, OperatorId)> = self
			.sinks
			.iter()
			.flat_map(|(object, registrations)| {
				registrations.iter().filter_map(move |(registered, operator)| {
					(*registered == flow_id).then_some((*object, *operator))
				})
			})
			.collect();

		if sinks.is_empty() {
			return Ok(Vec::new());
		}

		let topo = flow.topological_order()?;
		let frontiers = output_frontiers(txn, flow, &self.operators, &topo)?;

		let mut held: WatermarkHolds = Vec::with_capacity(sinks.len());
		for (object, operator_id) in sinks {
			let Some(frontier) = frontiers.get(&operator_id) else {
				continue;
			};
			if frontier.to_millis() == 0 {
				continue;
			}
			held.push(WatermarkHold {
				object,
				frontier: *frontier,
			});
		}
		Ok(held)
	}
}

fn output_frontiers<T: FlowTransaction>(
	txn: &mut T,
	flow: &FlowDag,
	operators: &BTreeMap<OperatorId, BoxedHostOperator>,
	topo: &[OperatorId],
) -> Result<BTreeMap<OperatorId, DateTime>> {
	let watermarks = txn.source_watermarks();
	let mut computed: BTreeMap<OperatorId, DateTime> = BTreeMap::new();

	for operator_id in topo {
		let Some(node) = flow.get_operator(operator_id) else {
			continue;
		};

		let input = if node.ty.declares_time() {
			Some(watermarks.source_watermark(*operator_id, txn)?)
		} else {
			let mut merged: Option<DateTime> = None;
			for source in &node.inputs {
				let Some(frontier) = computed.get(source).copied() else {
					continue;
				};
				merged = Some(merged.map_or(frontier, |current: DateTime| current.min(frontier)));
			}
			merged
		};

		let Some(input) = input else {
			continue;
		};

		let frontier = operators
			.get(operator_id)
			.and_then(|operator| operator.lateness_span())
			.map_or(input, |span| seal_horizon(input, span));

		computed.insert(*operator_id, frontier);
	}

	Ok(computed)
}

#[cfg(test)]
mod tests {
	use std::sync::Arc;

	use reifydb_catalog::catalog::Catalog;
	use reifydb_core::{
		common::TimeDomain,
		interface::{
			WithEventBus,
			catalog::id::{SeriesId, TableId, ViewId},
			change::Change,
			flow::OperatorCapability,
		},
	};
	use reifydb_rql::flow::{
		flow::FlowBuilder,
		operator::{FlowEdge, FlowNode, OperatorDef},
	};
	use reifydb_runtime::context::{
		RuntimeContext,
		clock::{Clock, MockClock},
	};
	use reifydb_test_harness::engine::TestEngine;
	use reifydb_transaction::interceptor::interceptors::Interceptors;
	use reifydb_value::{
		factory::time::at_millis,
		value::{duration::Duration, identity::IdentityId},
	};

	use super::*;
	use crate::{
		operator::{
			HostOperator, host::HostContext, metrics::OperatorSampleRegistry,
			provider::EmptyOperatorProvider,
		},
		transaction::{DeferredParams, deferred::DeferredTransaction, substrate::FlowSubstrate},
	};

	const FLOW: FlowId = FlowId(1);

	#[derive(Debug, Clone, Copy)]
	struct WatermarkAdvance {
		source: OperatorId,
		at: DateTime,
	}

	type WatermarkAdvances = Vec<WatermarkAdvance>;

	fn advance(source: u64, at: u64) -> WatermarkAdvance {
		WatermarkAdvance {
			source: OperatorId(source),
			at: at_millis(at),
		}
	}

	fn hold(view: u64, frontier: u64) -> WatermarkHold {
		WatermarkHold {
			object: ObjectId::View(ViewId(view)),
			frontier: at_millis(frontier),
		}
	}

	struct Sealing {
		operator: OperatorId,
		horizon: Option<Duration>,
	}

	impl HostOperator for Sealing {
		fn id(&self) -> OperatorId {
			self.operator
		}

		fn capabilities(&self) -> &[OperatorCapability] {
			OperatorCapability::STANDARD
		}

		fn apply(&mut self, _host: &mut dyn HostContext, change: Change) -> Result<Change> {
			Ok(change)
		}

		fn lateness_span(&self) -> Option<Duration> {
			self.horizon
		}
	}

	fn seconds(seconds: i64) -> Duration {
		Duration::from_milliseconds_const(seconds * 1_000)
	}

	fn engine_inner(engine: &TestEngine) -> FlowEngineInner {
		FlowEngineInner::new(
			engine.catalog(),
			engine.executor().routines.clone(),
			engine.event_bus().clone(),
			RuntimeContext::with_clock(engine.clock().clone()),
			Arc::new(EmptyOperatorProvider),
			FlowSubstrate {
				operators: Some(engine.inner().operator_state()),
				..FlowSubstrate::default()
			},
			OperatorSampleRegistry::new(),
		)
	}

	fn deferred(engine: &TestEngine) -> DeferredTransaction {
		let parent = engine.begin_admin(IdentityId::system()).unwrap();
		let version = parent.version();
		DeferredTransaction::new(DeferredParams::from_parent(
			&parent,
			engine.inner().operator_state(),
			version,
			Catalog::testing(),
			Interceptors::new(),
			Clock::Mock(MockClock::from_millis(0)),
		))
	}

	fn source(id: u64) -> FlowNode {
		FlowNode::new(
			OperatorId(id),
			OperatorDef::SourceSeries {
				series: SeriesId(id),
				time_domain: TimeDomain::Event,
			},
		)
	}

	fn untimed_source(id: u64) -> FlowNode {
		FlowNode::new(
			OperatorId(id),
			OperatorDef::SourceTable {
				table: TableId(id),
				time_domain: TimeDomain::None,
			},
		)
	}

	fn stage(id: u64) -> FlowNode {
		FlowNode::new(
			OperatorId(id),
			OperatorDef::Map {
				expressions: Vec::new(),
			},
		)
	}

	fn sink(id: u64) -> FlowNode {
		FlowNode::new(
			OperatorId(id),
			OperatorDef::SinkTableView {
				view: ViewId(id),
				table: TableId(id),
			},
		)
	}

	struct Harness {
		engine: TestEngine,
		inner: FlowEngineInner,
		builder: FlowBuilder,
		edges: u64,
	}

	impl Harness {
		fn new() -> Self {
			let engine = TestEngine::new();
			let inner = engine_inner(&engine);
			Self {
				engine,
				inner,
				builder: FlowDag::builder(FLOW),
				edges: 0,
			}
		}

		fn node(mut self, node: FlowNode) -> Self {
			self.builder.add_node(node);
			self
		}

		fn sealing(mut self, id: u64, horizon: Duration) -> Self {
			self.inner.operators.insert(
				OperatorId(id),
				Box::new(Sealing {
					operator: OperatorId(id),
					horizon: Some(horizon),
				}),
			);
			self
		}

		fn edge(mut self, from: u64, to: u64) -> Self {
			self.edges += 1;
			self.builder.add_edge(FlowEdge::new(self.edges, OperatorId(from), OperatorId(to))).unwrap();
			self
		}

		fn registered_sink(mut self, id: u64, flow: FlowId) -> Self {
			self.inner.sinks.insert(ObjectId::View(ViewId(id)), vec![(flow, OperatorId(id))]);
			self
		}

		fn holds(self, advances: WatermarkAdvances) -> WatermarkHolds {
			let Harness {
				engine,
				mut inner,
				builder,
				..
			} = self;
			inner.register_flow_dag(builder.build());
			let mut txn = deferred(&engine);
			let watermarks = txn.source_watermarks();
			for advance in advances {
				watermarks.advance(advance.source, &mut txn, advance.at).unwrap();
			}
			let mut held = inner.holds(&mut txn, FLOW).unwrap();
			held.sort_by_key(|hold| hold.object);
			held
		}
	}

	#[test]
	fn an_operator_that_seals_nothing_hands_the_source_watermark_through_untouched() {
		// A pass-through hop that shaved anything off would make every sink lag its source for free.
		let held = Harness::new()
			.node(source(1))
			.node(stage(2))
			.node(sink(3))
			.edge(1, 2)
			.edge(2, 3)
			.registered_sink(3, FLOW)
			.holds(vec![advance(1, 30_000)]);

		assert_eq!(held, vec![hold(3, 30_000)]);
	}

	#[test]
	fn a_sealing_operator_holds_its_output_back_by_exactly_its_seal_horizon() {
		// Publishing the input watermark past an unsealed window lets a consumer read a bucket the operator may
		// still amend.
		let held = Harness::new()
			.node(source(1))
			.node(stage(2))
			.node(sink(3))
			.edge(1, 2)
			.edge(2, 3)
			.sealing(2, seconds(5))
			.registered_sink(3, FLOW)
			.holds(vec![advance(1, 30_000)]);

		assert_eq!(held, vec![hold(3, 25_000)]);
	}

	#[test]
	fn chained_seal_horizons_accumulate_along_the_path() {
		// Each hop seals against its own input, so the lag must be the sum; a max or a re-read of the source
		// understates it.
		let held = Harness::new()
			.node(source(1))
			.node(stage(2))
			.node(stage(3))
			.node(sink(4))
			.edge(1, 2)
			.edge(2, 3)
			.edge(3, 4)
			.sealing(2, seconds(5))
			.sealing(3, seconds(4))
			.registered_sink(4, FLOW)
			.holds(vec![advance(1, 30_000)]);

		assert_eq!(held, vec![hold(4, 21_000)]);
	}

	#[test]
	fn a_multi_input_operator_is_held_by_its_slowest_input() {
		// An input still behind can emit into a bucket the merged output already claimed sealed.
		let held = Harness::new()
			.node(source(1))
			.node(source(2))
			.node(stage(3))
			.node(sink(4))
			.edge(1, 3)
			.edge(2, 3)
			.edge(3, 4)
			.registered_sink(4, FLOW)
			.holds(vec![advance(1, 30_000), advance(2, 10_000)]);

		assert_eq!(held, vec![hold(4, 10_000)]);
	}

	#[test]
	fn an_untimed_source_is_excluded_from_the_merge_rather_than_pinning_it_at_the_epoch() {
		// A source declaring no time carries no event instant, so counting it as the epoch pins every
		// downstream window open forever.
		let held = Harness::new()
			.node(source(1))
			.node(untimed_source(2))
			.node(stage(3))
			.node(sink(4))
			.edge(1, 3)
			.edge(2, 3)
			.edge(3, 4)
			.registered_sink(4, FLOW)
			.holds(vec![advance(1, 30_000)]);

		assert_eq!(held, vec![hold(4, 30_000)]);
	}

	#[test]
	fn a_flow_whose_every_source_is_untimed_claims_nothing() {
		// With no timed input there is nothing to justify a frontier, so claiming one would seal windows on
		// rows never seen.
		let held = Harness::new()
			.node(untimed_source(1))
			.node(stage(3))
			.node(sink(4))
			.edge(1, 3)
			.edge(3, 4)
			.registered_sink(4, FLOW)
			.holds(vec![]);

		assert!(held.is_empty());
	}

	#[test]
	fn two_branches_of_one_flow_keep_their_own_frontiers() {
		// The branches share no operator, so a flow-wide min would drag the fast sink down for nothing.
		let held = Harness::new()
			.node(source(1))
			.node(sink(2))
			.node(source(3))
			.node(sink(4))
			.edge(1, 2)
			.edge(3, 4)
			.registered_sink(2, FLOW)
			.registered_sink(4, FLOW)
			.holds(vec![advance(1, 30_000), advance(3, 10_000)]);

		assert_eq!(held, vec![hold(2, 30_000), hold(4, 10_000)]);
	}

	#[test]
	fn a_flow_whose_source_never_advanced_claims_nothing() {
		// An unpublished frontier already reads as the epoch, so claiming it must never pass for a real one.
		let held = Harness::new()
			.node(source(1))
			.node(sink(2))
			.edge(1, 2)
			.registered_sink(2, FLOW)
			.holds(Vec::new());

		assert!(held.is_empty());
	}

	#[test]
	fn a_seal_horizon_deeper_than_the_watermark_floors_at_the_epoch_and_claims_nothing() {
		// Subtracting past the epoch must saturate; wrapping would mark every unwritten bucket sealed.
		let held = Harness::new()
			.node(source(1))
			.node(stage(2))
			.node(sink(3))
			.edge(1, 2)
			.edge(2, 3)
			.sealing(2, seconds(5))
			.registered_sink(3, FLOW)
			.holds(vec![advance(1, 3_000)]);

		assert!(held.is_empty());
	}

	#[test]
	fn a_sink_belonging_to_another_flow_is_never_claimed() {
		// The sink registry is shared across flows; claiming a neighbour's sink stamps a frontier no operator
		// here computed.
		let held = Harness::new()
			.node(source(1))
			.node(sink(2))
			.edge(1, 2)
			.registered_sink(2, FlowId(2))
			.holds(vec![advance(1, 30_000)]);

		assert!(held.is_empty());
	}
}