Struct AdjacencyBucket 

pub struct AdjacencyBucket {
    pub edges: Vec<AdjacencyEntry>,
    pub extra: BTreeMap<String, Ipld>,
}

Per-source-node bucket of outgoing edges. Stored as a standalone object so the adjacency Prolly tree can cheaply reference a list without inlining it into every leaf.

Fields

edges: Vec<AdjacencyEntry>

Outgoing edges, sorted lexicographically by (label, edge_cid) for byte-stable canonical form.

extra: BTreeMap<String, Ipld>

Forward-compat extension map.

Implementations

impl AdjacencyBucket

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

The _kind discriminator on the wire.

Trait Implementations

impl Clone for AdjacencyBucket

fn clone(&self) -> AdjacencyBucket

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AdjacencyBucket

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

Formats the value using the given formatter.

impl Default for AdjacencyBucket

fn default() -> AdjacencyBucket

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for AdjacencyBucket

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

Deserialize this value from the given Serde deserializer.

impl PartialEq for AdjacencyBucket

fn eq(&self, other: &AdjacencyBucket) -> 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 AdjacencyBucket

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

Serialize this value into the given Serde serializer.

impl Eq for AdjacencyBucket

impl StructuralPartialEq for AdjacencyBucket