use std::{
collections::{BTreeMap, BTreeSet},
fmt::Debug,
hash::Hash,
};
use reifydb_codec::{
key::encoded::{EncodedKey, IntoEncodedKey},
row::operator::state::StateCodec,
};
use reifydb_core::{
interface::{catalog::flow::OperatorId, flow::OperatorCapability},
metrics::heap::{HeapSize, OperatorSample},
state::timer::StateStore,
};
use reifydb_flow::{
operator::state::seal::{coord::Coord, domain::SealDomain, rule::is_sealed},
window::{
accumulator::WindowAccumulator,
engine::{
AccumulatorEvent, EmitKind,
rolling::{RollingBuckets, RollingEngine},
},
span::{Slot, SlotCoord, SlotSpan, WindowAnchor},
},
};
use reifydb_value::{
config::Config,
value::{diff_type::DiffType, duration::Duration, row_number::RowNumber},
};
use tracing::debug;
use crate::{
error::Result,
flow::operator::{
GuestOperator, OperatorMetadata,
column::{
batch::{InsertBatch, RemoveBatch, UpdateBatch},
operator::OperatorColumn,
row::Row,
},
context::GuestContext,
timer::Timer,
view::{ChangeView, ColumnsView, DiffView, RowView},
windowed::{
bucket_of, group_of, guest_as_host::GuestAsHost, intern_window_groups, observe_batch,
seal_frontier, timer_frontier, window_engine_config,
},
},
};
type AccumulatorContribution<A> = <<A as RollingOperator>::Accumulator as WindowAccumulator>::Contribution;
pub(crate) type Anchor<A> = SlotCoord<<A as RollingOperator>::WindowSlot>;
pub trait RollingOperator {
type GroupKey: Clone + Eq + Ord + Hash + Debug + StateCodec;
type WindowSlot: Slot<Coord: WindowAnchor + SealDomain + Hash + StateCodec + HeapSize + Send + Sync>
+ Hash
+ StateCodec
+ HeapSize;
type Accumulator: WindowAccumulator;
type Output: Clone + Debug + PartialEq;
fn capacity(&self) -> usize;
fn bucket_size(&self) -> SlotSpan<Self::WindowSlot>;
fn lateness(&self) -> Option<<SlotCoord<Self::WindowSlot> as SealDomain>::Lateness> {
None
}
fn coord(&self, row: &impl RowView) -> Option<Self::WindowSlot>;
fn extract(
&self,
ctx: &mut impl GuestContext,
row: &impl RowView,
) -> Option<(Self::GroupKey, AccumulatorContribution<Self>)>;
fn combine(
&self,
group: &Self::GroupKey,
buffer: &BTreeMap<SlotCoord<Self::WindowSlot>, Self::Accumulator>,
) -> Option<Self::Output>;
}
pub trait RollingRegistration: RollingOperator + Sized
where
Self::Output: Row,
for<'a> &'a Self::GroupKey: IntoEncodedKey,
{
const NAME: &'static str;
const VERSION: &'static str;
const DESCRIPTION: &'static str;
const INPUT_COLUMNS: &'static [OperatorColumn];
const OUTPUT_COLUMNS: &'static [OperatorColumn];
const CAPABILITIES: &'static [OperatorCapability];
fn from_config(operator_id: OperatorId, config: &Config) -> Result<Self>;
fn encode_row_key(&self, group: &Self::GroupKey) -> EncodedKey;
}
pub type RollingBuffer<A> = BTreeMap<Anchor<A>, <A as RollingOperator>::Accumulator>;
type Buckets<A> = RollingBuckets<<A as RollingOperator>::GroupKey, Anchor<A>, AccumulatorContribution<A>>;
pub struct RollingDriver<A>
where
A: RollingRegistration,
A::Output: Row,
for<'a> &'a A::GroupKey: IntoEncodedKey,
{
aggregator: A,
engine: RollingEngine<A::GroupKey, Anchor<A>, A::Accumulator>,
}
impl<A> RollingDriver<A>
where
A: RollingRegistration,
A::Output: Row,
for<'a> &'a A::GroupKey: IntoEncodedKey,
{
fn route(&self, ctx: &mut impl GuestContext, change: &impl ChangeView) -> Buckets<A> {
let mut buckets: Buckets<A> = BTreeMap::new();
for di in 0..change.diff_count() {
let Some(diff) = change.diff(di) else {
continue;
};
match diff.kind() {
DiffType::Insert => {
if let Some(cols) = diff.post() {
self.push_all(ctx, &cols, &mut buckets, true);
}
}
DiffType::Update => {
if let (Some(pre), Some(post)) = (diff.pre(), diff.post()) {
self.push_updates(ctx, &pre, &post, &mut buckets);
}
}
DiffType::Remove => {
if let Some(cols) = diff.pre() {
self.push_all(ctx, &cols, &mut buckets, false);
}
}
}
}
buckets
}
fn push_all<C: ColumnsView>(
&self,
ctx: &mut impl GuestContext,
cols: &C,
buckets: &mut Buckets<A>,
is_add: bool,
) {
for i in 0..cols.row_count() {
let Some(row) = cols.row(i) else {
continue;
};
let Some(slot) = self.aggregator.coord(&row) else {
continue;
};
let Some((group, contribution)) = self.aggregator.extract(ctx, &row) else {
continue;
};
let bucket = bucket_of(slot.order_key(), self.aggregator.bucket_size());
let event = if is_add {
AccumulatorEvent::Add(contribution)
} else {
AccumulatorEvent::Remove(contribution)
};
buckets.entry((group, bucket)).or_default().push(event);
}
}
fn push_updates<P: ColumnsView, Q: ColumnsView>(
&self,
ctx: &mut impl GuestContext,
pre: &P,
post: &Q,
buckets: &mut Buckets<A>,
) {
let n = pre.row_count().min(post.row_count());
for i in 0..n {
if let Some(pre_row) = pre.row(i)
&& let Some(slot) = self.aggregator.coord(&pre_row)
&& let Some((group, contribution)) = self.aggregator.extract(ctx, &pre_row)
{
buckets.entry((group, bucket_of(slot.order_key(), self.aggregator.bucket_size())))
.or_default()
.push(AccumulatorEvent::Remove(contribution));
}
if let Some(post_row) = post.row(i)
&& let Some(slot) = self.aggregator.coord(&post_row)
&& let Some((group, contribution)) = self.aggregator.extract(ctx, &post_row)
{
buckets.entry((group, bucket_of(slot.order_key(), self.aggregator.bucket_size())))
.or_default()
.push(AccumulatorEvent::Add(contribution));
}
}
}
#[inline]
fn emit_batches(
ctx: &mut impl GuestContext,
inserts: Vec<(RowNumber, A::Output)>,
updates: Vec<(RowNumber, A::Output)>,
removes: Vec<(RowNumber, A::Output)>,
) -> Result<()> {
if !inserts.is_empty() {
let mut batch = InsertBatch::<A::Output, _>::new(ctx, inserts.len())?;
for (rn, data) in &inserts {
batch.push(*rn, data)?;
}
batch.finish()?;
}
if !updates.is_empty() {
let mut batch = UpdateBatch::<A::Output, _>::new(ctx, updates.len())?;
for (rn, data) in &updates {
batch.push(*rn, data, data)?;
}
batch.finish()?;
}
if !removes.is_empty() {
let mut batch = RemoveBatch::<A::Output, _>::new(ctx, removes.len())?;
for (rn, data) in &removes {
batch.push(*rn, data)?;
}
batch.finish()?;
}
Ok(())
}
}
impl<A> RollingDriver<A>
where
A: RollingRegistration + Send + Sync + 'static,
A::Output: Row,
A::GroupKey: Send + Sync,
A::WindowSlot: Send + Sync,
A::Accumulator: Send + Sync + HeapSize,
AccumulatorContribution<A>: Send + Sync,
for<'a> &'a A::GroupKey: IntoEncodedKey,
{
fn expire_through<C: GuestContext>(
engine: &mut RollingEngine<A::GroupKey, Anchor<A>, A::Accumulator>,
store: &mut GuestAsHost<'_, C>,
horizon: Anchor<A>,
) -> Result<()> {
if horizon > <Anchor<A> as Coord>::from_order(0) {
engine.expire_meta(store, horizon.to_order())?;
}
Ok(())
}
}
impl<A> OperatorMetadata for RollingDriver<A>
where
A: RollingRegistration + 'static,
A::Output: Row,
for<'a> &'a A::GroupKey: IntoEncodedKey,
{
const NAME: &'static str = A::NAME;
const VERSION: &'static str = A::VERSION;
const DESCRIPTION: &'static str = A::DESCRIPTION;
const INPUT_COLUMNS: &'static [OperatorColumn] = A::INPUT_COLUMNS;
const OUTPUT_COLUMNS: &'static [OperatorColumn] = A::OUTPUT_COLUMNS;
const CAPABILITIES: &'static [OperatorCapability] = A::CAPABILITIES;
}
impl<A> GuestOperator for RollingDriver<A>
where
A: RollingRegistration + Send + Sync + 'static,
A::Output: Row,
A::GroupKey: Send + Sync,
A::WindowSlot: Send + Sync,
A::Accumulator: Send + Sync + HeapSize,
AccumulatorContribution<A>: Send + Sync,
for<'a> &'a A::GroupKey: IntoEncodedKey,
{
fn sample(&self) -> Option<OperatorSample> {
None
}
fn create(operator_id: OperatorId, config: &Config) -> Result<Self> {
let aggregator = A::from_config(operator_id, config)?;
let engine_config = window_engine_config(config);
Ok(Self {
aggregator,
engine: RollingEngine::new(engine_config),
})
}
fn on_timer(&mut self, ctx: &mut impl GuestContext, timer: Timer<'_>) -> Result<()> {
let Some(lateness) = self.aggregator.lateness() else {
return Ok(());
};
let mut store = GuestAsHost(ctx);
let Some(frontier) = timer_frontier::<Anchor<A>>(&mut store, timer)? else {
return Ok(());
};
let horizon = <Anchor<A> as SealDomain>::horizon(frontier, lateness);
Self::expire_through(&mut self.engine, &mut store, horizon)
}
fn lateness(&self) -> Option<Duration> {
self.aggregator.lateness().and_then(<Anchor<A> as SealDomain>::lateness_duration)
}
fn apply(&mut self, ctx: &mut impl GuestContext, change: impl ChangeView) -> Result<()> {
let mut buckets = self.route(ctx, &change);
if buckets.is_empty() {
return Ok(());
}
let lateness = self.aggregator.lateness();
if let Some(lateness) = lateness {
let mut store = GuestAsHost(ctx);
let newest = buckets.keys().map(|(_, coord)| *coord).max();
if let Some(newest) = newest {
observe_batch(&mut store, newest, lateness)?;
}
let watermark = seal_frontier::<Anchor<A>>(&mut store)?;
let horizon = <Anchor<A> as SealDomain>::horizon(watermark, lateness);
Self::expire_through(&mut self.engine, &mut store, horizon)?;
let mut dropped = 0u64;
buckets.retain(|(_, coord), events| {
if is_sealed(*coord, horizon) {
dropped += events.len() as u64;
false
} else {
true
}
});
if dropped > 0 {
debug!(operator = A::NAME, dropped, "mutations targeting sealed coords were dropped");
}
if buckets.is_empty() {
return Ok(());
}
}
let groups = intern_window_groups(
buckets.keys().map(|(group, _)| group.clone()).collect::<BTreeSet<_>>().into_iter().map(
|group| {
let key = self.aggregator.encode_row_key(&group);
((group, ()), key)
},
),
);
let results = {
let Self {
aggregator,
engine,
..
} = &mut *self;
let capacity = aggregator.capacity();
let mut store = GuestAsHost(ctx);
engine.apply(
&mut store,
buckets,
capacity,
|group| (group_of(&groups, group, ()), aggregator.encode_row_key(group)),
|group, buffer| aggregator.combine(group, buffer),
)?
};
let mut inserts: Vec<(RowNumber, A::Output)> = Vec::new();
let mut updates: Vec<(RowNumber, A::Output)> = Vec::new();
let mut removes: Vec<(RowNumber, A::Output)> = Vec::new();
let mut removed_groups: Vec<A::GroupKey> = Vec::new();
for r in results {
match r.kind {
EmitKind::Insert => inserts.push((r.row_number, r.value)),
EmitKind::Update => updates.push((r.row_number, r.value)),
EmitKind::Remove => {
removed_groups.push(r.group);
removes.push((r.row_number, r.value));
}
}
}
Self::emit_batches(ctx, inserts, updates, removes)?;
if !removed_groups.is_empty() {
let mut store = GuestAsHost(ctx);
for group in &removed_groups {
store.remove_row_number(
group_of(&groups, group, ()),
&self.aggregator.encode_row_key(group),
)?;
}
}
Ok(())
}
}