Number of nodes allocated so far.

FNV-1a 64-bit content hash of a string — the canonical "stable symbol hash" used wherever a string's identity must survive across runs and across crat

Allocate a node with the given children (copied into the edge arena).

Append a record while preserving the incrementally extended evidence index.

Build a [`Span`] from a CST node (1-based inclusive lines).

Resolve a [`Symbol`] back to its string. Panics if the symbol came from a different interner (a programming error).

Whether `other` is wholly contained in this half-open byte range.

Intern `s`, returning its stable [`Symbol`].

Source text covered by a CST node.

Write `families` as the accepted baseline, sorted by id for stable git diffs.

An empty `Block` (used for absent loop init/update slots, empty bodies).

Value-graph fingerprint of the first function unit.

Lower a single in-memory source buffer.

Flatten a commutative-operator chain rooted at `root` (same `key`) into its leaf operands, so two chains can be matched as multisets rather than posit

Whether every dependency of `record` (transitively) resolves and is `Asserted`. Id resolution goes through the lazy evidence index — the previous per-

Evidence records whose anchor sits exactly at `span` (all anchor kinds match by exact span equality). Backed by the lazy evidence index, so a caller n

Write a small project (a 3-copy clone family + a decoy) into a unique temp dir.

A `Var` carrying the raw identifier name (canonicalized later).

An opaque `Raw` node wrapping `children`, tagged with the original surface kind for debugging. Used for constructs a frontend does not lower.

`left` is the unique first source member of this row, also its visit tag.

Lower a string literal, retaining a content hash so behavior-defining string constants (`"OPTIONS"`/`"HEAD"`, locale messages, schema-format keys) are

A content hash of a symbol's string (FNV-1a). Stable across runs — unlike the interner-assigned id — so it is safe to use in reproducible fingerprints