Struct MemoryTicketQueue 

pub struct MemoryTicketQueue(Arc<RwLock<BinaryHeap<Reverse<RedeemableTicket>>>>);

Simple in-memory ticket queue implementation using a binary heap.

This is suitable for testing where ticket persistence is not required.

The implementation might not be particularly efficient for production use.

Tuple Fields

0: Arc<RwLock<BinaryHeap<Reverse<RedeemableTicket>>>>

Trait Implementations

impl Clone for MemoryTicketQueue

fn clone(&self) -> MemoryTicketQueue

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MemoryTicketQueue

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

Formats the value using the given formatter.

impl Default for MemoryTicketQueue

fn default() -> MemoryTicketQueue

Returns the “default value” for a type.

impl TicketQueue for MemoryTicketQueue

type Error = Infallible

fn len(&self) -> Result<usize, Self::Error>

Number of tickets in the queue.

fn is_empty(&self) -> Result<bool, Self::Error>

Indicates whether the queue is empty.

fn push(&mut self, ticket: RedeemableTicket) -> Result<(), Self::Error>

Add a ticket to the queue.

fn pop(&mut self) -> Result<Option<RedeemableTicket>, Self::Error>

Remove and return the next ticket in-order from the queue.

fn peek(&self) -> Result<Option<RedeemableTicket>, Self::Error>

Return the next ticket in-order from the queue without removing it.

fn iter_unordered( &self, ) -> Result<impl Iterator<Item = Result<RedeemableTicket, Self::Error>>, Self::Error>

Iterate over all tickets in the queue in arbitrary order.

fn total_value( &self, epoch: u32, min_index: Option<u64>, ) -> Result<HoprBalance, Self::Error>

Computes the total value of tickets of the given epoch (and optionally minimum given index) in this queue.

fn drain(&mut self) -> Result<Vec<VerifiedTicket>, Self::Error>

Drains all the remaining tickets from the queue, rendering them no longer redeemable.