Enum essential_constraint_asm::Stack

source ·
pub enum Stack {
    Push(Word),
    Pop,
    Dup,
    DupFrom,
    Swap,
    SwapIndex,
    Select,
    SelectRange,
    Repeat,
    RepeatEnd,
}
Expand description

Operations related to stack manipulation.

Variants§

§

Push(Word)

0x01

Push one word onto the stack.

§Bytecode Argument

This operation expects a 8-byte (1-word) argument following its opcode within bytecode.

§Stack Output

[value]

§

Pop

0x02

Pop one word from the stack.

§Stack Input

[a]

§

Dup

0x03

Duplicate the top word on the stack.

§Stack Input

[value]

§Stack Output

[value, value]

§

DupFrom

0x04

Duplicate the word at the given stack depth index.

0 is the index of the element at the top of the stack.

§Stack Input

[index]

§Stack Output

[value_i]

§

Swap

0x05

Swap top two words on stack.

§Stack Input

[a, b]

§Stack Output

[b, a]

§

SwapIndex

0x06

Swap the top word on the stack with the word at the given stack depth index.

0 is the index of the element at the top of the stack.

§Stack Input

[a, b, c, d, index]

§Stack Output

[a, d, c, b]

§Panics
  • Index is out of range.
§

Select

0x07

Conditionally keep one of the top two elements on the stack.

If condition is true, the top element is kept.

§Stack Input

[a, b, cond]

§Stack Output

[b]

§

SelectRange

0x08

Conditionally keep one of the top two ranges on the stack.

If condition is true, the top range is kept.

The ranges must be of equal length. The ranges must be stacked sequentially. Here N is len -1.

§Stack Input

[arr_a_0, ..arr_a_N, arr_b_0, ..arr_b_N, len, cond]

§Stack Output

[arr_b_0, ..arr_b_N]

§

Repeat

0x09

Repeat a section of code the number of times. Takes a boolean to either count from 0 up or from the number of repeats down to 0.

§Stack Input

[num_repeats, count_up_bool]

§

RepeatEnd

0x0A

Increment or decrements the top counter on the repeat stack. If the counter is counting up and counter == limit - 1 then this pops the counter and continues with the program. If the counter is counting down and the counter is 0 then this pops the counter and continues with the program. If it is < limit - 1 or > 0 respectively then the program jumps to the last Repeat

§Panics
  • If there is no counter on the repeat stack.
  • If there is no repeat registered to return to.

Trait Implementations§

source§

impl Clone for Stack

source§

fn clone(&self) -> Stack

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl Debug for Stack

source§

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

Formats the value using the given formatter. Read more
source§

impl From<Stack> for Constraint

source§

fn from(subgroup: Stack) -> Self

Converts to this type from the input type.
source§

impl Hash for Stack

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl Ord for Stack

source§

fn cmp(&self, other: &Stack) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

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

Compares and returns the maximum of two values. Read more
1.21.0 · source§

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

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for Stack

source§

fn eq(&self, other: &Stack) -> bool

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

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.
source§

impl PartialOrd for Stack

source§

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

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

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

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

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

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · source§

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

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

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

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

impl ToBytes for Stack

§

type Bytes = Stack

The iterator yielding bytes.
source§

fn to_bytes(&self) -> Self::Bytes

Convert the operation to its serialized form in bytes.
source§

impl ToOpcode for Stack

§

type Opcode = Stack

The associated Opcode type.
source§

fn to_opcode(&self) -> Self::Opcode

The opcode associated with this operation.
source§

impl TryFromBytes for Stack

§

type Error = FromBytesError

Represents any error that might occur while parsing an op from bytes.
source§

fn try_from_bytes( bytes: &mut impl Iterator<Item = u8>, ) -> Option<Result<Self, Self::Error>>

Parse a single operation from the given iterator yielding bytes. Read more
source§

impl Copy for Stack

source§

impl Eq for Stack

source§

impl StructuralPartialEq for Stack

Auto Trait Implementations§

§

impl Freeze for Stack

§

impl RefUnwindSafe for Stack

§

impl Send for Stack

§

impl Sync for Stack

§

impl Unpin for Stack

§

impl UnwindSafe for Stack

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> CloneToUninit for T
where T: Copy,

source§

unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> CloneToUninit for T
where T: Clone,

source§

default unsafe fn clone_to_uninit(&self, dst: *mut T)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.