Struct FixedReceiptTable 

pub struct FixedReceiptTable<const MAX_OUTSTANDING_RECEIPTS: usize> { /* private fields */ }

Trait Implementations

impl<const MAX_OUTSTANDING_RECEIPTS: usize> Debug for FixedReceiptTable<MAX_OUTSTANDING_RECEIPTS>

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

Formats the value using the given formatter.

impl<const MAX_OUTSTANDING_RECEIPTS: usize> Default for FixedReceiptTable<MAX_OUTSTANDING_RECEIPTS>

fn default() -> FixedReceiptTable<MAX_OUTSTANDING_RECEIPTS>

Returns the “default value” for a type.

impl<const MAX_OUTSTANDING_RECEIPTS: usize> ReceiptTable for FixedReceiptTable<MAX_OUTSTANDING_RECEIPTS>

fn capacity(&self) -> usize

fn len(&self) -> usize

fn packet_hashes(&self) -> &[PacketHash]

fn command_ids(&self) -> &[CommandId]

fn kinds(&self) -> &[ReceiptKind]

fn signing_keys(&self) -> &[IdentitySigningPublicKey]

fn sent_ats(&self) -> &[InstantMillis]

fn deadlines(&self) -> &[ReceiptDeadline]

fn set_deadline(&mut self, index: usize, deadline: ReceiptDeadline)

fn push( &mut self, receipt: OutstandingReceipt, ) -> Result<usize, TrackReceiptError>

fn remove(&mut self, index: usize)

Removal must preserve insertion order (shift, not swap): index order IS the implicit-proof trial order, and proofs return in send order over a FIFO wire. A swap-remove was measured paying ~5 Ed25519 verifies per proof where one suffices; the reference holds the same invariant free (an append-only list).

fn is_empty(&self) -> bool