Struct Local 

pub struct Local { /* private fields */ }

A store kept in a directory.

Implementations

impl Local

pub fn at(root: impl Into<PathBuf>) -> Result<Self, StoreError>

The store in this directory, creating it if it is not there.

Trait Implementations

impl Store for Local

fn put(&self, bytes: &[u8]) -> Result<Digest, StoreError>

Saves these bytes. Saving the same ones twice is the same as saving them once — that is what content addressing is for.

fn get(&self, digest: &Digest) -> Result<Option<Vec<u8>>, StoreError>

The bytes, if they are here.

fn bind( &self, name: &str, digest: &Digest, meta: Meta, ) -> Result<(), StoreError>

Points a name at some bytes, with what you want to remember about it.

fn claim( &self, name: &str, digest: &Digest, meta: Meta, ) -> Result<bool, StoreError>

Points a name at some bytes only if nobody has, and says whether it did. This is how work gets handed out.

fn resolve(&self, name: &str) -> Result<Option<Bound>, StoreError>

What that name points at, if anything.

fn bound(&self) -> Result<Vec<Bound>, StoreError>

Everything bound here. A scan, and that is the point: the records are the truth, and an index that answers faster is built from them and thrown away.

fn resolve_many(&self, names: &[&str]) -> Result<Vec<Option<Bound>>, StoreError>

The same for many at once, in the order they were asked. In the trait from the first day: a cache that works item by item asks thousands at a time, which against a remote store is thousands of round trips unless it is one call. The default is the loop.

fn get_many( &self, digests: &[&Digest], ) -> Result<Vec<Option<Vec<u8>>>, StoreError>

The same for the bytes.