audit-tools 0.55.14 → 0.55.16

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (158) hide show
  1. package/dist/audit/cli/auditStep.d.ts.map +1 -1
  2. package/dist/audit/cli/auditStep.js +4 -3
  3. package/dist/audit/cli/auditStep.js.map +1 -1
  4. package/dist/audit/cli/charterComparisonPrompt.d.ts.map +1 -1
  5. package/dist/audit/cli/charterComparisonPrompt.js +8 -1
  6. package/dist/audit/cli/charterComparisonPrompt.js.map +1 -1
  7. package/dist/audit/cli/conceptualDispatch.d.ts.map +1 -1
  8. package/dist/audit/cli/conceptualDispatch.js +9 -5
  9. package/dist/audit/cli/conceptualDispatch.js.map +1 -1
  10. package/dist/audit/cli/confirmIntentStep.d.ts.map +1 -1
  11. package/dist/audit/cli/confirmIntentStep.js +25 -11
  12. package/dist/audit/cli/confirmIntentStep.js.map +1 -1
  13. package/dist/audit/cli/dispatch/hostHandoff.d.ts +65 -1
  14. package/dist/audit/cli/dispatch/hostHandoff.d.ts.map +1 -1
  15. package/dist/audit/cli/dispatch/hostHandoff.js +329 -126
  16. package/dist/audit/cli/dispatch/hostHandoff.js.map +1 -1
  17. package/dist/audit/cli/fanoutLanes.d.ts +1 -1
  18. package/dist/audit/cli/fanoutLanes.d.ts.map +1 -1
  19. package/dist/audit/cli/fanoutLanes.js +4 -2
  20. package/dist/audit/cli/fanoutLanes.js.map +1 -1
  21. package/dist/audit/cli/functionalPreflight.d.ts.map +1 -1
  22. package/dist/audit/cli/functionalPreflight.js +5 -1
  23. package/dist/audit/cli/functionalPreflight.js.map +1 -1
  24. package/dist/audit/cli/nextStepCommand.d.ts.map +1 -1
  25. package/dist/audit/cli/nextStepCommand.js +17 -15
  26. package/dist/audit/cli/nextStepCommand.js.map +1 -1
  27. package/dist/audit/cli/nextStepHelpers.d.ts.map +1 -1
  28. package/dist/audit/cli/nextStepHelpers.js +4 -3
  29. package/dist/audit/cli/nextStepHelpers.js.map +1 -1
  30. package/dist/audit/cli/prompts.d.ts +2 -0
  31. package/dist/audit/cli/prompts.d.ts.map +1 -1
  32. package/dist/audit/cli/prompts.js +21 -3
  33. package/dist/audit/cli/prompts.js.map +1 -1
  34. package/dist/audit/cli/semanticReviewStep.d.ts.map +1 -1
  35. package/dist/audit/cli/semanticReviewStep.js +71 -6
  36. package/dist/audit/cli/semanticReviewStep.js.map +1 -1
  37. package/dist/audit/cli/validateResultsCommand.d.ts +11 -0
  38. package/dist/audit/cli/validateResultsCommand.d.ts.map +1 -1
  39. package/dist/audit/cli/validateResultsCommand.js +56 -4
  40. package/dist/audit/cli/validateResultsCommand.js.map +1 -1
  41. package/dist/audit/decompose/buildStructureDecomposition.d.ts +11 -5
  42. package/dist/audit/decompose/buildStructureDecomposition.d.ts.map +1 -1
  43. package/dist/audit/decompose/buildStructureDecomposition.js +17 -8
  44. package/dist/audit/decompose/buildStructureDecomposition.js.map +1 -1
  45. package/dist/audit/extractors/analyzers/complexityDuplication.d.ts +50 -10
  46. package/dist/audit/extractors/analyzers/complexityDuplication.d.ts.map +1 -1
  47. package/dist/audit/extractors/analyzers/complexityDuplication.js +175 -27
  48. package/dist/audit/extractors/analyzers/complexityDuplication.js.map +1 -1
  49. package/dist/audit/extractors/designAssessment.d.ts.map +1 -1
  50. package/dist/audit/extractors/designAssessment.js +186 -143
  51. package/dist/audit/extractors/designAssessment.js.map +1 -1
  52. package/dist/audit/extractors/docsDigest.d.ts.map +1 -1
  53. package/dist/audit/extractors/docsDigest.js +6 -0
  54. package/dist/audit/extractors/docsDigest.js.map +1 -1
  55. package/dist/audit/extractors/flows.d.ts +9 -5
  56. package/dist/audit/extractors/flows.d.ts.map +1 -1
  57. package/dist/audit/extractors/flows.js +59 -9
  58. package/dist/audit/extractors/flows.js.map +1 -1
  59. package/dist/audit/extractors/graph.d.ts +8 -1
  60. package/dist/audit/extractors/graph.d.ts.map +1 -1
  61. package/dist/audit/extractors/graph.js +16 -6
  62. package/dist/audit/extractors/graph.js.map +1 -1
  63. package/dist/audit/extractors/graphSignals.d.ts +9 -1
  64. package/dist/audit/extractors/graphSignals.d.ts.map +1 -1
  65. package/dist/audit/extractors/graphSignals.js +12 -1
  66. package/dist/audit/extractors/graphSignals.js.map +1 -1
  67. package/dist/audit/extractors/pathPatterns.d.ts +5 -0
  68. package/dist/audit/extractors/pathPatterns.d.ts.map +1 -1
  69. package/dist/audit/extractors/pathPatterns.js +47 -3
  70. package/dist/audit/extractors/pathPatterns.js.map +1 -1
  71. package/dist/audit/extractors/risk.d.ts.map +1 -1
  72. package/dist/audit/extractors/risk.js +3 -6
  73. package/dist/audit/extractors/risk.js.map +1 -1
  74. package/dist/audit/io/runArtifacts.d.ts +6 -0
  75. package/dist/audit/io/runArtifacts.d.ts.map +1 -1
  76. package/dist/audit/io/runArtifacts.js +9 -0
  77. package/dist/audit/io/runArtifacts.js.map +1 -1
  78. package/dist/audit/orchestrator/advance.d.ts.map +1 -1
  79. package/dist/audit/orchestrator/advance.js +3 -0
  80. package/dist/audit/orchestrator/advance.js.map +1 -1
  81. package/dist/audit/orchestrator/architectureDiscovery.d.ts +9 -0
  82. package/dist/audit/orchestrator/architectureDiscovery.d.ts.map +1 -1
  83. package/dist/audit/orchestrator/architectureDiscovery.js +11 -1
  84. package/dist/audit/orchestrator/architectureDiscovery.js.map +1 -1
  85. package/dist/audit/orchestrator/artifactMetadata.d.ts.map +1 -1
  86. package/dist/audit/orchestrator/artifactMetadata.js +7 -0
  87. package/dist/audit/orchestrator/artifactMetadata.js.map +1 -1
  88. package/dist/audit/orchestrator/charterPackets.d.ts +36 -7
  89. package/dist/audit/orchestrator/charterPackets.d.ts.map +1 -1
  90. package/dist/audit/orchestrator/charterPackets.js +88 -21
  91. package/dist/audit/orchestrator/charterPackets.js.map +1 -1
  92. package/dist/audit/orchestrator/dependencyMap.d.ts.map +1 -1
  93. package/dist/audit/orchestrator/dependencyMap.js +21 -13
  94. package/dist/audit/orchestrator/dependencyMap.js.map +1 -1
  95. package/dist/audit/orchestrator/dependencySlices.d.ts.map +1 -1
  96. package/dist/audit/orchestrator/dependencySlices.js +26 -11
  97. package/dist/audit/orchestrator/dependencySlices.js.map +1 -1
  98. package/dist/audit/orchestrator/designReviewPrompt.d.ts.map +1 -1
  99. package/dist/audit/orchestrator/designReviewPrompt.js +107 -9
  100. package/dist/audit/orchestrator/designReviewPrompt.js.map +1 -1
  101. package/dist/audit/orchestrator/ingestionExecutors.d.ts.map +1 -1
  102. package/dist/audit/orchestrator/ingestionExecutors.js +8 -4
  103. package/dist/audit/orchestrator/ingestionExecutors.js.map +1 -1
  104. package/dist/audit/orchestrator/intentCheckpointExecutor.d.ts.map +1 -1
  105. package/dist/audit/orchestrator/intentCheckpointExecutor.js +43 -24
  106. package/dist/audit/orchestrator/intentCheckpointExecutor.js.map +1 -1
  107. package/dist/audit/orchestrator/planningExecutors.d.ts.map +1 -1
  108. package/dist/audit/orchestrator/planningExecutors.js +3 -3
  109. package/dist/audit/orchestrator/planningExecutors.js.map +1 -1
  110. package/dist/audit/orchestrator/runtimeValidation.d.ts +6 -0
  111. package/dist/audit/orchestrator/runtimeValidation.d.ts.map +1 -1
  112. package/dist/audit/orchestrator/runtimeValidation.js +26 -0
  113. package/dist/audit/orchestrator/runtimeValidation.js.map +1 -1
  114. package/dist/audit/orchestrator/state.d.ts.map +1 -1
  115. package/dist/audit/orchestrator/state.js +4 -2
  116. package/dist/audit/orchestrator/state.js.map +1 -1
  117. package/dist/audit/orchestrator/structureExecutors.d.ts.map +1 -1
  118. package/dist/audit/orchestrator/structureExecutors.js +2 -1
  119. package/dist/audit/orchestrator/structureExecutors.js.map +1 -1
  120. package/dist/audit/orchestrator/systemicChallengeExecutor.d.ts +9 -0
  121. package/dist/audit/orchestrator/systemicChallengeExecutor.d.ts.map +1 -1
  122. package/dist/audit/orchestrator/systemicChallengeExecutor.js +12 -2
  123. package/dist/audit/orchestrator/systemicChallengeExecutor.js.map +1 -1
  124. package/dist/audit/systemic/reviewFileMap.d.ts +92 -45
  125. package/dist/audit/systemic/reviewFileMap.d.ts.map +1 -1
  126. package/dist/audit/systemic/reviewFileMap.js +171 -94
  127. package/dist/audit/systemic/reviewFileMap.js.map +1 -1
  128. package/dist/audit/systemic/secondOrderAdversaryPrompt.d.ts +15 -6
  129. package/dist/audit/systemic/secondOrderAdversaryPrompt.d.ts.map +1 -1
  130. package/dist/audit/systemic/secondOrderAdversaryPrompt.js +119 -36
  131. package/dist/audit/systemic/secondOrderAdversaryPrompt.js.map +1 -1
  132. package/dist/audit/types/artifactMetadata.d.ts +2 -0
  133. package/dist/audit/types/artifactMetadata.d.ts.map +1 -1
  134. package/dist/audit/types/designAssessment.d.ts +11 -0
  135. package/dist/audit/types/designAssessment.d.ts.map +1 -1
  136. package/dist/audit/types/designAssessment.js +23 -1
  137. package/dist/audit/types/designAssessment.js.map +1 -1
  138. package/dist/shared/analyzers/acquisitionEngine.d.ts +18 -0
  139. package/dist/shared/analyzers/acquisitionEngine.d.ts.map +1 -1
  140. package/dist/shared/analyzers/acquisitionEngine.js +19 -1
  141. package/dist/shared/analyzers/acquisitionEngine.js.map +1 -1
  142. package/dist/shared/analyzers/candidates.d.ts.map +1 -1
  143. package/dist/shared/analyzers/candidates.js +103 -7
  144. package/dist/shared/analyzers/candidates.js.map +1 -1
  145. package/dist/shared/decompose/charterExtraction.d.ts +117 -17
  146. package/dist/shared/decompose/charterExtraction.d.ts.map +1 -1
  147. package/dist/shared/decompose/charterExtraction.js +27 -3
  148. package/dist/shared/decompose/charterExtraction.js.map +1 -1
  149. package/dist/shared/decompose/systemicChallenge.d.ts.map +1 -1
  150. package/dist/shared/decompose/systemicChallenge.js +4 -1
  151. package/dist/shared/decompose/systemicChallenge.js.map +1 -1
  152. package/dist/shared/index.d.ts +1 -1
  153. package/dist/shared/index.d.ts.map +1 -1
  154. package/dist/shared/index.js +1 -1
  155. package/dist/shared/index.js.map +1 -1
  156. package/dist/shared/prompts.js +1 -1
  157. package/dist/shared/prompts.js.map +1 -1
  158. package/package.json +1 -1
@@ -1,4 +1,4 @@
1
- // sites-pinned: tests/audit/frozen-snapshot.test.ts
1
+ // sites-pinned: tests/audit/frozen-snapshot.test.ts, tests/audit/inspection-handoff-binding.test.ts
2
2
  import { readJsonFile } from "audit-tools/shared";
3
3
  import { resolve } from "node:path";
4
4
  import { loadArtifactBundle } from "../io/artifacts.js";
@@ -6,18 +6,69 @@ import { validateAuditResults } from "../validation/auditResults.js";
6
6
  import { buildLineIndex } from "./lineIndex.js";
7
7
  import { readRunSourceRoot } from "../io/runSnapshot.js";
8
8
  import { getArtifactsDir, getFlag, getRootDir } from "./args.js";
9
+ import { checkAuditHostResult } from "./dispatch/hostHandoff.js";
10
+ const SHAPE_HINT = "validate-results takes either a semantic-review result — the audit-host-result/v1alpha1 object a work item's prompt " +
11
+ "asks for, written at its bound result_path under runs/<run id>/host-results/ — or, for `ingest-results --results`, " +
12
+ "a JSON array of AuditResult objects (wrap a single AuditResult in [ ]).";
13
+ /**
14
+ * A host result is recognized by what it declares OR by where it lives: a file
15
+ * at a host-results path is judged by the host door even when its
16
+ * `contract_version` is misspelled, so the host gets that door's refusal and not
17
+ * the array door's.
18
+ */
19
+ function isHostResult(value, path) {
20
+ if (Array.isArray(value))
21
+ return false;
22
+ const declared = typeof value === "object" &&
23
+ value !== null &&
24
+ typeof value.contract_version === "string" &&
25
+ value.contract_version.startsWith("audit-host-result/");
26
+ return declared || /(^|\/)host-results\/[^/]+$/u.test(resolve(path).replace(/\\/g, "/"));
27
+ }
28
+ /**
29
+ * Check a results file BEFORE it is ingested, by the rules of the door it will
30
+ * go through:
31
+ * - a host result (what every semantic-review work item asks for) is judged
32
+ * by `checkAuditHostResult`, the same judgment — and the same classified
33
+ * refusals — the next-step fold applies when it ingests that file;
34
+ * - anything else is judged by `validateAuditResults`, the gate of
35
+ * `ingest-results --results` (a JSON array of AuditResults); a lone object
36
+ * also gets a hint naming both shapes.
37
+ * Neither branch writes anything.
38
+ */
9
39
  export async function cmdValidateResults(argv) {
10
40
  const artifactsDir = getArtifactsDir(argv);
11
41
  const resultsPath = getFlag(argv, "--results");
12
42
  if (!resultsPath) {
13
43
  throw new Error("validate-results requires --results <file>");
14
44
  }
45
+ const root = getRootDir(argv);
15
46
  const bundle = await loadArtifactBundle(artifactsDir);
47
+ const sourceRoot = await readRunSourceRoot(root, artifactsDir);
16
48
  const lineIndex = bundle.repo_manifest
17
- ? await buildLineIndex(await readRunSourceRoot(getRootDir(argv), artifactsDir), bundle.repo_manifest)
49
+ ? await buildLineIndex(sourceRoot, bundle.repo_manifest)
18
50
  : undefined;
19
- const auditResults = await readJsonFile(resultsPath);
20
- const issues = validateAuditResults(auditResults, bundle.audit_tasks ?? [], {
51
+ const results = await readJsonFile(resultsPath);
52
+ if (isHostResult(results, resultsPath)) {
53
+ const check = await checkAuditHostResult({
54
+ root,
55
+ sourceRoot,
56
+ artifactsDir,
57
+ resultPath: resultsPath,
58
+ auditTasks: bundle.audit_tasks ?? [],
59
+ lineIndex,
60
+ });
61
+ console.log(JSON.stringify({
62
+ artifacts_dir: artifactsDir,
63
+ results_path: resolve(resultsPath),
64
+ ...check,
65
+ warning_count: check.validation_warnings.length,
66
+ error_count: check.issues.length,
67
+ }, null, 2));
68
+ process.exitCode = check.issues.length > 0 ? 1 : 0;
69
+ return;
70
+ }
71
+ const issues = validateAuditResults(results, bundle.audit_tasks ?? [], {
21
72
  lineIndex,
22
73
  });
23
74
  const errors = issues.filter((issue) => issue.severity === "error");
@@ -28,6 +79,7 @@ export async function cmdValidateResults(argv) {
28
79
  warning_count: warnings.length,
29
80
  error_count: errors.length,
30
81
  issues,
82
+ ...(Array.isArray(results) ? {} : { hint: SHAPE_HINT }),
31
83
  }, null, 2));
32
84
  process.exitCode = errors.length > 0 ? 1 : 0;
33
85
  }
@@ -1 +1 @@
1
- {"version":3,"file":"validateResultsCommand.js","sourceRoot":"","sources":["../../../src/audit/cli/validateResultsCommand.ts"],"names":[],"mappings":"AAAA,oDAAoD;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EAAE,oBAAoB,EAAE,MAAM,+BAA+B,CAAC;AACrE,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAEjE,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,IAAc;IACrD,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC/C,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,kBAAkB,CAAC,YAAY,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,MAAM,CAAC,aAAa;QACpC,CAAC,CAAC,MAAM,cAAc,CAAC,MAAM,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,YAAY,CAAC,EAAE,MAAM,CAAC,aAAa,CAAC;QACrG,CAAC,CAAC,SAAS,CAAC;IACd,MAAM,YAAY,GAAG,MAAM,YAAY,CAAU,WAAW,CAAC,CAAC;IAC9D,MAAM,MAAM,GAAG,oBAAoB,CAAC,YAAY,EAAE,MAAM,CAAC,WAAW,IAAI,EAAE,EAAE;QAC1E,SAAS;KACV,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC;IACpE,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC;IACxE,OAAO,CAAC,GAAG,CACT,IAAI,CAAC,SAAS,CACZ;QACE,aAAa,EAAE,YAAY;QAC3B,YAAY,EAAE,OAAO,CAAC,WAAW,CAAC;QAClC,aAAa,EAAE,QAAQ,CAAC,MAAM;QAC9B,WAAW,EAAE,MAAM,CAAC,MAAM;QAC1B,MAAM;KACP,EACD,IAAI,EACJ,CAAC,CACF,CACF,CAAC;IACF,OAAO,CAAC,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC"}
1
+ {"version":3,"file":"validateResultsCommand.js","sourceRoot":"","sources":["../../../src/audit/cli/validateResultsCommand.ts"],"names":[],"mappings":"AAAA,oGAAoG;AACpG,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EAAE,oBAAoB,EAAE,MAAM,+BAA+B,CAAC;AACrE,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACjE,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAEjE,MAAM,UAAU,GACd,sHAAsH;IACtH,qHAAqH;IACrH,yEAAyE,CAAC;AAE5E;;;;;GAKG;AACH,SAAS,YAAY,CAAC,KAAc,EAAE,IAAY;IAChD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACvC,MAAM,QAAQ,GACZ,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,OAAQ,KAAwC,CAAC,gBAAgB,KAAK,QAAQ;QAC7E,KAAsC,CAAC,gBAAgB,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;IAC5F,OAAO,QAAQ,IAAI,6BAA6B,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;AAC3F,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,IAAc;IACrD,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC/C,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,MAAM,GAAG,MAAM,kBAAkB,CAAC,YAAY,CAAC,CAAC;IACtD,MAAM,UAAU,GAAG,MAAM,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAC/D,MAAM,SAAS,GAAG,MAAM,CAAC,aAAa;QACpC,CAAC,CAAC,MAAM,cAAc,CAAC,UAAU,EAAE,MAAM,CAAC,aAAa,CAAC;QACxD,CAAC,CAAC,SAAS,CAAC;IACd,MAAM,OAAO,GAAG,MAAM,YAAY,CAAU,WAAW,CAAC,CAAC;IAEzD,IAAI,YAAY,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,oBAAoB,CAAC;YACvC,IAAI;YACJ,UAAU;YACV,YAAY;YACZ,UAAU,EAAE,WAAW;YACvB,UAAU,EAAE,MAAM,CAAC,WAAW,IAAI,EAAE;YACpC,SAAS;SACV,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CACT,IAAI,CAAC,SAAS,CACZ;YACE,aAAa,EAAE,YAAY;YAC3B,YAAY,EAAE,OAAO,CAAC,WAAW,CAAC;YAClC,GAAG,KAAK;YACR,aAAa,EAAE,KAAK,CAAC,mBAAmB,CAAC,MAAM;YAC/C,WAAW,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM;SACjC,EACD,IAAI,EACJ,CAAC,CACF,CACF,CAAC;QACF,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO;IACT,CAAC;IAED,MAAM,MAAM,GAAG,oBAAoB,CAAC,OAAO,EAAE,MAAM,CAAC,WAAW,IAAI,EAAE,EAAE;QACrE,SAAS;KACV,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC;IACpE,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC;IACxE,OAAO,CAAC,GAAG,CACT,IAAI,CAAC,SAAS,CACZ;QACE,aAAa,EAAE,YAAY;QAC3B,YAAY,EAAE,OAAO,CAAC,WAAW,CAAC;QAClC,aAAa,EAAE,QAAQ,CAAC,MAAM;QAC9B,WAAW,EAAE,MAAM,CAAC,MAAM;QAC1B,MAAM;QACN,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;KACxD,EACD,IAAI,EACJ,CAAC,CACF,CACF,CAAC;IACF,OAAO,CAAC,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC"}
@@ -2,11 +2,17 @@ import type { FileDisposition, GraphBundle } from "audit-tools/shared";
2
2
  import type { RepoManifest } from "../types.js";
3
3
  import type { StructureDecomposition } from "../types/structureDecomposition.js";
4
4
  /**
5
- * The pipeline's ONE definition of a prose/doc-intent file: `doc_only`-statused
6
- * OR doc-extensioned, and not excluded/binary. Single-sourced here because two
7
- * consumers must agree exactly: the decomposition's doc-group universe below,
8
- * and the charter dependency-slice projection (`dependencySlices.ts`), whose
9
- * doc set under-stales charter extraction if it is ever narrower than this.
5
+ * The pipeline's ONE definition of a prose/doc-intent file: doc-extensioned
6
+ * (prose), and not excluded/binary. Single-sourced here because its consumers
7
+ * must agree exactly: the decomposition's doc-group universe below, the docs
8
+ * digest, and the charter packet read-set (`charterPacketReadSet`), from which
9
+ * the charter dependency slice derives.
10
+ *
11
+ * `doc_only` status alone does NOT make a file prose: disposition gives that
12
+ * status to everything it judges "not auditable code" — examples and fixtures
13
+ * (JSON, JSONL logs, harness `.ts`), licenses, and any file under a `docs/`
14
+ * segment (baseline JSON included). Those state no intent, and admitting them
15
+ * filled a dogfood stated packet with fixture data.
10
16
  */
11
17
  export declare function isDocIntentFile(path: string, status: string): boolean;
12
18
  export interface BuildStructureDecompositionParams {
@@ -1 +1 @@
1
- {"version":3,"file":"buildStructureDecomposition.d.ts","sourceRoot":"","sources":["../../../src/audit/decompose/buildStructureDecomposition.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EACV,eAAe,EACf,WAAW,EAEZ,MAAM,oBAAoB,CAAC;AAE5B,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAUjF;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAGrE;AAID,MAAM,WAAW,iCAAiC;IAChD,4EAA4E;IAC5E,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,YAAY,CAAC;IAC3B,WAAW,EAAE,eAAe,CAAC;IAC7B,WAAW,EAAE,WAAW,CAAC;IACzB,iEAAiE;IACjE,YAAY,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;CACjE;AAmBD,wBAAsB,2BAA2B,CAC/C,MAAM,EAAE,iCAAiC,GACxC,OAAO,CAAC,sBAAsB,CAAC,CA6EjC"}
1
+ {"version":3,"file":"buildStructureDecomposition.d.ts","sourceRoot":"","sources":["../../../src/audit/decompose/buildStructureDecomposition.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EACV,eAAe,EACf,WAAW,EAEZ,MAAM,oBAAoB,CAAC;AAE5B,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAUjF;;;;;;;;;;;;GAYG;AAEH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAGrE;AAID,MAAM,WAAW,iCAAiC;IAChD,4EAA4E;IAC5E,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,YAAY,CAAC;IAC3B,WAAW,EAAE,eAAe,CAAC;IAC7B,WAAW,EAAE,WAAW,CAAC;IACzB,iEAAiE;IACjE,YAAY,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;CACjE;AAmBD,wBAAsB,2BAA2B,CAC/C,MAAM,EAAE,iCAAiC,GACxC,OAAO,CAAC,sBAAsB,CAAC,CA+EjC"}
@@ -9,16 +9,23 @@ import { buildStructureSources } from "./sources.js";
9
9
  import { detectNonColocalization } from "./findings.js";
10
10
  const DOC_EXTENSION = /\.(md|markdown|adoc|rst|txt)$/i;
11
11
  /**
12
- * The pipeline's ONE definition of a prose/doc-intent file: `doc_only`-statused
13
- * OR doc-extensioned, and not excluded/binary. Single-sourced here because two
14
- * consumers must agree exactly: the decomposition's doc-group universe below,
15
- * and the charter dependency-slice projection (`dependencySlices.ts`), whose
16
- * doc set under-stales charter extraction if it is ever narrower than this.
12
+ * The pipeline's ONE definition of a prose/doc-intent file: doc-extensioned
13
+ * (prose), and not excluded/binary. Single-sourced here because its consumers
14
+ * must agree exactly: the decomposition's doc-group universe below, the docs
15
+ * digest, and the charter packet read-set (`charterPacketReadSet`), from which
16
+ * the charter dependency slice derives.
17
+ *
18
+ * `doc_only` status alone does NOT make a file prose: disposition gives that
19
+ * status to everything it judges "not auditable code" — examples and fixtures
20
+ * (JSON, JSONL logs, harness `.ts`), licenses, and any file under a `docs/`
21
+ * segment (baseline JSON included). Those state no intent, and admitting them
22
+ * filled a dogfood stated packet with fixture data.
17
23
  */
24
+ // sites-pinned: tests/audit/charter-packets.test.ts
18
25
  export function isDocIntentFile(path, status) {
19
26
  if (status === "excluded" || status === "binary")
20
27
  return false;
21
- return status === "doc_only" || DOC_EXTENSION.test(path.replace(/\\/g, "/"));
28
+ return DOC_EXTENSION.test(path.replace(/\\/g, "/"));
22
29
  }
23
30
  /** Threshold at which an intent source's partitions collapse into boundary groups. */
24
31
  const INTENT_BOUNDARY_FRACTION = 0.5;
@@ -41,8 +48,10 @@ function partitionGroups(partition) {
41
48
  return groups;
42
49
  }
43
50
  export async function buildStructureDecomposition(params) {
44
- // In-scope code universe = disposition-included files; doc files (prose intent)
45
- // are the doc_only status plus markdown/asciidoc/rst by extension.
51
+ // sites-pinned: tests/audit/structure-decomposition.test.ts
52
+ // In-scope code universe = disposition-included files; doc files (prose
53
+ // intent) are the `isDocIntentFile` set — prose by extension, whatever the
54
+ // status, so a doc_only fixture or log never names files into a doc group.
46
55
  const universe = [];
47
56
  const docFiles = [];
48
57
  for (const item of params.disposition.files) {
@@ -1 +1 @@
1
- {"version":3,"file":"buildStructureDecomposition.js","sourceRoot":"","sources":["../../../src/audit/decompose/buildStructureDecomposition.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,+EAA+E;AAC/E,0DAA0D;AAC1D,0EAA0E;AAC1E,uEAAuE;AAOvE,OAAO,EAAE,sBAAsB,EAAE,SAAS,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAGtG,OAAO,EACL,0BAA0B,EAC1B,eAAe,GAChB,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,uBAAuB,EAAE,MAAM,eAAe,CAAC;AAExD,MAAM,aAAa,GAAG,gCAAgC,CAAC;AAEvD;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,MAAc;IAC1D,IAAI,MAAM,KAAK,UAAU,IAAI,MAAM,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC/D,OAAO,MAAM,KAAK,UAAU,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;AAC/E,CAAC;AACD,sFAAsF;AACtF,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAYrC,yEAAyE;AACzE,SAAS,eAAe,CAAC,SAAoB;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACrB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAC/C,MAAyC;IAEzC,gFAAgF;IAChF,mEAAmE;IACnE,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,MAAM,KAAK,UAAU;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC1D,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CACvB,CAAC;IACF,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEjF,wEAAwE;IACxE,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI;QAC/B,CAAC,CAAC,MAAM,0BAA0B,CAAC;YAC/B,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,KAAK,EAAE,cAAc;YACrB,YAAY,EAAE,MAAM,CAAC,YAAY;SAClC,CAAC;QACJ,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IACnC,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI;QAC3B,CAAC,CAAC,MAAM,eAAe,CAAC;YACpB,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,QAAQ,EAAE,UAAU;YACpB,SAAS,EAAE,cAAc;YACzB,YAAY,EAAE,MAAM,CAAC,YAAY;SAClC,CAAC;QACJ,CAAC,CAAC,EAAE,CAAC;IAEP,MAAM,OAAO,GAAG,qBAAqB,CAAC;QACpC,QAAQ,EAAE,cAAc;QACxB,WAAW,EAAE,MAAM,CAAC,WAAW;QAC/B,YAAY,EAAE,aAAa,CAAC,KAAK;QACjC,SAAS;KACV,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAE/C,8EAA8E;IAC9E,gFAAgF;IAChF,MAAM,kBAAkB,GAAG,OAAO;SAC/B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC;SACtC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAChC,MAAM,gBAAgB,GAAe,EAAE,CAAC;IACxC,MAAM,aAAa,GAAe,EAAE,CAAC;IACrC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ;YAAE,SAAS;QACzC,MAAM,MAAM,GACV,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAC5B,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC;YACxC,CAAC,CAAC,sBAAsB,CAAC,MAAM,CAAC,UAAU,EAAE,wBAAwB,CAAC,CAAC;QAC1E,gBAAgB,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;QACjC,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM,IAAI,MAAM,CAAC,EAAE,KAAK,UAAU,EAAE,CAAC;YACrD,aAAa,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,uBAAuB,CAAC;QACvC,kBAAkB;QAClB,gBAAgB;QAChB,aAAa;KACd,CAAC,CAAC;IAEH,OAAO;QACL,YAAY,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACtC,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,kBAAkB,EAAE,cAAc,CAAC,MAAM;QACzC,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACpC,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,QAAQ;KACT,CAAC;AACJ,CAAC"}
1
+ {"version":3,"file":"buildStructureDecomposition.js","sourceRoot":"","sources":["../../../src/audit/decompose/buildStructureDecomposition.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,+EAA+E;AAC/E,0DAA0D;AAC1D,0EAA0E;AAC1E,uEAAuE;AAOvE,OAAO,EAAE,sBAAsB,EAAE,SAAS,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAGtG,OAAO,EACL,0BAA0B,EAC1B,eAAe,GAChB,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,uBAAuB,EAAE,MAAM,eAAe,CAAC;AAExD,MAAM,aAAa,GAAG,gCAAgC,CAAC;AAEvD;;;;;;;;;;;;GAYG;AACH,oDAAoD;AACpD,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,MAAc;IAC1D,IAAI,MAAM,KAAK,UAAU,IAAI,MAAM,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC/D,OAAO,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;AACtD,CAAC;AACD,sFAAsF;AACtF,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAYrC,yEAAyE;AACzE,SAAS,eAAe,CAAC,SAAoB;IAC3C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACrB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAC/C,MAAyC;IAEzC,4DAA4D;IAC5D,wEAAwE;IACxE,2EAA2E;IAC3E,2EAA2E;IAC3E,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,MAAM,KAAK,UAAU;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC1D,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CACvB,CAAC;IACF,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEjF,wEAAwE;IACxE,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI;QAC/B,CAAC,CAAC,MAAM,0BAA0B,CAAC;YAC/B,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,KAAK,EAAE,cAAc;YACrB,YAAY,EAAE,MAAM,CAAC,YAAY;SAClC,CAAC;QACJ,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC;IACnC,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI;QAC3B,CAAC,CAAC,MAAM,eAAe,CAAC;YACpB,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,QAAQ,EAAE,UAAU;YACpB,SAAS,EAAE,cAAc;YACzB,YAAY,EAAE,MAAM,CAAC,YAAY;SAClC,CAAC;QACJ,CAAC,CAAC,EAAE,CAAC;IAEP,MAAM,OAAO,GAAG,qBAAqB,CAAC;QACpC,QAAQ,EAAE,cAAc;QACxB,WAAW,EAAE,MAAM,CAAC,WAAW;QAC/B,YAAY,EAAE,aAAa,CAAC,KAAK;QACjC,SAAS;KACV,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAE/C,8EAA8E;IAC9E,gFAAgF;IAChF,MAAM,kBAAkB,GAAG,OAAO;SAC/B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC;SACtC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;IAChC,MAAM,gBAAgB,GAAe,EAAE,CAAC;IACxC,MAAM,aAAa,GAAe,EAAE,CAAC;IACrC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ;YAAE,SAAS;QACzC,MAAM,MAAM,GACV,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAC5B,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC;YACxC,CAAC,CAAC,sBAAsB,CAAC,MAAM,CAAC,UAAU,EAAE,wBAAwB,CAAC,CAAC;QAC1E,gBAAgB,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;QACjC,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM,IAAI,MAAM,CAAC,EAAE,KAAK,UAAU,EAAE,CAAC;YACrD,aAAa,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,uBAAuB,CAAC;QACvC,kBAAkB;QAClB,gBAAgB;QAChB,aAAa;KACd,CAAC,CAAC;IAEH,OAAO;QACL,YAAY,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACtC,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,kBAAkB,EAAE,cAAc,CAAC,MAAM;QACzC,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACpC,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,QAAQ;KACT,CAAC;AACJ,CAAC"}
@@ -1,18 +1,58 @@
1
1
  import type { NodeMetric } from "audit-tools/shared";
2
+ import { type TsParser } from "./treeSitter.js";
2
3
  /** True for the JS/TS source files these metrics are defined over. */
3
4
  export declare function isJsTsPath(path: string): boolean;
4
5
  /**
5
- * Approximate cyclomatic complexity by counting branch/decision tokens plus a
6
- * base path of 1. Lexical (no parse) → tagged `cyclomatic-approx`. Returns
7
- * `undefined` for non-js/ts source.
6
+ * A complexity hotspot: a routine above the McCabe limit. Only the
7
+ * `cyclomatic-max-function` measure is a per-routine number. The file-level proxy
8
+ * (`cyclomatic-approx-file`, used when no grammar gave function boundaries) sums
9
+ * every branch in the file, so comparing it with a per-routine limit would flag
10
+ * a file of many small functions; it makes no hotspot claim at all.
8
11
  */
9
- export declare function computeComplexityMetric(path: string, source: string): NodeMetric | undefined;
12
+ export declare function isComplexityHotspot(metric: Pick<NodeMetric, "measure" | "value">): boolean;
10
13
  /**
11
- * Duplication measure: the count of non-trivial source lines that appear more
12
- * than once (i.e. the number of duplicated line occurrences, excluding the
13
- * first occurrence of each). Lines are normalized (trimmed + whitespace
14
- * collapsed); blank lines and lines shorter than 3 chars are ignored as noise.
15
- * Tagged `duplicate-line-count`. Returns `undefined` for non-js/ts source.
14
+ * A duplication signal: at least one line inside a repeated block. The block
15
+ * size itself ({@link CLONE_MIN_LINES}) is the cited threshold; any line the
16
+ * measure counts is already part of a clone.
17
+ */
18
+ export declare function hasDuplicatedBlock(metric: Pick<NodeMetric, "value">): boolean;
19
+ /**
20
+ * Tree-sitter parsers that give js/ts function boundaries, one per grammar.
21
+ * Each is optional: a grammar that failed to load degrades that file to the
22
+ * lexical file-level proxy, never to a missing metric.
23
+ */
24
+ export interface FunctionComplexityParsers {
25
+ typescript?: TsParser;
26
+ tsx?: TsParser;
27
+ javascript?: TsParser;
28
+ }
29
+ /**
30
+ * Load the three js/ts grammars (`tree-sitter-wasms`, a runtime dependency). The
31
+ * caller owns the returned parsers and deletes them when its build ends.
32
+ */
33
+ export declare function loadFunctionComplexityParsers(): Promise<FunctionComplexityParsers>;
34
+ /**
35
+ * Which complexity measure a file gets under `parsers` — part of the graph
36
+ * edge-cache key, so a contribution built with function boundaries and one built
37
+ * from the file-level proxy are never replayed for each other.
38
+ */
39
+ export declare function complexityScope(path: string, parsers: FunctionComplexityParsers | undefined): "function" | "file";
40
+ /**
41
+ * Cyclomatic complexity of js/ts source. With a parser for the file's grammar,
42
+ * the highest per-function cyclomatic number (`cyclomatic-max-function`).
43
+ * Without one, or if the parse throws, a lexical branch count over the whole
44
+ * file — a FILE-LEVEL PROXY (`cyclomatic-approx-file`), which overcounts against
45
+ * a per-function limit. Returns `undefined` for non-js/ts source.
46
+ */
47
+ export declare function computeComplexityMetric(path: string, source: string, parsers?: FunctionComplexityParsers): NodeMetric | undefined;
48
+ /**
49
+ * Duplication measure: the number of non-trivial source lines that lie inside a
50
+ * repeated block — a run of {@link CLONE_MIN_LINES} consecutive lines whose
51
+ * content already appeared earlier in the file, not overlapping that earlier
52
+ * copy (the first copy is the original and is not counted). Lines are
53
+ * normalized (trimmed + whitespace collapsed); blank lines and lines shorter
54
+ * than 3 chars are skipped before blocks are formed. Tagged
55
+ * `duplicate-block-lines`. Returns `undefined` for non-js/ts source.
16
56
  */
17
57
  export declare function computeDuplicationMetric(path: string, source: string): NodeMetric | undefined;
18
58
  /**
@@ -20,7 +60,7 @@ export declare function computeDuplicationMetric(path: string, source: string):
20
60
  * (so the caller records no entry at all). For js/ts, always returns both a
21
61
  * complexity and a duplication metric.
22
62
  */
23
- export declare function computeNodeMetricsForFile(path: string, source: string): {
63
+ export declare function computeNodeMetricsForFile(path: string, source: string, parsers?: FunctionComplexityParsers): {
24
64
  complexity?: NodeMetric;
25
65
  duplication?: NodeMetric;
26
66
  } | undefined;
@@ -1 +1 @@
1
- {"version":3,"file":"complexityDuplication.d.ts","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/complexityDuplication.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAoBrD,sEAAsE;AACtE,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAMhD;AAWD;;;;GAIG;AACH,wBAAgB,uBAAuB,CACrC,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,GACb,UAAU,GAAG,SAAS,CAUxB;AAWD;;;;;;GAMG;AACH,wBAAgB,wBAAwB,CACtC,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,GACb,UAAU,GAAG,SAAS,CAiBxB;AAED;;;;GAIG;AACH,wBAAgB,yBAAyB,CACvC,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,GACb;IAAE,UAAU,CAAC,EAAE,UAAU,CAAC;IAAC,WAAW,CAAC,EAAE,UAAU,CAAA;CAAE,GAAG,SAAS,CAQnE"}
1
+ {"version":3,"file":"complexityDuplication.d.ts","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/complexityDuplication.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAoC,KAAK,QAAQ,EAAe,MAAM,iBAAiB,CAAC;AAsB/F,sEAAsE;AACtE,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAMhD;AASD;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,SAAS,GAAG,OAAO,CAAC,GAAG,OAAO,CAE1F;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,GAAG,OAAO,CAE7E;AAED;;;;GAIG;AACH,MAAM,WAAW,yBAAyB;IACxC,UAAU,CAAC,EAAE,QAAQ,CAAC;IACtB,GAAG,CAAC,EAAE,QAAQ,CAAC;IACf,UAAU,CAAC,EAAE,QAAQ,CAAC;CACvB;AAED;;;GAGG;AACH,wBAAsB,6BAA6B,IAAI,OAAO,CAAC,yBAAyB,CAAC,CAOxF;AAWD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,yBAAyB,GAAG,SAAS,GAAG,UAAU,GAAG,MAAM,CAEjH;AAoED;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,EACd,OAAO,CAAC,EAAE,yBAAyB,GAClC,UAAU,GAAG,SAAS,CA0BxB;AAoBD;;;;;;;;GAQG;AACH,wBAAgB,wBAAwB,CACtC,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,GACb,UAAU,GAAG,SAAS,CAuBxB;AAED;;;;GAIG;AACH,wBAAgB,yBAAyB,CACvC,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,EACd,OAAO,CAAC,EAAE,yBAAyB,GAClC;IAAE,UAAU,CAAC,EAAE,UAAU,CAAC;IAAC,WAAW,CAAC,EAAE,UAAU,CAAA;CAAE,GAAG,SAAS,CAQnE"}
@@ -1,6 +1,9 @@
1
+ import { getTreeSitterParser } from "./treeSitter.js";
1
2
  /**
2
- * Pure-JS per-node structural analyzers (no IO — operate only on a passed-in
3
- * source string). Each helper returns a {@link NodeMetric} for js/ts source and
3
+ * Per-node structural analyzers. The compute helpers do no IO — they read only a
4
+ * passed-in source string and, for complexity, already-loaded tree-sitter
5
+ * parsers ({@link loadFunctionComplexityParsers} is the one async loader).
6
+ * Each helper returns a {@link NodeMetric} for js/ts source and
4
7
  * `undefined` for everything else, so the bundle records ABSENCE (never a
5
8
  * zero-filled metric) for non-js/ts files.
6
9
  */
@@ -23,28 +26,156 @@ export function isJsTsPath(path) {
23
26
  return false;
24
27
  return JS_TS_EXTENSIONS.some((extension) => lower.endsWith(extension));
25
28
  }
26
- // Branch / decision keywords used by the cyclomatic-approx measure. Counting
29
+ /**
30
+ * The per-MODULE (single routine) cyclomatic limit recommended by McCabe and
31
+ * Watson, NIST SP 500-235 (1996): a module whose complexity EXCEEDS 10 needs
32
+ * justification, so a routine at exactly 10 is within the limit.
33
+ */
34
+ const MCCABE_MODULE_LIMIT = 10;
35
+ /**
36
+ * A complexity hotspot: a routine above the McCabe limit. Only the
37
+ * `cyclomatic-max-function` measure is a per-routine number. The file-level proxy
38
+ * (`cyclomatic-approx-file`, used when no grammar gave function boundaries) sums
39
+ * every branch in the file, so comparing it with a per-routine limit would flag
40
+ * a file of many small functions; it makes no hotspot claim at all.
41
+ */
42
+ export function isComplexityHotspot(metric) {
43
+ return metric.measure === "cyclomatic-max-function" && metric.value > MCCABE_MODULE_LIMIT;
44
+ }
45
+ /**
46
+ * A duplication signal: at least one line inside a repeated block. The block
47
+ * size itself ({@link CLONE_MIN_LINES}) is the cited threshold; any line the
48
+ * measure counts is already part of a clone.
49
+ */
50
+ export function hasDuplicatedBlock(metric) {
51
+ return metric.value > 0;
52
+ }
53
+ /**
54
+ * Load the three js/ts grammars (`tree-sitter-wasms`, a runtime dependency). The
55
+ * caller owns the returned parsers and deletes them when its build ends.
56
+ */
57
+ export async function loadFunctionComplexityParsers() {
58
+ const [typescript, tsx, javascript] = await Promise.all([
59
+ getTreeSitterParser("typescript"),
60
+ getTreeSitterParser("tsx"),
61
+ getTreeSitterParser("javascript"),
62
+ ]);
63
+ return { typescript, tsx, javascript };
64
+ }
65
+ function parserFor(path, parsers) {
66
+ if (!parsers)
67
+ return undefined;
68
+ const lower = path.toLowerCase();
69
+ if (lower.endsWith(".tsx"))
70
+ return parsers.tsx;
71
+ if (lower.endsWith(".ts") || lower.endsWith(".mts") || lower.endsWith(".cts"))
72
+ return parsers.typescript;
73
+ // The javascript grammar parses JSX.
74
+ return parsers.javascript;
75
+ }
76
+ /**
77
+ * Which complexity measure a file gets under `parsers` — part of the graph
78
+ * edge-cache key, so a contribution built with function boundaries and one built
79
+ * from the file-level proxy are never replayed for each other.
80
+ */
81
+ export function complexityScope(path, parsers) {
82
+ return parserFor(path, parsers) ? "function" : "file";
83
+ }
84
+ // Function-like nodes in the tree-sitter javascript / typescript / tsx grammars.
85
+ // Each opens its own cyclomatic count; its decisions never reach its parent.
86
+ const FUNCTION_NODE_TYPES = new Set([
87
+ "function_declaration",
88
+ "function_expression",
89
+ "function",
90
+ "generator_function_declaration",
91
+ "generator_function",
92
+ "arrow_function",
93
+ "method_definition",
94
+ ]);
95
+ // One decision point each (`else if` is a nested if_statement; `for…of` and
96
+ // `for…in` are for_in_statement; `default:` is a switch_default, not a decision).
97
+ const DECISION_NODE_TYPES = new Set([
98
+ "if_statement",
99
+ "for_statement",
100
+ "for_in_statement",
101
+ "while_statement",
102
+ "do_statement",
103
+ "switch_case",
104
+ "catch_clause",
105
+ "ternary_expression",
106
+ ]);
107
+ const SHORT_CIRCUIT_OPERATORS = new Set(["&&", "||", "??"]);
108
+ /**
109
+ * The highest cyclomatic number (decisions + 1) of any function in the tree;
110
+ * code outside every function counts as one more routine. Iterative, so a
111
+ * deeply nested expression cannot exhaust the call stack.
112
+ */
113
+ function maxFunctionComplexity(root) {
114
+ const counters = [{ decisions: 0 }];
115
+ const stack = [
116
+ { node: root, counter: counters[0] },
117
+ ];
118
+ while (stack.length > 0) {
119
+ const { node, counter } = stack.pop();
120
+ for (const child of node.namedChildren) {
121
+ if (FUNCTION_NODE_TYPES.has(child.type)) {
122
+ const own = { decisions: 0 };
123
+ counters.push(own);
124
+ stack.push({ node: child, counter: own });
125
+ continue;
126
+ }
127
+ if (DECISION_NODE_TYPES.has(child.type) ||
128
+ (child.type === "binary_expression" &&
129
+ SHORT_CIRCUIT_OPERATORS.has(child.childForFieldName("operator")?.type ?? ""))) {
130
+ counter.decisions += 1;
131
+ }
132
+ stack.push({ node: child, counter });
133
+ }
134
+ }
135
+ return counters.reduce((max, c) => Math.max(max, c.decisions + 1), 1);
136
+ }
137
+ // Branch / decision keywords used by the lexical file-level proxy. Counting
27
138
  // these (plus one base path) approximates the number of independent paths
28
- // through the source without a full parse — deliberately a lexical heuristic,
29
- // hence the `-approx` suffix in the measure name.
139
+ // through the WHOLE file without a parse — strings, comments and `?:` optional
140
+ // markers included, every function summed together.
30
141
  // `??` is matched before the bare `?` alternative so nullish-coalescing
31
142
  // counts as ONE branch token, like `&&`/`||`, not two bare `?` matches.
32
143
  const BRANCH_KEYWORD_PATTERN = /\b(?:if|else\s+if|for|while|case|catch|do)\b|&&|\|\||\?\?|\?(?!\.)/g;
33
144
  /**
34
- * Approximate cyclomatic complexity by counting branch/decision tokens plus a
35
- * base path of 1. Lexical (no parse) → tagged `cyclomatic-approx`. Returns
36
- * `undefined` for non-js/ts source.
145
+ * Cyclomatic complexity of js/ts source. With a parser for the file's grammar,
146
+ * the highest per-function cyclomatic number (`cyclomatic-max-function`).
147
+ * Without one, or if the parse throws, a lexical branch count over the whole
148
+ * file — a FILE-LEVEL PROXY (`cyclomatic-approx-file`), which overcounts against
149
+ * a per-function limit. Returns `undefined` for non-js/ts source.
37
150
  */
38
- export function computeComplexityMetric(path, source) {
151
+ export function computeComplexityMetric(path, source, parsers) {
39
152
  if (!isJsTsPath(path))
40
153
  return undefined;
154
+ const parser = parserFor(path, parsers);
155
+ if (parser) {
156
+ let tree;
157
+ try {
158
+ tree = parser.parse(source);
159
+ return {
160
+ value: maxFunctionComplexity(tree.rootNode),
161
+ measure: "cyclomatic-max-function",
162
+ reach: "js-ts-effective",
163
+ };
164
+ }
165
+ catch {
166
+ // Fall through to the file-level proxy: a parse failure must not drop the metric.
167
+ }
168
+ finally {
169
+ tree?.delete();
170
+ }
171
+ }
41
172
  BRANCH_KEYWORD_PATTERN.lastIndex = 0;
42
173
  let branches = 0;
43
174
  while (BRANCH_KEYWORD_PATTERN.exec(source) !== null)
44
175
  branches += 1;
45
176
  return {
46
177
  value: branches + 1,
47
- measure: "cyclomatic-approx",
178
+ measure: "cyclomatic-approx-file",
48
179
  reach: "js-ts-effective",
49
180
  };
50
181
  }
@@ -57,30 +188,47 @@ function normalizeLine(line) {
57
188
  return line.trim().replace(/\s+/g, " ");
58
189
  }
59
190
  /**
60
- * Duplication measure: the count of non-trivial source lines that appear more
61
- * than once (i.e. the number of duplicated line occurrences, excluding the
62
- * first occurrence of each). Lines are normalized (trimmed + whitespace
63
- * collapsed); blank lines and lines shorter than 3 chars are ignored as noise.
64
- * Tagged `duplicate-line-count`. Returns `undefined` for non-js/ts source.
191
+ * Smallest run of consecutive lines that counts as a clone: jscpd's documented
192
+ * default minimum clone size (its `--min-lines` option, 5). A repeated single
193
+ * LINE is not duplicated code — every
194
+ * file repeats `});`, `/**`, `try {` — and counting lines flagged 1147 of 1285
195
+ * js/ts files on this repository's own dogfood audit (2026-11-04).
196
+ */
197
+ const CLONE_MIN_LINES = 5;
198
+ /**
199
+ * Duplication measure: the number of non-trivial source lines that lie inside a
200
+ * repeated block — a run of {@link CLONE_MIN_LINES} consecutive lines whose
201
+ * content already appeared earlier in the file, not overlapping that earlier
202
+ * copy (the first copy is the original and is not counted). Lines are
203
+ * normalized (trimmed + whitespace collapsed); blank lines and lines shorter
204
+ * than 3 chars are skipped before blocks are formed. Tagged
205
+ * `duplicate-block-lines`. Returns `undefined` for non-js/ts source.
65
206
  */
66
207
  export function computeDuplicationMetric(path, source) {
67
208
  if (!isJsTsPath(path))
68
209
  return undefined;
69
- const counts = new Map();
210
+ const lines = [];
70
211
  for (const rawLine of source.split(/\r?\n/)) {
71
212
  const normalized = normalizeLine(rawLine);
72
- if (normalized.length < 3)
73
- continue;
74
- counts.set(normalized, (counts.get(normalized) ?? 0) + 1);
213
+ if (normalized.length >= 3)
214
+ lines.push(normalized);
75
215
  }
76
- let duplicated = 0;
77
- for (const occurrences of counts.values()) {
78
- if (occurrences > 1)
79
- duplicated += occurrences - 1;
216
+ const firstStart = new Map();
217
+ const duplicated = new Set();
218
+ for (let start = 0; start + CLONE_MIN_LINES <= lines.length; start += 1) {
219
+ const block = lines.slice(start, start + CLONE_MIN_LINES).join("\n");
220
+ const earlier = firstStart.get(block);
221
+ if (earlier === undefined) {
222
+ firstStart.set(block, start);
223
+ }
224
+ else if (earlier + CLONE_MIN_LINES <= start) {
225
+ for (let line = start; line < start + CLONE_MIN_LINES; line += 1)
226
+ duplicated.add(line);
227
+ }
80
228
  }
81
229
  return {
82
- value: duplicated,
83
- measure: "duplicate-line-count",
230
+ value: duplicated.size,
231
+ measure: "duplicate-block-lines",
84
232
  reach: "js-ts-effective",
85
233
  };
86
234
  }
@@ -89,10 +237,10 @@ export function computeDuplicationMetric(path, source) {
89
237
  * (so the caller records no entry at all). For js/ts, always returns both a
90
238
  * complexity and a duplication metric.
91
239
  */
92
- export function computeNodeMetricsForFile(path, source) {
240
+ export function computeNodeMetricsForFile(path, source, parsers) {
93
241
  if (!isJsTsPath(path))
94
242
  return undefined;
95
- const complexity = computeComplexityMetric(path, source);
243
+ const complexity = computeComplexityMetric(path, source, parsers);
96
244
  const duplication = computeDuplicationMetric(path, source);
97
245
  const entry = {};
98
246
  if (complexity)
@@ -1 +1 @@
1
- {"version":3,"file":"complexityDuplication.js","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/complexityDuplication.ts"],"names":[],"mappings":"AAGA;;;;;GAKG;AAEH,MAAM,gBAAgB,GAAG;IACvB,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;CACP,CAAC;AAEF,sEAAsE;AACtE,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,0EAA0E;IAC1E,uDAAuD;IACvD,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1C,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;AACzE,CAAC;AAED,6EAA6E;AAC7E,0EAA0E;AAC1E,8EAA8E;AAC9E,kDAAkD;AAClD,wEAAwE;AACxE,wEAAwE;AACxE,MAAM,sBAAsB,GAC1B,qEAAqE,CAAC;AAExE;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACrC,IAAY,EACZ,MAAc;IAEd,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,sBAAsB,CAAC,SAAS,GAAG,CAAC,CAAC;IACrC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,OAAO,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI;QAAE,QAAQ,IAAI,CAAC,CAAC;IACnE,OAAO;QACL,KAAK,EAAE,QAAQ,GAAG,CAAC;QACnB,OAAO,EAAE,mBAAmB;QAC5B,KAAK,EAAE,iBAAiB;KACzB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CACtC,IAAY,EACZ,MAAc;IAEd,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5C,MAAM,UAAU,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QACpC,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1C,IAAI,WAAW,GAAG,CAAC;YAAE,UAAU,IAAI,WAAW,GAAG,CAAC,CAAC;IACrD,CAAC;IACD,OAAO;QACL,KAAK,EAAE,UAAU;QACjB,OAAO,EAAE,sBAAsB;QAC/B,KAAK,EAAE,iBAAiB;KACzB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CACvC,IAAY,EACZ,MAAc;IAEd,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,UAAU,GAAG,uBAAuB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACzD,MAAM,WAAW,GAAG,wBAAwB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC3D,MAAM,KAAK,GAA0D,EAAE,CAAC;IACxE,IAAI,UAAU;QAAE,KAAK,CAAC,UAAU,GAAG,UAAU,CAAC;IAC9C,IAAI,WAAW;QAAE,KAAK,CAAC,WAAW,GAAG,WAAW,CAAC;IACjD,OAAO,KAAK,CAAC;AACf,CAAC"}
1
+ {"version":3,"file":"complexityDuplication.js","sourceRoot":"","sources":["../../../../src/audit/extractors/analyzers/complexityDuplication.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,mBAAmB,EAA2C,MAAM,iBAAiB,CAAC;AAE/F;;;;;;;GAOG;AAEH,MAAM,gBAAgB,GAAG;IACvB,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;CACP,CAAC;AAEF,sEAAsE;AACtE,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,0EAA0E;IAC1E,uDAAuD;IACvD,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1C,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;AACzE,CAAC;AAED;;;;GAIG;AACH,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAE/B;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAA6C;IAC/E,OAAO,MAAM,CAAC,OAAO,KAAK,yBAAyB,IAAI,MAAM,CAAC,KAAK,GAAG,mBAAmB,CAAC;AAC5F,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAiC;IAClE,OAAO,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;AAC1B,CAAC;AAaD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,6BAA6B;IACjD,MAAM,CAAC,UAAU,EAAE,GAAG,EAAE,UAAU,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QACtD,mBAAmB,CAAC,YAAY,CAAC;QACjC,mBAAmB,CAAC,KAAK,CAAC;QAC1B,mBAAmB,CAAC,YAAY,CAAC;KAClC,CAAC,CAAC;IACH,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC;AACzC,CAAC;AAED,SAAS,SAAS,CAAC,IAAY,EAAE,OAA8C;IAC7E,IAAI,CAAC,OAAO;QAAE,OAAO,SAAS,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,OAAO,CAAC,GAAG,CAAC;IAC/C,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QAAE,OAAO,OAAO,CAAC,UAAU,CAAC;IACzG,qCAAqC;IACrC,OAAO,OAAO,CAAC,UAAU,CAAC;AAC5B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY,EAAE,OAA8C;IAC1F,OAAO,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC;AACxD,CAAC;AAED,iFAAiF;AACjF,6EAA6E;AAC7E,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC;IAClC,sBAAsB;IACtB,qBAAqB;IACrB,UAAU;IACV,gCAAgC;IAChC,oBAAoB;IACpB,gBAAgB;IAChB,mBAAmB;CACpB,CAAC,CAAC;AACH,4EAA4E;AAC5E,kFAAkF;AAClF,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC;IAClC,cAAc;IACd,eAAe;IACf,kBAAkB;IAClB,iBAAiB;IACjB,cAAc;IACd,aAAa;IACb,cAAc;IACd,oBAAoB;CACrB,CAAC,CAAC;AACH,MAAM,uBAAuB,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAE5D;;;;GAIG;AACH,SAAS,qBAAqB,CAAC,IAAY;IACzC,MAAM,QAAQ,GAAiC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;IAClE,MAAM,KAAK,GAA4D;QACrE,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAE,EAAE;KACtC,CAAC;IACF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,MAAM,GAAG,GAAG,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;gBAC7B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC1C,SAAS;YACX,CAAC;YACD,IACE,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;gBACnC,CAAC,KAAK,CAAC,IAAI,KAAK,mBAAmB;oBACjC,uBAAuB,CAAC,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC,EAC/E,CAAC;gBACD,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;YACzB,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxE,CAAC;AAED,4EAA4E;AAC5E,0EAA0E;AAC1E,+EAA+E;AAC/E,oDAAoD;AACpD,wEAAwE;AACxE,wEAAwE;AACxE,MAAM,sBAAsB,GAC1B,qEAAqE,CAAC;AAExE;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACrC,IAAY,EACZ,MAAc,EACd,OAAmC;IAEnC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACxC,IAAI,MAAM,EAAE,CAAC;QACX,IAAI,IAAwB,CAAC;QAC7B,IAAI,CAAC;YACH,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC5B,OAAO;gBACL,KAAK,EAAE,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAC3C,OAAO,EAAE,yBAAyB;gBAClC,KAAK,EAAE,iBAAiB;aACzB,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,kFAAkF;QACpF,CAAC;gBAAS,CAAC;YACT,IAAI,EAAE,MAAM,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IACD,sBAAsB,CAAC,SAAS,GAAG,CAAC,CAAC;IACrC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,OAAO,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI;QAAE,QAAQ,IAAI,CAAC,CAAC;IACnE,OAAO;QACL,KAAK,EAAE,QAAQ,GAAG,CAAC;QACnB,OAAO,EAAE,wBAAwB;QACjC,KAAK,EAAE,iBAAiB;KACzB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,eAAe,GAAG,CAAC,CAAC;AAE1B;;;;;;;;GAQG;AACH,MAAM,UAAU,wBAAwB,CACtC,IAAY,EACZ,MAAc;IAEd,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5C,MAAM,UAAU,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACrD,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,eAAe,IAAI,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACxE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,eAAe,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;aAAM,IAAI,OAAO,GAAG,eAAe,IAAI,KAAK,EAAE,CAAC;YAC9C,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,IAAI,GAAG,KAAK,GAAG,eAAe,EAAE,IAAI,IAAI,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzF,CAAC;IACH,CAAC;IACD,OAAO;QACL,KAAK,EAAE,UAAU,CAAC,IAAI;QACtB,OAAO,EAAE,uBAAuB;QAChC,KAAK,EAAE,iBAAiB;KACzB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CACvC,IAAY,EACZ,MAAc,EACd,OAAmC;IAEnC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,UAAU,GAAG,uBAAuB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAClE,MAAM,WAAW,GAAG,wBAAwB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC3D,MAAM,KAAK,GAA0D,EAAE,CAAC;IACxE,IAAI,UAAU;QAAE,KAAK,CAAC,UAAU,GAAG,UAAU,CAAC;IAC9C,IAAI,WAAW;QAAE,KAAK,CAAC,WAAW,GAAG,WAAW,CAAC;IACjD,OAAO,KAAK,CAAC;AACf,CAAC"}
@@ -1 +1 @@
1
- {"version":3,"file":"designAssessment.d.ts","sourceRoot":"","sources":["../../../src/audit/extractors/designAssessment.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAW,YAAY,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,KAAK,EAAE,WAAW,EAAE,oBAAoB,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAG1F,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAmXrE,wBAAgB,qBAAqB,CAAC,MAAM,EAAE;IAC5C,YAAY,EAAE,YAAY,CAAC;IAC3B,WAAW,EAAE,WAAW,CAAC;IACzB,aAAa,EAAE,oBAAoB,CAAC;IACpC,YAAY,EAAE,YAAY,CAAC;CAC5B,GAAG,gBAAgB,CA4BnB"}
1
+ {"version":3,"file":"designAssessment.d.ts","sourceRoot":"","sources":["../../../src/audit/extractors/designAssessment.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAW,YAAY,EAAE,MAAM,aAAa,CAAC;AACzD,OAAO,KAAK,EAAE,WAAW,EAAE,oBAAoB,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAG1F,OAAO,KAAK,EAAE,gBAAgB,EAAsB,MAAM,8BAA8B,CAAC;AAmazF,wBAAgB,qBAAqB,CAAC,MAAM,EAAE;IAC5C,YAAY,EAAE,YAAY,CAAC;IAC3B,WAAW,EAAE,WAAW,CAAC;IACzB,aAAa,EAAE,oBAAoB,CAAC;IACpC,YAAY,EAAE,YAAY,CAAC;CAC5B,GAAG,gBAAgB,CA6BnB"}