Struct concordium_std::test_infrastructure::TestStateApi

pub struct TestStateApi { /* private fields */ }

👎Deprecated since 8.1.0: Deprecated in favor of concordium-smart-contract-testing.

A state api used for testing. Implements HasStateApi.

Implementations

impl TestStateApi

pub fn new() -> Self

👎Deprecated since 8.1.0: Deprecated in favor of concordium-smart-contract-testing.

Create a new empty state.

Trait Implementations

impl Clone for TestStateApi

fn clone(&self) -> TestStateApi

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TestStateApi

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

Formats the value using the given formatter.

impl Default for TestStateApi

fn default() -> Self

Returns the “default value” for a type.

impl HasStateApi for TestStateApi

type EntryType = TestStateEntry

type IterType = TestStateIter

fn create_entry(&mut self, key: &[u8]) -> Result<Self::EntryType, StateError>

Create a new entry in the state. If an entry with the given key already exists then it is reset to an empty entry. If the part of the tree where the key points to is locked due to an acquired iterator then no entry is created, and an error will be returned.

fn lookup_entry(&self, key: &[u8]) -> Option<Self::EntryType>

Lookup an entry in the state.

fn delete_entry(&mut self, entry: Self::EntryType) -> Result<(), StateError>

Delete an entry. Returns an error if the entry did not exist, or if it is part of a locked subtree.

fn delete_prefix(&mut self, prefix: &[u8]) -> Result<bool, StateError>

Delete the entire subtree. Returns whether any values were deleted, or an error if the given prefix is part of a locked subtree.

fn iterator(&self, prefix: &[u8]) -> Result<Self::IterType, StateError>

Get an iterator over a map in the state.

fn delete_iterator(&mut self, iter: Self::IterType)

Delete an iterator. See the iterator method for why this is necessary.

fn entry<K: AsRef<[u8]> + Into<Key>>(&mut self, key: K) -> EntryRaw<Self>

Like lookup_entry except that it consumes the key and returns an EntryRaw instead of an optional entry.

fn read_root<A: DeserialWithState<Self>>(&self) -> ParseResult<A>

Read and deserialize the state stored at the root of the state trie. If such a state does not exist, or cannot be deserialized into the provided type, then this returns an error.

fn write_root<A: Serial>(&mut self, new_state: &A)

Serialize and write the state at the root of the state trie. Dual to read_root.