pub struct DisseminationQueue { /* private fields */ }Expand description
Bounded dissemination buffer keyed by NodeId.
Implementations§
Source§impl DisseminationQueue
impl DisseminationQueue
Sourcepub fn enqueue(&self, update: MemberUpdate)
pub fn enqueue(&self, update: MemberUpdate)
Insert or replace the entry for update.node_id. The send
counter resets to 0 so a fresh rumour is always gossiped anew.
Sourcepub fn take_for_message(
&self,
max: usize,
lambda_log_n: u32,
) -> Vec<MemberUpdate>
pub fn take_for_message( &self, max: usize, lambda_log_n: u32, ) -> Vec<MemberUpdate>
Return up to max least-disseminated updates for a single
outgoing message. Increments each returned entry’s sent_count
and drops entries whose new count has reached lambda_log_n.
lambda_log_n is ceil(lambda * log2(cluster_size + 1)) —
computed by the caller because it depends on the current
membership size and the super::super::config::SwimConfig
fanout_lambda knob.
Sourcepub fn fanout_threshold(cluster_size: usize, lambda: u32) -> u32
pub fn fanout_threshold(cluster_size: usize, lambda: u32) -> u32
Compute ceil(lambda * log2(cluster_size + 1)). Exposed so the
runner can pass the result straight into [take_for_message].
Trait Implementations§
Source§impl Debug for DisseminationQueue
impl Debug for DisseminationQueue
Source§impl Default for DisseminationQueue
impl Default for DisseminationQueue
Source§fn default() -> DisseminationQueue
fn default() -> DisseminationQueue
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl !Freeze for DisseminationQueue
impl RefUnwindSafe for DisseminationQueue
impl Send for DisseminationQueue
impl Sync for DisseminationQueue
impl Unpin for DisseminationQueue
impl UnsafeUnpin for DisseminationQueue
impl UnwindSafe for DisseminationQueue
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
Source§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
Mutably borrows from an owned value. Read more
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> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.