Struct MemoryStore 

pub struct MemoryStore<K> { /* private fields */ }

Memory implementation of the PartialOrderStore trait.

Trait Implementations

impl<K: Clone> Clone for MemoryStore<K>

fn clone(&self) -> MemoryStore<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K> Default for MemoryStore<K>

fn default() -> Self

Returns the “default value” for a type.

impl<K> PartialOrderStore<K> for MemoryStore<K>

where K: Clone + Copy + Debug + StdHash + PartialEq + Eq,

async fn mark_ready(&mut self, key: K) -> Result<bool, PartialOrderError>

Add an item to the store which has all it’s dependencies met already. If this is the first time the item has been added it should also be pushed to the end of a “ready” queue.

async fn mark_pending( &mut self, key: K, dependencies: Vec<K>, ) -> Result<bool, PartialOrderError>

Add an item which does not have all it’s dependencies met yet.

async fn get_next_pending( &self, key: K, ) -> Result<Option<HashSet<(K, Vec<K>)>>, PartialOrderError>

Get all pending items which directly depend on the given key.

async fn take_next_ready(&mut self) -> Result<Option<K>, PartialOrderError>

Take the next ready item from the ready queue.

async fn remove_pending(&mut self, key: K) -> Result<bool, PartialOrderError>

Remove all items from the pending queue which depend on the passed key.

async fn ready(&self, dependencies: &[K]) -> Result<bool, PartialOrderError>

Returns true of all the passed keys are present in the ready list.