pub struct ReplayProof {
pub graph_hash: Hash,
pub patch_count: usize,
pub replayed_hash: Hash,
pub matches: bool,
}Expand description
Proof that the graph can be deterministically replayed.
Fields§
§graph_hash: Hash§patch_count: usize§replayed_hash: Hash§matches: boolTrait Implementations§
Source§impl Clone for ReplayProof
impl Clone for ReplayProof
Source§fn clone(&self) -> ReplayProof
fn clone(&self) -> ReplayProof
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for ReplayProof
impl RefUnwindSafe for ReplayProof
impl Send for ReplayProof
impl Sync for ReplayProof
impl Unpin for ReplayProof
impl UnsafeUnpin for ReplayProof
impl UnwindSafe for ReplayProof
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.