Struct snarkvm_compiler::Transactions

pub struct Transactions<N: Network> { /* private fields */ }

Implementations

impl<N: Network> Transactions<N>

pub fn to_root(&self) -> Result<Field<N>>

Returns the transactions root, by computing the root for a Merkle tree of the transaction IDs.

pub fn to_path(
    &self,
    index: usize,
    leaf: impl ToBits
) -> Result<TransactionsPath<N>>

Returns the Merkle path for the transactions leaf.

pub fn to_tree(&self) -> Result<BHPMerkleTree<N, TRANSACTIONS_DEPTH>>

The Merkle tree of transaction IDs for the block.

impl<N: Network> Transactions<N>

pub fn from(transactions: &[Transaction<N>]) -> Self

Initializes from a given transactions list.

impl<N: Network> Transactions<N>

pub const MAX_TRANSACTIONS: usize = 65_536usize

The maximum number of transactions allowed in a block.

pub fn transactions(&self) -> impl '_ + Iterator<Item = &Transaction<N>>

Returns an iterator over all transactions, for all transactions in self.

pub fn transaction_ids(&self) -> impl '_ + Iterator<Item = &N::TransactionID>

Returns an iterator over the transaction IDs, for all transactions in self.

pub fn deployments(&self) -> impl '_ + Iterator<Item = &Deployment<N>>

Returns an iterator over all transactions in self that are deployments.

pub fn executions(&self) -> impl '_ + Iterator<Item = &Execution<N>>

Returns an iterator over all transactions in self that are executions.

pub fn transitions(&self) -> impl '_ + Iterator<Item = &Transition<N>>

Returns an iterator over all transitions.

pub fn transition_ids(&self) -> impl '_ + Iterator<Item = &N::TransitionID>

Returns an iterator over the transition IDs, for all transitions.

pub fn transition_public_keys(&self) -> impl '_ + Iterator<Item = &Group<N>>

Returns an iterator over the transition public keys, for all transactions.

pub fn origins(&self) -> impl '_ + Iterator<Item = &Origin<N>>

Returns an iterator over the origins, for all transition inputs that are records.

pub fn tags(&self) -> impl '_ + Iterator<Item = &Field<N>>

Returns an iterator over the tags, for all transition inputs that are records.

pub fn serial_numbers(&self) -> impl '_ + Iterator<Item = &Field<N>>

Returns an iterator over the serial numbers, for all transition inputs that are records.

pub fn commitments(&self) -> impl '_ + Iterator<Item = &Field<N>>

Returns an iterator over the commitments, for all transition outputs that are records.

pub fn nonces(&self) -> impl '_ + Iterator<Item = &Group<N>>

Returns an iterator over the nonces, for all transition outputs that are records.

pub fn fees(&self) -> impl '_ + Iterator<Item = &i64>

Returns an iterator over the fees, for all transitions.

impl<N: Network> Transactions<N>

pub fn into_transactions(self) -> impl Iterator<Item = Transaction<N>>

Returns a consuming iterator over all transactions, for all transactions in self.

pub fn into_transaction_ids(self) -> impl Iterator<Item = N::TransactionID>

Returns a consuming iterator over the transaction IDs, for all transactions in self.

pub fn into_deployments(self) -> impl Iterator<Item = Deployment<N>>

Returns a consuming iterator over all transactions in self that are deployments.

pub fn into_executions(self) -> impl Iterator<Item = Execution<N>>

Returns a consuming iterator over all transactions in self that are executions.

pub fn into_transitions(self) -> impl Iterator<Item = Transition<N>>

Returns a consuming iterator over all transitions.

pub fn into_transition_ids(self) -> impl Iterator<Item = N::TransitionID>

Returns a consuming iterator over the transition IDs, for all transitions.

pub fn into_transition_public_keys(self) -> impl Iterator<Item = Group<N>>

Returns a consuming iterator over the transition public keys, for all transactions.

pub fn into_origins(self) -> impl Iterator<Item = Origin<N>>

Returns a consuming iterator over the origins, for all transition inputs that are records.

pub fn into_tags(self) -> impl Iterator<Item = Field<N>>

Returns a consuming iterator over the tags, for all transition inputs that are records.

pub fn into_serial_numbers(self) -> impl Iterator<Item = Field<N>>

Returns a consuming iterator over the serial numbers, for all transition inputs that are records.

pub fn into_commitments(self) -> impl Iterator<Item = Field<N>>

Returns a consuming iterator over the commitments, for all transition outputs that are records.

pub fn into_nonces(self) -> impl Iterator<Item = Group<N>>

Returns a consuming iterator over the nonces, for all transition outputs that are records.

Methods from Deref<Target = IndexMap<N::TransactionID, Transaction<N>>>

pub fn capacity(&self) -> usize

Computes in O(1) time.

pub fn hasher(&self) -> &S

Return a reference to the map’s BuildHasher.

pub fn len(&self) -> usize

Return the number of key-value pairs in the map.

Computes in O(1) time.

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

Computes in O(1) time.

pub fn iter(&self) -> Iter<'_, K, V>

Return an iterator over the key-value pairs of the map, in their order

pub fn keys(&self) -> Keys<'_, K, V>

Return an iterator over the keys of the map, in their order

pub fn values(&self) -> Values<'_, K, V>

Return an iterator over the values of the map, in their order

pub fn contains_key<Q>(&self, key: &Q) -> bool where
    Q: Hash + Equivalent<K> + ?Sized, 

Return true if an equivalent to key exists in the map.

Computes in O(1) time (average).

pub fn get<Q>(&self, key: &Q) -> Option<&V> where
    Q: Hash + Equivalent<K> + ?Sized, 

Return a reference to the value stored for key, if it is present, else None.

Computes in O(1) time (average).

pub fn get_key_value<Q>(&self, key: &Q) -> Option<(&K, &V)> where
    Q: Hash + Equivalent<K> + ?Sized, 

Return references to the key-value pair stored for key, if it is present, else None.

Computes in O(1) time (average).

pub fn get_full<Q>(&self, key: &Q) -> Option<(usize, &K, &V)> where
    Q: Hash + Equivalent<K> + ?Sized, 

Return item index, key and value

pub fn get_index_of<Q>(&self, key: &Q) -> Option<usize> where
    Q: Hash + Equivalent<K> + ?Sized, 

Return item index, if it exists in the map

Computes in O(1) time (average).

pub fn get_index(&self, index: usize) -> Option<(&K, &V)>

Get a key-value pair by index

Valid indices are 0 <= index < self.len()

Computes in O(1) time.

pub fn first(&self) -> Option<(&K, &V)>

Get the first key-value pair

Computes in O(1) time.

pub fn last(&self) -> Option<(&K, &V)>

Get the last key-value pair

Computes in O(1) time.

pub fn par_keys(&self) -> ParKeys<'_, K, V>

Return a parallel iterator over the keys of the map.

While parallel iterators can process items in any order, their relative order in the map is still preserved for operations like reduce and collect.

pub fn par_values(&self) -> ParValues<'_, K, V>

Return a parallel iterator over the values of the map.

While parallel iterators can process items in any order, their relative order in the map is still preserved for operations like reduce and collect.

pub fn par_eq<V2, S2>(&self, other: &IndexMap<K, V2, S2>) -> bool where
    V: PartialEq<V2>,
    V2: Sync,
    S2: BuildHasher + Sync, 

Returns true if self contains all of the same key-value pairs as other, regardless of each map’s indexed order, determined in parallel.

Trait Implementations

impl<N: Clone + Network> Clone for Transactions<N> where
    N::TransactionID: Clone, 

fn clone(&self) -> Transactions<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Network> Debug for Transactions<N>

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

Prints the transactions as a JSON-string.

impl<N: Network> Deref for Transactions<N>

type Target = IndexMap<<N as Network>::TransactionID, Transaction<N>, RandomState>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'de, N: Network> Deserialize<'de> for Transactions<N>

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserializes the transactions from a JSON-string or buffer.

impl<N: Network> Display for Transactions<N>

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

Displays the transactions as a JSON-string.

impl<N: Network> FromBytes for Transactions<N>

fn read_le<R: Read>(reader: R) -> IoResult<Self>

Reads the transactions from buffer.

fn from_bytes_le(bytes: &[u8]) -> Result<Self, Error>

Returns Self from a byte array in little-endian order.

impl<'a, N: Network> FromIterator<&'a Transaction<N>> for Transactions<N>

fn from_iter<T: IntoIterator<Item = &'a Transaction<N>>>(iter: T) -> Self

Initializes from an iterator of transactions.

impl<N: Network> FromIterator<Transaction<N>> for Transactions<N>

fn from_iter<T: IntoIterator<Item = Transaction<N>>>(iter: T) -> Self

Initializes from an iterator of transactions.

impl<N: Network> FromStr for Transactions<N>

fn from_str(transactions: &str) -> Result<Self, Self::Err>

Initializes the transactions from a JSON-string.

type Err = Error

The associated error which can be returned from parsing.

impl<N: PartialEq + Network> PartialEq<Transactions<N>> for Transactions<N> where
    N::TransactionID: PartialEq, 

fn eq(&self, other: &Transactions<N>) -> 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<N: Network> Serialize for Transactions<N>

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serializes the transactions to a JSON-string or buffer.

impl<N: Network> ToBytes for Transactions<N>

fn write_le<W: Write>(&self, writer: W) -> IoResult<()>

Writes the transactions to a buffer.

fn to_bytes_le(&self) -> Result<Vec<u8, Global>, Error>

Returns self as a byte array in little-endian order.

impl<N: Eq + Network> Eq for Transactions<N> where
    N::TransactionID: Eq, 

impl<N: Network> StructuralEq for Transactions<N>

impl<N: Network> StructuralPartialEq for Transactions<N>