pub struct OrderedUnit<D: Data, H: Hasher> {
pub data: Option<D>,
pub parents: Vec<H::Hash>,
pub hash: H::Hash,
pub creator: NodeIndex,
pub round: Round,
}
Expand description
Represents state of the main internal data structure of AlephBFT (i.e. direct acyclic graph) used for achieving consensus.
Instances of this type are returned indirectly by [member::run_session
] method using the
UnitFinalizationHandler
trait. This way it allows to reconstruct the DAG’s structure used by AlephBFT,
which can be then used for example for the purpose of node’s performance evaluation.
Fields§
§data: Option<D>
§parents: Vec<H::Hash>
§hash: H::Hash
§creator: NodeIndex
§round: Round
Auto Trait Implementations§
impl<D, H> Freeze for OrderedUnit<D, H>
impl<D, H> RefUnwindSafe for OrderedUnit<D, H>
impl<D, H> Send for OrderedUnit<D, H>
impl<D, H> Sync for OrderedUnit<D, H>
impl<D, H> Unpin for OrderedUnit<D, H>
impl<D, H> UnwindSafe for OrderedUnit<D, H>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more