Struct PgSubscription 

pub struct PgSubscription { /* private fields */ }

One consumer’s input on the db transport.

Implementations

impl PgSubscription

pub fn new(pool: PgPool, consumer: impl Into<String>) -> Self

pub fn with_lease(self, lease: Duration) -> Self

How long a claim is kept from other workers; longer than the slowest handler.

Trait Implementations

impl EventSubscription for PgSubscription

fn next_batch<'life0, 'async_trait>( &'life0 mut self, max: u32, ) -> Pin<Box<dyn Future<Output = Result<Vec<Claimed>, TransportError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Claims the due deliveries, oldest event first. A claim counts as a delivery (attempts goes up now, not when it is settled), so a worker that crashes mid-handle still uses one of the event’s deliveries, and the claim is hidden for the lease.

fn consumer(&self) -> &str

The consumer it delivers to — the [[consumer]] name.

fn settle<'life0, 'life1, 'life2, 'async_trait>( &'life0 mut self, claimed: &'life1 Claimed, delivery: &'life2 Delivery, ) -> Pin<Box<dyn Future<Output = Result<(), TransportError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Ack → never again; Retry { delay } → again after delay; DeadLetter → never again (the dead letter is recorded before this is called).

fn max_batch(&self) -> u32

The most claims one batch hands out, whatever next_batch is asked for. A transport that keeps an order (Kafka: a partition) answers 1, so a Retry holds back what comes after it instead of letting the handler see it first.