pub struct Consensus<T: NodeType> {Show 34 fields
proposals: BTreeMap<ViewNumber, Proposal<T>>,
signed_proposals: BTreeMap<ViewNumber, Proposal<T, Proposal<T>>>,
proposed_views: BTreeSet<ViewNumber>,
vid_shares: BTreeMap<ViewNumber, VidDisperseShare2<T>>,
states_verified: BTreeMap<ViewNumber, Commitment<Leaf2<T>>>,
blocks_reconstructed: BTreeMap<ViewNumber, VidCommitment2>,
blocks: BTreeMap<ViewNumber, T::BlockPayload>,
certs: BTreeMap<ViewNumber, Certificate1<T>>,
certs2: BTreeMap<ViewNumber, Certificate2<T>>,
timeout_certs: BTreeMap<ViewNumber, TimeoutCertificate2<T>>,
locked_cert: Option<Certificate1<T>>,
headers: BTreeMap<(ViewNumber, Commitment<Leaf2<T>>), T::BlockHeader>,
leaves: BTreeMap<ViewNumber, Leaf2<T>>,
last_decided_view: ViewNumber,
last_decided_leaf: Leaf2<T>,
drb_results: BTreeMap<EpochNumber, DrbResult>,
voted_1_views: BTreeSet<ViewNumber>,
voted_2_views: BTreeSet<ViewNumber>,
pre_cutover_views: BTreeSet<ViewNumber>,
pending_certs1: BTreeMap<ViewNumber, Certificate1<T>>,
pending_certs2: BTreeMap<ViewNumber, Certificate2<T>>,
timeout_view: ViewNumber,
current_view: ViewNumber,
current_epoch: Option<EpochNumber>,
stake_table_coordinator: EpochMembershipCoordinator<T>,
public_key: T::SignatureKey,
private_key: <T::SignatureKey as SignatureKey>::PrivateKey,
state_private_key: <T::StateSignatureKey as StateSignatureKey>::StatePrivateKey,
stake_table_capacity: usize,
state_certs: BTreeMap<EpochNumber, LightClientStateUpdateCertificateV2<T>>,
node_id: KeyPrefix,
upgrade_lock: UpgradeLock<T>,
garbage_collection_interval: BlockNumber,
pub(crate) epoch_height: BlockNumber,
}Fields§
§proposals: BTreeMap<ViewNumber, Proposal<T>>§signed_proposals: BTreeMap<ViewNumber, Proposal<T, Proposal<T>>>§proposed_views: BTreeSet<ViewNumber>§states_verified: BTreeMap<ViewNumber, Commitment<Leaf2<T>>>§blocks_reconstructed: BTreeMap<ViewNumber, VidCommitment2>§blocks: BTreeMap<ViewNumber, T::BlockPayload>§certs: BTreeMap<ViewNumber, Certificate1<T>>§certs2: BTreeMap<ViewNumber, Certificate2<T>>§timeout_certs: BTreeMap<ViewNumber, TimeoutCertificate2<T>>§locked_cert: Option<Certificate1<T>>§headers: BTreeMap<(ViewNumber, Commitment<Leaf2<T>>), T::BlockHeader>§leaves: BTreeMap<ViewNumber, Leaf2<T>>§last_decided_view: ViewNumber§last_decided_leaf: Leaf2<T>§drb_results: BTreeMap<EpochNumber, DrbResult>§voted_1_views: BTreeSet<ViewNumber>§voted_2_views: BTreeSet<ViewNumber>§pre_cutover_views: BTreeSet<ViewNumber>Skipped by maybe_vote_2_and_update_lock (V1 AvidM dispersal).
pending_certs1: BTreeMap<ViewNumber, Certificate1<T>>Certificates whose epoch membership was not yet available when they arrived. They are retried when new epoch data becomes available.
pending_certs2: BTreeMap<ViewNumber, Certificate2<T>>§timeout_view: ViewNumber§current_view: ViewNumber§current_epoch: Option<EpochNumber>§stake_table_coordinator: EpochMembershipCoordinator<T>§public_key: T::SignatureKey§private_key: <T::SignatureKey as SignatureKey>::PrivateKey§state_private_key: <T::StateSignatureKey as StateSignatureKey>::StatePrivateKey§stake_table_capacity: usize§state_certs: BTreeMap<EpochNumber, LightClientStateUpdateCertificateV2<T>>§node_id: KeyPrefix§upgrade_lock: UpgradeLock<T>§garbage_collection_interval: BlockNumber§epoch_height: BlockNumberImplementations§
Source§impl<T: NodeType> Consensus<T>
impl<T: NodeType> Consensus<T>
pub fn new<B>(
membership_coordinator: EpochMembershipCoordinator<T>,
public_key: T::SignatureKey,
private_key: <T::SignatureKey as SignatureKey>::PrivateKey,
state_private_key: <T::StateSignatureKey as StateSignatureKey>::StatePrivateKey,
stake_table_capacity: usize,
upgrade_lock: UpgradeLock<T>,
genesis_leaf: Leaf2<T>,
epoch_height: B,
garbage_collection_interval: B,
) -> Selfwhere
B: Into<BlockNumber>,
Sourcepub fn seed_genesis(
&mut self,
genesis_cert1: Certificate1<T>,
genesis_proposal: Proposal<T>,
)
pub fn seed_genesis( &mut self, genesis_cert1: Certificate1<T>, genesis_proposal: Proposal<T>, )
Seed the genesis state so that the view-1 leader can propose without any external bootstrap injection.
Stores a genesis certificate and proposal at view 0, sets the locked
certificate, and sets the current epoch. After calling this, a
subsequent apply that triggers maybe_propose(view=1) will find the
parent cert and proposal it needs.
Sourcepub fn apply_pre_cutover_seed(&mut self, seed: PreCutoverSeed<T>)
pub fn apply_pre_cutover_seed(&mut self, seed: PreCutoverSeed<T>)
Apply a PreCutoverSeed to bridge legacy state into the new
protocol. Performs the four operations the seed describes
atomically: anchor the decided view, install the undecided
leaves so they can be decided via Cert2, register the legacy
high_qc, and advance current_view/timeout_view to the
pre-cutover frontier.
Idempotent: calling with the same seed twice (or with an older seed) does not regress decided/locked state.
Sourcepub(crate) fn register_legacy_qc(&mut self, justify_qc: &Certificate1<T>)
pub(crate) fn register_legacy_qc(&mut self, justify_qc: &Certificate1<T>)
Register justify_qc as Cert1 for its parent view (idempotent)
and bump locked_cert if newer.
Sourcepub fn proposal_at(&self, view: ViewNumber) -> Option<&Proposal<T>>
pub fn proposal_at(&self, view: ViewNumber) -> Option<&Proposal<T>>
Return the proposal stored at the given view, if any.
Sourcepub fn cert1_at(&self, view: ViewNumber) -> Option<&Certificate1<T>>
pub fn cert1_at(&self, view: ViewNumber) -> Option<&Certificate1<T>>
Return the Certificate1 (QC) stored at the given view, if any.
pub fn signed_proposal_fetch_request( &self, view: ViewNumber, ) -> Result<ProposalFetchRequest<T>, <T::SignatureKey as SignatureKey>::SignError>
Sourcepub fn cert2_at(&self, view: ViewNumber) -> Option<&Certificate2<T>>
pub fn cert2_at(&self, view: ViewNumber) -> Option<&Certificate2<T>>
Return the Certificate2 stored at the given view, if any.
Sourcepub fn timeout_cert_at(
&self,
view: ViewNumber,
) -> Option<&TimeoutCertificate2<T>>
pub fn timeout_cert_at( &self, view: ViewNumber, ) -> Option<&TimeoutCertificate2<T>>
Return the TimeoutCertificate2 that advanced consensus to view, if
any. Keyed by the view it advanced into (i.e. one greater than the
view it certified as timed out).
Sourcepub fn locked_view(&self) -> Option<ViewNumber>
pub fn locked_view(&self) -> Option<ViewNumber>
Return the view of the locked certificate, if set.
Sourcepub fn apply(
&mut self,
input: ConsensusInput<T>,
outbox: &mut Outbox<ConsensusOutput<T>>,
)
pub fn apply( &mut self, input: ConsensusInput<T>, outbox: &mut Outbox<ConsensusOutput<T>>, )
Apply consensus to the given input and collect protocol outputs.
pub fn last_decided_view(&self) -> ViewNumber
pub fn last_decided_leaf(&self) -> &Leaf2<T>
pub fn undecided_leaves(&self) -> impl Iterator<Item = &Leaf2<T>>
pub fn current_view(&self) -> ViewNumber
pub fn current_epoch(&self) -> Option<EpochNumber>
pub fn set_view(&mut self, view: ViewNumber, epoch: EpochNumber)
pub fn wants_proposal_for_view(&self, view: &ViewNumber) -> bool
pub fn signed_proposal( &self, view: &ViewNumber, ) -> Option<&SignedProposal<T, Proposal<T>>>
pub fn gc(&mut self, view: ViewNumber, _epoch: EpochNumber)
fn handle_certificate1( &mut self, certificate: Certificate1<T>, outbox: &mut Outbox<ConsensusOutput<T>>, ) -> Protocol
fn handle_certificate2( &mut self, certificate: Certificate2<T>, outbox: &mut Outbox<ConsensusOutput<T>>, ) -> Protocol
fn handle_timeout( &mut self, view: ViewNumber, epoch: EpochNumber, outbox: &mut Outbox<ConsensusOutput<T>>, ) -> Protocol
fn handle_timeout_certificate( &mut self, certificate: TimeoutCertificate2<T>, outbox: &mut Outbox<ConsensusOutput<T>>, ) -> Protocol
fn handle_epoch_change( &mut self, epoch_change: EpochChangeMessage<T>, outbox: &mut Outbox<ConsensusOutput<T>>, ) -> Protocol
fn maybe_propose( &mut self, view: ViewNumber, outbox: &mut Outbox<ConsensusOutput<T>>, )
fn maybe_decide( &mut self, view: ViewNumber, outbox: &mut Outbox<ConsensusOutput<T>>, )
Sourcefn build_state_vote(
&self,
proposal: &Proposal<T>,
) -> Result<LightClientStateUpdateVote2<T>>
fn build_state_vote( &self, proposal: &Proposal<T>, ) -> Result<LightClientStateUpdateVote2<T>>
Build a LightClientStateUpdateVote2 for an epoch-root leaf.
Computes the LightClientState from the header, fetches the next-epoch
stake-table commitment, and signs both the LCV2 (pre-upgrade, for
backward compatibility with existing relay infrastructure) and LCV3
(current) Schnorr signatures.
fn maybe_vote_1( &mut self, view: ViewNumber, outbox: &mut Outbox<ConsensusOutput<T>>, )
fn maybe_vote_2_and_update_lock( &mut self, view: ViewNumber, outbox: &mut Outbox<ConsensusOutput<T>>, )
fn is_safe(&self, proposal: &Proposal<T>) -> bool
fn verify_cert<A, C>(&self, cert: &C, epoch: EpochNumber) -> boolwhere
C: Certificate<T, A>,
Sourcefn try_verify_cert<A, C>(
&self,
cert: &C,
epoch: EpochNumber,
) -> CertVerificationwhere
C: Certificate<T, A>,
fn try_verify_cert<A, C>(
&self,
cert: &C,
epoch: EpochNumber,
) -> CertVerificationwhere
C: Certificate<T, A>,
Try to verify a certificate, distinguishing between “epoch not available” and “cryptographically invalid”.
Sourcefn retry_pending_certs(&mut self, outbox: &mut Outbox<ConsensusOutput<T>>)
fn retry_pending_certs(&mut self, outbox: &mut Outbox<ConsensusOutput<T>>)
Retry verification of pending certificates whose epoch may now be available.
fn is_leader(&self, view: ViewNumber, epoch: EpochNumber) -> bool
fn staked_in_epoch(&self, epoch: EpochNumber) -> bool
Auto Trait Implementations§
impl<T> Freeze for Consensus<T>where
<T as NodeType>::SignatureKey: Freeze,
<<T as NodeType>::SignatureKey as SignatureKey>::PrivateKey: Freeze,
<<T as NodeType>::StateSignatureKey as StateSignatureKey>::StatePrivateKey: Freeze,
<T as NodeType>::BlockHeader: Freeze,
<T as NodeType>::BlockPayload: Freeze,
<<T as NodeType>::SignatureKey as SignatureKey>::QcType: Freeze,
impl<T> !RefUnwindSafe for Consensus<T>
impl<T> Send for Consensus<T>
impl<T> Sync for Consensus<T>
impl<T> Unpin for Consensus<T>where
<T as NodeType>::SignatureKey: Unpin,
<<T as NodeType>::SignatureKey as SignatureKey>::PrivateKey: Unpin,
<<T as NodeType>::StateSignatureKey as StateSignatureKey>::StatePrivateKey: Unpin,
<T as NodeType>::BlockHeader: Unpin,
<T as NodeType>::BlockPayload: Unpin,
<<T as NodeType>::SignatureKey as SignatureKey>::QcType: Unpin,
T: Unpin,
impl<T> UnsafeUnpin for Consensus<T>where
<T as NodeType>::SignatureKey: UnsafeUnpin,
<<T as NodeType>::SignatureKey as SignatureKey>::PrivateKey: UnsafeUnpin,
<<T as NodeType>::StateSignatureKey as StateSignatureKey>::StatePrivateKey: UnsafeUnpin,
<T as NodeType>::BlockHeader: UnsafeUnpin,
<T as NodeType>::BlockPayload: UnsafeUnpin,
<<T as NodeType>::SignatureKey as SignatureKey>::QcType: UnsafeUnpin,
impl<T> !UnwindSafe for Consensus<T>
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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
§impl<T> Conv for T
impl<T> Conv for T
§impl<F, W, T, D> Deserialize<With<T, W>, D> for F
impl<F, W, T, D> Deserialize<With<T, W>, D> for F
§fn deserialize(
&self,
deserializer: &mut D,
) -> Result<With<T, W>, <D as Fallible>::Error>
fn deserialize( &self, deserializer: &mut D, ) -> Result<With<T, W>, <D as Fallible>::Error>
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
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.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self to use its Binary implementation when Debug-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self to use its Display implementation when
Debug-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self to use its Octal implementation when Debug-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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>
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>
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§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§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,
self and passes that borrow into the pipe function. Read more§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,
self and passes that borrow into the pipe function. Read more§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
§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
§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
self, then passes self.as_ref() into the pipe function.§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
self, then passes self.as_mut() into the pipe
function.§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
self, then passes self.deref() into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.§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
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.§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
.tap_ref_mut() only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.