#[repr(C)]pub struct TransactionMerkleTree {
pub filled_subtrees: [[u8; 32]; 18],
pub current_root_index: u64,
pub next_index: u64,
pub roots: [[u8; 32]; 256],
pub pubkey_locked: Pubkey,
pub time_locked: u64,
pub height: u64,
pub merkle_tree_nr: u64,
pub lock_duration: u64,
pub next_queued_index: u64,
pub newest: u8,
/* private fields */
}Fields§
§filled_subtrees: [[u8; 32]; 18]§current_root_index: u64§next_index: u64§roots: [[u8; 32]; 256]§pubkey_locked: Pubkey§time_locked: u64§height: u64§merkle_tree_nr: u64§lock_duration: u64§next_queued_index: u64§newest: u8Trait Implementations§
source§impl AccountDeserialize for TransactionMerkleTree
impl AccountDeserialize for TransactionMerkleTree
source§fn try_deserialize(buf: &mut &[u8]) -> Result<Self>
fn try_deserialize(buf: &mut &[u8]) -> Result<Self>
Deserializes previously initialized account data. Should fail for all
uninitialized accounts, where the bytes are zeroed. Implementations
should be unique to a particular account type so that one can never
successfully deserialize the data of one account type into another.
For example, if the SPL token program were to implement this trait,
it should be impossible to deserialize a
Mint account into a token
Account.source§fn try_deserialize_unchecked(buf: &mut &[u8]) -> Result<Self>
fn try_deserialize_unchecked(buf: &mut &[u8]) -> Result<Self>
Deserializes account data without checking the account discriminator.
This should only be used on account initialization, when the bytes of
the account are zeroed.
source§impl Clone for TransactionMerkleTree
impl Clone for TransactionMerkleTree
source§fn clone(&self) -> TransactionMerkleTree
fn clone(&self) -> TransactionMerkleTree
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for TransactionMerkleTree
impl Debug for TransactionMerkleTree
source§impl Discriminator for TransactionMerkleTree
impl Discriminator for TransactionMerkleTree
const DISCRIMINATOR: [u8; 8] = _
fn discriminator() -> [u8; 8]
source§impl PartialEq for TransactionMerkleTree
impl PartialEq for TransactionMerkleTree
source§fn eq(&self, other: &TransactionMerkleTree) -> bool
fn eq(&self, other: &TransactionMerkleTree) -> bool
This method tests for
self and other values to be equal, and is used
by ==.impl Copy for TransactionMerkleTree
impl Eq for TransactionMerkleTree
impl Pod for TransactionMerkleTree
impl StructuralEq for TransactionMerkleTree
impl StructuralPartialEq for TransactionMerkleTree
impl ZeroCopy for TransactionMerkleTree
Auto Trait Implementations§
impl RefUnwindSafe for TransactionMerkleTree
impl Send for TransactionMerkleTree
impl Sync for TransactionMerkleTree
impl Unpin for TransactionMerkleTree
impl UnwindSafe for TransactionMerkleTree
Blanket Implementations§
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> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere
T: AnyBitPattern,
§type Bits = T
type Bits = T
Self must have the same layout as the specified Bits except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern.source§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
If this function returns true, then it must be valid to reinterpret
bits
as &Self.§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
Checks if this value is equivalent to the given key. Read more