Struct EvictionList 

pub struct EvictionList {
    unique_entries: HashMap<Hash, Instant>,
    ordered_entries: VecDeque<Hash>,
    max_size: usize,
    eviction_memory_time: Duration,
}

An eviction list that allows Zebra to efficiently add entries, get entries, and remove older entries in the order they were inserted.

Fields

unique_entries: HashMap<Hash, Instant>

ordered_entries: VecDeque<Hash>

max_size: usize

eviction_memory_time: Duration

The mempool transaction eviction age limit. Same as Config::eviction_memory_time.

Implementations

impl EvictionList

pub fn new(max_size: usize, eviction_memory_time: Duration) -> Self

Create a new EvictionList with the given maximum size and eviction time.

pub fn insert(&mut self, key: Hash)

Inserts a TXID in the list, keeping track of the time it was inserted.

All entries older than EvictionList::eviction_memory_time will be removed.

Panics

If the TXID is already in the list.

pub fn contains_key(&self, txid: &Hash) -> bool

Checks if the given TXID is in the list.

pub fn len(&mut self) -> usize

Get the size of the list.

pub fn clear(&mut self)

Clear the list.

pub fn prune_old(&mut self)

Prune TXIDs that are older than eviction_time ago.

fn front(&self) -> Option<&Hash>

Get the oldest TXID in the list.

fn pop_front(&mut self) -> Option<Hash>

Removes the first element and returns it, or None if the EvictionList is empty.

fn has_expired(&self, evicted_at: &Instant) -> bool

Returns if evicted_at is considered expired considering the current time and the configured eviction time.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 104 bytes