pub struct MappedTrack<'s, S, M>where
S: SubstateDatabase,
M: DatabaseKeyMapper + 'static,{ /* private fields */ }
Expand description
Transaction-wide states and side effects
Implementations§
Source§impl<'s, S, M> MappedTrack<'s, S, M>where
S: SubstateDatabase,
M: DatabaseKeyMapper,
impl<'s, S, M> MappedTrack<'s, S, M>where
S: SubstateDatabase,
M: DatabaseKeyMapper,
pub fn new(substate_db: &'s S) -> MappedTrack<'s, S, M>
Sourcepub fn revert_non_force_write_changes(&mut self)
pub fn revert_non_force_write_changes(&mut self)
Reverts all non force write changes.
Note that dependencies will never be reverted.
Sourcepub fn finalize(self) -> Result<(TrackedSubstates, &'s S), TrackFinalizeError>
pub fn finalize(self) -> Result<(TrackedSubstates, &'s S), TrackFinalizeError>
Finalizes changes captured by this substate store.
Returns the state changes and dependencies.
Trait Implementations§
Source§impl<'s, S, M> CommitableSubstateStore for MappedTrack<'s, S, M>where
S: SubstateDatabase,
M: DatabaseKeyMapper,
impl<'s, S, M> CommitableSubstateStore for MappedTrack<'s, S, M>where
S: SubstateDatabase,
M: DatabaseKeyMapper,
Source§fn mark_as_transient(
&mut self,
node_id: NodeId,
partition_num: PartitionNumber,
substate_key: SubstateKey,
)
fn mark_as_transient( &mut self, node_id: NodeId, partition_num: PartitionNumber, substate_key: SubstateKey, )
Marks a substate as transient, or a substate which was never and will never be persisted
Source§fn create_node<E, F>(
&mut self,
node_id: NodeId,
node_substates: BTreeMap<PartitionNumber, BTreeMap<SubstateKey, IndexedScryptoValue>>,
on_io_access: &mut F,
) -> Result<(), E>
fn create_node<E, F>( &mut self, node_id: NodeId, node_substates: BTreeMap<PartitionNumber, BTreeMap<SubstateKey, IndexedScryptoValue>>, on_io_access: &mut F, ) -> Result<(), E>
Inserts a node into the substate store. Read more
fn get_tracked_substate_info( &mut self, node_id: &NodeId, partition_num: PartitionNumber, substate_key: &SubstateKey, ) -> TrackedSubstateInfo
fn get_substate<E, F>( &mut self, node_id: &NodeId, partition_num: PartitionNumber, substate_key: &SubstateKey, on_io_access: &mut F, ) -> Result<Option<&IndexedScryptoValue>, E>
Source§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>
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>
Inserts a substate into the substate store. Read more
fn force_write( &mut self, node_id: &NodeId, partition_num: &PartitionNumber, substate_key: &SubstateKey, )
Source§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>
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>
Deletes a substate from the substate store. Read more
Source§fn scan_keys<K, E, F>(
&mut self,
node_id: &NodeId,
partition_number: PartitionNumber,
limit: u32,
on_io_access: &mut F,
) -> Result<Vec<SubstateKey>, E>
fn scan_keys<K, E, F>( &mut self, node_id: &NodeId, partition_number: PartitionNumber, limit: u32, on_io_access: &mut F, ) -> Result<Vec<SubstateKey>, E>
Returns Substate Keys of maximum count for a given partition. Read more
Source§fn drain_substates<K, E, F>(
&mut self,
node_id: &NodeId,
partition_number: PartitionNumber,
limit: u32,
on_io_access: &mut F,
) -> Result<Vec<(SubstateKey, IndexedScryptoValue)>, E>
fn drain_substates<K, E, F>( &mut self, node_id: &NodeId, partition_number: PartitionNumber, limit: u32, on_io_access: &mut F, ) -> Result<Vec<(SubstateKey, IndexedScryptoValue)>, E>
Removes substates of maximum count for a given partition. Read more
Source§fn scan_sorted_substates<E, F>(
&mut self,
node_id: &NodeId,
partition_number: PartitionNumber,
limit: u32,
on_io_access: &mut F,
) -> Result<Vec<(([u8; 2], Vec<u8>), IndexedScryptoValue)>, E>
fn scan_sorted_substates<E, F>( &mut self, node_id: &NodeId, partition_number: PartitionNumber, limit: u32, on_io_access: &mut F, ) -> Result<Vec<(([u8; 2], Vec<u8>), IndexedScryptoValue)>, E>
Returns tuple of substate vector and boolean which is true for the first database access.
Source§fn delete_partition(&mut self, node_id: &NodeId, partition_num: PartitionNumber)
fn delete_partition(&mut self, node_id: &NodeId, partition_num: PartitionNumber)
Note: unstable interface, for intent transaction tracker only
Source§fn get_commit_info(&mut self) -> Vec<StoreCommit>
fn get_commit_info(&mut self) -> Vec<StoreCommit>
Return the commit info
fn read_substate( &mut self, node_id: &NodeId, partition_num: PartitionNumber, substate_key: &SubstateKey, ) -> Option<&IndexedScryptoValue>
Auto Trait Implementations§
impl<'s, S, M> Freeze for MappedTrack<'s, S, M>
impl<'s, S, M> !RefUnwindSafe for MappedTrack<'s, S, M>
impl<'s, S, M> Send for MappedTrack<'s, S, M>
impl<'s, S, M> !Sync for MappedTrack<'s, S, M>
impl<'s, S, M> Unpin for MappedTrack<'s, S, M>where
M: Unpin,
impl<'s, S, M> !UnwindSafe for MappedTrack<'s, S, M>
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, U> ContextualTryInto<U> for Twhere
U: ContextualTryFrom<T>,
impl<T, U> ContextualTryInto<U> for Twhere
U: ContextualTryFrom<T>,
type Error = <U as ContextualTryFrom<T>>::Error
type Context = <U as ContextualTryFrom<T>>::Context
fn contextual_try_into( self, context: &<U as ContextualTryFrom<T>>::Context, ) -> Result<U, <U as ContextualTryFrom<T>>::Error>
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more