Abstract

A method is disclosed for gating publication of a documentation corpus on the resolvability of the references its prose makes to scripts, manifests, migrations and endpoints, each mention being an obligation the repository must satisfy. Candidates are extracted by ordered masking passes, each matching one syntactic form, emitting labelled candidates and overwriting its matches with equal-length filler before the next pass, so no span is counted twice; a fence state carried across lines labels candidates inside a fenced block as fenced, with the block's declared language, rather than discarding them. An ordered classification ladder, whose early rungs recognize recurring non-references, consults an index of documents embedded as block-scalar members of configuration objects before resolving by file base name, since base-name resolution would send the reader to an unrelated same-named file. A reference in an unresolvable class must be discharged by an entry in a committed disposition register; otherwise publication is refused, naming the entry, line, normalized path and admissible remedies. A whole-file reference whose path indicates secret material is catalogued without its bytes being read, under a two-part rule whose fixture table the cataloguing and verifying consumers evaluate on every run. Digests are taken over exactly the representation whose length is recorded, and verification is content-addressed, so a dead locator whose content is found elsewhere is a locator repair rather than a loss. The gate fails on its own inability to run: a skipped rule evaluation is fatal, and a scoped run selecting nothing aborts with a distinct status.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.

Share

COinS