pub struct RandomizedCommitteeMembers<T: NodeType, CONFIG: QuorumFilterConfig, DaConfig: QuorumFilterConfig> {
eligible_leaders: Vec<PeerConfig<T>>,
stake_table: Vec<PeerConfig<T>>,
da_stake_table: Vec<PeerConfig<T>>,
indexed_stake_table: BTreeMap<T::SignatureKey, PeerConfig<T>>,
indexed_da_stake_table: BTreeMap<T::SignatureKey, PeerConfig<T>>,
first_epoch: Option<T::Epoch>,
_pd: PhantomData<CONFIG>,
_da_pd: PhantomData<DaConfig>,
}
Expand description
The static committee election
Fields§
§eligible_leaders: Vec<PeerConfig<T>>
The nodes eligible for leadership. NOTE: This is currently a hack because the DA leader needs to be the quorum leader but without voting rights.
stake_table: Vec<PeerConfig<T>>
The nodes on the committee and their stake
da_stake_table: Vec<PeerConfig<T>>
The nodes on the da committee and their stake
indexed_stake_table: BTreeMap<T::SignatureKey, PeerConfig<T>>
The nodes on the committee and their stake, indexed by public key
indexed_da_stake_table: BTreeMap<T::SignatureKey, PeerConfig<T>>
The nodes on the da committee and their stake, indexed by public key
first_epoch: Option<T::Epoch>
The first epoch which will be encountered. For testing, will panic if an epoch-carrying function is called when first_epoch is None or is Some greater than that epoch.
_pd: PhantomData<CONFIG>
Phantom
_da_pd: PhantomData<DaConfig>
Phantom
Implementations§
Source§impl<TYPES: NodeType, CONFIG: QuorumFilterConfig, DaConfig: QuorumFilterConfig> RandomizedCommitteeMembers<TYPES, CONFIG, DaConfig>
impl<TYPES: NodeType, CONFIG: QuorumFilterConfig, DaConfig: QuorumFilterConfig> RandomizedCommitteeMembers<TYPES, CONFIG, DaConfig>
Sourcefn make_quorum_filter(
&self,
epoch: <TYPES as NodeType>::Epoch,
) -> BTreeSet<usize>
fn make_quorum_filter( &self, epoch: <TYPES as NodeType>::Epoch, ) -> BTreeSet<usize>
Creates a set of indices into the stake_table which reference the nodes selected for this epoch’s committee
Sourcefn make_da_quorum_filter(
&self,
epoch: <TYPES as NodeType>::Epoch,
) -> BTreeSet<usize>
fn make_da_quorum_filter( &self, epoch: <TYPES as NodeType>::Epoch, ) -> BTreeSet<usize>
Creates a set of indices into the da_stake_table which reference the nodes selected for this epoch’s da committee
Sourcefn debug_display_offsets(&self)
fn debug_display_offsets(&self)
Writes the offsets used for the quorum filter and da_quorum filter to stdout
Trait Implementations§
Source§impl<T: Clone + NodeType, CONFIG: Clone + QuorumFilterConfig, DaConfig: Clone + QuorumFilterConfig> Clone for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
impl<T: Clone + NodeType, CONFIG: Clone + QuorumFilterConfig, DaConfig: Clone + QuorumFilterConfig> Clone for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
Source§fn clone(&self) -> RandomizedCommitteeMembers<T, CONFIG, DaConfig>
fn clone(&self) -> RandomizedCommitteeMembers<T, CONFIG, DaConfig>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<T: Debug + NodeType, CONFIG: Debug + QuorumFilterConfig, DaConfig: Debug + QuorumFilterConfig> Debug for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
impl<T: Debug + NodeType, CONFIG: Debug + QuorumFilterConfig, DaConfig: Debug + QuorumFilterConfig> Debug for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
Source§impl<T: Hash + NodeType, CONFIG: Hash + QuorumFilterConfig, DaConfig: Hash + QuorumFilterConfig> Hash for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
impl<T: Hash + NodeType, CONFIG: Hash + QuorumFilterConfig, DaConfig: Hash + QuorumFilterConfig> Hash for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
Source§impl<TYPES: NodeType, CONFIG: QuorumFilterConfig, DaConfig: QuorumFilterConfig> Membership<TYPES> for RandomizedCommitteeMembers<TYPES, CONFIG, DaConfig>
impl<TYPES: NodeType, CONFIG: QuorumFilterConfig, DaConfig: QuorumFilterConfig> Membership<TYPES> for RandomizedCommitteeMembers<TYPES, CONFIG, DaConfig>
Source§fn new(
committee_members: Vec<PeerConfig<TYPES>>,
da_members: Vec<PeerConfig<TYPES>>,
) -> Self
fn new( committee_members: Vec<PeerConfig<TYPES>>, da_members: Vec<PeerConfig<TYPES>>, ) -> Self
Create a new election
Source§fn stake_table(
&self,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> HSStakeTable<TYPES>
fn stake_table( &self, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> HSStakeTable<TYPES>
Get the stake table for the current view
Source§fn da_stake_table(
&self,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> HSStakeTable<TYPES>
fn da_stake_table( &self, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> HSStakeTable<TYPES>
Get the da stake table for the current view
Source§fn committee_members(
&self,
_view_number: <TYPES as NodeType>::View,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> BTreeSet<<TYPES as NodeType>::SignatureKey>
fn committee_members( &self, _view_number: <TYPES as NodeType>::View, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> BTreeSet<<TYPES as NodeType>::SignatureKey>
Get all members of the committee for the current view
Source§fn da_committee_members(
&self,
_view_number: <TYPES as NodeType>::View,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> BTreeSet<<TYPES as NodeType>::SignatureKey>
fn da_committee_members( &self, _view_number: <TYPES as NodeType>::View, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> BTreeSet<<TYPES as NodeType>::SignatureKey>
Get all members of the committee for the current view
Source§fn stake(
&self,
pub_key: &<TYPES as NodeType>::SignatureKey,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> Option<PeerConfig<TYPES>>
fn stake( &self, pub_key: &<TYPES as NodeType>::SignatureKey, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> Option<PeerConfig<TYPES>>
Get the stake table entry for a public key
Source§fn da_stake(
&self,
pub_key: &<TYPES as NodeType>::SignatureKey,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> Option<PeerConfig<TYPES>>
fn da_stake( &self, pub_key: &<TYPES as NodeType>::SignatureKey, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> Option<PeerConfig<TYPES>>
Get the da stake table entry for a public key
Source§fn has_stake(
&self,
pub_key: &<TYPES as NodeType>::SignatureKey,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> bool
fn has_stake( &self, pub_key: &<TYPES as NodeType>::SignatureKey, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> bool
Check if a node has stake in the committee
Source§fn has_da_stake(
&self,
pub_key: &<TYPES as NodeType>::SignatureKey,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> bool
fn has_da_stake( &self, pub_key: &<TYPES as NodeType>::SignatureKey, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> bool
Check if a node has stake in the committee
Source§fn lookup_leader(
&self,
view_number: <TYPES as NodeType>::View,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> Result<TYPES::SignatureKey>
fn lookup_leader( &self, view_number: <TYPES as NodeType>::View, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> Result<TYPES::SignatureKey>
Index the vector of public keys with the current view number
Source§fn total_nodes(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> usize
fn total_nodes(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> usize
Get the total number of nodes in the committee
Source§fn da_total_nodes(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> usize
fn da_total_nodes(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> usize
Get the total number of nodes in the committee
Source§fn success_threshold(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> U256
fn success_threshold(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> U256
Get the voting success threshold for the committee
Source§fn da_success_threshold(
&self,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> U256
fn da_success_threshold( &self, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> U256
Get the voting success threshold for the committee
Source§fn failure_threshold(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> U256
fn failure_threshold(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> U256
Get the voting failure threshold for the committee
Source§fn upgrade_threshold(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> U256
fn upgrade_threshold(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> U256
Get the voting upgrade threshold for the committee
Source§fn has_stake_table(&self, _epoch: TYPES::Epoch) -> bool
fn has_stake_table(&self, _epoch: TYPES::Epoch) -> bool
Source§fn has_randomized_stake_table(&self, _epoch: TYPES::Epoch) -> Result<bool>
fn has_randomized_stake_table(&self, _epoch: TYPES::Epoch) -> Result<bool>
Source§fn add_drb_result(
&mut self,
_epoch: <TYPES as NodeType>::Epoch,
_drb_result: DrbResult,
)
fn add_drb_result( &mut self, _epoch: <TYPES as NodeType>::Epoch, _drb_result: DrbResult, )
Source§fn set_first_epoch(
&mut self,
epoch: TYPES::Epoch,
_initial_drb_result: DrbResult,
)
fn set_first_epoch( &mut self, epoch: TYPES::Epoch, _initial_drb_result: DrbResult, )
Source§fn first_epoch(&self) -> Option<TYPES::Epoch>
fn first_epoch(&self) -> Option<TYPES::Epoch>
None
otherwisefn total_stake(&self, epoch: Option<<TYPES as NodeType>::Epoch>) -> Uint<256, 4>
fn total_da_stake( &self, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> Uint<256, 4>
Source§fn leader(
&self,
view: <TYPES as NodeType>::View,
epoch: Option<<TYPES as NodeType>::Epoch>,
) -> Result<<TYPES as NodeType>::SignatureKey, Error>
fn leader( &self, view: <TYPES as NodeType>::View, epoch: Option<<TYPES as NodeType>::Epoch>, ) -> Result<<TYPES as NodeType>::SignatureKey, Error>
Source§fn get_epoch_root(
_membership: Arc<RwLock<Self>>,
_block_height: u64,
_epoch: <TYPES as NodeType>::Epoch,
) -> impl Future<Output = Result<Leaf2<TYPES>, Error>> + Send
fn get_epoch_root( _membership: Arc<RwLock<Self>>, _block_height: u64, _epoch: <TYPES as NodeType>::Epoch, ) -> impl Future<Output = Result<Leaf2<TYPES>, Error>> + Send
Source§impl<T: PartialEq + NodeType, CONFIG: PartialEq + QuorumFilterConfig, DaConfig: PartialEq + QuorumFilterConfig> PartialEq for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
impl<T: PartialEq + NodeType, CONFIG: PartialEq + QuorumFilterConfig, DaConfig: PartialEq + QuorumFilterConfig> PartialEq for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
Source§fn eq(&self, other: &RandomizedCommitteeMembers<T, CONFIG, DaConfig>) -> bool
fn eq(&self, other: &RandomizedCommitteeMembers<T, CONFIG, DaConfig>) -> bool
self
and other
values to be equal, and is used by ==
.impl<T: Eq + NodeType, CONFIG: Eq + QuorumFilterConfig, DaConfig: Eq + QuorumFilterConfig> Eq for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
impl<T: NodeType, CONFIG: QuorumFilterConfig, DaConfig: QuorumFilterConfig> StructuralPartialEq for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
Auto Trait Implementations§
impl<T, CONFIG, DaConfig> Freeze for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
impl<T, CONFIG, DaConfig> RefUnwindSafe for RandomizedCommitteeMembers<T, CONFIG, DaConfig>where
<T as NodeType>::Epoch: RefUnwindSafe,
CONFIG: RefUnwindSafe,
DaConfig: RefUnwindSafe,
<<T as NodeType>::SignatureKey as SignatureKey>::StakeTableEntry: RefUnwindSafe,
<T as NodeType>::StateSignatureKey: RefUnwindSafe,
<T as NodeType>::SignatureKey: RefUnwindSafe,
impl<T, CONFIG, DaConfig> Send for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
impl<T, CONFIG, DaConfig> Sync for RandomizedCommitteeMembers<T, CONFIG, DaConfig>
impl<T, CONFIG, DaConfig> Unpin for RandomizedCommitteeMembers<T, CONFIG, DaConfig>where
<T as NodeType>::Epoch: Unpin,
CONFIG: Unpin,
DaConfig: Unpin,
<<T as NodeType>::SignatureKey as SignatureKey>::StakeTableEntry: Unpin,
<T as NodeType>::StateSignatureKey: Unpin,
impl<T, CONFIG, DaConfig> UnwindSafe for RandomizedCommitteeMembers<T, CONFIG, DaConfig>where
<T as NodeType>::SignatureKey: RefUnwindSafe,
<T as NodeType>::Epoch: UnwindSafe,
CONFIG: UnwindSafe,
DaConfig: UnwindSafe,
<<T as NodeType>::SignatureKey as SignatureKey>::StakeTableEntry: RefUnwindSafe + UnwindSafe,
<T as NodeType>::StateSignatureKey: RefUnwindSafe + UnwindSafe,
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> 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> CallHasher for T
impl<T> CallHasher for T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§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.