pub struct NotificationRegistryTransaction { /* private fields */ }Implementations§
Source§impl NotificationRegistryTransaction
impl NotificationRegistryTransaction
Sourcepub fn listener_metadata_after(
&self,
after: Option<NotificationListenerKey>,
) -> StorageBackendResult<Option<NotificationListenerMetadata>>
pub fn listener_metadata_after( &self, after: Option<NotificationListenerKey>, ) -> StorageBackendResult<Option<NotificationListenerMetadata>>
Read one fixed-width row after the exclusive key in primary-key order. The statement finishes before return, so deleting that row and resuming cannot invalidate an active scan. Channel JSON is not selected or decoded. The original transaction’s cancellation still applies.
Sourcepub fn listener(
&self,
key: NotificationListenerKey,
max_channels: Option<usize>,
) -> StorageBackendResult<Option<NotificationListenerRow>>
pub fn listener( &self, key: NotificationListenerKey, max_channels: Option<usize>, ) -> StorageBackendResult<Option<NotificationListenerRow>>
Load only the named listener. A supplied channel limit bounds encoded JSON before copying and decoded element count before constructing excess elements. None preserves explicit legacy session materialization.
Source§impl NotificationRegistryTransaction
impl NotificationRegistryTransaction
Sourcepub fn prepare_publication(
&mut self,
process_id: i32,
pending: &[PendingNotification],
listener: Option<&NotificationListenerRow>,
control: &StorageReadControl,
) -> StorageBackendResult<NotificationPublication>
pub fn prepare_publication( &mut self, process_id: i32, pending: &[PendingNotification], listener: Option<&NotificationListenerRow>, control: &StorageReadControl, ) -> StorageBackendResult<NotificationPublication>
Prepare the original evaluated batch and final subscription under registry admission. The caller stages the returned immutable record in its main transaction before committing either resource.
Sourcepub fn apply_publication(
&mut self,
publication: NotificationPublicationView<'_>,
control: &StorageReadControl,
) -> StorageBackendResult<()>
pub fn apply_publication( &mut self, publication: NotificationPublicationView<'_>, control: &StorageReadControl, ) -> StorageBackendResult<()>
Append exactly the authoritative committed intent, or recognize its already committed acknowledgement. A savepoint prevents failed decoding, cancellation or memory admission from leaving half a publication in this registry transaction.
Source§impl NotificationRegistryTransaction
impl NotificationRegistryTransaction
Sourcepub fn suspend_publication(
&mut self,
publication: &NotificationPublication,
owner: [u8; 16],
) -> StorageBackendResult<()>
pub fn suspend_publication( &mut self, publication: &NotificationPublication, owner: [u8; 16], ) -> StorageBackendResult<()>
Roll back the private queue append and persist only its reservation. The sender keeps the matching publication and liveness lease until its authoritative main outcome is resolved.
Sourcepub fn resume_publication(
&mut self,
publication: &NotificationPublication,
owner: [u8; 16],
control: &StorageReadControl,
) -> StorageBackendResult<bool>
pub fn resume_publication( &mut self, publication: &NotificationPublication, owner: [u8; 16], control: &StorageReadControl, ) -> StorageBackendResult<bool>
Return true when an independent recovery already applied this original main commit. Later publications may have advanced the single acknowledgement since then.
Source§impl NotificationRegistryTransaction
impl NotificationRegistryTransaction
Sourcepub fn visit_entries_from(
&self,
from_sequence: u64,
max_entries: NonZeroUsize,
control: &StorageReadControl,
visit: &mut dyn FnMut(NotificationQueueEntryRef<'_>) -> StorageBackendResult<ControlFlow<()>>,
) -> StorageBackendResult<NotificationQueueScan>
pub fn visit_entries_from( &self, from_sequence: u64, max_entries: NonZeroUsize, control: &StorageReadControl, visit: &mut dyn FnMut(NotificationQueueEntryRef<'_>) -> StorageBackendResult<ControlFlow<()>>, ) -> StorageBackendResult<NotificationQueueScan>
Visit at most max_entries ordered rows without materializing their strings or a result vector. The consumer must admit any copies under its own queue limits before retaining them. Existing SQLite connection/cache memory remains owned by the registry.
Continue accepts the current row and advances the returned resume boundary; Break declines it and stops without advancing past it. visited includes a declined row. This method never changes a listener cursor or commits a transaction. Consumer errors and cancellation stop the scan; an error grants no cursor advancement.
Source§impl NotificationRegistryTransaction
impl NotificationRegistryTransaction
pub const fn pending_acknowledgement(&self) -> Option<[u8; 32]>
pub fn allocate_backend_process_id(&self) -> Result<i32, StorageBackendError>
pub fn queue_state(&self) -> Result<NotificationQueueState, StorageBackendError>
pub fn save_queue_state( &self, state: NotificationQueueState, ) -> Result<(), StorageBackendError>
pub fn append_entries( &self, entries: &[NotificationQueueEntry], ) -> Result<(), StorageBackendError>
pub fn entries_from( &self, from_sequence: u64, ) -> Result<Vec<NotificationQueueEntry>, StorageBackendError>
pub fn delete_entries_before( &self, sequence: u64, ) -> Result<(), StorageBackendError>
pub fn listeners( &self, ) -> Result<Vec<NotificationListenerRow>, StorageBackendError>
pub fn save_listener( &self, listener: &NotificationListenerRow, ) -> Result<(), StorageBackendError>
pub fn drop_listener( &self, owner_id: [u8; 16], session_id: u64, ) -> Result<(), StorageBackendError>
Sourcepub fn commit(self) -> Result<(), StorageBackendError>
pub fn commit(self) -> Result<(), StorageBackendError>
Complete an already authoritative publication even if its original query was cancelled.
Sourcepub fn commit_with_control(
self,
control: &StorageReadControl,
) -> StorageBackendResult<()>
pub fn commit_with_control( self, control: &StorageReadControl, ) -> StorageBackendResult<()>
Commit a cancellable registration or consumption attempt. An interrupted native wait drops and rolls back the uncommitted attempt.