Struct Conditions 

pub struct Conditions<T = NodePtr> { /* private fields */ }

A grow-only list of conditions which can be used when building spend bundles.

Implementations

impl Conditions

pub fn new() -> Conditions

Create a new empty list of conditions. To make inference easier for the compiler, the generic type defaults to NodePtr, since that’s the most general choice and common when building spend bundles.

If you need to create an instance with a different generic type, use Conditions::default instead.

impl<T> Conditions<T>

pub fn len(&self) -> usize

Gets the number of conditions.

pub fn is_empty(&self) -> bool

Checks if there are no conditions.

pub fn iter(&self) -> impl Iterator<Item = &Condition<T>>

Gets an iterator over the conditions.

pub fn into_vec(self) -> Vec<Condition<T>>

Converts the list of conditions into a vector.

pub fn with(self, condition: impl Into<Condition<T>>) -> Conditions<T>

Adds a condition and returns the updated list.

pub fn extend( self, conditions: impl IntoIterator<Item = impl Into<Condition<T>>>, ) -> Conditions<T>

Appends a list of conditions to the end from an iterator.

pub fn extend_from_slice(self, conditions: &[Condition<T>]) -> Conditions<T>

where T: Clone,

Appends a list of conditions to the end from a slice.

pub fn push(&mut self, condition: impl Into<Condition<T>>)

Adds a condition to the end of the list.

impl<T> Conditions<T>

pub fn remark(self, rest: T) -> Conditions<T>

pub fn agg_sig_parent( self, public_key: PublicKey, message: Bytes, ) -> Conditions<T>

pub fn agg_sig_puzzle( self, public_key: PublicKey, message: Bytes, ) -> Conditions<T>

pub fn agg_sig_amount( self, public_key: PublicKey, message: Bytes, ) -> Conditions<T>

pub fn agg_sig_puzzle_amount( self, public_key: PublicKey, message: Bytes, ) -> Conditions<T>

pub fn agg_sig_parent_amount( self, public_key: PublicKey, message: Bytes, ) -> Conditions<T>

pub fn agg_sig_parent_puzzle( self, public_key: PublicKey, message: Bytes, ) -> Conditions<T>

pub fn agg_sig_unsafe( self, public_key: PublicKey, message: Bytes, ) -> Conditions<T>

pub fn agg_sig_me(self, public_key: PublicKey, message: Bytes) -> Conditions<T>

pub fn create_coin( self, puzzle_hash: BytesImpl<32>, amount: u64, memos: Memos<T>, ) -> Conditions<T>

pub fn reserve_fee(self, amount: u64) -> Conditions<T>

pub fn create_coin_announcement(self, message: Bytes) -> Conditions<T>

pub fn assert_coin_announcement( self, announcement_id: BytesImpl<32>, ) -> Conditions<T>

pub fn create_puzzle_announcement(self, message: Bytes) -> Conditions<T>

pub fn assert_puzzle_announcement( self, announcement_id: BytesImpl<32>, ) -> Conditions<T>

pub fn assert_concurrent_spend(self, coin_id: BytesImpl<32>) -> Conditions<T>

pub fn assert_concurrent_puzzle( self, puzzle_hash: BytesImpl<32>, ) -> Conditions<T>

pub fn send_message( self, mode: u8, message: Bytes, data: Vec<T>, ) -> Conditions<T>

pub fn receive_message( self, mode: u8, message: Bytes, data: Vec<T>, ) -> Conditions<T>

pub fn assert_my_coin_id(self, coin_id: BytesImpl<32>) -> Conditions<T>

pub fn assert_my_parent_id(self, parent_id: BytesImpl<32>) -> Conditions<T>

pub fn assert_my_puzzle_hash(self, puzzle_hash: BytesImpl<32>) -> Conditions<T>

pub fn assert_my_amount(self, amount: u64) -> Conditions<T>

pub fn assert_my_birth_seconds(self, seconds: u64) -> Conditions<T>

pub fn assert_my_birth_height(self, height: u32) -> Conditions<T>

pub fn assert_ephemeral(self) -> Conditions<T>

pub fn assert_seconds_relative(self, seconds: u64) -> Conditions<T>

pub fn assert_seconds_absolute(self, seconds: u64) -> Conditions<T>

pub fn assert_height_relative(self, height: u32) -> Conditions<T>

pub fn assert_height_absolute(self, height: u32) -> Conditions<T>

pub fn assert_before_seconds_relative(self, seconds: u64) -> Conditions<T>

pub fn assert_before_seconds_absolute(self, seconds: u64) -> Conditions<T>

pub fn assert_before_height_relative(self, height: u32) -> Conditions<T>

pub fn assert_before_height_absolute(self, height: u32) -> Conditions<T>

pub fn softfork(self, cost: u64, rest: T) -> Conditions<T>

pub fn transfer_nft( self, launcher_id: Option<BytesImpl<32>>, trade_prices: Vec<TradePrice>, singleton_inner_puzzle_hash: Option<BytesImpl<32>>, ) -> Conditions<T>

pub fn run_cat_tail(self, program: T, solution: T) -> Conditions<T>

pub fn melt_singleton(self) -> Conditions<T>

pub fn update_nft_metadata( self, updater_puzzle_reveal: T, updater_solution: T, ) -> Conditions<T>

pub fn update_data_store_merkle_root( self, new_merkle_root: BytesImpl<32>, memos: Vec<Bytes>, ) -> Conditions<T>

Trait Implementations

impl<T> AsRef<[Condition<T>]> for Conditions<T>

fn as_ref(&self) -> &[Condition<T>]

Converts this type into a shared reference of the (usually inferred) input type.

impl<T> Clone for Conditions<T>

where T: Clone,

fn clone(&self) -> Conditions<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Conditions<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Default for Conditions<T>

fn default() -> Conditions<T>

Returns the “default value” for a type.

impl<T> From<Vec<Condition<T>>> for Conditions<T>

fn from(conditions: Vec<Condition<T>>) -> Conditions<T>

Converts to this type from the input type.

impl<T, Node, D> FromClvm<D> for Conditions<T>

where T: FromClvm<D>, D: ClvmDecoder<Node = Node>,

fn from_clvm(decoder: &D, node: Node) -> Result<Conditions<T>, FromClvmError>

impl<T> Index<usize> for Conditions<T>

type Output = Condition<T>

The returned type after indexing.

fn index(&self, index: usize) -> &<Conditions<T> as Index<usize>>::Output

Performs the indexing (container[index]) operation.

impl<'a, T> IntoIterator for &'a Conditions<T>

type Item = &'a Condition<T>

The type of the elements being iterated over.

type IntoIter = Iter<'a, Condition<T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a Conditions<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for Conditions<T>

type Item = Condition<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<Condition<T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <Conditions<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> PartialEq for Conditions<T>

where T: PartialEq,

fn eq(&self, other: &Conditions<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T, Node, E> ToClvm<E> for Conditions<T>

where T: ToClvm<E>, E: ClvmEncoder<Node = Node>,

fn to_clvm(&self, encoder: &mut E) -> Result<Node, ToClvmError>

impl<T> Eq for Conditions<T>

where T: Eq,

impl<T> StructuralPartialEq for Conditions<T>