Struct wired::Stack

pub struct Stack<T> { /* fields omitted */ }

a Last-In-First-Out data structure

A Stack is backed by a memory-mapped file, so the full content does not reside in RAM when not needed. It is type-safe over a generic type that can be serialized through serde.

What exactly is a Stack?

In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations:

• push, which adds an element to the collection, and
• pop, which removes the most recently added element that was not yet removed.

The order in which elements come off a stack gives rise to its alternative name, LIFO (last in, first out). Additionally, a peek operation may give access to the top without modifying the stack. The name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other, which makes it easy to take an item off the top of the stack, while getting to an item deeper in the stack may require taking off multiple other items first.

-- Wikipedia

Methods

impl<T> Stack<T> where
    T: Serialize,
    T: Deserialize<'de>, 

pub fn new(path: &str) -> Result<Self, Box<dyn Error>>

pub fn len(&self) -> usize

pub fn wasted_file_space(&self) -> f64

pub fn push(&mut self, data: &T) -> Result<(), Box<dyn Error>>

pub fn pop(&mut self) -> Result<Option<T>, Box<dyn Error>>

pub fn compact(&mut self) -> Result<(), Box<dyn Error>>