Struct ModuleGraph 

pub struct ModuleGraph {
    pub schema_version: u32,
    pub root_id: ModuleId,
    pub modules: Vec<ModuleNode>,
    pub canonical_hash: ModuleGraphHash,
}

The compiled module graph.

Fields

schema_version: u32

Bumped on every breaking change to the IR shape. Today: 1.

root_id: ModuleId

Always 0 — root module interned first (BFS from the entrypoint).

modules: Vec<ModuleNode>

Dense module table indexed by ModuleId as usize.

canonical_hash: ModuleGraphHash

BLAKE3 of the rkyv archive bytes. Populated by ModuleGraph::archive_and_hash.

Implementations

impl ModuleGraph

pub fn new() -> Self

Allocate an empty graph. Builders use Self::push_module + Self::set_root to populate.

pub fn push_module(&mut self, node: ModuleNode) -> ModuleId

Add a module; return its assigned id. First module pushed gets id 0 (the root by convention; callers should ensure that’s the entrypoint module).

pub fn set_root(&mut self, id: ModuleId)

Set which module id is the root. Defaults to 0; override only if the build order put the root elsewhere.

pub fn from_ast_graphs( modules: &[(String, AstGraph)], ) -> Result<Self, ModuleGraphError>

Build a ModuleGraph from a slice of (label, AstGraph) pairs. The first pair becomes the root.

Each module is run through crate::module_compiler::compile_module to extract its typed surface (option declarations, config setters with slice metadata, import edges). Caller-order is preserved — full BFS-from-root topological discovery + import-target resolution lands when import paths get typed in a follow-up ship (today, ImportEdge::target is the u32::MAX sentinel for unresolved edges).

Errors

• ModuleGraphError::Archive on rkyv failure during subsequent archive_and_hash calls.
• Module-compiler errors are surfaced as ModuleGraphError variants — a module with an unrecognizable root shape causes the whole build to fail rather than silently emit a partial graph (operators should see the offending file).

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

Two-pass archive: serialize → BLAKE3 the bytes → stamp hash → serialize again. Mirrors LockfileGraph::archive_and_hash and AstGraph::archive_and_hash.

Errors

ModuleGraphError::Archive on rkyv failure.

Trait Implementations

impl Archive for ModuleGraph

where u32: Archive, ModuleId: Archive, Vec<ModuleNode>: Archive, ModuleGraphHash: 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 = ArchivedModuleGraph

The archived representation of this type.

type Resolver = ModuleGraphResolver

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 ModuleGraph

fn clone(&self) -> ModuleGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ModuleGraph

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

Formats the value using the given formatter.

impl Default for ModuleGraph

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for ModuleGraph

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<ModuleGraph, __D> for Archived<ModuleGraph>

where u32: Archive, <u32 as Archive>::Archived: Deserialize<u32, __D>, ModuleId: Archive, <ModuleId as Archive>::Archived: Deserialize<ModuleId, __D>, Vec<ModuleNode>: Archive, <Vec<ModuleNode> as Archive>::Archived: Deserialize<Vec<ModuleNode>, __D>, ModuleGraphHash: Archive, <ModuleGraphHash as Archive>::Archived: Deserialize<ModuleGraphHash, __D>,

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

Deserializes using the given deserializer

impl PartialEq for ModuleGraph

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

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 ModuleGraph

where u32: Serialize<__S>, ModuleId: Serialize<__S>, Vec<ModuleNode>: Serialize<__S>, ModuleGraphHash: 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 ModuleGraph

impl TataraDomain for ModuleGraph

const KEYWORD: &'static str = "defmodule-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.