Struct InMemoryLog 

pub struct InMemoryLog<T> { /* private fields */ }

An in-memory transparent log

Trait Implementations

impl<T: Debug> Debug for InMemoryLog<T>

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

Formats the value using the given formatter.

impl<T> Default for InMemoryLog<T>

Default implementation for an empty in-memory log

fn default() -> Self

Returns the “default value” for a type.

impl<'a, T: Serialize + Deserialize<'a>> TransparentLog<'a, T> for InMemoryLog<T>

TransparentLog Trait implementation for in-memory log

type LogSize = usize

Vec size

fn size(&self) -> Result<Self::LogSize>

Get the log size

fn get(&self, index: Self::LogSize) -> Result<Option<MaybeOwned<'_, T>>>

Retrieve a log entry by its index

fn add(&mut self, record: T) -> Result<Self::LogSize>

Add a record, return the record ID

fn add_hash(&mut self, level: LogHeight, hash: String) -> Result<Self::LogSize>

Add a hash and index, returns the index of the added hash

fn get_hash( &self, level: LogHeight, index: Self::LogSize, ) -> Result<MaybeOwned<'_, String>>

Get a hash at the given level and index

fn append(&mut self, record: T) -> Result<Record<Self::LogSize>>

Append a new record to the log and return its index

fn push_hash(&mut self, level: LogHeight, hash: String) -> Result<Self::LogSize>

Recursively push a hash to the tree at given level

fn latest(&self) -> Result<LogTree<Self::LogSize>>

Get the latest log size and root hash

fn proofs<I>( &self, positions: I, ) -> Result<HashMap<LogTreePosition<Self::LogSize>, String>>

where I: Iterator<Item = LogTreePosition<Self::LogSize>>,

Return the requested proofs from the log