Struct Tree 

pub struct Tree<S> { /* private fields */ }

Implementations

impl<S: Scheme> Tree<S>

pub fn path(&self, name: &S::Name) -> Result<PathBuf, String>

pub fn open_file(&self, name: &S::Name) -> Result<Option<File>, Error>

pub fn create_file(&self, name: &S::Name) -> Result<Option<File>, Error>

pub fn entries(&self) -> Entries<'_, S>

impl Tree<Identity>

pub fn builder<P: AsRef<Path>>(base: P) -> TreeBuilder<Identity>

pub fn infer_prefix_part_lengths<P: AsRef<Path>>( base: P, ) -> Result<Option<Vec<usize>>, Error>

Infer the prefix part lengths used to create a store.

The result will be empty if and only if the store has no files (even if there are directories).

If this function returns a result, it is guaranteed to be correct if the store is valid, but the validity is not checked.

Trait Implementations

impl<S: Clone> Clone for Tree<S>

fn clone(&self) -> Tree<S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Debug> Debug for Tree<S>

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

Formats the value using the given formatter.

impl<S: PartialEq> PartialEq for Tree<S>

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

impl<S> StructuralPartialEq for Tree<S>