Struct scrypto_test::prelude::Heap

pub struct Heap {
    nodes: NonIterMap<NodeId, BTreeMap<PartitionNumber, BTreeMap<SubstateKey, IndexedScryptoValue>>>,
}

Fields

nodes: NonIterMap<NodeId, BTreeMap<PartitionNumber, BTreeMap<SubstateKey, IndexedScryptoValue>>>

Implementations

impl Heap

pub fn new() -> Heap

pub fn is_empty(&self) -> bool

pub fn remove_partition<E, F>( &mut self, node_id: &NodeId, partition_number: PartitionNumber, on_io_access: &mut F ) -> Result<BTreeMap<SubstateKey, IndexedScryptoValue>, CallbackError<HeapRemovePartitionError, E>>

where F: FnMut(&Heap, IOAccess) -> Result<(), E>,

pub fn get_substate( &self, node_id: &NodeId, partition_num: PartitionNumber, substate_key: &SubstateKey ) -> Option<&IndexedScryptoValue>

Reads a substate

pub fn set_substate<E, F>( &mut self, node_id: NodeId, partition_number: PartitionNumber, substate_key: SubstateKey, substate_value: IndexedScryptoValue, on_io_access: &mut F ) -> Result<(), E>

where F: FnMut(&Heap, IOAccess) -> Result<(), E>,

Inserts or overwrites a substate

pub fn remove_substate<E, F>( &mut self, node_id: &NodeId, partition_number: PartitionNumber, substate_key: &SubstateKey, on_io_access: &mut F ) -> Result<Option<IndexedScryptoValue>, E>

where F: FnMut(&Heap, IOAccess) -> Result<(), E>,

pub fn scan_keys( &self, node_id: &NodeId, partition_num: PartitionNumber, count: u32 ) -> Vec<SubstateKey>

Scans the keys of a node’s partition. On an non-existing node/partition, this will return an empty vector

pub fn drain_substates<E, F>( &mut self, node_id: &NodeId, partition_number: PartitionNumber, count: u32, on_io_access: &mut F ) -> Result<Vec<(SubstateKey, IndexedScryptoValue)>, E>

where F: FnMut(&Heap, IOAccess) -> Result<(), E>,

Drains the substates from a node’s partition. On an non-existing node/partition, this will return an empty vector

pub fn create_node<E, F>( &mut self, node_id: NodeId, substates: BTreeMap<PartitionNumber, BTreeMap<SubstateKey, IndexedScryptoValue>>, on_io_access: &mut F ) -> Result<(), E>

where F: FnMut(&Heap, IOAccess) -> Result<(), E>,

Inserts a new node to heap.

pub fn remove_node<E, F>( &mut self, node_id: &NodeId, on_io_access: &mut F ) -> Result<BTreeMap<PartitionNumber, BTreeMap<SubstateKey, IndexedScryptoValue>>, CallbackError<HeapRemoveNodeError, E>>

where F: FnMut(&Heap, IOAccess) -> Result<(), E>,

Removes node.