Struct DirectoryEntry

pub struct DirectoryEntry { /* private fields */ }

A directory entry in the generated tree. Contains a randomly generated u64 for a name and a vector of randomly generated directory entries, with a number of entries somewhere in the range of [0, 6). The sample function generates the entire subtree depth-first before returning, and is mutually recursive with the Entry sample function.

Implementations

impl DirectoryEntry

pub fn get_name(&self) -> String

get the path the directory entry will be written to relative to a given root.

pub fn write_tree_at<'a>( self, root: &'a DirectoryProxy, ) -> BoxFuture<'a, Result<(), Error>>

Take the entire randomly generated tree and commit it to disk.

Trait Implementations

impl Clone for DirectoryEntry

fn clone(&self) -> DirectoryEntry

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DirectoryEntry

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

Formats the value using the given formatter.

impl Distribution<DirectoryEntry> for EntryDistribution

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> DirectoryEntry

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Create a distribution of values of ‘S’ by mapping the output of Self through the closure F

impl PartialEq for DirectoryEntry

fn eq(&self, other: &DirectoryEntry) -> 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 Eq for DirectoryEntry

impl StructuralPartialEq for DirectoryEntry