Struct IndexSet 

pub struct IndexSet {
    pub nodes_by_label: BTreeMap<String, Cid>,
    pub nodes_by_prop: BTreeMap<String, BTreeMap<String, Cid>>,
    pub outgoing: Option<Cid>,
    pub incoming: Option<Cid>,
    pub extra: BTreeMap<String, Ipld>,
}

Top-level secondary-index aggregator (SPEC §4.8, added in mnem/0.2, extended with incoming in mnem/0.3).

Fields

nodes_by_label: BTreeMap<String, Cid>

Map from node label (ntype) to the root CID of a Prolly tree keyed by NodeId (16 bytes) with values = node CIDs.

nodes_by_prop: BTreeMap<String, BTreeMap<String, Cid>>

Two-level map label -> prop_name -> Cid. Each leaf CID is the root of a Prolly tree keyed by blake3(canonical_ipld(value))[..16] with values = node CIDs.

outgoing: Option<Cid>

Outgoing adjacency index. Prolly tree keyed by source NodeId whose values are CIDs of AdjacencyBucket objects. None on a repo without edges.

Historically serialised under the field name adjacency; on decode both outgoing and the legacy adjacency are accepted. New writes always emit outgoing.

incoming: Option<Cid>

Incoming adjacency index. Prolly tree keyed by destination NodeId whose values are CIDs of IncomingAdjacencyBucket objects. None on a repo without edges OR on a repo whose IndexSet was built by a pre-0.3 implementation (in which case callers gracefully degrade to “no back-edges known”; see SPEC §4.8).

extra: BTreeMap<String, Ipld>

Forward-compat extension map (SPEC §3.2).

Implementations

impl IndexSet

pub const KIND: &'static str = "index_set"

The _kind discriminator on the wire.

Trait Implementations

impl Clone for IndexSet

fn clone(&self) -> IndexSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IndexSet

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

Formats the value using the given formatter.

impl Default for IndexSet

fn default() -> IndexSet

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for IndexSet

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer.

impl PartialEq for IndexSet

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for IndexSet

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl Eq for IndexSet

impl StructuralPartialEq for IndexSet