Struct difft::diff::stack::Stack

pub(crate) struct Stack<'b, T> {
    head: Option<&'b Node<'b, T>>,
}

A persistent stack.

This is similar to Stack from the rpds crate, but it’s faster and uses less memory.

Fields

head: Option<&'b Node<'b, T>>

Implementations

impl<'b, T> Stack<'b, T>

pub(crate) fn new() -> Self

pub(crate) fn peek(&self) -> Option<&T>

pub(crate) fn pop(&self) -> Option<Stack<'b, T>>

pub(crate) fn push(&self, v: T, alloc: &'b Bump) -> Stack<'b, T>

pub(crate) fn size(&self) -> usize

pub(crate) fn is_empty(&self) -> bool

Trait Implementations

impl<'b, T: Clone> Clone for Stack<'b, T>

fn clone(&self) -> Stack<'b, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'b, T: Debug> Debug for Stack<'b, T>

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

Formats the value using the given formatter.

impl<'b, T: Default> Default for Stack<'b, T>

fn default() -> Stack<'b, T>

Returns the “default value” for a type.

impl<'b, T: PartialEq> PartialEq<Stack<'b, T>> for Stack<'b, T>

fn eq(&self, other: &Stack<'b, T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'b, T: Eq> Eq for Stack<'b, T>

impl<'b, T> StructuralEq for Stack<'b, T>

impl<'b, T> StructuralPartialEq for Stack<'b, T>