Skip to main content

SplitEventStore

Struct SplitEventStore 

Source
pub struct SplitEventStore { /* private fields */ }
Expand description

The store the runtime hands out when the events split is configured: routes by APPEND CLASS rather than moving the whole event plane.

  • The ADR-133 idempotent audit-batch lane — the measured bulk of event write volume (verb-dispatch audit plus the config-lock rows that ride the same flusher) — goes to the events lane (the events database, forwarded or direct).
  • Plain appends stay on the legacy store, because the legacy events table has raw-SQL consumers whose correctness depends on finding those rows there: the schedule drain’s creator-provenance fence, the kg projection worker’s guarded event INSERT (transactional with main-db state), and GraphQuery’s cross-substrate UNION. Those events are low-volume domain facts; the split’s contention relief does not need them moved, and moving them breaks the consumers by construction.
  • Reads merge both stores so trait-level consumers (brain.event_counts, event getters) observe one event plane.

Implementations§

Source§

impl SplitEventStore

Source

pub const MAX_MERGED_WINDOW_ROWS: u64 = 100_000

Bound on offset + limit for a merged query_events window. Offset pagination over two stores materializes the whole prefix in memory (see query_events), so an unbounded offset would let a single request buffer both stores wholesale. The bound comfortably admits the largest legitimate bounded window in the tree (brain.event_counts’ 50k page); deep walks page with a before cursor at offset: 0, which never grows the materialized prefix.

Source

pub fn new(legacy: Arc<dyn EventStore>, lane: Arc<dyn EventStore>) -> Self

Trait Implementations§

Source§

impl Debug for SplitEventStore

Source§

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

Formats the value using the given formatter. Read more
Source§

impl EventStore for SplitEventStore

Source§

fn append_event<'life0, 'async_trait>( &'life0 self, event: Event, ) -> Pin<Box<dyn Future<Output = StorageResult<()>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Append a single event to the log.
Source§

fn append_events<'life0, 'async_trait>( &'life0 self, events: Vec<Event>, ) -> Pin<Box<dyn Future<Output = StorageResult<BatchWriteSummary>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Append a batch of events to the log.
Source§

fn get_event<'life0, 'async_trait>( &'life0 self, id: Uuid, ) -> Pin<Box<dyn Future<Output = StorageResult<Option<Event>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Fetch an event by UUID, returning None if absent.
Source§

fn query_events<'life0, 'async_trait>( &'life0 self, filter: EventFilter, page: PageRequest, ) -> Pin<Box<dyn Future<Output = StorageResult<Page<Event>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Query events matching a filter with pagination.
Source§

fn count_events<'life0, 'async_trait>( &'life0 self, filter: EventFilter, ) -> Pin<Box<dyn Future<Output = StorageResult<u64>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Count events matching a filter.
Source§

fn preflight_event(&self, event: &Event) -> StorageResult<()>

Validate event against the exact insert/observation shape the backend would build at append time, performing no I/O. Rejects a malformed row before it is ever enqueued for a write, so one bad producer input cannot poison a batch shared with other callers. Read more
Source§

fn append_events_idempotent<'life0, 'async_trait>( &'life0 self, events: Vec<Event>, ) -> Pin<Box<dyn Future<Output = StorageResult<IdempotentEventBatchResult>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Append a batch of events with idempotent retry semantics: a row carrying an id that already exists is compared against every persisted column and its ordered observation projection rather than treated as a write conflict. Exact equality reports EventAppendDisposition::AlreadyPresentIdentical instead of re-inserting; any mismatch reports EventAppendDisposition::IdentityConflict for that row alone, while unrelated rows in the same batch still commit. Read more
Source§

fn supports_idempotent_audit_batch(&self) -> bool

Whether this backend implements preflight_event and append_events_idempotent for real, rather than inheriting their Unsupported-returning defaults above. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self> ⓘ

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self> ⓘ

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> PolicyExt for T
where T: ?Sized,

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Sized + Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘ
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more