pub enum TreeRead {
Full(Tree),
Partial(PartialTree),
Absent,
}Expand description
The result of resolving a tree hash that may be held either as the full canonical object or only as a redacted partial projection (HRT1).
A full tree SUPERSEDES a partial for the same hash. Partial is distinct
from Absent on purpose: a partial clone that withholds an entry must be
distinguishable from a repository that is missing or corrupt, so callers can
present “withheld” rather than “gone”.
Variants§
Full(Tree)
The full canonical tree is held.
Partial(PartialTree)
Only a redacted partial projection is held: its visible entries carry
their preimage and its withheld entries are marked opaque. Verifies
against the declared State.tree via PartialTree::reconstruct_root.
Absent
Neither a full tree nor a partial projection is held for this hash.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for TreeRead
impl RefUnwindSafe for TreeRead
impl Send for TreeRead
impl Sync for TreeRead
impl Unpin for TreeRead
impl UnsafeUnpin for TreeRead
impl UnwindSafe for TreeRead
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