Struct IntentMachine 

pub struct IntentMachine {
    pub store: ClientStore,
    pub attempts: u32,
    pub backoff_ms: Vec<u64>,
}

Fields

store: ClientStore

attempts: u32

backoff_ms: Vec<u64>

Implementations

impl IntentMachine

pub fn new(store: ClientStore, attempts: u32, backoff_ms: Vec<u64>) -> Self

pub fn enqueue(&self, envelope: &Envelope) -> Result<bool>

Queue one envelope under the id its row is keyed by.

A kind that may arrive without a key (a note) gets a fresh one from stamp_op_id, and the stamped envelope is what the row stores and replays, so the row’s op_id and its env_json never disagree.

pub fn enqueue_value(&self, op_id: &str, envelope: &Value) -> Result<bool>

pub fn pending(&self) -> Result<Vec<IntentRow>>

pub fn next_delay(&self, attempt: u32) -> Duration

pub fn attempt( &self, row: &IntentRow, response: Option<&ResBody>, ) -> Result<IntentResult>

pub fn defer(&self, row: &IntentRow, reason: &str) -> Result<IntentResult>

Hold an intent whose send never reached the server.

The link being down says nothing about the message, so the queue keeps the row and the attempt counter stays where it was (plan §6 line 289).

Trait Implementations

impl Clone for IntentMachine

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.