Struct fuel_merkle::sparse::MerkleTree

source ·
pub struct MerkleTree<TableType, StorageType> { /* private fields */ }

Implementations§

source§

impl<TableType, StorageType> MerkleTree<TableType, StorageType>

source

pub const fn empty_root() -> &'static Bytes32

source

pub fn root(&self) -> Bytes32

source

pub fn into_storage(self) -> StorageType

source

pub fn storage(&self) -> &StorageType

source§

impl<TableType, StorageType, StorageError> MerkleTree<TableType, StorageType>
where TableType: Mappable<Key = Bytes32, Value = Primitive, OwnedValue = Primitive>, StorageType: StorageInspect<TableType, Error = StorageError>,

source

pub fn new(storage: StorageType) -> Self

source

pub fn load( storage: StorageType, root: &Bytes32, ) -> Result<Self, MerkleTreeError<StorageError>>

source§

impl<TableType, StorageType, StorageError> MerkleTree<TableType, StorageType>
where TableType: Mappable<Key = Bytes32, Value = Primitive, OwnedValue = Primitive>, StorageType: StorageMutate<TableType, Error = StorageError>,

source

pub fn from_set<B, I, D>( storage: StorageType, set: I, ) -> Result<Self, StorageError>
where I: Iterator<Item = (B, D)>, B: Into<Bytes32>, D: AsRef<[u8]>,

Build a sparse Merkle tree from a set of key-value pairs. This is equivalent to creating an empty sparse Merkle tree and sequentially calling update for each key-value pair. This constructor is more performant than calling individual sequential updates and is the preferred approach when the key-values are known upfront. Leaves can be appended to the returned tree using update to further accumulate leaf data.

source

pub fn update( &mut self, key: MerkleTreeKey, data: &[u8], ) -> Result<(), MerkleTreeError<StorageError>>

source

pub fn delete( &mut self, key: MerkleTreeKey, ) -> Result<(), MerkleTreeError<StorageError>>

source§

impl<TableType, StorageType, StorageError> MerkleTree<TableType, StorageType>
where TableType: Mappable<Key = Bytes32, Value = Primitive, OwnedValue = Primitive>, StorageType: StorageInspect<TableType, Error = StorageError>,

source

pub fn generate_proof( &self, key: &MerkleTreeKey, ) -> Result<Proof, MerkleTreeError<StorageError>>

Trait Implementations§

source§

impl<TableType: Debug, StorageType: Debug> Debug for MerkleTree<TableType, StorageType>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<TableType, StorageType> Freeze for MerkleTree<TableType, StorageType>
where StorageType: Freeze,

§

impl<TableType, StorageType> RefUnwindSafe for MerkleTree<TableType, StorageType>
where StorageType: RefUnwindSafe, TableType: RefUnwindSafe,

§

impl<TableType, StorageType> Send for MerkleTree<TableType, StorageType>
where StorageType: Send, TableType: Send,

§

impl<TableType, StorageType> Sync for MerkleTree<TableType, StorageType>
where StorageType: Sync, TableType: Sync,

§

impl<TableType, StorageType> Unpin for MerkleTree<TableType, StorageType>
where StorageType: Unpin, TableType: Unpin,

§

impl<TableType, StorageType> UnwindSafe for MerkleTree<TableType, StorageType>
where StorageType: UnwindSafe, TableType: UnwindSafe,

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> 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> Same for T

§

type Output = T

Should always be Self
source§

impl<T> StorageAsMut for T

source§

fn storage<Type>(&mut self) -> StorageMut<'_, Self, Type>
where Type: Mappable,

source§

fn storage_as_mut<Type>(&mut self) -> StorageMut<'_, Self, Type>
where Type: Mappable,

source§

impl<T> StorageAsRef for T

source§

fn storage<Type>(&self) -> StorageRef<'_, Self, Type>
where Type: Mappable,

source§

fn storage_as_ref<Type>(&self) -> StorageRef<'_, Self, Type>
where Type: Mappable,

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.