Struct MemoryStorage

pub struct MemoryStorage { /* private fields */ }

A simple in-memory storage implementation.

Great for experimentation and testing.

The storage will use a zero indexed, incremental counter as the key for each node if the node id is not set.

Implementations

impl MemoryStorage

pub async fn get(&self, key: impl AsRef<str>) -> Option<Node>

Retrieve a node by its key

pub async fn get_all_values(&self) -> Vec<Node>

Retrieve all nodes in the storage

pub async fn get_all(&self) -> Vec<(String, Node)>

Retrieve all nodes in the storage with their keys

Trait Implementations

impl Clone for MemoryStorage

fn clone(&self) -> MemoryStorage

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MemoryStorage

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

Formats the value using the given formatter.

impl Default for MemoryStorage

fn default() -> MemoryStorage

Returns the “default value” for a type.

impl Persist for MemoryStorage

fn store<'life0, 'async_trait>( &'life0 self, node: Node, ) -> Pin<Box<dyn Future<Output = Result<Node>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Store a node by its id

If the node does not have an id, a simple counter is used as the key.

fn batch_store<'life0, 'async_trait>( &'life0 self, nodes: Vec<Node>, ) -> Pin<Box<dyn Future<Output = IndexingStream> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Store multiple nodes at once

If a node does not have an id, a simple counter is used as the key.

fn setup<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

fn batch_size(&self) -> Option<usize>

fn name(&self) -> &'static str