Struct PartialOrder 

pub struct PartialOrder<L, E, OS, POS> { /* private fields */ }

Struct for processing p2panda operations into a partial order based on dependencies expressed in their previous field.

This struct is a thin wrapper around ordering::PartialOrder struct which takes care of sorting the operation dependency graph into a partial order. Here we have the addition of a LogStore and OperationStore implementation (traits from p2panda-store).

Implementations

impl<L, E, OS, POS> PartialOrder<L, E, OS, POS>

where OS: OperationStore<L, E> + LogStore<L, E>, POS: PartialOrderStore<Hash>, E: Extensions,

pub fn new(operation_store: OS, partial_order_store: POS) -> Self

Construct a new dependency checker from an operation store and dependency store.

pub async fn process( &mut self, operation: Operation<E>, ) -> Result<(), OperationDependencyCheckerError>

Process a single operation.

pub async fn next( &mut self, ) -> Result<Option<Operation<E>>, OperationDependencyCheckerError>

Take the next ready operation from the queue.

Trait Implementations

impl<L: Debug, E: Debug, OS: Debug, POS: Debug> Debug for PartialOrder<L, E, OS, POS>

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

Formats the value using the given formatter.