[−][src]Struct storage_proofs::zigzag_graph::ZigZagGraph
Fields
reversed: bool
Methods
impl<H, G> ZigZagGraph<H, G> where
H: Hasher,
G: Graph<H>,
[src]
H: Hasher,
G: Graph<H>,
pub fn new(
base_graph: Option<G>,
nodes: usize,
base_degree: usize,
expansion_degree: usize,
seed: [u32; 7]
) -> Self
[src]
base_graph: Option<G>,
nodes: usize,
base_degree: usize,
expansion_degree: usize,
seed: [u32; 7]
) -> Self
Trait Implementations
impl<'a, H, G> Layerable<H> for ZigZagGraph<H, G> where
H: Hasher,
G: Graph<H> + 'static,
[src]
H: Hasher,
G: Graph<H> + 'static,
impl<H, G> ParameterSetMetadata for ZigZagGraph<H, G> where
H: Hasher,
G: Graph<H> + ParameterSetMetadata,
[src]
H: Hasher,
G: Graph<H> + ParameterSetMetadata,
fn identifier(&self) -> String
[src]
fn sector_size(&self) -> u64
[src]
impl<'a, H, G> ZigZag for ZigZagGraph<H, G> where
H: Hasher,
G: Graph<H>,
[src]
H: Hasher,
G: Graph<H>,
type BaseHasher = H
type BaseGraph = G
fn new_zigzag(
nodes: usize,
base_degree: usize,
expansion_degree: usize,
seed: [u32; 7]
) -> Self
[src]
nodes: usize,
base_degree: usize,
expansion_degree: usize,
seed: [u32; 7]
) -> Self
fn zigzag(&self) -> Self
[src]
To zigzag a graph, we just toggle its reversed field. All the real work happens when we calculate node parents on-demand.
fn base_graph(&self) -> Self::BaseGraph
[src]
fn expansion_degree(&self) -> usize
[src]
fn reversed(&self) -> bool
[src]
fn expanded_parents(&self, node: usize) -> Vec<usize>
[src]
fn real_index(&self, i: usize) -> usize
[src]
impl<H, G> PartialEq<ZigZagGraph<H, G>> for ZigZagGraph<H, G> where
H: Hasher,
G: Graph<H>,
[src]
H: Hasher,
G: Graph<H>,
fn eq(&self, other: &ZigZagGraph<H, G>) -> bool
[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests for !=
.
impl<H: Clone, G: Clone> Clone for ZigZagGraph<H, G> where
H: Hasher,
G: Graph<H> + 'static,
[src]
H: Hasher,
G: Graph<H> + 'static,
fn clone(&self) -> ZigZagGraph<H, G>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<H, G> Eq for ZigZagGraph<H, G> where
H: Hasher,
G: Graph<H>,
[src]
H: Hasher,
G: Graph<H>,
impl<H: Debug, G: Debug> Debug for ZigZagGraph<H, G> where
H: Hasher,
G: Graph<H> + 'static,
[src]
H: Hasher,
G: Graph<H> + 'static,
Auto Trait Implementations
impl<H, G> Unpin for ZigZagGraph<H, G> where
G: Unpin,
H: Unpin,
G: Unpin,
H: Unpin,
impl<H, G> Sync for ZigZagGraph<H, G> where
G: Sync,
G: Sync,
impl<H, G> Send for ZigZagGraph<H, G> where
G: Send,
G: Send,
impl<H, G> RefUnwindSafe for ZigZagGraph<H, G> where
G: RefUnwindSafe,
H: RefUnwindSafe,
G: RefUnwindSafe,
H: RefUnwindSafe,
impl<H, G> UnwindSafe for ZigZagGraph<H, G> where
G: UnwindSafe,
H: UnwindSafe,
G: UnwindSafe,
H: UnwindSafe,
Blanket Implementations
impl<T> From<T> for T
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> SendSyncUnwindSafe for T where
T: Send + Sync + UnwindSafe + ?Sized,
[src]
T: Send + Sync + UnwindSafe + ?Sized,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,