pub struct SqliteShardStore<C, H, const SHARD_HEIGHT: u8> { /* private fields */ }Expand description
An implementation of ShardStore backed by an SQLite database.
Trait Implementations§
Source§impl<'conn, 'a: 'conn, H: HashSer, const SHARD_HEIGHT: u8> ShardStore for SqliteShardStore<&'a Transaction<'conn>, H, SHARD_HEIGHT>
impl<'conn, 'a: 'conn, H: HashSer, const SHARD_HEIGHT: u8> ShardStore for SqliteShardStore<&'a Transaction<'conn>, H, SHARD_HEIGHT>
Source§type CheckpointId = BlockHeight
type CheckpointId = BlockHeight
The type used to identify checkpointed positions in the tree.
Source§fn get_shard(
&self,
shard_root: Address,
) -> Result<Option<LocatedPrunableTree<Self::H>>, Self::Error>
fn get_shard( &self, shard_root: Address, ) -> Result<Option<LocatedPrunableTree<Self::H>>, Self::Error>
Returns the subtree at the given root address, if any such subtree exists.
Source§fn last_shard(
&self,
) -> Result<Option<LocatedPrunableTree<Self::H>>, Self::Error>
fn last_shard( &self, ) -> Result<Option<LocatedPrunableTree<Self::H>>, Self::Error>
Returns the subtree containing the maximum inserted leaf position.
Source§fn put_shard(
&mut self,
subtree: LocatedPrunableTree<Self::H>,
) -> Result<(), Self::Error>
fn put_shard( &mut self, subtree: LocatedPrunableTree<Self::H>, ) -> Result<(), Self::Error>
Inserts or replaces the subtree having the same root address as the provided tree. Read more
Source§fn get_shard_roots(&self) -> Result<Vec<Address>, Self::Error>
fn get_shard_roots(&self) -> Result<Vec<Address>, Self::Error>
Returns the vector of addresses corresponding to the roots of subtrees stored in this
store.
Source§fn truncate_shards(&mut self, shard_index: u64) -> Result<(), Self::Error>
fn truncate_shards(&mut self, shard_index: u64) -> Result<(), Self::Error>
Removes subtrees from the underlying store having root addresses at indices greater
than or equal to that of the specified index.
Source§fn get_cap(&self) -> Result<PrunableTree<Self::H>, Self::Error>
fn get_cap(&self) -> Result<PrunableTree<Self::H>, Self::Error>
A tree that is used to cache the known roots of subtrees in the “cap” - the top part of the
tree, which contains parent nodes produced by hashing the roots of the individual shards.
Nodes in the cap have levels in the range
SHARD_HEIGHT..DEPTH. Note that the cap may be
sparse, in the same way that individual shards may be sparse.Source§fn put_cap(&mut self, cap: PrunableTree<Self::H>) -> Result<(), Self::Error>
fn put_cap(&mut self, cap: PrunableTree<Self::H>) -> Result<(), Self::Error>
Persists the provided cap to the data store.
Source§fn min_checkpoint_id(&self) -> Result<Option<Self::CheckpointId>, Self::Error>
fn min_checkpoint_id(&self) -> Result<Option<Self::CheckpointId>, Self::Error>
Returns the identifier for the checkpoint with the lowest associated position value.
Source§fn max_checkpoint_id(&self) -> Result<Option<Self::CheckpointId>, Self::Error>
fn max_checkpoint_id(&self) -> Result<Option<Self::CheckpointId>, Self::Error>
Returns the identifier for the checkpoint with the highest associated position value.
Source§fn add_checkpoint(
&mut self,
checkpoint_id: Self::CheckpointId,
checkpoint: Checkpoint,
) -> Result<(), Self::Error>
fn add_checkpoint( &mut self, checkpoint_id: Self::CheckpointId, checkpoint: Checkpoint, ) -> Result<(), Self::Error>
Adds a checkpoint to the data store.
Source§fn checkpoint_count(&self) -> Result<usize, Self::Error>
fn checkpoint_count(&self) -> Result<usize, Self::Error>
Returns the number of checkpoints maintained by the data store
Source§fn get_checkpoint_at_depth(
&self,
checkpoint_depth: usize,
) -> Result<Option<(Self::CheckpointId, Checkpoint)>, Self::Error>
fn get_checkpoint_at_depth( &self, checkpoint_depth: usize, ) -> Result<Option<(Self::CheckpointId, Checkpoint)>, Self::Error>
Returns the id and position of the checkpoint at the specified depth, if it exists. Read more
Source§fn get_checkpoint(
&self,
checkpoint_id: &Self::CheckpointId,
) -> Result<Option<Checkpoint>, Self::Error>
fn get_checkpoint( &self, checkpoint_id: &Self::CheckpointId, ) -> Result<Option<Checkpoint>, Self::Error>
Returns the checkpoint corresponding to the specified checkpoint identifier.
Source§fn with_checkpoints<F>(
&mut self,
limit: usize,
callback: F,
) -> Result<(), Self::Error>
fn with_checkpoints<F>( &mut self, limit: usize, callback: F, ) -> Result<(), Self::Error>
Iterates in checkpoint ID order over the first
limit checkpoints, applying the
given callback to each.Source§fn for_each_checkpoint<F>(
&self,
limit: usize,
callback: F,
) -> Result<(), Self::Error>
fn for_each_checkpoint<F>( &self, limit: usize, callback: F, ) -> Result<(), Self::Error>
Calls the given callback for each checkpoint in
CheckpointId order. This is
essentially the immutable version of with_checkpoints.Source§fn update_checkpoint_with<F>(
&mut self,
checkpoint_id: &Self::CheckpointId,
update: F,
) -> Result<bool, Self::Error>
fn update_checkpoint_with<F>( &mut self, checkpoint_id: &Self::CheckpointId, update: F, ) -> Result<bool, Self::Error>
Update the checkpoint having the given identifier by mutating it with the provided
function, and persist the updated checkpoint to the data store. Read more
Source§fn remove_checkpoint(
&mut self,
checkpoint_id: &Self::CheckpointId,
) -> Result<(), Self::Error>
fn remove_checkpoint( &mut self, checkpoint_id: &Self::CheckpointId, ) -> Result<(), Self::Error>
Removes a checkpoint from the data store. Read more
Source§fn add_retained_checkpoint(
&mut self,
checkpoint_id: Self::CheckpointId,
) -> Result<(), Self::Error>
fn add_retained_checkpoint( &mut self, checkpoint_id: Self::CheckpointId, ) -> Result<(), Self::Error>
Adds the given checkpoint identifier to the set of checkpoints that must be retained when
pruning excess checkpoints. Read more
Source§fn remove_retained_checkpoint(
&mut self,
checkpoint_id: &Self::CheckpointId,
) -> Result<(), Self::Error>
fn remove_retained_checkpoint( &mut self, checkpoint_id: &Self::CheckpointId, ) -> Result<(), Self::Error>
Removes the given checkpoint identifier from the set of retained checkpoints, allowing it to
be pruned normally. Has no effect if the identifier is not in the retention set.
Source§fn retained_checkpoints(
&self,
) -> Result<BTreeSet<Self::CheckpointId>, Self::Error>
fn retained_checkpoints( &self, ) -> Result<BTreeSet<Self::CheckpointId>, Self::Error>
Returns the set of checkpoint identifiers that have been marked for retention via
ShardStore::add_retained_checkpoint.Source§fn truncate_checkpoints_retaining(
&mut self,
checkpoint_id: &Self::CheckpointId,
) -> Result<(), Self::Error>
fn truncate_checkpoints_retaining( &mut self, checkpoint_id: &Self::CheckpointId, ) -> Result<(), Self::Error>
Removes checkpoints with identifiers greater than to the given identifier, and removes mark
removal metadata from the specified checkpoint.
Source§impl<H: HashSer, const SHARD_HEIGHT: u8> ShardStore for SqliteShardStore<Connection, H, SHARD_HEIGHT>
impl<H: HashSer, const SHARD_HEIGHT: u8> ShardStore for SqliteShardStore<Connection, H, SHARD_HEIGHT>
Source§type CheckpointId = BlockHeight
type CheckpointId = BlockHeight
The type used to identify checkpointed positions in the tree.
Source§fn get_shard(
&self,
shard_root: Address,
) -> Result<Option<LocatedPrunableTree<Self::H>>, Self::Error>
fn get_shard( &self, shard_root: Address, ) -> Result<Option<LocatedPrunableTree<Self::H>>, Self::Error>
Returns the subtree at the given root address, if any such subtree exists.
Source§fn last_shard(
&self,
) -> Result<Option<LocatedPrunableTree<Self::H>>, Self::Error>
fn last_shard( &self, ) -> Result<Option<LocatedPrunableTree<Self::H>>, Self::Error>
Returns the subtree containing the maximum inserted leaf position.
Source§fn put_shard(
&mut self,
subtree: LocatedPrunableTree<Self::H>,
) -> Result<(), Self::Error>
fn put_shard( &mut self, subtree: LocatedPrunableTree<Self::H>, ) -> Result<(), Self::Error>
Inserts or replaces the subtree having the same root address as the provided tree. Read more
Source§fn get_shard_roots(&self) -> Result<Vec<Address>, Self::Error>
fn get_shard_roots(&self) -> Result<Vec<Address>, Self::Error>
Returns the vector of addresses corresponding to the roots of subtrees stored in this
store.
Source§fn truncate_shards(&mut self, shard_index: u64) -> Result<(), Self::Error>
fn truncate_shards(&mut self, shard_index: u64) -> Result<(), Self::Error>
Removes subtrees from the underlying store having root addresses at indices greater
than or equal to that of the specified index.
Source§fn get_cap(&self) -> Result<PrunableTree<Self::H>, Self::Error>
fn get_cap(&self) -> Result<PrunableTree<Self::H>, Self::Error>
A tree that is used to cache the known roots of subtrees in the “cap” - the top part of the
tree, which contains parent nodes produced by hashing the roots of the individual shards.
Nodes in the cap have levels in the range
SHARD_HEIGHT..DEPTH. Note that the cap may be
sparse, in the same way that individual shards may be sparse.Source§fn put_cap(&mut self, cap: PrunableTree<Self::H>) -> Result<(), Self::Error>
fn put_cap(&mut self, cap: PrunableTree<Self::H>) -> Result<(), Self::Error>
Persists the provided cap to the data store.
Source§fn min_checkpoint_id(&self) -> Result<Option<Self::CheckpointId>, Self::Error>
fn min_checkpoint_id(&self) -> Result<Option<Self::CheckpointId>, Self::Error>
Returns the identifier for the checkpoint with the lowest associated position value.
Source§fn max_checkpoint_id(&self) -> Result<Option<Self::CheckpointId>, Self::Error>
fn max_checkpoint_id(&self) -> Result<Option<Self::CheckpointId>, Self::Error>
Returns the identifier for the checkpoint with the highest associated position value.
Source§fn add_checkpoint(
&mut self,
checkpoint_id: Self::CheckpointId,
checkpoint: Checkpoint,
) -> Result<(), Self::Error>
fn add_checkpoint( &mut self, checkpoint_id: Self::CheckpointId, checkpoint: Checkpoint, ) -> Result<(), Self::Error>
Adds a checkpoint to the data store.
Source§fn checkpoint_count(&self) -> Result<usize, Self::Error>
fn checkpoint_count(&self) -> Result<usize, Self::Error>
Returns the number of checkpoints maintained by the data store
Source§fn get_checkpoint_at_depth(
&self,
checkpoint_depth: usize,
) -> Result<Option<(Self::CheckpointId, Checkpoint)>, Self::Error>
fn get_checkpoint_at_depth( &self, checkpoint_depth: usize, ) -> Result<Option<(Self::CheckpointId, Checkpoint)>, Self::Error>
Returns the id and position of the checkpoint at the specified depth, if it exists. Read more
Source§fn get_checkpoint(
&self,
checkpoint_id: &Self::CheckpointId,
) -> Result<Option<Checkpoint>, Self::Error>
fn get_checkpoint( &self, checkpoint_id: &Self::CheckpointId, ) -> Result<Option<Checkpoint>, Self::Error>
Returns the checkpoint corresponding to the specified checkpoint identifier.
Source§fn with_checkpoints<F>(
&mut self,
limit: usize,
callback: F,
) -> Result<(), Self::Error>
fn with_checkpoints<F>( &mut self, limit: usize, callback: F, ) -> Result<(), Self::Error>
Iterates in checkpoint ID order over the first
limit checkpoints, applying the
given callback to each.Source§fn for_each_checkpoint<F>(
&self,
limit: usize,
callback: F,
) -> Result<(), Self::Error>
fn for_each_checkpoint<F>( &self, limit: usize, callback: F, ) -> Result<(), Self::Error>
Calls the given callback for each checkpoint in
CheckpointId order. This is
essentially the immutable version of with_checkpoints.Source§fn update_checkpoint_with<F>(
&mut self,
checkpoint_id: &Self::CheckpointId,
update: F,
) -> Result<bool, Self::Error>
fn update_checkpoint_with<F>( &mut self, checkpoint_id: &Self::CheckpointId, update: F, ) -> Result<bool, Self::Error>
Update the checkpoint having the given identifier by mutating it with the provided
function, and persist the updated checkpoint to the data store. Read more
Source§fn remove_checkpoint(
&mut self,
checkpoint_id: &Self::CheckpointId,
) -> Result<(), Self::Error>
fn remove_checkpoint( &mut self, checkpoint_id: &Self::CheckpointId, ) -> Result<(), Self::Error>
Removes a checkpoint from the data store. Read more
Source§fn add_retained_checkpoint(
&mut self,
checkpoint_id: Self::CheckpointId,
) -> Result<(), Self::Error>
fn add_retained_checkpoint( &mut self, checkpoint_id: Self::CheckpointId, ) -> Result<(), Self::Error>
Adds the given checkpoint identifier to the set of checkpoints that must be retained when
pruning excess checkpoints. Read more
Source§fn remove_retained_checkpoint(
&mut self,
checkpoint_id: &Self::CheckpointId,
) -> Result<(), Self::Error>
fn remove_retained_checkpoint( &mut self, checkpoint_id: &Self::CheckpointId, ) -> Result<(), Self::Error>
Removes the given checkpoint identifier from the set of retained checkpoints, allowing it to
be pruned normally. Has no effect if the identifier is not in the retention set.
Source§fn retained_checkpoints(
&self,
) -> Result<BTreeSet<Self::CheckpointId>, Self::Error>
fn retained_checkpoints( &self, ) -> Result<BTreeSet<Self::CheckpointId>, Self::Error>
Returns the set of checkpoint identifiers that have been marked for retention via
ShardStore::add_retained_checkpoint.Source§fn truncate_checkpoints_retaining(
&mut self,
checkpoint_id: &Self::CheckpointId,
) -> Result<(), Self::Error>
fn truncate_checkpoints_retaining( &mut self, checkpoint_id: &Self::CheckpointId, ) -> Result<(), Self::Error>
Removes checkpoints with identifiers greater than to the given identifier, and removes mark
removal metadata from the specified checkpoint.
Auto Trait Implementations§
impl<C, H, const SHARD_HEIGHT: u8> Freeze for SqliteShardStore<C, H, SHARD_HEIGHT>where
C: Freeze,
impl<C, H, const SHARD_HEIGHT: u8> RefUnwindSafe for SqliteShardStore<C, H, SHARD_HEIGHT>where
C: RefUnwindSafe,
H: RefUnwindSafe,
impl<C, H, const SHARD_HEIGHT: u8> Send for SqliteShardStore<C, H, SHARD_HEIGHT>
impl<C, H, const SHARD_HEIGHT: u8> Sync for SqliteShardStore<C, H, SHARD_HEIGHT>
impl<C, H, const SHARD_HEIGHT: u8> Unpin for SqliteShardStore<C, H, SHARD_HEIGHT>
impl<C, H, const SHARD_HEIGHT: u8> UnsafeUnpin for SqliteShardStore<C, H, SHARD_HEIGHT>where
C: UnsafeUnpin,
impl<C, H, const SHARD_HEIGHT: u8> UnwindSafe for SqliteShardStore<C, H, SHARD_HEIGHT>where
C: UnwindSafe,
H: UnwindSafe,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> FmtForward for T
impl<T> FmtForward for T
Source§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
Causes
self to use its Binary implementation when Debug-formatted.Source§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
Causes
self to use its Display implementation when
Debug-formatted.Source§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
Causes
self to use its LowerExp implementation when
Debug-formatted.Source§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
Causes
self to use its LowerHex implementation when
Debug-formatted.Source§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
Causes
self to use its Octal implementation when Debug-formatted.Source§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
Causes
self to use its Pointer implementation when
Debug-formatted.Source§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
Causes
self to use its UpperExp implementation when
Debug-formatted.Source§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
Causes
self to use its UpperHex implementation when
Debug-formatted.Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
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 moreSource§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
Source§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Pipes by value. This is generally the method you want to use. Read more
Source§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
Borrows
self and passes that borrow into the pipe function. Read moreSource§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
Mutably borrows
self and passes that borrow into the pipe function. Read moreSource§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
Source§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
Source§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
Borrows
self, then passes self.as_ref() into the pipe function.Source§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
Mutably borrows
self, then passes self.as_mut() into the pipe
function.Source§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
Borrows
self, then passes self.deref() into the pipe function.Source§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<T> Tap for T
impl<T> Tap for T
Source§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Immutable access to the
Borrow<B> of a value. Read moreSource§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
Mutable access to the
BorrowMut<B> of a value. Read moreSource§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
Immutable access to the
AsRef<R> view of a value. Read moreSource§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
Mutable access to the
AsMut<R> view of a value. Read moreSource§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Immutable access to the
Deref::Target of a value. Read moreSource§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Mutable access to the
Deref::Target of a value. Read moreSource§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
Calls
.tap() only in debug builds, and is erased in release builds.Source§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
Calls
.tap_mut() only in debug builds, and is erased in release
builds.Source§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
Calls
.tap_borrow() only in debug builds, and is erased in release
builds.Source§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
Calls
.tap_borrow_mut() only in debug builds, and is erased in release
builds.Source§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
Calls
.tap_ref() only in debug builds, and is erased in release
builds.Source§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
Calls
.tap_ref_mut() only in debug builds, and is erased in release
builds.Source§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
Calls
.tap_deref() only in debug builds, and is erased in release
builds.