docs: plan crate boundary experiment

This commit is contained in:
Dandaedre 2026-09-29 21:20:25 +02:00
parent c12b6b8551
commit 1fbc44e9db
Signed by: Dandaedre
GPG Key ID: 440C6592E8A26D99
1 changed files with 21 additions and 0 deletions

View File

@ -315,6 +315,27 @@ Clippy, and documentation pass; deprecated Rust aliases and the legacy CLI alias
are covered; Tarpaulin remains at 92.19% (1,334/1,447 lines) against the 90%
floor; and the generated badges are current.
## Milestone 12 — Experimental crate boundary
- [x] Capture reproducible baseline cold and incremental check times from
`milestone-11`, identify dependency ownership, and choose the smallest crate
boundary capable of excluding async/LSP dependencies from core builds.
- [ ] Extract the reusable detector/configuration/input implementation into a
`john-slop-core` workspace crate and the protocol engine into a
`john-slop-lsp` workspace crate. Keep the root package as the compatibility
facade and binary distribution, preserving public behavior and all three
executable names.
- [ ] Run identical clean and incremental measurements on the experiment,
compare compile time, artifact size, dependency isolation, API/release cost,
tests, coverage, and packaging against `milestone-11`, then record an explicit
merge-or-abandon recommendation.
Acceptance: the branch contains a reviewable implementation commit and a
reproducible before/after report; all existing behavior and quality gates pass;
any claimed build improvement is measured rather than inferred. Do not merge
the experiment when its gains do not justify the added workspace and release
complexity.
## Deferred by design
- Statistical or model-based authorship classification.