Enum sc_network_sync::AncestorSearchState

pub enum AncestorSearchState<B: BlockT> {
    ExponentialBackoff(NumberFor<B>),
    BinarySearch(NumberFor<B>, NumberFor<B>),
}

The ancestor search state expresses which algorithm, and its stateful parameters, we are using to try to find an ancestor block

Variants

ExponentialBackoff(NumberFor<B>)

Use exponential backoff to find an ancestor, then switch to binary search. We keep track of the exponent.

BinarySearch(NumberFor<B>, NumberFor<B>)

Using binary search to find the best ancestor. We keep track of left and right bounds.

Trait Implementations

impl<B: Clone + BlockT> Clone for AncestorSearchState<B>

fn clone(&self) -> AncestorSearchState<B>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<B: Debug + BlockT> Debug for AncestorSearchState<B>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<B: PartialEq + BlockT> PartialEq<AncestorSearchState<B>> for AncestorSearchState<B>

fn eq(&self, other: &AncestorSearchState<B>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<B: Copy + BlockT> Copy for AncestorSearchState<B>

impl<B: Eq + BlockT> Eq for AncestorSearchState<B>

impl<B: BlockT> StructuralEq for AncestorSearchState<B>

impl<B: BlockT> StructuralPartialEq for AncestorSearchState<B>