Struct LockfileGraph 

pub struct LockfileGraph {
    pub version: u32,
    pub root_id: NodeId,
    pub nodes: Vec<InputNode>,
    pub canonical_hash: CanonicalGraphHash,
}

The lockfile graph proper.

Fields

version: u32

Always 7 today (cppnix flake-lock major). Bumping requires migration logic in from_flake_lock.

root_id: NodeId

Always 0 by construction (root interned first).

nodes: Vec<InputNode>

Dense node table; nodes[id as usize] is the node with that id.

canonical_hash: CanonicalGraphHash

BLAKE3 of the rkyv archive bytes of this graph. Populated by LockfileGraph::archive_and_hash; zeroed on the freshly built graph (you can’t BLAKE3 yourself before you exist).

Implementations

impl LockfileGraph

pub fn from_flake_lock(lock: &FlakeLock) -> Result<Self, LockfileGraphError>

Build a follows-resolved typed graph from an upstream FlakeLock (the JSON-parser-output type that already lives in sui-compat). All follows chains are chased here so the resulting graph’s edges are pure (name, NodeId) pairs — no runtime resolution.

Determinism

Node ids are assigned by deterministic BFS from root: root = 0, then root’s inputs in sorted attr name order, then their inputs, breadth-first. This gives a canonical id assignment independent of upstream BTreeMap iteration order (which is already sorted, but we don’t want to depend on that).

Errors

• LockfileGraphError::UnsupportedVersion if lock.version != 7
• LockfileGraphError::UnresolvableFollows if a follows path walks off the graph (corrupt upstream).

pub fn archive_and_hash(self) -> Result<(Self, Vec<u8>), LockfileGraphError>

Serialize via rkyv and stamp canonical_hash with the BLAKE3 of the resulting bytes. Returns the archive bytes ready for sui_graph_store::GraphStore::put.

The two-pass shape (build → hash → re-archive with the hash stamped in) is unavoidable: the hash is part of the archive, so it can’t be computed before the archive exists. We pay a second archive pass once per graph; the warm path mmaps the result.

Errors

LockfileGraphError::Archive if rkyv refuses the graph shape (should be impossible by construction — every field is Archive).

Trait Implementations

impl Archive for LockfileGraph

where u32: Archive, NodeId: Archive, Vec<InputNode>: Archive, CanonicalGraphHash: Archive,

const COPY_OPTIMIZATION: CopyOptimization<Self>

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize.

type Archived = ArchivedLockfileGraph

The archived representation of this type.

type Resolver = LockfileGraphResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output.

impl Clone for LockfileGraph

fn clone(&self) -> LockfileGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LockfileGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for LockfileGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<__D: Fallible + ?Sized> Deserialize<LockfileGraph, __D> for Archived<LockfileGraph>

where u32: Archive, <u32 as Archive>::Archived: Deserialize<u32, __D>, NodeId: Archive, <NodeId as Archive>::Archived: Deserialize<NodeId, __D>, Vec<InputNode>: Archive, <Vec<InputNode> as Archive>::Archived: Deserialize<Vec<InputNode>, __D>, CanonicalGraphHash: Archive, <CanonicalGraphHash as Archive>::Archived: Deserialize<CanonicalGraphHash, __D>,

fn deserialize( &self, deserializer: &mut __D, ) -> Result<LockfileGraph, <__D as Fallible>::Error>

Deserializes using the given deserializer

impl Eq for LockfileGraph

impl PartialEq for LockfileGraph

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<__S: Fallible + ?Sized> Serialize<__S> for LockfileGraph

where u32: Serialize<__S>, NodeId: Serialize<__S>, Vec<InputNode>: Serialize<__S>, CanonicalGraphHash: Serialize<__S>,

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.

impl StructuralPartialEq for LockfileGraph

impl TataraDomain for LockfileGraph

const KEYWORD: &'static str = "deflockfile-graph"

The Lisp keyword (e.g., "defmonitor").

fn compile_from_args(args: &[Sexp]) -> Result<Self>

Parse the argument list (everything after the keyword) into Self.

fn compile_from_sexp(form: &Sexp) -> Result<Self, LispError>

Parse a complete form; validates the head symbol matches KEYWORD.