Function registered_semantic_windows 

pub fn registered_semantic_windows(
    normalization: &ApiNormalization,
) -> Result<Vec<SemanticGraphWindow>, SemanticGraphError>

Extract the largest source-contiguous windows that a same-variant rule can justify on its own.

The extractor never enumerates arbitrary subgraphs. Sequence rules receive their maximal contiguous run, direct constructs receive one node, and a resource rule receives only an explicit acquire/release pair. This bounds partial matching before candidate indexing and preserves a concise rule explanation for every returned fragment.

Errors

Returns SemanticGraphError only if a validated graph cannot be rebased into one of its own windows.