Sibling articles under this feature previously restated requirements in inconsistent forms.
Dependency graph and cycle policy
Platform spec feature
Dependency graph and cycle policy
Spec standingStandard
-
This feature hub owns normative MUST/SHOULD contract text for Dependency graph and cycle policy.
Context
Decision
This feature hub owns normative MUST/SHOULD contract text. Sibling articles must not redefine hub requirements and should link here for authority.
Consequences
Contract changes start on the hub or in linked ADRs, then propagate to articles and implementation anchors.
Verification anchors
site/website/src/content/docs/platform-spec/compiler/resolution-and-projects/dependency-graph-and-cycle-policy/index.mdxarticle bundle under the same feature directory.
-
Platform-spec text supersedes informal crate comments for Dependency graph and cycle policy.
Context
Implementation crates accumulated informal notes that diverged from published contracts.
Decision
Normative platform-spec prose and ADRs under this feature supersede informal comments in implementation crates until explicitly migrated into spec text.
Consequences
Engineers file spec/ADR updates when behavior changes; crate comments are non-authoritative for conformance arguments.
Verification anchors
compiler/crates/beskid_tests/src/projects/corelib/layout.rscompiler/crates/beskid_tests/src/projects/corelib/mod.rscompiler/crates/beskid_cli/src/commands/doc.rs
-
Silent cycle handling broke workspace diagnostics parity.
Context
Silent cycle handling broke workspace diagnostics parity.
Decision
Directed cycles must be reported during graph build;
Modcycles must include mod id in the diagnostic path.Consequences
Policy knobs (
error,warn, permissive) select abort vs continue; default remains fail-closed for release builds.Verification anchors
beskid_analysis::projects::graphcompiler/crates/beskid_tests/src/projects/corelib/layout.rs.
- Dependency graph and cycle policy - Contracts and edge cases States the normative guarantees and what happens at boundaries or failure edges.
- Dependency graph and cycle policy - Design model Explains the persistent concepts, entities, and boundaries this feature relies on.
- Dependency graph and cycle policy - Examples Gives concrete newcomer-friendly scenarios mapped to real compiler paths.
- Dependency graph and cycle policy - FAQ and troubleshooting Answers common operator and contributor questions with practical next checks.
- Dependency graph and cycle policy - Flow and algorithm Walks through runtime/order-of-operations behavior in the implementation.
- Dependency graph and cycle policy - Verification and traceability Shows how the team proves this feature works and where evidence lives.
0 revisions (git unavailable at build; counts may be empty)
No commits recorded for this path.
Full tree: run pnpm verify:platform-spec-layout (writes src/generated/platform-spec-layout-report.json).
This feature hub defines the normative contract for dependency graph and cycle policy and links newcomer-oriented reference articles.
Implementation anchors
Section titled “Implementation anchors”compiler/crates/beskid_tests/src/projects/corelib/layout.rsmodels multi-project dependency layouts.compiler/crates/beskid_tests/src/projects/corelib/mod.rschecks graph expectations.compiler/crates/beskid_cli/src/commands/doc.rsconsumes resolved dependency context for docs.
Decisions
Section titled “Decisions”No open decisions. Closed choices are normative ADRs under adr/ (D-COMP-PROJ-0001 … D-COMP-PROJ-0003); use the reader ADRs tab for expandable detail.