Enum ContentId 

pub enum ContentId {
    Store {
        store_id: [u8; 32],
    },
    Root {
        store_id: [u8; 32],
        root: [u8; 32],
    },
    Resource {
        store_id: [u8; 32],
        root: [u8; 32],
        retrieval_key: [u8; 32],
    },
}

The candidate/content types re-used from dig-dht (SPEC §7.1): what is fetched + how a provider is addressed. A DIG content identifier at store / root(capsule) / resource granularity — the key a provider record is stored under and a lookup asks for.

All hashes are the raw 32-byte forms (a store_id, a generation root, and a retrieval_key are each a Bytes32). Use the constructors (Self::store, Self::root, Self::capsule, Self::resource) rather than building variants directly, and Self::to_key to map into the DHT keyspace.

Variants

Store

A whole store — “does a peer serve this store_id?” (has_store).

Fields

store_id: [u8; 32]

The 32-byte store id.

Root

A specific generation (store_id, root) — the immutable capsule store_id:root (has_root). Self::capsule and Self::root both build this variant; a capsule IS a root generation.

Fields

store_id: [u8; 32]

The 32-byte store id.

root: [u8; 32]

The 32-byte generation root.

Resource

A specific resource within a capsule — (store_id, root, retrieval_key) (has_resource).

Fields

store_id: [u8; 32]

The 32-byte store id.

root: [u8; 32]

The 32-byte generation root.

retrieval_key: [u8; 32]

The 32-byte resource retrieval key.

Implementations

impl ContentId

pub const fn store(store_id: [u8; 32]) -> ContentId

A store-granularity content id (has_store).

pub const fn root(store_id: [u8; 32], root: [u8; 32]) -> ContentId

A root/generation-granularity content id (has_root) — the generation (store_id, root).

pub const fn capsule(store_id: [u8; 32], root: [u8; 32]) -> ContentId

The immutable capsule store_id:root. Alias of Self::root — a capsule is a generation.

pub const fn resource( store_id: [u8; 32], root: [u8; 32], retrieval_key: [u8; 32], ) -> ContentId

A resource-granularity content id (has_resource) — (store_id, root, retrieval_key).

pub const fn store_id(&self) -> &[u8; 32]

The store id this content id belongs to (present at every granularity).

pub fn to_key(&self) -> Key

Map this content id into the 256-bit DHT Key keyspace: SHA-256(canonical_bytes).

Deterministic + domain-separated: the same content always yields the same key, and different granularities of the same store yield different keys (so their provider records do not collide). This is how announce_provider / find_providers agree on where a record lives.

Trait Implementations

impl Clone for ContentId

fn clone(&self) -> ContentId

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ContentId

impl Debug for ContentId

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

Formats the value using the given formatter.

impl Eq for ContentId

impl Hash for ContentId

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for ContentId

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ContentId