Struct EntryVisibility 

pub struct EntryVisibility {
    pub format_version: u8,
    pub change_id: ChangeId,
    pub tree_root: ContentHash,
    pub entries: Vec<EntryVisibilityEntry>,
}

The per-state entry-visibility sidecar: the set of per-entry tier overrides covering the trees reachable from one state, keyed by that state’s ChangeId.

Fields

format_version: u8

Format version; Self::decode rejects anything but the current one.

change_id: ChangeId

The state (by rewrite-stable change id) these overrides apply to.

tree_root: ContentHash

The state’s root tree id — the anchor the entry records hang beneath.

entries: Vec<EntryVisibilityEntry>

The per-entry overrides. Order is normalized (by (tree_id, leaf_hash)) so the encoded bytes are canonical for a given override set.

Implementations

impl EntryVisibility

pub fn new( change_id: ChangeId, tree_root: ContentHash, entries: Vec<EntryVisibilityEntry>, ) -> Result<EntryVisibility, EntryVisibilityError>

Build a sidecar from its overrides, normalizing entry order so equal override sets encode to identical bytes (and hash identically).

Fails loud on a conflicting duplicate: two overrides on the same (tree_id, leaf_hash) with different tiers. Leg 3 keys a serve-time map by leaf hash, so a duplicate leaf would be silent first/last-wins ambiguity. An exact duplicate (same leaf, same tier) is harmless and is de-duplicated.

pub fn has_records(&self) -> bool

true iff this sidecar carries at least one override. An empty sidecar is never persisted (absence ≡ “every entry at the state baseline”).

pub fn encode(&self) -> Result<Vec<u8>, EntryVisibilityError>

Encode to canonical msgpack bytes.

pub fn decode(bytes: &[u8]) -> Result<EntryVisibility, EntryVisibilityError>

Decode msgpack bytes, rejecting an unsupported format version.

pub fn content_hash(&self) -> Result<ContentHash, EntryVisibilityError>

Content-addressed id of this sidecar — blake3 over its canonical encoded bytes. Named in the oplog record so undo/redo can correlate.

Trait Implementations

impl Clone for EntryVisibility

fn clone(&self) -> EntryVisibility

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for EntryVisibility

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for EntryVisibility

fn deserialize<__D>( __deserializer: __D, ) -> Result<EntryVisibility, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for EntryVisibility

impl PartialEq for EntryVisibility

fn eq(&self, other: &EntryVisibility) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for EntryVisibility

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for EntryVisibility