measure-code 1.0.0

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,41 @@
+# tree-measurer
+
+[![Test](https://github.com/WillBooster/tree-measurer/actions/workflows/test.yml/badge.svg)](https://github.com/WillBooster/tree-measurer/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 library for measuring code metrics with tree-sitter.
+
+## Metrics
+
+- Physical LOC, code lines, comment-only lines, and blank lines
+- Function and class counts
+- Cyclomatic complexity
+- Cognitive complexity
+- Maximum per-function complexity
+- Nesting depth
+- Halstead metrics
+- Maintainability index
+
+## Supported languages
+
+Built-in parsers are registered for JavaScript, JSX, TypeScript, TSX, Python, and Go. Additional tree-sitter grammars can be registered with `TreeMeasurer.registerLanguage`.
+
+## Usage
+
+```ts
+import { measureCode } from 'measure-code';
+
+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/index.cjs

@@ -0,0 +1,2 @@
+"use strict";var e=require("./languages.cjs"),r=require("./metrics.cjs");exports.defaultLanguages=e.defaultLanguages,exports.supportedLanguages=e.supportedLanguages,exports.TreeMeasurer=r.TreeMeasurer,exports.defaultMeasurer=r.defaultMeasurer,exports.measureCode=r.measureCode;
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+export { defaultLanguages, supportedLanguages } from './languages.js';
+export { TreeMeasurer, defaultMeasurer, measureCode } from './metrics.js';
+export type { CodeMetrics, FunctionMetrics, HalsteadMetrics, LanguageDefinition, LanguageName, LineMetrics, MeasureOptions, SupportedLanguage, } from './types.js';

package/dist/index.js

@@ -0,0 +1,2 @@
+export{defaultLanguages,supportedLanguages}from"./languages.js";export{TreeMeasurer,defaultMeasurer,measureCode}from"./metrics.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/languages.cjs

@@ -0,0 +1,2 @@
+"use strict";var e=require("tree-sitter-go"),t=require("tree-sitter-javascript"),a=require("tree-sitter-python"),n=require("tree-sitter-typescript");const s=["function","function_declaration","function_definition","function_item","function_declarator","method_declaration","method_definition","method_spec","arrow_function","generator_function","generator_function_declaration","lambda","lambda_expression"],r=["class","class_declaration","class_definition","interface_declaration","trait_item","impl_item","struct_item","enum_item"],i=["if_statement","elif_clause","else_if_clause","for_statement","for_in_statement","while_statement","do_statement","catch_clause","except_clause","case_clause","switch_case","match_arm","conditional_expression","ternary_expression"];function o(e){return function(e,t){if("object"!=typeof e||null===e||!(t in e))return!1;return Boolean(e[t])}(e,"default")?e.default:e}function c(e){return n[e]}const u=[{name:"javascript",aliases:["js","mjs","cjs"],parserLanguage:o(t)},{name:"jsx",parserLanguage:o(t)},{name:"typescript",aliases:["ts"],parserLanguage:c("typescript")},{name:"tsx",parserLanguage:c("tsx")},{name:"python",aliases:["py"],parserLanguage:o(a)},{name:"go",parserLanguage:o(e)}].map(e=>({functionNodeTypes:s,classNodeTypes:r,decisionNodeTypes:i,nestingNodeTypes:i,...e}));const p=u.map(e=>e.name);exports.createLanguageRegistry=function(e=u){const t=new Map;for(const a of e){t.set(a.name,a);for(const e of a.aliases??[])t.set(e,a)}return t},exports.defaultLanguages=u,exports.supportedLanguages=p;
+//# sourceMappingURL=languages.cjs.map

package/dist/languages.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"languages.cjs","sources":["../src/languages.ts"],"sourcesContent":["import Go from 'tree-sitter-go';\nimport JavaScript from 'tree-sitter-javascript';\nimport Python from 'tree-sitter-python';\nimport TypeScript from 'tree-sitter-typescript';\nimport type { LanguageDefinition, LanguageName, ParserLanguage } from './types.js';\n\ntype GrammarModule = unknown;\n\nconst commonFunctionNodes = [\n  'function',\n  'function_declaration',\n  'function_definition',\n  'function_item',\n  'function_declarator',\n  'method_declaration',\n  'method_definition',\n  'method_spec',\n  'arrow_function',\n  'generator_function',\n  'generator_function_declaration',\n  'lambda',\n  'lambda_expression',\n] as const;\n\nconst commonClassNodes = [\n  'class',\n  'class_declaration',\n  'class_definition',\n  'interface_declaration',\n  'trait_item',\n  'impl_item',\n  'struct_item',\n  'enum_item',\n] as const;\n\nconst commonDecisionNodes = [\n  'if_statement',\n  'elif_clause',\n  'else_if_clause',\n  'for_statement',\n  'for_in_statement',\n  'while_statement',\n  'do_statement',\n  'catch_clause',\n  'except_clause',\n  'case_clause',\n  'switch_case',\n  'match_arm',\n  'conditional_expression',\n  'ternary_expression',\n] as const;\n\nfunction normalizeGrammar(module: GrammarModule): ParserLanguage {\n  if (isGrammarWrapper(module, 'default')) {\n    return module.default;\n  }\n\n  return module;\n}\n\nfunction getTypeScriptGrammar(name: 'typescript' | 'tsx'): ParserLanguage {\n  const grammars = TypeScript as unknown as Record<string, GrammarModule>;\n  return grammars[name];\n}\n\nfunction isGrammarWrapper(value: GrammarModule, key: 'default'): value is Record<typeof key, ParserLanguage> {\n  if (typeof value !== 'object' || value === null || !(key in value)) {\n    return false;\n  }\n\n  return Boolean((value as Record<string, ParserLanguage>)[key]);\n}\n\nexport const defaultLanguages: readonly LanguageDefinition[] = [\n  {\n    name: 'javascript',\n    aliases: ['js', 'mjs', 'cjs'],\n    parserLanguage: normalizeGrammar(JavaScript as unknown as GrammarModule),\n  },\n  {\n    name: 'jsx',\n    parserLanguage: normalizeGrammar(JavaScript as unknown as GrammarModule),\n  },\n  {\n    name: 'typescript',\n    aliases: ['ts'],\n    parserLanguage: getTypeScriptGrammar('typescript'),\n  },\n  {\n    name: 'tsx',\n    parserLanguage: getTypeScriptGrammar('tsx'),\n  },\n  {\n    name: 'python',\n    aliases: ['py'],\n    parserLanguage: normalizeGrammar(Python as unknown as GrammarModule),\n  },\n  {\n    name: 'go',\n    parserLanguage: normalizeGrammar(Go as unknown as GrammarModule),\n  },\n].map((language) => ({\n  functionNodeTypes: commonFunctionNodes,\n  classNodeTypes: commonClassNodes,\n  decisionNodeTypes: commonDecisionNodes,\n  nestingNodeTypes: commonDecisionNodes,\n  ...language,\n}));\n\nexport function createLanguageRegistry(\n  languages: readonly LanguageDefinition[] = defaultLanguages\n): Map<LanguageName, LanguageDefinition> {\n  const registry = new Map<LanguageName, LanguageDefinition>();\n\n  for (const language of languages) {\n    registry.set(language.name, language);\n    for (const alias of language.aliases ?? []) {\n      registry.set(alias, language);\n    }\n  }\n\n  return registry;\n}\n\nexport const supportedLanguages = defaultLanguages.map((language) => language.name);\n"],"names":["commonFunctionNodes","commonClassNodes","commonDecisionNodes","normalizeGrammar","module","value","key","Boolean","isGrammarWrapper","default","getTypeScriptGrammar","name","TypeScript","defaultLanguages","aliases","parserLanguage","JavaScript","Python","Go","map","language","functionNodeTypes","classNodeTypes","decisionNodeTypes","nestingNodeTypes","supportedLanguages","languages","registry","Map","set","alias"],"mappings":"qJAQA,MAAMA,EAAsB,CAC1B,WACA,uBACA,sBACA,gBACA,sBACA,qBACA,oBACA,cACA,iBACA,qBACA,iCACA,SACA,qBAGIC,EAAmB,CACvB,QACA,oBACA,mBACA,wBACA,aACA,YACA,cACA,aAGIC,EAAsB,CAC1B,eACA,cACA,iBACA,gBACA,mBACA,kBACA,eACA,eACA,gBACA,cACA,cACA,YACA,yBACA,sBAGF,SAASC,EAAiBC,GACxB,OAYF,SAA0BC,EAAsBC,GAC9C,GAAqB,iBAAVD,GAAgC,OAAVA,KAAoBC,KAAOD,GAC1D,OAAO,EAGT,OAAOE,QAASF,EAAyCC,GAC3D,CAlBME,CAAiBJ,EAAQ,WACpBA,EAAOK,QAGTL,CACT,CAEA,SAASM,EAAqBC,GAE5B,OADiBC,EACDD,EAClB,CAUO,MAAME,EAAkD,CAC7D,CACEF,KAAM,aACNG,QAAS,CAAC,KAAM,MAAO,OACvBC,eAAgBZ,EAAiBa,IAEnC,CACEL,KAAM,MACNI,eAAgBZ,EAAiBa,IAEnC,CACEL,KAAM,aACNG,QAAS,CAAC,MACVC,eAAgBL,EAAqB,eAEvC,CACEC,KAAM,MACNI,eAAgBL,EAAqB,QAEvC,CACEC,KAAM,SACNG,QAAS,CAAC,MACVC,eAAgBZ,EAAiBc,IAEnC,CACEN,KAAM,KACNI,eAAgBZ,EAAiBe,KAEnCC,IAAKC,IAAQ,CACbC,kBAAmBrB,EACnBsB,eAAgBrB,EAChBsB,kBAAmBrB,EACnBsB,iBAAkBtB,KACfkB,KAkBE,MAAMK,EAAqBZ,EAAiBM,IAAKC,GAAaA,EAAST,qCAfvE,SACLe,EAA2Cb,GAE3C,MAAMc,EAAW,IAAIC,IAErB,IAAK,MAAMR,KAAYM,EAAW,CAChCC,EAASE,IAAIT,EAAST,KAAMS,GAC5B,IAAK,MAAMU,KAASV,EAASN,SAAW,GACtCa,EAASE,IAAIC,EAAOV,EAExB,CAEA,OAAOO,CACT"}

package/dist/languages.d.ts

@@ -0,0 +1,4 @@
+import type { LanguageDefinition, LanguageName } from './types.js';
+export declare const defaultLanguages: readonly LanguageDefinition[];
+export declare function createLanguageRegistry(languages?: readonly LanguageDefinition[]): Map<LanguageName, LanguageDefinition>;
+export declare const supportedLanguages: LanguageName[];

package/dist/languages.js

@@ -0,0 +1,2 @@
+import e from"tree-sitter-go";import t from"tree-sitter-javascript";import n from"tree-sitter-python";import a from"tree-sitter-typescript";const s=["function","function_declaration","function_definition","function_item","function_declarator","method_declaration","method_definition","method_spec","arrow_function","generator_function","generator_function_declaration","lambda","lambda_expression"],r=["class","class_declaration","class_definition","interface_declaration","trait_item","impl_item","struct_item","enum_item"],i=["if_statement","elif_clause","else_if_clause","for_statement","for_in_statement","while_statement","do_statement","catch_clause","except_clause","case_clause","switch_case","match_arm","conditional_expression","ternary_expression"];function o(e){return function(e,t){if("object"!=typeof e||null===e||!(t in e))return!1;return Boolean(e[t])}(e,"default")?e.default:e}function c(e){return a[e]}const m=[{name:"javascript",aliases:["js","mjs","cjs"],parserLanguage:o(t)},{name:"jsx",parserLanguage:o(t)},{name:"typescript",aliases:["ts"],parserLanguage:c("typescript")},{name:"tsx",parserLanguage:c("tsx")},{name:"python",aliases:["py"],parserLanguage:o(n)},{name:"go",parserLanguage:o(e)}].map(e=>({functionNodeTypes:s,classNodeTypes:r,decisionNodeTypes:i,nestingNodeTypes:i,...e}));function p(e=m){const t=new Map;for(const n of e){t.set(n.name,n);for(const e of n.aliases??[])t.set(e,n)}return t}const _=m.map(e=>e.name);export{p as createLanguageRegistry,m as defaultLanguages,_ as supportedLanguages};
+//# sourceMappingURL=languages.js.map

package/dist/languages.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"languages.js","sources":["../src/languages.ts"],"sourcesContent":["import Go from 'tree-sitter-go';\nimport JavaScript from 'tree-sitter-javascript';\nimport Python from 'tree-sitter-python';\nimport TypeScript from 'tree-sitter-typescript';\nimport type { LanguageDefinition, LanguageName, ParserLanguage } from './types.js';\n\ntype GrammarModule = unknown;\n\nconst commonFunctionNodes = [\n  'function',\n  'function_declaration',\n  'function_definition',\n  'function_item',\n  'function_declarator',\n  'method_declaration',\n  'method_definition',\n  'method_spec',\n  'arrow_function',\n  'generator_function',\n  'generator_function_declaration',\n  'lambda',\n  'lambda_expression',\n] as const;\n\nconst commonClassNodes = [\n  'class',\n  'class_declaration',\n  'class_definition',\n  'interface_declaration',\n  'trait_item',\n  'impl_item',\n  'struct_item',\n  'enum_item',\n] as const;\n\nconst commonDecisionNodes = [\n  'if_statement',\n  'elif_clause',\n  'else_if_clause',\n  'for_statement',\n  'for_in_statement',\n  'while_statement',\n  'do_statement',\n  'catch_clause',\n  'except_clause',\n  'case_clause',\n  'switch_case',\n  'match_arm',\n  'conditional_expression',\n  'ternary_expression',\n] as const;\n\nfunction normalizeGrammar(module: GrammarModule): ParserLanguage {\n  if (isGrammarWrapper(module, 'default')) {\n    return module.default;\n  }\n\n  return module;\n}\n\nfunction getTypeScriptGrammar(name: 'typescript' | 'tsx'): ParserLanguage {\n  const grammars = TypeScript as unknown as Record<string, GrammarModule>;\n  return grammars[name];\n}\n\nfunction isGrammarWrapper(value: GrammarModule, key: 'default'): value is Record<typeof key, ParserLanguage> {\n  if (typeof value !== 'object' || value === null || !(key in value)) {\n    return false;\n  }\n\n  return Boolean((value as Record<string, ParserLanguage>)[key]);\n}\n\nexport const defaultLanguages: readonly LanguageDefinition[] = [\n  {\n    name: 'javascript',\n    aliases: ['js', 'mjs', 'cjs'],\n    parserLanguage: normalizeGrammar(JavaScript as unknown as GrammarModule),\n  },\n  {\n    name: 'jsx',\n    parserLanguage: normalizeGrammar(JavaScript as unknown as GrammarModule),\n  },\n  {\n    name: 'typescript',\n    aliases: ['ts'],\n    parserLanguage: getTypeScriptGrammar('typescript'),\n  },\n  {\n    name: 'tsx',\n    parserLanguage: getTypeScriptGrammar('tsx'),\n  },\n  {\n    name: 'python',\n    aliases: ['py'],\n    parserLanguage: normalizeGrammar(Python as unknown as GrammarModule),\n  },\n  {\n    name: 'go',\n    parserLanguage: normalizeGrammar(Go as unknown as GrammarModule),\n  },\n].map((language) => ({\n  functionNodeTypes: commonFunctionNodes,\n  classNodeTypes: commonClassNodes,\n  decisionNodeTypes: commonDecisionNodes,\n  nestingNodeTypes: commonDecisionNodes,\n  ...language,\n}));\n\nexport function createLanguageRegistry(\n  languages: readonly LanguageDefinition[] = defaultLanguages\n): Map<LanguageName, LanguageDefinition> {\n  const registry = new Map<LanguageName, LanguageDefinition>();\n\n  for (const language of languages) {\n    registry.set(language.name, language);\n    for (const alias of language.aliases ?? []) {\n      registry.set(alias, language);\n    }\n  }\n\n  return registry;\n}\n\nexport const supportedLanguages = defaultLanguages.map((language) => language.name);\n"],"names":["commonFunctionNodes","commonClassNodes","commonDecisionNodes","normalizeGrammar","module","value","key","Boolean","isGrammarWrapper","default","getTypeScriptGrammar","name","TypeScript","defaultLanguages","aliases","parserLanguage","JavaScript","Python","Go","map","language","functionNodeTypes","classNodeTypes","decisionNodeTypes","nestingNodeTypes","createLanguageRegistry","languages","registry","Map","set","alias","supportedLanguages"],"mappings":"4IAQA,MAAMA,EAAsB,CAC1B,WACA,uBACA,sBACA,gBACA,sBACA,qBACA,oBACA,cACA,iBACA,qBACA,iCACA,SACA,qBAGIC,EAAmB,CACvB,QACA,oBACA,mBACA,wBACA,aACA,YACA,cACA,aAGIC,EAAsB,CAC1B,eACA,cACA,iBACA,gBACA,mBACA,kBACA,eACA,eACA,gBACA,cACA,cACA,YACA,yBACA,sBAGF,SAASC,EAAiBC,GACxB,OAYF,SAA0BC,EAAsBC,GAC9C,GAAqB,iBAAVD,GAAgC,OAAVA,KAAoBC,KAAOD,GAC1D,OAAO,EAGT,OAAOE,QAASF,EAAyCC,GAC3D,CAlBME,CAAiBJ,EAAQ,WACpBA,EAAOK,QAGTL,CACT,CAEA,SAASM,EAAqBC,GAE5B,OADiBC,EACDD,EAClB,CAUO,MAAME,EAAkD,CAC7D,CACEF,KAAM,aACNG,QAAS,CAAC,KAAM,MAAO,OACvBC,eAAgBZ,EAAiBa,IAEnC,CACEL,KAAM,MACNI,eAAgBZ,EAAiBa,IAEnC,CACEL,KAAM,aACNG,QAAS,CAAC,MACVC,eAAgBL,EAAqB,eAEvC,CACEC,KAAM,MACNI,eAAgBL,EAAqB,QAEvC,CACEC,KAAM,SACNG,QAAS,CAAC,MACVC,eAAgBZ,EAAiBc,IAEnC,CACEN,KAAM,KACNI,eAAgBZ,EAAiBe,KAEnCC,IAAKC,IAAQ,CACbC,kBAAmBrB,EACnBsB,eAAgBrB,EAChBsB,kBAAmBrB,EACnBsB,iBAAkBtB,KACfkB,KAGE,SAASK,EACdC,EAA2Cb,GAE3C,MAAMc,EAAW,IAAIC,IAErB,IAAK,MAAMR,KAAYM,EAAW,CAChCC,EAASE,IAAIT,EAAST,KAAMS,GAC5B,IAAK,MAAMU,KAASV,EAASN,SAAW,GACtCa,EAASE,IAAIC,EAAOV,EAExB,CAEA,OAAOO,CACT,CAEO,MAAMI,EAAqBlB,EAAiBM,IAAKC,GAAaA,EAAST"}

package/dist/metrics.cjs

@@ -0,0 +1,2 @@
+"use strict";var t=require("tree-sitter"),e=require("./languages.cjs");const n=new Set(["&&","||","and","or"]),o=new Set(["+","-","*","/","%","**","=","+=","-=","*=","/=","%=","==","!=","===","!==","<","<=",">",">=","!","~","&","|","^","<<",">>","=>","return","throw","yield","await","break","continue"]),i=new Set(["identifier","property_identifier","field_identifier","type_identifier","number","integer","float","string","string_literal","template_string","character_literal","true","false","null","undefined","nil"]);class r{registry=e.createLanguageRegistry();registerLanguage(t){this.registry.set(t.name,t);for(const e of t.aliases??[])this.registry.set(e,t)}getSupportedLanguages(){return[...new Set([...this.registry.values()].map(t=>t.name))]}measure(e,n){const r=this.registry.get(n.language);if(!r)throw new Error(`Unsupported language: ${n.language}`);const s=new t;s.setLanguage(r.parserLanguage);const d=s.parse(e).rootNode,y=c(d,new Set(r.functionNodeTypes)).map(t=>function(t,e){const n=a(t,e,0);return{name:u(t),startLine:t.startPosition.row+1,endLine:t.endPosition.row+1,cyclomaticComplexity:n.cyclomaticComplexity,cognitiveComplexity:n.cognitiveComplexity}}(t,r)),h=a(d,r,0),x=function(t,e){const n=0===t.length?[]:t.split(/\r\n|\n|\r/),o=function(t){const e=[];function n(t){if("comment"===t.type||"line_comment"===t.type||"block_comment"===t.type)for(let n=t.startPosition.row;n<=t.endPosition.row;n+=1)e.push({line:n,startColumn:n===t.startPosition.row?t.startPosition.column:0,endColumn:n===t.endPosition.row?t.endPosition.column:Number.POSITIVE_INFINITY});for(const e of t.namedChildren)n(e)}return n(t),e}(e);let i=0,r=0;for(const[t,e]of n.entries())""!==e.trim()?l(e,t,o)&&(r+=1):i+=1;return{total:n.length,code:n.length-i-r,comment:r,blank:i}}(e,d),C=function(t,e){const n=new Map,r=new Map;function s(t){if("comment"!==t.type){if(0===t.childCount){const s=e.slice(t.startIndex,t.endIndex);return void(o.has(s)||o.has(t.type)?f(n,s||t.type):i.has(t.type)&&f(r,s))}o.has(t.type)&&f(n,t.type);for(const e of t.children)s(e)}}s(t);const a=n.size,c=r.size,l=p(n.values()),u=p(r.values()),m=a+c,g=l+u,d=0===m?0:g*Math.log2(m),y=0===c?0:a/2*(u/c),h=y*d;return{distinctOperators:a,distinctOperands:c,totalOperators:l,totalOperands:u,vocabulary:m,length:g,volume:d,difficulty:y,effort:h,time:h/18,bugs:d/3e3}}(d,e);return{language:r.name,bytes:Buffer.byteLength(e),lines:x,functions:y,classCount:c(d,new Set(r.classNodeTypes)).length,functionCount:y.length,cyclomaticComplexity:h.cyclomaticComplexity,maxCyclomaticComplexity:g(y,"cyclomaticComplexity"),cognitiveComplexity:h.cognitiveComplexity,maxCognitiveComplexity:g(y,"cognitiveComplexity"),nestingDepth:h.nestingDepth,halstead:C,maintainabilityIndex:m(C.volume,h.cyclomaticComplexity,x.code),syntaxTree:n.includeSyntaxTree?d.toString():void 0}}}const s=new r;function a(t,e,o){let i=1,r=0,s=o;const a=new Set(e.decisionNodeTypes),c=new Set(e.nestingNodeTypes);function l(t,e){const o=a.has(t.type),u=c.has(t.type);o&&(i+=1,r+=1+e),function(t){if(t.isNamed)return!1;return n.has(t.text)}(t)&&(i+=1,r+=1);const m=u?e+1:e;s=Math.max(s,m);for(const e of t.children)l(e,m)}for(const e of t.children)l(e,o);return{cyclomaticComplexity:i,cognitiveComplexity:r,nestingDepth:s}}function c(t,e){const n=[];return function t(o){e.has(o.type)&&n.push(o);for(const e of o.namedChildren)t(e)}(t),n}function l(t,e,n){const o=n.filter(t=>t.line===e);if(0===o.length)return!1;const i=t.search(/\S/),r=t.trimEnd().length;return o.some(t=>t.startColumn<=i&&t.endColumn>=r)}function u(t){const e=t.childForFieldName("name");if(e)return e.text;const n=t.parent;if(!n)return;const o=n.childForFieldName("name");return o?.text}function m(t,e,n){if(0===n)return 100;const o=171-5.2*Math.log(Math.max(t,1))-.23*e-16.2*Math.log(n);return Math.max(0,Math.min(100,100*o/171))}function f(t,e){t.set(e,(t.get(e)??0)+1)}function g(t,e){return 0===t.length?0:Math.max(...t.map(t=>t[e]))}function p(t){let e=0;for(const n of t)e+=n;return e}exports.TreeMeasurer=r,exports.defaultMeasurer=s,exports.measureCode=function(t,e){return s.measure(t,e)};
+//# sourceMappingURL=metrics.cjs.map

package/dist/metrics.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics.cjs","sources":["../src/metrics.ts"],"sourcesContent":["import Parser from 'tree-sitter';\nimport { createLanguageRegistry } from './languages.js';\nimport type {\n  CodeMetrics,\n  FunctionMetrics,\n  HalsteadMetrics,\n  LanguageDefinition,\n  LanguageName,\n  MeasureOptions,\n} from './types.js';\n\nconst booleanOperators = new Set(['&&', '||', 'and', 'or']);\nconst operatorTexts = new Set([\n  '+',\n  '-',\n  '*',\n  '/',\n  '%',\n  '**',\n  '=',\n  '+=',\n  '-=',\n  '*=',\n  '/=',\n  '%=',\n  '==',\n  '!=',\n  '===',\n  '!==',\n  '<',\n  '<=',\n  '>',\n  '>=',\n  '!',\n  '~',\n  '&',\n  '|',\n  '^',\n  '<<',\n  '>>',\n  '=>',\n  'return',\n  'throw',\n  'yield',\n  'await',\n  'break',\n  'continue',\n]);\n\nconst operandNodeTypes = new Set([\n  'identifier',\n  'property_identifier',\n  'field_identifier',\n  'type_identifier',\n  'number',\n  'integer',\n  'float',\n  'string',\n  'string_literal',\n  'template_string',\n  'character_literal',\n  'true',\n  'false',\n  'null',\n  'undefined',\n  'nil',\n]);\n\ninterface ComplexityResult {\n  cyclomaticComplexity: number;\n  cognitiveComplexity: number;\n  nestingDepth: number;\n}\n\ninterface CommentSpan {\n  line: number;\n  startColumn: number;\n  endColumn: number;\n}\n\nexport class TreeMeasurer {\n  private readonly registry = createLanguageRegistry();\n\n  registerLanguage(language: LanguageDefinition): void {\n    this.registry.set(language.name, language);\n    for (const alias of language.aliases ?? []) {\n      this.registry.set(alias, language);\n    }\n  }\n\n  getSupportedLanguages(): LanguageName[] {\n    return [...new Set([...this.registry.values()].map((language) => language.name))];\n  }\n\n  measure(code: string, options: MeasureOptions): CodeMetrics {\n    const language = this.registry.get(options.language);\n    if (!language) {\n      throw new Error(`Unsupported language: ${options.language}`);\n    }\n\n    const parser = new Parser();\n    parser.setLanguage(language.parserLanguage);\n    const tree = parser.parse(code);\n    const root = tree.rootNode;\n    const functions = collectNodes(root, new Set(language.functionNodeTypes));\n    const functionMetrics = functions.map((node) => measureFunction(node, language));\n    const globalComplexity = measureComplexity(root, language, 0);\n    const lines = measureLines(code, root);\n    const halstead = measureHalstead(root, code);\n\n    return {\n      language: language.name,\n      bytes: Buffer.byteLength(code),\n      lines,\n      functions: functionMetrics,\n      classCount: collectNodes(root, new Set(language.classNodeTypes)).length,\n      functionCount: functionMetrics.length,\n      cyclomaticComplexity: globalComplexity.cyclomaticComplexity,\n      maxCyclomaticComplexity: maxMetric(functionMetrics, 'cyclomaticComplexity'),\n      cognitiveComplexity: globalComplexity.cognitiveComplexity,\n      maxCognitiveComplexity: maxMetric(functionMetrics, 'cognitiveComplexity'),\n      nestingDepth: globalComplexity.nestingDepth,\n      halstead,\n      maintainabilityIndex: calculateMaintainabilityIndex(\n        halstead.volume,\n        globalComplexity.cyclomaticComplexity,\n        lines.code\n      ),\n      syntaxTree: options.includeSyntaxTree ? root.toString() : undefined,\n    };\n  }\n}\n\nexport const defaultMeasurer = new TreeMeasurer();\n\nexport function measureCode(code: string, options: MeasureOptions): CodeMetrics {\n  return defaultMeasurer.measure(code, options);\n}\n\nfunction measureFunction(node: Parser.SyntaxNode, language: LanguageDefinition): FunctionMetrics {\n  const complexity = measureComplexity(node, language, 0);\n\n  return {\n    name: findFunctionName(node),\n    startLine: node.startPosition.row + 1,\n    endLine: node.endPosition.row + 1,\n    cyclomaticComplexity: complexity.cyclomaticComplexity,\n    cognitiveComplexity: complexity.cognitiveComplexity,\n  };\n}\n\nfunction measureComplexity(node: Parser.SyntaxNode, language: LanguageDefinition, nesting: number): ComplexityResult {\n  let cyclomaticComplexity = 1;\n  let cognitiveComplexity = 0;\n  let nestingDepth = nesting;\n  const decisionNodes = new Set(language.decisionNodeTypes);\n  const nestingNodes = new Set(language.nestingNodeTypes);\n\n  function visit(current: Parser.SyntaxNode, currentNesting: number): void {\n    const isDecision = decisionNodes.has(current.type);\n    const isNesting = nestingNodes.has(current.type);\n\n    if (isDecision) {\n      cyclomaticComplexity += 1;\n      cognitiveComplexity += 1 + currentNesting;\n    }\n\n    if (isBooleanOperator(current)) {\n      cyclomaticComplexity += 1;\n      cognitiveComplexity += 1;\n    }\n\n    const childNesting = isNesting ? currentNesting + 1 : currentNesting;\n    nestingDepth = Math.max(nestingDepth, childNesting);\n\n    for (const child of current.children) {\n      visit(child, childNesting);\n    }\n  }\n\n  for (const child of node.children) {\n    visit(child, nesting);\n  }\n\n  return { cyclomaticComplexity, cognitiveComplexity, nestingDepth };\n}\n\nfunction isBooleanOperator(node: Parser.SyntaxNode): boolean {\n  if (node.isNamed) {\n    return false;\n  }\n\n  return booleanOperators.has(node.text);\n}\n\nfunction collectNodes(root: Parser.SyntaxNode, nodeTypes: Set<string>): Parser.SyntaxNode[] {\n  const nodes: Parser.SyntaxNode[] = [];\n\n  function visit(node: Parser.SyntaxNode): void {\n    if (nodeTypes.has(node.type)) {\n      nodes.push(node);\n    }\n\n    for (const child of node.namedChildren) {\n      visit(child);\n    }\n  }\n\n  visit(root);\n  return nodes;\n}\n\nfunction measureLines(code: string, root: Parser.SyntaxNode): CodeMetrics['lines'] {\n  const sourceLines = code.length === 0 ? [] : code.split(/\\r\\n|\\n|\\r/);\n  const commentSpans = collectCommentSpans(root);\n  let blank = 0;\n  let comment = 0;\n\n  for (const [index, line] of sourceLines.entries()) {\n    if (line.trim() === '') {\n      blank += 1;\n      continue;\n    }\n\n    if (isCommentOnlyLine(line, index, commentSpans)) {\n      comment += 1;\n    }\n  }\n\n  return {\n    total: sourceLines.length,\n    code: sourceLines.length - blank - comment,\n    comment,\n    blank,\n  };\n}\n\nfunction collectCommentSpans(root: Parser.SyntaxNode): CommentSpan[] {\n  const spans: CommentSpan[] = [];\n\n  function visit(node: Parser.SyntaxNode): void {\n    if (node.type === 'comment' || node.type === 'line_comment' || node.type === 'block_comment') {\n      for (let row = node.startPosition.row; row <= node.endPosition.row; row += 1) {\n        spans.push({\n          line: row,\n          startColumn: row === node.startPosition.row ? node.startPosition.column : 0,\n          endColumn: row === node.endPosition.row ? node.endPosition.column : Number.POSITIVE_INFINITY,\n        });\n      }\n    }\n\n    for (const child of node.namedChildren) {\n      visit(child);\n    }\n  }\n\n  visit(root);\n  return spans;\n}\n\nfunction isCommentOnlyLine(line: string, lineIndex: number, spans: CommentSpan[]): boolean {\n  const relevantSpans = spans.filter((span) => span.line === lineIndex);\n  if (relevantSpans.length === 0) {\n    return false;\n  }\n\n  const firstContentColumn = line.search(/\\S/);\n  const lastContentColumn = line.trimEnd().length;\n\n  return relevantSpans.some((span) => span.startColumn <= firstContentColumn && span.endColumn >= lastContentColumn);\n}\n\nfunction measureHalstead(root: Parser.SyntaxNode, code: string): HalsteadMetrics {\n  const operators = new Map<string, number>();\n  const operands = new Map<string, number>();\n\n  function visit(node: Parser.SyntaxNode): void {\n    if (node.type === 'comment') {\n      return;\n    }\n\n    if (node.childCount === 0) {\n      const text = code.slice(node.startIndex, node.endIndex);\n      if (operatorTexts.has(text) || operatorTexts.has(node.type)) {\n        incrementCount(operators, text || node.type);\n      } else if (operandNodeTypes.has(node.type)) {\n        incrementCount(operands, text);\n      }\n      return;\n    }\n\n    if (operatorTexts.has(node.type)) {\n      incrementCount(operators, node.type);\n    }\n\n    for (const child of node.children) {\n      visit(child);\n    }\n  }\n\n  visit(root);\n\n  const distinctOperators = operators.size;\n  const distinctOperands = operands.size;\n  const totalOperators = sum(operators.values());\n  const totalOperands = sum(operands.values());\n  const vocabulary = distinctOperators + distinctOperands;\n  const length = totalOperators + totalOperands;\n  const volume = vocabulary === 0 ? 0 : length * Math.log2(vocabulary);\n  const difficulty = distinctOperands === 0 ? 0 : (distinctOperators / 2) * (totalOperands / distinctOperands);\n  const effort = difficulty * volume;\n\n  return {\n    distinctOperators,\n    distinctOperands,\n    totalOperators,\n    totalOperands,\n    vocabulary,\n    length,\n    volume,\n    difficulty,\n    effort,\n    time: effort / 18,\n    bugs: volume / 3000,\n  };\n}\n\nfunction findFunctionName(node: Parser.SyntaxNode): string | undefined {\n  const nameNode = node.childForFieldName('name');\n  if (nameNode) {\n    return nameNode.text;\n  }\n\n  const parent = node.parent;\n  if (!parent) {\n    return undefined;\n  }\n\n  const parentName = parent.childForFieldName('name');\n  return parentName?.text;\n}\n\nfunction calculateMaintainabilityIndex(volume: number, complexity: number, loc: number): number {\n  if (loc === 0) {\n    return 100;\n  }\n\n  const raw = 171 - 5.2 * Math.log(Math.max(volume, 1)) - 0.23 * complexity - 16.2 * Math.log(loc);\n  return Math.max(0, Math.min(100, (raw * 100) / 171));\n}\n\nfunction incrementCount(map: Map<string, number>, value: string): void {\n  map.set(value, (map.get(value) ?? 0) + 1);\n}\n\nfunction maxMetric(functions: FunctionMetrics[], key: 'cyclomaticComplexity' | 'cognitiveComplexity'): number {\n  return functions.length === 0 ? 0 : Math.max(...functions.map((fn) => fn[key]));\n}\n\nfunction sum(values: Iterable<number>): number {\n  let total = 0;\n  for (const value of values) {\n    total += value;\n  }\n  return total;\n}\n"],"names":["booleanOperators","Set","operatorTexts","operandNodeTypes","TreeMeasurer","registry","createLanguageRegistry","registerLanguage","language","this","set","name","alias","aliases","getSupportedLanguages","values","map","measure","code","options","get","Error","parser","Parser","setLanguage","parserLanguage","root","parse","rootNode","functionMetrics","collectNodes","functionNodeTypes","node","complexity","measureComplexity","findFunctionName","startLine","startPosition","row","endLine","endPosition","cyclomaticComplexity","cognitiveComplexity","measureFunction","globalComplexity","lines","sourceLines","length","split","commentSpans","spans","visit","type","push","line","startColumn","column","endColumn","Number","POSITIVE_INFINITY","child","namedChildren","collectCommentSpans","blank","comment","index","entries","trim","isCommentOnlyLine","total","measureLines","halstead","operators","Map","operands","childCount","text","slice","startIndex","endIndex","has","incrementCount","children","distinctOperators","size","distinctOperands","totalOperators","sum","totalOperands","vocabulary","volume","Math","log2","difficulty","effort","time","bugs","measureHalstead","bytes","Buffer","byteLength","functions","classCount","classNodeTypes","functionCount","maxCyclomaticComplexity","maxMetric","maxCognitiveComplexity","nestingDepth","maintainabilityIndex","calculateMaintainabilityIndex","syntaxTree","includeSyntaxTree","toString","undefined","defaultMeasurer","nesting","decisionNodes","decisionNodeTypes","nestingNodes","nestingNodeTypes","current","currentNesting","isDecision","isNesting","isNamed","isBooleanOperator","childNesting","max","nodeTypes","nodes","lineIndex","relevantSpans","filter","span","firstContentColumn","search","lastContentColumn","trimEnd","some","nameNode","childForFieldName","parent","parentName","loc","raw","log","min","value","key","fn"],"mappings":"uEAWA,MAAMA,EAAmB,IAAIC,IAAI,CAAC,KAAM,KAAM,MAAO,OAC/CC,EAAgB,IAAID,IAAI,CAC5B,IACA,IACA,IACA,IACA,IACA,KACA,IACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,MACA,MACA,IACA,KACA,IACA,KACA,IACA,IACA,IACA,IACA,IACA,KACA,KACA,KACA,SACA,QACA,QACA,QACA,QACA,aAGIE,EAAmB,IAAIF,IAAI,CAC/B,aACA,sBACA,mBACA,kBACA,SACA,UACA,QACA,SACA,iBACA,kBACA,oBACA,OACA,QACA,OACA,YACA,QAeK,MAAMG,EACMC,SAAWC,EAAAA,yBAE5BC,gBAAAA,CAAiBC,GACfC,KAAKJ,SAASK,IAAIF,EAASG,KAAMH,GACjC,IAAK,MAAMI,KAASJ,EAASK,SAAW,GACtCJ,KAAKJ,SAASK,IAAIE,EAAOJ,EAE7B,CAEAM,qBAAAA,GACE,MAAO,IAAI,IAAIb,IAAI,IAAIQ,KAAKJ,SAASU,UAAUC,IAAKR,GAAaA,EAASG,OAC5E,CAEAM,OAAAA,CAAQC,EAAcC,GACpB,MAAMX,EAAWC,KAAKJ,SAASe,IAAID,EAAQX,UAC3C,IAAKA,EACH,MAAM,IAAIa,MAAM,yBAAyBF,EAAQX,YAGnD,MAAMc,EAAS,IAAIC,EACnBD,EAAOE,YAAYhB,EAASiB,gBAC5B,MACMC,EADOJ,EAAOK,MAAMT,GACRU,SAEZC,EADYC,EAAaJ,EAAM,IAAIzB,IAAIO,EAASuB,oBACpBf,IAAKgB,GAkC3C,SAAyBA,EAAyBxB,GAChD,MAAMyB,EAAaC,EAAkBF,EAAMxB,EAAU,GAErD,MAAO,CACLG,KAAMwB,EAAiBH,GACvBI,UAAWJ,EAAKK,cAAcC,IAAM,EACpCC,QAASP,EAAKQ,YAAYF,IAAM,EAChCG,qBAAsBR,EAAWQ,qBACjCC,oBAAqBT,EAAWS,oBAEpC,CA5CoDC,CAAgBX,EAAMxB,IAChEoC,EAAmBV,EAAkBR,EAAMlB,EAAU,GACrDqC,EAyGV,SAAsB3B,EAAcQ,GAClC,MAAMoB,EAA8B,IAAhB5B,EAAK6B,OAAe,GAAK7B,EAAK8B,MAAM,cAClDC,EAuBR,SAA6BvB,GAC3B,MAAMwB,EAAuB,GAE7B,SAASC,EAAMnB,GACb,GAAkB,YAAdA,EAAKoB,MAAoC,iBAAdpB,EAAKoB,MAAyC,kBAAdpB,EAAKoB,KAClE,IAAK,IAAId,EAAMN,EAAKK,cAAcC,IAAKA,GAAON,EAAKQ,YAAYF,IAAKA,GAAO,EACzEY,EAAMG,KAAK,CACTC,KAAMhB,EACNiB,YAAajB,IAAQN,EAAKK,cAAcC,IAAMN,EAAKK,cAAcmB,OAAS,EAC1EC,UAAWnB,IAAQN,EAAKQ,YAAYF,IAAMN,EAAKQ,YAAYgB,OAASE,OAAOC,oBAKjF,IAAK,MAAMC,KAAS5B,EAAK6B,cACvBV,EAAMS,EAEV,CAGA,OADAT,EAAMzB,GACCwB,CACT,CA5CuBY,CAAoBpC,GACzC,IAAIqC,EAAQ,EACRC,EAAU,EAEd,IAAK,MAAOC,EAAOX,KAASR,EAAYoB,UAClB,KAAhBZ,EAAKa,OAKLC,EAAkBd,EAAMW,EAAOhB,KACjCe,GAAW,GALXD,GAAS,EASb,MAAO,CACLM,MAAOvB,EAAYC,OACnB7B,KAAM4B,EAAYC,OAASgB,EAAQC,EACnCA,UACAD,QAEJ,CAhIkBO,CAAapD,EAAMQ,GAC3B6C,EAoKV,SAAyB7C,EAAyBR,GAChD,MAAMsD,EAAY,IAAIC,IAChBC,EAAW,IAAID,IAErB,SAAStB,EAAMnB,GACb,GAAkB,YAAdA,EAAKoB,KAAT,CAIA,GAAwB,IAApBpB,EAAK2C,WAAkB,CACzB,MAAMC,EAAO1D,EAAK2D,MAAM7C,EAAK8C,WAAY9C,EAAK+C,UAM9C,YALI7E,EAAc8E,IAAIJ,IAAS1E,EAAc8E,IAAIhD,EAAKoB,MACpD6B,EAAeT,EAAWI,GAAQ5C,EAAKoB,MAC9BjD,EAAiB6E,IAAIhD,EAAKoB,OACnC6B,EAAeP,EAAUE,GAG7B,CAEI1E,EAAc8E,IAAIhD,EAAKoB,OACzB6B,EAAeT,EAAWxC,EAAKoB,MAGjC,IAAK,MAAMQ,KAAS5B,EAAKkD,SACvB/B,EAAMS,EAjBR,CAmBF,CAEAT,EAAMzB,GAEN,MAAMyD,EAAoBX,EAAUY,KAC9BC,EAAmBX,EAASU,KAC5BE,EAAiBC,EAAIf,EAAUzD,UAC/ByE,EAAgBD,EAAIb,EAAS3D,UAC7B0E,EAAaN,EAAoBE,EACjCtC,EAASuC,EAAiBE,EAC1BE,EAAwB,IAAfD,EAAmB,EAAI1C,EAAS4C,KAAKC,KAAKH,GACnDI,EAAkC,IAArBR,EAAyB,EAAKF,EAAoB,GAAMK,EAAgBH,GACrFS,EAASD,EAAaH,EAE5B,MAAO,CACLP,oBACAE,mBACAC,iBACAE,gBACAC,aACA1C,SACA2C,SACAG,aACAC,SACAC,KAAMD,EAAS,GACfE,KAAMN,EAAS,IAEnB,CAzNqBO,CAAgBvE,EAAMR,GAEvC,MAAO,CACLV,SAAUA,EAASG,KACnBuF,MAAOC,OAAOC,WAAWlF,GACzB2B,QACAwD,UAAWxE,EACXyE,WAAYxE,EAAaJ,EAAM,IAAIzB,IAAIO,EAAS+F,iBAAiBxD,OACjEyD,cAAe3E,EAAgBkB,OAC/BN,qBAAsBG,EAAiBH,qBACvCgE,wBAAyBC,EAAU7E,EAAiB,wBACpDa,oBAAqBE,EAAiBF,oBACtCiE,uBAAwBD,EAAU7E,EAAiB,uBACnD+E,aAAchE,EAAiBgE,aAC/BrC,WACAsC,qBAAsBC,EACpBvC,EAASmB,OACT9C,EAAiBH,qBACjBI,EAAM3B,MAER6F,WAAY5F,EAAQ6F,kBAAoBtF,EAAKuF,gBAAaC,EAE9D,QAGWC,EAAkB,IAAI/G,EAkBnC,SAAS8B,EAAkBF,EAAyBxB,EAA8B4G,GAChF,IAAI3E,EAAuB,EACvBC,EAAsB,EACtBkE,EAAeQ,EACnB,MAAMC,EAAgB,IAAIpH,IAAIO,EAAS8G,mBACjCC,EAAe,IAAItH,IAAIO,EAASgH,kBAEtC,SAASrE,EAAMsE,EAA4BC,GACzC,MAAMC,EAAaN,EAAcrC,IAAIyC,EAAQrE,MACvCwE,EAAYL,EAAavC,IAAIyC,EAAQrE,MAEvCuE,IACFlF,GAAwB,EACxBC,GAAuB,EAAIgF,GAuBjC,SAA2B1F,GACzB,GAAIA,EAAK6F,QACP,OAAO,EAGT,OAAO7H,EAAiBgF,IAAIhD,EAAK4C,KACnC,CA1BQkD,CAAkBL,KACpBhF,GAAwB,EACxBC,GAAuB,GAGzB,MAAMqF,EAAeH,EAAYF,EAAiB,EAAIA,EACtDd,EAAejB,KAAKqC,IAAIpB,EAAcmB,GAEtC,IAAK,MAAMnE,KAAS6D,EAAQvC,SAC1B/B,EAAMS,EAAOmE,EAEjB,CAEA,IAAK,MAAMnE,KAAS5B,EAAKkD,SACvB/B,EAAMS,EAAOwD,GAGf,MAAO,CAAE3E,uBAAsBC,sBAAqBkE,eACtD,CAUA,SAAS9E,EAAaJ,EAAyBuG,GAC7C,MAAMC,EAA6B,GAanC,OAXA,SAAS/E,EAAMnB,GACTiG,EAAUjD,IAAIhD,EAAKoB,OACrB8E,EAAM7E,KAAKrB,GAGb,IAAK,MAAM4B,KAAS5B,EAAK6B,cACvBV,EAAMS,EAEV,CAEAT,CAAMzB,GACCwG,CACT,CAkDA,SAAS9D,EAAkBd,EAAc6E,EAAmBjF,GAC1D,MAAMkF,EAAgBlF,EAAMmF,OAAQC,GAASA,EAAKhF,OAAS6E,GAC3D,GAA6B,IAAzBC,EAAcrF,OAChB,OAAO,EAGT,MAAMwF,EAAqBjF,EAAKkF,OAAO,MACjCC,EAAoBnF,EAAKoF,UAAU3F,OAEzC,OAAOqF,EAAcO,KAAML,GAASA,EAAK/E,aAAegF,GAAsBD,EAAK7E,WAAagF,EAClG,CAyDA,SAAStG,EAAiBH,GACxB,MAAM4G,EAAW5G,EAAK6G,kBAAkB,QACxC,GAAID,EACF,OAAOA,EAAShE,KAGlB,MAAMkE,EAAS9G,EAAK8G,OACpB,IAAKA,EACH,OAGF,MAAMC,EAAaD,EAAOD,kBAAkB,QAC5C,OAAOE,GAAYnE,IACrB,CAEA,SAASkC,EAA8BpB,EAAgBzD,EAAoB+G,GACzE,GAAY,IAARA,EACF,OAAO,IAGT,MAAMC,EAAM,IAAM,IAAMtD,KAAKuD,IAAIvD,KAAKqC,IAAItC,EAAQ,IAAM,IAAOzD,EAAa,KAAO0D,KAAKuD,IAAIF,GAC5F,OAAOrD,KAAKqC,IAAI,EAAGrC,KAAKwD,IAAI,IAAY,IAANF,EAAa,KACjD,CAEA,SAAShE,EAAejE,EAA0BoI,GAChDpI,EAAIN,IAAI0I,GAAQpI,EAAII,IAAIgI,IAAU,GAAK,EACzC,CAEA,SAAS1C,EAAUL,EAA8BgD,GAC/C,OAA4B,IAArBhD,EAAUtD,OAAe,EAAI4C,KAAKqC,OAAO3B,EAAUrF,IAAKsI,GAAOA,EAAGD,IAC3E,CAEA,SAAS9D,EAAIxE,GACX,IAAIsD,EAAQ,EACZ,IAAK,MAAM+E,KAASrI,EAClBsD,GAAS+E,EAEX,OAAO/E,CACT,sEAtOO,SAAqBnD,EAAcC,GACxC,OAAOgG,EAAgBlG,QAAQC,EAAMC,EACvC"}

package/dist/metrics.d.ts

@@ -0,0 +1,9 @@
+import type { CodeMetrics, LanguageDefinition, LanguageName, MeasureOptions } from './types.js';
+export declare class TreeMeasurer {
+    private readonly registry;
+    registerLanguage(language: LanguageDefinition): void;
+    getSupportedLanguages(): LanguageName[];
+    measure(code: string, options: MeasureOptions): CodeMetrics;
+}
+export declare const defaultMeasurer: TreeMeasurer;
+export declare function measureCode(code: string, options: MeasureOptions): CodeMetrics;

package/dist/metrics.js

@@ -0,0 +1,2 @@
+import t from"tree-sitter";import{createLanguageRegistry as e}from"./languages.js";const n=new Set(["&&","||","and","or"]),o=new Set(["+","-","*","/","%","**","=","+=","-=","*=","/=","%=","==","!=","===","!==","<","<=",">",">=","!","~","&","|","^","<<",">>","=>","return","throw","yield","await","break","continue"]),i=new Set(["identifier","property_identifier","field_identifier","type_identifier","number","integer","float","string","string_literal","template_string","character_literal","true","false","null","undefined","nil"]);class r{registry=e();registerLanguage(t){this.registry.set(t.name,t);for(const e of t.aliases??[])this.registry.set(e,t)}getSupportedLanguages(){return[...new Set([...this.registry.values()].map(t=>t.name))]}measure(e,n){const r=this.registry.get(n.language);if(!r)throw new Error(`Unsupported language: ${n.language}`);const s=new t;s.setLanguage(r.parserLanguage);const a=s.parse(e).rootNode,d=l(a,new Set(r.functionNodeTypes)).map(t=>function(t,e){const n=c(t,e,0);return{name:m(t),startLine:t.startPosition.row+1,endLine:t.endPosition.row+1,cyclomaticComplexity:n.cyclomaticComplexity,cognitiveComplexity:n.cognitiveComplexity}}(t,r)),h=c(a,r,0),x=function(t,e){const n=0===t.length?[]:t.split(/\r\n|\n|\r/),o=function(t){const e=[];function n(t){if("comment"===t.type||"line_comment"===t.type||"block_comment"===t.type)for(let n=t.startPosition.row;n<=t.endPosition.row;n+=1)e.push({line:n,startColumn:n===t.startPosition.row?t.startPosition.column:0,endColumn:n===t.endPosition.row?t.endPosition.column:Number.POSITIVE_INFINITY});for(const e of t.namedChildren)n(e)}return n(t),e}(e);let i=0,r=0;for(const[t,e]of n.entries())""!==e.trim()?u(e,t,o)&&(r+=1):i+=1;return{total:n.length,code:n.length-i-r,comment:r,blank:i}}(e,a),C=function(t,e){const n=new Map,r=new Map;function s(t){if("comment"!==t.type){if(0===t.childCount){const s=e.slice(t.startIndex,t.endIndex);return void(o.has(s)||o.has(t.type)?p(n,s||t.type):i.has(t.type)&&p(r,s))}o.has(t.type)&&p(n,t.type);for(const e of t.children)s(e)}}s(t);const a=n.size,c=r.size,l=y(n.values()),u=y(r.values()),m=a+c,f=l+u,g=0===m?0:f*Math.log2(m),d=0===c?0:a/2*(u/c),h=d*g;return{distinctOperators:a,distinctOperands:c,totalOperators:l,totalOperands:u,vocabulary:m,length:f,volume:g,difficulty:d,effort:h,time:h/18,bugs:g/3e3}}(a,e);return{language:r.name,bytes:Buffer.byteLength(e),lines:x,functions:d,classCount:l(a,new Set(r.classNodeTypes)).length,functionCount:d.length,cyclomaticComplexity:h.cyclomaticComplexity,maxCyclomaticComplexity:g(d,"cyclomaticComplexity"),cognitiveComplexity:h.cognitiveComplexity,maxCognitiveComplexity:g(d,"cognitiveComplexity"),nestingDepth:h.nestingDepth,halstead:C,maintainabilityIndex:f(C.volume,h.cyclomaticComplexity,x.code),syntaxTree:n.includeSyntaxTree?a.toString():void 0}}}const s=new r;function a(t,e){return s.measure(t,e)}function c(t,e,o){let i=1,r=0,s=o;const a=new Set(e.decisionNodeTypes),c=new Set(e.nestingNodeTypes);function l(t,e){const o=a.has(t.type),u=c.has(t.type);o&&(i+=1,r+=1+e),function(t){if(t.isNamed)return!1;return n.has(t.text)}(t)&&(i+=1,r+=1);const m=u?e+1:e;s=Math.max(s,m);for(const e of t.children)l(e,m)}for(const e of t.children)l(e,o);return{cyclomaticComplexity:i,cognitiveComplexity:r,nestingDepth:s}}function l(t,e){const n=[];return function t(o){e.has(o.type)&&n.push(o);for(const e of o.namedChildren)t(e)}(t),n}function u(t,e,n){const o=n.filter(t=>t.line===e);if(0===o.length)return!1;const i=t.search(/\S/),r=t.trimEnd().length;return o.some(t=>t.startColumn<=i&&t.endColumn>=r)}function m(t){const e=t.childForFieldName("name");if(e)return e.text;const n=t.parent;if(!n)return;const o=n.childForFieldName("name");return o?.text}function f(t,e,n){if(0===n)return 100;const o=171-5.2*Math.log(Math.max(t,1))-.23*e-16.2*Math.log(n);return Math.max(0,Math.min(100,100*o/171))}function p(t,e){t.set(e,(t.get(e)??0)+1)}function g(t,e){return 0===t.length?0:Math.max(...t.map(t=>t[e]))}function y(t){let e=0;for(const n of t)e+=n;return e}export{r as TreeMeasurer,s as defaultMeasurer,a as measureCode};
+//# sourceMappingURL=metrics.js.map

package/dist/metrics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics.js","sources":["../src/metrics.ts"],"sourcesContent":["import Parser from 'tree-sitter';\nimport { createLanguageRegistry } from './languages.js';\nimport type {\n  CodeMetrics,\n  FunctionMetrics,\n  HalsteadMetrics,\n  LanguageDefinition,\n  LanguageName,\n  MeasureOptions,\n} from './types.js';\n\nconst booleanOperators = new Set(['&&', '||', 'and', 'or']);\nconst operatorTexts = new Set([\n  '+',\n  '-',\n  '*',\n  '/',\n  '%',\n  '**',\n  '=',\n  '+=',\n  '-=',\n  '*=',\n  '/=',\n  '%=',\n  '==',\n  '!=',\n  '===',\n  '!==',\n  '<',\n  '<=',\n  '>',\n  '>=',\n  '!',\n  '~',\n  '&',\n  '|',\n  '^',\n  '<<',\n  '>>',\n  '=>',\n  'return',\n  'throw',\n  'yield',\n  'await',\n  'break',\n  'continue',\n]);\n\nconst operandNodeTypes = new Set([\n  'identifier',\n  'property_identifier',\n  'field_identifier',\n  'type_identifier',\n  'number',\n  'integer',\n  'float',\n  'string',\n  'string_literal',\n  'template_string',\n  'character_literal',\n  'true',\n  'false',\n  'null',\n  'undefined',\n  'nil',\n]);\n\ninterface ComplexityResult {\n  cyclomaticComplexity: number;\n  cognitiveComplexity: number;\n  nestingDepth: number;\n}\n\ninterface CommentSpan {\n  line: number;\n  startColumn: number;\n  endColumn: number;\n}\n\nexport class TreeMeasurer {\n  private readonly registry = createLanguageRegistry();\n\n  registerLanguage(language: LanguageDefinition): void {\n    this.registry.set(language.name, language);\n    for (const alias of language.aliases ?? []) {\n      this.registry.set(alias, language);\n    }\n  }\n\n  getSupportedLanguages(): LanguageName[] {\n    return [...new Set([...this.registry.values()].map((language) => language.name))];\n  }\n\n  measure(code: string, options: MeasureOptions): CodeMetrics {\n    const language = this.registry.get(options.language);\n    if (!language) {\n      throw new Error(`Unsupported language: ${options.language}`);\n    }\n\n    const parser = new Parser();\n    parser.setLanguage(language.parserLanguage);\n    const tree = parser.parse(code);\n    const root = tree.rootNode;\n    const functions = collectNodes(root, new Set(language.functionNodeTypes));\n    const functionMetrics = functions.map((node) => measureFunction(node, language));\n    const globalComplexity = measureComplexity(root, language, 0);\n    const lines = measureLines(code, root);\n    const halstead = measureHalstead(root, code);\n\n    return {\n      language: language.name,\n      bytes: Buffer.byteLength(code),\n      lines,\n      functions: functionMetrics,\n      classCount: collectNodes(root, new Set(language.classNodeTypes)).length,\n      functionCount: functionMetrics.length,\n      cyclomaticComplexity: globalComplexity.cyclomaticComplexity,\n      maxCyclomaticComplexity: maxMetric(functionMetrics, 'cyclomaticComplexity'),\n      cognitiveComplexity: globalComplexity.cognitiveComplexity,\n      maxCognitiveComplexity: maxMetric(functionMetrics, 'cognitiveComplexity'),\n      nestingDepth: globalComplexity.nestingDepth,\n      halstead,\n      maintainabilityIndex: calculateMaintainabilityIndex(\n        halstead.volume,\n        globalComplexity.cyclomaticComplexity,\n        lines.code\n      ),\n      syntaxTree: options.includeSyntaxTree ? root.toString() : undefined,\n    };\n  }\n}\n\nexport const defaultMeasurer = new TreeMeasurer();\n\nexport function measureCode(code: string, options: MeasureOptions): CodeMetrics {\n  return defaultMeasurer.measure(code, options);\n}\n\nfunction measureFunction(node: Parser.SyntaxNode, language: LanguageDefinition): FunctionMetrics {\n  const complexity = measureComplexity(node, language, 0);\n\n  return {\n    name: findFunctionName(node),\n    startLine: node.startPosition.row + 1,\n    endLine: node.endPosition.row + 1,\n    cyclomaticComplexity: complexity.cyclomaticComplexity,\n    cognitiveComplexity: complexity.cognitiveComplexity,\n  };\n}\n\nfunction measureComplexity(node: Parser.SyntaxNode, language: LanguageDefinition, nesting: number): ComplexityResult {\n  let cyclomaticComplexity = 1;\n  let cognitiveComplexity = 0;\n  let nestingDepth = nesting;\n  const decisionNodes = new Set(language.decisionNodeTypes);\n  const nestingNodes = new Set(language.nestingNodeTypes);\n\n  function visit(current: Parser.SyntaxNode, currentNesting: number): void {\n    const isDecision = decisionNodes.has(current.type);\n    const isNesting = nestingNodes.has(current.type);\n\n    if (isDecision) {\n      cyclomaticComplexity += 1;\n      cognitiveComplexity += 1 + currentNesting;\n    }\n\n    if (isBooleanOperator(current)) {\n      cyclomaticComplexity += 1;\n      cognitiveComplexity += 1;\n    }\n\n    const childNesting = isNesting ? currentNesting + 1 : currentNesting;\n    nestingDepth = Math.max(nestingDepth, childNesting);\n\n    for (const child of current.children) {\n      visit(child, childNesting);\n    }\n  }\n\n  for (const child of node.children) {\n    visit(child, nesting);\n  }\n\n  return { cyclomaticComplexity, cognitiveComplexity, nestingDepth };\n}\n\nfunction isBooleanOperator(node: Parser.SyntaxNode): boolean {\n  if (node.isNamed) {\n    return false;\n  }\n\n  return booleanOperators.has(node.text);\n}\n\nfunction collectNodes(root: Parser.SyntaxNode, nodeTypes: Set<string>): Parser.SyntaxNode[] {\n  const nodes: Parser.SyntaxNode[] = [];\n\n  function visit(node: Parser.SyntaxNode): void {\n    if (nodeTypes.has(node.type)) {\n      nodes.push(node);\n    }\n\n    for (const child of node.namedChildren) {\n      visit(child);\n    }\n  }\n\n  visit(root);\n  return nodes;\n}\n\nfunction measureLines(code: string, root: Parser.SyntaxNode): CodeMetrics['lines'] {\n  const sourceLines = code.length === 0 ? [] : code.split(/\\r\\n|\\n|\\r/);\n  const commentSpans = collectCommentSpans(root);\n  let blank = 0;\n  let comment = 0;\n\n  for (const [index, line] of sourceLines.entries()) {\n    if (line.trim() === '') {\n      blank += 1;\n      continue;\n    }\n\n    if (isCommentOnlyLine(line, index, commentSpans)) {\n      comment += 1;\n    }\n  }\n\n  return {\n    total: sourceLines.length,\n    code: sourceLines.length - blank - comment,\n    comment,\n    blank,\n  };\n}\n\nfunction collectCommentSpans(root: Parser.SyntaxNode): CommentSpan[] {\n  const spans: CommentSpan[] = [];\n\n  function visit(node: Parser.SyntaxNode): void {\n    if (node.type === 'comment' || node.type === 'line_comment' || node.type === 'block_comment') {\n      for (let row = node.startPosition.row; row <= node.endPosition.row; row += 1) {\n        spans.push({\n          line: row,\n          startColumn: row === node.startPosition.row ? node.startPosition.column : 0,\n          endColumn: row === node.endPosition.row ? node.endPosition.column : Number.POSITIVE_INFINITY,\n        });\n      }\n    }\n\n    for (const child of node.namedChildren) {\n      visit(child);\n    }\n  }\n\n  visit(root);\n  return spans;\n}\n\nfunction isCommentOnlyLine(line: string, lineIndex: number, spans: CommentSpan[]): boolean {\n  const relevantSpans = spans.filter((span) => span.line === lineIndex);\n  if (relevantSpans.length === 0) {\n    return false;\n  }\n\n  const firstContentColumn = line.search(/\\S/);\n  const lastContentColumn = line.trimEnd().length;\n\n  return relevantSpans.some((span) => span.startColumn <= firstContentColumn && span.endColumn >= lastContentColumn);\n}\n\nfunction measureHalstead(root: Parser.SyntaxNode, code: string): HalsteadMetrics {\n  const operators = new Map<string, number>();\n  const operands = new Map<string, number>();\n\n  function visit(node: Parser.SyntaxNode): void {\n    if (node.type === 'comment') {\n      return;\n    }\n\n    if (node.childCount === 0) {\n      const text = code.slice(node.startIndex, node.endIndex);\n      if (operatorTexts.has(text) || operatorTexts.has(node.type)) {\n        incrementCount(operators, text || node.type);\n      } else if (operandNodeTypes.has(node.type)) {\n        incrementCount(operands, text);\n      }\n      return;\n    }\n\n    if (operatorTexts.has(node.type)) {\n      incrementCount(operators, node.type);\n    }\n\n    for (const child of node.children) {\n      visit(child);\n    }\n  }\n\n  visit(root);\n\n  const distinctOperators = operators.size;\n  const distinctOperands = operands.size;\n  const totalOperators = sum(operators.values());\n  const totalOperands = sum(operands.values());\n  const vocabulary = distinctOperators + distinctOperands;\n  const length = totalOperators + totalOperands;\n  const volume = vocabulary === 0 ? 0 : length * Math.log2(vocabulary);\n  const difficulty = distinctOperands === 0 ? 0 : (distinctOperators / 2) * (totalOperands / distinctOperands);\n  const effort = difficulty * volume;\n\n  return {\n    distinctOperators,\n    distinctOperands,\n    totalOperators,\n    totalOperands,\n    vocabulary,\n    length,\n    volume,\n    difficulty,\n    effort,\n    time: effort / 18,\n    bugs: volume / 3000,\n  };\n}\n\nfunction findFunctionName(node: Parser.SyntaxNode): string | undefined {\n  const nameNode = node.childForFieldName('name');\n  if (nameNode) {\n    return nameNode.text;\n  }\n\n  const parent = node.parent;\n  if (!parent) {\n    return undefined;\n  }\n\n  const parentName = parent.childForFieldName('name');\n  return parentName?.text;\n}\n\nfunction calculateMaintainabilityIndex(volume: number, complexity: number, loc: number): number {\n  if (loc === 0) {\n    return 100;\n  }\n\n  const raw = 171 - 5.2 * Math.log(Math.max(volume, 1)) - 0.23 * complexity - 16.2 * Math.log(loc);\n  return Math.max(0, Math.min(100, (raw * 100) / 171));\n}\n\nfunction incrementCount(map: Map<string, number>, value: string): void {\n  map.set(value, (map.get(value) ?? 0) + 1);\n}\n\nfunction maxMetric(functions: FunctionMetrics[], key: 'cyclomaticComplexity' | 'cognitiveComplexity'): number {\n  return functions.length === 0 ? 0 : Math.max(...functions.map((fn) => fn[key]));\n}\n\nfunction sum(values: Iterable<number>): number {\n  let total = 0;\n  for (const value of values) {\n    total += value;\n  }\n  return total;\n}\n"],"names":["booleanOperators","Set","operatorTexts","operandNodeTypes","TreeMeasurer","registry","createLanguageRegistry","registerLanguage","language","this","set","name","alias","aliases","getSupportedLanguages","values","map","measure","code","options","get","Error","parser","Parser","setLanguage","parserLanguage","root","parse","rootNode","functionMetrics","collectNodes","functionNodeTypes","node","complexity","measureComplexity","findFunctionName","startLine","startPosition","row","endLine","endPosition","cyclomaticComplexity","cognitiveComplexity","measureFunction","globalComplexity","lines","sourceLines","length","split","commentSpans","spans","visit","type","push","line","startColumn","column","endColumn","Number","POSITIVE_INFINITY","child","namedChildren","collectCommentSpans","blank","comment","index","entries","trim","isCommentOnlyLine","total","measureLines","halstead","operators","Map","operands","childCount","text","slice","startIndex","endIndex","has","incrementCount","children","distinctOperators","size","distinctOperands","totalOperators","sum","totalOperands","vocabulary","volume","Math","log2","difficulty","effort","time","bugs","measureHalstead","bytes","Buffer","byteLength","functions","classCount","classNodeTypes","functionCount","maxCyclomaticComplexity","maxMetric","maxCognitiveComplexity","nestingDepth","maintainabilityIndex","calculateMaintainabilityIndex","syntaxTree","includeSyntaxTree","toString","undefined","defaultMeasurer","measureCode","nesting","decisionNodes","decisionNodeTypes","nestingNodes","nestingNodeTypes","current","currentNesting","isDecision","isNesting","isNamed","isBooleanOperator","childNesting","max","nodeTypes","nodes","lineIndex","relevantSpans","filter","span","firstContentColumn","search","lastContentColumn","trimEnd","some","nameNode","childForFieldName","parent","parentName","loc","raw","log","min","value","key","fn"],"mappings":"mFAWA,MAAMA,EAAmB,IAAIC,IAAI,CAAC,KAAM,KAAM,MAAO,OAC/CC,EAAgB,IAAID,IAAI,CAC5B,IACA,IACA,IACA,IACA,IACA,KACA,IACA,KACA,KACA,KACA,KACA,KACA,KACA,KACA,MACA,MACA,IACA,KACA,IACA,KACA,IACA,IACA,IACA,IACA,IACA,KACA,KACA,KACA,SACA,QACA,QACA,QACA,QACA,aAGIE,EAAmB,IAAIF,IAAI,CAC/B,aACA,sBACA,mBACA,kBACA,SACA,UACA,QACA,SACA,iBACA,kBACA,oBACA,OACA,QACA,OACA,YACA,QAeK,MAAMG,EACMC,SAAWC,IAE5BC,gBAAAA,CAAiBC,GACfC,KAAKJ,SAASK,IAAIF,EAASG,KAAMH,GACjC,IAAK,MAAMI,KAASJ,EAASK,SAAW,GACtCJ,KAAKJ,SAASK,IAAIE,EAAOJ,EAE7B,CAEAM,qBAAAA,GACE,MAAO,IAAI,IAAIb,IAAI,IAAIQ,KAAKJ,SAASU,UAAUC,IAAKR,GAAaA,EAASG,OAC5E,CAEAM,OAAAA,CAAQC,EAAcC,GACpB,MAAMX,EAAWC,KAAKJ,SAASe,IAAID,EAAQX,UAC3C,IAAKA,EACH,MAAM,IAAIa,MAAM,yBAAyBF,EAAQX,YAGnD,MAAMc,EAAS,IAAIC,EACnBD,EAAOE,YAAYhB,EAASiB,gBAC5B,MACMC,EADOJ,EAAOK,MAAMT,GACRU,SAEZC,EADYC,EAAaJ,EAAM,IAAIzB,IAAIO,EAASuB,oBACpBf,IAAKgB,GAkC3C,SAAyBA,EAAyBxB,GAChD,MAAMyB,EAAaC,EAAkBF,EAAMxB,EAAU,GAErD,MAAO,CACLG,KAAMwB,EAAiBH,GACvBI,UAAWJ,EAAKK,cAAcC,IAAM,EACpCC,QAASP,EAAKQ,YAAYF,IAAM,EAChCG,qBAAsBR,EAAWQ,qBACjCC,oBAAqBT,EAAWS,oBAEpC,CA5CoDC,CAAgBX,EAAMxB,IAChEoC,EAAmBV,EAAkBR,EAAMlB,EAAU,GACrDqC,EAyGV,SAAsB3B,EAAcQ,GAClC,MAAMoB,EAA8B,IAAhB5B,EAAK6B,OAAe,GAAK7B,EAAK8B,MAAM,cAClDC,EAuBR,SAA6BvB,GAC3B,MAAMwB,EAAuB,GAE7B,SAASC,EAAMnB,GACb,GAAkB,YAAdA,EAAKoB,MAAoC,iBAAdpB,EAAKoB,MAAyC,kBAAdpB,EAAKoB,KAClE,IAAK,IAAId,EAAMN,EAAKK,cAAcC,IAAKA,GAAON,EAAKQ,YAAYF,IAAKA,GAAO,EACzEY,EAAMG,KAAK,CACTC,KAAMhB,EACNiB,YAAajB,IAAQN,EAAKK,cAAcC,IAAMN,EAAKK,cAAcmB,OAAS,EAC1EC,UAAWnB,IAAQN,EAAKQ,YAAYF,IAAMN,EAAKQ,YAAYgB,OAASE,OAAOC,oBAKjF,IAAK,MAAMC,KAAS5B,EAAK6B,cACvBV,EAAMS,EAEV,CAGA,OADAT,EAAMzB,GACCwB,CACT,CA5CuBY,CAAoBpC,GACzC,IAAIqC,EAAQ,EACRC,EAAU,EAEd,IAAK,MAAOC,EAAOX,KAASR,EAAYoB,UAClB,KAAhBZ,EAAKa,OAKLC,EAAkBd,EAAMW,EAAOhB,KACjCe,GAAW,GALXD,GAAS,EASb,MAAO,CACLM,MAAOvB,EAAYC,OACnB7B,KAAM4B,EAAYC,OAASgB,EAAQC,EACnCA,UACAD,QAEJ,CAhIkBO,CAAapD,EAAMQ,GAC3B6C,EAoKV,SAAyB7C,EAAyBR,GAChD,MAAMsD,EAAY,IAAIC,IAChBC,EAAW,IAAID,IAErB,SAAStB,EAAMnB,GACb,GAAkB,YAAdA,EAAKoB,KAAT,CAIA,GAAwB,IAApBpB,EAAK2C,WAAkB,CACzB,MAAMC,EAAO1D,EAAK2D,MAAM7C,EAAK8C,WAAY9C,EAAK+C,UAM9C,YALI7E,EAAc8E,IAAIJ,IAAS1E,EAAc8E,IAAIhD,EAAKoB,MACpD6B,EAAeT,EAAWI,GAAQ5C,EAAKoB,MAC9BjD,EAAiB6E,IAAIhD,EAAKoB,OACnC6B,EAAeP,EAAUE,GAG7B,CAEI1E,EAAc8E,IAAIhD,EAAKoB,OACzB6B,EAAeT,EAAWxC,EAAKoB,MAGjC,IAAK,MAAMQ,KAAS5B,EAAKkD,SACvB/B,EAAMS,EAjBR,CAmBF,CAEAT,EAAMzB,GAEN,MAAMyD,EAAoBX,EAAUY,KAC9BC,EAAmBX,EAASU,KAC5BE,EAAiBC,EAAIf,EAAUzD,UAC/ByE,EAAgBD,EAAIb,EAAS3D,UAC7B0E,EAAaN,EAAoBE,EACjCtC,EAASuC,EAAiBE,EAC1BE,EAAwB,IAAfD,EAAmB,EAAI1C,EAAS4C,KAAKC,KAAKH,GACnDI,EAAkC,IAArBR,EAAyB,EAAKF,EAAoB,GAAMK,EAAgBH,GACrFS,EAASD,EAAaH,EAE5B,MAAO,CACLP,oBACAE,mBACAC,iBACAE,gBACAC,aACA1C,SACA2C,SACAG,aACAC,SACAC,KAAMD,EAAS,GACfE,KAAMN,EAAS,IAEnB,CAzNqBO,CAAgBvE,EAAMR,GAEvC,MAAO,CACLV,SAAUA,EAASG,KACnBuF,MAAOC,OAAOC,WAAWlF,GACzB2B,QACAwD,UAAWxE,EACXyE,WAAYxE,EAAaJ,EAAM,IAAIzB,IAAIO,EAAS+F,iBAAiBxD,OACjEyD,cAAe3E,EAAgBkB,OAC/BN,qBAAsBG,EAAiBH,qBACvCgE,wBAAyBC,EAAU7E,EAAiB,wBACpDa,oBAAqBE,EAAiBF,oBACtCiE,uBAAwBD,EAAU7E,EAAiB,uBACnD+E,aAAchE,EAAiBgE,aAC/BrC,WACAsC,qBAAsBC,EACpBvC,EAASmB,OACT9C,EAAiBH,qBACjBI,EAAM3B,MAER6F,WAAY5F,EAAQ6F,kBAAoBtF,EAAKuF,gBAAaC,EAE9D,QAGWC,EAAkB,IAAI/G,EAE5B,SAASgH,EAAYlG,EAAcC,GACxC,OAAOgG,EAAgBlG,QAAQC,EAAMC,EACvC,CAcA,SAASe,EAAkBF,EAAyBxB,EAA8B6G,GAChF,IAAI5E,EAAuB,EACvBC,EAAsB,EACtBkE,EAAeS,EACnB,MAAMC,EAAgB,IAAIrH,IAAIO,EAAS+G,mBACjCC,EAAe,IAAIvH,IAAIO,EAASiH,kBAEtC,SAAStE,EAAMuE,EAA4BC,GACzC,MAAMC,EAAaN,EAActC,IAAI0C,EAAQtE,MACvCyE,EAAYL,EAAaxC,IAAI0C,EAAQtE,MAEvCwE,IACFnF,GAAwB,EACxBC,GAAuB,EAAIiF,GAuBjC,SAA2B3F,GACzB,GAAIA,EAAK8F,QACP,OAAO,EAGT,OAAO9H,EAAiBgF,IAAIhD,EAAK4C,KACnC,CA1BQmD,CAAkBL,KACpBjF,GAAwB,EACxBC,GAAuB,GAGzB,MAAMsF,EAAeH,EAAYF,EAAiB,EAAIA,EACtDf,EAAejB,KAAKsC,IAAIrB,EAAcoB,GAEtC,IAAK,MAAMpE,KAAS8D,EAAQxC,SAC1B/B,EAAMS,EAAOoE,EAEjB,CAEA,IAAK,MAAMpE,KAAS5B,EAAKkD,SACvB/B,EAAMS,EAAOyD,GAGf,MAAO,CAAE5E,uBAAsBC,sBAAqBkE,eACtD,CAUA,SAAS9E,EAAaJ,EAAyBwG,GAC7C,MAAMC,EAA6B,GAanC,OAXA,SAAShF,EAAMnB,GACTkG,EAAUlD,IAAIhD,EAAKoB,OACrB+E,EAAM9E,KAAKrB,GAGb,IAAK,MAAM4B,KAAS5B,EAAK6B,cACvBV,EAAMS,EAEV,CAEAT,CAAMzB,GACCyG,CACT,CAkDA,SAAS/D,EAAkBd,EAAc8E,EAAmBlF,GAC1D,MAAMmF,EAAgBnF,EAAMoF,OAAQC,GAASA,EAAKjF,OAAS8E,GAC3D,GAA6B,IAAzBC,EAActF,OAChB,OAAO,EAGT,MAAMyF,EAAqBlF,EAAKmF,OAAO,MACjCC,EAAoBpF,EAAKqF,UAAU5F,OAEzC,OAAOsF,EAAcO,KAAML,GAASA,EAAKhF,aAAeiF,GAAsBD,EAAK9E,WAAaiF,EAClG,CAyDA,SAASvG,EAAiBH,GACxB,MAAM6G,EAAW7G,EAAK8G,kBAAkB,QACxC,GAAID,EACF,OAAOA,EAASjE,KAGlB,MAAMmE,EAAS/G,EAAK+G,OACpB,IAAKA,EACH,OAGF,MAAMC,EAAaD,EAAOD,kBAAkB,QAC5C,OAAOE,GAAYpE,IACrB,CAEA,SAASkC,EAA8BpB,EAAgBzD,EAAoBgH,GACzE,GAAY,IAARA,EACF,OAAO,IAGT,MAAMC,EAAM,IAAM,IAAMvD,KAAKwD,IAAIxD,KAAKsC,IAAIvC,EAAQ,IAAM,IAAOzD,EAAa,KAAO0D,KAAKwD,IAAIF,GAC5F,OAAOtD,KAAKsC,IAAI,EAAGtC,KAAKyD,IAAI,IAAY,IAANF,EAAa,KACjD,CAEA,SAASjE,EAAejE,EAA0BqI,GAChDrI,EAAIN,IAAI2I,GAAQrI,EAAII,IAAIiI,IAAU,GAAK,EACzC,CAEA,SAAS3C,EAAUL,EAA8BiD,GAC/C,OAA4B,IAArBjD,EAAUtD,OAAe,EAAI4C,KAAKsC,OAAO5B,EAAUrF,IAAKuI,GAAOA,EAAGD,IAC3E,CAEA,SAAS/D,EAAIxE,GACX,IAAIsD,EAAQ,EACZ,IAAK,MAAMgF,KAAStI,EAClBsD,GAASgF,EAEX,OAAOhF,CACT"}

package/dist/types.d.ts

@@ -0,0 +1,58 @@
+export type SupportedLanguage = 'go' | 'javascript' | 'jsx' | 'python' | 'typescript' | 'tsx';
+export type LanguageName = SupportedLanguage | (string & {});
+export type ParserLanguage = unknown;
+export interface LanguageDefinition {
+    name: LanguageName;
+    parserLanguage: ParserLanguage;
+    aliases?: readonly string[];
+    functionNodeTypes?: readonly string[];
+    classNodeTypes?: readonly string[];
+    decisionNodeTypes?: readonly string[];
+    nestingNodeTypes?: readonly string[];
+}
+export interface MeasureOptions {
+    language: LanguageName;
+    includeSyntaxTree?: boolean;
+}
+export interface LineMetrics {
+    total: number;
+    code: number;
+    comment: number;
+    blank: number;
+}
+export interface HalsteadMetrics {
+    distinctOperators: number;
+    distinctOperands: number;
+    totalOperators: number;
+    totalOperands: number;
+    vocabulary: number;
+    length: number;
+    volume: number;
+    difficulty: number;
+    effort: number;
+    time: number;
+    bugs: number;
+}
+export interface FunctionMetrics {
+    name?: string;
+    startLine: number;
+    endLine: number;
+    cyclomaticComplexity: number;
+    cognitiveComplexity: number;
+}
+export interface CodeMetrics {
+    language: LanguageName;
+    bytes: number;
+    lines: LineMetrics;
+    functions: FunctionMetrics[];
+    classCount: number;
+    functionCount: number;
+    cyclomaticComplexity: number;
+    maxCyclomaticComplexity: number;
+    cognitiveComplexity: number;
+    maxCognitiveComplexity: number;
+    nestingDepth: number;
+    halstead: HalsteadMetrics;
+    maintainabilityIndex: number;
+    syntaxTree?: string;
+}

package/package.json

@@ -0,0 +1,77 @@
+{
+  "name": "measure-code",
+  "version": "1.0.0",
+  "description": "Measure code metrics with tree-sitter.",
+  "keywords": [
+    "tree-sitter",
+    "metrics",
+    "loc",
+    "cyclomatic-complexity",
+    "cognitive-complexity"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/WillBooster/tree-measurer.git"
+  },
+  "license": "Apache-2.0",
+  "author": "WillBooster Inc.",
+  "type": "module",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "require": "./dist/index.cjs",
+      "import": "./dist/index.js"
+    }
+  },
+  "main": "dist/index.cjs",
+  "module": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "files": [
+    "dist/"
+  ],
+  "scripts": {
+    "build": "build-ts lib",
+    "cleanup": "yarn format && yarn lint-fix",
+    "format": "sort-package-json && yarn format-code",
+    "format-code": "oxfmt --write --no-error-on-unmatched-pattern . '!**/package.json'",
+    "lint": "oxlint --no-error-on-unmatched-pattern .",
+    "lint-fix": "yarn lint --fix",
+    "prepare": "lefthook install || true",
+    "test": "vitest",
+    "typecheck": "wb typecheck",
+    "verify": "wb verify",
+    "verify-full": "wb verify --full"
+  },
+  "dependencies": {
+    "tree-sitter": "^0.21.1",
+    "tree-sitter-go": "^0.21.2",
+    "tree-sitter-javascript": "^0.21.4",
+    "tree-sitter-python": "^0.21.0",
+    "tree-sitter-typescript": "^0.21.2"
+  },
+  "devDependencies": {
+    "@tsconfig/node-lts": "24.0.0",
+    "@tsconfig/node-ts": "23.6.4",
+    "@types/node": "25.9.4",
+    "@typescript/native-preview": "7.0.0-dev.20260615.1",
+    "@willbooster/oxfmt-config": "1.2.2",
+    "@willbooster/oxlint-config": "1.4.8",
+    "@willbooster/wb": "13.22.18",
+    "build-ts": "17.1.27",
+    "conventional-changelog-conventionalcommits": "9.3.1",
+    "lefthook": "2.1.9",
+    "oxfmt": "0.56.0",
+    "oxlint": "1.71.0",
+    "oxlint-tsgolint": "0.23.0",
+    "semantic-release": "25.0.5",
+    "sort-package-json": "4.0.0",
+    "vitest": "4.1.9"
+  },
+  "packageManager": "yarn@4.17.0",
+  "engines": {
+    "node": ">=24"
+  },
+  "publishConfig": {
+    "access": "public"
+  }
+}