Struct storage_proofs::drgraph::BucketGraph

pub struct BucketGraph<H: Hasher> { /* fields omitted */ }

Bucket sampling algorithm.

Trait Implementations

impl<H: Hasher> Graph<H> for BucketGraph<H>

fn parents(&self, node: usize, parents: &mut [usize])

Returns a sorted list of all parents of this node. The parents may be repeated.

fn size(&self) -> usize

Returns the size of the graph (number of nodes).

fn degree(&self) -> usize

Returns the number of parents of each node in the graph.

fn seed(&self) -> [u32; 7]

fn new(
    nodes: usize,
    base_degree: usize,
    expansion_degree: usize,
    seed: [u32; 7]
) -> Self

fn expected_size(&self) -> usize

Returns the expected size of all nodes in the graph.

fn merkle_tree<'a>(
    &self,
    data: &'a [u8]
) -> Result<MerkleTree<H::Domain, H::Function>>

Builds a merkle tree based on the given data.

fn merkle_tree_aux<'a>(
    &self,
    data: &'a [u8],
    parallel: bool
) -> Result<MerkleTree<H::Domain, H::Function>>

Builds a merkle tree based on the given data.

fn merkle_tree_depth(&self) -> u64

Returns the merkle tree depth.

fn forward(&self) -> bool

impl<H: Hasher> ParameterSetMetadata for BucketGraph<H>

fn identifier(&self) -> String

fn sector_size(&self) -> u64

impl<H: PartialEq + Hasher> PartialEq<BucketGraph<H>> for BucketGraph<H>

fn eq(&self, other: &BucketGraph<H>) -> bool

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

fn ne(&self, other: &BucketGraph<H>) -> bool

This method tests for !=.

impl<H: Clone + Hasher> Clone for BucketGraph<H>

fn clone(&self) -> BucketGraph<H>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H: Eq + Hasher> Eq for BucketGraph<H>

impl<H: Copy + Hasher> Copy for BucketGraph<H>

impl<H: Debug + Hasher> Debug for BucketGraph<H>

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

Formats the value using the given formatter.