-
Notifications
You must be signed in to change notification settings - Fork 295
Closed
Labels
Description
Problem
Operators depend on deterministic semantic import ordering in compiled outputs; if ordering regresses to lexical during refactors, dependency behavior can change silently and create hard-to-debug execution drift.
Why now
Import/topology codepaths are actively evolving, and ordering regressions are historically easy to reintroduce when tests only validate happy-path compile success.
Evidence packet
- Commit under test:
f5a6c65a740bb4286bfdcb27dea7691bbd7ebc07(origin/main, 2026-02-19) - Runtime environment:
go1.25.7 darwin/arm64,macOS 26.3 - Minimal repro:
- Create fixtures where dependency order conflicts with lexical filename order.
- Compile via import processor path and dependency graph path.
- Compare emitted import/workflow ordering.
- Expected: output ordering is topological (dependency semantics first), regardless of lexical names.
- Actual: current coverage does not lock this as an explicit cross-path contract, leaving room for lexical-order regressions.
Acceptance
- Add regression tests that fail if import output ordering deviates from topological constraints for the same graph.
- Keep ordering deterministic for independent nodes (explicit tie-break rule documented in test expectations).
Reactions are currently unavailable