Struct MemoryStorageInterface

pub struct MemoryStorageInterface<Id, Element> { /* private fields */ }

Use the [sled] database to save results to an embedded database.

Trait Implementations

impl<Id, Element> Clone for MemoryStorageInterface<Id, Element>

where Id: Clone, Element: Clone,

fn clone(&self) -> MemoryStorageInterface<Id, Element>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Id, Element> Debug for MemoryStorageInterface<Id, Element>

where Id: Debug, Element: Debug,

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

Formats the value using the given formatter.

impl<Id, Element> StorageInterfaceLoad<Id, Element> for MemoryStorageInterface<Id, Element>

where Id: Hash + Eq + Clone, Element: Clone,

fn load_single_element( &self, iteration: u64, identifier: &Id, ) -> Result<Option<Element>, StorageError>

where Id: Serialize + for<'a> Deserialize<'a>, Element: for<'a> Deserialize<'a>,

Loads a single element from the storage solution if the element exists.

fn load_all_elements_at_iteration( &self, iteration: u64, ) -> Result<HashMap<Id, Element>, StorageError>

where Id: Hash + Eq + for<'a> Deserialize<'a>, Element: for<'a> Deserialize<'a>,

Gets a snapshot of all elements at a given iteration.

fn load_all_elements( &self, ) -> Result<BTreeMap<u64, HashMap<Id, Element>>, StorageError>

where Id: Hash + Eq + for<'a> Deserialize<'a>, Element: for<'a> Deserialize<'a>,

Loads all elements for every iteration. This will yield the complete storage and may result in extremely large allocations of memory.

fn get_all_iterations(&self) -> Result<Vec<u64>, StorageError>

Get all iteration values which have been saved.

fn load_element_history( &self, identifier: &Id, ) -> Result<HashMap<u64, Element>, StorageError>

where Id: Eq + Serialize + for<'a> Deserialize<'a>, Element: for<'a> Deserialize<'a>,

Loads the elements history, meaning every occurrence of the element in the storage. This function by default provides the results in ordered fashion such that the time direction is retained. Furthermore this function assumes that a given index occurs over the course of a complete time segment with no interceptions.

fn load_all_element_histories( &self, ) -> Result<HashMap<Id, BTreeMap<u64, Element>>, StorageError>

where Id: Hash + Eq + for<'a> Deserialize<'a>, Element: for<'a> Deserialize<'a>,

Similarly to the load_all_elements function, but this function returns all elements as their histories.

impl<Id, Element> StorageInterfaceOpen for MemoryStorageInterface<Id, Element>

fn open_or_create( _location: &Path, _storage_instance: u64, ) -> Result<MemoryStorageInterface<Id, Element>, StorageError>

Initializes the current storage device.

impl<Id, Element> StorageInterfaceStore<Id, Element> for MemoryStorageInterface<Id, Element>

where Id: Clone + Hash + Eq, Element: Clone,

fn store_single_element( &mut self, iteration: u64, identifier: &Id, element: &Element, ) -> Result<(), StorageError>

where Id: Serialize, Element: Serialize,

Saves a single element at given iteration.

fn store_batch_elements<'a, I>( &'a mut self, iteration: u64, identifiers_elements: I, ) -> Result<(), StorageError>

where Id: 'a + Serialize, Element: 'a + Serialize, I: Clone + IntoIterator<Item = (&'a Id, &'a Element)>,

Stores a batch of multiple elements with identifiers all at the same iteration.