Struct mz_persist_client::internal::state::StateCollections

pub struct StateCollections<T> {
    pub(crate) last_gc_req: SeqNo,
    pub(crate) rollups: BTreeMap<SeqNo, HollowRollup>,
    pub(crate) leased_readers: BTreeMap<LeasedReaderId, LeasedReaderState<T>>,
    pub(crate) critical_readers: BTreeMap<CriticalReaderId, CriticalReaderState<T>>,
    pub(crate) writers: BTreeMap<WriterId, WriterState<T>>,
    pub(crate) schemas: BTreeMap<SchemaId, EncodedSchemas>,
    pub(crate) trace: Trace<T>,
}

Fields

last_gc_req: SeqNo

rollups: BTreeMap<SeqNo, HollowRollup>

leased_readers: BTreeMap<LeasedReaderId, LeasedReaderState<T>>

critical_readers: BTreeMap<CriticalReaderId, CriticalReaderState<T>>

writers: BTreeMap<WriterId, WriterState<T>>

schemas: BTreeMap<SchemaId, EncodedSchemas>

trace: Trace<T>

Implementations

impl<T> StateCollections<T>

where T: Timestamp + Lattice + Codec64,

pub fn add_rollup( &mut self, add_rollup: (SeqNo, &HollowRollup), ) -> ControlFlow<NoOpStateTransition<bool>, bool>

pub fn remove_rollups( &mut self, remove_rollups: &[(SeqNo, PartialRollupKey)], ) -> ControlFlow<NoOpStateTransition<Vec<SeqNo>>, Vec<SeqNo>>

pub fn register_leased_reader( &mut self, hostname: &str, reader_id: &LeasedReaderId, purpose: &str, seqno: SeqNo, lease_duration: Duration, heartbeat_timestamp_ms: u64, use_critical_since: bool, ) -> ControlFlow<NoOpStateTransition<(LeasedReaderState<T>, SeqNo)>, (LeasedReaderState<T>, SeqNo)>

pub fn register_critical_reader<O: Opaque + Codec64>( &mut self, hostname: &str, reader_id: &CriticalReaderId, purpose: &str, ) -> ControlFlow<NoOpStateTransition<CriticalReaderState<T>>, CriticalReaderState<T>>

pub fn register_schema<K: Codec, V: Codec>( &mut self, key_schema: &K::Schema, val_schema: &V::Schema, metrics: &SchemaMetrics, ) -> ControlFlow<NoOpStateTransition<Option<SchemaId>>, Option<SchemaId>>

pub fn compare_and_evolve_schema<K: Codec, V: Codec>( &mut self, expected: SchemaId, key_schema: &K::Schema, val_schema: &V::Schema, ) -> ControlFlow<NoOpStateTransition<CaESchema<K, V>>, CaESchema<K, V>>

pub fn compare_and_append( &mut self, batch: &HollowBatch<T>, writer_id: &WriterId, heartbeat_timestamp_ms: u64, lease_duration_ms: u64, idempotency_token: &IdempotencyToken, debug_info: &HandleDebugState, inline_writes_total_max_bytes: usize, record_compactions: bool, claim_compaction_percent: usize, claim_compaction_min_version: Option<&Version>, ) -> ControlFlow<CompareAndAppendBreak<T>, Vec<FueledMergeReq<T>>>

pub fn apply_merge_res( &mut self, res: &FueledMergeRes<T>, ) -> ControlFlow<NoOpStateTransition<ApplyMergeResult>, ApplyMergeResult>

pub fn spine_exert( &mut self, fuel: usize, ) -> ControlFlow<NoOpStateTransition<Vec<FueledMergeReq<T>>>, Vec<FueledMergeReq<T>>>

pub fn downgrade_since( &mut self, reader_id: &LeasedReaderId, seqno: SeqNo, outstanding_seqno: Option<SeqNo>, new_since: &Antichain<T>, heartbeat_timestamp_ms: u64, ) -> ControlFlow<NoOpStateTransition<Since<T>>, Since<T>>

pub fn compare_and_downgrade_since<O: Opaque + Codec64>( &mut self, reader_id: &CriticalReaderId, expected_opaque: &O, (new_opaque, new_since): (&O, &Antichain<T>), ) -> ControlFlow<NoOpStateTransition<Result<Since<T>, (O, Since<T>)>>, Result<Since<T>, (O, Since<T>)>>

pub fn heartbeat_leased_reader( &mut self, reader_id: &LeasedReaderId, heartbeat_timestamp_ms: u64, ) -> ControlFlow<NoOpStateTransition<bool>, bool>

pub fn expire_leased_reader( &mut self, reader_id: &LeasedReaderId, ) -> ControlFlow<NoOpStateTransition<bool>, bool>

pub fn expire_critical_reader( &mut self, reader_id: &CriticalReaderId, ) -> ControlFlow<NoOpStateTransition<bool>, bool>

pub fn expire_writer( &mut self, writer_id: &WriterId, ) -> ControlFlow<NoOpStateTransition<bool>, bool>

fn leased_reader(&mut self, id: &LeasedReaderId) -> &mut LeasedReaderState<T>

fn critical_reader( &mut self, id: &CriticalReaderId, ) -> &mut CriticalReaderState<T>

fn critical_since(&self) -> Option<Antichain<T>>

fn update_since(&mut self)

fn seqno_since(&self, seqno: SeqNo) -> SeqNo

fn tombstone_batch() -> HollowBatch<T>

pub(crate) fn is_tombstone(&self) -> bool

pub(crate) fn is_single_empty_batch(&self) -> bool

pub fn become_tombstone_and_shrink( &mut self, ) -> ControlFlow<NoOpStateTransition<()>, ()>

Trait Implementations

impl<T: Clone> Clone for StateCollections<T>

fn clone(&self) -> StateCollections<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for StateCollections<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq for StateCollections<T>

fn eq(&self, other: &StateCollections<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> StructuralPartialEq for StateCollections<T>