Struct evmil::util::IntervalStack

pub struct IntervalStack<T: PartialEq> { /* private fields */ }

Implementations

impl<T> IntervalStack<T>

where T: PartialEq + Clone + JoinLattice,

pub fn new(lower: impl Into<Interval<usize>>, upper: Vec<T>) -> Self

pub fn empty() -> Self

Construct an empty stack.

pub fn len(&self) -> Interval<usize>

Determine possible lengths of the stack as an interval

pub fn peek(&self, n: usize) -> T

Peek nth item on the stack (where 0 is top).

pub fn push(&mut self, val: T) -> &mut Self

Push an iterm onto this stack.

pub fn pop(&mut self) -> &mut Self

pub fn min_len(&self) -> usize

Determine the minimum length of any stack represented by this abstract stack.

pub fn max_len(&self) -> usize

Determine the maximum length of any stack represented by this abstract stack.

pub fn values(&self) -> &[T]

Access the array of concrete values represented by this stack (i.e. the upper portion of the stack).

pub fn set(self, n: usize, val: T) -> Self

Set ith item from the top on this stack. Thus, 0 is the top of the stack, etc.

pub fn join(self, other: &IntervalStack<T>) -> Self

Join two abstract stacks together.

Trait Implementations

impl<T> Bottom for IntervalStack<T>

where T: PartialEq + Clone + Bottom,

const BOTTOM: Self = _

impl<T> Clone for IntervalStack<T>

where T: PartialEq + Clone,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + PartialEq> Debug for IntervalStack<T>

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

Formats the value using the given formatter.

impl<T: PartialEq + Clone + JoinLattice> Default for IntervalStack<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Display for IntervalStack<T>

where T: Clone + Display + PartialEq + Bottom,

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

Formats the value using the given formatter.

impl<T> JoinInto for IntervalStack<T>

where T: PartialEq + Clone + JoinLattice,

fn join_into(&mut self, other: &IntervalStack<T>) -> bool

Merge an abstract stack into this stack, whilst reporting whether this stack changed or not.

impl<T: Ord + PartialEq> Ord for IntervalStack<T>

fn cmp(&self, other: &IntervalStack<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<T: PartialEq + PartialEq> PartialEq for IntervalStack<T>

fn eq(&self, other: &IntervalStack<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<T: PartialOrd + PartialEq> PartialOrd for IntervalStack<T>

fn partial_cmp(&self, other: &IntervalStack<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Eq + PartialEq> Eq for IntervalStack<T>

impl<T: PartialEq> StructuralPartialEq for IntervalStack<T>