Enum GraphKind 

pub enum GraphKind {
    Lockfile,
    Ast,
    Module,
    EvalCacheEntry,
    Derivation,
}

The kind of graph held under a blob. Drives the kind-subtree in the on-disk layout. Adding a kind = appending a variant + one new subdirectory; never breaks the existing layout.

Variants

Lockfile

A flake.lock parsed + follows-resolved into a typed graph. Canonical L1 substrate for every flake operation.

Ast

A parsed .nix file: rnix CST → typed AST → drop the green tree. Identifies a single Nix expression by its source-hash + import set.

Module

A compiled NixOS / nix-darwin / home-manager module graph: typed IR with worker/wrapper-split setters and topo order. Keyed by (module-ast-hashes ⊕ resolved-import-set).

EvalCacheEntry

A serialized eval-cache entry: (ast-hash, env-hash) → value. Replicates across the fleet via the substituter protocol.

Derivation

A derivation’s typed graph form (pre-realisation), keyed by drv-hash. Substituters speak this directly.

Implementations

impl GraphKind

pub fn dir_name(self) -> &'static str

Subdirectory name beneath <root>/blobs/. Stable identifier; renaming would break the on-disk layout.

pub fn tag(self) -> u8

Encode as a single byte for the redb key prefix. Stable; never shift these values without a migration.

pub fn from_tag(tag: u8) -> Option<Self>

Inverse of Self::tag. Returns None for unknown tags, which acts as a forward-compat shield for older binaries reading newer indexes.

Trait Implementations

impl Clone for GraphKind

fn clone(&self) -> GraphKind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GraphKind

impl Debug for GraphKind

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

Formats the value using the given formatter.

impl Display for GraphKind

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

Formats the value using the given formatter.

impl Eq for GraphKind

impl Hash for GraphKind

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

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 Ord for GraphKind

fn cmp(&self, other: &GraphKind) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for GraphKind

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

fn partial_cmp(&self, other: &GraphKind) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for GraphKind