Struct Cache

pub struct Cache { /* private fields */ }

Stores the mapping of nodes to their chunks.

Implementations

impl Cache

pub fn new() -> Self

Instantiate an empty Cache.

pub fn get(&self, index: NodeIndex) -> Option<&Vec<u8>>

Gets a reference to the chunk coresponding to the node index.

pub fn insert(&mut self, index: NodeIndex, chunk: Vec<u8>) -> Option<Vec<u8>>

Sets the chunk for the node index and returns the old value.

pub fn nodes(&self) -> Vec<NodeIndex>

Retrieves a vector of set node indicies.

pub fn contains_node(&self, index: NodeIndex) -> bool

Returns true if the cache contains a chunk for the specified node index.

pub fn is_valid(&self, root: Vec<u8>) -> bool

Determines if the current merkle tree is valid.

pub fn fill(&mut self) -> Result<(), Error>

Inserts missing nodes into the merkle tree that can be generated from existing nodes.

pub fn refresh(&mut self) -> Result<(), Error>

Trait Implementations

impl Clone for Cache

fn clone(&self) -> Cache

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Cache

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

Formats the value using the given formatter.

impl Default for Cache

fn default() -> Cache

Returns the “default value” for a type.

impl Index<usize> for Cache

type Output = Vec<u8>

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl PartialEq for Cache

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