Struct LookupOutcome 

pub struct LookupOutcome {
    pub key: CacheKey,
    pub chunk: Option<Chunk>,
    pub manifest: Option<ContextManifest>,
    pub link_table: Option<Arc<GraphLinkTable>>,
}

Result of a cache lookup. Carries the precomputed key so the caller can write it back on a miss without rehashing.

Fields

key: CacheKey

chunk: Option<Chunk>

manifest: Option<ContextManifest>

Graph observations to persist alongside the chunk, so the next spawn can re-check them with stats instead of walking. None when the graph holds something stats cannot describe.

link_table: Option<Arc<GraphLinkTable>>

The graph’s link table, present only when this lookup proved a stored manifest current. Hand it to the VM and module loading resolves every module the table names without reading its source.

Deliberately absent whenever the walk ran, even though the walk’s observations are just as accurate: the walk has already read every file into module_source’s memo, so a table would save nothing and cost a map to build.

Implementations

impl LookupOutcome

pub fn store(&self, chunk: &Chunk) -> Result<()>

Persist chunk under the key this lookup computed, with the manifest it observed.

The pairing is the point: the key and the manifest describe one walk of one graph, and storing a chunk against a manifest from a different walk would let a later spawn prove the wrong thing. Callers cannot get that pairing wrong if they never have to assemble it.