code-gauge 0.0.0-semantically-released

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,147 @@
+# code-gauge
+
+[![Test](https://github.com/WillBooster/code-gauge/actions/workflows/test.yml/badge.svg)](https://github.com/WillBooster/code-gauge/actions/workflows/test.yml)
+[![semantic-release](https://img.shields.io/badge/%20%20%F0%9F%93%A6%F0%9F%9A%80-semantic--release-e10079.svg)](https://github.com/semantic-release/semantic-release)
+
+A command-line tool for measuring code metrics with tree-sitter. It scans a project and reports high-risk files, functions, and React components so you can spot code that is worth refactoring. A [programmatic API](#programmatic-api) is also available.
+
+## Getting started
+
+```sh
+# Run without installing
+npx code-gauge path/to/project
+
+# Or install globally
+npm install -g code-gauge
+code-gauge path/to/project
+```
+
+The CLI scans JavaScript, JSX, TypeScript, TSX, Python, and Go files. By default it skips generated, vendor, test, and tool directories, prints a summary, and lists the highest-risk findings. TypeScript project metrics and React component classification turn on automatically when a `tsconfig.json` is found.
+
+## Options
+
+| Option                     | Description                                                                 |
+| -------------------------- | --------------------------------------------------------------------------- |
+| `--config <path>`          | Use this config file instead of the auto-detected `code-gauge.config.json`. |
+| `--include-tests`          | Include test files and test directories.                                    |
+| `--tsconfig <path>`        | Use this `tsconfig.json` instead of the auto-detected one.                  |
+| `--max-findings <n>`       | Maximum number of findings to print (default: 20).                          |
+| `--json`                   | Print machine-readable JSON.                                                |
+| `--fail-on-risk`           | Exit with code 1 when any high-risk finding is reported.                    |
+| `--fail-on-error`          | Exit with code 1 when any file or directory cannot be scanned.              |
+| `--<metric>-threshold <n>` | Override a risk threshold (see below).                                      |
+
+## Risk thresholds
+
+A finding is reported when a measured value is **greater than or equal to** its threshold. Every threshold can be set on the command line (e.g. `--file-loc-threshold 400`) or in a config file; the command line wins over the config file, which wins over the defaults.
+
+`code-gauge` looks for `code-gauge.config.json` by walking up from the target directory (override with `--config`). The following config reproduces every built-in default:
+
+```json
+{
+  "thresholds": {
+    "fileLoc": 500,
+    "functionLoc": 120,
+    "componentLoc": 350,
+    "cognitive": 25,
+    "cyclomatic": 20,
+    "call": 50,
+    "import": 25,
+    "fanOut": 10,
+    "parameter": 8,
+    "duplicateBlock": 2,
+    "transitiveDependency": 25,
+    "structuralBreadth": 8,
+    "structuralCoordination": 300,
+    "stateMutation": 50,
+    "duplicateSymbolGroup": 5
+  },
+  "languageThresholds": {
+    "python": { "stateMutation": 90, "structuralCoordination": 350 },
+    "react": { "import": 30 }
+  },
+  "maxFindings": 20,
+  "includeTests": false,
+  "failOnRisk": false,
+  "failOnError": false
+}
+```
+
+| Threshold                | CLI flag                              | Reports when a …                                 |
+| ------------------------ | ------------------------------------- | ------------------------------------------------ |
+| `fileLoc`                | `--file-loc-threshold`                | file's code LOC is large.                        |
+| `functionLoc`            | `--function-loc-threshold`            | function's physical LOC span is large.           |
+| `componentLoc`           | `--component-loc-threshold`           | React component's physical LOC span is large.    |
+| `cognitive`              | `--cognitive-threshold`               | function's cognitive complexity is high.         |
+| `cyclomatic`             | `--cyclomatic-threshold`              | function's cyclomatic complexity is high.        |
+| `call`                   | `--call-threshold`                    | function makes many calls.                       |
+| `import`                 | `--import-threshold`                  | file has many unique import sources.             |
+| `fanOut`                 | `--fan-out-threshold`                 | function calls many other in-file functions.     |
+| `parameter`              | `--parameter-threshold`               | function declares many parameters.               |
+| `duplicateBlock`         | `--duplicate-block-threshold`         | file contains copy-pasted code blocks.           |
+| `transitiveDependency`   | `--transitive-dependency-threshold`   | file transitively reaches many local files.      |
+| `structuralBreadth`      | `--structural-breadth-threshold`      | file coordinates many structural concerns.       |
+| `structuralCoordination` | `--structural-coordination-threshold` | file's structural coordination score is high.    |
+| `stateMutation`          | `--state-mutation-threshold`          | file mutates state heavily.                      |
+| `duplicateSymbolGroup`   | `--duplicate-symbol-group-threshold`  | file shares many duplicated symbols with others. |
+
+### Per-language thresholds
+
+Some metrics distribute very differently by language or file type, so a single global threshold either
+over-flags one language or under-flags another. `languageThresholds` overrides individual thresholds for a
+profile without repeating the whole set. Each file resolves its thresholds as **base → its language profile →
+the `react` profile** (the last applies when the file contains a React component), so later profiles win.
+
+Valid profile keys are `javascript`, `jsx`, `typescript`, `tsx`, `python`, `go`, and `react`. Built-in
+overrides raise `stateMutation` and `structuralCoordination` for Python (every binding is an assignment, so
+these run far higher than in TypeScript) and raise `import` for React files (which pull in many components).
+Anything you specify is merged on top of the built-in overrides, so `{ "python": { "stateMutation": 8 } }`
+restores the global value for Python while keeping the other built-in adjustments.
+
+```json
+{
+  "languageThresholds": {
+    "python": { "stateMutation": 120 },
+    "react": { "componentLoc": 400, "import": 35 }
+  }
+}
+```
+
+Command-line `--<metric>-threshold` flags set the global base only; use the config file for per-language tuning.
+
+## Metrics
+
+- Physical LOC, code lines, comment-only lines, and blank lines
+- Function and class counts
+- Cyclomatic and cognitive complexity (per function and maximum)
+- Nesting depth
+- Intra-file call graph metrics: call counts, fan-in/fan-out, recursion, call depth, and parameter counts
+- Within-file structural duplication: copy-pasted code blocks (distinct from cross-file duplicate symbol names)
+- File coupling (imports/exports) and cohesion (shared function identifiers)
+- Architecture metrics: transitive local dependencies, structural coordination and breadth, state mutation, and cross-file duplicate symbols
+- TypeScript type-shape metrics: annotations, aliases, interfaces, generics, unions, intersections, assertions, and conditional types
+- Halstead metrics and the maintainability index
+
+## Supported languages
+
+Built-in parsers cover JavaScript, JSX, TypeScript, TSX, Python, and Go. Additional tree-sitter grammars can be registered with `TreeMeasurer.registerLanguage`.
+
+## Programmatic API
+
+```ts
+import { measureCode } from 'code-gauge';
+
+const metrics = measureCode(
+  `
+function score(value) {
+  if (value < 0 || value == null) {
+    return 0;
+  }
+  return value > 10 ? 10 : value;
+}
+`,
+  { language: 'javascript' }
+);
+
+console.log(metrics.cyclomaticComplexity);
+```

package/dist/architectureMetrics.cjs

@@ -0,0 +1,2 @@
+"use strict";var t=require("node:path");function e(e,n,o){if(!n.startsWith("."))return;const r=function(e,n){const o=t.dirname(e);if(function(t){return t.startsWith("./")||t.startsWith("../")||t.includes("/")}(n))return[t.normalize(t.join(o,n))];const r=/^(?<dots>\.+)(?<module>.*)$/u.exec(n),a=r?.groups?.dots,i=r?.groups?.module;if(!a||void 0===i)return[];let u=o;for(let e=1;e<a.length;e+=1)u=t.dirname(u);const l=i.replaceAll(".",t.sep);return[t.normalize(t.join(u,l))]}(e,n),a=r.flatMap(e=>{const n=t.extname(e);return n?[e.slice(0,-n.length),e]:[e]});for(const e of a)for(const n of[`${e}.ts`,`${e}.tsx`,`${e}.js`,`${e}.jsx`,`${e}.py`,t.join(e,"index.ts"),t.join(e,"index.tsx"),t.join(e,"index.js"),t.join(e,"__init__.py")])if(o.has(n))return n}function n(t,e){const n=new Set,o=[...e.get(t)??[]];for(;o.length>0;){const t=o.pop();t&&!n.has(t)&&(n.add(t),o.push(...e.get(t)??[]))}return n.size}function o(t){return t.name.length>=5}function r(t,e){return{file:t,line:e.startLine}}function a(t,e){return t.file.localeCompare(e.file)||t.line-e.line}function i(t,e,n){n&&t.add(e)}function u(t,e){return Math.max(0,...t.map(t=>t[e]).filter(t=>"number"==typeof t))}exports.measureArchitecture=function(l,s){const c=l.map(e=>({...e,relativeFile:t.relative(s,e.file)||t.basename(e.file)})),p=function(t){const n=new Set(t.map(t=>t.relativeFile)),o=new Map;for(const r of t){const t=new Set;for(const o of r.metrics.module.importSources){const a=e(r.relativeFile,o,n);a&&t.add(a)}o.set(r.relativeFile,t)}return o}(c),m=function(t){const e=new Map;for(const n of t)for(const t of n.metrics.module.declarations){if(!o(t))continue;const a=e.get(t.name)??[];a.push(r(n.relativeFile,t)),e.set(t.name,a)}return[...e.entries()].flatMap(([t,e])=>{const n=[...new Set(e.map(t=>t.file))].toSorted();return n.length>1?[{declarations:e.toSorted(a),files:n,name:t}]:[]}).toSorted((t,e)=>e.files.length-t.files.length||t.name.localeCompare(e.name))}(c),f=function(t){const e=new Map;for(const n of t)for(const t of n.files)e.set(t,(e.get(t)??0)+1);return e}(m),d=c.map(t=>{const e=p.get(t.relativeFile)??new Set,o=function(t){const e=t.syntaxFeatures.awaitExpressionCount,n=t.syntaxFeatures.tryStatementCount+t.syntaxFeatures.throwStatementCount,o=t.syntaxFeatures.mutableBindingCount+t.syntaxFeatures.assignmentCount,r=t.cyclomaticComplexity+t.syntaxFeatures.loopStatementCount+t.syntaxFeatures.returnStatementCount,a=t.callGraph.callCount+2*t.callGraph.internalEdgeCount+3*t.callGraph.maxCallDepth;return{asyncBoundaryCount:e,branchingScore:r,exceptionHandlingCount:n,moduleInteractionScore:a,score:2*e+3*n+o+r+a,stateMutationScore:o}}(t.metrics),r=function(t){const e=new Set;return i(e,"class-shapes",t.classCount>0),i(e,"control-flow",t.cognitiveComplexity>0),i(e,"external-dependencies",t.coupling.externalImportCount>0),i(e,"functions",t.functionCount>0),i(e,"local-dependencies",t.coupling.relativeImportCount>0),i(e,"module-api",t.coupling.exportCount>0||t.module.declarations.length>0),i(e,"state-mutation",t.syntaxFeatures.mutableBindingCount+t.syntaxFeatures.assignmentCount>0),i(e,"type-shapes",function(t){return t.typeComplexity.typeAnnotationCount+t.typeComplexity.typeAliasCount+t.typeComplexity.interfaceCount+t.typeComplexity.genericParameterCount+t.typeComplexity.unionTypeCount+t.typeComplexity.intersectionTypeCount+t.typeComplexity.conditionalTypeCount>0}(t)),[...e].toSorted()}(t.metrics);return{file:t.relativeFile,directLocalDependencyCount:e.size,duplicateSymbolGroupCount:f.get(t.relativeFile)??0,structuralBreadthScore:r.length,structuralCoordination:o,structuralFeatureGroups:r,transitiveLocalDependencyCount:n(t.relativeFile,p)}});return{duplicateSymbolGroups:m,files:d,maxDirectLocalDependencyCount:u(d,"directLocalDependencyCount"),maxDuplicateSymbolGroupCount:u(d,"duplicateSymbolGroupCount"),maxStructuralBreadthScore:u(d,"structuralBreadthScore"),maxStructuralCoordinationScore:Math.max(0,...d.map(t=>t.structuralCoordination.score)),maxTransitiveLocalDependencyCount:u(d,"transitiveLocalDependencyCount")}};
+//# sourceMappingURL=architectureMetrics.cjs.map

package/dist/architectureMetrics.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"architectureMetrics.cjs","sources":["../src/architectureMetrics.ts"],"sourcesContent":["import path from 'node:path';\nimport type { CodeMetrics, DeclarationMetrics } from './types.js';\n\nexport interface ArchitectureSourceFile {\n  file: string;\n  metrics: CodeMetrics;\n}\n\nexport interface ArchitectureFileMetrics {\n  directLocalDependencyCount: number;\n  duplicateSymbolGroupCount: number;\n  file: string;\n  structuralBreadthScore: number;\n  structuralCoordination: StructuralCoordinationMetrics;\n  structuralFeatureGroups: string[];\n  transitiveLocalDependencyCount: number;\n}\n\nexport interface ArchitectureMetrics {\n  duplicateSymbolGroups: DuplicateSymbolGroup[];\n  files: ArchitectureFileMetrics[];\n  maxDirectLocalDependencyCount: number;\n  maxDuplicateSymbolGroupCount: number;\n  maxStructuralBreadthScore: number;\n  maxStructuralCoordinationScore: number;\n  maxTransitiveLocalDependencyCount: number;\n}\n\nexport interface DuplicateSymbolGroup {\n  declarations: DuplicateSymbolDeclaration[];\n  files: string[];\n  name: string;\n}\n\nexport interface DuplicateSymbolDeclaration {\n  file: string;\n  line: number;\n}\n\nexport interface StructuralCoordinationMetrics {\n  asyncBoundaryCount: number;\n  branchingScore: number;\n  exceptionHandlingCount: number;\n  moduleInteractionScore: number;\n  score: number;\n  stateMutationScore: number;\n}\n\ninterface SourceFile {\n  file: string;\n  metrics: CodeMetrics;\n  relativeFile: string;\n}\n\nconst duplicateSymbolNameLengthThreshold = 5;\n\nexport function measureArchitecture(\n  files: readonly ArchitectureSourceFile[],\n  displayRoot: string\n): ArchitectureMetrics {\n  const sourceFiles = files.map((file) => ({\n    ...file,\n    relativeFile: path.relative(displayRoot, file.file) || path.basename(file.file),\n  }));\n  const dependencyGraph = measureDependencyGraph(sourceFiles);\n  const duplicateSymbolGroups = measureDuplicateSymbolGroups(sourceFiles);\n  const duplicateGroupCountByFile = measureDuplicateGroupCountByFile(duplicateSymbolGroups);\n  const metrics = sourceFiles.map((sourceFile) => {\n    const directDependencies = dependencyGraph.get(sourceFile.relativeFile) ?? new Set<string>();\n    const structuralCoordination = measureStructuralCoordination(sourceFile.metrics);\n    const structuralFeatureGroups = measureStructuralFeatureGroups(sourceFile.metrics);\n    return {\n      file: sourceFile.relativeFile,\n      directLocalDependencyCount: directDependencies.size,\n      duplicateSymbolGroupCount: duplicateGroupCountByFile.get(sourceFile.relativeFile) ?? 0,\n      structuralBreadthScore: structuralFeatureGroups.length,\n      structuralCoordination,\n      structuralFeatureGroups,\n      transitiveLocalDependencyCount: measureTransitiveDependencyCount(sourceFile.relativeFile, dependencyGraph),\n    };\n  });\n\n  return {\n    duplicateSymbolGroups,\n    files: metrics,\n    maxDirectLocalDependencyCount: maxFileMetric(metrics, 'directLocalDependencyCount'),\n    maxDuplicateSymbolGroupCount: maxFileMetric(metrics, 'duplicateSymbolGroupCount'),\n    maxStructuralBreadthScore: maxFileMetric(metrics, 'structuralBreadthScore'),\n    maxStructuralCoordinationScore: Math.max(0, ...metrics.map((file) => file.structuralCoordination.score)),\n    maxTransitiveLocalDependencyCount: maxFileMetric(metrics, 'transitiveLocalDependencyCount'),\n  };\n}\n\nfunction measureDependencyGraph(files: SourceFile[]): Map<string, Set<string>> {\n  const fileSet = new Set(files.map((file) => file.relativeFile));\n  const graph = new Map<string, Set<string>>();\n  for (const file of files) {\n    const dependencies = new Set<string>();\n    for (const source of file.metrics.module.importSources) {\n      const resolved = resolveLocalImport(file.relativeFile, source, fileSet);\n      if (resolved) {\n        dependencies.add(resolved);\n      }\n    }\n    graph.set(file.relativeFile, dependencies);\n  }\n  return graph;\n}\n\nfunction resolveLocalImport(fromFile: string, source: string, fileSet: Set<string>): string | undefined {\n  if (!source.startsWith('.')) {\n    return undefined;\n  }\n  const bases = localImportBases(fromFile, source);\n  const stems = bases.flatMap((base) => {\n    const extension = path.extname(base);\n    return extension ? [base.slice(0, -extension.length), base] : [base];\n  });\n  for (const stem of stems) {\n    for (const candidate of [\n      `${stem}.ts`,\n      `${stem}.tsx`,\n      `${stem}.js`,\n      `${stem}.jsx`,\n      `${stem}.py`,\n      path.join(stem, 'index.ts'),\n      path.join(stem, 'index.tsx'),\n      path.join(stem, 'index.js'),\n      path.join(stem, '__init__.py'),\n    ]) {\n      if (fileSet.has(candidate)) {\n        return candidate;\n      }\n    }\n  }\n  return undefined;\n}\n\nfunction localImportBases(fromFile: string, source: string): string[] {\n  const fromDirectory = path.dirname(fromFile);\n  if (isPathRelativeImport(source)) {\n    return [path.normalize(path.join(fromDirectory, source))];\n  }\n\n  const match = /^(?<dots>\\.+)(?<module>.*)$/u.exec(source);\n  const dots = match?.groups?.dots;\n  const moduleName = match?.groups?.module;\n  if (!dots || moduleName === undefined) {\n    return [];\n  }\n\n  let baseDirectory = fromDirectory;\n  for (let index = 1; index < dots.length; index += 1) {\n    baseDirectory = path.dirname(baseDirectory);\n  }\n\n  const modulePath = moduleName.replaceAll('.', path.sep);\n  return [path.normalize(path.join(baseDirectory, modulePath))];\n}\n\nfunction isPathRelativeImport(source: string): boolean {\n  return source.startsWith('./') || source.startsWith('../') || source.includes('/');\n}\n\nfunction measureTransitiveDependencyCount(file: string, graph: Map<string, Set<string>>): number {\n  const visited = new Set<string>();\n  const pending = [...(graph.get(file) ?? [])];\n  while (pending.length > 0) {\n    const current = pending.pop();\n    if (!current || visited.has(current)) {\n      continue;\n    }\n    visited.add(current);\n    pending.push(...(graph.get(current) ?? []));\n  }\n  return visited.size;\n}\n\nfunction measureDuplicateSymbolGroups(files: SourceFile[]): DuplicateSymbolGroup[] {\n  const declarationsBySymbol = new Map<string, DuplicateSymbolDeclaration[]>();\n  for (const file of files) {\n    for (const declaration of file.metrics.module.declarations) {\n      if (!isDuplicateSymbolCandidate(declaration)) {\n        continue;\n      }\n      const declarations = declarationsBySymbol.get(declaration.name) ?? [];\n      declarations.push(toDuplicateSymbolDeclaration(file.relativeFile, declaration));\n      declarationsBySymbol.set(declaration.name, declarations);\n    }\n  }\n  return [...declarationsBySymbol.entries()]\n    .flatMap(([name, declarations]) => {\n      const duplicateFiles = [...new Set(declarations.map((declaration) => declaration.file))].toSorted();\n      return duplicateFiles.length > 1\n        ? [{ declarations: declarations.toSorted(compareDuplicateDeclarations), files: duplicateFiles, name }]\n        : [];\n    })\n    .toSorted((left, right) => right.files.length - left.files.length || left.name.localeCompare(right.name));\n}\n\nfunction isDuplicateSymbolCandidate(declaration: DeclarationMetrics): boolean {\n  return declaration.name.length >= duplicateSymbolNameLengthThreshold;\n}\n\nfunction toDuplicateSymbolDeclaration(file: string, declaration: DeclarationMetrics): DuplicateSymbolDeclaration {\n  return { file, line: declaration.startLine };\n}\n\nfunction compareDuplicateDeclarations(left: DuplicateSymbolDeclaration, right: DuplicateSymbolDeclaration): number {\n  return left.file.localeCompare(right.file) || left.line - right.line;\n}\n\nfunction measureDuplicateGroupCountByFile(groups: DuplicateSymbolGroup[]): Map<string, number> {\n  const counts = new Map<string, number>();\n  for (const group of groups) {\n    for (const file of group.files) {\n      counts.set(file, (counts.get(file) ?? 0) + 1);\n    }\n  }\n  return counts;\n}\n\nfunction measureStructuralCoordination(metrics: CodeMetrics): StructuralCoordinationMetrics {\n  const asyncBoundaryCount = metrics.syntaxFeatures.awaitExpressionCount;\n  const exceptionHandlingCount = metrics.syntaxFeatures.tryStatementCount + metrics.syntaxFeatures.throwStatementCount;\n  const stateMutationScore = metrics.syntaxFeatures.mutableBindingCount + metrics.syntaxFeatures.assignmentCount;\n  const branchingScore =\n    metrics.cyclomaticComplexity +\n    metrics.syntaxFeatures.loopStatementCount +\n    metrics.syntaxFeatures.returnStatementCount;\n  const moduleInteractionScore =\n    metrics.callGraph.callCount + metrics.callGraph.internalEdgeCount * 2 + metrics.callGraph.maxCallDepth * 3;\n\n  return {\n    asyncBoundaryCount,\n    branchingScore,\n    exceptionHandlingCount,\n    moduleInteractionScore,\n    score:\n      asyncBoundaryCount * 2 +\n      exceptionHandlingCount * 3 +\n      stateMutationScore +\n      branchingScore +\n      moduleInteractionScore,\n    stateMutationScore,\n  };\n}\n\nfunction measureStructuralFeatureGroups(metrics: CodeMetrics): string[] {\n  const groups = new Set<string>();\n  addGroup(groups, 'class-shapes', metrics.classCount > 0);\n  addGroup(groups, 'control-flow', metrics.cognitiveComplexity > 0);\n  addGroup(groups, 'external-dependencies', metrics.coupling.externalImportCount > 0);\n  addGroup(groups, 'functions', metrics.functionCount > 0);\n  addGroup(groups, 'local-dependencies', metrics.coupling.relativeImportCount > 0);\n  addGroup(groups, 'module-api', metrics.coupling.exportCount > 0 || metrics.module.declarations.length > 0);\n  addGroup(\n    groups,\n    'state-mutation',\n    metrics.syntaxFeatures.mutableBindingCount + metrics.syntaxFeatures.assignmentCount > 0\n  );\n  addGroup(groups, 'type-shapes', hasTypeShapeMetrics(metrics));\n  return [...groups].toSorted();\n}\n\nfunction addGroup(groups: Set<string>, group: string, condition: boolean): void {\n  if (condition) {\n    groups.add(group);\n  }\n}\n\nfunction hasTypeShapeMetrics(metrics: CodeMetrics): boolean {\n  return (\n    metrics.typeComplexity.typeAnnotationCount +\n      metrics.typeComplexity.typeAliasCount +\n      metrics.typeComplexity.interfaceCount +\n      metrics.typeComplexity.genericParameterCount +\n      metrics.typeComplexity.unionTypeCount +\n      metrics.typeComplexity.intersectionTypeCount +\n      metrics.typeComplexity.conditionalTypeCount >\n    0\n  );\n}\n\nfunction maxFileMetric(metrics: ArchitectureFileMetrics[], key: keyof ArchitectureFileMetrics): number {\n  return Math.max(\n    0,\n    ...metrics.map((metric) => metric[key]).filter((value): value is number => typeof value === 'number')\n  );\n}\n"],"names":["resolveLocalImport","fromFile","source","fileSet","startsWith","bases","fromDirectory","path","dirname","includes","isPathRelativeImport","normalize","join","match","exec","dots","groups","moduleName","module","undefined","baseDirectory","index","length","modulePath","replaceAll","sep","localImportBases","stems","flatMap","base","extension","extname","slice","stem","candidate","has","measureTransitiveDependencyCount","file","graph","visited","Set","pending","get","current","pop","add","push","size","isDuplicateSymbolCandidate","declaration","name","toDuplicateSymbolDeclaration","line","startLine","compareDuplicateDeclarations","left","right","localeCompare","addGroup","group","condition","maxFileMetric","metrics","key","Math","max","map","metric","filter","value","files","displayRoot","sourceFiles","relativeFile","relative","basename","dependencyGraph","Map","dependencies","importSources","resolved","set","measureDependencyGraph","duplicateSymbolGroups","declarationsBySymbol","declarations","entries","duplicateFiles","toSorted","measureDuplicateSymbolGroups","duplicateGroupCountByFile","counts","measureDuplicateGroupCountByFile","sourceFile","directDependencies","structuralCoordination","asyncBoundaryCount","syntaxFeatures","awaitExpressionCount","exceptionHandlingCount","tryStatementCount","throwStatementCount","stateMutationScore","mutableBindingCount","assignmentCount","branchingScore","cyclomaticComplexity","loopStatementCount","returnStatementCount","moduleInteractionScore","callGraph","callCount","internalEdgeCount","maxCallDepth","score","measureStructuralCoordination","structuralFeatureGroups","classCount","cognitiveComplexity","coupling","externalImportCount","functionCount","relativeImportCount","exportCount","typeComplexity","typeAnnotationCount","typeAliasCount","interfaceCount","genericParameterCount","unionTypeCount","intersectionTypeCount","conditionalTypeCount","hasTypeShapeMetrics","measureStructuralFeatureGroups","directLocalDependencyCount","duplicateSymbolGroupCount","structuralBreadthScore","transitiveLocalDependencyCount","maxDirectLocalDependencyCount","maxDuplicateSymbolGroupCount","maxStructuralBreadthScore","maxStructuralCoordinationScore","maxTransitiveLocalDependencyCount"],"mappings":"wCA6GA,SAASA,EAAmBC,EAAkBC,EAAgBC,GAC5D,IAAKD,EAAOE,WAAW,KACrB,OAEF,MAAMC,EAyBR,SAA0BJ,EAAkBC,GAC1C,MAAMI,EAAgBC,EAAKC,QAAQP,GACnC,GAoBF,SAA8BC,GAC5B,OAAOA,EAAOE,WAAW,OAASF,EAAOE,WAAW,QAAUF,EAAOO,SAAS,IAChF,CAtBMC,CAAqBR,GACvB,MAAO,CAACK,EAAKI,UAAUJ,EAAKK,KAAKN,EAAeJ,KAGlD,MAAMW,EAAQ,+BAA+BC,KAAKZ,GAC5Ca,EAAOF,GAAOG,QAAQD,KACtBE,EAAaJ,GAAOG,QAAQE,OAClC,IAAKH,QAAuBI,IAAfF,EACX,MAAO,GAGT,IAAIG,EAAgBd,EACpB,IAAK,IAAIe,EAAQ,EAAGA,EAAQN,EAAKO,OAAQD,GAAS,EAChDD,EAAgBb,EAAKC,QAAQY,GAG/B,MAAMG,EAAaN,EAAWO,WAAW,IAAKjB,EAAKkB,KACnD,MAAO,CAAClB,EAAKI,UAAUJ,EAAKK,KAAKQ,EAAeG,IAClD,CA7CgBG,CAAiBzB,EAAUC,GACnCyB,EAAQtB,EAAMuB,QAASC,IAC3B,MAAMC,EAAYvB,EAAKwB,QAAQF,GAC/B,OAAOC,EAAY,CAACD,EAAKG,MAAM,GAAIF,EAAUR,QAASO,GAAQ,CAACA,KAEjE,IAAK,MAAMI,KAAQN,EACjB,IAAK,MAAMO,IAAa,CACtB,GAAGD,OACH,GAAGA,QACH,GAAGA,OACH,GAAGA,QACH,GAAGA,OACH1B,EAAKK,KAAKqB,EAAM,YAChB1B,EAAKK,KAAKqB,EAAM,aAChB1B,EAAKK,KAAKqB,EAAM,YAChB1B,EAAKK,KAAKqB,EAAM,gBAEhB,GAAI9B,EAAQgC,IAAID,GACd,OAAOA,CAKf,CA4BA,SAASE,EAAiCC,EAAcC,GACtD,MAAMC,EAAU,IAAIC,IACdC,EAAU,IAAKH,EAAMI,IAAIL,IAAS,IACxC,KAAOI,EAAQnB,OAAS,GAAG,CACzB,MAAMqB,EAAUF,EAAQG,MACnBD,IAAWJ,EAAQJ,IAAIQ,KAG5BJ,EAAQM,IAAIF,GACZF,EAAQK,QAASR,EAAMI,IAAIC,IAAY,IACzC,CACA,OAAOJ,EAAQQ,IACjB,CAwBA,SAASC,EAA2BC,GAClC,OAAOA,EAAYC,KAAK5B,QAnJiB,CAoJ3C,CAEA,SAAS6B,EAA6Bd,EAAcY,GAClD,MAAO,CAAEZ,OAAMe,KAAMH,EAAYI,UACnC,CAEA,SAASC,EAA6BC,EAAkCC,GACtE,OAAOD,EAAKlB,KAAKoB,cAAcD,EAAMnB,OAASkB,EAAKH,KAAOI,EAAMJ,IAClE,CAuDA,SAASM,EAAS1C,EAAqB2C,EAAeC,GAChDA,GACF5C,EAAO6B,IAAIc,EAEf,CAeA,SAASE,EAAcC,EAAoCC,GACzD,OAAOC,KAAKC,IACV,KACGH,EAAQI,IAAKC,GAAWA,EAAOJ,IAAMK,OAAQC,GAA4C,iBAAVA,GAEtF,6BAzOO,SACLC,EACAC,GAEA,MAAMC,EAAcF,EAAMJ,IAAK7B,IAAI,IAC9BA,EACHoC,aAAclE,EAAKmE,SAASH,EAAalC,EAAKA,OAAS9B,EAAKoE,SAAStC,EAAKA,SAEtEuC,EA6BR,SAAgCN,GAC9B,MAAMnE,EAAU,IAAIqC,IAAI8B,EAAMJ,IAAK7B,GAASA,EAAKoC,eAC3CnC,EAAQ,IAAIuC,IAClB,IAAK,MAAMxC,KAAQiC,EAAO,CACxB,MAAMQ,EAAe,IAAItC,IACzB,IAAK,MAAMtC,KAAUmC,EAAKyB,QAAQ5C,OAAO6D,cAAe,CACtD,MAAMC,EAAWhF,EAAmBqC,EAAKoC,aAAcvE,EAAQC,GAC3D6E,GACFF,EAAajC,IAAImC,EAErB,CACA1C,EAAM2C,IAAI5C,EAAKoC,aAAcK,EAC/B,CACA,OAAOxC,CACT,CA3C0B4C,CAAuBV,GACzCW,EAiHR,SAAsCb,GACpC,MAAMc,EAAuB,IAAIP,IACjC,IAAK,MAAMxC,KAAQiC,EACjB,IAAK,MAAMrB,KAAeZ,EAAKyB,QAAQ5C,OAAOmE,aAAc,CAC1D,IAAKrC,EAA2BC,GAC9B,SAEF,MAAMoC,EAAeD,EAAqB1C,IAAIO,EAAYC,OAAS,GACnEmC,EAAavC,KAAKK,EAA6Bd,EAAKoC,aAAcxB,IAClEmC,EAAqBH,IAAIhC,EAAYC,KAAMmC,EAC7C,CAEF,MAAO,IAAID,EAAqBE,WAC7B1D,QAAQ,EAAEsB,EAAMmC,MACf,MAAME,EAAiB,IAAI,IAAI/C,IAAI6C,EAAanB,IAAKjB,GAAgBA,EAAYZ,QAAQmD,WACzF,OAAOD,EAAejE,OAAS,EAC3B,CAAC,CAAE+D,aAAcA,EAAaG,SAASlC,GAA+BgB,MAAOiB,EAAgBrC,SAC7F,KAELsC,SAAS,CAACjC,EAAMC,IAAUA,EAAMc,MAAMhD,OAASiC,EAAKe,MAAMhD,QAAUiC,EAAKL,KAAKO,cAAcD,EAAMN,MACvG,CArIgCuC,CAA6BjB,GACrDkB,EAkJR,SAA0C1E,GACxC,MAAM2E,EAAS,IAAId,IACnB,IAAK,MAAMlB,KAAS3C,EAClB,IAAK,MAAMqB,KAAQsB,EAAMW,MACvBqB,EAAOV,IAAI5C,GAAOsD,EAAOjD,IAAIL,IAAS,GAAK,GAG/C,OAAOsD,CACT,CA1JoCC,CAAiCT,GAC7DrB,EAAUU,EAAYN,IAAK2B,IAC/B,MAAMC,EAAqBlB,EAAgBlC,IAAImD,EAAWpB,eAAiB,IAAIjC,IACzEuD,EAyJV,SAAuCjC,GACrC,MAAMkC,EAAqBlC,EAAQmC,eAAeC,qBAC5CC,EAAyBrC,EAAQmC,eAAeG,kBAAoBtC,EAAQmC,eAAeI,oBAC3FC,EAAqBxC,EAAQmC,eAAeM,oBAAsBzC,EAAQmC,eAAeO,gBACzFC,EACJ3C,EAAQ4C,qBACR5C,EAAQmC,eAAeU,mBACvB7C,EAAQmC,eAAeW,qBACnBC,EACJ/C,EAAQgD,UAAUC,UAAkD,EAAtCjD,EAAQgD,UAAUE,kBAAyD,EAAjClD,EAAQgD,UAAUG,aAE5F,MAAO,CACLjB,qBACAS,iBACAN,yBACAU,yBACAK,MACuB,EAArBlB,EACyB,EAAzBG,EACAG,EACAG,EACAI,EACFP,qBAEJ,CAjLmCa,CAA8BtB,EAAW/B,SAClEsD,EAkLV,SAAwCtD,GACtC,MAAM9C,EAAS,IAAIwB,IAanB,OAZAkB,EAAS1C,EAAQ,eAAgB8C,EAAQuD,WAAa,GACtD3D,EAAS1C,EAAQ,eAAgB8C,EAAQwD,oBAAsB,GAC/D5D,EAAS1C,EAAQ,wBAAyB8C,EAAQyD,SAASC,oBAAsB,GACjF9D,EAAS1C,EAAQ,YAAa8C,EAAQ2D,cAAgB,GACtD/D,EAAS1C,EAAQ,qBAAsB8C,EAAQyD,SAASG,oBAAsB,GAC9EhE,EAAS1C,EAAQ,aAAc8C,EAAQyD,SAASI,YAAc,GAAK7D,EAAQ5C,OAAOmE,aAAa/D,OAAS,GACxGoC,EACE1C,EACA,iBACA8C,EAAQmC,eAAeM,oBAAsBzC,EAAQmC,eAAeO,gBAAkB,GAExF9C,EAAS1C,EAAQ,cAUnB,SAA6B8C,GAC3B,OACEA,EAAQ8D,eAAeC,oBACrB/D,EAAQ8D,eAAeE,eACvBhE,EAAQ8D,eAAeG,eACvBjE,EAAQ8D,eAAeI,sBACvBlE,EAAQ8D,eAAeK,eACvBnE,EAAQ8D,eAAeM,sBACvBpE,EAAQ8D,eAAeO,qBACzB,CAEJ,CArBkCC,CAAoBtE,IAC7C,IAAI9C,GAAQwE,UACrB,CAjMoC6C,CAA+BxC,EAAW/B,SAC1E,MAAO,CACLzB,KAAMwD,EAAWpB,aACjB6D,2BAA4BxC,EAAmB/C,KAC/CwF,0BAA2B7C,EAA0BhD,IAAImD,EAAWpB,eAAiB,EACrF+D,uBAAwBpB,EAAwB9F,OAChDyE,yBACAqB,0BACAqB,+BAAgCrG,EAAiCyD,EAAWpB,aAAcG,MAI9F,MAAO,CACLO,wBACAb,MAAOR,EACP4E,8BAA+B7E,EAAcC,EAAS,8BACtD6E,6BAA8B9E,EAAcC,EAAS,6BACrD8E,0BAA2B/E,EAAcC,EAAS,0BAClD+E,+BAAgC7E,KAAKC,IAAI,KAAMH,EAAQI,IAAK7B,GAASA,EAAK0D,uBAAuBmB,QACjG4B,kCAAmCjF,EAAcC,EAAS,kCAE9D"}

package/dist/architectureMetrics.d.ts

@@ -0,0 +1,41 @@
+import type { CodeMetrics } from './types.js';
+export interface ArchitectureSourceFile {
+    file: string;
+    metrics: CodeMetrics;
+}
+export interface ArchitectureFileMetrics {
+    directLocalDependencyCount: number;
+    duplicateSymbolGroupCount: number;
+    file: string;
+    structuralBreadthScore: number;
+    structuralCoordination: StructuralCoordinationMetrics;
+    structuralFeatureGroups: string[];
+    transitiveLocalDependencyCount: number;
+}
+export interface ArchitectureMetrics {
+    duplicateSymbolGroups: DuplicateSymbolGroup[];
+    files: ArchitectureFileMetrics[];
+    maxDirectLocalDependencyCount: number;
+    maxDuplicateSymbolGroupCount: number;
+    maxStructuralBreadthScore: number;
+    maxStructuralCoordinationScore: number;
+    maxTransitiveLocalDependencyCount: number;
+}
+export interface DuplicateSymbolGroup {
+    declarations: DuplicateSymbolDeclaration[];
+    files: string[];
+    name: string;
+}
+export interface DuplicateSymbolDeclaration {
+    file: string;
+    line: number;
+}
+export interface StructuralCoordinationMetrics {
+    asyncBoundaryCount: number;
+    branchingScore: number;
+    exceptionHandlingCount: number;
+    moduleInteractionScore: number;
+    score: number;
+    stateMutationScore: number;
+}
+export declare function measureArchitecture(files: readonly ArchitectureSourceFile[], displayRoot: string): ArchitectureMetrics;

package/dist/architectureMetrics.js

@@ -0,0 +1,2 @@
+import t from"node:path";function e(e,s){const c=e.map(e=>({...e,relativeFile:t.relative(s,e.file)||t.basename(e.file)})),p=function(t){const e=new Set(t.map(t=>t.relativeFile)),o=new Map;for(const r of t){const t=new Set;for(const o of r.metrics.module.importSources){const a=n(r.relativeFile,o,e);a&&t.add(a)}o.set(r.relativeFile,t)}return o}(c),m=function(t){const e=new Map;for(const n of t)for(const t of n.metrics.module.declarations){if(!r(t))continue;const o=e.get(t.name)??[];o.push(a(n.relativeFile,t)),e.set(t.name,o)}return[...e.entries()].flatMap(([t,e])=>{const n=[...new Set(e.map(t=>t.file))].toSorted();return n.length>1?[{declarations:e.toSorted(i),files:n,name:t}]:[]}).toSorted((t,e)=>e.files.length-t.files.length||t.name.localeCompare(e.name))}(c),f=function(t){const e=new Map;for(const n of t)for(const t of n.files)e.set(t,(e.get(t)??0)+1);return e}(m),d=c.map(t=>{const e=p.get(t.relativeFile)??new Set,n=function(t){const e=t.syntaxFeatures.awaitExpressionCount,n=t.syntaxFeatures.tryStatementCount+t.syntaxFeatures.throwStatementCount,o=t.syntaxFeatures.mutableBindingCount+t.syntaxFeatures.assignmentCount,r=t.cyclomaticComplexity+t.syntaxFeatures.loopStatementCount+t.syntaxFeatures.returnStatementCount,a=t.callGraph.callCount+2*t.callGraph.internalEdgeCount+3*t.callGraph.maxCallDepth;return{asyncBoundaryCount:e,branchingScore:r,exceptionHandlingCount:n,moduleInteractionScore:a,score:2*e+3*n+o+r+a,stateMutationScore:o}}(t.metrics),r=function(t){const e=new Set;return u(e,"class-shapes",t.classCount>0),u(e,"control-flow",t.cognitiveComplexity>0),u(e,"external-dependencies",t.coupling.externalImportCount>0),u(e,"functions",t.functionCount>0),u(e,"local-dependencies",t.coupling.relativeImportCount>0),u(e,"module-api",t.coupling.exportCount>0||t.module.declarations.length>0),u(e,"state-mutation",t.syntaxFeatures.mutableBindingCount+t.syntaxFeatures.assignmentCount>0),u(e,"type-shapes",function(t){return t.typeComplexity.typeAnnotationCount+t.typeComplexity.typeAliasCount+t.typeComplexity.interfaceCount+t.typeComplexity.genericParameterCount+t.typeComplexity.unionTypeCount+t.typeComplexity.intersectionTypeCount+t.typeComplexity.conditionalTypeCount>0}(t)),[...e].toSorted()}(t.metrics);return{file:t.relativeFile,directLocalDependencyCount:e.size,duplicateSymbolGroupCount:f.get(t.relativeFile)??0,structuralBreadthScore:r.length,structuralCoordination:n,structuralFeatureGroups:r,transitiveLocalDependencyCount:o(t.relativeFile,p)}});return{duplicateSymbolGroups:m,files:d,maxDirectLocalDependencyCount:l(d,"directLocalDependencyCount"),maxDuplicateSymbolGroupCount:l(d,"duplicateSymbolGroupCount"),maxStructuralBreadthScore:l(d,"structuralBreadthScore"),maxStructuralCoordinationScore:Math.max(0,...d.map(t=>t.structuralCoordination.score)),maxTransitiveLocalDependencyCount:l(d,"transitiveLocalDependencyCount")}}function n(e,n,o){if(!n.startsWith("."))return;const r=function(e,n){const o=t.dirname(e);if(function(t){return t.startsWith("./")||t.startsWith("../")||t.includes("/")}(n))return[t.normalize(t.join(o,n))];const r=/^(?<dots>\.+)(?<module>.*)$/u.exec(n),a=r?.groups?.dots,i=r?.groups?.module;if(!a||void 0===i)return[];let u=o;for(let e=1;e<a.length;e+=1)u=t.dirname(u);const l=i.replaceAll(".",t.sep);return[t.normalize(t.join(u,l))]}(e,n),a=r.flatMap(e=>{const n=t.extname(e);return n?[e.slice(0,-n.length),e]:[e]});for(const e of a)for(const n of[`${e}.ts`,`${e}.tsx`,`${e}.js`,`${e}.jsx`,`${e}.py`,t.join(e,"index.ts"),t.join(e,"index.tsx"),t.join(e,"index.js"),t.join(e,"__init__.py")])if(o.has(n))return n}function o(t,e){const n=new Set,o=[...e.get(t)??[]];for(;o.length>0;){const t=o.pop();t&&!n.has(t)&&(n.add(t),o.push(...e.get(t)??[]))}return n.size}function r(t){return t.name.length>=5}function a(t,e){return{file:t,line:e.startLine}}function i(t,e){return t.file.localeCompare(e.file)||t.line-e.line}function u(t,e,n){n&&t.add(e)}function l(t,e){return Math.max(0,...t.map(t=>t[e]).filter(t=>"number"==typeof t))}export{e as measureArchitecture};
+//# sourceMappingURL=architectureMetrics.js.map

package/dist/architectureMetrics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"architectureMetrics.js","sources":["../src/architectureMetrics.ts"],"sourcesContent":["import path from 'node:path';\nimport type { CodeMetrics, DeclarationMetrics } from './types.js';\n\nexport interface ArchitectureSourceFile {\n  file: string;\n  metrics: CodeMetrics;\n}\n\nexport interface ArchitectureFileMetrics {\n  directLocalDependencyCount: number;\n  duplicateSymbolGroupCount: number;\n  file: string;\n  structuralBreadthScore: number;\n  structuralCoordination: StructuralCoordinationMetrics;\n  structuralFeatureGroups: string[];\n  transitiveLocalDependencyCount: number;\n}\n\nexport interface ArchitectureMetrics {\n  duplicateSymbolGroups: DuplicateSymbolGroup[];\n  files: ArchitectureFileMetrics[];\n  maxDirectLocalDependencyCount: number;\n  maxDuplicateSymbolGroupCount: number;\n  maxStructuralBreadthScore: number;\n  maxStructuralCoordinationScore: number;\n  maxTransitiveLocalDependencyCount: number;\n}\n\nexport interface DuplicateSymbolGroup {\n  declarations: DuplicateSymbolDeclaration[];\n  files: string[];\n  name: string;\n}\n\nexport interface DuplicateSymbolDeclaration {\n  file: string;\n  line: number;\n}\n\nexport interface StructuralCoordinationMetrics {\n  asyncBoundaryCount: number;\n  branchingScore: number;\n  exceptionHandlingCount: number;\n  moduleInteractionScore: number;\n  score: number;\n  stateMutationScore: number;\n}\n\ninterface SourceFile {\n  file: string;\n  metrics: CodeMetrics;\n  relativeFile: string;\n}\n\nconst duplicateSymbolNameLengthThreshold = 5;\n\nexport function measureArchitecture(\n  files: readonly ArchitectureSourceFile[],\n  displayRoot: string\n): ArchitectureMetrics {\n  const sourceFiles = files.map((file) => ({\n    ...file,\n    relativeFile: path.relative(displayRoot, file.file) || path.basename(file.file),\n  }));\n  const dependencyGraph = measureDependencyGraph(sourceFiles);\n  const duplicateSymbolGroups = measureDuplicateSymbolGroups(sourceFiles);\n  const duplicateGroupCountByFile = measureDuplicateGroupCountByFile(duplicateSymbolGroups);\n  const metrics = sourceFiles.map((sourceFile) => {\n    const directDependencies = dependencyGraph.get(sourceFile.relativeFile) ?? new Set<string>();\n    const structuralCoordination = measureStructuralCoordination(sourceFile.metrics);\n    const structuralFeatureGroups = measureStructuralFeatureGroups(sourceFile.metrics);\n    return {\n      file: sourceFile.relativeFile,\n      directLocalDependencyCount: directDependencies.size,\n      duplicateSymbolGroupCount: duplicateGroupCountByFile.get(sourceFile.relativeFile) ?? 0,\n      structuralBreadthScore: structuralFeatureGroups.length,\n      structuralCoordination,\n      structuralFeatureGroups,\n      transitiveLocalDependencyCount: measureTransitiveDependencyCount(sourceFile.relativeFile, dependencyGraph),\n    };\n  });\n\n  return {\n    duplicateSymbolGroups,\n    files: metrics,\n    maxDirectLocalDependencyCount: maxFileMetric(metrics, 'directLocalDependencyCount'),\n    maxDuplicateSymbolGroupCount: maxFileMetric(metrics, 'duplicateSymbolGroupCount'),\n    maxStructuralBreadthScore: maxFileMetric(metrics, 'structuralBreadthScore'),\n    maxStructuralCoordinationScore: Math.max(0, ...metrics.map((file) => file.structuralCoordination.score)),\n    maxTransitiveLocalDependencyCount: maxFileMetric(metrics, 'transitiveLocalDependencyCount'),\n  };\n}\n\nfunction measureDependencyGraph(files: SourceFile[]): Map<string, Set<string>> {\n  const fileSet = new Set(files.map((file) => file.relativeFile));\n  const graph = new Map<string, Set<string>>();\n  for (const file of files) {\n    const dependencies = new Set<string>();\n    for (const source of file.metrics.module.importSources) {\n      const resolved = resolveLocalImport(file.relativeFile, source, fileSet);\n      if (resolved) {\n        dependencies.add(resolved);\n      }\n    }\n    graph.set(file.relativeFile, dependencies);\n  }\n  return graph;\n}\n\nfunction resolveLocalImport(fromFile: string, source: string, fileSet: Set<string>): string | undefined {\n  if (!source.startsWith('.')) {\n    return undefined;\n  }\n  const bases = localImportBases(fromFile, source);\n  const stems = bases.flatMap((base) => {\n    const extension = path.extname(base);\n    return extension ? [base.slice(0, -extension.length), base] : [base];\n  });\n  for (const stem of stems) {\n    for (const candidate of [\n      `${stem}.ts`,\n      `${stem}.tsx`,\n      `${stem}.js`,\n      `${stem}.jsx`,\n      `${stem}.py`,\n      path.join(stem, 'index.ts'),\n      path.join(stem, 'index.tsx'),\n      path.join(stem, 'index.js'),\n      path.join(stem, '__init__.py'),\n    ]) {\n      if (fileSet.has(candidate)) {\n        return candidate;\n      }\n    }\n  }\n  return undefined;\n}\n\nfunction localImportBases(fromFile: string, source: string): string[] {\n  const fromDirectory = path.dirname(fromFile);\n  if (isPathRelativeImport(source)) {\n    return [path.normalize(path.join(fromDirectory, source))];\n  }\n\n  const match = /^(?<dots>\\.+)(?<module>.*)$/u.exec(source);\n  const dots = match?.groups?.dots;\n  const moduleName = match?.groups?.module;\n  if (!dots || moduleName === undefined) {\n    return [];\n  }\n\n  let baseDirectory = fromDirectory;\n  for (let index = 1; index < dots.length; index += 1) {\n    baseDirectory = path.dirname(baseDirectory);\n  }\n\n  const modulePath = moduleName.replaceAll('.', path.sep);\n  return [path.normalize(path.join(baseDirectory, modulePath))];\n}\n\nfunction isPathRelativeImport(source: string): boolean {\n  return source.startsWith('./') || source.startsWith('../') || source.includes('/');\n}\n\nfunction measureTransitiveDependencyCount(file: string, graph: Map<string, Set<string>>): number {\n  const visited = new Set<string>();\n  const pending = [...(graph.get(file) ?? [])];\n  while (pending.length > 0) {\n    const current = pending.pop();\n    if (!current || visited.has(current)) {\n      continue;\n    }\n    visited.add(current);\n    pending.push(...(graph.get(current) ?? []));\n  }\n  return visited.size;\n}\n\nfunction measureDuplicateSymbolGroups(files: SourceFile[]): DuplicateSymbolGroup[] {\n  const declarationsBySymbol = new Map<string, DuplicateSymbolDeclaration[]>();\n  for (const file of files) {\n    for (const declaration of file.metrics.module.declarations) {\n      if (!isDuplicateSymbolCandidate(declaration)) {\n        continue;\n      }\n      const declarations = declarationsBySymbol.get(declaration.name) ?? [];\n      declarations.push(toDuplicateSymbolDeclaration(file.relativeFile, declaration));\n      declarationsBySymbol.set(declaration.name, declarations);\n    }\n  }\n  return [...declarationsBySymbol.entries()]\n    .flatMap(([name, declarations]) => {\n      const duplicateFiles = [...new Set(declarations.map((declaration) => declaration.file))].toSorted();\n      return duplicateFiles.length > 1\n        ? [{ declarations: declarations.toSorted(compareDuplicateDeclarations), files: duplicateFiles, name }]\n        : [];\n    })\n    .toSorted((left, right) => right.files.length - left.files.length || left.name.localeCompare(right.name));\n}\n\nfunction isDuplicateSymbolCandidate(declaration: DeclarationMetrics): boolean {\n  return declaration.name.length >= duplicateSymbolNameLengthThreshold;\n}\n\nfunction toDuplicateSymbolDeclaration(file: string, declaration: DeclarationMetrics): DuplicateSymbolDeclaration {\n  return { file, line: declaration.startLine };\n}\n\nfunction compareDuplicateDeclarations(left: DuplicateSymbolDeclaration, right: DuplicateSymbolDeclaration): number {\n  return left.file.localeCompare(right.file) || left.line - right.line;\n}\n\nfunction measureDuplicateGroupCountByFile(groups: DuplicateSymbolGroup[]): Map<string, number> {\n  const counts = new Map<string, number>();\n  for (const group of groups) {\n    for (const file of group.files) {\n      counts.set(file, (counts.get(file) ?? 0) + 1);\n    }\n  }\n  return counts;\n}\n\nfunction measureStructuralCoordination(metrics: CodeMetrics): StructuralCoordinationMetrics {\n  const asyncBoundaryCount = metrics.syntaxFeatures.awaitExpressionCount;\n  const exceptionHandlingCount = metrics.syntaxFeatures.tryStatementCount + metrics.syntaxFeatures.throwStatementCount;\n  const stateMutationScore = metrics.syntaxFeatures.mutableBindingCount + metrics.syntaxFeatures.assignmentCount;\n  const branchingScore =\n    metrics.cyclomaticComplexity +\n    metrics.syntaxFeatures.loopStatementCount +\n    metrics.syntaxFeatures.returnStatementCount;\n  const moduleInteractionScore =\n    metrics.callGraph.callCount + metrics.callGraph.internalEdgeCount * 2 + metrics.callGraph.maxCallDepth * 3;\n\n  return {\n    asyncBoundaryCount,\n    branchingScore,\n    exceptionHandlingCount,\n    moduleInteractionScore,\n    score:\n      asyncBoundaryCount * 2 +\n      exceptionHandlingCount * 3 +\n      stateMutationScore +\n      branchingScore +\n      moduleInteractionScore,\n    stateMutationScore,\n  };\n}\n\nfunction measureStructuralFeatureGroups(metrics: CodeMetrics): string[] {\n  const groups = new Set<string>();\n  addGroup(groups, 'class-shapes', metrics.classCount > 0);\n  addGroup(groups, 'control-flow', metrics.cognitiveComplexity > 0);\n  addGroup(groups, 'external-dependencies', metrics.coupling.externalImportCount > 0);\n  addGroup(groups, 'functions', metrics.functionCount > 0);\n  addGroup(groups, 'local-dependencies', metrics.coupling.relativeImportCount > 0);\n  addGroup(groups, 'module-api', metrics.coupling.exportCount > 0 || metrics.module.declarations.length > 0);\n  addGroup(\n    groups,\n    'state-mutation',\n    metrics.syntaxFeatures.mutableBindingCount + metrics.syntaxFeatures.assignmentCount > 0\n  );\n  addGroup(groups, 'type-shapes', hasTypeShapeMetrics(metrics));\n  return [...groups].toSorted();\n}\n\nfunction addGroup(groups: Set<string>, group: string, condition: boolean): void {\n  if (condition) {\n    groups.add(group);\n  }\n}\n\nfunction hasTypeShapeMetrics(metrics: CodeMetrics): boolean {\n  return (\n    metrics.typeComplexity.typeAnnotationCount +\n      metrics.typeComplexity.typeAliasCount +\n      metrics.typeComplexity.interfaceCount +\n      metrics.typeComplexity.genericParameterCount +\n      metrics.typeComplexity.unionTypeCount +\n      metrics.typeComplexity.intersectionTypeCount +\n      metrics.typeComplexity.conditionalTypeCount >\n    0\n  );\n}\n\nfunction maxFileMetric(metrics: ArchitectureFileMetrics[], key: keyof ArchitectureFileMetrics): number {\n  return Math.max(\n    0,\n    ...metrics.map((metric) => metric[key]).filter((value): value is number => typeof value === 'number')\n  );\n}\n"],"names":["measureArchitecture","files","displayRoot","sourceFiles","map","file","relativeFile","path","relative","basename","dependencyGraph","fileSet","Set","graph","Map","dependencies","source","metrics","module","importSources","resolved","resolveLocalImport","add","set","measureDependencyGraph","duplicateSymbolGroups","declarationsBySymbol","declaration","declarations","isDuplicateSymbolCandidate","get","name","push","toDuplicateSymbolDeclaration","entries","flatMap","duplicateFiles","toSorted","length","compareDuplicateDeclarations","left","right","localeCompare","measureDuplicateSymbolGroups","duplicateGroupCountByFile","groups","counts","group","measureDuplicateGroupCountByFile","sourceFile","directDependencies","structuralCoordination","asyncBoundaryCount","syntaxFeatures","awaitExpressionCount","exceptionHandlingCount","tryStatementCount","throwStatementCount","stateMutationScore","mutableBindingCount","assignmentCount","branchingScore","cyclomaticComplexity","loopStatementCount","returnStatementCount","moduleInteractionScore","callGraph","callCount","internalEdgeCount","maxCallDepth","score","measureStructuralCoordination","structuralFeatureGroups","addGroup","classCount","cognitiveComplexity","coupling","externalImportCount","functionCount","relativeImportCount","exportCount","typeComplexity","typeAnnotationCount","typeAliasCount","interfaceCount","genericParameterCount","unionTypeCount","intersectionTypeCount","conditionalTypeCount","hasTypeShapeMetrics","measureStructuralFeatureGroups","directLocalDependencyCount","size","duplicateSymbolGroupCount","structuralBreadthScore","transitiveLocalDependencyCount","measureTransitiveDependencyCount","maxDirectLocalDependencyCount","maxFileMetric","maxDuplicateSymbolGroupCount","maxStructuralBreadthScore","maxStructuralCoordinationScore","Math","max","maxTransitiveLocalDependencyCount","fromFile","startsWith","bases","fromDirectory","dirname","includes","isPathRelativeImport","normalize","join","match","exec","dots","moduleName","undefined","baseDirectory","index","modulePath","replaceAll","sep","localImportBases","stems","base","extension","extname","slice","stem","candidate","has","visited","pending","current","pop","line","startLine","condition","key","metric","filter","value"],"mappings":"yBAwDO,SAASA,EACdC,EACAC,GAEA,MAAMC,EAAcF,EAAMG,IAAKC,IAAI,IAC9BA,EACHC,aAAcC,EAAKC,SAASN,EAAaG,EAAKA,OAASE,EAAKE,SAASJ,EAAKA,SAEtEK,EA6BR,SAAgCT,GAC9B,MAAMU,EAAU,IAAIC,IAAIX,EAAMG,IAAKC,GAASA,EAAKC,eAC3CO,EAAQ,IAAIC,IAClB,IAAK,MAAMT,KAAQJ,EAAO,CACxB,MAAMc,EAAe,IAAIH,IACzB,IAAK,MAAMI,KAAUX,EAAKY,QAAQC,OAAOC,cAAe,CACtD,MAAMC,EAAWC,EAAmBhB,EAAKC,aAAcU,EAAQL,GAC3DS,GACFL,EAAaO,IAAIF,EAErB,CACAP,EAAMU,IAAIlB,EAAKC,aAAcS,EAC/B,CACA,OAAOF,CACT,CA3C0BW,CAAuBrB,GACzCsB,EAiHR,SAAsCxB,GACpC,MAAMyB,EAAuB,IAAIZ,IACjC,IAAK,MAAMT,KAAQJ,EACjB,IAAK,MAAM0B,KAAetB,EAAKY,QAAQC,OAAOU,aAAc,CAC1D,IAAKC,EAA2BF,GAC9B,SAEF,MAAMC,EAAeF,EAAqBI,IAAIH,EAAYI,OAAS,GACnEH,EAAaI,KAAKC,EAA6B5B,EAAKC,aAAcqB,IAClED,EAAqBH,IAAII,EAAYI,KAAMH,EAC7C,CAEF,MAAO,IAAIF,EAAqBQ,WAC7BC,QAAQ,EAAEJ,EAAMH,MACf,MAAMQ,EAAiB,IAAI,IAAIxB,IAAIgB,EAAaxB,IAAKuB,GAAgBA,EAAYtB,QAAQgC,WACzF,OAAOD,EAAeE,OAAS,EAC3B,CAAC,CAAEV,aAAcA,EAAaS,SAASE,GAA+BtC,MAAOmC,EAAgBL,SAC7F,KAELM,SAAS,CAACG,EAAMC,IAAUA,EAAMxC,MAAMqC,OAASE,EAAKvC,MAAMqC,QAAUE,EAAKT,KAAKW,cAAcD,EAAMV,MACvG,CArIgCY,CAA6BxC,GACrDyC,EAkJR,SAA0CC,GACxC,MAAMC,EAAS,IAAIhC,IACnB,IAAK,MAAMiC,KAASF,EAClB,IAAK,MAAMxC,KAAQ0C,EAAM9C,MACvB6C,EAAOvB,IAAIlB,GAAOyC,EAAOhB,IAAIzB,IAAS,GAAK,GAG/C,OAAOyC,CACT,CA1JoCE,CAAiCvB,GAC7DR,EAAUd,EAAYC,IAAK6C,IAC/B,MAAMC,EAAqBxC,EAAgBoB,IAAImB,EAAW3C,eAAiB,IAAIM,IACzEuC,EAyJV,SAAuClC,GACrC,MAAMmC,EAAqBnC,EAAQoC,eAAeC,qBAC5CC,EAAyBtC,EAAQoC,eAAeG,kBAAoBvC,EAAQoC,eAAeI,oBAC3FC,EAAqBzC,EAAQoC,eAAeM,oBAAsB1C,EAAQoC,eAAeO,gBACzFC,EACJ5C,EAAQ6C,qBACR7C,EAAQoC,eAAeU,mBACvB9C,EAAQoC,eAAeW,qBACnBC,EACJhD,EAAQiD,UAAUC,UAAkD,EAAtClD,EAAQiD,UAAUE,kBAAyD,EAAjCnD,EAAQiD,UAAUG,aAE5F,MAAO,CACLjB,qBACAS,iBACAN,yBACAU,yBACAK,MACuB,EAArBlB,EACyB,EAAzBG,EACAG,EACAG,EACAI,EACFP,qBAEJ,CAjLmCa,CAA8BtB,EAAWhC,SAClEuD,EAkLV,SAAwCvD,GACtC,MAAM4B,EAAS,IAAIjC,IAanB,OAZA6D,EAAS5B,EAAQ,eAAgB5B,EAAQyD,WAAa,GACtDD,EAAS5B,EAAQ,eAAgB5B,EAAQ0D,oBAAsB,GAC/DF,EAAS5B,EAAQ,wBAAyB5B,EAAQ2D,SAASC,oBAAsB,GACjFJ,EAAS5B,EAAQ,YAAa5B,EAAQ6D,cAAgB,GACtDL,EAAS5B,EAAQ,qBAAsB5B,EAAQ2D,SAASG,oBAAsB,GAC9EN,EAAS5B,EAAQ,aAAc5B,EAAQ2D,SAASI,YAAc,GAAK/D,EAAQC,OAAOU,aAAaU,OAAS,GACxGmC,EACE5B,EACA,iBACA5B,EAAQoC,eAAeM,oBAAsB1C,EAAQoC,eAAeO,gBAAkB,GAExFa,EAAS5B,EAAQ,cAUnB,SAA6B5B,GAC3B,OACEA,EAAQgE,eAAeC,oBACrBjE,EAAQgE,eAAeE,eACvBlE,EAAQgE,eAAeG,eACvBnE,EAAQgE,eAAeI,sBACvBpE,EAAQgE,eAAeK,eACvBrE,EAAQgE,eAAeM,sBACvBtE,EAAQgE,eAAeO,qBACzB,CAEJ,CArBkCC,CAAoBxE,IAC7C,IAAI4B,GAAQR,UACrB,CAjMoCqD,CAA+BzC,EAAWhC,SAC1E,MAAO,CACLZ,KAAM4C,EAAW3C,aACjBqF,2BAA4BzC,EAAmB0C,KAC/CC,0BAA2BjD,EAA0Bd,IAAImB,EAAW3C,eAAiB,EACrFwF,uBAAwBtB,EAAwBlC,OAChDa,yBACAqB,0BACAuB,+BAAgCC,EAAiC/C,EAAW3C,aAAcI,MAI9F,MAAO,CACLe,wBACAxB,MAAOgB,EACPgF,8BAA+BC,EAAcjF,EAAS,8BACtDkF,6BAA8BD,EAAcjF,EAAS,6BACrDmF,0BAA2BF,EAAcjF,EAAS,0BAClDoF,+BAAgCC,KAAKC,IAAI,KAAMtF,EAAQb,IAAKC,GAASA,EAAK8C,uBAAuBmB,QACjGkC,kCAAmCN,EAAcjF,EAAS,kCAE9D,CAkBA,SAASI,EAAmBoF,EAAkBzF,EAAgBL,GAC5D,IAAKK,EAAO0F,WAAW,KACrB,OAEF,MAAMC,EAyBR,SAA0BF,EAAkBzF,GAC1C,MAAM4F,EAAgBrG,EAAKsG,QAAQJ,GACnC,GAoBF,SAA8BzF,GAC5B,OAAOA,EAAO0F,WAAW,OAAS1F,EAAO0F,WAAW,QAAU1F,EAAO8F,SAAS,IAChF,CAtBMC,CAAqB/F,GACvB,MAAO,CAACT,EAAKyG,UAAUzG,EAAK0G,KAAKL,EAAe5F,KAGlD,MAAMkG,EAAQ,+BAA+BC,KAAKnG,GAC5CoG,EAAOF,GAAOrE,QAAQuE,KACtBC,EAAaH,GAAOrE,QAAQ3B,OAClC,IAAKkG,QAAuBE,IAAfD,EACX,MAAO,GAGT,IAAIE,EAAgBX,EACpB,IAAK,IAAIY,EAAQ,EAAGA,EAAQJ,EAAK9E,OAAQkF,GAAS,EAChDD,EAAgBhH,EAAKsG,QAAQU,GAG/B,MAAME,EAAaJ,EAAWK,WAAW,IAAKnH,EAAKoH,KACnD,MAAO,CAACpH,EAAKyG,UAAUzG,EAAK0G,KAAKM,EAAeE,IAClD,CA7CgBG,CAAiBnB,EAAUzF,GACnC6G,EAAQlB,EAAMxE,QAAS2F,IAC3B,MAAMC,EAAYxH,EAAKyH,QAAQF,GAC/B,OAAOC,EAAY,CAACD,EAAKG,MAAM,GAAIF,EAAUzF,QAASwF,GAAQ,CAACA,KAEjE,IAAK,MAAMI,KAAQL,EACjB,IAAK,MAAMM,IAAa,CACtB,GAAGD,OACH,GAAGA,QACH,GAAGA,OACH,GAAGA,QACH,GAAGA,OACH3H,EAAK0G,KAAKiB,EAAM,YAChB3H,EAAK0G,KAAKiB,EAAM,aAChB3H,EAAK0G,KAAKiB,EAAM,YAChB3H,EAAK0G,KAAKiB,EAAM,gBAEhB,GAAIvH,EAAQyH,IAAID,GACd,OAAOA,CAKf,CA4BA,SAASnC,EAAiC3F,EAAcQ,GACtD,MAAMwH,EAAU,IAAIzH,IACd0H,EAAU,IAAKzH,EAAMiB,IAAIzB,IAAS,IACxC,KAAOiI,EAAQhG,OAAS,GAAG,CACzB,MAAMiG,EAAUD,EAAQE,MACnBD,IAAWF,EAAQD,IAAIG,KAG5BF,EAAQ/G,IAAIiH,GACZD,EAAQtG,QAASnB,EAAMiB,IAAIyG,IAAY,IACzC,CACA,OAAOF,EAAQzC,IACjB,CAwBA,SAAS/D,EAA2BF,GAClC,OAAOA,EAAYI,KAAKO,QAnJiB,CAoJ3C,CAEA,SAASL,EAA6B5B,EAAcsB,GAClD,MAAO,CAAEtB,OAAMoI,KAAM9G,EAAY+G,UACnC,CAEA,SAASnG,EAA6BC,EAAkCC,GACtE,OAAOD,EAAKnC,KAAKqC,cAAcD,EAAMpC,OAASmC,EAAKiG,KAAOhG,EAAMgG,IAClE,CAuDA,SAAShE,EAAS5B,EAAqBE,EAAe4F,GAChDA,GACF9F,EAAOvB,IAAIyB,EAEf,CAeA,SAASmD,EAAcjF,EAAoC2H,GACzD,OAAOtC,KAAKC,IACV,KACGtF,EAAQb,IAAKyI,GAAWA,EAAOD,IAAME,OAAQC,GAA4C,iBAAVA,GAEtF"}

package/dist/cli.cjs

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+"use strict";var t=require("node:fs/promises"),e=require("node:os"),n=require("node:path"),i=require("commander"),o=require("./architectureMetrics.cjs"),r=require("./cliConfig.cjs"),a=require("./metrics.cjs"),c=require("./typescriptProject.cjs");const s=new Map([[".cjs","javascript"],[".cts","typescript"],[".go","go"],[".js","javascript"],[".jsx","jsx"],[".mjs","javascript"],[".mts","typescript"],[".py","python"],[".ts","typescript"],[".tsx","tsx"]]),l=new Set([".agents",".claude",".cursor",".git",".next",".playwright-cli",".tox",".tmp",".turbo",".venv",".yarn","__fixtures__","__generated__","__pycache__","coverage","dist","fixtures","generated","node_modules","test-fixtures","vendor","venv"]),u=new Set(["__tests__","test","tests"]),m=/(?:^test(?:[_-].*)?|\.(?:spec|test)|[_-]test)\.[^.]+$/iu;function p(t){return"~"===t?e.homedir():t.startsWith("~/")?n.join(e.homedir(),t.slice(2)):n.resolve(t)}async function d(e){try{return(await t.stat(e)).isFile()}catch{return!1}}async function f(e,i,o,r,a,c,s){let l,u;try{l=await t.realpath(e)}catch(t){return void r.push(`${R(e,s)}: ${T(t)}`)}if(E(l,s)&&!a.has(l)){a.add(l);try{u=await t.readdir(e,{withFileTypes:!0})}catch(t){return void r.push(`${R(e,s)}: ${T(t)}`)}for(const t of u){const l=n.join(e,t.name);if(t.isSymbolicLink())await h(t.name,l,i,o,r,a,c,s);else if(t.isDirectory()){if(_(t.name,i))continue;await f(l,i,o,r,a,c,s)}else t.isFile()&&await y(l,i,o,r,c,s)}}}async function h(e,i,o,r,a,c,s,l){let u,m;try{u=await t.realpath(i)}catch(t){return void a.push(`${R(i,l)}: ${T(t)}`)}if(E(u,l)){try{m=await t.stat(i)}catch(t){return void a.push(`${R(i,l)}: ${T(t)}`)}if(m.isDirectory()){if(_(e,o)||_(n.basename(u),o))return;await f(i,o,r,a,c,s,l)}else m.isFile()&&await y(i,o,r,a,s,l,u,u)}}async function y(t,e,n,i,o,r,a=t,c){const s=M(a,e);s&&await g(t,s,n,i,o,r,c)}async function g(e,n,i,o,r,c,s){try{const o=s??await t.realpath(e);if(r.has(o))return;r.add(o);const c=await t.readFile(e,"utf8");i.push({file:e,metrics:a.measureCode(c,{language:n})})}catch(t){o.push(`${R(e,c)}: ${T(t)}`)}}function C(t,e,n,i,o){const r=[],a=R(t,o);if($(r,"file LOC",e.lines.code,i.fileLoc),$(r,"import sources",e.coupling.importSourceCount,i.import),$(r,"duplicated blocks",e.duplication.duplicateBlockCount,i.duplicateBlock),n){(e.lines.code>=100||n.directLocalDependencyCount>=8)&&$(r,"transitive local dependencies",n.transitiveLocalDependencyCount,i.transitiveDependency),(r.length>0||n.directLocalDependencyCount>=8||n.structuralCoordination.score>=i.structuralCoordination)&&$(r,"structural breadth",n.structuralBreadthScore,i.structuralBreadth),$(r,"structural coordination",n.structuralCoordination.score,i.structuralCoordination),$(r,"state mutation",n.structuralCoordination.stateMutationScore,i.stateMutation),$(r,"duplicate symbol groups",n.duplicateSymbolGroupCount,i.duplicateSymbolGroup)}return 0===r.length?[]:[{file:a,language:e.language,kind:"file",cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,triggers:r,score:b(r)}]}function $(t,e,n,i){n<i||t.push({metric:e,value:n,threshold:i,score:n/i})}function x(t,e,n,i){return n?.has(v(t,e.startLine,e.startColumn))||!!e.name&&i?.has(w(t,e.name,e.startLine))||!1}function v(t,e,i){return`${n.resolve(t)}:${e}:${i}`}function w(t,e,i){return`${n.resolve(t)}:${e}:${i}`}function b(t){return Math.max(...t.map(t=>t.score))}function j(t,e){return e.score-t.score||t.file.localeCompare(e.file)||(t.startLine??0)-(e.startLine??0)||(t.endLine??0)-(e.endLine??0)||t.kind.localeCompare(e.kind)}function L(t){return void 0===t.startLine||void 0===t.endLine?t.file:`${t.file}:${t.startLine}-${t.endLine}`}function S(t){return t.name?`${t.kind} ${t.name}`:t.kind}function k(t){return`(${t.triggers.map(t=>`${t.metric} ${O(t.value)} >= ${O(t.threshold)}`).join(", ")}; cyclomatic ${t.cyclomaticComplexity}, cognitive ${t.cognitiveComplexity})`}function O(t){return Number.isInteger(t)?String(t):t.toFixed(2)}function F(t){let e=0,n=0,i=0,o=0,r=0,a=0,c=0,s=0,l=0,u=0,m=0,p=0,d=0,f=0,h=0,y=0;for(const g of t)e+=g.metrics.functionCount,n+=g.metrics.lines.code,i=Math.max(i,g.metrics.maxCyclomaticComplexity),o=Math.max(o,g.metrics.maxCognitiveComplexity),r+=g.metrics.callGraph.callCount,a+=g.metrics.callGraph.internalCallCount,c=Math.max(c,g.metrics.callGraph.maxCallDepth),s+=g.metrics.coupling.importSourceCount,l+=g.metrics.coupling.relativeImportCount,u+=g.metrics.coupling.externalImportCount,m+=g.metrics.coupling.exportCount,p+=g.metrics.cohesion.averageFunctionIdentifierOverlap,d+=g.metrics.typeComplexity.typeAnnotationCount,f+=g.metrics.typeComplexity.typeAliasCount,h+=g.metrics.typeComplexity.interfaceCount,y+=g.metrics.typeComplexity.genericParameterCount;return{fileCount:t.length,functionCount:e,linesOfCode:n,maxCyclomaticComplexity:i,maxCognitiveComplexity:o,callCount:r,internalCallCount:a,maxCallDepth:c,importSourceCount:s,relativeImportCount:l,externalImportCount:u,exportCount:m,averageFunctionIdentifierOverlap:0===t.length?0:p/t.length,typeAnnotationCount:d,typeAliasCount:f,interfaceCount:h,genericParameterCount:y}}function _(t,e){return!!l.has(t)||!e.includeTests&&u.has(t)}function E(t,e){const i=n.relative(e,t);return""===i||".."!==i&&!i.startsWith(`..${n.sep}`)&&!n.isAbsolute(i)}function M(t,e,i=!1){const o=t.toLowerCase();if((i||!(o.endsWith(".d.ts")||o.endsWith(".d.mts")||o.endsWith(".d.cts")||o.endsWith(".min.js")||o.endsWith(".pnp.cjs")))&&(i||e.includeTests||!m.test(n.basename(t))))return s.get(n.extname(o))}function D(t){if(!/^[1-9]\d*$/u.test(t))throw new i.InvalidArgumentError("Expected a positive integer.");const e=Number(t);if(!Number.isSafeInteger(e)||e<1)throw new i.InvalidArgumentError("Expected a positive integer.");return e}function R(t,e){return n.relative(e,t)||n.basename(t)}function A(t){process.stdout.write(t)}function P(t){process.stderr.write(t)}function T(t){return t instanceof Error?t.message:String(t)}(async function(){const e=(new i.Command).name("code-gauge").description("Measure code metrics and list high-risk findings.").argument("[target]","file or directory to measure",".").option("--config <path>",`config file to use instead of the auto-detected ${r.configFileName}`).option("--file-loc-threshold <number>","minimum file code LOC to report",D).option("--function-loc-threshold <number>","minimum function physical LOC span to report",D).option("--component-loc-threshold <number>","minimum React component physical LOC span to report",D).option("--cognitive-threshold <number>","minimum cognitive complexity to report",D).option("--cyclomatic-threshold <number>","minimum cyclomatic complexity to report",D).option("--call-threshold <number>","minimum function call count to report",D).option("--import-threshold <number>","minimum unique import sources per file to report",D).option("--fan-out-threshold <number>","minimum intra-file fan-out per function to report",D).option("--parameter-threshold <number>","minimum function parameter count to report",D).option("--duplicate-block-threshold <number>","minimum count of duplicated code blocks per file to report",D).option("--transitive-dependency-threshold <number>","minimum transitively reachable local files to report",D).option("--structural-breadth-threshold <number>","minimum structural breadth score to report",D).option("--structural-coordination-threshold <number>","minimum structural coordination score to report",D).option("--state-mutation-threshold <number>","minimum state mutation score to report",D).option("--duplicate-symbol-group-threshold <number>","minimum duplicate symbol group count to report",D).option("--max-findings <number>","maximum number of risk findings to print",D).option("--include-tests","include test files and test directories").option("--tsconfig <path>","TypeScript project file to use instead of auto-detected tsconfig.json").option("--json","print JSON output").option("--fail-on-error","exit with code 1 when files or directories cannot be scanned").option("--fail-on-risk","exit with code 1 when high-risk findings are found");e.action(async(e,i)=>{const a=p(e),s=await r.loadConfig(i.config,await async function(e){try{return(await t.stat(e)).isDirectory()?e:n.dirname(e)}catch{return n.dirname(e)}}(a)),l=r.resolveOptions(i,s),u=await async function(e,i){const o=[],r=[],a=new Set;let c=e;try{c=await t.realpath(e)}catch{}const s=n.dirname(c);let l;try{l=await t.stat(c)}catch(t){const e=`${R(c,s)}: ${T(t)}`;return{displayRoot:s,files:o,errors:[e],fatalError:e}}if(l.isFile()){const t=n.dirname(c),e=M(c,i,!0);if(!e){const e=`${R(c,t)}: unsupported file type`;return{displayRoot:t,files:o,errors:[e],fatalError:e}}return await g(c,e,o,r,a,t,c),{displayRoot:t,files:o,errors:r}}return await f(c,i,o,r,new Set,a,c),{displayRoot:c,files:o,errors:r}}(a,l);await async function(t){if(t.fatalError)return;try{t.architecture=o.measureArchitecture(t.files.map(({file:t,metrics:e})=>({file:t,metrics:e})),t.displayRoot)}catch(e){t.errors.push(`architecture metrics: ${T(e)}`)}}(u),await async function(e,i,o){if(e.fatalError)return;if(0===e.files.length)return;const r=i.tsconfig,a=void 0!==r;if(!a&&!e.files.some(({file:t})=>function(t){return[".cjs",".cts",".js",".jsx",".mjs",".mts",".ts",".tsx"].includes(n.extname(t))}(t)))return;const s=r?p(r):await async function(e){const i=await t.stat(e);let o=i.isDirectory()?e:n.dirname(e);for(;;){const t=n.join(o,"tsconfig.json");if(await d(t))return t;const e=n.dirname(o);if(e===o)return;o=e}}(o);if(!s)return;try{e.typeScriptProject=await c.measureTypeScriptProject(s,e.files.map(({file:t})=>t)),e.componentFunctionKeys=new Set(e.typeScriptProject.reactComponentFunctions.map(t=>v(t.file,t.startLine,t.startColumn))),e.namedComponentFunctionKeys=new Set(e.typeScriptProject.reactComponentFunctions.flatMap(t=>t.name?[w(t.file,t.name,t.startLine)]:[]))}catch(t){a&&e.errors.push(`${R(s,e.displayRoot)}: ${T(t)}`)}}(u,l,a);const m=function(t,e,n,i,o,a){const c=new Map(e?.files.map(t=>[t.file,t])),s=t.flatMap(({file:t,metrics:e})=>{const s=e.functions.some(e=>e.returnsJsx||x(t,e,n,i)),l=r.resolveThresholds(o,e.language,s);return[...C(t,e,c.get(R(t,a)),l,a),...e.functions.flatMap(o=>function(t,e,n,i,o,r,a){const c=n.endLine-n.startLine+1,s=x(t,n,r,a),l=s?"component":"function",u=[];if($(u,"cognitive complexity",n.cognitiveComplexity,i.cognitive),$(u,"cyclomatic complexity",n.cyclomaticComplexity,i.cyclomatic),$(u,s?"component LOC":"function LOC",c,function(t,e){return t?e.componentLoc:e.functionLoc}(s,i)),$(u,"function calls",n.callCount,i.call),$(u,"fan-out",n.fanOut,i.fanOut),$(u,"parameters",n.parameterCount,i.parameter),0===u.length)return[];return[{file:R(t,o),language:e,kind:l,name:n.name??"<anonymous>",startLine:n.startLine,endLine:n.endLine,cyclomaticComplexity:n.cyclomaticComplexity,cognitiveComplexity:n.cognitiveComplexity,triggers:u,score:b(u)}]}(t,e.language,o,l,a,n,i))]});return s.sort(j),s}(u.files,u.architecture,u.componentFunctionKeys,u.namedComponentFunctionKeys,l,u.displayRoot);l.json?function(t,e,n){const i=F(t.files),o=e.slice(0,n.maxFindings);A(JSON.stringify({summary:i,thresholds:n.thresholds,profileThresholds:n.profileThresholds,totalRisks:e.length,truncated:o.length<e.length,architecture:t.architecture,typeScriptProject:t.typeScriptProject,risks:o,errors:t.errors},void 0,2)+"\n")}(u,m,l):function(t,e,n,i){if(e.fatalError)return void P(`Error: ${e.fatalError}\n`);const{thresholds:o}=i,r=F(e.files);A(`Measured ${r.fileCount} files under ${t}\n`),A(`LOC ${r.linesOfCode}, functions ${r.functionCount}, max cyclomatic ${r.maxCyclomaticComplexity}, max cognitive ${r.maxCognitiveComplexity}\n`),A(`Calls ${r.callCount}, internal edges ${r.internalCallCount}, max call depth ${r.maxCallDepth}, imports ${r.importSourceCount}, exports ${r.exportCount}\n`),A(`Type annotations ${r.typeAnnotationCount}, type aliases ${r.typeAliasCount}, interfaces ${r.interfaceCount}, avg cohesion ${r.averageFunctionIdentifierOverlap.toFixed(2)}\n`),e.architecture&&A(`${function(t){const e=Math.max(0,...t.files.map(t=>t.structuralCoordination.stateMutationScore));return`Architecture max reachable files ${t.maxTransitiveLocalDependencyCount}, max structural breadth ${t.maxStructuralBreadthScore}, max structural coordination ${t.maxStructuralCoordinationScore}, max state mutation ${e}, duplicate symbol groups ${t.duplicateSymbolGroups.length}`}(e.architecture)}\n`);e.typeScriptProject&&A(`${function(t){return`TypeScript project root files ${t.rootFileCount}, measured roots ${t.measuredRootFileCount}, semantic diagnostics ${t.semanticDiagnosticCount}, resolved calls ${t.resolvedCallExpressionCount}/${t.callExpressionCount} (${(100*t.resolvedCallExpressionRatio).toFixed(1)}%)`}(e.typeScriptProject)}\n`);A(`Risk thresholds: file LOC >= ${o.fileLoc}, function LOC >= ${o.functionLoc}, component LOC >= ${o.componentLoc}, cognitive >= ${o.cognitive}, cyclomatic >= ${o.cyclomatic}, calls >= ${o.call}, imports >= ${o.import}, fan-out >= ${o.fanOut}, parameters >= ${o.parameter}, duplicated blocks >= ${o.duplicateBlock}\n`);const a=(c=i.profileThresholds,Object.entries(c).map(([t,e])=>`${t} { ${Object.entries(e).map(([t,e])=>`${t} ${e}`).join(", ")} }`).join("; "));var c;a&&A(`Per-language overrides: ${a}\n`);if(0===n.length)A("No high-risk findings found.\n");else{const t=n.slice(0,i.maxFindings),e=n.length>t.length?` of ${n.length}`:"";A(`\nHigh-risk findings (top ${t.length}${e}):\n`);for(const e of t)A(`${L(e)} ${S(e)} ${k(e)}\n`)}if(e.errors.length>0){P(`\nSkipped ${e.errors.length} files or directories:\n`);for(const t of e.errors.slice(0,10))P(`- ${t}\n`);e.errors.length>10&&P(`- ... ${e.errors.length-10} more\n`)}}(a,u,m,l),(u.fatalError||l.failOnError&&u.errors.length>0||l.failOnRisk&&m.length>0)&&(process.exitCode=1)}),await e.parseAsync()})().catch(t=>{P(`Error: ${T(t)}\n`),process.exitCode=1});
+//# sourceMappingURL=cli.cjs.map