pub struct Coordinator<T: NodeType, S> {Show 42 fields
membership_coordinator: EpochMembershipCoordinator<T>,
consensus: Consensus<T>,
network: Cliquenet<T>,
state_manager: StateManager<T>,
client: CoordinatorClient<T>,
vid_disperser: VidDisperser<T>,
vid_reconstructor: VidReconstructor<T>,
vid_fragment_accumulator: VidFragmentAccumulator<T>,
vote1_collector: VoteCollector<T, SimpleTally<T, QuorumVote2<T>, SuccessThreshold>>,
vote2_collector: VoteCollector<T, SimpleTally<T, Vote2<T>, SuccessThreshold>>,
timeout_collector: VoteCollector<T, SimpleTally<T, TimeoutVote2<T>, SuccessThreshold>>,
timeout_one_honest_collector: VoteCollector<T, SimpleTally<T, TimeoutVote2<T>, OneHonestThreshold>>,
timeout3_collector: VoteCollector<T, TimeoutTally<T, SuccessThreshold>>,
timeout_one_honest3_collector: VoteCollector<T, TimeoutTally<T, OneHonestThreshold>>,
epoch_root_collector: VoteCollector<T, EpochRootTally<T>>,
upgrade_vote_collector: VoteCollector<T, UpgradeTally<T>>,
upgrade_protocol: UpgradeProtocol<T>,
cert_verifiers: CertVerifiers<T>,
epoch_manager: EpochManager<T>,
block_builder: BlockBuilder<T>,
proposal_validator: ProposalValidator<T>,
share_validator: VidShareValidator<T>,
storage: Storage<T, S>,
outbox: Outbox<ConsensusOutput<T>>,
external_tx: UnboundedSender<OpaqueMessage<T::SignatureKey>>,
public_key: T::SignatureKey,
node_id: KeyPrefix,
timer: Timer,
pending_proposal_fetches: PendingProposalFetches<T>,
requested_missing_proposals: HashMap<ProposalFetchKey<T>, ViewNumber>,
fetcher: Fetcher<T>,
server: Server<T>,
da_payloads: BTreeMap<(ViewNumber, VidCommitment2), PendingDa<T>>,
built_dispersals: BTreeMap<(ViewNumber, EpochNumber, VidCommitment2), BuiltDispersal<T>>,
metrics: Option<Metrics>,
participation: ParticipationTracker<T>,
voted_view: Option<ViewNumber>,
last_timeout_view: Option<ViewNumber>,
view_started: Option<(ViewNumber, EpochNumber, Instant)>,
proposal_received_at: Option<(ViewNumber, Instant)>,
invalid_certs_at_decide: u64,
payload_txn_bytes: BTreeMap<ViewNumber, usize>,
}Fields§
§membership_coordinator: EpochMembershipCoordinator<T>§consensus: Consensus<T>§network: Cliquenet<T>§state_manager: StateManager<T>§client: CoordinatorClient<T>§vid_disperser: VidDisperser<T>§vid_reconstructor: VidReconstructor<T>§vid_fragment_accumulator: VidFragmentAccumulator<T>§vote1_collector: VoteCollector<T, SimpleTally<T, QuorumVote2<T>, SuccessThreshold>>§vote2_collector: VoteCollector<T, SimpleTally<T, Vote2<T>, SuccessThreshold>>§timeout_collector: VoteCollector<T, SimpleTally<T, TimeoutVote2<T>, SuccessThreshold>>§timeout_one_honest_collector: VoteCollector<T, SimpleTally<T, TimeoutVote2<T>, OneHonestThreshold>>§timeout3_collector: VoteCollector<T, TimeoutTally<T, SuccessThreshold>>§timeout_one_honest3_collector: VoteCollector<T, TimeoutTally<T, OneHonestThreshold>>§epoch_root_collector: VoteCollector<T, EpochRootTally<T>>§upgrade_vote_collector: VoteCollector<T, UpgradeTally<T>>§upgrade_protocol: UpgradeProtocol<T>§cert_verifiers: CertVerifiers<T>§epoch_manager: EpochManager<T>§block_builder: BlockBuilder<T>§proposal_validator: ProposalValidator<T>§storage: Storage<T, S>§outbox: Outbox<ConsensusOutput<T>>§external_tx: UnboundedSender<OpaqueMessage<T::SignatureKey>>Forwards external messages on arrival, independent of consensus inputs.
public_key: T::SignatureKey§node_id: KeyPrefix§timer: Timer§pending_proposal_fetches: PendingProposalFetches<T>§requested_missing_proposals: HashMap<ProposalFetchKey<T>, ViewNumber>Proposals asked for, with the view this node was in when it last asked.
fetcher: Fetcher<T>§server: Server<T>§da_payloads: BTreeMap<(ViewNumber, VidCommitment2), PendingDa<T>>§built_dispersals: BTreeMap<(ViewNumber, EpochNumber, VidCommitment2), BuiltDispersal<T>>Dispersals the block builder computed, until consensus asks to disperse their block.
metrics: Option<Metrics>§participation: ParticipationTracker<T>§voted_view: Option<ViewNumber>§last_timeout_view: Option<ViewNumber>View of the last timer fire that counted towards participation and timeout metrics, so a re-fire for the same (stuck) view doesn’t double-count it.
view_started: Option<(ViewNumber, EpochNumber, Instant)>§proposal_received_at: Option<(ViewNumber, Instant)>§invalid_certs_at_decide: u64§payload_txn_bytes: BTreeMap<ViewNumber, usize>Implementations§
Source§impl<T: NodeType, S> Coordinator<T, S>
impl<T: NodeType, S> Coordinator<T, S>
Sourcepub fn builder() -> CoordinatorBuilder<T, S>
pub fn builder() -> CoordinatorBuilder<T, S>
Create an instance of Coordinator using the builder syntax
Source§impl<T, S> Coordinator<T, S>where
T: NodeType,
S: NewProtocolStorage<T>,
impl<T, S> Coordinator<T, S>where
T: NodeType,
S: NewProtocolStorage<T>,
Sourcepub fn start(&mut self)
pub fn start(&mut self)
Emit ViewChanged(current_view + 1) and, if leader, a
RequestBlockAndHeader.
pub async fn stop(self)
pub async fn next_consensus_input( &mut self, ) -> Result<ConsensusInput<T>, CoordinatorError>
fn on_payload_obtained(&mut self, out: ObtainedPayload<T>) -> ConsensusInput<T>
pub fn apply_consensus(&mut self, input: ConsensusInput<T>)
pub fn process_consensus_output( &mut self, output: ConsensusOutput<T>, ) -> Result<(), CoordinatorError>
pub fn node_id(&self) -> &KeyPrefix
pub fn outbox(&self) -> &Outbox<ConsensusOutput<T>>
pub fn outbox_mut(&mut self) -> &mut Outbox<ConsensusOutput<T>>
pub fn current_view(&self) -> ViewNumber
pub fn last_decided_leaf(&self) -> &Leaf2<T>
pub fn state(&self, v: ViewNumber) -> Option<&StateEntry<T>>
pub fn client_api(&self) -> &ClientApi<T>
Sourcepub fn bump_network_epoch(&mut self, epoch: EpochNumber)
pub fn bump_network_epoch(&mut self, epoch: EpochNumber)
Refresh the network’s peer window for epoch.
The coordinator does this itself whenever a proposal validates, but before its event loop is started callers can trigger this explicitly to keep the network up to date.
pub(crate) fn on_network_message( &mut self, message: Message<T, Unchecked>, ) -> Option<ConsensusInput<T>>
fn on_state_manager_output( &mut self, output: StateManagerOutput<T>, ) -> Option<ConsensusInput<T>>
Sourcefn slot_for(&self, view: ViewNumber) -> ViewNumber
fn slot_for(&self, view: ViewNumber) -> ViewNumber
The slot for a message about view.
A node can send a message about a later view than its own: it enters a view only after rebuilding the parent block. Every view change drops queued messages more than one slot below the new view, so such a message takes its own view to survive the view changes the node still has to make. A message about an earlier view takes the current view, which is never below that bound.
fn broadcast_in( &self, slot: ViewNumber, message_type: impl Into<MessageType<T, Validated>>, ctx: &'static str, ) -> Result<(), CoordinatorError>
fn unicast_in( &self, slot: ViewNumber, recipient: &T::SignatureKey, message_type: impl Into<MessageType<T, Validated>>, ctx: &'static str, ) -> Result<(), CoordinatorError>
Sourcefn send_transactions(
&mut self,
forward: TransactionMessage<T>,
epoch: EpochNumber,
) -> Result<(), CoordinatorError>
fn send_transactions( &mut self, forward: TransactionMessage<T>, epoch: EpochNumber, ) -> Result<(), CoordinatorError>
Sends forward to the leaders of the fanout views from its own, each leader once with
the earliest of its views.
Sourcefn upcoming_leaders(
&mut self,
first: ViewNumber,
count: u64,
epoch: EpochNumber,
) -> Vec<(ViewNumber, T::SignatureKey)>
fn upcoming_leaders( &mut self, first: ViewNumber, count: u64, epoch: EpochNumber, ) -> Vec<(ViewNumber, T::SignatureKey)>
The leaders of the count views from first, each once with the earliest of its views.
Sourcefn upcoming_leader(
&mut self,
view: ViewNumber,
epoch: EpochNumber,
) -> Option<T::SignatureKey>
fn upcoming_leader( &mut self, view: ViewNumber, epoch: EpochNumber, ) -> Option<T::SignatureKey>
The leader of an upcoming view. Consensus picks it with the epoch of the block it
proposes, which is the next epoch when that block builds on its epoch’s last block. Timed
out views add no block, so the latest proposal is the best guess for that parent. epoch
is the fallback when there is no proposal yet or its epoch’s stake table is unknown.
fn leader( &mut self, view: ViewNumber, epoch: EpochNumber, ) -> Option<T::SignatureKey>
fn on_client_request( &mut self, request: ClientRequest<T>, ) -> Result<(), CoordinatorError>
fn record_voted_view(&mut self, view: ViewNumber)
fn on_view_changed_metrics(&mut self, view: ViewNumber, epoch: EpochNumber)
fn on_decide_metrics(&mut self, leaves: &[Leaf2<T>])
Sourcefn broadcast_proposal_fetch(
&mut self,
view: ViewNumber,
) -> Result<(), CoordinatorError>
fn broadcast_proposal_fetch( &mut self, view: ViewNumber, ) -> Result<(), CoordinatorError>
Broadcast a signed proposal fetch request for view to all peers.
fn request_missing_proposal( &mut self, view: ViewNumber, leaf_commit: Commitment<Leaf2<T>>, ) -> Result<(), CoordinatorError>
fn maybe_validate_fetched_proposal( &mut self, proposal: SignedProposal<T, Proposal<T>>, )
Sourcefn notify_vid_reconstructor(
&mut self,
proposal: &Proposal<T>,
pinned_by: PinnedBy,
)
fn notify_vid_reconstructor( &mut self, proposal: &Proposal<T>, pinned_by: PinnedBy, )
Pin the reconstructor to proposal’s payload commitment, so the shares
the voters broadcast for its view can rebuild the payload.
fn gc( &mut self, epoch: EpochNumber, scope: GcScope, ) -> Result<(), CoordinatorError>
Sourcefn is_view_too_far_ahead(&self, v: ViewNumber) -> bool
fn is_view_too_far_ahead(&self, v: ViewNumber) -> bool
We ignore votes more than MAX_VIEWS_AHEAD ahead of ours.
Sourcefn is_vote_epoch_admissible(&self, epoch: Option<EpochNumber>) -> bool
fn is_vote_epoch_admissible(&self, epoch: Option<EpochNumber>) -> bool
Is epoch close enough to the node’s own to tally a vote naming it?
Sourcefn is_epoch_too_far_ahead(&self, epoch: Option<EpochNumber>) -> bool
fn is_epoch_too_far_ahead(&self, epoch: Option<EpochNumber>) -> bool
We ignore messages more than EPOCH_CHANGE_LOOKAHEAD ahead of ours.
Sourcefn is_epoch_too_far_behind(&self, epoch: EpochNumber) -> bool
fn is_epoch_too_far_behind(&self, epoch: EpochNumber) -> bool
We ignore messages more than EPOCH_CHANGE_LOOKBEHIND behind ours.
Sourcefn is_fragment_epoch_admissible(&self, epoch: EpochNumber) -> bool
fn is_fragment_epoch_admissible(&self, epoch: EpochNumber) -> bool
Is epoch close enough to the node’s own to buffer a fragment naming it?
pub(crate) fn catchup_evidence(&self) -> Option<ConsensusMessage<T, Validated>>
fn on_timeout_vote( &mut self, sender: &T::SignatureKey, vote: TimeoutVote<T>, evidence: Option<CatchupEvidence<T>>, )
Sourcefn verify_advance(
&mut self,
sender: &T::SignatureKey,
qc: Certificate1<T>,
) -> Option<EpochNumber>
fn verify_advance( &mut self, sender: &T::SignatureKey, qc: Certificate1<T>, ) -> Option<EpochNumber>
Submit a Cert1 that would advance our view for verification.
A certificate at the genesis view passes the verifier unsigned, which is right only for the genesis QC, so any other one claiming that view is dropped here. Dropping it before verification rather than in consensus also keeps it out of the verifier’s completed keys, where a forgery naming the genesis epoch would shadow the genesis QC itself.
fn verify_timeout_cert( &mut self, sender: &T::SignatureKey, tc: TimeoutCertificate2<T>, ) -> Option<EpochNumber>
fn verify_timeout_cert3( &mut self, sender: &T::SignatureKey, tc: TimeoutCertificate3<T>, ) -> Option<EpochNumber>
fn send_epoch_change(&mut self, peer: &T::SignatureKey, epoch: EpochNumber)
fn send_catchup_evidence( &mut self, peer: &T::SignatureKey, stale_view: ViewNumber, )
pub fn maker<'f1, 'f2>() -> CoordinatorMaker<'f1, 'f2, T, S>
Auto Trait Implementations§
impl<T, S> !RefUnwindSafe for Coordinator<T, S>
impl<T, S> !UnwindSafe for Coordinator<T, S>
impl<T, S> Freeze for Coordinator<T, S>where
<T as NodeType>::SignatureKey: Freeze,
<<T as NodeType>::SignatureKey as SignatureKey>::PrivateKey: Freeze,
<<T as NodeType>::StateSignatureKey as StateSignatureKey>::StatePrivateKey: Freeze,
S: Freeze,
<T as NodeType>::BlockHeader: Freeze,
<T as NodeType>::BlockPayload: Freeze,
<<T as NodeType>::SignatureKey as SignatureKey>::QcType: Freeze,
impl<T, S> Send for Coordinator<T, S>where
S: Send,
impl<T, S> Sync for Coordinator<T, S>where
S: Sync,
impl<T, S> Unpin for Coordinator<T, S>where
<T as NodeType>::SignatureKey: Unpin,
<<T as NodeType>::SignatureKey as SignatureKey>::PrivateKey: Unpin,
<<T as NodeType>::StateSignatureKey as StateSignatureKey>::StatePrivateKey: Unpin,
S: Unpin,
<T as NodeType>::BlockHeader: Unpin,
<T as NodeType>::BlockPayload: Unpin,
<<T as NodeType>::SignatureKey as SignatureKey>::QcType: Unpin,
T: Unpin,
<<T as NodeType>::BlockPayload as BlockPayload<T>>::Metadata: Unpin,
<<T as NodeType>::SignatureKey as SignatureKey>::PureAssembledSignatureType: Unpin,
<T as NodeType>::Transaction: Unpin,
<<T as NodeType>::SignatureKey as SignatureKey>::StakeTableEntry: Unpin,
<T as NodeType>::StateSignatureKey: Unpin,
<<T as NodeType>::SignatureKey as SignatureKey>::VerificationKeyType: Unpin,
<<T as NodeType>::StateSignatureKey as StateSignatureKey>::StateSignature: Unpin,
<T as NodeType>::BuilderSignatureKey: Unpin,
<<T as NodeType>::BuilderSignatureKey as BuilderSignatureKey>::BuilderSignature: Unpin,
impl<T, S> UnsafeUnpin for Coordinator<T, S>where
<T as NodeType>::SignatureKey: UnsafeUnpin,
<<T as NodeType>::SignatureKey as SignatureKey>::PrivateKey: UnsafeUnpin,
<<T as NodeType>::StateSignatureKey as StateSignatureKey>::StatePrivateKey: UnsafeUnpin,
S: UnsafeUnpin,
<T as NodeType>::BlockHeader: UnsafeUnpin,
<T as NodeType>::BlockPayload: UnsafeUnpin,
<<T as NodeType>::SignatureKey as SignatureKey>::QcType: UnsafeUnpin,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
§impl<T> Conv for T
impl<T> Conv for T
§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> ⓘ
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> 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> Read<Exclusive, BecauseExclusive> 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.