code-gauge 9.0.0 → 10.1.0

package/dist/metrics.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"metrics.cjs","names":["createLanguageRegistry","measureCodeNative","measureCodeNativeAsync","collectCrossFileDataNative","collectFunctionTokenSequencesNative"],"sources":["../src/metrics.ts"],"sourcesContent":["import type { CrossFileDuplicateCandidate, CrossFileDuplicationFileData } from './duplication.js';\nimport { createLanguageRegistry } from './languages.js';\nimport {\n  collectCrossFileDataNative,\n  collectFunctionTokenSequencesNative,\n  measureCodeNative,\n  measureCodeNativeAsync,\n  type NativeCrossFileDataPayload,\n  type NativeHalsteadCounts,\n  type NativeMetricsPayload,\n} from './nativeMetrics.js';\nimport type { CodeMetrics, HalsteadMetrics, LanguageDefinition, LanguageName, MeasureOptions } from './types.js';\n\n/**\n * Measures code metrics for the built-in languages. Parsing and metric passes run in the bundled\n * Rust addon (tree-sitter); this class resolves language aliases, crosses the N-API boundary, and\n * derives the Halstead float metrics from the natively measured counts.\n */\nexport class TreeMeasurer {\n  private readonly registry = createLanguageRegistry();\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.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication);\n    return assembleNativeMetrics(payload, includeSyntaxTree);\n  }\n\n  /** Measures a file and collects its cross-file clone-detection contribution from one parse. */\n  measureWithCrossFileData(\n    code: string,\n    options: MeasureOptions\n  ): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** measureWithCrossFileData on the native addon's worker threads, for measuring files in parallel. */\n  async measureWithCrossFileDataAsync(\n    code: string,\n    options: MeasureOptions\n  ): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = await measureCodeNativeAsync(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** Collects one file's duplicate candidates for cross-file clone detection. */\n  collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n    return this.collectCrossFileDuplicationFileData(code, options).candidates;\n  }\n\n  /**\n   * Collects one file's duplicate candidates, normalized tokens, and statement structure for\n   * cross-file clone detection with measureCrossFileDuplication.\n   */\n  collectCrossFileDuplicationFileData(code: string, options: MeasureOptions): CrossFileDuplicationFileData {\n    const language = this.resolveLanguage(options.language);\n    return toCrossFileDuplicationFileData(\n      collectCrossFileDataNative(code, language.name, options.duplication?.minTokens)\n    );\n  }\n\n  /**\n   * Normalized token hash sequences of every function, index-parallel to the functions array of\n   * measure(): identifiers are anonymized by first occurrence within the function, literals by\n   * kind, and keywords/operators kept verbatim.\n   */\n  collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n    const language = this.resolveLanguage(options.language);\n    return collectFunctionTokenSequencesNative(code, language.name);\n  }\n\n  private resolveLanguage(name: LanguageName): LanguageDefinition {\n    const language = this.registry.get(name);\n    if (!language) {\n      throw new Error(`Unsupported language: ${name}`);\n    }\n    return language;\n  }\n}\n\nfunction assembleMetricsWithCrossFileData(\n  payload: NativeMetricsPayload,\n  includeSyntaxTree: boolean\n): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n  if (!payload.crossFileData) {\n    throw new Error('The native addon returned no cross-file duplication data');\n  }\n  return {\n    metrics: assembleNativeMetrics(payload, includeSyntaxTree),\n    crossFileData: toCrossFileDuplicationFileData(payload.crossFileData),\n  };\n}\n\nfunction toCrossFileDuplicationFileData(payload: NativeCrossFileDataPayload): CrossFileDuplicationFileData {\n  return {\n    candidates: payload.candidates,\n    tokens: payload.tokens,\n    containerStatements: payload.containerStatements,\n    nearMissBlocks: payload.nearMissBlocks,\n    // Lets cross-file line coverage count only code lines, like within-file coverage.\n    codeLineNumbers: new Set(payload.codeLineNumbers),\n  };\n}\n\n/**\n * Completes a native measurement into CodeMetrics. The object is rebuilt field by field (rather\n * than spread from the parsed JSON) so the result has a stable shape, including\n * explicitly-undefined optional keys.\n */\nfunction assembleNativeMetrics(payload: NativeMetricsPayload, includeSyntaxTree: boolean): CodeMetrics {\n  return {\n    language: payload.language,\n    bytes: payload.bytes,\n    lines: payload.lines,\n    functions: payload.functions.map((fn) => ({\n      name: fn.name,\n      nodeType: fn.nodeType,\n      startLine: fn.startLine,\n      startColumn: fn.startColumn,\n      endLine: fn.endLine,\n      endColumn: fn.endColumn,\n      cyclomaticComplexity: fn.cyclomaticComplexity,\n      cognitiveComplexity: fn.cognitiveComplexity,\n      nestingDepth: fn.nestingDepth,\n      ncss: fn.ncss,\n      parameterCount: fn.parameterCount,\n      halstead: deriveHalsteadMetrics(fn.halsteadCounts),\n      depDegree: fn.depDegree,\n    })),\n    cyclomaticComplexity: payload.cyclomaticComplexity,\n    cognitiveComplexity: payload.cognitiveComplexity,\n    maxCognitiveComplexity: payload.maxCognitiveComplexity,\n    nestingDepth: payload.nestingDepth,\n    ncssCount: payload.ncssCount,\n    duplication: payload.duplication,\n    halstead: deriveHalsteadMetrics(payload.halsteadCounts),\n    syntaxTree: includeSyntaxTree ? payload.syntaxTree : undefined,\n  };\n}\n\nfunction deriveHalsteadMetrics(counts: NativeHalsteadCounts): HalsteadMetrics {\n  const { distinctOperators, distinctOperands, totalOperators, totalOperands } = counts;\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  };\n}\n\nexport const defaultMeasurer = new TreeMeasurer();\n\nexport function measureCode(code: string, options: MeasureOptions): CodeMetrics {\n  return defaultMeasurer.measure(code, options);\n}\n\n/** Standalone helper mirroring TreeMeasurer.measureWithCrossFileDataAsync for the default measurer. */\nexport function measureCodeWithCrossFileDataAsync(\n  code: string,\n  options: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n  return defaultMeasurer.measureWithCrossFileDataAsync(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n  return defaultMeasurer.collectDuplicationCandidates(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n  return defaultMeasurer.collectFunctionTokenSequences(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectCrossFileDuplicationFileData(\n  code: string,\n  options: MeasureOptions\n): CrossFileDuplicationFileData {\n  return defaultMeasurer.collectCrossFileDuplicationFileData(code, options);\n}\n"],"mappings":"iFAkBA,IAAa,EAAb,KAA0B,CACxB,SAA4BA,EAAAA,uBAAuB,EAEnD,uBAAwC,CACtC,MAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC,CAAC,CAAC,IAAK,GAAa,EAAS,IAAI,CAAC,CAAC,CAClF,CAEA,QAAQ,EAAc,EAAsC,CAC1D,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADSC,EAAAA,kBAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,WAC/C,EAAG,CAAiB,CACzD,CAGA,yBACE,EACA,EACuE,CACvE,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADSA,EAAAA,kBAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EACjD,EAAG,CAAiB,CACpE,CAGA,MAAM,8BACJ,EACA,EACgF,CAChF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EAAiC,MADlBC,EAAAA,uBAAuB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EAAI,EAC7D,CAAiB,CACpE,CAGA,6BAA6B,EAAc,EAAwD,CACjG,OAAO,KAAK,oCAAoC,EAAM,CAAO,CAAC,CAAC,UACjE,CAMA,oCAAoC,EAAc,EAAuD,CACvG,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAO,EACLC,EAAAA,2BAA2B,EAAM,EAAS,KAAM,EAAQ,aAAa,SAAS,CAChF,CACF,CAOA,8BAA8B,EAAc,EAAuC,CACjF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAOC,EAAAA,oCAAoC,EAAM,EAAS,IAAI,CAChE,CAEA,gBAAwB,EAAwC,CAC9D,IAAM,EAAW,KAAK,SAAS,IAAI,CAAI,EACvC,GAAI,CAAC,EACH,MAAU,MAAM,yBAAyB,GAAM,EAEjD,OAAO,CACT,CACF,EAEA,SAAS,EACP,EACA,EACuE,CACvE,GAAI,CAAC,EAAQ,cACX,MAAU,MAAM,0DAA0D,EAE5E,MAAO,CACL,QAAS,EAAsB,EAAS,CAAiB,EACzD,cAAe,EAA+B,EAAQ,aAAa,CACrE,CACF,CAEA,SAAS,EAA+B,EAAmE,CACzG,MAAO,CACL,WAAY,EAAQ,WACpB,OAAQ,EAAQ,OAChB,oBAAqB,EAAQ,oBAC7B,eAAgB,EAAQ,eAExB,gBAAiB,IAAI,IAAI,EAAQ,eAAe,CAClD,CACF,CAOA,SAAS,EAAsB,EAA+B,EAAyC,CACrG,MAAO,CACL,SAAU,EAAQ,SAClB,MAAO,EAAQ,MACf,MAAO,EAAQ,MACf,UAAW,EAAQ,UAAU,IAAK,IAAQ,CACxC,KAAM,EAAG,KACT,SAAU,EAAG,SACb,UAAW,EAAG,UACd,YAAa,EAAG,YAChB,QAAS,EAAG,QACZ,UAAW,EAAG,UACd,qBAAsB,EAAG,qBACzB,oBAAqB,EAAG,oBACxB,aAAc,EAAG,aACjB,KAAM,EAAG,KACT,eAAgB,EAAG,eACnB,SAAU,EAAsB,EAAG,cAAc,EACjD,UAAW,EAAG,SAChB,EAAE,EACF,qBAAsB,EAAQ,qBAC9B,oBAAqB,EAAQ,oBAC7B,uBAAwB,EAAQ,uBAChC,aAAc,EAAQ,aACtB,UAAW,EAAQ,UACnB,YAAa,EAAQ,YACrB,SAAU,EAAsB,EAAQ,cAAc,EACtD,WAAY,EAAoB,EAAQ,WAAa,IAAA,EACvD,CACF,CAEA,SAAS,EAAsB,EAA+C,CAC5E,GAAM,CAAE,oBAAmB,mBAAkB,iBAAgB,iBAAkB,EACzE,EAAa,EAAoB,EACjC,EAAS,EAAiB,EAC1B,EAAS,IAAe,EAAI,EAAI,EAAS,KAAK,KAAK,CAAU,EAC7D,EAAa,IAAqB,EAAI,EAAK,EAAoB,GAAM,EAAgB,GAG3F,MAAO,CACL,oBACA,mBACA,iBACA,gBACA,aACA,SACA,SACA,aACA,OAXa,EAAa,CAY5B,CACF,CAEA,MAAa,EAAkB,IAAI,EAEnC,SAAgB,EAAY,EAAc,EAAsC,CAC9E,OAAO,EAAgB,QAAQ,EAAM,CAAO,CAC9C,CAGA,SAAgB,EACd,EACA,EACgF,CAChF,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EAA6B,EAAc,EAAwD,CACjH,OAAO,EAAgB,6BAA6B,EAAM,CAAO,CACnE,CAGA,SAAgB,EAA8B,EAAc,EAAuC,CACjG,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EACd,EACA,EAC8B,CAC9B,OAAO,EAAgB,oCAAoC,EAAM,CAAO,CAC1E"}
+{"version":3,"file":"metrics.cjs","names":["createLanguageRegistry","measureCodeNative","measureCodeNativeAsync","collectCrossFileDataNative","collectFunctionTokenSequencesNative"],"sources":["../src/metrics.ts"],"sourcesContent":["import type { CrossFileDuplicateCandidate, CrossFileDuplicationFileData } from './duplication.js';\nimport { createLanguageRegistry } from './languages.js';\nimport {\n  collectCrossFileDataNative,\n  collectFunctionTokenSequencesNative,\n  measureCodeNative,\n  measureCodeNativeAsync,\n  type NativeCrossFileDataPayload,\n  type NativeHalsteadCounts,\n  type NativeMetricsPayload,\n} from './nativeMetrics.js';\nimport type { CodeMetrics, HalsteadMetrics, LanguageDefinition, LanguageName, MeasureOptions } from './types.js';\n\n/**\n * Measures code metrics for the built-in languages. Parsing and metric passes run in the bundled\n * Rust addon (tree-sitter); this class resolves language aliases, crosses the N-API boundary, and\n * derives the Halstead float metrics from the natively measured counts.\n */\nexport class TreeMeasurer {\n  private readonly registry = createLanguageRegistry();\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.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication);\n    return assembleNativeMetrics(payload, includeSyntaxTree);\n  }\n\n  /** Measures a file and collects its cross-file clone-detection contribution from one parse. */\n  measureWithCrossFileData(\n    code: string,\n    options: MeasureOptions\n  ): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** measureWithCrossFileData on the native addon's worker threads, for measuring files in parallel. */\n  async measureWithCrossFileDataAsync(\n    code: string,\n    options: MeasureOptions\n  ): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = await measureCodeNativeAsync(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** Collects one file's duplicate candidates for cross-file clone detection. */\n  collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n    return this.collectCrossFileDuplicationFileData(code, options).candidates;\n  }\n\n  /**\n   * Collects one file's duplicate candidates, normalized tokens, and statement structure for\n   * cross-file clone detection with measureCrossFileDuplication.\n   */\n  collectCrossFileDuplicationFileData(code: string, options: MeasureOptions): CrossFileDuplicationFileData {\n    const language = this.resolveLanguage(options.language);\n    return toCrossFileDuplicationFileData(\n      collectCrossFileDataNative(code, language.name, options.duplication?.minTokens)\n    );\n  }\n\n  /**\n   * Normalized token hash sequences of every function, index-parallel to the functions array of\n   * measure(): identifiers are anonymized by first occurrence within the function, literals by\n   * kind, and keywords/operators kept verbatim.\n   */\n  collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n    const language = this.resolveLanguage(options.language);\n    return collectFunctionTokenSequencesNative(code, language.name);\n  }\n\n  private resolveLanguage(name: LanguageName): LanguageDefinition {\n    const language = this.registry.get(name);\n    if (!language) {\n      throw new Error(`Unsupported language: ${name}`);\n    }\n    return language;\n  }\n}\n\nfunction assembleMetricsWithCrossFileData(\n  payload: NativeMetricsPayload,\n  includeSyntaxTree: boolean\n): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n  if (!payload.crossFileData) {\n    throw new Error('The native addon returned no cross-file duplication data');\n  }\n  return {\n    metrics: assembleNativeMetrics(payload, includeSyntaxTree),\n    crossFileData: toCrossFileDuplicationFileData(payload.crossFileData),\n  };\n}\n\nfunction toCrossFileDuplicationFileData(payload: NativeCrossFileDataPayload): CrossFileDuplicationFileData {\n  return {\n    candidates: payload.candidates,\n    tokens: payload.tokens,\n    containerStatements: payload.containerStatements,\n    nearMissBlocks: payload.nearMissBlocks,\n    // Lets cross-file line coverage count only code lines, like within-file coverage.\n    codeLineNumbers: new Set(payload.codeLineNumbers),\n  };\n}\n\n/**\n * Completes a native measurement into CodeMetrics. The object is rebuilt field by field (rather\n * than spread from the parsed JSON) so the result has a stable shape, including\n * explicitly-undefined optional keys.\n */\nfunction assembleNativeMetrics(payload: NativeMetricsPayload, includeSyntaxTree: boolean): CodeMetrics {\n  return {\n    language: payload.language,\n    bytes: payload.bytes,\n    lines: payload.lines,\n    codeLineNumbers: payload.codeLineNumbers,\n    functions: payload.functions.map((fn) => ({\n      name: fn.name,\n      containerName: fn.containerName,\n      nodeType: fn.nodeType,\n      startLine: fn.startLine,\n      startColumn: fn.startColumn,\n      endLine: fn.endLine,\n      endColumn: fn.endColumn,\n      cyclomaticComplexity: fn.cyclomaticComplexity,\n      cognitiveComplexity: fn.cognitiveComplexity,\n      cognitiveBlocks: fn.cognitiveBlocks ?? [],\n      nestingDepth: fn.nestingDepth,\n      ncss: fn.ncss,\n      parameterCount: fn.parameterCount,\n      halstead: deriveHalsteadMetrics(fn.halsteadCounts),\n      depDegree: fn.depDegree,\n    })),\n    cyclomaticComplexity: payload.cyclomaticComplexity,\n    cognitiveComplexity: payload.cognitiveComplexity,\n    maxCognitiveComplexity: payload.maxCognitiveComplexity,\n    nestingDepth: payload.nestingDepth,\n    ncssCount: payload.ncssCount,\n    duplication: payload.duplication,\n    halstead: deriveHalsteadMetrics(payload.halsteadCounts),\n    syntaxTree: includeSyntaxTree ? payload.syntaxTree : undefined,\n  };\n}\n\nfunction deriveHalsteadMetrics(counts: NativeHalsteadCounts): HalsteadMetrics {\n  const { distinctOperators, distinctOperands, totalOperators, totalOperands } = counts;\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  };\n}\n\nexport const defaultMeasurer = new TreeMeasurer();\n\nexport function measureCode(code: string, options: MeasureOptions): CodeMetrics {\n  return defaultMeasurer.measure(code, options);\n}\n\n/** Standalone helper mirroring TreeMeasurer.measureWithCrossFileDataAsync for the default measurer. */\nexport function measureCodeWithCrossFileDataAsync(\n  code: string,\n  options: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n  return defaultMeasurer.measureWithCrossFileDataAsync(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n  return defaultMeasurer.collectDuplicationCandidates(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n  return defaultMeasurer.collectFunctionTokenSequences(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectCrossFileDuplicationFileData(\n  code: string,\n  options: MeasureOptions\n): CrossFileDuplicationFileData {\n  return defaultMeasurer.collectCrossFileDuplicationFileData(code, options);\n}\n"],"mappings":"iFAkBA,IAAa,EAAb,KAA0B,CACxB,SAA4BA,EAAAA,uBAAuB,EAEnD,uBAAwC,CACtC,MAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC,CAAC,CAAC,IAAK,GAAa,EAAS,IAAI,CAAC,CAAC,CAClF,CAEA,QAAQ,EAAc,EAAsC,CAC1D,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADSC,EAAAA,kBAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,WAC/C,EAAG,CAAiB,CACzD,CAGA,yBACE,EACA,EACuE,CACvE,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADSA,EAAAA,kBAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EACjD,EAAG,CAAiB,CACpE,CAGA,MAAM,8BACJ,EACA,EACgF,CAChF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EAAiC,MADlBC,EAAAA,uBAAuB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EAAI,EAC7D,CAAiB,CACpE,CAGA,6BAA6B,EAAc,EAAwD,CACjG,OAAO,KAAK,oCAAoC,EAAM,CAAO,CAAC,CAAC,UACjE,CAMA,oCAAoC,EAAc,EAAuD,CACvG,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAO,EACLC,EAAAA,2BAA2B,EAAM,EAAS,KAAM,EAAQ,aAAa,SAAS,CAChF,CACF,CAOA,8BAA8B,EAAc,EAAuC,CACjF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAOC,EAAAA,oCAAoC,EAAM,EAAS,IAAI,CAChE,CAEA,gBAAwB,EAAwC,CAC9D,IAAM,EAAW,KAAK,SAAS,IAAI,CAAI,EACvC,GAAI,CAAC,EACH,MAAU,MAAM,yBAAyB,GAAM,EAEjD,OAAO,CACT,CACF,EAEA,SAAS,EACP,EACA,EACuE,CACvE,GAAI,CAAC,EAAQ,cACX,MAAU,MAAM,0DAA0D,EAE5E,MAAO,CACL,QAAS,EAAsB,EAAS,CAAiB,EACzD,cAAe,EAA+B,EAAQ,aAAa,CACrE,CACF,CAEA,SAAS,EAA+B,EAAmE,CACzG,MAAO,CACL,WAAY,EAAQ,WACpB,OAAQ,EAAQ,OAChB,oBAAqB,EAAQ,oBAC7B,eAAgB,EAAQ,eAExB,gBAAiB,IAAI,IAAI,EAAQ,eAAe,CAClD,CACF,CAOA,SAAS,EAAsB,EAA+B,EAAyC,CACrG,MAAO,CACL,SAAU,EAAQ,SAClB,MAAO,EAAQ,MACf,MAAO,EAAQ,MACf,gBAAiB,EAAQ,gBACzB,UAAW,EAAQ,UAAU,IAAK,IAAQ,CACxC,KAAM,EAAG,KACT,cAAe,EAAG,cAClB,SAAU,EAAG,SACb,UAAW,EAAG,UACd,YAAa,EAAG,YAChB,QAAS,EAAG,QACZ,UAAW,EAAG,UACd,qBAAsB,EAAG,qBACzB,oBAAqB,EAAG,oBACxB,gBAAiB,EAAG,iBAAmB,CAAC,EACxC,aAAc,EAAG,aACjB,KAAM,EAAG,KACT,eAAgB,EAAG,eACnB,SAAU,EAAsB,EAAG,cAAc,EACjD,UAAW,EAAG,SAChB,EAAE,EACF,qBAAsB,EAAQ,qBAC9B,oBAAqB,EAAQ,oBAC7B,uBAAwB,EAAQ,uBAChC,aAAc,EAAQ,aACtB,UAAW,EAAQ,UACnB,YAAa,EAAQ,YACrB,SAAU,EAAsB,EAAQ,cAAc,EACtD,WAAY,EAAoB,EAAQ,WAAa,IAAA,EACvD,CACF,CAEA,SAAS,EAAsB,EAA+C,CAC5E,GAAM,CAAE,oBAAmB,mBAAkB,iBAAgB,iBAAkB,EACzE,EAAa,EAAoB,EACjC,EAAS,EAAiB,EAC1B,EAAS,IAAe,EAAI,EAAI,EAAS,KAAK,KAAK,CAAU,EAC7D,EAAa,IAAqB,EAAI,EAAK,EAAoB,GAAM,EAAgB,GAG3F,MAAO,CACL,oBACA,mBACA,iBACA,gBACA,aACA,SACA,SACA,aACA,OAXa,EAAa,CAY5B,CACF,CAEA,MAAa,EAAkB,IAAI,EAEnC,SAAgB,EAAY,EAAc,EAAsC,CAC9E,OAAO,EAAgB,QAAQ,EAAM,CAAO,CAC9C,CAGA,SAAgB,EACd,EACA,EACgF,CAChF,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EAA6B,EAAc,EAAwD,CACjH,OAAO,EAAgB,6BAA6B,EAAM,CAAO,CACnE,CAGA,SAAgB,EAA8B,EAAc,EAAuC,CACjG,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EACd,EACA,EAC8B,CAC9B,OAAO,EAAgB,oCAAoC,EAAM,CAAO,CAC1E"}

package/dist/metrics.js

@@ -1,2 +1,2 @@
-import{createLanguageRegistry as e}from"./languages.js";import{collectCrossFileDataNative as t,collectFunctionTokenSequencesNative as n,measureCodeNative as r,measureCodeNativeAsync as i}from"./nativeMetrics.js";var a=class{registry=e();getSupportedLanguages(){return[...new Set([...this.registry.values()].map(e=>e.name))]}measure(e,t){let n=this.resolveLanguage(t.language),i=t.includeSyntaxTree??!1;return c(r(e,n.name,i,t.duplication),i)}measureWithCrossFileData(e,t){let n=this.resolveLanguage(t.language),i=t.includeSyntaxTree??!1;return o(r(e,n.name,i,t.duplication,!0),i)}async measureWithCrossFileDataAsync(e,t){let n=this.resolveLanguage(t.language),r=t.includeSyntaxTree??!1;return o(await i(e,n.name,r,t.duplication,!0),r)}collectDuplicationCandidates(e,t){return this.collectCrossFileDuplicationFileData(e,t).candidates}collectCrossFileDuplicationFileData(e,n){let r=this.resolveLanguage(n.language);return s(t(e,r.name,n.duplication?.minTokens))}collectFunctionTokenSequences(e,t){let r=this.resolveLanguage(t.language);return n(e,r.name)}resolveLanguage(e){let t=this.registry.get(e);if(!t)throw Error(`Unsupported language: ${e}`);return t}};function o(e,t){if(!e.crossFileData)throw Error(`The native addon returned no cross-file duplication data`);return{metrics:c(e,t),crossFileData:s(e.crossFileData)}}function s(e){return{candidates:e.candidates,tokens:e.tokens,containerStatements:e.containerStatements,nearMissBlocks:e.nearMissBlocks,codeLineNumbers:new Set(e.codeLineNumbers)}}function c(e,t){return{language:e.language,bytes:e.bytes,lines:e.lines,functions:e.functions.map(e=>({name:e.name,nodeType:e.nodeType,startLine:e.startLine,startColumn:e.startColumn,endLine:e.endLine,endColumn:e.endColumn,cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,nestingDepth:e.nestingDepth,ncss:e.ncss,parameterCount:e.parameterCount,halstead:l(e.halsteadCounts),depDegree:e.depDegree})),cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,maxCognitiveComplexity:e.maxCognitiveComplexity,nestingDepth:e.nestingDepth,ncssCount:e.ncssCount,duplication:e.duplication,halstead:l(e.halsteadCounts),syntaxTree:t?e.syntaxTree:void 0}}function l(e){let{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i}=e,a=t+n,o=r+i,s=a===0?0:o*Math.log2(a),c=n===0?0:t/2*(i/n);return{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i,vocabulary:a,length:o,volume:s,difficulty:c,effort:c*s}}const u=new a;function d(e,t){return u.measure(e,t)}function f(e,t){return u.measureWithCrossFileDataAsync(e,t)}function p(e,t){return u.collectDuplicationCandidates(e,t)}function m(e,t){return u.collectFunctionTokenSequences(e,t)}function h(e,t){return u.collectCrossFileDuplicationFileData(e,t)}export{a as TreeMeasurer,h as collectCrossFileDuplicationFileData,p as collectDuplicationCandidates,m as collectFunctionTokenSequences,u as defaultMeasurer,d as measureCode,f as measureCodeWithCrossFileDataAsync};
+import{createLanguageRegistry as e}from"./languages.js";import{collectCrossFileDataNative as t,collectFunctionTokenSequencesNative as n,measureCodeNative as r,measureCodeNativeAsync as i}from"./nativeMetrics.js";var a=class{registry=e();getSupportedLanguages(){return[...new Set([...this.registry.values()].map(e=>e.name))]}measure(e,t){let n=this.resolveLanguage(t.language),i=t.includeSyntaxTree??!1;return c(r(e,n.name,i,t.duplication),i)}measureWithCrossFileData(e,t){let n=this.resolveLanguage(t.language),i=t.includeSyntaxTree??!1;return o(r(e,n.name,i,t.duplication,!0),i)}async measureWithCrossFileDataAsync(e,t){let n=this.resolveLanguage(t.language),r=t.includeSyntaxTree??!1;return o(await i(e,n.name,r,t.duplication,!0),r)}collectDuplicationCandidates(e,t){return this.collectCrossFileDuplicationFileData(e,t).candidates}collectCrossFileDuplicationFileData(e,n){let r=this.resolveLanguage(n.language);return s(t(e,r.name,n.duplication?.minTokens))}collectFunctionTokenSequences(e,t){let r=this.resolveLanguage(t.language);return n(e,r.name)}resolveLanguage(e){let t=this.registry.get(e);if(!t)throw Error(`Unsupported language: ${e}`);return t}};function o(e,t){if(!e.crossFileData)throw Error(`The native addon returned no cross-file duplication data`);return{metrics:c(e,t),crossFileData:s(e.crossFileData)}}function s(e){return{candidates:e.candidates,tokens:e.tokens,containerStatements:e.containerStatements,nearMissBlocks:e.nearMissBlocks,codeLineNumbers:new Set(e.codeLineNumbers)}}function c(e,t){return{language:e.language,bytes:e.bytes,lines:e.lines,codeLineNumbers:e.codeLineNumbers,functions:e.functions.map(e=>({name:e.name,containerName:e.containerName,nodeType:e.nodeType,startLine:e.startLine,startColumn:e.startColumn,endLine:e.endLine,endColumn:e.endColumn,cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,cognitiveBlocks:e.cognitiveBlocks??[],nestingDepth:e.nestingDepth,ncss:e.ncss,parameterCount:e.parameterCount,halstead:l(e.halsteadCounts),depDegree:e.depDegree})),cyclomaticComplexity:e.cyclomaticComplexity,cognitiveComplexity:e.cognitiveComplexity,maxCognitiveComplexity:e.maxCognitiveComplexity,nestingDepth:e.nestingDepth,ncssCount:e.ncssCount,duplication:e.duplication,halstead:l(e.halsteadCounts),syntaxTree:t?e.syntaxTree:void 0}}function l(e){let{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i}=e,a=t+n,o=r+i,s=a===0?0:o*Math.log2(a),c=n===0?0:t/2*(i/n);return{distinctOperators:t,distinctOperands:n,totalOperators:r,totalOperands:i,vocabulary:a,length:o,volume:s,difficulty:c,effort:c*s}}const u=new a;function d(e,t){return u.measure(e,t)}function f(e,t){return u.measureWithCrossFileDataAsync(e,t)}function p(e,t){return u.collectDuplicationCandidates(e,t)}function m(e,t){return u.collectFunctionTokenSequences(e,t)}function h(e,t){return u.collectCrossFileDuplicationFileData(e,t)}export{a as TreeMeasurer,h as collectCrossFileDuplicationFileData,p as collectDuplicationCandidates,m as collectFunctionTokenSequences,u as defaultMeasurer,d as measureCode,f as measureCodeWithCrossFileDataAsync};
 //# sourceMappingURL=metrics.js.map

package/dist/metrics.js.map

@@ -1 +1 @@
-{"version":3,"file":"metrics.js","names":[],"sources":["../src/metrics.ts"],"sourcesContent":["import type { CrossFileDuplicateCandidate, CrossFileDuplicationFileData } from './duplication.js';\nimport { createLanguageRegistry } from './languages.js';\nimport {\n  collectCrossFileDataNative,\n  collectFunctionTokenSequencesNative,\n  measureCodeNative,\n  measureCodeNativeAsync,\n  type NativeCrossFileDataPayload,\n  type NativeHalsteadCounts,\n  type NativeMetricsPayload,\n} from './nativeMetrics.js';\nimport type { CodeMetrics, HalsteadMetrics, LanguageDefinition, LanguageName, MeasureOptions } from './types.js';\n\n/**\n * Measures code metrics for the built-in languages. Parsing and metric passes run in the bundled\n * Rust addon (tree-sitter); this class resolves language aliases, crosses the N-API boundary, and\n * derives the Halstead float metrics from the natively measured counts.\n */\nexport class TreeMeasurer {\n  private readonly registry = createLanguageRegistry();\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.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication);\n    return assembleNativeMetrics(payload, includeSyntaxTree);\n  }\n\n  /** Measures a file and collects its cross-file clone-detection contribution from one parse. */\n  measureWithCrossFileData(\n    code: string,\n    options: MeasureOptions\n  ): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** measureWithCrossFileData on the native addon's worker threads, for measuring files in parallel. */\n  async measureWithCrossFileDataAsync(\n    code: string,\n    options: MeasureOptions\n  ): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = await measureCodeNativeAsync(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** Collects one file's duplicate candidates for cross-file clone detection. */\n  collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n    return this.collectCrossFileDuplicationFileData(code, options).candidates;\n  }\n\n  /**\n   * Collects one file's duplicate candidates, normalized tokens, and statement structure for\n   * cross-file clone detection with measureCrossFileDuplication.\n   */\n  collectCrossFileDuplicationFileData(code: string, options: MeasureOptions): CrossFileDuplicationFileData {\n    const language = this.resolveLanguage(options.language);\n    return toCrossFileDuplicationFileData(\n      collectCrossFileDataNative(code, language.name, options.duplication?.minTokens)\n    );\n  }\n\n  /**\n   * Normalized token hash sequences of every function, index-parallel to the functions array of\n   * measure(): identifiers are anonymized by first occurrence within the function, literals by\n   * kind, and keywords/operators kept verbatim.\n   */\n  collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n    const language = this.resolveLanguage(options.language);\n    return collectFunctionTokenSequencesNative(code, language.name);\n  }\n\n  private resolveLanguage(name: LanguageName): LanguageDefinition {\n    const language = this.registry.get(name);\n    if (!language) {\n      throw new Error(`Unsupported language: ${name}`);\n    }\n    return language;\n  }\n}\n\nfunction assembleMetricsWithCrossFileData(\n  payload: NativeMetricsPayload,\n  includeSyntaxTree: boolean\n): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n  if (!payload.crossFileData) {\n    throw new Error('The native addon returned no cross-file duplication data');\n  }\n  return {\n    metrics: assembleNativeMetrics(payload, includeSyntaxTree),\n    crossFileData: toCrossFileDuplicationFileData(payload.crossFileData),\n  };\n}\n\nfunction toCrossFileDuplicationFileData(payload: NativeCrossFileDataPayload): CrossFileDuplicationFileData {\n  return {\n    candidates: payload.candidates,\n    tokens: payload.tokens,\n    containerStatements: payload.containerStatements,\n    nearMissBlocks: payload.nearMissBlocks,\n    // Lets cross-file line coverage count only code lines, like within-file coverage.\n    codeLineNumbers: new Set(payload.codeLineNumbers),\n  };\n}\n\n/**\n * Completes a native measurement into CodeMetrics. The object is rebuilt field by field (rather\n * than spread from the parsed JSON) so the result has a stable shape, including\n * explicitly-undefined optional keys.\n */\nfunction assembleNativeMetrics(payload: NativeMetricsPayload, includeSyntaxTree: boolean): CodeMetrics {\n  return {\n    language: payload.language,\n    bytes: payload.bytes,\n    lines: payload.lines,\n    functions: payload.functions.map((fn) => ({\n      name: fn.name,\n      nodeType: fn.nodeType,\n      startLine: fn.startLine,\n      startColumn: fn.startColumn,\n      endLine: fn.endLine,\n      endColumn: fn.endColumn,\n      cyclomaticComplexity: fn.cyclomaticComplexity,\n      cognitiveComplexity: fn.cognitiveComplexity,\n      nestingDepth: fn.nestingDepth,\n      ncss: fn.ncss,\n      parameterCount: fn.parameterCount,\n      halstead: deriveHalsteadMetrics(fn.halsteadCounts),\n      depDegree: fn.depDegree,\n    })),\n    cyclomaticComplexity: payload.cyclomaticComplexity,\n    cognitiveComplexity: payload.cognitiveComplexity,\n    maxCognitiveComplexity: payload.maxCognitiveComplexity,\n    nestingDepth: payload.nestingDepth,\n    ncssCount: payload.ncssCount,\n    duplication: payload.duplication,\n    halstead: deriveHalsteadMetrics(payload.halsteadCounts),\n    syntaxTree: includeSyntaxTree ? payload.syntaxTree : undefined,\n  };\n}\n\nfunction deriveHalsteadMetrics(counts: NativeHalsteadCounts): HalsteadMetrics {\n  const { distinctOperators, distinctOperands, totalOperators, totalOperands } = counts;\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  };\n}\n\nexport const defaultMeasurer = new TreeMeasurer();\n\nexport function measureCode(code: string, options: MeasureOptions): CodeMetrics {\n  return defaultMeasurer.measure(code, options);\n}\n\n/** Standalone helper mirroring TreeMeasurer.measureWithCrossFileDataAsync for the default measurer. */\nexport function measureCodeWithCrossFileDataAsync(\n  code: string,\n  options: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n  return defaultMeasurer.measureWithCrossFileDataAsync(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n  return defaultMeasurer.collectDuplicationCandidates(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n  return defaultMeasurer.collectFunctionTokenSequences(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectCrossFileDuplicationFileData(\n  code: string,\n  options: MeasureOptions\n): CrossFileDuplicationFileData {\n  return defaultMeasurer.collectCrossFileDuplicationFileData(code, options);\n}\n"],"mappings":"oNAkBA,IAAa,EAAb,KAA0B,CACxB,SAA4B,EAAuB,EAEnD,uBAAwC,CACtC,MAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC,CAAC,CAAC,IAAK,GAAa,EAAS,IAAI,CAAC,CAAC,CAClF,CAEA,QAAQ,EAAc,EAAsC,CAC1D,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADS,EAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,WAC/C,EAAG,CAAiB,CACzD,CAGA,yBACE,EACA,EACuE,CACvE,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADS,EAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EACjD,EAAG,CAAiB,CACpE,CAGA,MAAM,8BACJ,EACA,EACgF,CAChF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EAAiC,MADlB,EAAuB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EAAI,EAC7D,CAAiB,CACpE,CAGA,6BAA6B,EAAc,EAAwD,CACjG,OAAO,KAAK,oCAAoC,EAAM,CAAO,CAAC,CAAC,UACjE,CAMA,oCAAoC,EAAc,EAAuD,CACvG,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAO,EACL,EAA2B,EAAM,EAAS,KAAM,EAAQ,aAAa,SAAS,CAChF,CACF,CAOA,8BAA8B,EAAc,EAAuC,CACjF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAO,EAAoC,EAAM,EAAS,IAAI,CAChE,CAEA,gBAAwB,EAAwC,CAC9D,IAAM,EAAW,KAAK,SAAS,IAAI,CAAI,EACvC,GAAI,CAAC,EACH,MAAU,MAAM,yBAAyB,GAAM,EAEjD,OAAO,CACT,CACF,EAEA,SAAS,EACP,EACA,EACuE,CACvE,GAAI,CAAC,EAAQ,cACX,MAAU,MAAM,0DAA0D,EAE5E,MAAO,CACL,QAAS,EAAsB,EAAS,CAAiB,EACzD,cAAe,EAA+B,EAAQ,aAAa,CACrE,CACF,CAEA,SAAS,EAA+B,EAAmE,CACzG,MAAO,CACL,WAAY,EAAQ,WACpB,OAAQ,EAAQ,OAChB,oBAAqB,EAAQ,oBAC7B,eAAgB,EAAQ,eAExB,gBAAiB,IAAI,IAAI,EAAQ,eAAe,CAClD,CACF,CAOA,SAAS,EAAsB,EAA+B,EAAyC,CACrG,MAAO,CACL,SAAU,EAAQ,SAClB,MAAO,EAAQ,MACf,MAAO,EAAQ,MACf,UAAW,EAAQ,UAAU,IAAK,IAAQ,CACxC,KAAM,EAAG,KACT,SAAU,EAAG,SACb,UAAW,EAAG,UACd,YAAa,EAAG,YAChB,QAAS,EAAG,QACZ,UAAW,EAAG,UACd,qBAAsB,EAAG,qBACzB,oBAAqB,EAAG,oBACxB,aAAc,EAAG,aACjB,KAAM,EAAG,KACT,eAAgB,EAAG,eACnB,SAAU,EAAsB,EAAG,cAAc,EACjD,UAAW,EAAG,SAChB,EAAE,EACF,qBAAsB,EAAQ,qBAC9B,oBAAqB,EAAQ,oBAC7B,uBAAwB,EAAQ,uBAChC,aAAc,EAAQ,aACtB,UAAW,EAAQ,UACnB,YAAa,EAAQ,YACrB,SAAU,EAAsB,EAAQ,cAAc,EACtD,WAAY,EAAoB,EAAQ,WAAa,IAAA,EACvD,CACF,CAEA,SAAS,EAAsB,EAA+C,CAC5E,GAAM,CAAE,oBAAmB,mBAAkB,iBAAgB,iBAAkB,EACzE,EAAa,EAAoB,EACjC,EAAS,EAAiB,EAC1B,EAAS,IAAe,EAAI,EAAI,EAAS,KAAK,KAAK,CAAU,EAC7D,EAAa,IAAqB,EAAI,EAAK,EAAoB,GAAM,EAAgB,GAG3F,MAAO,CACL,oBACA,mBACA,iBACA,gBACA,aACA,SACA,SACA,aACA,OAXa,EAAa,CAY5B,CACF,CAEA,MAAa,EAAkB,IAAI,EAEnC,SAAgB,EAAY,EAAc,EAAsC,CAC9E,OAAO,EAAgB,QAAQ,EAAM,CAAO,CAC9C,CAGA,SAAgB,EACd,EACA,EACgF,CAChF,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EAA6B,EAAc,EAAwD,CACjH,OAAO,EAAgB,6BAA6B,EAAM,CAAO,CACnE,CAGA,SAAgB,EAA8B,EAAc,EAAuC,CACjG,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EACd,EACA,EAC8B,CAC9B,OAAO,EAAgB,oCAAoC,EAAM,CAAO,CAC1E"}
+{"version":3,"file":"metrics.js","names":[],"sources":["../src/metrics.ts"],"sourcesContent":["import type { CrossFileDuplicateCandidate, CrossFileDuplicationFileData } from './duplication.js';\nimport { createLanguageRegistry } from './languages.js';\nimport {\n  collectCrossFileDataNative,\n  collectFunctionTokenSequencesNative,\n  measureCodeNative,\n  measureCodeNativeAsync,\n  type NativeCrossFileDataPayload,\n  type NativeHalsteadCounts,\n  type NativeMetricsPayload,\n} from './nativeMetrics.js';\nimport type { CodeMetrics, HalsteadMetrics, LanguageDefinition, LanguageName, MeasureOptions } from './types.js';\n\n/**\n * Measures code metrics for the built-in languages. Parsing and metric passes run in the bundled\n * Rust addon (tree-sitter); this class resolves language aliases, crosses the N-API boundary, and\n * derives the Halstead float metrics from the natively measured counts.\n */\nexport class TreeMeasurer {\n  private readonly registry = createLanguageRegistry();\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.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication);\n    return assembleNativeMetrics(payload, includeSyntaxTree);\n  }\n\n  /** Measures a file and collects its cross-file clone-detection contribution from one parse. */\n  measureWithCrossFileData(\n    code: string,\n    options: MeasureOptions\n  ): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = measureCodeNative(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** measureWithCrossFileData on the native addon's worker threads, for measuring files in parallel. */\n  async measureWithCrossFileDataAsync(\n    code: string,\n    options: MeasureOptions\n  ): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n    const language = this.resolveLanguage(options.language);\n    const includeSyntaxTree = options.includeSyntaxTree ?? false;\n    const payload = await measureCodeNativeAsync(code, language.name, includeSyntaxTree, options.duplication, true);\n    return assembleMetricsWithCrossFileData(payload, includeSyntaxTree);\n  }\n\n  /** Collects one file's duplicate candidates for cross-file clone detection. */\n  collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n    return this.collectCrossFileDuplicationFileData(code, options).candidates;\n  }\n\n  /**\n   * Collects one file's duplicate candidates, normalized tokens, and statement structure for\n   * cross-file clone detection with measureCrossFileDuplication.\n   */\n  collectCrossFileDuplicationFileData(code: string, options: MeasureOptions): CrossFileDuplicationFileData {\n    const language = this.resolveLanguage(options.language);\n    return toCrossFileDuplicationFileData(\n      collectCrossFileDataNative(code, language.name, options.duplication?.minTokens)\n    );\n  }\n\n  /**\n   * Normalized token hash sequences of every function, index-parallel to the functions array of\n   * measure(): identifiers are anonymized by first occurrence within the function, literals by\n   * kind, and keywords/operators kept verbatim.\n   */\n  collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n    const language = this.resolveLanguage(options.language);\n    return collectFunctionTokenSequencesNative(code, language.name);\n  }\n\n  private resolveLanguage(name: LanguageName): LanguageDefinition {\n    const language = this.registry.get(name);\n    if (!language) {\n      throw new Error(`Unsupported language: ${name}`);\n    }\n    return language;\n  }\n}\n\nfunction assembleMetricsWithCrossFileData(\n  payload: NativeMetricsPayload,\n  includeSyntaxTree: boolean\n): { metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData } {\n  if (!payload.crossFileData) {\n    throw new Error('The native addon returned no cross-file duplication data');\n  }\n  return {\n    metrics: assembleNativeMetrics(payload, includeSyntaxTree),\n    crossFileData: toCrossFileDuplicationFileData(payload.crossFileData),\n  };\n}\n\nfunction toCrossFileDuplicationFileData(payload: NativeCrossFileDataPayload): CrossFileDuplicationFileData {\n  return {\n    candidates: payload.candidates,\n    tokens: payload.tokens,\n    containerStatements: payload.containerStatements,\n    nearMissBlocks: payload.nearMissBlocks,\n    // Lets cross-file line coverage count only code lines, like within-file coverage.\n    codeLineNumbers: new Set(payload.codeLineNumbers),\n  };\n}\n\n/**\n * Completes a native measurement into CodeMetrics. The object is rebuilt field by field (rather\n * than spread from the parsed JSON) so the result has a stable shape, including\n * explicitly-undefined optional keys.\n */\nfunction assembleNativeMetrics(payload: NativeMetricsPayload, includeSyntaxTree: boolean): CodeMetrics {\n  return {\n    language: payload.language,\n    bytes: payload.bytes,\n    lines: payload.lines,\n    codeLineNumbers: payload.codeLineNumbers,\n    functions: payload.functions.map((fn) => ({\n      name: fn.name,\n      containerName: fn.containerName,\n      nodeType: fn.nodeType,\n      startLine: fn.startLine,\n      startColumn: fn.startColumn,\n      endLine: fn.endLine,\n      endColumn: fn.endColumn,\n      cyclomaticComplexity: fn.cyclomaticComplexity,\n      cognitiveComplexity: fn.cognitiveComplexity,\n      cognitiveBlocks: fn.cognitiveBlocks ?? [],\n      nestingDepth: fn.nestingDepth,\n      ncss: fn.ncss,\n      parameterCount: fn.parameterCount,\n      halstead: deriveHalsteadMetrics(fn.halsteadCounts),\n      depDegree: fn.depDegree,\n    })),\n    cyclomaticComplexity: payload.cyclomaticComplexity,\n    cognitiveComplexity: payload.cognitiveComplexity,\n    maxCognitiveComplexity: payload.maxCognitiveComplexity,\n    nestingDepth: payload.nestingDepth,\n    ncssCount: payload.ncssCount,\n    duplication: payload.duplication,\n    halstead: deriveHalsteadMetrics(payload.halsteadCounts),\n    syntaxTree: includeSyntaxTree ? payload.syntaxTree : undefined,\n  };\n}\n\nfunction deriveHalsteadMetrics(counts: NativeHalsteadCounts): HalsteadMetrics {\n  const { distinctOperators, distinctOperands, totalOperators, totalOperands } = counts;\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  };\n}\n\nexport const defaultMeasurer = new TreeMeasurer();\n\nexport function measureCode(code: string, options: MeasureOptions): CodeMetrics {\n  return defaultMeasurer.measure(code, options);\n}\n\n/** Standalone helper mirroring TreeMeasurer.measureWithCrossFileDataAsync for the default measurer. */\nexport function measureCodeWithCrossFileDataAsync(\n  code: string,\n  options: MeasureOptions\n): Promise<{ metrics: CodeMetrics; crossFileData: CrossFileDuplicationFileData }> {\n  return defaultMeasurer.measureWithCrossFileDataAsync(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectDuplicationCandidates(code: string, options: MeasureOptions): CrossFileDuplicateCandidate[] {\n  return defaultMeasurer.collectDuplicationCandidates(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectFunctionTokenSequences(code: string, options: MeasureOptions): Int32Array[] {\n  return defaultMeasurer.collectFunctionTokenSequences(code, options);\n}\n\n/** Standalone helper mirroring measureCode for the default measurer. */\nexport function collectCrossFileDuplicationFileData(\n  code: string,\n  options: MeasureOptions\n): CrossFileDuplicationFileData {\n  return defaultMeasurer.collectCrossFileDuplicationFileData(code, options);\n}\n"],"mappings":"oNAkBA,IAAa,EAAb,KAA0B,CACxB,SAA4B,EAAuB,EAEnD,uBAAwC,CACtC,MAAO,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC,CAAC,CAAC,IAAK,GAAa,EAAS,IAAI,CAAC,CAAC,CAClF,CAEA,QAAQ,EAAc,EAAsC,CAC1D,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADS,EAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,WAC/C,EAAG,CAAiB,CACzD,CAGA,yBACE,EACA,EACuE,CACvE,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EADS,EAAkB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EACjD,EAAG,CAAiB,CACpE,CAGA,MAAM,8BACJ,EACA,EACgF,CAChF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EAChD,EAAoB,EAAQ,mBAAqB,GAEvD,OAAO,EAAiC,MADlB,EAAuB,EAAM,EAAS,KAAM,EAAmB,EAAQ,YAAa,EAAI,EAC7D,CAAiB,CACpE,CAGA,6BAA6B,EAAc,EAAwD,CACjG,OAAO,KAAK,oCAAoC,EAAM,CAAO,CAAC,CAAC,UACjE,CAMA,oCAAoC,EAAc,EAAuD,CACvG,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAO,EACL,EAA2B,EAAM,EAAS,KAAM,EAAQ,aAAa,SAAS,CAChF,CACF,CAOA,8BAA8B,EAAc,EAAuC,CACjF,IAAM,EAAW,KAAK,gBAAgB,EAAQ,QAAQ,EACtD,OAAO,EAAoC,EAAM,EAAS,IAAI,CAChE,CAEA,gBAAwB,EAAwC,CAC9D,IAAM,EAAW,KAAK,SAAS,IAAI,CAAI,EACvC,GAAI,CAAC,EACH,MAAU,MAAM,yBAAyB,GAAM,EAEjD,OAAO,CACT,CACF,EAEA,SAAS,EACP,EACA,EACuE,CACvE,GAAI,CAAC,EAAQ,cACX,MAAU,MAAM,0DAA0D,EAE5E,MAAO,CACL,QAAS,EAAsB,EAAS,CAAiB,EACzD,cAAe,EAA+B,EAAQ,aAAa,CACrE,CACF,CAEA,SAAS,EAA+B,EAAmE,CACzG,MAAO,CACL,WAAY,EAAQ,WACpB,OAAQ,EAAQ,OAChB,oBAAqB,EAAQ,oBAC7B,eAAgB,EAAQ,eAExB,gBAAiB,IAAI,IAAI,EAAQ,eAAe,CAClD,CACF,CAOA,SAAS,EAAsB,EAA+B,EAAyC,CACrG,MAAO,CACL,SAAU,EAAQ,SAClB,MAAO,EAAQ,MACf,MAAO,EAAQ,MACf,gBAAiB,EAAQ,gBACzB,UAAW,EAAQ,UAAU,IAAK,IAAQ,CACxC,KAAM,EAAG,KACT,cAAe,EAAG,cAClB,SAAU,EAAG,SACb,UAAW,EAAG,UACd,YAAa,EAAG,YAChB,QAAS,EAAG,QACZ,UAAW,EAAG,UACd,qBAAsB,EAAG,qBACzB,oBAAqB,EAAG,oBACxB,gBAAiB,EAAG,iBAAmB,CAAC,EACxC,aAAc,EAAG,aACjB,KAAM,EAAG,KACT,eAAgB,EAAG,eACnB,SAAU,EAAsB,EAAG,cAAc,EACjD,UAAW,EAAG,SAChB,EAAE,EACF,qBAAsB,EAAQ,qBAC9B,oBAAqB,EAAQ,oBAC7B,uBAAwB,EAAQ,uBAChC,aAAc,EAAQ,aACtB,UAAW,EAAQ,UACnB,YAAa,EAAQ,YACrB,SAAU,EAAsB,EAAQ,cAAc,EACtD,WAAY,EAAoB,EAAQ,WAAa,IAAA,EACvD,CACF,CAEA,SAAS,EAAsB,EAA+C,CAC5E,GAAM,CAAE,oBAAmB,mBAAkB,iBAAgB,iBAAkB,EACzE,EAAa,EAAoB,EACjC,EAAS,EAAiB,EAC1B,EAAS,IAAe,EAAI,EAAI,EAAS,KAAK,KAAK,CAAU,EAC7D,EAAa,IAAqB,EAAI,EAAK,EAAoB,GAAM,EAAgB,GAG3F,MAAO,CACL,oBACA,mBACA,iBACA,gBACA,aACA,SACA,SACA,aACA,OAXa,EAAa,CAY5B,CACF,CAEA,MAAa,EAAkB,IAAI,EAEnC,SAAgB,EAAY,EAAc,EAAsC,CAC9E,OAAO,EAAgB,QAAQ,EAAM,CAAO,CAC9C,CAGA,SAAgB,EACd,EACA,EACgF,CAChF,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EAA6B,EAAc,EAAwD,CACjH,OAAO,EAAgB,6BAA6B,EAAM,CAAO,CACnE,CAGA,SAAgB,EAA8B,EAAc,EAAuC,CACjG,OAAO,EAAgB,8BAA8B,EAAM,CAAO,CACpE,CAGA,SAAgB,EACd,EACA,EAC8B,CAC9B,OAAO,EAAgB,oCAAoC,EAAM,CAAO,CAC1E"}

package/dist/nativeMetrics.cjs

@@ -1,4 +1,4 @@
 "use strict";let e=require("@willbooster/shared-lib");function t(e,t,n,i,a=!1){return JSON.parse(f().measureCodeNative(...r(e,t,n,i,a)))}function n(e,t,n,i,a=!1){return f().measureCodeNativeAsync(...r(e,t,n,i,a)).then(e=>JSON.parse(e))}function r(e,t,n,r,i){return[o(e),t,n,s(r?.minTokens),s(r?.maxGapTokens),s(r?.minSimilarityPercent),i]}function i(e,t,n){return JSON.parse(f().collectCrossFileDataNative(o(e),t,s(n)))}function a(e,t){return JSON.parse(f().collectFunctionTokenSequencesNative(o(e),t)).map(e=>Int32Array.from(e))}function o(e){return e.isWellFormed()?e:e.toWellFormed()}function s(t){return t===void 0||Number.isNaN(t)?void 0:(0,e.clamp)(Math.trunc(t),0,4294967295)}var c=class extends Error{};let l,u;function d(e){l=e}function f(){if(l)return l;if(u)throw u;let t=process.getBuiltinModule(`node:module`).createRequire(require("url").pathToFileURL(__filename).href),n=[`code-gauge-${p()}`,`../native/code-gauge.node`],r=[];for(let i of n){let n;try{n=t(i)}catch(t){r.push(`  ${i}: ${(0,e.getErrorMessage)(t).split(`
-`)[0]}`);continue}let a=n.payloadVersion?.();if(a!==8){r.push(`  ${i}: payload version ${a??`unknown`} does not match the expected 8; rebuild the addon with \`bun run build-native\``);continue}return l=n,n}throw u=new c(`The code-gauge native addon is not available for ${p()}. Build it with \`node scripts/buildNative.mjs\` in the code-gauge package directory (requires a Rust toolchain).\n${r.join(`
+`)[0]}`);continue}let a=n.payloadVersion?.();if(a!==12){r.push(`  ${i}: payload version ${a??`unknown`} does not match the expected 12; rebuild the addon with \`bun run build-native\``);continue}return l=n,n}throw u=new c(`The code-gauge native addon is not available for ${p()}. Build it with \`node scripts/buildNative.mjs\` in the code-gauge package directory (requires a Rust toolchain).\n${r.join(`
 `)}`),u}function p(){let e=`${process.platform}-${process.arch}`;return process.platform===`win32`?`${e}-msvc`:process.platform===`linux`?(process.report?.getReport())?.header?.glibcVersionRuntime?`${e}-gnu`:`${e}-musl`:e}exports.NativeAddonError=c,exports.collectCrossFileDataNative=i,exports.collectFunctionTokenSequencesNative=a,exports.measureCodeNative=t,exports.measureCodeNativeAsync=n,exports.setNativeBinding=d;
 //# sourceMappingURL=nativeMetrics.cjs.map

package/dist/nativeMetrics.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"nativeMetrics.cjs","names":["clamp","getErrorMessage"],"sources":["../src/nativeMetrics.ts"],"sourcesContent":["import { clamp, getErrorMessage } from '@willbooster/shared-lib';\nimport type { CrossFileDuplicateCandidate, Token, TokenRange } from './duplication.js';\nimport type { CodeMetrics, DuplicationOptions, FunctionMetrics } from './types.js';\n\n/**\n * Halstead counts measured natively; the derived float metrics (volume, effort, ...) are\n * computed in TypeScript because they involve transcendental functions (log2) whose last-bit\n * results can differ between V8 and Rust's libm, and results must not depend on the Rust side's\n * libm build.\n */\nexport interface NativeHalsteadCounts {\n  distinctOperators: number;\n  distinctOperands: number;\n  totalOperators: number;\n  totalOperands: number;\n}\n\nexport interface NativeFunctionMetricsPayload extends Omit<FunctionMetrics, 'halstead'> {\n  halsteadCounts: NativeHalsteadCounts;\n}\n\nexport interface NativeMetricsPayload extends Omit<CodeMetrics, 'halstead' | 'functions' | 'syntaxTree'> {\n  functions: NativeFunctionMetricsPayload[];\n  halsteadCounts: NativeHalsteadCounts;\n  syntaxTree?: string;\n  crossFileData?: NativeCrossFileDataPayload;\n}\n\n/** One file's cross-file clone-detection contribution as serialized by the native addon. */\nexport interface NativeCrossFileDataPayload {\n  candidates: CrossFileDuplicateCandidate[];\n  tokens: Token[];\n  containerStatements: TokenRange[][];\n  nearMissBlocks: TokenRange[];\n  /** 1-based lines that are neither blank nor comment-only, sorted ascending. */\n  codeLineNumbers: number[];\n}\n\ntype NativeMeasureArguments = [\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  minTokens: number | undefined,\n  maxGapTokens: number | undefined,\n  minSimilarityPercent: number | undefined,\n  includeCrossFileData: boolean,\n];\n\nexport interface NativeBinding {\n  measureCodeNative(...args: NativeMeasureArguments): string;\n  measureCodeNativeAsync(...args: NativeMeasureArguments): Promise<string>;\n  collectCrossFileDataNative(code: string, language: string, minTokens?: number): string;\n  collectFunctionTokenSequencesNative(code: string, language: string): string;\n  payloadVersion?(): number;\n}\n\n/**\n * Must equal `payload_version` in native/src/lib.rs. A previously built addon survives a\n * `git pull` untouched, so without this handshake it would silently return payloads missing\n * newer fields, or lack newer binding functions, instead of failing with a clear rebuild message.\n */\nexport const expectedPayloadVersion = 8;\n\n/**\n * Measures one file via the native addon, returning the raw payload for assembly in metrics.ts;\n * with `includeCrossFileData`, the payload also carries the file's cross-file contribution.\n */\nexport function measureCodeNative(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication?: DuplicationOptions,\n  includeCrossFileData = false\n): NativeMetricsPayload {\n  return JSON.parse(\n    loadBinding().measureCodeNative(\n      ...toNativeMeasureArguments(code, language, includeSyntaxTree, duplication, includeCrossFileData)\n    )\n  ) as NativeMetricsPayload;\n}\n\n/**\n * measureCodeNative on the addon's worker threads, so several files can be measured in parallel.\n * A missing addon still throws synchronously, like measureCodeNative.\n */\nexport function measureCodeNativeAsync(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication?: DuplicationOptions,\n  includeCrossFileData = false\n): Promise<NativeMetricsPayload> {\n  return loadBinding()\n    .measureCodeNativeAsync(\n      ...toNativeMeasureArguments(code, language, includeSyntaxTree, duplication, includeCrossFileData)\n    )\n    .then((json) => JSON.parse(json) as NativeMetricsPayload);\n}\n\n/** The binding arguments shared by the sync and async measurements, so both measure alike. */\nfunction toNativeMeasureArguments(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication: DuplicationOptions | undefined,\n  includeCrossFileData: boolean\n): NativeMeasureArguments {\n  return [\n    toWellFormed(code),\n    language,\n    includeSyntaxTree,\n    clampToU32(duplication?.minTokens),\n    clampToU32(duplication?.maxGapTokens),\n    clampToU32(duplication?.minSimilarityPercent),\n    includeCrossFileData,\n  ];\n}\n\n/** Collects one file's cross-file clone-detection contribution via the native addon. */\nexport function collectCrossFileDataNative(\n  code: string,\n  language: string,\n  minTokens?: number\n): NativeCrossFileDataPayload {\n  return JSON.parse(\n    loadBinding().collectCrossFileDataNative(toWellFormed(code), language, clampToU32(minTokens))\n  ) as NativeCrossFileDataPayload;\n}\n\n/** Collects normalized token hash sequences of every function via the native addon. */\nexport function collectFunctionTokenSequencesNative(code: string, language: string): Int32Array[] {\n  const sequences = JSON.parse(\n    loadBinding().collectFunctionTokenSequencesNative(toWellFormed(code), language)\n  ) as number[][];\n  return sequences.map((sequence) => Int32Array.from(sequence));\n}\n\n/**\n * Lone surrogates cannot cross the N-API boundary losslessly, so ill-formed strings (invalid\n * UTF-16 occasionally present in real-world files) are measured with U+FFFD replacements — the\n * same code units V8's own UTF-8 conversion would substitute.\n */\nfunction toWellFormed(code: string): string {\n  return code.isWellFormed() ? code : code.toWellFormed();\n}\n\n/**\n * The duplication settings cross the boundary as u32, whose JavaScript conversion wraps modulo\n * 2^32 (2 ** 32 would become 0 and match everything). The public API accepts any safe integer, so\n * out-of-range values clamp to [0, u32::MAX] — no source can hold 2^32 tokens, so a clamped\n * threshold behaves identically to the requested one. NaN (e.g. `Number(unsetEnvVariable)`)\n * survives clamping arithmetic and would also convert to 0, so it is treated as an absent setting\n * instead.\n */\nfunction clampToU32(value: number | undefined): number | undefined {\n  return value === undefined || Number.isNaN(value) ? undefined : clamp(Math.trunc(value), 0, 0xFF_FF_FF_FF);\n}\n\n/**\n * Raised when no usable native addon can be loaded. Every measurement fails identically until the\n * addon is built, so callers measuring many files (the CLI scan) treat it as fatal for the whole\n * run instead of recording one \"skipped\" entry per file.\n */\nexport class NativeAddonError extends Error {}\n\nlet cachedBinding: NativeBinding | undefined;\nlet cachedFailure: NativeAddonError | undefined;\n\n/** Replaces the N-API addon, e.g. with the WebAssembly build on runtimes without N-API. */\nexport function setNativeBinding(binding: NativeBinding): void {\n  cachedBinding = binding;\n}\n\nfunction loadBinding(): NativeBinding {\n  if (cachedBinding) {\n    return cachedBinding;\n  }\n  // The failure is memoized too: resolution (including platformTriplet's diagnostic-report call\n  // on Linux) would otherwise repeat for every measured file of an already-failing run.\n  if (cachedFailure) {\n    throw cachedFailure;\n  }\n  // Resolved relative to this file, so both src/ (tests) and dist/ (build) find the addon.\n  // node:module is loaded lazily so that runtimes without it can bundle this module.\n  const requireNative = process.getBuiltinModule('node:module').createRequire(import.meta.url);\n  const specifiers = [\n    // A prebuilt platform package, when published for this platform.\n    `code-gauge-${platformTriplet()}`,\n    // A locally built addon (`bun run build-native`).\n    '../native/code-gauge.node',\n  ];\n  const failures: string[] = [];\n  for (const specifier of specifiers) {\n    let binding: NativeBinding;\n    try {\n      binding = requireNative(specifier) as NativeBinding;\n    } catch (error) {\n      failures.push(`  ${specifier}: ${getErrorMessage(error).split('\\n')[0]}`);\n      continue;\n    }\n    const version = binding.payloadVersion?.();\n    if (version !== expectedPayloadVersion) {\n      failures.push(\n        `  ${specifier}: payload version ${version ?? 'unknown'} does not match the expected ` +\n          `${expectedPayloadVersion}; rebuild the addon with \\`bun run build-native\\``\n      );\n      continue;\n    }\n    cachedBinding = binding;\n    return binding;\n  }\n  cachedFailure = new NativeAddonError(\n    `The code-gauge native addon is not available for ${platformTriplet()}. Build it with ` +\n      '`node scripts/buildNative.mjs` in the code-gauge package directory (requires a Rust ' +\n      `toolchain).\\n${failures.join('\\n')}`\n  );\n  throw cachedFailure;\n}\n\n/**\n * The platform-package suffix in the napi-rs naming convention: Linux targets are qualified by\n * libc ABI (`linux-x64-gnu` / `linux-x64-musl`) because a glibc-linked addon cannot load on\n * Alpine/musl, and Windows by toolchain ABI (`win32-x64-msvc`), matching what napi-rs tooling\n * generates. Must match scripts/installNative.mjs and the build-native workflow's target list.\n */\nfunction platformTriplet(): string {\n  const base = `${process.platform}-${process.arch}`;\n  if (process.platform === 'win32') {\n    return `${base}-msvc`;\n  }\n  if (process.platform !== 'linux') {\n    return base;\n  }\n  // Musl builds of Node report no glibc runtime version; see napi-rs's isMusl detection.\n  const report = process.report?.getReport() as { header?: { glibcVersionRuntime?: string } } | undefined;\n  return report?.header?.glibcVersionRuntime ? `${base}-gnu` : `${base}-musl`;\n}\n"],"mappings":"sDAmEA,SAAgB,EACd,EACA,EACA,EACA,EACA,EAAuB,GACD,CACtB,OAAO,KAAK,MACV,EAAY,CAAC,CAAC,kBACZ,GAAG,EAAyB,EAAM,EAAU,EAAmB,EAAa,CAAoB,CAClG,CACF,CACF,CAMA,SAAgB,EACd,EACA,EACA,EACA,EACA,EAAuB,GACQ,CAC/B,OAAO,EAAY,CAAC,CACjB,uBACC,GAAG,EAAyB,EAAM,EAAU,EAAmB,EAAa,CAAoB,CAClG,CAAC,CACA,KAAM,GAAS,KAAK,MAAM,CAAI,CAAyB,CAC5D,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACwB,CACxB,MAAO,CACL,EAAa,CAAI,EACjB,EACA,EACA,EAAW,GAAa,SAAS,EACjC,EAAW,GAAa,YAAY,EACpC,EAAW,GAAa,oBAAoB,EAC5C,CACF,CACF,CAGA,SAAgB,EACd,EACA,EACA,EAC4B,CAC5B,OAAO,KAAK,MACV,EAAY,CAAC,CAAC,2BAA2B,EAAa,CAAI,EAAG,EAAU,EAAW,CAAS,CAAC,CAC9F,CACF,CAGA,SAAgB,EAAoC,EAAc,EAAgC,CAIhG,OAHkB,KAAK,MACrB,EAAY,CAAC,CAAC,oCAAoC,EAAa,CAAI,EAAG,CAAQ,CAEjE,CAAC,CAAC,IAAK,GAAa,WAAW,KAAK,CAAQ,CAAC,CAC9D,CAOA,SAAS,EAAa,EAAsB,CAC1C,OAAO,EAAK,aAAa,EAAI,EAAO,EAAK,aAAa,CACxD,CAUA,SAAS,EAAW,EAA+C,CACjE,OAAO,IAAU,IAAA,IAAa,OAAO,MAAM,CAAK,EAAI,IAAA,IAAA,EAAYA,EAAAA,MAAAA,CAAM,KAAK,MAAM,CAAK,EAAG,EAAG,UAAa,CAC3G,CAOA,IAAa,EAAb,cAAsC,KAAM,CAAC,EAE7C,IAAI,EACA,EAGJ,SAAgB,EAAiB,EAA8B,CAC7D,EAAgB,CAClB,CAEA,SAAS,GAA6B,CACpC,GAAI,EACF,OAAO,EAIT,GAAI,EACF,MAAM,EAIR,IAAM,EAAgB,QAAQ,iBAAiB,aAAa,CAAC,CAAC,cAAA,QAAA,KAAA,CAAA,CAAA,cAAA,UAAA,CAAA,CAAA,IAA6B,EACrF,EAAa,CAEjB,cAAc,EAAgB,IAE9B,2BACF,EACM,EAAqB,CAAC,EAC5B,IAAK,IAAM,KAAa,EAAY,CAClC,IAAI,EACJ,GAAI,CACF,EAAU,EAAc,CAAS,CACnC,OAAS,EAAO,CACd,EAAS,KAAK,KAAK,EAAU,KAAA,EAAIC,EAAAA,gBAAAA,CAAgB,CAAK,CAAC,CAAC,MAAM;CAAI,CAAC,CAAC,IAAI,EACxE,QACF,CACA,IAAM,EAAU,EAAQ,iBAAiB,EACzC,GAAI,IAAA,EAAoC,CACtC,EAAS,KACP,KAAK,EAAU,oBAAoB,GAAW,UAAU,gFAE1D,EACA,QACF,CAEA,MADA,GAAgB,EACT,CACT,CAMA,KALA,GAAgB,IAAI,EAClB,oDAAoD,EAAgB,EAAE,qHAEpD,EAAS,KAAK;CAAI,GACtC,EACM,CACR,CAQA,SAAS,GAA0B,CACjC,IAAM,EAAO,GAAG,QAAQ,SAAS,GAAG,QAAQ,OAS5C,OARI,QAAQ,WAAa,QAChB,GAAG,EAAK,OAEb,QAAQ,WAAa,SAIV,QAAQ,QAAQ,UAAU,EAAA,EAC1B,QAAQ,oBAAsB,GAAG,EAAK,MAAQ,GAAG,EAAK,OAJ5D,CAKX"}
+{"version":3,"file":"nativeMetrics.cjs","names":["clamp","getErrorMessage"],"sources":["../src/nativeMetrics.ts"],"sourcesContent":["import { clamp, getErrorMessage } from '@willbooster/shared-lib';\nimport type { CrossFileDuplicateCandidate, Token, TokenRange } from './duplication.js';\nimport type { CodeMetrics, DuplicationOptions, FunctionMetrics } from './types.js';\n\n/**\n * Halstead counts measured natively; the derived float metrics (volume, effort, ...) are\n * computed in TypeScript because they involve transcendental functions (log2) whose last-bit\n * results can differ between V8 and Rust's libm, and results must not depend on the Rust side's\n * libm build.\n */\nexport interface NativeHalsteadCounts {\n  distinctOperators: number;\n  distinctOperands: number;\n  totalOperators: number;\n  totalOperands: number;\n}\n\nexport interface NativeFunctionMetricsPayload extends Omit<FunctionMetrics, 'halstead' | 'cognitiveBlocks'> {\n  /** Absent when the function has none. */\n  cognitiveBlocks?: FunctionMetrics['cognitiveBlocks'];\n  halsteadCounts: NativeHalsteadCounts;\n}\n\nexport interface NativeMetricsPayload extends Omit<CodeMetrics, 'halstead' | 'functions' | 'syntaxTree'> {\n  functions: NativeFunctionMetricsPayload[];\n  halsteadCounts: NativeHalsteadCounts;\n  syntaxTree?: string;\n  crossFileData?: NativeCrossFileDataPayload;\n}\n\n/** One file's cross-file clone-detection contribution as serialized by the native addon. */\nexport interface NativeCrossFileDataPayload {\n  candidates: CrossFileDuplicateCandidate[];\n  tokens: Token[];\n  containerStatements: TokenRange[][];\n  nearMissBlocks: TokenRange[];\n  /** 1-based lines that are neither blank nor comment-only, sorted ascending. */\n  codeLineNumbers: number[];\n}\n\ntype NativeMeasureArguments = [\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  minTokens: number | undefined,\n  maxGapTokens: number | undefined,\n  minSimilarityPercent: number | undefined,\n  includeCrossFileData: boolean,\n];\n\nexport interface NativeBinding {\n  measureCodeNative(...args: NativeMeasureArguments): string;\n  measureCodeNativeAsync(...args: NativeMeasureArguments): Promise<string>;\n  collectCrossFileDataNative(code: string, language: string, minTokens?: number): string;\n  collectFunctionTokenSequencesNative(code: string, language: string): string;\n  payloadVersion?(): number;\n}\n\n/**\n * Must equal `payload_version` in native/src/lib.rs. A previously built addon survives a\n * `git pull` untouched, so without this handshake it would silently return payloads missing\n * newer fields, or lack newer binding functions, instead of failing with a clear rebuild message.\n */\nexport const expectedPayloadVersion = 12;\n\n/**\n * Measures one file via the native addon, returning the raw payload for assembly in metrics.ts;\n * with `includeCrossFileData`, the payload also carries the file's cross-file contribution.\n */\nexport function measureCodeNative(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication?: DuplicationOptions,\n  includeCrossFileData = false\n): NativeMetricsPayload {\n  return JSON.parse(\n    loadBinding().measureCodeNative(\n      ...toNativeMeasureArguments(code, language, includeSyntaxTree, duplication, includeCrossFileData)\n    )\n  ) as NativeMetricsPayload;\n}\n\n/**\n * measureCodeNative on the addon's worker threads, so several files can be measured in parallel.\n * A missing addon still throws synchronously, like measureCodeNative.\n */\nexport function measureCodeNativeAsync(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication?: DuplicationOptions,\n  includeCrossFileData = false\n): Promise<NativeMetricsPayload> {\n  return loadBinding()\n    .measureCodeNativeAsync(\n      ...toNativeMeasureArguments(code, language, includeSyntaxTree, duplication, includeCrossFileData)\n    )\n    .then((json) => JSON.parse(json) as NativeMetricsPayload);\n}\n\n/** The binding arguments shared by the sync and async measurements, so both measure alike. */\nfunction toNativeMeasureArguments(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication: DuplicationOptions | undefined,\n  includeCrossFileData: boolean\n): NativeMeasureArguments {\n  return [\n    toWellFormed(code),\n    language,\n    includeSyntaxTree,\n    clampToU32(duplication?.minTokens),\n    clampToU32(duplication?.maxGapTokens),\n    clampToU32(duplication?.minSimilarityPercent),\n    includeCrossFileData,\n  ];\n}\n\n/** Collects one file's cross-file clone-detection contribution via the native addon. */\nexport function collectCrossFileDataNative(\n  code: string,\n  language: string,\n  minTokens?: number\n): NativeCrossFileDataPayload {\n  return JSON.parse(\n    loadBinding().collectCrossFileDataNative(toWellFormed(code), language, clampToU32(minTokens))\n  ) as NativeCrossFileDataPayload;\n}\n\n/** Collects normalized token hash sequences of every function via the native addon. */\nexport function collectFunctionTokenSequencesNative(code: string, language: string): Int32Array[] {\n  const sequences = JSON.parse(\n    loadBinding().collectFunctionTokenSequencesNative(toWellFormed(code), language)\n  ) as number[][];\n  return sequences.map((sequence) => Int32Array.from(sequence));\n}\n\n/**\n * Lone surrogates cannot cross the N-API boundary losslessly, so ill-formed strings (invalid\n * UTF-16 occasionally present in real-world files) are measured with U+FFFD replacements — the\n * same code units V8's own UTF-8 conversion would substitute.\n */\nfunction toWellFormed(code: string): string {\n  return code.isWellFormed() ? code : code.toWellFormed();\n}\n\n/**\n * The duplication settings cross the boundary as u32, whose JavaScript conversion wraps modulo\n * 2^32 (2 ** 32 would become 0 and match everything). The public API accepts any safe integer, so\n * out-of-range values clamp to [0, u32::MAX] — no source can hold 2^32 tokens, so a clamped\n * threshold behaves identically to the requested one. NaN (e.g. `Number(unsetEnvVariable)`)\n * survives clamping arithmetic and would also convert to 0, so it is treated as an absent setting\n * instead.\n */\nfunction clampToU32(value: number | undefined): number | undefined {\n  return value === undefined || Number.isNaN(value) ? undefined : clamp(Math.trunc(value), 0, 0xFF_FF_FF_FF);\n}\n\n/**\n * Raised when no usable native addon can be loaded. Every measurement fails identically until the\n * addon is built, so callers measuring many files (the CLI scan) treat it as fatal for the whole\n * run instead of recording one \"skipped\" entry per file.\n */\nexport class NativeAddonError extends Error {}\n\nlet cachedBinding: NativeBinding | undefined;\nlet cachedFailure: NativeAddonError | undefined;\n\n/** Replaces the N-API addon, e.g. with the WebAssembly build on runtimes without N-API. */\nexport function setNativeBinding(binding: NativeBinding): void {\n  cachedBinding = binding;\n}\n\nfunction loadBinding(): NativeBinding {\n  if (cachedBinding) {\n    return cachedBinding;\n  }\n  // The failure is memoized too: resolution (including platformTriplet's diagnostic-report call\n  // on Linux) would otherwise repeat for every measured file of an already-failing run.\n  if (cachedFailure) {\n    throw cachedFailure;\n  }\n  // Resolved relative to this file, so both src/ (tests) and dist/ (build) find the addon.\n  // node:module is loaded lazily so that runtimes without it can bundle this module.\n  const requireNative = process.getBuiltinModule('node:module').createRequire(import.meta.url);\n  const specifiers = [\n    // A prebuilt platform package, when published for this platform.\n    `code-gauge-${platformTriplet()}`,\n    // A locally built addon (`bun run build-native`).\n    '../native/code-gauge.node',\n  ];\n  const failures: string[] = [];\n  for (const specifier of specifiers) {\n    let binding: NativeBinding;\n    try {\n      binding = requireNative(specifier) as NativeBinding;\n    } catch (error) {\n      failures.push(`  ${specifier}: ${getErrorMessage(error).split('\\n')[0]}`);\n      continue;\n    }\n    const version = binding.payloadVersion?.();\n    if (version !== expectedPayloadVersion) {\n      failures.push(\n        `  ${specifier}: payload version ${version ?? 'unknown'} does not match the expected ` +\n          `${expectedPayloadVersion}; rebuild the addon with \\`bun run build-native\\``\n      );\n      continue;\n    }\n    cachedBinding = binding;\n    return binding;\n  }\n  cachedFailure = new NativeAddonError(\n    `The code-gauge native addon is not available for ${platformTriplet()}. Build it with ` +\n      '`node scripts/buildNative.mjs` in the code-gauge package directory (requires a Rust ' +\n      `toolchain).\\n${failures.join('\\n')}`\n  );\n  throw cachedFailure;\n}\n\n/**\n * The platform-package suffix in the napi-rs naming convention: Linux targets are qualified by\n * libc ABI (`linux-x64-gnu` / `linux-x64-musl`) because a glibc-linked addon cannot load on\n * Alpine/musl, and Windows by toolchain ABI (`win32-x64-msvc`), matching what napi-rs tooling\n * generates. Must match scripts/installNative.mjs and the build-native workflow's target list.\n */\nfunction platformTriplet(): string {\n  const base = `${process.platform}-${process.arch}`;\n  if (process.platform === 'win32') {\n    return `${base}-msvc`;\n  }\n  if (process.platform !== 'linux') {\n    return base;\n  }\n  // Musl builds of Node report no glibc runtime version; see napi-rs's isMusl detection.\n  const report = process.report?.getReport() as { header?: { glibcVersionRuntime?: string } } | undefined;\n  return report?.header?.glibcVersionRuntime ? `${base}-gnu` : `${base}-musl`;\n}\n"],"mappings":"sDAqEA,SAAgB,EACd,EACA,EACA,EACA,EACA,EAAuB,GACD,CACtB,OAAO,KAAK,MACV,EAAY,CAAC,CAAC,kBACZ,GAAG,EAAyB,EAAM,EAAU,EAAmB,EAAa,CAAoB,CAClG,CACF,CACF,CAMA,SAAgB,EACd,EACA,EACA,EACA,EACA,EAAuB,GACQ,CAC/B,OAAO,EAAY,CAAC,CACjB,uBACC,GAAG,EAAyB,EAAM,EAAU,EAAmB,EAAa,CAAoB,CAClG,CAAC,CACA,KAAM,GAAS,KAAK,MAAM,CAAI,CAAyB,CAC5D,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACwB,CACxB,MAAO,CACL,EAAa,CAAI,EACjB,EACA,EACA,EAAW,GAAa,SAAS,EACjC,EAAW,GAAa,YAAY,EACpC,EAAW,GAAa,oBAAoB,EAC5C,CACF,CACF,CAGA,SAAgB,EACd,EACA,EACA,EAC4B,CAC5B,OAAO,KAAK,MACV,EAAY,CAAC,CAAC,2BAA2B,EAAa,CAAI,EAAG,EAAU,EAAW,CAAS,CAAC,CAC9F,CACF,CAGA,SAAgB,EAAoC,EAAc,EAAgC,CAIhG,OAHkB,KAAK,MACrB,EAAY,CAAC,CAAC,oCAAoC,EAAa,CAAI,EAAG,CAAQ,CAEjE,CAAC,CAAC,IAAK,GAAa,WAAW,KAAK,CAAQ,CAAC,CAC9D,CAOA,SAAS,EAAa,EAAsB,CAC1C,OAAO,EAAK,aAAa,EAAI,EAAO,EAAK,aAAa,CACxD,CAUA,SAAS,EAAW,EAA+C,CACjE,OAAO,IAAU,IAAA,IAAa,OAAO,MAAM,CAAK,EAAI,IAAA,IAAA,EAAYA,EAAAA,MAAAA,CAAM,KAAK,MAAM,CAAK,EAAG,EAAG,UAAa,CAC3G,CAOA,IAAa,EAAb,cAAsC,KAAM,CAAC,EAE7C,IAAI,EACA,EAGJ,SAAgB,EAAiB,EAA8B,CAC7D,EAAgB,CAClB,CAEA,SAAS,GAA6B,CACpC,GAAI,EACF,OAAO,EAIT,GAAI,EACF,MAAM,EAIR,IAAM,EAAgB,QAAQ,iBAAiB,aAAa,CAAC,CAAC,cAAA,QAAA,KAAA,CAAA,CAAA,cAAA,UAAA,CAAA,CAAA,IAA6B,EACrF,EAAa,CAEjB,cAAc,EAAgB,IAE9B,2BACF,EACM,EAAqB,CAAC,EAC5B,IAAK,IAAM,KAAa,EAAY,CAClC,IAAI,EACJ,GAAI,CACF,EAAU,EAAc,CAAS,CACnC,OAAS,EAAO,CACd,EAAS,KAAK,KAAK,EAAU,KAAA,EAAIC,EAAAA,gBAAAA,CAAgB,CAAK,CAAC,CAAC,MAAM;CAAI,CAAC,CAAC,IAAI,EACxE,QACF,CACA,IAAM,EAAU,EAAQ,iBAAiB,EACzC,GAAI,IAAA,GAAoC,CACtC,EAAS,KACP,KAAK,EAAU,oBAAoB,GAAW,UAAU,iFAE1D,EACA,QACF,CAEA,MADA,GAAgB,EACT,CACT,CAMA,KALA,GAAgB,IAAI,EAClB,oDAAoD,EAAgB,EAAE,qHAEpD,EAAS,KAAK;CAAI,GACtC,EACM,CACR,CAQA,SAAS,GAA0B,CACjC,IAAM,EAAO,GAAG,QAAQ,SAAS,GAAG,QAAQ,OAS5C,OARI,QAAQ,WAAa,QAChB,GAAG,EAAK,OAEb,QAAQ,WAAa,SAIV,QAAQ,QAAQ,UAAU,EAAA,EAC1B,QAAQ,oBAAsB,GAAG,EAAK,MAAQ,GAAG,EAAK,OAJ5D,CAKX"}

package/dist/nativeMetrics.d.ts

@@ -12,7 +12,9 @@ export interface NativeHalsteadCounts {
     totalOperators: number;
     totalOperands: number;
 }
-export interface NativeFunctionMetricsPayload extends Omit<FunctionMetrics, 'halstead'> {
+export interface NativeFunctionMetricsPayload extends Omit<FunctionMetrics, 'halstead' | 'cognitiveBlocks'> {
+    /** Absent when the function has none. */
+    cognitiveBlocks?: FunctionMetrics['cognitiveBlocks'];
     halsteadCounts: NativeHalsteadCounts;
 }
 export interface NativeMetricsPayload extends Omit<CodeMetrics, 'halstead' | 'functions' | 'syntaxTree'> {
@@ -51,7 +53,7 @@ export interface NativeBinding {
  * `git pull` untouched, so without this handshake it would silently return payloads missing
  * newer fields, or lack newer binding functions, instead of failing with a clear rebuild message.
  */
-export declare const expectedPayloadVersion = 8;
+export declare const expectedPayloadVersion = 12;
 /**
  * Measures one file via the native addon, returning the raw payload for assembly in metrics.ts;
  * with `includeCrossFileData`, the payload also carries the file's cross-file contribution.

package/dist/nativeMetrics.js

@@ -1,4 +1,4 @@
 import{clamp as e,getErrorMessage as t}from"@willbooster/shared-lib";function n(e,t,n,r,a=!1){return JSON.parse(p().measureCodeNative(...i(e,t,n,r,a)))}function r(e,t,n,r,a=!1){return p().measureCodeNativeAsync(...i(e,t,n,r,a)).then(e=>JSON.parse(e))}function i(e,t,n,r,i){return[s(e),t,n,c(r?.minTokens),c(r?.maxGapTokens),c(r?.minSimilarityPercent),i]}function a(e,t,n){return JSON.parse(p().collectCrossFileDataNative(s(e),t,c(n)))}function o(e,t){return JSON.parse(p().collectFunctionTokenSequencesNative(s(e),t)).map(e=>Int32Array.from(e))}function s(e){return e.isWellFormed()?e:e.toWellFormed()}function c(t){return t===void 0||Number.isNaN(t)?void 0:e(Math.trunc(t),0,4294967295)}var l=class extends Error{};let u,d;function f(e){u=e}function p(){if(u)return u;if(d)throw d;let e=process.getBuiltinModule(`node:module`).createRequire(import.meta.url),n=[`code-gauge-${m()}`,`../native/code-gauge.node`],r=[];for(let i of n){let n;try{n=e(i)}catch(e){r.push(`  ${i}: ${t(e).split(`
-`)[0]}`);continue}let a=n.payloadVersion?.();if(a!==8){r.push(`  ${i}: payload version ${a??`unknown`} does not match the expected 8; rebuild the addon with \`bun run build-native\``);continue}return u=n,n}throw d=new l(`The code-gauge native addon is not available for ${m()}. Build it with \`node scripts/buildNative.mjs\` in the code-gauge package directory (requires a Rust toolchain).\n${r.join(`
+`)[0]}`);continue}let a=n.payloadVersion?.();if(a!==12){r.push(`  ${i}: payload version ${a??`unknown`} does not match the expected 12; rebuild the addon with \`bun run build-native\``);continue}return u=n,n}throw d=new l(`The code-gauge native addon is not available for ${m()}. Build it with \`node scripts/buildNative.mjs\` in the code-gauge package directory (requires a Rust toolchain).\n${r.join(`
 `)}`),d}function m(){let e=`${process.platform}-${process.arch}`;return process.platform===`win32`?`${e}-msvc`:process.platform===`linux`?(process.report?.getReport())?.header?.glibcVersionRuntime?`${e}-gnu`:`${e}-musl`:e}export{l as NativeAddonError,a as collectCrossFileDataNative,o as collectFunctionTokenSequencesNative,n as measureCodeNative,r as measureCodeNativeAsync,f as setNativeBinding};
 //# sourceMappingURL=nativeMetrics.js.map

package/dist/nativeMetrics.js.map

@@ -1 +1 @@
-{"version":3,"file":"nativeMetrics.js","names":[],"sources":["../src/nativeMetrics.ts"],"sourcesContent":["import { clamp, getErrorMessage } from '@willbooster/shared-lib';\nimport type { CrossFileDuplicateCandidate, Token, TokenRange } from './duplication.js';\nimport type { CodeMetrics, DuplicationOptions, FunctionMetrics } from './types.js';\n\n/**\n * Halstead counts measured natively; the derived float metrics (volume, effort, ...) are\n * computed in TypeScript because they involve transcendental functions (log2) whose last-bit\n * results can differ between V8 and Rust's libm, and results must not depend on the Rust side's\n * libm build.\n */\nexport interface NativeHalsteadCounts {\n  distinctOperators: number;\n  distinctOperands: number;\n  totalOperators: number;\n  totalOperands: number;\n}\n\nexport interface NativeFunctionMetricsPayload extends Omit<FunctionMetrics, 'halstead'> {\n  halsteadCounts: NativeHalsteadCounts;\n}\n\nexport interface NativeMetricsPayload extends Omit<CodeMetrics, 'halstead' | 'functions' | 'syntaxTree'> {\n  functions: NativeFunctionMetricsPayload[];\n  halsteadCounts: NativeHalsteadCounts;\n  syntaxTree?: string;\n  crossFileData?: NativeCrossFileDataPayload;\n}\n\n/** One file's cross-file clone-detection contribution as serialized by the native addon. */\nexport interface NativeCrossFileDataPayload {\n  candidates: CrossFileDuplicateCandidate[];\n  tokens: Token[];\n  containerStatements: TokenRange[][];\n  nearMissBlocks: TokenRange[];\n  /** 1-based lines that are neither blank nor comment-only, sorted ascending. */\n  codeLineNumbers: number[];\n}\n\ntype NativeMeasureArguments = [\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  minTokens: number | undefined,\n  maxGapTokens: number | undefined,\n  minSimilarityPercent: number | undefined,\n  includeCrossFileData: boolean,\n];\n\nexport interface NativeBinding {\n  measureCodeNative(...args: NativeMeasureArguments): string;\n  measureCodeNativeAsync(...args: NativeMeasureArguments): Promise<string>;\n  collectCrossFileDataNative(code: string, language: string, minTokens?: number): string;\n  collectFunctionTokenSequencesNative(code: string, language: string): string;\n  payloadVersion?(): number;\n}\n\n/**\n * Must equal `payload_version` in native/src/lib.rs. A previously built addon survives a\n * `git pull` untouched, so without this handshake it would silently return payloads missing\n * newer fields, or lack newer binding functions, instead of failing with a clear rebuild message.\n */\nexport const expectedPayloadVersion = 8;\n\n/**\n * Measures one file via the native addon, returning the raw payload for assembly in metrics.ts;\n * with `includeCrossFileData`, the payload also carries the file's cross-file contribution.\n */\nexport function measureCodeNative(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication?: DuplicationOptions,\n  includeCrossFileData = false\n): NativeMetricsPayload {\n  return JSON.parse(\n    loadBinding().measureCodeNative(\n      ...toNativeMeasureArguments(code, language, includeSyntaxTree, duplication, includeCrossFileData)\n    )\n  ) as NativeMetricsPayload;\n}\n\n/**\n * measureCodeNative on the addon's worker threads, so several files can be measured in parallel.\n * A missing addon still throws synchronously, like measureCodeNative.\n */\nexport function measureCodeNativeAsync(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication?: DuplicationOptions,\n  includeCrossFileData = false\n): Promise<NativeMetricsPayload> {\n  return loadBinding()\n    .measureCodeNativeAsync(\n      ...toNativeMeasureArguments(code, language, includeSyntaxTree, duplication, includeCrossFileData)\n    )\n    .then((json) => JSON.parse(json) as NativeMetricsPayload);\n}\n\n/** The binding arguments shared by the sync and async measurements, so both measure alike. */\nfunction toNativeMeasureArguments(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication: DuplicationOptions | undefined,\n  includeCrossFileData: boolean\n): NativeMeasureArguments {\n  return [\n    toWellFormed(code),\n    language,\n    includeSyntaxTree,\n    clampToU32(duplication?.minTokens),\n    clampToU32(duplication?.maxGapTokens),\n    clampToU32(duplication?.minSimilarityPercent),\n    includeCrossFileData,\n  ];\n}\n\n/** Collects one file's cross-file clone-detection contribution via the native addon. */\nexport function collectCrossFileDataNative(\n  code: string,\n  language: string,\n  minTokens?: number\n): NativeCrossFileDataPayload {\n  return JSON.parse(\n    loadBinding().collectCrossFileDataNative(toWellFormed(code), language, clampToU32(minTokens))\n  ) as NativeCrossFileDataPayload;\n}\n\n/** Collects normalized token hash sequences of every function via the native addon. */\nexport function collectFunctionTokenSequencesNative(code: string, language: string): Int32Array[] {\n  const sequences = JSON.parse(\n    loadBinding().collectFunctionTokenSequencesNative(toWellFormed(code), language)\n  ) as number[][];\n  return sequences.map((sequence) => Int32Array.from(sequence));\n}\n\n/**\n * Lone surrogates cannot cross the N-API boundary losslessly, so ill-formed strings (invalid\n * UTF-16 occasionally present in real-world files) are measured with U+FFFD replacements — the\n * same code units V8's own UTF-8 conversion would substitute.\n */\nfunction toWellFormed(code: string): string {\n  return code.isWellFormed() ? code : code.toWellFormed();\n}\n\n/**\n * The duplication settings cross the boundary as u32, whose JavaScript conversion wraps modulo\n * 2^32 (2 ** 32 would become 0 and match everything). The public API accepts any safe integer, so\n * out-of-range values clamp to [0, u32::MAX] — no source can hold 2^32 tokens, so a clamped\n * threshold behaves identically to the requested one. NaN (e.g. `Number(unsetEnvVariable)`)\n * survives clamping arithmetic and would also convert to 0, so it is treated as an absent setting\n * instead.\n */\nfunction clampToU32(value: number | undefined): number | undefined {\n  return value === undefined || Number.isNaN(value) ? undefined : clamp(Math.trunc(value), 0, 0xFF_FF_FF_FF);\n}\n\n/**\n * Raised when no usable native addon can be loaded. Every measurement fails identically until the\n * addon is built, so callers measuring many files (the CLI scan) treat it as fatal for the whole\n * run instead of recording one \"skipped\" entry per file.\n */\nexport class NativeAddonError extends Error {}\n\nlet cachedBinding: NativeBinding | undefined;\nlet cachedFailure: NativeAddonError | undefined;\n\n/** Replaces the N-API addon, e.g. with the WebAssembly build on runtimes without N-API. */\nexport function setNativeBinding(binding: NativeBinding): void {\n  cachedBinding = binding;\n}\n\nfunction loadBinding(): NativeBinding {\n  if (cachedBinding) {\n    return cachedBinding;\n  }\n  // The failure is memoized too: resolution (including platformTriplet's diagnostic-report call\n  // on Linux) would otherwise repeat for every measured file of an already-failing run.\n  if (cachedFailure) {\n    throw cachedFailure;\n  }\n  // Resolved relative to this file, so both src/ (tests) and dist/ (build) find the addon.\n  // node:module is loaded lazily so that runtimes without it can bundle this module.\n  const requireNative = process.getBuiltinModule('node:module').createRequire(import.meta.url);\n  const specifiers = [\n    // A prebuilt platform package, when published for this platform.\n    `code-gauge-${platformTriplet()}`,\n    // A locally built addon (`bun run build-native`).\n    '../native/code-gauge.node',\n  ];\n  const failures: string[] = [];\n  for (const specifier of specifiers) {\n    let binding: NativeBinding;\n    try {\n      binding = requireNative(specifier) as NativeBinding;\n    } catch (error) {\n      failures.push(`  ${specifier}: ${getErrorMessage(error).split('\\n')[0]}`);\n      continue;\n    }\n    const version = binding.payloadVersion?.();\n    if (version !== expectedPayloadVersion) {\n      failures.push(\n        `  ${specifier}: payload version ${version ?? 'unknown'} does not match the expected ` +\n          `${expectedPayloadVersion}; rebuild the addon with \\`bun run build-native\\``\n      );\n      continue;\n    }\n    cachedBinding = binding;\n    return binding;\n  }\n  cachedFailure = new NativeAddonError(\n    `The code-gauge native addon is not available for ${platformTriplet()}. Build it with ` +\n      '`node scripts/buildNative.mjs` in the code-gauge package directory (requires a Rust ' +\n      `toolchain).\\n${failures.join('\\n')}`\n  );\n  throw cachedFailure;\n}\n\n/**\n * The platform-package suffix in the napi-rs naming convention: Linux targets are qualified by\n * libc ABI (`linux-x64-gnu` / `linux-x64-musl`) because a glibc-linked addon cannot load on\n * Alpine/musl, and Windows by toolchain ABI (`win32-x64-msvc`), matching what napi-rs tooling\n * generates. Must match scripts/installNative.mjs and the build-native workflow's target list.\n */\nfunction platformTriplet(): string {\n  const base = `${process.platform}-${process.arch}`;\n  if (process.platform === 'win32') {\n    return `${base}-msvc`;\n  }\n  if (process.platform !== 'linux') {\n    return base;\n  }\n  // Musl builds of Node report no glibc runtime version; see napi-rs's isMusl detection.\n  const report = process.report?.getReport() as { header?: { glibcVersionRuntime?: string } } | undefined;\n  return report?.header?.glibcVersionRuntime ? `${base}-gnu` : `${base}-musl`;\n}\n"],"mappings":"qEAmEA,SAAgB,EACd,EACA,EACA,EACA,EACA,EAAuB,GACD,CACtB,OAAO,KAAK,MACV,EAAY,CAAC,CAAC,kBACZ,GAAG,EAAyB,EAAM,EAAU,EAAmB,EAAa,CAAoB,CAClG,CACF,CACF,CAMA,SAAgB,EACd,EACA,EACA,EACA,EACA,EAAuB,GACQ,CAC/B,OAAO,EAAY,CAAC,CACjB,uBACC,GAAG,EAAyB,EAAM,EAAU,EAAmB,EAAa,CAAoB,CAClG,CAAC,CACA,KAAM,GAAS,KAAK,MAAM,CAAI,CAAyB,CAC5D,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACwB,CACxB,MAAO,CACL,EAAa,CAAI,EACjB,EACA,EACA,EAAW,GAAa,SAAS,EACjC,EAAW,GAAa,YAAY,EACpC,EAAW,GAAa,oBAAoB,EAC5C,CACF,CACF,CAGA,SAAgB,EACd,EACA,EACA,EAC4B,CAC5B,OAAO,KAAK,MACV,EAAY,CAAC,CAAC,2BAA2B,EAAa,CAAI,EAAG,EAAU,EAAW,CAAS,CAAC,CAC9F,CACF,CAGA,SAAgB,EAAoC,EAAc,EAAgC,CAIhG,OAHkB,KAAK,MACrB,EAAY,CAAC,CAAC,oCAAoC,EAAa,CAAI,EAAG,CAAQ,CAEjE,CAAC,CAAC,IAAK,GAAa,WAAW,KAAK,CAAQ,CAAC,CAC9D,CAOA,SAAS,EAAa,EAAsB,CAC1C,OAAO,EAAK,aAAa,EAAI,EAAO,EAAK,aAAa,CACxD,CAUA,SAAS,EAAW,EAA+C,CACjE,OAAO,IAAU,IAAA,IAAa,OAAO,MAAM,CAAK,EAAI,IAAA,GAAY,EAAM,KAAK,MAAM,CAAK,EAAG,EAAG,UAAa,CAC3G,CAOA,IAAa,EAAb,cAAsC,KAAM,CAAC,EAE7C,IAAI,EACA,EAGJ,SAAgB,EAAiB,EAA8B,CAC7D,EAAgB,CAClB,CAEA,SAAS,GAA6B,CACpC,GAAI,EACF,OAAO,EAIT,GAAI,EACF,MAAM,EAIR,IAAM,EAAgB,QAAQ,iBAAiB,aAAa,CAAC,CAAC,cAAc,YAAY,GAAG,EACrF,EAAa,CAEjB,cAAc,EAAgB,IAE9B,2BACF,EACM,EAAqB,CAAC,EAC5B,IAAK,IAAM,KAAa,EAAY,CAClC,IAAI,EACJ,GAAI,CACF,EAAU,EAAc,CAAS,CACnC,OAAS,EAAO,CACd,EAAS,KAAK,KAAK,EAAU,IAAI,EAAgB,CAAK,CAAC,CAAC,MAAM;CAAI,CAAC,CAAC,IAAI,EACxE,QACF,CACA,IAAM,EAAU,EAAQ,iBAAiB,EACzC,GAAI,IAAA,EAAoC,CACtC,EAAS,KACP,KAAK,EAAU,oBAAoB,GAAW,UAAU,gFAE1D,EACA,QACF,CAEA,MADA,GAAgB,EACT,CACT,CAMA,KALA,GAAgB,IAAI,EAClB,oDAAoD,EAAgB,EAAE,qHAEpD,EAAS,KAAK;CAAI,GACtC,EACM,CACR,CAQA,SAAS,GAA0B,CACjC,IAAM,EAAO,GAAG,QAAQ,SAAS,GAAG,QAAQ,OAS5C,OARI,QAAQ,WAAa,QAChB,GAAG,EAAK,OAEb,QAAQ,WAAa,SAIV,QAAQ,QAAQ,UAAU,EAAA,EAC1B,QAAQ,oBAAsB,GAAG,EAAK,MAAQ,GAAG,EAAK,OAJ5D,CAKX"}
+{"version":3,"file":"nativeMetrics.js","names":[],"sources":["../src/nativeMetrics.ts"],"sourcesContent":["import { clamp, getErrorMessage } from '@willbooster/shared-lib';\nimport type { CrossFileDuplicateCandidate, Token, TokenRange } from './duplication.js';\nimport type { CodeMetrics, DuplicationOptions, FunctionMetrics } from './types.js';\n\n/**\n * Halstead counts measured natively; the derived float metrics (volume, effort, ...) are\n * computed in TypeScript because they involve transcendental functions (log2) whose last-bit\n * results can differ between V8 and Rust's libm, and results must not depend on the Rust side's\n * libm build.\n */\nexport interface NativeHalsteadCounts {\n  distinctOperators: number;\n  distinctOperands: number;\n  totalOperators: number;\n  totalOperands: number;\n}\n\nexport interface NativeFunctionMetricsPayload extends Omit<FunctionMetrics, 'halstead' | 'cognitiveBlocks'> {\n  /** Absent when the function has none. */\n  cognitiveBlocks?: FunctionMetrics['cognitiveBlocks'];\n  halsteadCounts: NativeHalsteadCounts;\n}\n\nexport interface NativeMetricsPayload extends Omit<CodeMetrics, 'halstead' | 'functions' | 'syntaxTree'> {\n  functions: NativeFunctionMetricsPayload[];\n  halsteadCounts: NativeHalsteadCounts;\n  syntaxTree?: string;\n  crossFileData?: NativeCrossFileDataPayload;\n}\n\n/** One file's cross-file clone-detection contribution as serialized by the native addon. */\nexport interface NativeCrossFileDataPayload {\n  candidates: CrossFileDuplicateCandidate[];\n  tokens: Token[];\n  containerStatements: TokenRange[][];\n  nearMissBlocks: TokenRange[];\n  /** 1-based lines that are neither blank nor comment-only, sorted ascending. */\n  codeLineNumbers: number[];\n}\n\ntype NativeMeasureArguments = [\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  minTokens: number | undefined,\n  maxGapTokens: number | undefined,\n  minSimilarityPercent: number | undefined,\n  includeCrossFileData: boolean,\n];\n\nexport interface NativeBinding {\n  measureCodeNative(...args: NativeMeasureArguments): string;\n  measureCodeNativeAsync(...args: NativeMeasureArguments): Promise<string>;\n  collectCrossFileDataNative(code: string, language: string, minTokens?: number): string;\n  collectFunctionTokenSequencesNative(code: string, language: string): string;\n  payloadVersion?(): number;\n}\n\n/**\n * Must equal `payload_version` in native/src/lib.rs. A previously built addon survives a\n * `git pull` untouched, so without this handshake it would silently return payloads missing\n * newer fields, or lack newer binding functions, instead of failing with a clear rebuild message.\n */\nexport const expectedPayloadVersion = 12;\n\n/**\n * Measures one file via the native addon, returning the raw payload for assembly in metrics.ts;\n * with `includeCrossFileData`, the payload also carries the file's cross-file contribution.\n */\nexport function measureCodeNative(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication?: DuplicationOptions,\n  includeCrossFileData = false\n): NativeMetricsPayload {\n  return JSON.parse(\n    loadBinding().measureCodeNative(\n      ...toNativeMeasureArguments(code, language, includeSyntaxTree, duplication, includeCrossFileData)\n    )\n  ) as NativeMetricsPayload;\n}\n\n/**\n * measureCodeNative on the addon's worker threads, so several files can be measured in parallel.\n * A missing addon still throws synchronously, like measureCodeNative.\n */\nexport function measureCodeNativeAsync(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication?: DuplicationOptions,\n  includeCrossFileData = false\n): Promise<NativeMetricsPayload> {\n  return loadBinding()\n    .measureCodeNativeAsync(\n      ...toNativeMeasureArguments(code, language, includeSyntaxTree, duplication, includeCrossFileData)\n    )\n    .then((json) => JSON.parse(json) as NativeMetricsPayload);\n}\n\n/** The binding arguments shared by the sync and async measurements, so both measure alike. */\nfunction toNativeMeasureArguments(\n  code: string,\n  language: string,\n  includeSyntaxTree: boolean,\n  duplication: DuplicationOptions | undefined,\n  includeCrossFileData: boolean\n): NativeMeasureArguments {\n  return [\n    toWellFormed(code),\n    language,\n    includeSyntaxTree,\n    clampToU32(duplication?.minTokens),\n    clampToU32(duplication?.maxGapTokens),\n    clampToU32(duplication?.minSimilarityPercent),\n    includeCrossFileData,\n  ];\n}\n\n/** Collects one file's cross-file clone-detection contribution via the native addon. */\nexport function collectCrossFileDataNative(\n  code: string,\n  language: string,\n  minTokens?: number\n): NativeCrossFileDataPayload {\n  return JSON.parse(\n    loadBinding().collectCrossFileDataNative(toWellFormed(code), language, clampToU32(minTokens))\n  ) as NativeCrossFileDataPayload;\n}\n\n/** Collects normalized token hash sequences of every function via the native addon. */\nexport function collectFunctionTokenSequencesNative(code: string, language: string): Int32Array[] {\n  const sequences = JSON.parse(\n    loadBinding().collectFunctionTokenSequencesNative(toWellFormed(code), language)\n  ) as number[][];\n  return sequences.map((sequence) => Int32Array.from(sequence));\n}\n\n/**\n * Lone surrogates cannot cross the N-API boundary losslessly, so ill-formed strings (invalid\n * UTF-16 occasionally present in real-world files) are measured with U+FFFD replacements — the\n * same code units V8's own UTF-8 conversion would substitute.\n */\nfunction toWellFormed(code: string): string {\n  return code.isWellFormed() ? code : code.toWellFormed();\n}\n\n/**\n * The duplication settings cross the boundary as u32, whose JavaScript conversion wraps modulo\n * 2^32 (2 ** 32 would become 0 and match everything). The public API accepts any safe integer, so\n * out-of-range values clamp to [0, u32::MAX] — no source can hold 2^32 tokens, so a clamped\n * threshold behaves identically to the requested one. NaN (e.g. `Number(unsetEnvVariable)`)\n * survives clamping arithmetic and would also convert to 0, so it is treated as an absent setting\n * instead.\n */\nfunction clampToU32(value: number | undefined): number | undefined {\n  return value === undefined || Number.isNaN(value) ? undefined : clamp(Math.trunc(value), 0, 0xFF_FF_FF_FF);\n}\n\n/**\n * Raised when no usable native addon can be loaded. Every measurement fails identically until the\n * addon is built, so callers measuring many files (the CLI scan) treat it as fatal for the whole\n * run instead of recording one \"skipped\" entry per file.\n */\nexport class NativeAddonError extends Error {}\n\nlet cachedBinding: NativeBinding | undefined;\nlet cachedFailure: NativeAddonError | undefined;\n\n/** Replaces the N-API addon, e.g. with the WebAssembly build on runtimes without N-API. */\nexport function setNativeBinding(binding: NativeBinding): void {\n  cachedBinding = binding;\n}\n\nfunction loadBinding(): NativeBinding {\n  if (cachedBinding) {\n    return cachedBinding;\n  }\n  // The failure is memoized too: resolution (including platformTriplet's diagnostic-report call\n  // on Linux) would otherwise repeat for every measured file of an already-failing run.\n  if (cachedFailure) {\n    throw cachedFailure;\n  }\n  // Resolved relative to this file, so both src/ (tests) and dist/ (build) find the addon.\n  // node:module is loaded lazily so that runtimes without it can bundle this module.\n  const requireNative = process.getBuiltinModule('node:module').createRequire(import.meta.url);\n  const specifiers = [\n    // A prebuilt platform package, when published for this platform.\n    `code-gauge-${platformTriplet()}`,\n    // A locally built addon (`bun run build-native`).\n    '../native/code-gauge.node',\n  ];\n  const failures: string[] = [];\n  for (const specifier of specifiers) {\n    let binding: NativeBinding;\n    try {\n      binding = requireNative(specifier) as NativeBinding;\n    } catch (error) {\n      failures.push(`  ${specifier}: ${getErrorMessage(error).split('\\n')[0]}`);\n      continue;\n    }\n    const version = binding.payloadVersion?.();\n    if (version !== expectedPayloadVersion) {\n      failures.push(\n        `  ${specifier}: payload version ${version ?? 'unknown'} does not match the expected ` +\n          `${expectedPayloadVersion}; rebuild the addon with \\`bun run build-native\\``\n      );\n      continue;\n    }\n    cachedBinding = binding;\n    return binding;\n  }\n  cachedFailure = new NativeAddonError(\n    `The code-gauge native addon is not available for ${platformTriplet()}. Build it with ` +\n      '`node scripts/buildNative.mjs` in the code-gauge package directory (requires a Rust ' +\n      `toolchain).\\n${failures.join('\\n')}`\n  );\n  throw cachedFailure;\n}\n\n/**\n * The platform-package suffix in the napi-rs naming convention: Linux targets are qualified by\n * libc ABI (`linux-x64-gnu` / `linux-x64-musl`) because a glibc-linked addon cannot load on\n * Alpine/musl, and Windows by toolchain ABI (`win32-x64-msvc`), matching what napi-rs tooling\n * generates. Must match scripts/installNative.mjs and the build-native workflow's target list.\n */\nfunction platformTriplet(): string {\n  const base = `${process.platform}-${process.arch}`;\n  if (process.platform === 'win32') {\n    return `${base}-msvc`;\n  }\n  if (process.platform !== 'linux') {\n    return base;\n  }\n  // Musl builds of Node report no glibc runtime version; see napi-rs's isMusl detection.\n  const report = process.report?.getReport() as { header?: { glibcVersionRuntime?: string } } | undefined;\n  return report?.header?.glibcVersionRuntime ? `${base}-gnu` : `${base}-musl`;\n}\n"],"mappings":"qEAqEA,SAAgB,EACd,EACA,EACA,EACA,EACA,EAAuB,GACD,CACtB,OAAO,KAAK,MACV,EAAY,CAAC,CAAC,kBACZ,GAAG,EAAyB,EAAM,EAAU,EAAmB,EAAa,CAAoB,CAClG,CACF,CACF,CAMA,SAAgB,EACd,EACA,EACA,EACA,EACA,EAAuB,GACQ,CAC/B,OAAO,EAAY,CAAC,CACjB,uBACC,GAAG,EAAyB,EAAM,EAAU,EAAmB,EAAa,CAAoB,CAClG,CAAC,CACA,KAAM,GAAS,KAAK,MAAM,CAAI,CAAyB,CAC5D,CAGA,SAAS,EACP,EACA,EACA,EACA,EACA,EACwB,CACxB,MAAO,CACL,EAAa,CAAI,EACjB,EACA,EACA,EAAW,GAAa,SAAS,EACjC,EAAW,GAAa,YAAY,EACpC,EAAW,GAAa,oBAAoB,EAC5C,CACF,CACF,CAGA,SAAgB,EACd,EACA,EACA,EAC4B,CAC5B,OAAO,KAAK,MACV,EAAY,CAAC,CAAC,2BAA2B,EAAa,CAAI,EAAG,EAAU,EAAW,CAAS,CAAC,CAC9F,CACF,CAGA,SAAgB,EAAoC,EAAc,EAAgC,CAIhG,OAHkB,KAAK,MACrB,EAAY,CAAC,CAAC,oCAAoC,EAAa,CAAI,EAAG,CAAQ,CAEjE,CAAC,CAAC,IAAK,GAAa,WAAW,KAAK,CAAQ,CAAC,CAC9D,CAOA,SAAS,EAAa,EAAsB,CAC1C,OAAO,EAAK,aAAa,EAAI,EAAO,EAAK,aAAa,CACxD,CAUA,SAAS,EAAW,EAA+C,CACjE,OAAO,IAAU,IAAA,IAAa,OAAO,MAAM,CAAK,EAAI,IAAA,GAAY,EAAM,KAAK,MAAM,CAAK,EAAG,EAAG,UAAa,CAC3G,CAOA,IAAa,EAAb,cAAsC,KAAM,CAAC,EAE7C,IAAI,EACA,EAGJ,SAAgB,EAAiB,EAA8B,CAC7D,EAAgB,CAClB,CAEA,SAAS,GAA6B,CACpC,GAAI,EACF,OAAO,EAIT,GAAI,EACF,MAAM,EAIR,IAAM,EAAgB,QAAQ,iBAAiB,aAAa,CAAC,CAAC,cAAc,YAAY,GAAG,EACrF,EAAa,CAEjB,cAAc,EAAgB,IAE9B,2BACF,EACM,EAAqB,CAAC,EAC5B,IAAK,IAAM,KAAa,EAAY,CAClC,IAAI,EACJ,GAAI,CACF,EAAU,EAAc,CAAS,CACnC,OAAS,EAAO,CACd,EAAS,KAAK,KAAK,EAAU,IAAI,EAAgB,CAAK,CAAC,CAAC,MAAM;CAAI,CAAC,CAAC,IAAI,EACxE,QACF,CACA,IAAM,EAAU,EAAQ,iBAAiB,EACzC,GAAI,IAAA,GAAoC,CACtC,EAAS,KACP,KAAK,EAAU,oBAAoB,GAAW,UAAU,iFAE1D,EACA,QACF,CAEA,MADA,GAAgB,EACT,CACT,CAMA,KALA,GAAgB,IAAI,EAClB,oDAAoD,EAAgB,EAAE,qHAEpD,EAAS,KAAK;CAAI,GACtC,EACM,CACR,CAQA,SAAS,GAA0B,CACjC,IAAM,EAAO,GAAG,QAAQ,SAAS,GAAG,QAAQ,OAS5C,OARI,QAAQ,WAAa,QAChB,GAAG,EAAK,OAEb,QAAQ,WAAa,SAIV,QAAQ,QAAQ,UAAU,EAAA,EAC1B,QAAQ,oBAAsB,GAAG,EAAK,MAAQ,GAAG,EAAK,OAJ5D,CAKX"}

package/dist/thresholdCheck.cjs

@@ -1,2 +1,2 @@
-"use strict";const e=require("./thresholds.cjs"),t=[`file`,`function`,`duplication`],n=new Set(e.functionThresholds.filter(({includesNestedFunctions:e})=>e).map(t=>e.metricNameOf(t)));function r(t,n,r){let s=f(n,new Set(t.map(({file:e})=>e))),u=[],d=0;for(let n of t){let{file:t,metrics:i,hunks:f}=n,m=r(i.language),h=f?.length===0?[]:l(e.fileThresholds,i,m);h.length>0&&u.push(c({file:t,startLine:1,endLine:i.lines.total},`file`,h));let g=a(n);d+=g.length;let _=g.map(t=>({fn:t,exceeded:l(e.functionThresholds,t,m)})).filter(({exceeded:e})=>e.length>0);for(let{fn:e,exceeded:n}of _){let r=n.filter(t=>!o(t,e,_));if(r.length>0){let{startLine:n,endLine:i}=e;u.push({...c({file:t,startLine:n,endLine:i},`function`,r),name:e.name??`<anonymous>`})}}u.push(...p(t,i,s.get(t)??[],f,m))}return{violations:u.toSorted(i),checkedFunctionCount:d}}function i(n,r){return e.levels.indexOf(r.level)-e.levels.indexOf(n.level)||g(n.file,r.file)||n.startLine-r.startLine||t.indexOf(n.kind)-t.indexOf(r.kind)||n.endLine-r.endLine}function a({metrics:e,hunks:t}){let n=e.language===`python`;return t?e.functions.filter(e=>t.some(t=>d(t,e.startLine,e.endLine,n))):e.functions}function o(e,t,r){return n.has(e.metric)?r.some(n=>n.fn!==t&&s(n.fn,t)&&n.exceeded.some(({metric:t})=>t===e.metric)):!1}function s(e,t){let n=e.startLine<t.startLine||e.startLine===t.startLine&&e.startColumn<=t.startColumn,r=e.endLine>t.endLine||e.endLine===t.endLine&&e.endColumn>=t.endColumn;return n&&r}function c(e,t,n){return{kind:t,level:n.some(e=>e.level===`error`)?`error`:`warning`,...e,exceeded:n}}function l(e,t,n){return e.flatMap(e=>u(e,t,n,(e,t)=>e>t))}function u(t,n,r,i){let a=t.measure(n),o=e.levels.findLast(e=>i(a,r[e][t.key]));return o?[{metric:e.metricNameOf(t),value:a,level:o,limit:r[o][t.key]}]:[]}function d(e,t,n,r=!1){return e.headCount===0?e.headStart>=t&&(e.headStart<n||r&&e.headStart===n):e.headStart<=n&&e.headStart+e.headCount>t}function f(e,t){let n=/* @__PURE__ */ new Map;for(let r of e?.groups??[])for(let e of r.files)if(t.has(e)){let t=n.get(e)??[];t.push(r),n.set(e,t)}return n}function p(t,n,r,i,a){let o=t=>u(e.duplicationThreshold,t,a,(e,t)=>e>=t),s=[...n.duplication.duplicateBlockGroups.map(e=>e.map(e=>({...e,file:t}))),...r.map(e=>e.occurrences)],l=e=>e.file===t&&o(e).length>0&&(!i||i.some(t=>t.headCount>0&&d(t,e.startLine,e.endLine))),f=/* @__PURE__ */ new Map;for(let e of s)for(let t of e.filter(e=>l(e)))f.set(t,e);return m([...f.keys()]).map(({merged:e,sources:t})=>({...c(e,`duplication`,o(e)),partners:m(t.flatMap(e=>f.get(e)??[])).map(e=>e.merged).filter(t=>!h(t,e))}))}function m(e){let t=[],n=e.toSorted((e,t)=>g(e.file,t.file)||e.startLine-t.startLine);for(let e of n){let n=t.at(-1);if(n&&h(n.merged,e))n.merged.endLine=Math.max(n.merged.endLine,e.endLine),n.sources.push(e);else{let{file:n,startLine:r,endLine:i}=e;t.push({merged:{file:n,startLine:r,endLine:i},sources:[e]})}}return t}function h(e,t){return e.file===t.file&&e.startLine<=t.endLine&&t.startLine<=e.endLine}function g(e,t){return e<t?-1:+(e>t)}exports.checkThresholds=r;
+"use strict";const e=require("./_virtual/_rolldown/runtime.cjs"),t=require("./thresholds.cjs");let n=require("node:assert");n=e.__toESM(n,1);const r=[`file`,`function`,`duplication`],i=new Set(t.functionThresholds.filter(({includesNestedFunctions:e})=>e).map(e=>t.metricNameOf(e)));function a(e,n,r){let i=g(n.crossFile,new Set(e.map(({file:e})=>e))),a=[],l=0;for(let o of e){let{file:e,metrics:d,hunks:m}=o,h=r(d.language),g=m?.length===0?[]:p(t.fileThresholds,d,h);g.length>0&&a.push(f({file:e,startLine:1,endLine:d.lines.total},`file`,g));let v=s(o);l+=v.length;let y=v.map(e=>({fn:e,exceeded:p(t.functionThresholds,e,h)})).filter(({exceeded:e})=>e.length>0);for(let{fn:t,exceeded:n}of y){let r=n.filter(e=>!c(e,t,y));r.length>0&&a.push(u(e,t,r))}a.push(..._(o,i.get(e)??[],h,n))}return{violations:a.toSorted(o),checkedFunctionCount:l}}function o(e,n){return t.levels.indexOf(n.level)-t.levels.indexOf(e.level)||C(e.file,n.file)||e.startLine-n.startLine||r.indexOf(e.kind)-r.indexOf(n.kind)||e.endLine-n.endLine}function s({metrics:e,hunks:t}){let n=e.language===`python`;return t?e.functions.filter(e=>t.some(t=>h(t,e.startLine,e.endLine,n))):e.functions}function c(e,t,n){return i.has(e.metric)?n.some(n=>n.fn!==t&&l(n.fn,t)&&n.exceeded.some(({metric:t})=>t===e.metric)):!1}function l(e,t){let n=e.startLine<t.startLine||e.startLine===t.startLine&&e.startColumn<=t.startColumn,r=e.endLine>t.endLine||e.endLine===t.endLine&&e.endColumn>=t.endColumn;return n&&r}function u(e,t,n){let{startLine:r,endLine:i}=t,a=n.some(({metric:e})=>e===`functionCognitiveComplexity`);return{...f({file:e,startLine:r,endLine:i},`function`,n),name:d(t),...a&&t.cognitiveBlocks.length>0&&{largestBlocks:t.cognitiveBlocks}}}function d({name:e=`<anonymous>`,containerName:t}){return t?`${t}.${e}`:e}function f(e,t,n){return{kind:t,level:n.some(e=>e.level===`error`)?`error`:`warning`,...e,exceeded:n}}function p(e,t,n){return e.flatMap(e=>m(e,t,n,(e,t)=>e>t))}function m(e,n,r,i){let a=e.measure(n),o=t.levels.findLast(t=>i(a,r[t][e.key]));return o?[{metric:t.metricNameOf(e),value:a,level:o,limit:r[o][e.key]}]:[]}function h(e,t,n,r=!1){return e.headCount===0?e.headStart>=t&&(e.headStart<n||r&&e.headStart===n):e.headStart<=n&&e.headStart+e.headCount>t}function g(e,t){let n=/* @__PURE__ */ new Map;for(let r of e?.groups??[])for(let e of r.files)if(t.has(e)){let t=n.get(e)??[];t.push(r),n.set(e,t)}return n}function _({file:e,metrics:n,hunks:r},i,a,{minSimilarityPercent:o}){let s=e=>m(t.duplicationThreshold,{duplicatedLineCount:e},a,(e,t)=>e>=t),c=[...n.duplication.duplicateBlockGroups.map(t=>t.map(t=>({...t,file:e}))),...i.map(e=>e.occurrences.map(e=>v(e)))],l=t=>t.file===e&&s(t.lineNumbers.length).length>0&&(!r||r.some(e=>e.headCount>0&&h(e,t.startLine,t.endLine))),u=/* @__PURE__ */ new Map;for(let e of c)for(let t of e.filter(e=>l(e)))u.set(t,e);return b([...u.keys()]).map(({merged:e,sources:t})=>{let n=n=>b(t.flatMap(e=>{let r=Math.max(...t.filter(t=>x(t,e)).map(e=>e.tokenCount));return(u.get(e)??[]).filter(e=>e.tokenCount*100>=r*n)})).filter(t=>!S(t.merged,e)).toSorted((e,t)=>y(t.sources)-y(e.sources)).map(e=>e.merged),r=n(o);return{...f(e,`duplication`,s(new Set(t.flatMap(e=>e.lineNumbers)).size)),partners:r.length>0?r:n(0)}})}function v(e){let{lineNumbers:t}=e;return n.default.ok(t,`No matched lines for ${e.file}, a scanned file.`),{...e,lineNumbers:t}}function y(e){return e.reduce((e,t)=>e+t.tokenCount,0)}function b(e){let t=[],n=e.toSorted((e,t)=>C(e.file,t.file)||e.startLine-t.startLine);for(let e of n){let n=t.at(-1);if(n&&S(n.merged,e))n.merged.endLine=Math.max(n.merged.endLine,e.endLine),n.sources.push(e);else{let{file:n,startLine:r,endLine:i}=e;t.push({merged:{file:n,startLine:r,endLine:i},sources:[e]})}}return t}function x(e,t){return e.file===t.file&&e.startLine<=t.startLine&&t.endLine<=e.endLine}function S(e,t){return e.file===t.file&&e.startLine<=t.endLine&&t.startLine<=e.endLine}function C(e,t){return e<t?-1:+(e>t)}exports.checkThresholds=a,exports.qualifyFunctionName=d;
 //# sourceMappingURL=thresholdCheck.cjs.map

package/dist/thresholdCheck.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"thresholdCheck.cjs","names":["functionThresholds","metricNameOf","fileThresholds","levels","duplicationThreshold"],"sources":["../src/thresholdCheck.ts"],"sourcesContent":["import type { CrossFileDuplicateBlockGroup, CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { LineHunk } from './git.js';\nimport {\n  duplicationThreshold,\n  fileThresholds,\n  functionThresholds,\n  levels,\n  metricNameOf,\n  type Level,\n  type LimitsByLevel,\n  type Threshold,\n} from './thresholds.js';\nimport type { CodeMetrics, FunctionMetrics } from './types.js';\n\n/** A measured file to check, under the path cross-file duplication knows it by. */\nexport interface CheckedFile {\n  file: string;\n  metrics: CodeMetrics;\n  /** The change to the file; when set, only what the change touches is checked. */\n  hunks?: readonly LineHunk[];\n}\n\nexport interface ExceededLimit {\n  metric: string;\n  value: number;\n  /** The most severe level whose limit the value violates. */\n  level: Level;\n  /** That level's limit: the value is allowed up to it; a duplicated block is allowed below it. */\n  limit: number;\n}\n\nexport interface BlockLocation {\n  file: string;\n  startLine: number;\n  endLine: number;\n}\n\nexport interface Violation extends BlockLocation {\n  kind: 'function' | 'file' | 'duplication';\n  /** The most severe level among `exceeded`. */\n  level: Level;\n  /** The function's name, for kind `function`. */\n  name?: string;\n  exceeded: ExceededLimit[];\n  /** The other copies of the block, for kind `duplication`. */\n  partners?: BlockLocation[];\n}\n\nexport interface CheckResult {\n  violations: Violation[];\n  checkedFunctionCount: number;\n}\n\nconst violationKinds: readonly Violation['kind'][] = ['file', 'function', 'duplication'];\n\nconst nestedInclusiveMetrics = new Set(\n  functionThresholds\n    .filter(({ includesNestedFunctions }) => includesNestedFunctions)\n    .map((threshold) => metricNameOf(threshold))\n);\n\n/** Every limit the files exceed, errors first, then ordered by path, then line. */\nexport function checkThresholds(\n  files: readonly CheckedFile[],\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  limitsOf: (language: string) => LimitsByLevel\n): CheckResult {\n  const crossFileGroupsByFile = indexGroupsByFile(crossFileDuplication, new Set(files.map(({ file }) => file)));\n  const violations: Violation[] = [];\n  let checkedFunctionCount = 0;\n  for (const checkedFile of files) {\n    const { file, metrics, hunks } = checkedFile;\n    const limits = limitsOf(metrics.language);\n    // A rename or a mode change lists the file as changed without touching any of its lines.\n    const fileExceeded = hunks?.length === 0 ? [] : collectExceeded(fileThresholds, metrics, limits);\n    if (fileExceeded.length > 0) {\n      violations.push(toViolation({ file, startLine: 1, endLine: metrics.lines.total }, 'file', fileExceeded));\n    }\n    const checkedFunctions = listCheckedFunctions(checkedFile);\n    checkedFunctionCount += checkedFunctions.length;\n    const exceedingFunctions = checkedFunctions\n      .map((fn) => ({ fn, exceeded: collectExceeded(functionThresholds, fn, limits) }))\n      .filter(({ exceeded }) => exceeded.length > 0);\n    for (const { fn, exceeded } of exceedingFunctions) {\n      const ownExceeded = exceeded.filter((limit) => !isReportedByEnclosingFunction(limit, fn, exceedingFunctions));\n      if (ownExceeded.length > 0) {\n        const { startLine, endLine } = fn;\n        violations.push({\n          ...toViolation({ file, startLine, endLine }, 'function', ownExceeded),\n          name: fn.name ?? '<anonymous>',\n        });\n      }\n    }\n    violations.push(\n      ...collectDuplicationViolations(file, metrics, crossFileGroupsByFile.get(file) ?? [], hunks, limits)\n    );\n  }\n  return { violations: violations.toSorted(compareViolations), checkedFunctionCount };\n}\n\n// The kind is compared before the end line because a file violation's end line is corrected after\n// this ordering (to the last line that exists), and the order must not depend on that correction.\nfunction compareViolations(left: Violation, right: Violation): number {\n  return (\n    levels.indexOf(right.level) - levels.indexOf(left.level) ||\n    compareStrings(left.file, right.file) ||\n    left.startLine - right.startLine ||\n    violationKinds.indexOf(left.kind) - violationKinds.indexOf(right.kind) ||\n    left.endLine - right.endLine\n  );\n}\n\n/** The file's functions or, for a changed file, those the change touches. */\nfunction listCheckedFunctions({ metrics, hunks }: CheckedFile): FunctionMetrics[] {\n  const endsByIndentation = metrics.language === 'python';\n  return hunks\n    ? metrics.functions.filter((fn) =>\n        hunks.some((hunk) => touchesSpan(hunk, fn.startLine, fn.endLine, endsByIndentation))\n      )\n    : metrics.functions;\n}\n\n/**\n * Whether a function enclosing `fn` exceeds the same limit with a value that covers `fn`, so\n * reporting it for `fn` too would count the same code twice. The enclosing value is at least that\n * of `fn` and both share the file's limits, so its level is never milder.\n */\nfunction isReportedByEnclosingFunction(\n  limit: ExceededLimit,\n  fn: FunctionMetrics,\n  exceedingFunctions: readonly { fn: FunctionMetrics; exceeded: ExceededLimit[] }[]\n): boolean {\n  if (!nestedInclusiveMetrics.has(limit.metric)) {\n    return false;\n  }\n  return exceedingFunctions.some(\n    (outer) => outer.fn !== fn && encloses(outer.fn, fn) && outer.exceeded.some(({ metric }) => metric === limit.metric)\n  );\n}\n\nfunction encloses(outer: FunctionMetrics, inner: FunctionMetrics): boolean {\n  const startsBefore =\n    outer.startLine < inner.startLine ||\n    (outer.startLine === inner.startLine && outer.startColumn <= inner.startColumn);\n  const endsAfter =\n    outer.endLine > inner.endLine || (outer.endLine === inner.endLine && outer.endColumn >= inner.endColumn);\n  return startsBefore && endsAfter;\n}\n\nfunction toViolation(location: BlockLocation, kind: Violation['kind'], exceeded: ExceededLimit[]): Violation {\n  const level = exceeded.some((limit) => limit.level === 'error') ? 'error' : 'warning';\n  return { kind, level, ...location, exceeded };\n}\n\nfunction collectExceeded<Subject>(\n  thresholds: readonly Threshold<Subject>[],\n  subject: Subject,\n  limits: LimitsByLevel\n): ExceededLimit[] {\n  return thresholds.flatMap((threshold) => findExceeded(threshold, subject, limits, (value, limit) => value > limit));\n}\n\n/** The most severe violated limit of the threshold, if any. */\nfunction findExceeded<Subject>(\n  threshold: Threshold<Subject>,\n  subject: Subject,\n  limits: LimitsByLevel,\n  violates: (value: number, limit: number) => boolean\n): ExceededLimit[] {\n  const value = threshold.measure(subject);\n  const level = levels.findLast((candidate) => violates(value, limits[candidate][threshold.key] as number));\n  return level\n    ? [{ metric: metricNameOf(threshold), value, level, limit: limits[level][threshold.key] as number }]\n    : [];\n}\n\n/**\n * Whether the hunk changes the head lines [startLine, endLine]. A hunk without head lines (a pure\n * deletion) sits between its headStart line and the next one. Where indentation ends a span, its\n * last line is a statement rather than a closing delimiter, so a deletion right after that line may\n * have removed the span's tail; `endsByIndentation` counts it as touching, since the head alone\n * cannot tell it from a deletion after the span.\n */\nfunction touchesSpan(hunk: LineHunk, startLine: number, endLine: number, endsByIndentation = false): boolean {\n  return hunk.headCount === 0\n    ? hunk.headStart >= startLine && (hunk.headStart < endLine || (endsByIndentation && hunk.headStart === endLine))\n    : hunk.headStart <= endLine && hunk.headStart + hunk.headCount > startLine;\n}\n\n/** The cross-file groups with an occurrence in each of the given files. */\nfunction indexGroupsByFile(\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  files: ReadonlySet<string>\n): Map<string, CrossFileDuplicateBlockGroup[]> {\n  const groupsByFile = new Map<string, CrossFileDuplicateBlockGroup[]>();\n  for (const group of crossFileDuplication?.groups ?? []) {\n    for (const file of group.files) {\n      if (files.has(file)) {\n        const groups = groupsByFile.get(file) ?? [];\n        groups.push(group);\n        groupsByFile.set(file, groups);\n      }\n    }\n  }\n  return groupsByFile;\n}\n\n/**\n * One violation per duplicated region of the file: its clone occurrences, within-file and\n * cross-file, that span at least the line count of a level (with `hunks`, only those overlapping\n * added lines), with overlapping occurrences merged into one region.\n */\nfunction collectDuplicationViolations(\n  file: string,\n  metrics: CodeMetrics,\n  crossFileGroups: readonly CrossFileDuplicateBlockGroup[],\n  hunks: readonly LineHunk[] | undefined,\n  limits: LimitsByLevel\n): Violation[] {\n  const findExceededLines = (block: BlockLocation): ExceededLimit[] =>\n    findExceeded(duplicationThreshold, block, limits, (value, limit) => value >= limit);\n  const groups: BlockLocation[][] = [\n    ...metrics.duplication.duplicateBlockGroups.map((group) => group.map((occurrence) => ({ ...occurrence, file }))),\n    ...crossFileGroups.map((group) => group.occurrences),\n  ];\n  const isReported = (block: BlockLocation): boolean =>\n    block.file === file &&\n    findExceededLines(block).length > 0 &&\n    (!hunks || hunks.some((hunk) => hunk.headCount > 0 && touchesSpan(hunk, block.startLine, block.endLine)));\n  const copiesByBlock = new Map<BlockLocation, BlockLocation[]>();\n  for (const group of groups) {\n    for (const block of group.filter((occurrence) => isReported(occurrence))) {\n      copiesByBlock.set(block, group);\n    }\n  }\n  return mergeOverlapping([...copiesByBlock.keys()]).map(({ merged, sources }) => ({\n    ...toViolation(merged, 'duplication', findExceededLines(merged)),\n    // The region's own occurrences are among the copies of the groups it belongs to.\n    partners: mergeOverlapping(sources.flatMap((source) => copiesByBlock.get(source) ?? []))\n      .map((partner) => partner.merged)\n      .filter((partner) => !overlaps(partner, merged)),\n  }));\n}\n\n/** The locations with those overlapping in the same file merged, ordered by file, then line. */\nfunction mergeOverlapping(locations: readonly BlockLocation[]): { merged: BlockLocation; sources: BlockLocation[] }[] {\n  const regions: { merged: BlockLocation; sources: BlockLocation[] }[] = [];\n  const ordered = locations.toSorted(\n    (left, right) => compareStrings(left.file, right.file) || left.startLine - right.startLine\n  );\n  for (const location of ordered) {\n    const last = regions.at(-1);\n    if (last && overlaps(last.merged, location)) {\n      last.merged.endLine = Math.max(last.merged.endLine, location.endLine);\n      last.sources.push(location);\n    } else {\n      const { file, startLine, endLine } = location;\n      regions.push({ merged: { file, startLine, endLine }, sources: [location] });\n    }\n  }\n  return regions;\n}\n\nfunction overlaps(left: BlockLocation, right: BlockLocation): boolean {\n  return left.file === right.file && left.startLine <= right.endLine && right.startLine <= left.endLine;\n}\n\n/** Code-unit order, so reports do not depend on the locale. */\nfunction compareStrings(left: string, right: string): number {\n  return left < right ? -1 : left > right ? 1 : 0;\n}\n"],"mappings":"iDAqDM,EAA+C,CAAC,OAAQ,WAAY,aAAa,EAEjF,EAAyB,IAAI,IACjCA,EAAAA,mBACG,QAAQ,CAAE,6BAA8B,CAAuB,CAAC,CAChE,IAAK,GAAcC,EAAAA,aAAa,CAAS,CAAC,CAC/C,EAGA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAwB,EAAkB,EAAsB,IAAI,IAAI,EAAM,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EACtG,EAA0B,CAAC,EAC7B,EAAuB,EAC3B,IAAK,IAAM,KAAe,EAAO,CAC/B,GAAM,CAAE,OAAM,UAAS,SAAU,EAC3B,EAAS,EAAS,EAAQ,QAAQ,EAElC,EAAe,GAAO,SAAW,EAAI,CAAC,EAAI,EAAgBC,EAAAA,eAAgB,EAAS,CAAM,EAC3F,EAAa,OAAS,GACxB,EAAW,KAAK,EAAY,CAAE,OAAM,UAAW,EAAG,QAAS,EAAQ,MAAM,KAAM,EAAG,OAAQ,CAAY,CAAC,EAEzG,IAAM,EAAmB,EAAqB,CAAW,EACzD,GAAwB,EAAiB,OACzC,IAAM,EAAqB,EACxB,IAAK,IAAQ,CAAE,KAAI,SAAU,EAAgBF,EAAAA,mBAAoB,EAAI,CAAM,CAAE,EAAE,CAAC,CAChF,QAAQ,CAAE,cAAe,EAAS,OAAS,CAAC,EAC/C,IAAK,GAAM,CAAE,KAAI,cAAc,EAAoB,CACjD,IAAM,EAAc,EAAS,OAAQ,GAAU,CAAC,EAA8B,EAAO,EAAI,CAAkB,CAAC,EAC5G,GAAI,EAAY,OAAS,EAAG,CAC1B,GAAM,CAAE,YAAW,WAAY,EAC/B,EAAW,KAAK,CACd,GAAG,EAAY,CAAE,OAAM,YAAW,SAAQ,EAAG,WAAY,CAAW,EACpE,KAAM,EAAG,MAAQ,aACnB,CAAC,CACH,CACF,CACA,EAAW,KACT,GAAG,EAA6B,EAAM,EAAS,EAAsB,IAAI,CAAI,GAAK,CAAC,EAAG,EAAO,CAAM,CACrG,CACF,CACA,MAAO,CAAE,WAAY,EAAW,SAAS,CAAiB,EAAG,sBAAqB,CACpF,CAIA,SAAS,EAAkB,EAAiB,EAA0B,CACpE,OACEG,EAAAA,OAAO,QAAQ,EAAM,KAAK,EAAIA,EAAAA,OAAO,QAAQ,EAAK,KAAK,GACvD,EAAe,EAAK,KAAM,EAAM,IAAI,GACpC,EAAK,UAAY,EAAM,WACvB,EAAe,QAAQ,EAAK,IAAI,EAAI,EAAe,QAAQ,EAAM,IAAI,GACrE,EAAK,QAAU,EAAM,OAEzB,CAGA,SAAS,EAAqB,CAAE,UAAS,SAAyC,CAChF,IAAM,EAAoB,EAAQ,WAAa,SAC/C,OAAO,EACH,EAAQ,UAAU,OAAQ,GACxB,EAAM,KAAM,GAAS,EAAY,EAAM,EAAG,UAAW,EAAG,QAAS,CAAiB,CAAC,CACrF,EACA,EAAQ,SACd,CAOA,SAAS,EACP,EACA,EACA,EACS,CAIT,OAHK,EAAuB,IAAI,EAAM,MAAM,EAGrC,EAAmB,KACvB,GAAU,EAAM,KAAO,GAAM,EAAS,EAAM,GAAI,CAAE,GAAK,EAAM,SAAS,MAAM,CAAE,YAAa,IAAW,EAAM,MAAM,CACrH,EAJS,EAKX,CAEA,SAAS,EAAS,EAAwB,EAAiC,CACzE,IAAM,EACJ,EAAM,UAAY,EAAM,WACvB,EAAM,YAAc,EAAM,WAAa,EAAM,aAAe,EAAM,YAC/D,EACJ,EAAM,QAAU,EAAM,SAAY,EAAM,UAAY,EAAM,SAAW,EAAM,WAAa,EAAM,UAChG,OAAO,GAAgB,CACzB,CAEA,SAAS,EAAY,EAAyB,EAAyB,EAAsC,CAE3G,MAAO,CAAE,OAAM,MADD,EAAS,KAAM,GAAU,EAAM,QAAU,OAAO,EAAI,QAAU,UACtD,GAAG,EAAU,UAAS,CAC9C,CAEA,SAAS,EACP,EACA,EACA,EACiB,CACjB,OAAO,EAAW,QAAS,GAAc,EAAa,EAAW,EAAS,GAAS,EAAO,IAAU,EAAQ,CAAK,CAAC,CACpH,CAGA,SAAS,EACP,EACA,EACA,EACA,EACiB,CACjB,IAAM,EAAQ,EAAU,QAAQ,CAAO,EACjC,EAAQA,EAAAA,OAAO,SAAU,GAAc,EAAS,EAAO,EAAO,EAAU,CAAC,EAAU,IAAc,CAAC,EACxG,OAAO,EACH,CAAC,CAAE,OAAQF,EAAAA,aAAa,CAAS,EAAG,QAAO,QAAO,MAAO,EAAO,EAAM,CAAC,EAAU,IAAe,CAAC,EACjG,CAAC,CACP,CASA,SAAS,EAAY,EAAgB,EAAmB,EAAiB,EAAoB,GAAgB,CAC3G,OAAO,EAAK,YAAc,EACtB,EAAK,WAAa,IAAc,EAAK,UAAY,GAAY,GAAqB,EAAK,YAAc,GACrG,EAAK,WAAa,GAAW,EAAK,UAAY,EAAK,UAAY,CACrE,CAGA,SAAS,EACP,EACA,EAC6C,CAC7C,IAAM,kBAAe,IAAI,IACzB,IAAK,IAAM,KAAS,GAAsB,QAAU,CAAC,EACnD,IAAK,IAAM,KAAQ,EAAM,MACvB,GAAI,EAAM,IAAI,CAAI,EAAG,CACnB,IAAM,EAAS,EAAa,IAAI,CAAI,GAAK,CAAC,EAC1C,EAAO,KAAK,CAAK,EACjB,EAAa,IAAI,EAAM,CAAM,CAC/B,CAGJ,OAAO,CACT,CAOA,SAAS,EACP,EACA,EACA,EACA,EACA,EACa,CACb,IAAM,EAAqB,GACzB,EAAaG,EAAAA,qBAAsB,EAAO,GAAS,EAAO,IAAU,GAAS,CAAK,EAC9E,EAA4B,CAChC,GAAG,EAAQ,YAAY,qBAAqB,IAAK,GAAU,EAAM,IAAK,IAAgB,CAAE,GAAG,EAAY,MAAK,EAAE,CAAC,EAC/G,GAAG,EAAgB,IAAK,GAAU,EAAM,WAAW,CACrD,EACM,EAAc,GAClB,EAAM,OAAS,GACf,EAAkB,CAAK,CAAC,CAAC,OAAS,IACjC,CAAC,GAAS,EAAM,KAAM,GAAS,EAAK,UAAY,GAAK,EAAY,EAAM,EAAM,UAAW,EAAM,OAAO,CAAC,GACnG,kBAAgB,IAAI,IAC1B,IAAK,IAAM,KAAS,EAClB,IAAK,IAAM,KAAS,EAAM,OAAQ,GAAe,EAAW,CAAU,CAAC,EACrE,EAAc,IAAI,EAAO,CAAK,EAGlC,OAAO,EAAiB,CAAC,GAAG,EAAc,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAE,SAAQ,cAAe,CAC/E,GAAG,EAAY,EAAQ,cAAe,EAAkB,CAAM,CAAC,EAE/D,SAAU,EAAiB,EAAQ,QAAS,GAAW,EAAc,IAAI,CAAM,GAAK,CAAC,CAAC,CAAC,CAAC,CACrF,IAAK,GAAY,EAAQ,MAAM,CAAC,CAChC,OAAQ,GAAY,CAAC,EAAS,EAAS,CAAM,CAAC,CACnD,EAAE,CACJ,CAGA,SAAS,EAAiB,EAA4F,CACpH,IAAM,EAAiE,CAAC,EAClE,EAAU,EAAU,UACvB,EAAM,IAAU,EAAe,EAAK,KAAM,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SACnF,EACA,IAAK,IAAM,KAAY,EAAS,CAC9B,IAAM,EAAO,EAAQ,GAAG,EAAE,EAC1B,GAAI,GAAQ,EAAS,EAAK,OAAQ,CAAQ,EACxC,EAAK,OAAO,QAAU,KAAK,IAAI,EAAK,OAAO,QAAS,EAAS,OAAO,EACpE,EAAK,QAAQ,KAAK,CAAQ,MACrB,CACL,GAAM,CAAE,OAAM,YAAW,WAAY,EACrC,EAAQ,KAAK,CAAE,OAAQ,CAAE,OAAM,YAAW,SAAQ,EAAG,QAAS,CAAC,CAAQ,CAAE,CAAC,CAC5E,CACF,CACA,OAAO,CACT,CAEA,SAAS,EAAS,EAAqB,EAA+B,CACpE,OAAO,EAAK,OAAS,EAAM,MAAQ,EAAK,WAAa,EAAM,SAAW,EAAM,WAAa,EAAK,OAChG,CAGA,SAAS,EAAe,EAAc,EAAuB,CAC3D,OAAO,EAAO,EAAQ,GAAK,IAAO,EACpC"}
+{"version":3,"file":"thresholdCheck.cjs","names":["functionThresholds","metricNameOf","fileThresholds","levels","duplicationThreshold"],"sources":["../src/thresholdCheck.ts"],"sourcesContent":["import assert from 'node:assert';\nimport type {\n  CrossFileDuplicateBlockGroup,\n  CrossFileDuplicateOccurrence,\n  CrossFileDuplicationMetrics,\n} from './crossFileDuplication.js';\nimport type { LineHunk } from './git.js';\nimport {\n  duplicationThreshold,\n  fileThresholds,\n  functionThresholds,\n  levels,\n  metricNameOf,\n  type Level,\n  type LimitsByLevel,\n  type Threshold,\n} from './thresholds.js';\nimport type { CodeMetrics, CognitiveBlock, FunctionMetrics } from './types.js';\n\n/** A measured file to check, under the path cross-file duplication knows it by. */\nexport interface CheckedFile {\n  file: string;\n  metrics: CodeMetrics;\n  /** The change to the file; when set, only what the change touches is checked. */\n  hunks?: readonly LineHunk[];\n}\n\n/** The duplication of the measured files, in which duplicated blocks and their copies are found. */\nexport interface CheckedDuplication {\n  crossFile?: CrossFileDuplicationMetrics;\n  /** The detection's `minSimilarityPercent`, the share of a block a copy of it holds at least. */\n  minSimilarityPercent: number;\n}\n\nexport interface ExceededLimit {\n  metric: string;\n  value: number;\n  /** The most severe level whose limit the value violates. */\n  level: Level;\n  /** That level's limit: the value is allowed up to it; a duplicated block is allowed below it. */\n  limit: number;\n}\n\nexport interface BlockLocation {\n  file: string;\n  startLine: number;\n  endLine: number;\n}\n\n/** One copy of a clone group. */\ninterface CloneOccurrence extends BlockLocation {\n  /**\n   * Its code lines matched in another copy, whose number is the length of a duplicated block. Its\n   * line span would also count the lines between the matched parts of one copy, which the copies\n   * do not share; a block matched as a whole by a near-miss copy holds all its code lines.\n   */\n  lineNumbers: readonly number[];\n  tokenCount: number;\n}\n\nexport interface Violation extends BlockLocation {\n  kind: 'function' | 'file' | 'duplication';\n  /** The most severe level among `exceeded`. */\n  level: Level;\n  /** The function's name, qualified with the class it is a member of, for kind `function`. */\n  name?: string;\n  exceeded: ExceededLimit[];\n  /**\n   * The parts adding the most to the cognitive complexity, largest first, for a function that\n   * exceeds a limit of it and has such parts: operator sequences and jumps outside any branching\n   * construct add to the complexity without being one.\n   */\n  largestBlocks?: CognitiveBlock[];\n  /** The other copies of the block, most matched tokens first, for kind `duplication`. */\n  partners?: BlockLocation[];\n}\n\nexport interface CheckResult {\n  violations: Violation[];\n  checkedFunctionCount: number;\n}\n\nconst violationKinds: readonly Violation['kind'][] = ['file', 'function', 'duplication'];\n\nconst cognitiveComplexityMetric = 'functionCognitiveComplexity';\n\nconst nestedInclusiveMetrics = new Set(\n  functionThresholds\n    .filter(({ includesNestedFunctions }) => includesNestedFunctions)\n    .map((threshold) => metricNameOf(threshold))\n);\n\n/** Every limit the files exceed, errors first, then ordered by path, then line. */\nexport function checkThresholds(\n  files: readonly CheckedFile[],\n  duplication: CheckedDuplication,\n  limitsOf: (language: string) => LimitsByLevel\n): CheckResult {\n  const crossFileGroupsByFile = indexGroupsByFile(duplication.crossFile, new Set(files.map(({ file }) => file)));\n  const violations: Violation[] = [];\n  let checkedFunctionCount = 0;\n  for (const checkedFile of files) {\n    const { file, metrics, hunks } = checkedFile;\n    const limits = limitsOf(metrics.language);\n    // A rename or a mode change lists the file as changed without touching any of its lines.\n    const fileExceeded = hunks?.length === 0 ? [] : collectExceeded(fileThresholds, metrics, limits);\n    if (fileExceeded.length > 0) {\n      violations.push(toViolation({ file, startLine: 1, endLine: metrics.lines.total }, 'file', fileExceeded));\n    }\n    const checkedFunctions = listCheckedFunctions(checkedFile);\n    checkedFunctionCount += checkedFunctions.length;\n    const exceedingFunctions = checkedFunctions\n      .map((fn) => ({ fn, exceeded: collectExceeded(functionThresholds, fn, limits) }))\n      .filter(({ exceeded }) => exceeded.length > 0);\n    for (const { fn, exceeded } of exceedingFunctions) {\n      const ownExceeded = exceeded.filter((limit) => !isReportedByEnclosingFunction(limit, fn, exceedingFunctions));\n      if (ownExceeded.length > 0) {\n        violations.push(toFunctionViolation(file, fn, ownExceeded));\n      }\n    }\n    violations.push(\n      ...collectDuplicationViolations(checkedFile, crossFileGroupsByFile.get(file) ?? [], limits, duplication)\n    );\n  }\n  return { violations: violations.toSorted(compareViolations), checkedFunctionCount };\n}\n\n// The kind is compared before the end line because a file violation's end line is corrected after\n// this ordering (to the last line that exists), and the order must not depend on that correction.\nfunction compareViolations(left: Violation, right: Violation): number {\n  return (\n    levels.indexOf(right.level) - levels.indexOf(left.level) ||\n    compareStrings(left.file, right.file) ||\n    left.startLine - right.startLine ||\n    violationKinds.indexOf(left.kind) - violationKinds.indexOf(right.kind) ||\n    left.endLine - right.endLine\n  );\n}\n\n/** The file's functions or, for a changed file, those the change touches. */\nfunction listCheckedFunctions({ metrics, hunks }: CheckedFile): FunctionMetrics[] {\n  const endsByIndentation = metrics.language === 'python';\n  return hunks\n    ? metrics.functions.filter((fn) =>\n        hunks.some((hunk) => touchesSpan(hunk, fn.startLine, fn.endLine, endsByIndentation))\n      )\n    : metrics.functions;\n}\n\n/**\n * Whether a function enclosing `fn` exceeds the same limit with a value that covers `fn`, so\n * reporting it for `fn` too would count the same code twice. The enclosing value is at least that\n * of `fn` and both share the file's limits, so its level is never milder.\n */\nfunction isReportedByEnclosingFunction(\n  limit: ExceededLimit,\n  fn: FunctionMetrics,\n  exceedingFunctions: readonly { fn: FunctionMetrics; exceeded: ExceededLimit[] }[]\n): boolean {\n  if (!nestedInclusiveMetrics.has(limit.metric)) {\n    return false;\n  }\n  return exceedingFunctions.some(\n    (outer) => outer.fn !== fn && encloses(outer.fn, fn) && outer.exceeded.some(({ metric }) => metric === limit.metric)\n  );\n}\n\nfunction encloses(outer: FunctionMetrics, inner: FunctionMetrics): boolean {\n  const startsBefore =\n    outer.startLine < inner.startLine ||\n    (outer.startLine === inner.startLine && outer.startColumn <= inner.startColumn);\n  const endsAfter =\n    outer.endLine > inner.endLine || (outer.endLine === inner.endLine && outer.endColumn >= inner.endColumn);\n  return startsBefore && endsAfter;\n}\n\nfunction toFunctionViolation(file: string, fn: FunctionMetrics, exceeded: ExceededLimit[]): Violation {\n  const { startLine, endLine } = fn;\n  const exceedsCognitiveComplexity = exceeded.some(({ metric }) => metric === cognitiveComplexityMetric);\n  return {\n    ...toViolation({ file, startLine, endLine }, 'function', exceeded),\n    name: qualifyFunctionName(fn),\n    ...(exceedsCognitiveComplexity && fn.cognitiveBlocks.length > 0 && { largestBlocks: fn.cognitiveBlocks }),\n  };\n}\n\n/** How reports name a function: with the type or module it is a member of, so that it can be found. */\nexport function qualifyFunctionName({ name = '<anonymous>', containerName }: FunctionMetrics): string {\n  return containerName ? `${containerName}.${name}` : name;\n}\n\nfunction toViolation(location: BlockLocation, kind: Violation['kind'], exceeded: ExceededLimit[]): Violation {\n  const level = exceeded.some((limit) => limit.level === 'error') ? 'error' : 'warning';\n  return { kind, level, ...location, exceeded };\n}\n\nfunction collectExceeded<Subject>(\n  thresholds: readonly Threshold<Subject>[],\n  subject: Subject,\n  limits: LimitsByLevel\n): ExceededLimit[] {\n  return thresholds.flatMap((threshold) => findExceeded(threshold, subject, limits, (value, limit) => value > limit));\n}\n\n/** The most severe violated limit of the threshold, if any. */\nfunction findExceeded<Subject>(\n  threshold: Threshold<Subject>,\n  subject: Subject,\n  limits: LimitsByLevel,\n  violates: (value: number, limit: number) => boolean\n): ExceededLimit[] {\n  const value = threshold.measure(subject);\n  const level = levels.findLast((candidate) => violates(value, limits[candidate][threshold.key] as number));\n  return level\n    ? [{ metric: metricNameOf(threshold), value, level, limit: limits[level][threshold.key] as number }]\n    : [];\n}\n\n/**\n * Whether the hunk changes the head lines [startLine, endLine]. A hunk without head lines (a pure\n * deletion) sits between its headStart line and the next one. Where indentation ends a span, its\n * last line is a statement rather than a closing delimiter, so a deletion right after that line may\n * have removed the span's tail; `endsByIndentation` counts it as touching, since the head alone\n * cannot tell it from a deletion after the span.\n */\nfunction touchesSpan(hunk: LineHunk, startLine: number, endLine: number, endsByIndentation = false): boolean {\n  return hunk.headCount === 0\n    ? hunk.headStart >= startLine && (hunk.headStart < endLine || (endsByIndentation && hunk.headStart === endLine))\n    : hunk.headStart <= endLine && hunk.headStart + hunk.headCount > startLine;\n}\n\n/** The cross-file groups with an occurrence in each of the given files. */\nfunction indexGroupsByFile(\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  files: ReadonlySet<string>\n): Map<string, CrossFileDuplicateBlockGroup[]> {\n  const groupsByFile = new Map<string, CrossFileDuplicateBlockGroup[]>();\n  for (const group of crossFileDuplication?.groups ?? []) {\n    for (const file of group.files) {\n      if (files.has(file)) {\n        const groups = groupsByFile.get(file) ?? [];\n        groups.push(group);\n        groupsByFile.set(file, groups);\n      }\n    }\n  }\n  return groupsByFile;\n}\n\n/**\n * One violation per duplicated region of the file: its clone occurrences, within-file and\n * cross-file, that hold at least the duplicated lines of a level (with `hunks`, only those\n * overlapping added lines), with overlapping occurrences merged into one region.\n */\nfunction collectDuplicationViolations(\n  { file, metrics, hunks }: CheckedFile,\n  crossFileGroups: readonly CrossFileDuplicateBlockGroup[],\n  limits: LimitsByLevel,\n  { minSimilarityPercent }: CheckedDuplication\n): Violation[] {\n  const findExceededLines = (duplicatedLineCount: number): ExceededLimit[] =>\n    findExceeded(duplicationThreshold, { duplicatedLineCount }, limits, (value, limit) => value >= limit);\n  const groups: CloneOccurrence[][] = [\n    ...metrics.duplication.duplicateBlockGroups.map((group) => group.map((occurrence) => ({ ...occurrence, file }))),\n    ...crossFileGroups.map((group) => group.occurrences.map((occurrence) => toCloneOccurrence(occurrence))),\n  ];\n  const isReported = (block: CloneOccurrence): boolean =>\n    block.file === file &&\n    findExceededLines(block.lineNumbers.length).length > 0 &&\n    (!hunks || hunks.some((hunk) => hunk.headCount > 0 && touchesSpan(hunk, block.startLine, block.endLine)));\n  const groupByBlock = new Map<CloneOccurrence, CloneOccurrence[]>();\n  for (const group of groups) {\n    for (const block of group.filter((occurrence) => isReported(occurrence))) {\n      groupByBlock.set(block, group);\n    }\n  }\n  return mergeOverlapping([...groupByBlock.keys()]).map(({ merged, sources }) => {\n    const listCopies = (minTokenPercent: number): BlockLocation[] =>\n      mergeOverlapping(\n        sources.flatMap((source) => {\n          // The region merges every clone that overlaps it, so a copy of an occurrence lying\n          // within a larger one is measured against the larger one.\n          const tokenCount = Math.max(\n            ...sources.filter((outer) => contains(outer, source)).map((outer) => outer.tokenCount)\n          );\n          return (groupByBlock.get(source) ?? []).filter(\n            (copy) => copy.tokenCount * 100 >= tokenCount * minTokenPercent\n          );\n        })\n      )\n        // The region's own occurrences are among the copies of the groups it belongs to.\n        .filter((partner) => !overlaps(partner.merged, merged))\n        // The largest say the most about what to share.\n        .toSorted((left, right) => sumTokens(right.sources) - sumTokens(left.sources))\n        .map((partner) => partner.merged);\n    // A group joins a block with every place repeating a part of it: a function another file\n    // copies whole is grouped with each file holding a few of its lines. Such a fragment is not a\n    // copy of the block: sharing it would not remove the block, and a report listing it reads as\n    // one more copy. Sizes are compared in tokens, since the same code may be laid out over any\n    // number of lines.\n    const copies = listCopies(minSimilarityPercent);\n    return {\n      ...toViolation(\n        merged,\n        'duplication',\n        // Occurrences that overlap share lines, which count once.\n        findExceededLines(new Set(sources.flatMap((source) => source.lineNumbers)).size)\n      ),\n      // A group does not always hold the copy a block was matched with as a whole: within a file,\n      // a copy that already belongs to an exact group is listed as its part in that group. The\n      // fragments then are all that locates the block's copies.\n      partners: copies.length > 0 ? copies : listCopies(0),\n    };\n  });\n}\n\nfunction toCloneOccurrence(occurrence: CrossFileDuplicateOccurrence): CloneOccurrence {\n  const { lineNumbers } = occurrence;\n  assert.ok(lineNumbers, `No matched lines for ${occurrence.file}, a scanned file.`);\n  return { ...occurrence, lineNumbers };\n}\n\nfunction sumTokens(occurrences: readonly CloneOccurrence[]): number {\n  return occurrences.reduce((sum, occurrence) => sum + occurrence.tokenCount, 0);\n}\n\n/** The locations with those overlapping in the same file merged, ordered by file, then line. */\nfunction mergeOverlapping(\n  locations: readonly CloneOccurrence[]\n): { merged: BlockLocation; sources: CloneOccurrence[] }[] {\n  const regions: { merged: BlockLocation; sources: CloneOccurrence[] }[] = [];\n  const ordered = locations.toSorted(\n    (left, right) => compareStrings(left.file, right.file) || left.startLine - right.startLine\n  );\n  for (const location of ordered) {\n    const last = regions.at(-1);\n    if (last && overlaps(last.merged, location)) {\n      last.merged.endLine = Math.max(last.merged.endLine, location.endLine);\n      last.sources.push(location);\n    } else {\n      const { file, startLine, endLine } = location;\n      regions.push({ merged: { file, startLine, endLine }, sources: [location] });\n    }\n  }\n  return regions;\n}\n\n/** Whether `outer` spans every line of `inner`; a block contains itself. */\nfunction contains(outer: BlockLocation, inner: BlockLocation): boolean {\n  return outer.file === inner.file && outer.startLine <= inner.startLine && inner.endLine <= outer.endLine;\n}\n\nfunction overlaps(left: BlockLocation, right: BlockLocation): boolean {\n  return left.file === right.file && left.startLine <= right.endLine && right.startLine <= left.endLine;\n}\n\n/** Code-unit order, so reports do not depend on the locale. */\nfunction compareStrings(left: string, right: string): number {\n  return left < right ? -1 : left > right ? 1 : 0;\n}\n"],"mappings":"6IAkFA,MAAM,EAA+C,CAAC,OAAQ,WAAY,aAAa,EAIjF,EAAyB,IAAI,IACjCA,EAAAA,mBACG,QAAQ,CAAE,6BAA8B,CAAuB,CAAC,CAChE,IAAK,GAAcC,EAAAA,aAAa,CAAS,CAAC,CAC/C,EAGA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAwB,EAAkB,EAAY,UAAW,IAAI,IAAI,EAAM,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EACvG,EAA0B,CAAC,EAC7B,EAAuB,EAC3B,IAAK,IAAM,KAAe,EAAO,CAC/B,GAAM,CAAE,OAAM,UAAS,SAAU,EAC3B,EAAS,EAAS,EAAQ,QAAQ,EAElC,EAAe,GAAO,SAAW,EAAI,CAAC,EAAI,EAAgBC,EAAAA,eAAgB,EAAS,CAAM,EAC3F,EAAa,OAAS,GACxB,EAAW,KAAK,EAAY,CAAE,OAAM,UAAW,EAAG,QAAS,EAAQ,MAAM,KAAM,EAAG,OAAQ,CAAY,CAAC,EAEzG,IAAM,EAAmB,EAAqB,CAAW,EACzD,GAAwB,EAAiB,OACzC,IAAM,EAAqB,EACxB,IAAK,IAAQ,CAAE,KAAI,SAAU,EAAgBF,EAAAA,mBAAoB,EAAI,CAAM,CAAE,EAAE,CAAC,CAChF,QAAQ,CAAE,cAAe,EAAS,OAAS,CAAC,EAC/C,IAAK,GAAM,CAAE,KAAI,cAAc,EAAoB,CACjD,IAAM,EAAc,EAAS,OAAQ,GAAU,CAAC,EAA8B,EAAO,EAAI,CAAkB,CAAC,EACxG,EAAY,OAAS,GACvB,EAAW,KAAK,EAAoB,EAAM,EAAI,CAAW,CAAC,CAE9D,CACA,EAAW,KACT,GAAG,EAA6B,EAAa,EAAsB,IAAI,CAAI,GAAK,CAAC,EAAG,EAAQ,CAAW,CACzG,CACF,CACA,MAAO,CAAE,WAAY,EAAW,SAAS,CAAiB,EAAG,sBAAqB,CACpF,CAIA,SAAS,EAAkB,EAAiB,EAA0B,CACpE,OACEG,EAAAA,OAAO,QAAQ,EAAM,KAAK,EAAIA,EAAAA,OAAO,QAAQ,EAAK,KAAK,GACvD,EAAe,EAAK,KAAM,EAAM,IAAI,GACpC,EAAK,UAAY,EAAM,WACvB,EAAe,QAAQ,EAAK,IAAI,EAAI,EAAe,QAAQ,EAAM,IAAI,GACrE,EAAK,QAAU,EAAM,OAEzB,CAGA,SAAS,EAAqB,CAAE,UAAS,SAAyC,CAChF,IAAM,EAAoB,EAAQ,WAAa,SAC/C,OAAO,EACH,EAAQ,UAAU,OAAQ,GACxB,EAAM,KAAM,GAAS,EAAY,EAAM,EAAG,UAAW,EAAG,QAAS,CAAiB,CAAC,CACrF,EACA,EAAQ,SACd,CAOA,SAAS,EACP,EACA,EACA,EACS,CAIT,OAHK,EAAuB,IAAI,EAAM,MAAM,EAGrC,EAAmB,KACvB,GAAU,EAAM,KAAO,GAAM,EAAS,EAAM,GAAI,CAAE,GAAK,EAAM,SAAS,MAAM,CAAE,YAAa,IAAW,EAAM,MAAM,CACrH,EAJS,EAKX,CAEA,SAAS,EAAS,EAAwB,EAAiC,CACzE,IAAM,EACJ,EAAM,UAAY,EAAM,WACvB,EAAM,YAAc,EAAM,WAAa,EAAM,aAAe,EAAM,YAC/D,EACJ,EAAM,QAAU,EAAM,SAAY,EAAM,UAAY,EAAM,SAAW,EAAM,WAAa,EAAM,UAChG,OAAO,GAAgB,CACzB,CAEA,SAAS,EAAoB,EAAc,EAAqB,EAAsC,CACpG,GAAM,CAAE,YAAW,WAAY,EACzB,EAA6B,EAAS,MAAM,CAAE,YAAa,IAAW,6BAAyB,EACrG,MAAO,CACL,GAAG,EAAY,CAAE,OAAM,YAAW,SAAQ,EAAG,WAAY,CAAQ,EACjE,KAAM,EAAoB,CAAE,EAC5B,GAAI,GAA8B,EAAG,gBAAgB,OAAS,GAAK,CAAE,cAAe,EAAG,eAAgB,CACzG,CACF,CAGA,SAAgB,EAAoB,CAAE,OAAO,cAAe,iBAA0C,CACpG,OAAO,EAAgB,GAAG,EAAc,GAAG,IAAS,CACtD,CAEA,SAAS,EAAY,EAAyB,EAAyB,EAAsC,CAE3G,MAAO,CAAE,OAAM,MADD,EAAS,KAAM,GAAU,EAAM,QAAU,OAAO,EAAI,QAAU,UACtD,GAAG,EAAU,UAAS,CAC9C,CAEA,SAAS,EACP,EACA,EACA,EACiB,CACjB,OAAO,EAAW,QAAS,GAAc,EAAa,EAAW,EAAS,GAAS,EAAO,IAAU,EAAQ,CAAK,CAAC,CACpH,CAGA,SAAS,EACP,EACA,EACA,EACA,EACiB,CACjB,IAAM,EAAQ,EAAU,QAAQ,CAAO,EACjC,EAAQA,EAAAA,OAAO,SAAU,GAAc,EAAS,EAAO,EAAO,EAAU,CAAC,EAAU,IAAc,CAAC,EACxG,OAAO,EACH,CAAC,CAAE,OAAQF,EAAAA,aAAa,CAAS,EAAG,QAAO,QAAO,MAAO,EAAO,EAAM,CAAC,EAAU,IAAe,CAAC,EACjG,CAAC,CACP,CASA,SAAS,EAAY,EAAgB,EAAmB,EAAiB,EAAoB,GAAgB,CAC3G,OAAO,EAAK,YAAc,EACtB,EAAK,WAAa,IAAc,EAAK,UAAY,GAAY,GAAqB,EAAK,YAAc,GACrG,EAAK,WAAa,GAAW,EAAK,UAAY,EAAK,UAAY,CACrE,CAGA,SAAS,EACP,EACA,EAC6C,CAC7C,IAAM,kBAAe,IAAI,IACzB,IAAK,IAAM,KAAS,GAAsB,QAAU,CAAC,EACnD,IAAK,IAAM,KAAQ,EAAM,MACvB,GAAI,EAAM,IAAI,CAAI,EAAG,CACnB,IAAM,EAAS,EAAa,IAAI,CAAI,GAAK,CAAC,EAC1C,EAAO,KAAK,CAAK,EACjB,EAAa,IAAI,EAAM,CAAM,CAC/B,CAGJ,OAAO,CACT,CAOA,SAAS,EACP,CAAE,OAAM,UAAS,SACjB,EACA,EACA,CAAE,wBACW,CACb,IAAM,EAAqB,GACzB,EAAaG,EAAAA,qBAAsB,CAAE,qBAAoB,EAAG,GAAS,EAAO,IAAU,GAAS,CAAK,EAChG,EAA8B,CAClC,GAAG,EAAQ,YAAY,qBAAqB,IAAK,GAAU,EAAM,IAAK,IAAgB,CAAE,GAAG,EAAY,MAAK,EAAE,CAAC,EAC/G,GAAG,EAAgB,IAAK,GAAU,EAAM,YAAY,IAAK,GAAe,EAAkB,CAAU,CAAC,CAAC,CACxG,EACM,EAAc,GAClB,EAAM,OAAS,GACf,EAAkB,EAAM,YAAY,MAAM,CAAC,CAAC,OAAS,IACpD,CAAC,GAAS,EAAM,KAAM,GAAS,EAAK,UAAY,GAAK,EAAY,EAAM,EAAM,UAAW,EAAM,OAAO,CAAC,GACnG,kBAAe,IAAI,IACzB,IAAK,IAAM,KAAS,EAClB,IAAK,IAAM,KAAS,EAAM,OAAQ,GAAe,EAAW,CAAU,CAAC,EACrE,EAAa,IAAI,EAAO,CAAK,EAGjC,OAAO,EAAiB,CAAC,GAAG,EAAa,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAE,SAAQ,aAAc,CAC7E,IAAM,EAAc,GAClB,EACE,EAAQ,QAAS,GAAW,CAG1B,IAAM,EAAa,KAAK,IACtB,GAAG,EAAQ,OAAQ,GAAU,EAAS,EAAO,CAAM,CAAC,CAAC,CAAC,IAAK,GAAU,EAAM,UAAU,CACvF,EACA,OAAQ,EAAa,IAAI,CAAM,GAAK,CAAC,EAAA,CAAG,OACrC,GAAS,EAAK,WAAa,KAAO,EAAa,CAClD,CACF,CAAC,CACH,CAAC,CAEE,OAAQ,GAAY,CAAC,EAAS,EAAQ,OAAQ,CAAM,CAAC,CAAC,CAEtD,UAAU,EAAM,IAAU,EAAU,EAAM,OAAO,EAAI,EAAU,EAAK,OAAO,CAAC,CAAC,CAC7E,IAAK,GAAY,EAAQ,MAAM,EAM9B,EAAS,EAAW,CAAoB,EAC9C,MAAO,CACL,GAAG,EACD,EACA,cAEA,EAAkB,IAAI,IAAI,EAAQ,QAAS,GAAW,EAAO,WAAW,CAAC,CAAC,CAAC,IAAI,CACjF,EAIA,SAAU,EAAO,OAAS,EAAI,EAAS,EAAW,CAAC,CACrD,CACF,CAAC,CACH,CAEA,SAAS,EAAkB,EAA2D,CACpF,GAAM,CAAE,eAAgB,EAExB,OADA,EAAA,QAAO,GAAG,EAAa,wBAAwB,EAAW,KAAK,kBAAkB,EAC1E,CAAE,GAAG,EAAY,aAAY,CACtC,CAEA,SAAS,EAAU,EAAiD,CAClE,OAAO,EAAY,QAAQ,EAAK,IAAe,EAAM,EAAW,WAAY,CAAC,CAC/E,CAGA,SAAS,EACP,EACyD,CACzD,IAAM,EAAmE,CAAC,EACpE,EAAU,EAAU,UACvB,EAAM,IAAU,EAAe,EAAK,KAAM,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SACnF,EACA,IAAK,IAAM,KAAY,EAAS,CAC9B,IAAM,EAAO,EAAQ,GAAG,EAAE,EAC1B,GAAI,GAAQ,EAAS,EAAK,OAAQ,CAAQ,EACxC,EAAK,OAAO,QAAU,KAAK,IAAI,EAAK,OAAO,QAAS,EAAS,OAAO,EACpE,EAAK,QAAQ,KAAK,CAAQ,MACrB,CACL,GAAM,CAAE,OAAM,YAAW,WAAY,EACrC,EAAQ,KAAK,CAAE,OAAQ,CAAE,OAAM,YAAW,SAAQ,EAAG,QAAS,CAAC,CAAQ,CAAE,CAAC,CAC5E,CACF,CACA,OAAO,CACT,CAGA,SAAS,EAAS,EAAsB,EAA+B,CACrE,OAAO,EAAM,OAAS,EAAM,MAAQ,EAAM,WAAa,EAAM,WAAa,EAAM,SAAW,EAAM,OACnG,CAEA,SAAS,EAAS,EAAqB,EAA+B,CACpE,OAAO,EAAK,OAAS,EAAM,MAAQ,EAAK,WAAa,EAAM,SAAW,EAAM,WAAa,EAAK,OAChG,CAGA,SAAS,EAAe,EAAc,EAAuB,CAC3D,OAAO,EAAO,EAAQ,GAAK,IAAO,EACpC"}

package/dist/thresholdCheck.d.ts

@@ -1,7 +1,7 @@
 import type { CrossFileDuplicationMetrics } from './crossFileDuplication.js';
 import type { LineHunk } from './git.js';
 import { type Level, type LimitsByLevel } from './thresholds.js';
-import type { CodeMetrics } from './types.js';
+import type { CodeMetrics, CognitiveBlock, FunctionMetrics } from './types.js';
 /** A measured file to check, under the path cross-file duplication knows it by. */
 export interface CheckedFile {
     file: string;
@@ -9,6 +9,12 @@ export interface CheckedFile {
     /** The change to the file; when set, only what the change touches is checked. */
     hunks?: readonly LineHunk[];
 }
+/** The duplication of the measured files, in which duplicated blocks and their copies are found. */
+export interface CheckedDuplication {
+    crossFile?: CrossFileDuplicationMetrics;
+    /** The detection's `minSimilarityPercent`, the share of a block a copy of it holds at least. */
+    minSimilarityPercent: number;
+}
 export interface ExceededLimit {
     metric: string;
     value: number;
@@ -26,10 +32,16 @@ export interface Violation extends BlockLocation {
     kind: 'function' | 'file' | 'duplication';
     /** The most severe level among `exceeded`. */
     level: Level;
-    /** The function's name, for kind `function`. */
+    /** The function's name, qualified with the class it is a member of, for kind `function`. */
     name?: string;
     exceeded: ExceededLimit[];
-    /** The other copies of the block, for kind `duplication`. */
+    /**
+     * The parts adding the most to the cognitive complexity, largest first, for a function that
+     * exceeds a limit of it and has such parts: operator sequences and jumps outside any branching
+     * construct add to the complexity without being one.
+     */
+    largestBlocks?: CognitiveBlock[];
+    /** The other copies of the block, most matched tokens first, for kind `duplication`. */
     partners?: BlockLocation[];
 }
 export interface CheckResult {
@@ -37,4 +49,6 @@ export interface CheckResult {
     checkedFunctionCount: number;
 }
 /** Every limit the files exceed, errors first, then ordered by path, then line. */
-export declare function checkThresholds(files: readonly CheckedFile[], crossFileDuplication: CrossFileDuplicationMetrics | undefined, limitsOf: (language: string) => LimitsByLevel): CheckResult;
+export declare function checkThresholds(files: readonly CheckedFile[], duplication: CheckedDuplication, limitsOf: (language: string) => LimitsByLevel): CheckResult;
+/** How reports name a function: with the type or module it is a member of, so that it can be found. */
+export declare function qualifyFunctionName({ name, containerName }: FunctionMetrics): string;

package/dist/thresholdCheck.js

@@ -1,2 +1,2 @@
-import{duplicationThreshold as e,fileThresholds as t,functionThresholds as n,levels as r,metricNameOf as i}from"./thresholds.js";const a=[`file`,`function`,`duplication`],o=new Set(n.filter(({includesNestedFunctions:e})=>e).map(e=>i(e)));function s(e,r,i){let a=g(r,new Set(e.map(({file:e})=>e))),o=[],s=0;for(let r of e){let{file:e,metrics:c,hunks:d}=r,m=i(c.language),h=d?.length===0?[]:p(t,c,m);h.length>0&&o.push(f({file:e,startLine:1,endLine:c.lines.total},`file`,h));let g=l(r);s+=g.length;let v=g.map(e=>({fn:e,exceeded:p(n,e,m)})).filter(({exceeded:e})=>e.length>0);for(let{fn:t,exceeded:n}of v){let r=n.filter(e=>!u(e,t,v));if(r.length>0){let{startLine:n,endLine:i}=t;o.push({...f({file:e,startLine:n,endLine:i},`function`,r),name:t.name??`<anonymous>`})}}o.push(..._(e,c,a.get(e)??[],d,m))}return{violations:o.toSorted(c),checkedFunctionCount:s}}function c(e,t){return r.indexOf(t.level)-r.indexOf(e.level)||b(e.file,t.file)||e.startLine-t.startLine||a.indexOf(e.kind)-a.indexOf(t.kind)||e.endLine-t.endLine}function l({metrics:e,hunks:t}){let n=e.language===`python`;return t?e.functions.filter(e=>t.some(t=>h(t,e.startLine,e.endLine,n))):e.functions}function u(e,t,n){return o.has(e.metric)?n.some(n=>n.fn!==t&&d(n.fn,t)&&n.exceeded.some(({metric:t})=>t===e.metric)):!1}function d(e,t){let n=e.startLine<t.startLine||e.startLine===t.startLine&&e.startColumn<=t.startColumn,r=e.endLine>t.endLine||e.endLine===t.endLine&&e.endColumn>=t.endColumn;return n&&r}function f(e,t,n){return{kind:t,level:n.some(e=>e.level===`error`)?`error`:`warning`,...e,exceeded:n}}function p(e,t,n){return e.flatMap(e=>m(e,t,n,(e,t)=>e>t))}function m(e,t,n,a){let o=e.measure(t),s=r.findLast(t=>a(o,n[t][e.key]));return s?[{metric:i(e),value:o,level:s,limit:n[s][e.key]}]:[]}function h(e,t,n,r=!1){return e.headCount===0?e.headStart>=t&&(e.headStart<n||r&&e.headStart===n):e.headStart<=n&&e.headStart+e.headCount>t}function g(e,t){let n=/* @__PURE__ */ new Map;for(let r of e?.groups??[])for(let e of r.files)if(t.has(e)){let t=n.get(e)??[];t.push(r),n.set(e,t)}return n}function _(t,n,r,i,a){let o=t=>m(e,t,a,(e,t)=>e>=t),s=[...n.duplication.duplicateBlockGroups.map(e=>e.map(e=>({...e,file:t}))),...r.map(e=>e.occurrences)],c=e=>e.file===t&&o(e).length>0&&(!i||i.some(t=>t.headCount>0&&h(t,e.startLine,e.endLine))),l=/* @__PURE__ */ new Map;for(let e of s)for(let t of e.filter(e=>c(e)))l.set(t,e);return v([...l.keys()]).map(({merged:e,sources:t})=>({...f(e,`duplication`,o(e)),partners:v(t.flatMap(e=>l.get(e)??[])).map(e=>e.merged).filter(t=>!y(t,e))}))}function v(e){let t=[],n=e.toSorted((e,t)=>b(e.file,t.file)||e.startLine-t.startLine);for(let e of n){let n=t.at(-1);if(n&&y(n.merged,e))n.merged.endLine=Math.max(n.merged.endLine,e.endLine),n.sources.push(e);else{let{file:n,startLine:r,endLine:i}=e;t.push({merged:{file:n,startLine:r,endLine:i},sources:[e]})}}return t}function y(e,t){return e.file===t.file&&e.startLine<=t.endLine&&t.startLine<=e.endLine}function b(e,t){return e<t?-1:+(e>t)}export{s as checkThresholds};
+import{duplicationThreshold as e,fileThresholds as t,functionThresholds as n,levels as r,metricNameOf as i}from"./thresholds.js";import a from"node:assert";const o=[`file`,`function`,`duplication`],s=new Set(n.filter(({includesNestedFunctions:e})=>e).map(e=>i(e)));function c(e,r,i){let a=y(r.crossFile,new Set(e.map(({file:e})=>e))),o=[],s=0;for(let c of e){let{file:e,metrics:l,hunks:f}=c,m=i(l.language),_=f?.length===0?[]:g(t,l,m);_.length>0&&o.push(h({file:e,startLine:1,endLine:l.lines.total},`file`,_));let v=u(c);s+=v.length;let y=v.map(e=>({fn:e,exceeded:g(n,e,m)})).filter(({exceeded:e})=>e.length>0);for(let{fn:t,exceeded:n}of y){let r=n.filter(e=>!d(e,t,y));r.length>0&&o.push(p(e,t,r))}o.push(...b(c,a.get(e)??[],m,r))}return{violations:o.toSorted(l),checkedFunctionCount:s}}function l(e,t){return r.indexOf(t.level)-r.indexOf(e.level)||E(e.file,t.file)||e.startLine-t.startLine||o.indexOf(e.kind)-o.indexOf(t.kind)||e.endLine-t.endLine}function u({metrics:e,hunks:t}){let n=e.language===`python`;return t?e.functions.filter(e=>t.some(t=>v(t,e.startLine,e.endLine,n))):e.functions}function d(e,t,n){return s.has(e.metric)?n.some(n=>n.fn!==t&&f(n.fn,t)&&n.exceeded.some(({metric:t})=>t===e.metric)):!1}function f(e,t){let n=e.startLine<t.startLine||e.startLine===t.startLine&&e.startColumn<=t.startColumn,r=e.endLine>t.endLine||e.endLine===t.endLine&&e.endColumn>=t.endColumn;return n&&r}function p(e,t,n){let{startLine:r,endLine:i}=t,a=n.some(({metric:e})=>e===`functionCognitiveComplexity`);return{...h({file:e,startLine:r,endLine:i},`function`,n),name:m(t),...a&&t.cognitiveBlocks.length>0&&{largestBlocks:t.cognitiveBlocks}}}function m({name:e=`<anonymous>`,containerName:t}){return t?`${t}.${e}`:e}function h(e,t,n){return{kind:t,level:n.some(e=>e.level===`error`)?`error`:`warning`,...e,exceeded:n}}function g(e,t,n){return e.flatMap(e=>_(e,t,n,(e,t)=>e>t))}function _(e,t,n,a){let o=e.measure(t),s=r.findLast(t=>a(o,n[t][e.key]));return s?[{metric:i(e),value:o,level:s,limit:n[s][e.key]}]:[]}function v(e,t,n,r=!1){return e.headCount===0?e.headStart>=t&&(e.headStart<n||r&&e.headStart===n):e.headStart<=n&&e.headStart+e.headCount>t}function y(e,t){let n=/* @__PURE__ */ new Map;for(let r of e?.groups??[])for(let e of r.files)if(t.has(e)){let t=n.get(e)??[];t.push(r),n.set(e,t)}return n}function b({file:t,metrics:n,hunks:r},i,a,{minSimilarityPercent:o}){let s=t=>_(e,{duplicatedLineCount:t},a,(e,t)=>e>=t),c=[...n.duplication.duplicateBlockGroups.map(e=>e.map(e=>({...e,file:t}))),...i.map(e=>e.occurrences.map(e=>x(e)))],l=e=>e.file===t&&s(e.lineNumbers.length).length>0&&(!r||r.some(t=>t.headCount>0&&v(t,e.startLine,e.endLine))),u=/* @__PURE__ */ new Map;for(let e of c)for(let t of e.filter(e=>l(e)))u.set(t,e);return C([...u.keys()]).map(({merged:e,sources:t})=>{let n=n=>C(t.flatMap(e=>{let r=Math.max(...t.filter(t=>w(t,e)).map(e=>e.tokenCount));return(u.get(e)??[]).filter(e=>e.tokenCount*100>=r*n)})).filter(t=>!T(t.merged,e)).toSorted((e,t)=>S(t.sources)-S(e.sources)).map(e=>e.merged),r=n(o);return{...h(e,`duplication`,s(new Set(t.flatMap(e=>e.lineNumbers)).size)),partners:r.length>0?r:n(0)}})}function x(e){let{lineNumbers:t}=e;return a.ok(t,`No matched lines for ${e.file}, a scanned file.`),{...e,lineNumbers:t}}function S(e){return e.reduce((e,t)=>e+t.tokenCount,0)}function C(e){let t=[],n=e.toSorted((e,t)=>E(e.file,t.file)||e.startLine-t.startLine);for(let e of n){let n=t.at(-1);if(n&&T(n.merged,e))n.merged.endLine=Math.max(n.merged.endLine,e.endLine),n.sources.push(e);else{let{file:n,startLine:r,endLine:i}=e;t.push({merged:{file:n,startLine:r,endLine:i},sources:[e]})}}return t}function w(e,t){return e.file===t.file&&e.startLine<=t.startLine&&t.endLine<=e.endLine}function T(e,t){return e.file===t.file&&e.startLine<=t.endLine&&t.startLine<=e.endLine}function E(e,t){return e<t?-1:+(e>t)}export{c as checkThresholds,m as qualifyFunctionName};
 //# sourceMappingURL=thresholdCheck.js.map

package/dist/thresholdCheck.js.map

@@ -1 +1 @@
-{"version":3,"file":"thresholdCheck.js","names":[],"sources":["../src/thresholdCheck.ts"],"sourcesContent":["import type { CrossFileDuplicateBlockGroup, CrossFileDuplicationMetrics } from './crossFileDuplication.js';\nimport type { LineHunk } from './git.js';\nimport {\n  duplicationThreshold,\n  fileThresholds,\n  functionThresholds,\n  levels,\n  metricNameOf,\n  type Level,\n  type LimitsByLevel,\n  type Threshold,\n} from './thresholds.js';\nimport type { CodeMetrics, FunctionMetrics } from './types.js';\n\n/** A measured file to check, under the path cross-file duplication knows it by. */\nexport interface CheckedFile {\n  file: string;\n  metrics: CodeMetrics;\n  /** The change to the file; when set, only what the change touches is checked. */\n  hunks?: readonly LineHunk[];\n}\n\nexport interface ExceededLimit {\n  metric: string;\n  value: number;\n  /** The most severe level whose limit the value violates. */\n  level: Level;\n  /** That level's limit: the value is allowed up to it; a duplicated block is allowed below it. */\n  limit: number;\n}\n\nexport interface BlockLocation {\n  file: string;\n  startLine: number;\n  endLine: number;\n}\n\nexport interface Violation extends BlockLocation {\n  kind: 'function' | 'file' | 'duplication';\n  /** The most severe level among `exceeded`. */\n  level: Level;\n  /** The function's name, for kind `function`. */\n  name?: string;\n  exceeded: ExceededLimit[];\n  /** The other copies of the block, for kind `duplication`. */\n  partners?: BlockLocation[];\n}\n\nexport interface CheckResult {\n  violations: Violation[];\n  checkedFunctionCount: number;\n}\n\nconst violationKinds: readonly Violation['kind'][] = ['file', 'function', 'duplication'];\n\nconst nestedInclusiveMetrics = new Set(\n  functionThresholds\n    .filter(({ includesNestedFunctions }) => includesNestedFunctions)\n    .map((threshold) => metricNameOf(threshold))\n);\n\n/** Every limit the files exceed, errors first, then ordered by path, then line. */\nexport function checkThresholds(\n  files: readonly CheckedFile[],\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  limitsOf: (language: string) => LimitsByLevel\n): CheckResult {\n  const crossFileGroupsByFile = indexGroupsByFile(crossFileDuplication, new Set(files.map(({ file }) => file)));\n  const violations: Violation[] = [];\n  let checkedFunctionCount = 0;\n  for (const checkedFile of files) {\n    const { file, metrics, hunks } = checkedFile;\n    const limits = limitsOf(metrics.language);\n    // A rename or a mode change lists the file as changed without touching any of its lines.\n    const fileExceeded = hunks?.length === 0 ? [] : collectExceeded(fileThresholds, metrics, limits);\n    if (fileExceeded.length > 0) {\n      violations.push(toViolation({ file, startLine: 1, endLine: metrics.lines.total }, 'file', fileExceeded));\n    }\n    const checkedFunctions = listCheckedFunctions(checkedFile);\n    checkedFunctionCount += checkedFunctions.length;\n    const exceedingFunctions = checkedFunctions\n      .map((fn) => ({ fn, exceeded: collectExceeded(functionThresholds, fn, limits) }))\n      .filter(({ exceeded }) => exceeded.length > 0);\n    for (const { fn, exceeded } of exceedingFunctions) {\n      const ownExceeded = exceeded.filter((limit) => !isReportedByEnclosingFunction(limit, fn, exceedingFunctions));\n      if (ownExceeded.length > 0) {\n        const { startLine, endLine } = fn;\n        violations.push({\n          ...toViolation({ file, startLine, endLine }, 'function', ownExceeded),\n          name: fn.name ?? '<anonymous>',\n        });\n      }\n    }\n    violations.push(\n      ...collectDuplicationViolations(file, metrics, crossFileGroupsByFile.get(file) ?? [], hunks, limits)\n    );\n  }\n  return { violations: violations.toSorted(compareViolations), checkedFunctionCount };\n}\n\n// The kind is compared before the end line because a file violation's end line is corrected after\n// this ordering (to the last line that exists), and the order must not depend on that correction.\nfunction compareViolations(left: Violation, right: Violation): number {\n  return (\n    levels.indexOf(right.level) - levels.indexOf(left.level) ||\n    compareStrings(left.file, right.file) ||\n    left.startLine - right.startLine ||\n    violationKinds.indexOf(left.kind) - violationKinds.indexOf(right.kind) ||\n    left.endLine - right.endLine\n  );\n}\n\n/** The file's functions or, for a changed file, those the change touches. */\nfunction listCheckedFunctions({ metrics, hunks }: CheckedFile): FunctionMetrics[] {\n  const endsByIndentation = metrics.language === 'python';\n  return hunks\n    ? metrics.functions.filter((fn) =>\n        hunks.some((hunk) => touchesSpan(hunk, fn.startLine, fn.endLine, endsByIndentation))\n      )\n    : metrics.functions;\n}\n\n/**\n * Whether a function enclosing `fn` exceeds the same limit with a value that covers `fn`, so\n * reporting it for `fn` too would count the same code twice. The enclosing value is at least that\n * of `fn` and both share the file's limits, so its level is never milder.\n */\nfunction isReportedByEnclosingFunction(\n  limit: ExceededLimit,\n  fn: FunctionMetrics,\n  exceedingFunctions: readonly { fn: FunctionMetrics; exceeded: ExceededLimit[] }[]\n): boolean {\n  if (!nestedInclusiveMetrics.has(limit.metric)) {\n    return false;\n  }\n  return exceedingFunctions.some(\n    (outer) => outer.fn !== fn && encloses(outer.fn, fn) && outer.exceeded.some(({ metric }) => metric === limit.metric)\n  );\n}\n\nfunction encloses(outer: FunctionMetrics, inner: FunctionMetrics): boolean {\n  const startsBefore =\n    outer.startLine < inner.startLine ||\n    (outer.startLine === inner.startLine && outer.startColumn <= inner.startColumn);\n  const endsAfter =\n    outer.endLine > inner.endLine || (outer.endLine === inner.endLine && outer.endColumn >= inner.endColumn);\n  return startsBefore && endsAfter;\n}\n\nfunction toViolation(location: BlockLocation, kind: Violation['kind'], exceeded: ExceededLimit[]): Violation {\n  const level = exceeded.some((limit) => limit.level === 'error') ? 'error' : 'warning';\n  return { kind, level, ...location, exceeded };\n}\n\nfunction collectExceeded<Subject>(\n  thresholds: readonly Threshold<Subject>[],\n  subject: Subject,\n  limits: LimitsByLevel\n): ExceededLimit[] {\n  return thresholds.flatMap((threshold) => findExceeded(threshold, subject, limits, (value, limit) => value > limit));\n}\n\n/** The most severe violated limit of the threshold, if any. */\nfunction findExceeded<Subject>(\n  threshold: Threshold<Subject>,\n  subject: Subject,\n  limits: LimitsByLevel,\n  violates: (value: number, limit: number) => boolean\n): ExceededLimit[] {\n  const value = threshold.measure(subject);\n  const level = levels.findLast((candidate) => violates(value, limits[candidate][threshold.key] as number));\n  return level\n    ? [{ metric: metricNameOf(threshold), value, level, limit: limits[level][threshold.key] as number }]\n    : [];\n}\n\n/**\n * Whether the hunk changes the head lines [startLine, endLine]. A hunk without head lines (a pure\n * deletion) sits between its headStart line and the next one. Where indentation ends a span, its\n * last line is a statement rather than a closing delimiter, so a deletion right after that line may\n * have removed the span's tail; `endsByIndentation` counts it as touching, since the head alone\n * cannot tell it from a deletion after the span.\n */\nfunction touchesSpan(hunk: LineHunk, startLine: number, endLine: number, endsByIndentation = false): boolean {\n  return hunk.headCount === 0\n    ? hunk.headStart >= startLine && (hunk.headStart < endLine || (endsByIndentation && hunk.headStart === endLine))\n    : hunk.headStart <= endLine && hunk.headStart + hunk.headCount > startLine;\n}\n\n/** The cross-file groups with an occurrence in each of the given files. */\nfunction indexGroupsByFile(\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  files: ReadonlySet<string>\n): Map<string, CrossFileDuplicateBlockGroup[]> {\n  const groupsByFile = new Map<string, CrossFileDuplicateBlockGroup[]>();\n  for (const group of crossFileDuplication?.groups ?? []) {\n    for (const file of group.files) {\n      if (files.has(file)) {\n        const groups = groupsByFile.get(file) ?? [];\n        groups.push(group);\n        groupsByFile.set(file, groups);\n      }\n    }\n  }\n  return groupsByFile;\n}\n\n/**\n * One violation per duplicated region of the file: its clone occurrences, within-file and\n * cross-file, that span at least the line count of a level (with `hunks`, only those overlapping\n * added lines), with overlapping occurrences merged into one region.\n */\nfunction collectDuplicationViolations(\n  file: string,\n  metrics: CodeMetrics,\n  crossFileGroups: readonly CrossFileDuplicateBlockGroup[],\n  hunks: readonly LineHunk[] | undefined,\n  limits: LimitsByLevel\n): Violation[] {\n  const findExceededLines = (block: BlockLocation): ExceededLimit[] =>\n    findExceeded(duplicationThreshold, block, limits, (value, limit) => value >= limit);\n  const groups: BlockLocation[][] = [\n    ...metrics.duplication.duplicateBlockGroups.map((group) => group.map((occurrence) => ({ ...occurrence, file }))),\n    ...crossFileGroups.map((group) => group.occurrences),\n  ];\n  const isReported = (block: BlockLocation): boolean =>\n    block.file === file &&\n    findExceededLines(block).length > 0 &&\n    (!hunks || hunks.some((hunk) => hunk.headCount > 0 && touchesSpan(hunk, block.startLine, block.endLine)));\n  const copiesByBlock = new Map<BlockLocation, BlockLocation[]>();\n  for (const group of groups) {\n    for (const block of group.filter((occurrence) => isReported(occurrence))) {\n      copiesByBlock.set(block, group);\n    }\n  }\n  return mergeOverlapping([...copiesByBlock.keys()]).map(({ merged, sources }) => ({\n    ...toViolation(merged, 'duplication', findExceededLines(merged)),\n    // The region's own occurrences are among the copies of the groups it belongs to.\n    partners: mergeOverlapping(sources.flatMap((source) => copiesByBlock.get(source) ?? []))\n      .map((partner) => partner.merged)\n      .filter((partner) => !overlaps(partner, merged)),\n  }));\n}\n\n/** The locations with those overlapping in the same file merged, ordered by file, then line. */\nfunction mergeOverlapping(locations: readonly BlockLocation[]): { merged: BlockLocation; sources: BlockLocation[] }[] {\n  const regions: { merged: BlockLocation; sources: BlockLocation[] }[] = [];\n  const ordered = locations.toSorted(\n    (left, right) => compareStrings(left.file, right.file) || left.startLine - right.startLine\n  );\n  for (const location of ordered) {\n    const last = regions.at(-1);\n    if (last && overlaps(last.merged, location)) {\n      last.merged.endLine = Math.max(last.merged.endLine, location.endLine);\n      last.sources.push(location);\n    } else {\n      const { file, startLine, endLine } = location;\n      regions.push({ merged: { file, startLine, endLine }, sources: [location] });\n    }\n  }\n  return regions;\n}\n\nfunction overlaps(left: BlockLocation, right: BlockLocation): boolean {\n  return left.file === right.file && left.startLine <= right.endLine && right.startLine <= left.endLine;\n}\n\n/** Code-unit order, so reports do not depend on the locale. */\nfunction compareStrings(left: string, right: string): number {\n  return left < right ? -1 : left > right ? 1 : 0;\n}\n"],"mappings":"iIAqDA,MAAM,EAA+C,CAAC,OAAQ,WAAY,aAAa,EAEjF,EAAyB,IAAI,IACjC,EACG,QAAQ,CAAE,6BAA8B,CAAuB,CAAC,CAChE,IAAK,GAAc,EAAa,CAAS,CAAC,CAC/C,EAGA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAwB,EAAkB,EAAsB,IAAI,IAAI,EAAM,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EACtG,EAA0B,CAAC,EAC7B,EAAuB,EAC3B,IAAK,IAAM,KAAe,EAAO,CAC/B,GAAM,CAAE,OAAM,UAAS,SAAU,EAC3B,EAAS,EAAS,EAAQ,QAAQ,EAElC,EAAe,GAAO,SAAW,EAAI,CAAC,EAAI,EAAgB,EAAgB,EAAS,CAAM,EAC3F,EAAa,OAAS,GACxB,EAAW,KAAK,EAAY,CAAE,OAAM,UAAW,EAAG,QAAS,EAAQ,MAAM,KAAM,EAAG,OAAQ,CAAY,CAAC,EAEzG,IAAM,EAAmB,EAAqB,CAAW,EACzD,GAAwB,EAAiB,OACzC,IAAM,EAAqB,EACxB,IAAK,IAAQ,CAAE,KAAI,SAAU,EAAgB,EAAoB,EAAI,CAAM,CAAE,EAAE,CAAC,CAChF,QAAQ,CAAE,cAAe,EAAS,OAAS,CAAC,EAC/C,IAAK,GAAM,CAAE,KAAI,cAAc,EAAoB,CACjD,IAAM,EAAc,EAAS,OAAQ,GAAU,CAAC,EAA8B,EAAO,EAAI,CAAkB,CAAC,EAC5G,GAAI,EAAY,OAAS,EAAG,CAC1B,GAAM,CAAE,YAAW,WAAY,EAC/B,EAAW,KAAK,CACd,GAAG,EAAY,CAAE,OAAM,YAAW,SAAQ,EAAG,WAAY,CAAW,EACpE,KAAM,EAAG,MAAQ,aACnB,CAAC,CACH,CACF,CACA,EAAW,KACT,GAAG,EAA6B,EAAM,EAAS,EAAsB,IAAI,CAAI,GAAK,CAAC,EAAG,EAAO,CAAM,CACrG,CACF,CACA,MAAO,CAAE,WAAY,EAAW,SAAS,CAAiB,EAAG,sBAAqB,CACpF,CAIA,SAAS,EAAkB,EAAiB,EAA0B,CACpE,OACE,EAAO,QAAQ,EAAM,KAAK,EAAI,EAAO,QAAQ,EAAK,KAAK,GACvD,EAAe,EAAK,KAAM,EAAM,IAAI,GACpC,EAAK,UAAY,EAAM,WACvB,EAAe,QAAQ,EAAK,IAAI,EAAI,EAAe,QAAQ,EAAM,IAAI,GACrE,EAAK,QAAU,EAAM,OAEzB,CAGA,SAAS,EAAqB,CAAE,UAAS,SAAyC,CAChF,IAAM,EAAoB,EAAQ,WAAa,SAC/C,OAAO,EACH,EAAQ,UAAU,OAAQ,GACxB,EAAM,KAAM,GAAS,EAAY,EAAM,EAAG,UAAW,EAAG,QAAS,CAAiB,CAAC,CACrF,EACA,EAAQ,SACd,CAOA,SAAS,EACP,EACA,EACA,EACS,CAIT,OAHK,EAAuB,IAAI,EAAM,MAAM,EAGrC,EAAmB,KACvB,GAAU,EAAM,KAAO,GAAM,EAAS,EAAM,GAAI,CAAE,GAAK,EAAM,SAAS,MAAM,CAAE,YAAa,IAAW,EAAM,MAAM,CACrH,EAJS,EAKX,CAEA,SAAS,EAAS,EAAwB,EAAiC,CACzE,IAAM,EACJ,EAAM,UAAY,EAAM,WACvB,EAAM,YAAc,EAAM,WAAa,EAAM,aAAe,EAAM,YAC/D,EACJ,EAAM,QAAU,EAAM,SAAY,EAAM,UAAY,EAAM,SAAW,EAAM,WAAa,EAAM,UAChG,OAAO,GAAgB,CACzB,CAEA,SAAS,EAAY,EAAyB,EAAyB,EAAsC,CAE3G,MAAO,CAAE,OAAM,MADD,EAAS,KAAM,GAAU,EAAM,QAAU,OAAO,EAAI,QAAU,UACtD,GAAG,EAAU,UAAS,CAC9C,CAEA,SAAS,EACP,EACA,EACA,EACiB,CACjB,OAAO,EAAW,QAAS,GAAc,EAAa,EAAW,EAAS,GAAS,EAAO,IAAU,EAAQ,CAAK,CAAC,CACpH,CAGA,SAAS,EACP,EACA,EACA,EACA,EACiB,CACjB,IAAM,EAAQ,EAAU,QAAQ,CAAO,EACjC,EAAQ,EAAO,SAAU,GAAc,EAAS,EAAO,EAAO,EAAU,CAAC,EAAU,IAAc,CAAC,EACxG,OAAO,EACH,CAAC,CAAE,OAAQ,EAAa,CAAS,EAAG,QAAO,QAAO,MAAO,EAAO,EAAM,CAAC,EAAU,IAAe,CAAC,EACjG,CAAC,CACP,CASA,SAAS,EAAY,EAAgB,EAAmB,EAAiB,EAAoB,GAAgB,CAC3G,OAAO,EAAK,YAAc,EACtB,EAAK,WAAa,IAAc,EAAK,UAAY,GAAY,GAAqB,EAAK,YAAc,GACrG,EAAK,WAAa,GAAW,EAAK,UAAY,EAAK,UAAY,CACrE,CAGA,SAAS,EACP,EACA,EAC6C,CAC7C,IAAM,kBAAe,IAAI,IACzB,IAAK,IAAM,KAAS,GAAsB,QAAU,CAAC,EACnD,IAAK,IAAM,KAAQ,EAAM,MACvB,GAAI,EAAM,IAAI,CAAI,EAAG,CACnB,IAAM,EAAS,EAAa,IAAI,CAAI,GAAK,CAAC,EAC1C,EAAO,KAAK,CAAK,EACjB,EAAa,IAAI,EAAM,CAAM,CAC/B,CAGJ,OAAO,CACT,CAOA,SAAS,EACP,EACA,EACA,EACA,EACA,EACa,CACb,IAAM,EAAqB,GACzB,EAAa,EAAsB,EAAO,GAAS,EAAO,IAAU,GAAS,CAAK,EAC9E,EAA4B,CAChC,GAAG,EAAQ,YAAY,qBAAqB,IAAK,GAAU,EAAM,IAAK,IAAgB,CAAE,GAAG,EAAY,MAAK,EAAE,CAAC,EAC/G,GAAG,EAAgB,IAAK,GAAU,EAAM,WAAW,CACrD,EACM,EAAc,GAClB,EAAM,OAAS,GACf,EAAkB,CAAK,CAAC,CAAC,OAAS,IACjC,CAAC,GAAS,EAAM,KAAM,GAAS,EAAK,UAAY,GAAK,EAAY,EAAM,EAAM,UAAW,EAAM,OAAO,CAAC,GACnG,kBAAgB,IAAI,IAC1B,IAAK,IAAM,KAAS,EAClB,IAAK,IAAM,KAAS,EAAM,OAAQ,GAAe,EAAW,CAAU,CAAC,EACrE,EAAc,IAAI,EAAO,CAAK,EAGlC,OAAO,EAAiB,CAAC,GAAG,EAAc,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAE,SAAQ,cAAe,CAC/E,GAAG,EAAY,EAAQ,cAAe,EAAkB,CAAM,CAAC,EAE/D,SAAU,EAAiB,EAAQ,QAAS,GAAW,EAAc,IAAI,CAAM,GAAK,CAAC,CAAC,CAAC,CAAC,CACrF,IAAK,GAAY,EAAQ,MAAM,CAAC,CAChC,OAAQ,GAAY,CAAC,EAAS,EAAS,CAAM,CAAC,CACnD,EAAE,CACJ,CAGA,SAAS,EAAiB,EAA4F,CACpH,IAAM,EAAiE,CAAC,EAClE,EAAU,EAAU,UACvB,EAAM,IAAU,EAAe,EAAK,KAAM,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SACnF,EACA,IAAK,IAAM,KAAY,EAAS,CAC9B,IAAM,EAAO,EAAQ,GAAG,EAAE,EAC1B,GAAI,GAAQ,EAAS,EAAK,OAAQ,CAAQ,EACxC,EAAK,OAAO,QAAU,KAAK,IAAI,EAAK,OAAO,QAAS,EAAS,OAAO,EACpE,EAAK,QAAQ,KAAK,CAAQ,MACrB,CACL,GAAM,CAAE,OAAM,YAAW,WAAY,EACrC,EAAQ,KAAK,CAAE,OAAQ,CAAE,OAAM,YAAW,SAAQ,EAAG,QAAS,CAAC,CAAQ,CAAE,CAAC,CAC5E,CACF,CACA,OAAO,CACT,CAEA,SAAS,EAAS,EAAqB,EAA+B,CACpE,OAAO,EAAK,OAAS,EAAM,MAAQ,EAAK,WAAa,EAAM,SAAW,EAAM,WAAa,EAAK,OAChG,CAGA,SAAS,EAAe,EAAc,EAAuB,CAC3D,OAAO,EAAO,EAAQ,GAAK,IAAO,EACpC"}
+{"version":3,"file":"thresholdCheck.js","names":[],"sources":["../src/thresholdCheck.ts"],"sourcesContent":["import assert from 'node:assert';\nimport type {\n  CrossFileDuplicateBlockGroup,\n  CrossFileDuplicateOccurrence,\n  CrossFileDuplicationMetrics,\n} from './crossFileDuplication.js';\nimport type { LineHunk } from './git.js';\nimport {\n  duplicationThreshold,\n  fileThresholds,\n  functionThresholds,\n  levels,\n  metricNameOf,\n  type Level,\n  type LimitsByLevel,\n  type Threshold,\n} from './thresholds.js';\nimport type { CodeMetrics, CognitiveBlock, FunctionMetrics } from './types.js';\n\n/** A measured file to check, under the path cross-file duplication knows it by. */\nexport interface CheckedFile {\n  file: string;\n  metrics: CodeMetrics;\n  /** The change to the file; when set, only what the change touches is checked. */\n  hunks?: readonly LineHunk[];\n}\n\n/** The duplication of the measured files, in which duplicated blocks and their copies are found. */\nexport interface CheckedDuplication {\n  crossFile?: CrossFileDuplicationMetrics;\n  /** The detection's `minSimilarityPercent`, the share of a block a copy of it holds at least. */\n  minSimilarityPercent: number;\n}\n\nexport interface ExceededLimit {\n  metric: string;\n  value: number;\n  /** The most severe level whose limit the value violates. */\n  level: Level;\n  /** That level's limit: the value is allowed up to it; a duplicated block is allowed below it. */\n  limit: number;\n}\n\nexport interface BlockLocation {\n  file: string;\n  startLine: number;\n  endLine: number;\n}\n\n/** One copy of a clone group. */\ninterface CloneOccurrence extends BlockLocation {\n  /**\n   * Its code lines matched in another copy, whose number is the length of a duplicated block. Its\n   * line span would also count the lines between the matched parts of one copy, which the copies\n   * do not share; a block matched as a whole by a near-miss copy holds all its code lines.\n   */\n  lineNumbers: readonly number[];\n  tokenCount: number;\n}\n\nexport interface Violation extends BlockLocation {\n  kind: 'function' | 'file' | 'duplication';\n  /** The most severe level among `exceeded`. */\n  level: Level;\n  /** The function's name, qualified with the class it is a member of, for kind `function`. */\n  name?: string;\n  exceeded: ExceededLimit[];\n  /**\n   * The parts adding the most to the cognitive complexity, largest first, for a function that\n   * exceeds a limit of it and has such parts: operator sequences and jumps outside any branching\n   * construct add to the complexity without being one.\n   */\n  largestBlocks?: CognitiveBlock[];\n  /** The other copies of the block, most matched tokens first, for kind `duplication`. */\n  partners?: BlockLocation[];\n}\n\nexport interface CheckResult {\n  violations: Violation[];\n  checkedFunctionCount: number;\n}\n\nconst violationKinds: readonly Violation['kind'][] = ['file', 'function', 'duplication'];\n\nconst cognitiveComplexityMetric = 'functionCognitiveComplexity';\n\nconst nestedInclusiveMetrics = new Set(\n  functionThresholds\n    .filter(({ includesNestedFunctions }) => includesNestedFunctions)\n    .map((threshold) => metricNameOf(threshold))\n);\n\n/** Every limit the files exceed, errors first, then ordered by path, then line. */\nexport function checkThresholds(\n  files: readonly CheckedFile[],\n  duplication: CheckedDuplication,\n  limitsOf: (language: string) => LimitsByLevel\n): CheckResult {\n  const crossFileGroupsByFile = indexGroupsByFile(duplication.crossFile, new Set(files.map(({ file }) => file)));\n  const violations: Violation[] = [];\n  let checkedFunctionCount = 0;\n  for (const checkedFile of files) {\n    const { file, metrics, hunks } = checkedFile;\n    const limits = limitsOf(metrics.language);\n    // A rename or a mode change lists the file as changed without touching any of its lines.\n    const fileExceeded = hunks?.length === 0 ? [] : collectExceeded(fileThresholds, metrics, limits);\n    if (fileExceeded.length > 0) {\n      violations.push(toViolation({ file, startLine: 1, endLine: metrics.lines.total }, 'file', fileExceeded));\n    }\n    const checkedFunctions = listCheckedFunctions(checkedFile);\n    checkedFunctionCount += checkedFunctions.length;\n    const exceedingFunctions = checkedFunctions\n      .map((fn) => ({ fn, exceeded: collectExceeded(functionThresholds, fn, limits) }))\n      .filter(({ exceeded }) => exceeded.length > 0);\n    for (const { fn, exceeded } of exceedingFunctions) {\n      const ownExceeded = exceeded.filter((limit) => !isReportedByEnclosingFunction(limit, fn, exceedingFunctions));\n      if (ownExceeded.length > 0) {\n        violations.push(toFunctionViolation(file, fn, ownExceeded));\n      }\n    }\n    violations.push(\n      ...collectDuplicationViolations(checkedFile, crossFileGroupsByFile.get(file) ?? [], limits, duplication)\n    );\n  }\n  return { violations: violations.toSorted(compareViolations), checkedFunctionCount };\n}\n\n// The kind is compared before the end line because a file violation's end line is corrected after\n// this ordering (to the last line that exists), and the order must not depend on that correction.\nfunction compareViolations(left: Violation, right: Violation): number {\n  return (\n    levels.indexOf(right.level) - levels.indexOf(left.level) ||\n    compareStrings(left.file, right.file) ||\n    left.startLine - right.startLine ||\n    violationKinds.indexOf(left.kind) - violationKinds.indexOf(right.kind) ||\n    left.endLine - right.endLine\n  );\n}\n\n/** The file's functions or, for a changed file, those the change touches. */\nfunction listCheckedFunctions({ metrics, hunks }: CheckedFile): FunctionMetrics[] {\n  const endsByIndentation = metrics.language === 'python';\n  return hunks\n    ? metrics.functions.filter((fn) =>\n        hunks.some((hunk) => touchesSpan(hunk, fn.startLine, fn.endLine, endsByIndentation))\n      )\n    : metrics.functions;\n}\n\n/**\n * Whether a function enclosing `fn` exceeds the same limit with a value that covers `fn`, so\n * reporting it for `fn` too would count the same code twice. The enclosing value is at least that\n * of `fn` and both share the file's limits, so its level is never milder.\n */\nfunction isReportedByEnclosingFunction(\n  limit: ExceededLimit,\n  fn: FunctionMetrics,\n  exceedingFunctions: readonly { fn: FunctionMetrics; exceeded: ExceededLimit[] }[]\n): boolean {\n  if (!nestedInclusiveMetrics.has(limit.metric)) {\n    return false;\n  }\n  return exceedingFunctions.some(\n    (outer) => outer.fn !== fn && encloses(outer.fn, fn) && outer.exceeded.some(({ metric }) => metric === limit.metric)\n  );\n}\n\nfunction encloses(outer: FunctionMetrics, inner: FunctionMetrics): boolean {\n  const startsBefore =\n    outer.startLine < inner.startLine ||\n    (outer.startLine === inner.startLine && outer.startColumn <= inner.startColumn);\n  const endsAfter =\n    outer.endLine > inner.endLine || (outer.endLine === inner.endLine && outer.endColumn >= inner.endColumn);\n  return startsBefore && endsAfter;\n}\n\nfunction toFunctionViolation(file: string, fn: FunctionMetrics, exceeded: ExceededLimit[]): Violation {\n  const { startLine, endLine } = fn;\n  const exceedsCognitiveComplexity = exceeded.some(({ metric }) => metric === cognitiveComplexityMetric);\n  return {\n    ...toViolation({ file, startLine, endLine }, 'function', exceeded),\n    name: qualifyFunctionName(fn),\n    ...(exceedsCognitiveComplexity && fn.cognitiveBlocks.length > 0 && { largestBlocks: fn.cognitiveBlocks }),\n  };\n}\n\n/** How reports name a function: with the type or module it is a member of, so that it can be found. */\nexport function qualifyFunctionName({ name = '<anonymous>', containerName }: FunctionMetrics): string {\n  return containerName ? `${containerName}.${name}` : name;\n}\n\nfunction toViolation(location: BlockLocation, kind: Violation['kind'], exceeded: ExceededLimit[]): Violation {\n  const level = exceeded.some((limit) => limit.level === 'error') ? 'error' : 'warning';\n  return { kind, level, ...location, exceeded };\n}\n\nfunction collectExceeded<Subject>(\n  thresholds: readonly Threshold<Subject>[],\n  subject: Subject,\n  limits: LimitsByLevel\n): ExceededLimit[] {\n  return thresholds.flatMap((threshold) => findExceeded(threshold, subject, limits, (value, limit) => value > limit));\n}\n\n/** The most severe violated limit of the threshold, if any. */\nfunction findExceeded<Subject>(\n  threshold: Threshold<Subject>,\n  subject: Subject,\n  limits: LimitsByLevel,\n  violates: (value: number, limit: number) => boolean\n): ExceededLimit[] {\n  const value = threshold.measure(subject);\n  const level = levels.findLast((candidate) => violates(value, limits[candidate][threshold.key] as number));\n  return level\n    ? [{ metric: metricNameOf(threshold), value, level, limit: limits[level][threshold.key] as number }]\n    : [];\n}\n\n/**\n * Whether the hunk changes the head lines [startLine, endLine]. A hunk without head lines (a pure\n * deletion) sits between its headStart line and the next one. Where indentation ends a span, its\n * last line is a statement rather than a closing delimiter, so a deletion right after that line may\n * have removed the span's tail; `endsByIndentation` counts it as touching, since the head alone\n * cannot tell it from a deletion after the span.\n */\nfunction touchesSpan(hunk: LineHunk, startLine: number, endLine: number, endsByIndentation = false): boolean {\n  return hunk.headCount === 0\n    ? hunk.headStart >= startLine && (hunk.headStart < endLine || (endsByIndentation && hunk.headStart === endLine))\n    : hunk.headStart <= endLine && hunk.headStart + hunk.headCount > startLine;\n}\n\n/** The cross-file groups with an occurrence in each of the given files. */\nfunction indexGroupsByFile(\n  crossFileDuplication: CrossFileDuplicationMetrics | undefined,\n  files: ReadonlySet<string>\n): Map<string, CrossFileDuplicateBlockGroup[]> {\n  const groupsByFile = new Map<string, CrossFileDuplicateBlockGroup[]>();\n  for (const group of crossFileDuplication?.groups ?? []) {\n    for (const file of group.files) {\n      if (files.has(file)) {\n        const groups = groupsByFile.get(file) ?? [];\n        groups.push(group);\n        groupsByFile.set(file, groups);\n      }\n    }\n  }\n  return groupsByFile;\n}\n\n/**\n * One violation per duplicated region of the file: its clone occurrences, within-file and\n * cross-file, that hold at least the duplicated lines of a level (with `hunks`, only those\n * overlapping added lines), with overlapping occurrences merged into one region.\n */\nfunction collectDuplicationViolations(\n  { file, metrics, hunks }: CheckedFile,\n  crossFileGroups: readonly CrossFileDuplicateBlockGroup[],\n  limits: LimitsByLevel,\n  { minSimilarityPercent }: CheckedDuplication\n): Violation[] {\n  const findExceededLines = (duplicatedLineCount: number): ExceededLimit[] =>\n    findExceeded(duplicationThreshold, { duplicatedLineCount }, limits, (value, limit) => value >= limit);\n  const groups: CloneOccurrence[][] = [\n    ...metrics.duplication.duplicateBlockGroups.map((group) => group.map((occurrence) => ({ ...occurrence, file }))),\n    ...crossFileGroups.map((group) => group.occurrences.map((occurrence) => toCloneOccurrence(occurrence))),\n  ];\n  const isReported = (block: CloneOccurrence): boolean =>\n    block.file === file &&\n    findExceededLines(block.lineNumbers.length).length > 0 &&\n    (!hunks || hunks.some((hunk) => hunk.headCount > 0 && touchesSpan(hunk, block.startLine, block.endLine)));\n  const groupByBlock = new Map<CloneOccurrence, CloneOccurrence[]>();\n  for (const group of groups) {\n    for (const block of group.filter((occurrence) => isReported(occurrence))) {\n      groupByBlock.set(block, group);\n    }\n  }\n  return mergeOverlapping([...groupByBlock.keys()]).map(({ merged, sources }) => {\n    const listCopies = (minTokenPercent: number): BlockLocation[] =>\n      mergeOverlapping(\n        sources.flatMap((source) => {\n          // The region merges every clone that overlaps it, so a copy of an occurrence lying\n          // within a larger one is measured against the larger one.\n          const tokenCount = Math.max(\n            ...sources.filter((outer) => contains(outer, source)).map((outer) => outer.tokenCount)\n          );\n          return (groupByBlock.get(source) ?? []).filter(\n            (copy) => copy.tokenCount * 100 >= tokenCount * minTokenPercent\n          );\n        })\n      )\n        // The region's own occurrences are among the copies of the groups it belongs to.\n        .filter((partner) => !overlaps(partner.merged, merged))\n        // The largest say the most about what to share.\n        .toSorted((left, right) => sumTokens(right.sources) - sumTokens(left.sources))\n        .map((partner) => partner.merged);\n    // A group joins a block with every place repeating a part of it: a function another file\n    // copies whole is grouped with each file holding a few of its lines. Such a fragment is not a\n    // copy of the block: sharing it would not remove the block, and a report listing it reads as\n    // one more copy. Sizes are compared in tokens, since the same code may be laid out over any\n    // number of lines.\n    const copies = listCopies(minSimilarityPercent);\n    return {\n      ...toViolation(\n        merged,\n        'duplication',\n        // Occurrences that overlap share lines, which count once.\n        findExceededLines(new Set(sources.flatMap((source) => source.lineNumbers)).size)\n      ),\n      // A group does not always hold the copy a block was matched with as a whole: within a file,\n      // a copy that already belongs to an exact group is listed as its part in that group. The\n      // fragments then are all that locates the block's copies.\n      partners: copies.length > 0 ? copies : listCopies(0),\n    };\n  });\n}\n\nfunction toCloneOccurrence(occurrence: CrossFileDuplicateOccurrence): CloneOccurrence {\n  const { lineNumbers } = occurrence;\n  assert.ok(lineNumbers, `No matched lines for ${occurrence.file}, a scanned file.`);\n  return { ...occurrence, lineNumbers };\n}\n\nfunction sumTokens(occurrences: readonly CloneOccurrence[]): number {\n  return occurrences.reduce((sum, occurrence) => sum + occurrence.tokenCount, 0);\n}\n\n/** The locations with those overlapping in the same file merged, ordered by file, then line. */\nfunction mergeOverlapping(\n  locations: readonly CloneOccurrence[]\n): { merged: BlockLocation; sources: CloneOccurrence[] }[] {\n  const regions: { merged: BlockLocation; sources: CloneOccurrence[] }[] = [];\n  const ordered = locations.toSorted(\n    (left, right) => compareStrings(left.file, right.file) || left.startLine - right.startLine\n  );\n  for (const location of ordered) {\n    const last = regions.at(-1);\n    if (last && overlaps(last.merged, location)) {\n      last.merged.endLine = Math.max(last.merged.endLine, location.endLine);\n      last.sources.push(location);\n    } else {\n      const { file, startLine, endLine } = location;\n      regions.push({ merged: { file, startLine, endLine }, sources: [location] });\n    }\n  }\n  return regions;\n}\n\n/** Whether `outer` spans every line of `inner`; a block contains itself. */\nfunction contains(outer: BlockLocation, inner: BlockLocation): boolean {\n  return outer.file === inner.file && outer.startLine <= inner.startLine && inner.endLine <= outer.endLine;\n}\n\nfunction overlaps(left: BlockLocation, right: BlockLocation): boolean {\n  return left.file === right.file && left.startLine <= right.endLine && right.startLine <= left.endLine;\n}\n\n/** Code-unit order, so reports do not depend on the locale. */\nfunction compareStrings(left: string, right: string): number {\n  return left < right ? -1 : left > right ? 1 : 0;\n}\n"],"mappings":"4JAkFA,MAAM,EAA+C,CAAC,OAAQ,WAAY,aAAa,EAIjF,EAAyB,IAAI,IACjC,EACG,QAAQ,CAAE,6BAA8B,CAAuB,CAAC,CAChE,IAAK,GAAc,EAAa,CAAS,CAAC,CAC/C,EAGA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAwB,EAAkB,EAAY,UAAW,IAAI,IAAI,EAAM,KAAK,CAAE,UAAW,CAAI,CAAC,CAAC,EACvG,EAA0B,CAAC,EAC7B,EAAuB,EAC3B,IAAK,IAAM,KAAe,EAAO,CAC/B,GAAM,CAAE,OAAM,UAAS,SAAU,EAC3B,EAAS,EAAS,EAAQ,QAAQ,EAElC,EAAe,GAAO,SAAW,EAAI,CAAC,EAAI,EAAgB,EAAgB,EAAS,CAAM,EAC3F,EAAa,OAAS,GACxB,EAAW,KAAK,EAAY,CAAE,OAAM,UAAW,EAAG,QAAS,EAAQ,MAAM,KAAM,EAAG,OAAQ,CAAY,CAAC,EAEzG,IAAM,EAAmB,EAAqB,CAAW,EACzD,GAAwB,EAAiB,OACzC,IAAM,EAAqB,EACxB,IAAK,IAAQ,CAAE,KAAI,SAAU,EAAgB,EAAoB,EAAI,CAAM,CAAE,EAAE,CAAC,CAChF,QAAQ,CAAE,cAAe,EAAS,OAAS,CAAC,EAC/C,IAAK,GAAM,CAAE,KAAI,cAAc,EAAoB,CACjD,IAAM,EAAc,EAAS,OAAQ,GAAU,CAAC,EAA8B,EAAO,EAAI,CAAkB,CAAC,EACxG,EAAY,OAAS,GACvB,EAAW,KAAK,EAAoB,EAAM,EAAI,CAAW,CAAC,CAE9D,CACA,EAAW,KACT,GAAG,EAA6B,EAAa,EAAsB,IAAI,CAAI,GAAK,CAAC,EAAG,EAAQ,CAAW,CACzG,CACF,CACA,MAAO,CAAE,WAAY,EAAW,SAAS,CAAiB,EAAG,sBAAqB,CACpF,CAIA,SAAS,EAAkB,EAAiB,EAA0B,CACpE,OACE,EAAO,QAAQ,EAAM,KAAK,EAAI,EAAO,QAAQ,EAAK,KAAK,GACvD,EAAe,EAAK,KAAM,EAAM,IAAI,GACpC,EAAK,UAAY,EAAM,WACvB,EAAe,QAAQ,EAAK,IAAI,EAAI,EAAe,QAAQ,EAAM,IAAI,GACrE,EAAK,QAAU,EAAM,OAEzB,CAGA,SAAS,EAAqB,CAAE,UAAS,SAAyC,CAChF,IAAM,EAAoB,EAAQ,WAAa,SAC/C,OAAO,EACH,EAAQ,UAAU,OAAQ,GACxB,EAAM,KAAM,GAAS,EAAY,EAAM,EAAG,UAAW,EAAG,QAAS,CAAiB,CAAC,CACrF,EACA,EAAQ,SACd,CAOA,SAAS,EACP,EACA,EACA,EACS,CAIT,OAHK,EAAuB,IAAI,EAAM,MAAM,EAGrC,EAAmB,KACvB,GAAU,EAAM,KAAO,GAAM,EAAS,EAAM,GAAI,CAAE,GAAK,EAAM,SAAS,MAAM,CAAE,YAAa,IAAW,EAAM,MAAM,CACrH,EAJS,EAKX,CAEA,SAAS,EAAS,EAAwB,EAAiC,CACzE,IAAM,EACJ,EAAM,UAAY,EAAM,WACvB,EAAM,YAAc,EAAM,WAAa,EAAM,aAAe,EAAM,YAC/D,EACJ,EAAM,QAAU,EAAM,SAAY,EAAM,UAAY,EAAM,SAAW,EAAM,WAAa,EAAM,UAChG,OAAO,GAAgB,CACzB,CAEA,SAAS,EAAoB,EAAc,EAAqB,EAAsC,CACpG,GAAM,CAAE,YAAW,WAAY,EACzB,EAA6B,EAAS,MAAM,CAAE,YAAa,IAAW,6BAAyB,EACrG,MAAO,CACL,GAAG,EAAY,CAAE,OAAM,YAAW,SAAQ,EAAG,WAAY,CAAQ,EACjE,KAAM,EAAoB,CAAE,EAC5B,GAAI,GAA8B,EAAG,gBAAgB,OAAS,GAAK,CAAE,cAAe,EAAG,eAAgB,CACzG,CACF,CAGA,SAAgB,EAAoB,CAAE,OAAO,cAAe,iBAA0C,CACpG,OAAO,EAAgB,GAAG,EAAc,GAAG,IAAS,CACtD,CAEA,SAAS,EAAY,EAAyB,EAAyB,EAAsC,CAE3G,MAAO,CAAE,OAAM,MADD,EAAS,KAAM,GAAU,EAAM,QAAU,OAAO,EAAI,QAAU,UACtD,GAAG,EAAU,UAAS,CAC9C,CAEA,SAAS,EACP,EACA,EACA,EACiB,CACjB,OAAO,EAAW,QAAS,GAAc,EAAa,EAAW,EAAS,GAAS,EAAO,IAAU,EAAQ,CAAK,CAAC,CACpH,CAGA,SAAS,EACP,EACA,EACA,EACA,EACiB,CACjB,IAAM,EAAQ,EAAU,QAAQ,CAAO,EACjC,EAAQ,EAAO,SAAU,GAAc,EAAS,EAAO,EAAO,EAAU,CAAC,EAAU,IAAc,CAAC,EACxG,OAAO,EACH,CAAC,CAAE,OAAQ,EAAa,CAAS,EAAG,QAAO,QAAO,MAAO,EAAO,EAAM,CAAC,EAAU,IAAe,CAAC,EACjG,CAAC,CACP,CASA,SAAS,EAAY,EAAgB,EAAmB,EAAiB,EAAoB,GAAgB,CAC3G,OAAO,EAAK,YAAc,EACtB,EAAK,WAAa,IAAc,EAAK,UAAY,GAAY,GAAqB,EAAK,YAAc,GACrG,EAAK,WAAa,GAAW,EAAK,UAAY,EAAK,UAAY,CACrE,CAGA,SAAS,EACP,EACA,EAC6C,CAC7C,IAAM,kBAAe,IAAI,IACzB,IAAK,IAAM,KAAS,GAAsB,QAAU,CAAC,EACnD,IAAK,IAAM,KAAQ,EAAM,MACvB,GAAI,EAAM,IAAI,CAAI,EAAG,CACnB,IAAM,EAAS,EAAa,IAAI,CAAI,GAAK,CAAC,EAC1C,EAAO,KAAK,CAAK,EACjB,EAAa,IAAI,EAAM,CAAM,CAC/B,CAGJ,OAAO,CACT,CAOA,SAAS,EACP,CAAE,OAAM,UAAS,SACjB,EACA,EACA,CAAE,wBACW,CACb,IAAM,EAAqB,GACzB,EAAa,EAAsB,CAAE,qBAAoB,EAAG,GAAS,EAAO,IAAU,GAAS,CAAK,EAChG,EAA8B,CAClC,GAAG,EAAQ,YAAY,qBAAqB,IAAK,GAAU,EAAM,IAAK,IAAgB,CAAE,GAAG,EAAY,MAAK,EAAE,CAAC,EAC/G,GAAG,EAAgB,IAAK,GAAU,EAAM,YAAY,IAAK,GAAe,EAAkB,CAAU,CAAC,CAAC,CACxG,EACM,EAAc,GAClB,EAAM,OAAS,GACf,EAAkB,EAAM,YAAY,MAAM,CAAC,CAAC,OAAS,IACpD,CAAC,GAAS,EAAM,KAAM,GAAS,EAAK,UAAY,GAAK,EAAY,EAAM,EAAM,UAAW,EAAM,OAAO,CAAC,GACnG,kBAAe,IAAI,IACzB,IAAK,IAAM,KAAS,EAClB,IAAK,IAAM,KAAS,EAAM,OAAQ,GAAe,EAAW,CAAU,CAAC,EACrE,EAAa,IAAI,EAAO,CAAK,EAGjC,OAAO,EAAiB,CAAC,GAAG,EAAa,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAE,SAAQ,aAAc,CAC7E,IAAM,EAAc,GAClB,EACE,EAAQ,QAAS,GAAW,CAG1B,IAAM,EAAa,KAAK,IACtB,GAAG,EAAQ,OAAQ,GAAU,EAAS,EAAO,CAAM,CAAC,CAAC,CAAC,IAAK,GAAU,EAAM,UAAU,CACvF,EACA,OAAQ,EAAa,IAAI,CAAM,GAAK,CAAC,EAAA,CAAG,OACrC,GAAS,EAAK,WAAa,KAAO,EAAa,CAClD,CACF,CAAC,CACH,CAAC,CAEE,OAAQ,GAAY,CAAC,EAAS,EAAQ,OAAQ,CAAM,CAAC,CAAC,CAEtD,UAAU,EAAM,IAAU,EAAU,EAAM,OAAO,EAAI,EAAU,EAAK,OAAO,CAAC,CAAC,CAC7E,IAAK,GAAY,EAAQ,MAAM,EAM9B,EAAS,EAAW,CAAoB,EAC9C,MAAO,CACL,GAAG,EACD,EACA,cAEA,EAAkB,IAAI,IAAI,EAAQ,QAAS,GAAW,EAAO,WAAW,CAAC,CAAC,CAAC,IAAI,CACjF,EAIA,SAAU,EAAO,OAAS,EAAI,EAAS,EAAW,CAAC,CACrD,CACF,CAAC,CACH,CAEA,SAAS,EAAkB,EAA2D,CACpF,GAAM,CAAE,eAAgB,EAExB,OADA,EAAO,GAAG,EAAa,wBAAwB,EAAW,KAAK,kBAAkB,EAC1E,CAAE,GAAG,EAAY,aAAY,CACtC,CAEA,SAAS,EAAU,EAAiD,CAClE,OAAO,EAAY,QAAQ,EAAK,IAAe,EAAM,EAAW,WAAY,CAAC,CAC/E,CAGA,SAAS,EACP,EACyD,CACzD,IAAM,EAAmE,CAAC,EACpE,EAAU,EAAU,UACvB,EAAM,IAAU,EAAe,EAAK,KAAM,EAAM,IAAI,GAAK,EAAK,UAAY,EAAM,SACnF,EACA,IAAK,IAAM,KAAY,EAAS,CAC9B,IAAM,EAAO,EAAQ,GAAG,EAAE,EAC1B,GAAI,GAAQ,EAAS,EAAK,OAAQ,CAAQ,EACxC,EAAK,OAAO,QAAU,KAAK,IAAI,EAAK,OAAO,QAAS,EAAS,OAAO,EACpE,EAAK,QAAQ,KAAK,CAAQ,MACrB,CACL,GAAM,CAAE,OAAM,YAAW,WAAY,EACrC,EAAQ,KAAK,CAAE,OAAQ,CAAE,OAAM,YAAW,SAAQ,EAAG,QAAS,CAAC,CAAQ,CAAE,CAAC,CAC5E,CACF,CACA,OAAO,CACT,CAGA,SAAS,EAAS,EAAsB,EAA+B,CACrE,OAAO,EAAM,OAAS,EAAM,MAAQ,EAAM,WAAa,EAAM,WAAa,EAAM,SAAW,EAAM,OACnG,CAEA,SAAS,EAAS,EAAqB,EAA+B,CACpE,OAAO,EAAK,OAAS,EAAM,MAAQ,EAAK,WAAa,EAAM,SAAW,EAAM,WAAa,EAAK,OAChG,CAGA,SAAS,EAAe,EAAc,EAAuB,CAC3D,OAAO,EAAO,EAAQ,GAAK,IAAO,EACpC"}