Struct sp_state_machine::BasicExternalities

pub struct BasicExternalities { /* fields omitted */ }

Simple Map-based Externalities impl.

Methods

impl BasicExternalities

pub fn new(inner: Storage) -> Self

Create a new instance of BasicExternalities

pub fn insert(&mut self, k: Vec<u8>, v: Vec<u8>) -> Option<Vec<u8>>

Insert key/value

pub fn into_storages(self) -> Storage

Consume self and returns inner storages

pub fn execute_with_storage<R>(
    storage: &mut Storage,
    f: impl FnOnce() -> R
) -> R

Execute the given closure f with the externalities set and initialized with storage.

Returns the result of the closure and updates storage with all changes.

pub fn execute_with<R>(&mut self, f: impl FnOnce() -> R) -> R

Execute the given closure while self is set as externalities.

Returns the result of the given closure.

Trait Implementations

impl Debug for BasicExternalities

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

Formats the value using the given formatter.

impl Default for BasicExternalities

fn default() -> Self

Returns the "default value" for a type.

impl ExtensionStore for BasicExternalities

fn extension_by_type_id(&mut self, _: TypeId) -> Option<&mut dyn Any>

Tries to find a registered extension by the given type_id and returns it as a &mut dyn Any.

impl Externalities for BasicExternalities

fn storage(&self, key: &[u8]) -> Option<Vec<u8>>

Read runtime storage.

fn storage_hash(&self, key: &[u8]) -> Option<Vec<u8>>

Get storage value hash. This may be optimized for large values.

fn original_storage(&self, key: &[u8]) -> Option<Vec<u8>>

Read original runtime storage, ignoring any overlayed changes.

fn original_storage_hash(&self, key: &[u8]) -> Option<Vec<u8>>

Get original storage value hash, ignoring any overlayed changes. This may be optimized for large values.

fn child_storage(
    &self,
    storage_key: ChildStorageKey,
    _child_info: ChildInfo,
    key: &[u8]
) -> Option<Vec<u8>>

Read child runtime storage.

fn child_storage_hash(
    &self,
    storage_key: ChildStorageKey,
    child_info: ChildInfo,
    key: &[u8]
) -> Option<Vec<u8>>

Get child storage value hash. This may be optimized for large values.

fn original_child_storage_hash(
    &self,
    storage_key: ChildStorageKey,
    child_info: ChildInfo,
    key: &[u8]
) -> Option<Vec<u8>>

Get original child storage value hash, ignoring any overlayed changes. This may be optimized for large values.

fn original_child_storage(
    &self,
    storage_key: ChildStorageKey,
    child_info: ChildInfo,
    key: &[u8]
) -> Option<Vec<u8>>

Read original runtime child storage, ignoring any overlayed changes.

fn next_storage_key(&self, key: &[u8]) -> Option<Vec<u8>>

Returns the key immediately following the given key, if it exists.

fn next_child_storage_key(
    &self,
    storage_key: ChildStorageKey,
    _child_info: ChildInfo,
    key: &[u8]
) -> Option<Vec<u8>>

Returns the key immediately following the given key, if it exists, in child storage.

fn place_storage(&mut self, key: Vec<u8>, maybe_value: Option<Vec<u8>>)

Set or clear a storage entry (key) of current contract being called (effective immediately).

fn place_child_storage(
    &mut self,
    storage_key: ChildStorageKey,
    child_info: ChildInfo,
    key: Vec<u8>,
    value: Option<Vec<u8>>
)

Set or clear a child storage entry. Return whether the operation succeeds.

fn kill_child_storage(
    &mut self,
    storage_key: ChildStorageKey,
    _child_info: ChildInfo
)

Clear an entire child storage.

fn clear_prefix(&mut self, prefix: &[u8])

Clear storage entries which keys are start with the given prefix.

fn clear_child_prefix(
    &mut self,
    storage_key: ChildStorageKey,
    _child_info: ChildInfo,
    prefix: &[u8]
)

Clear child storage entries which keys are start with the given prefix.

fn chain_id(&self) -> u64

Get the identity of the chain.

fn storage_root(&mut self) -> Vec<u8>

Get the trie root of the current storage map. This will also update all child storage keys in the top-level storage map.

fn child_storage_root(&mut self, storage_key: ChildStorageKey) -> Vec<u8>

Get the trie root of a child storage map. This will also update the value of the child storage keys in the top-level storage map. If the storage root equals the default hash as defined by the trie, the key in the top-level storage map will be removed.

fn storage_changes_root(
    &mut self,
    _parent: &[u8]
) -> Result<Option<Vec<u8>>, ()>

Get the change trie root of the current storage overlay at a block with given parent. parent is expects a SCALE endcoded hash.

fn set_storage(&mut self, key: Vec<u8>, value: Vec<u8>)

Set storage entry key of current contract being called (effective immediately).

fn set_child_storage(
    &mut self,
    storage_key: ChildStorageKey,
    child_info: ChildInfo,
    key: Vec<u8>,
    value: Vec<u8>
)

Set child storage entry key of current contract being called (effective immediately).

fn clear_storage(&mut self, key: &[u8])

Clear a storage entry (key) of current contract being called (effective immediately).

fn clear_child_storage(
    &mut self,
    storage_key: ChildStorageKey,
    child_info: ChildInfo,
    key: &[u8]
)

Clear a child storage entry (key) of current contract being called (effective immediately).

fn exists_storage(&self, key: &[u8]) -> bool

Whether a storage entry exists.

fn exists_child_storage(
    &self,
    storage_key: ChildStorageKey,
    child_info: ChildInfo,
    key: &[u8]
) -> bool

Whether a child storage entry exists.

impl From<BTreeMap<Vec<u8>, Vec<u8>>> for BasicExternalities

fn from(hashmap: BTreeMap<Vec<u8>, Vec<u8>>) -> Self

Performs the conversion.

impl FromIterator<(Vec<u8>, Vec<u8>)> for BasicExternalities

fn from_iter<I: IntoIterator<Item = (Vec<u8>, Vec<u8>)>>(iter: I) -> Self

Creates a value from an iterator.

impl PartialEq<BasicExternalities> for BasicExternalities

fn eq(&self, other: &BasicExternalities) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use] fn ne(&self, other: &Rhs) -> bool

This method tests for !=.