Enum RedundancyStrategy 

#[repr(u8)]
pub enum RedundancyStrategy {
    None = 0,
    Data = 1,
    Proximity = 2,
    Race = 3,
}

Chunk-prefetch policy used when downloading erasure-coded data. Mirrors bee-js RedundancyStrategy.

Variants

None = 0

No prefetch.

Data = 1

Data-only prefetch.

Proximity = 2

Proximity-based prefetch.

Race = 3

Race strategies.

Implementations

impl RedundancyStrategy

pub fn as_u8(self) -> u8

Numeric value used as the Swarm-Redundancy-Strategy header.

Trait Implementations

impl Clone for RedundancyStrategy

fn clone(&self) -> RedundancyStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RedundancyStrategy

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

Formats the value using the given formatter.

impl Hash for RedundancyStrategy

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for RedundancyStrategy

fn eq(&self, other: &RedundancyStrategy) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl Copy for RedundancyStrategy

impl Eq for RedundancyStrategy

impl StructuralPartialEq for RedundancyStrategy