pub struct TransactionalTree<'a, V, E, F>(/* private fields */);
Expand description
A transaction that will be applied atomically to the Tree.
Implementations§
Source§impl<'a, V, E, F> ExpiringTransactionalTree<'a, V, E, F>
impl<'a, V, E, F> ExpiringTransactionalTree<'a, V, E, F>
Sourcepub fn insert<K>(
&self,
key: K,
value: V,
) -> ConflictableTransactionResult<Result<Option<V>>>
pub fn insert<K>( &self, key: K, value: V, ) -> ConflictableTransactionResult<Result<Option<V>>>
Set a key to a new value
Sourcepub fn remove<K>(
&self,
key: K,
) -> ConflictableTransactionResult<Result<Option<V>>>
pub fn remove<K>( &self, key: K, ) -> ConflictableTransactionResult<Result<Option<V>>>
Remove a key
Sourcepub fn get<K>(&self, key: K) -> ConflictableTransactionResult<Result<Option<V>>>
pub fn get<K>(&self, key: K) -> ConflictableTransactionResult<Result<Option<V>>>
Get the value associated with a key
Sourcepub fn apply_batch(
&self,
batch: ExpiringBatch<V, F>,
) -> ConflictableTransactionResult<Result<()>>
pub fn apply_batch( &self, batch: ExpiringBatch<V, F>, ) -> ConflictableTransactionResult<Result<()>>
Atomically apply multiple inserts and removals.
Trait Implementations§
Auto Trait Implementations§
impl<'a, V, E, F> Freeze for ExpiringTransactionalTree<'a, V, E, F>
impl<'a, V, E, F> !RefUnwindSafe for ExpiringTransactionalTree<'a, V, E, F>
impl<'a, V, E, F> !Send for ExpiringTransactionalTree<'a, V, E, F>
impl<'a, V, E, F> !Sync for ExpiringTransactionalTree<'a, V, E, F>
impl<'a, V, E, F> Unpin for ExpiringTransactionalTree<'a, V, E, F>
impl<'a, V, E, F> !UnwindSafe for ExpiringTransactionalTree<'a, V, E, F>
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