Struct PartialOrderer 

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

Queue which checks if dependencies are met for an item and returning it as “ready”.

Internally this assumes a structure where items can point at others as “dependencies”, forming an DAG (Directed Acyclic Graph). The “orderer” monitors incoming items, asserts if the dependencies are met and yields a linearized sequence of “dependency checked” items.

Implementations

impl<T> PartialOrderer<T>

where T: Copy + Clone + PartialEq + Eq + StdHash,

pub fn mark_ready( y: PartialOrdererState<T>, key: T, ) -> Result<(PartialOrdererState<T>, bool), PartialOrdererError>

pub fn mark_pending( y: PartialOrdererState<T>, key: T, dependencies: Vec<T>, ) -> Result<(PartialOrdererState<T>, bool), PartialOrdererError>

pub fn get_next_pending( y: &PartialOrdererState<T>, key: T, ) -> Result<Option<HashSet<(T, Vec<T>)>>, PartialOrdererError>

pub fn take_next_ready( y: PartialOrdererState<T>, ) -> Result<(PartialOrdererState<T>, Option<T>), PartialOrdererError>

pub fn remove_pending( y: PartialOrdererState<T>, key: T, ) -> Result<(PartialOrdererState<T>, bool), PartialOrdererError>

pub fn ready( y: &PartialOrdererState<T>, dependencies: &[T], ) -> Result<bool, PartialOrdererError>

pub fn process_pending( y: PartialOrdererState<T>, key: T, ) -> Result<PartialOrdererState<T>, PartialOrdererError>

Trait Implementations

impl<T: Debug> Debug for PartialOrderer<T>

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

Formats the value using the given formatter.