pub struct PopFromStack<Values>(pub Values);Expand description
Copied operands prepared for an instruction, distinct from its payload.
Tuple builders support arities 0–16. Fields retain their declared order,
while extraction proceeds right to left: (lhs, rhs) pops rhs first.
Successful pops remain consumed if a later pop or CPU execution fails.
The empty tuple consumes nothing and does not access the stack capability.
Tuple construction requires no allocation or stack borrow. Homogeneous
crate::StackBatch inputs use StackInputCount and inline storage with
heap fallback; their owned message likewise retains no stack borrow.
Tuple Fields§
§0: ValuesTrait Implementations§
Source§impl<Values: Clone> Clone for PopFromStack<Values>
impl<Values: Clone> Clone for PopFromStack<Values>
Source§fn clone(&self) -> PopFromStack<Values>
fn clone(&self) -> PopFromStack<Values>
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl<Values: Copy> Copy for PopFromStack<Values>
Source§impl<Values: Debug> Debug for PopFromStack<Values>
impl<Values: Debug> Debug for PopFromStack<Values>
impl<Values: Eq> Eq for PopFromStack<Values>
impl<Values: 'static> Message for PopFromStack<Values>
Source§impl<Values: PartialEq> PartialEq for PopFromStack<Values>
impl<Values: PartialEq> PartialEq for PopFromStack<Values>
impl<Values: PartialEq> StructuralPartialEq for PopFromStack<Values>
Auto Trait Implementations§
impl<Values> Freeze for PopFromStack<Values>where
Values: Freeze,
impl<Values> RefUnwindSafe for PopFromStack<Values>where
Values: RefUnwindSafe,
impl<Values> Send for PopFromStack<Values>where
Values: Send,
impl<Values> Sync for PopFromStack<Values>where
Values: Sync,
impl<Values> Unpin for PopFromStack<Values>where
Values: Unpin,
impl<Values> UnsafeUnpin for PopFromStack<Values>where
Values: UnsafeUnpin,
impl<Values> UnwindSafe for PopFromStack<Values>where
Values: UnwindSafe,
Blanket Implementations§
Source§impl<D> Apply<PushToStack<()>> for D
impl<D> Apply<PushToStack<()>> for D
Source§fn apply(&mut self, _: PushToStack<()>)
fn apply(&mut self, _: PushToStack<()>)
Apply a single effect to this destination.
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.§impl<'src, T> IntoMaybe<'src, T> for Twhere
T: 'src,
impl<'src, T> IntoMaybe<'src, T> for Twhere
T: 'src,
impl<T> OrderedSeq<'_, T> for Twhere
T: Clone,
§impl<'p, T> Seq<'p, T> for Twhere
T: Clone,
impl<'p, T> Seq<'p, T> for Twhere
T: Clone,
§type Iter<'a> = Once<&'a T>
where
T: 'a
type Iter<'a> = Once<&'a T> where T: 'a
An iterator over the items within this container, by reference.
§fn contains(&self, val: &T) -> boolwhere
T: PartialEq,
fn contains(&self, val: &T) -> boolwhere
T: PartialEq,
Check whether an item is contained within this sequence.
§fn to_maybe_ref<'b>(item: <T as Seq<'p, T>>::Item<'b>) -> Maybe<T, &'p T>where
'p: 'b,
fn to_maybe_ref<'b>(item: <T as Seq<'p, T>>::Item<'b>) -> Maybe<T, &'p T>where
'p: 'b,
Convert an item of the sequence into a [
MaybeRef].