Struct evmil::evm::AbstractStack

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

Implementations

impl<T> AbstractStack<T>where
    T: PartialEq + Copy + 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<'a>(&'a self) -> &'a [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: &AbstractStack<T>) -> Self

Join two abstract stacks together.

Trait Implementations

impl<T> Bottom for AbstractStack<T>where
    T: PartialEq + Copy + Bottom,

const BOTTOM: Self = _

impl<T> Clone for AbstractStack<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 AbstractStack<T>

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

Formats the value using the given formatter.

impl<T: PartialEq + Copy + JoinLattice> Default for AbstractStack<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Display for AbstractStack<T>where
    T: Copy + PartialEq + Bottom + Display,

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

Formats the value using the given formatter.

impl<T> JoinInto for AbstractStack<T>where
    T: PartialEq + Copy + JoinLattice,

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

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

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

fn eq(&self, other: &AbstractStack<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> Stack for AbstractStack<T>where
    T: PartialEq + JoinLattice + Word,

fn len(&self) -> T

Determine number of items on stack.

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

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

fn push(&mut self, val: T)

Push an iterm onto this stack.

fn pop(&mut self, n: usize)

Pop n items of the stack.

fn set(&mut self, n: usize, item: T)

Set nth item on stack

type Word = T

Underlying machine word this stack operates on. In a concrete EVM, this would be w256 or some other concrete implementation.

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