@aiready/pattern-detect 0.16.18 → 0.16.19

package/dist/detector-entry.js

@@ -0,0 +1,418 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/detector-entry.ts
+var detector_entry_exports = {};
+__export(detector_entry_exports, {
+  detectDuplicatePatterns: () => detectDuplicatePatterns
+});
+module.exports = __toCommonJS(detector_entry_exports);
+
+// src/detector.ts
+var import_core2 = require("@aiready/core");
+
+// src/context-rules.ts
+var import_core = require("@aiready/core");
+var CONTEXT_RULES = [
+  // Test Fixtures - Intentional duplication for test isolation
+  {
+    name: "test-fixtures",
+    detect: (file, code) => {
+      const isTestFile = file.includes(".test.") || file.includes(".spec.") || file.includes("__tests__") || file.includes("/test/") || file.includes("/tests/");
+      const hasTestFixtures = code.includes("beforeAll") || code.includes("afterAll") || code.includes("beforeEach") || code.includes("afterEach") || code.includes("setUp") || code.includes("tearDown");
+      return isTestFile && hasTestFixtures;
+    },
+    severity: import_core.Severity.Info,
+    reason: "Test fixture duplication is intentional for test isolation",
+    suggestion: "Consider if shared test setup would improve maintainability without coupling tests"
+  },
+  // Email/Document Templates - Often intentionally similar for consistency
+  {
+    name: "templates",
+    detect: (file, code) => {
+      const isTemplate = file.includes("/templates/") || file.includes("-template") || file.includes("/email-templates/") || file.includes("/emails/");
+      const hasTemplateContent = (code.includes("return") || code.includes("export")) && (code.includes("html") || code.includes("subject") || code.includes("body"));
+      return isTemplate && hasTemplateContent;
+    },
+    severity: import_core.Severity.Minor,
+    reason: "Template duplication may be intentional for maintainability and branding consistency",
+    suggestion: "Extract shared structure only if templates become hard to maintain"
+  },
+  // E2E/Integration Test Page Objects - Test independence
+  {
+    name: "e2e-page-objects",
+    detect: (file, code) => {
+      const isE2ETest = file.includes("e2e/") || file.includes("/e2e/") || file.includes(".e2e.") || file.includes("/playwright/") || file.includes("playwright/") || file.includes("/cypress/") || file.includes("cypress/") || file.includes("/integration/") || file.includes("integration/");
+      const hasPageObjectPatterns = code.includes("page.") || code.includes("await page") || code.includes("locator") || code.includes("getBy") || code.includes("selector") || code.includes("click(") || code.includes("fill(");
+      return isE2ETest && hasPageObjectPatterns;
+    },
+    severity: import_core.Severity.Minor,
+    reason: "E2E test duplication ensures test independence and reduces coupling",
+    suggestion: "Consider page object pattern only if duplication causes maintenance issues"
+  },
+  // Configuration Files - Often necessarily similar by design
+  {
+    name: "config-files",
+    detect: (file) => {
+      return file.endsWith(".config.ts") || file.endsWith(".config.js") || file.includes("jest.config") || file.includes("vite.config") || file.includes("webpack.config") || file.includes("rollup.config") || file.includes("tsconfig");
+    },
+    severity: import_core.Severity.Minor,
+    reason: "Configuration files often have similar structure by design",
+    suggestion: "Consider shared config base only if configurations become hard to maintain"
+  },
+  // Type Definitions - Duplication for type safety and module independence
+  {
+    name: "type-definitions",
+    detect: (file, code) => {
+      const isTypeFile = file.endsWith(".d.ts") || file.includes("/types/");
+      const hasTypeDefinitions = code.includes("interface ") || code.includes("type ") || code.includes("enum ");
+      return isTypeFile && hasTypeDefinitions;
+    },
+    severity: import_core.Severity.Info,
+    reason: "Type duplication may be intentional for module independence and type safety",
+    suggestion: "Extract to shared types package only if causing maintenance burden"
+  },
+  // Migration Scripts - One-off scripts that are similar by nature
+  {
+    name: "migration-scripts",
+    detect: (file) => {
+      return file.includes("/migrations/") || file.includes("/migrate/") || file.includes(".migration.");
+    },
+    severity: import_core.Severity.Info,
+    reason: "Migration scripts are typically one-off and intentionally similar",
+    suggestion: "Duplication is acceptable for migration scripts"
+  },
+  // Mock Data - Test data intentionally duplicated
+  {
+    name: "mock-data",
+    detect: (file, code) => {
+      const isMockFile = file.includes("/mocks/") || file.includes("/__mocks__/") || file.includes("/fixtures/") || file.includes(".mock.") || file.includes(".fixture.");
+      const hasMockData = code.includes("mock") || code.includes("Mock") || code.includes("fixture") || code.includes("stub") || code.includes("export const");
+      return isMockFile && hasMockData;
+    },
+    severity: import_core.Severity.Info,
+    reason: "Mock data duplication is expected for comprehensive test coverage",
+    suggestion: "Consider shared factories only for complex mock generation"
+  },
+  // Tool Implementations - Structural Boilerplate
+  {
+    name: "tool-implementations",
+    detect: (file, code) => {
+      const isToolFile = file.includes("/tools/") || file.endsWith(".tool.ts") || code.includes("toolDefinitions");
+      const hasToolStructure = code.includes("execute") && (code.includes("try") || code.includes("catch"));
+      return isToolFile && hasToolStructure;
+    },
+    severity: import_core.Severity.Info,
+    reason: "Tool implementations share structural boilerplate but have distinct business logic",
+    suggestion: "Tool duplication is acceptable for boilerplate interface wrappers"
+  }
+];
+function calculateSeverity(file1, file2, code, similarity, linesOfCode) {
+  for (const rule of CONTEXT_RULES) {
+    if (rule.detect(file1, code) || rule.detect(file2, code)) {
+      return {
+        severity: rule.severity,
+        reason: rule.reason,
+        suggestion: rule.suggestion,
+        matchedRule: rule.name
+      };
+    }
+  }
+  if (similarity >= 0.95 && linesOfCode >= 30) {
+    return {
+      severity: import_core.Severity.Critical,
+      reason: "Large nearly-identical code blocks waste tokens and create maintenance burden",
+      suggestion: "Extract to shared utility module immediately"
+    };
+  } else if (similarity >= 0.95 && linesOfCode >= 15) {
+    return {
+      severity: import_core.Severity.Major,
+      reason: "Nearly identical code should be consolidated",
+      suggestion: "Move to shared utility file"
+    };
+  } else if (similarity >= 0.85) {
+    return {
+      severity: import_core.Severity.Major,
+      reason: "High similarity indicates significant duplication",
+      suggestion: "Extract common logic to shared function"
+    };
+  } else if (similarity >= 0.7) {
+    return {
+      severity: import_core.Severity.Minor,
+      reason: "Moderate similarity detected",
+      suggestion: "Consider extracting shared patterns if code evolves together"
+    };
+  } else {
+    return {
+      severity: import_core.Severity.Minor,
+      reason: "Minor similarity detected",
+      suggestion: "Monitor but refactoring may not be worthwhile"
+    };
+  }
+}
+
+// src/detector.ts
+function normalizeCode(code, isPython = false) {
+  let normalized = code;
+  if (isPython) {
+    normalized = normalized.replace(/#.*/g, "");
+  } else {
+    normalized = normalized.replace(/\/\/.*/g, "").replace(/\/\*[\s\S]*?\*\//g, "");
+  }
+  return normalized.replace(/['"`]/g, '"').replace(/\s+/g, " ").trim().toLowerCase();
+}
+function extractBlocks(file, content) {
+  const isPython = file.toLowerCase().endsWith(".py");
+  if (isPython) {
+    return extractBlocksPython(file, content);
+  }
+  const blocks = [];
+  const lines = content.split("\n");
+  const blockRegex = /^\s*(?:export\s+)?(?:async\s+)?(?:public\s+|private\s+|protected\s+|internal\s+|static\s+|readonly\s+|virtual\s+|abstract\s+|override\s+)*(function|class|interface|type|enum|record|struct|void|func|[a-zA-Z0-9_<>[]]+)\s+([a-zA-Z0-9_]+)(?:\s*\(|(?:\s+extends|\s+implements|\s+where)?\s*\{)|^\s*(?:export\s+)?const\s+([a-zA-Z0-9_]+)\s*=\s*[a-zA-Z0-9_.]+\.object\(|^\s*(app\.(?:get|post|put|delete|patch|use))\(/gm;
+  let match;
+  while ((match = blockRegex.exec(content)) !== null) {
+    const startLine = content.substring(0, match.index).split("\n").length;
+    let type;
+    let name;
+    if (match[1]) {
+      type = match[1];
+      name = match[2];
+    } else if (match[3]) {
+      type = "const";
+      name = match[3];
+    } else {
+      type = "handler";
+      name = match[4];
+    }
+    let endLine = -1;
+    let openBraces = 0;
+    let foundStart = false;
+    for (let i = match.index; i < content.length; i++) {
+      if (content[i] === "{") {
+        openBraces++;
+        foundStart = true;
+      } else if (content[i] === "}") {
+        openBraces--;
+      }
+      if (foundStart && openBraces === 0) {
+        endLine = content.substring(0, i + 1).split("\n").length;
+        break;
+      }
+    }
+    if (endLine === -1) {
+      const remaining = content.slice(match.index);
+      const nextLineMatch = remaining.indexOf("\n");
+      if (nextLineMatch !== -1) {
+        endLine = startLine;
+      } else {
+        endLine = lines.length;
+      }
+    }
+    endLine = Math.max(startLine, endLine);
+    const blockCode = lines.slice(startLine - 1, endLine).join("\n");
+    const tokens = (0, import_core2.estimateTokens)(blockCode);
+    blocks.push({
+      file,
+      startLine,
+      endLine,
+      code: blockCode,
+      tokens,
+      patternType: inferPatternType(type, name)
+    });
+  }
+  return blocks;
+}
+function extractBlocksPython(file, content) {
+  const blocks = [];
+  const lines = content.split("\n");
+  const blockRegex = /^\s*(?:async\s+)?(def|class)\s+([a-zA-Z0-9_]+)/gm;
+  let match;
+  while ((match = blockRegex.exec(content)) !== null) {
+    const startLinePos = content.substring(0, match.index).split("\n").length;
+    const startLineIdx = startLinePos - 1;
+    const initialIndent = lines[startLineIdx].search(/\S/);
+    let endLineIdx = startLineIdx;
+    for (let i = startLineIdx + 1; i < lines.length; i++) {
+      const line = lines[i];
+      if (line.trim().length === 0) {
+        endLineIdx = i;
+        continue;
+      }
+      const currentIndent = line.search(/\S/);
+      if (currentIndent <= initialIndent) {
+        break;
+      }
+      endLineIdx = i;
+    }
+    while (endLineIdx > startLineIdx && lines[endLineIdx].trim().length === 0) {
+      endLineIdx--;
+    }
+    const blockCode = lines.slice(startLineIdx, endLineIdx + 1).join("\n");
+    const tokens = (0, import_core2.estimateTokens)(blockCode);
+    blocks.push({
+      file,
+      startLine: startLinePos,
+      endLine: endLineIdx + 1,
+      code: blockCode,
+      tokens,
+      patternType: inferPatternType(match[1], match[2])
+    });
+  }
+  return blocks;
+}
+function inferPatternType(keyword, name) {
+  const n = name.toLowerCase();
+  if (keyword === "handler" || n.includes("handler") || n.includes("controller") || n.startsWith("app.")) {
+    return "api-handler";
+  }
+  if (n.includes("validate") || n.includes("schema")) return "validator";
+  if (n.includes("util") || n.includes("helper")) return "utility";
+  if (keyword === "class") return "class-method";
+  if (n.match(/^[A-Z]/)) return "component";
+  if (keyword === "function") return "function";
+  return "unknown";
+}
+function calculateSimilarity(a, b) {
+  if (a === b) return 1;
+  const tokensA = a.split(/[^a-zA-Z0-9]+/).filter((t) => t.length > 0);
+  const tokensB = b.split(/[^a-zA-Z0-9]+/).filter((t) => t.length > 0);
+  if (tokensA.length === 0 || tokensB.length === 0) return 0;
+  const setA = new Set(tokensA);
+  const setB = new Set(tokensB);
+  const intersection = new Set([...setA].filter((x) => setB.has(x)));
+  const union = /* @__PURE__ */ new Set([...setA, ...setB]);
+  return intersection.size / union.size;
+}
+function calculateConfidence(similarity, tokens, lines) {
+  let confidence = similarity;
+  if (lines > 20) confidence += 0.05;
+  if (tokens > 200) confidence += 0.05;
+  if (lines < 5) confidence -= 0.1;
+  return Math.max(0, Math.min(1, confidence));
+}
+async function detectDuplicatePatterns(fileContents, options) {
+  const {
+    minSimilarity,
+    minLines,
+    streamResults,
+    onProgress,
+    excludePatterns = [],
+    confidenceThreshold = 0,
+    ignoreWhitelist = []
+  } = options;
+  const allBlocks = [];
+  const excludeRegexes = excludePatterns.map((p) => new RegExp(p, "i"));
+  for (const { file, content } of fileContents) {
+    const blocks = extractBlocks(file, content);
+    for (const b of blocks) {
+      if (b.endLine - b.startLine + 1 < minLines) continue;
+      const isExcluded = excludeRegexes.some((regex) => regex.test(b.code));
+      if (isExcluded) continue;
+      allBlocks.push(b);
+    }
+  }
+  const duplicates = [];
+  const totalBlocks = allBlocks.length;
+  let comparisons = 0;
+  const totalComparisons = totalBlocks * (totalBlocks - 1) / 2;
+  if (onProgress) {
+    onProgress(
+      0,
+      totalComparisons,
+      `Starting duplicate detection on ${totalBlocks} blocks...`
+    );
+  }
+  for (let i = 0; i < allBlocks.length; i++) {
+    if (i % 50 === 0 && i > 0) {
+      await new Promise((resolve) => setImmediate(resolve));
+      if (onProgress) {
+        onProgress(
+          comparisons,
+          totalComparisons,
+          `Analyzing blocks (${i}/${totalBlocks})...`
+        );
+      }
+    }
+    const b1 = allBlocks[i];
+    const isPython1 = b1.file.toLowerCase().endsWith(".py");
+    const norm1 = normalizeCode(b1.code, isPython1);
+    for (let j = i + 1; j < allBlocks.length; j++) {
+      comparisons++;
+      const b2 = allBlocks[j];
+      if (b1.file === b2.file) continue;
+      const isWhitelisted = ignoreWhitelist.some((pattern) => {
+        return b1.file.includes(pattern) && b2.file.includes(pattern) || pattern === `${b1.file}::${b2.file}` || pattern === `${b2.file}::${b1.file}`;
+      });
+      if (isWhitelisted) continue;
+      const isPython2 = b2.file.toLowerCase().endsWith(".py");
+      const norm2 = normalizeCode(b2.code, isPython2);
+      const sim = calculateSimilarity(norm1, norm2);
+      if (sim >= minSimilarity) {
+        const confidence = calculateConfidence(
+          sim,
+          b1.tokens,
+          b1.endLine - b1.startLine + 1
+        );
+        if (confidence < confidenceThreshold) continue;
+        const { severity, reason, suggestion, matchedRule } = calculateSeverity(
+          b1.file,
+          b2.file,
+          b1.code,
+          sim,
+          b1.endLine - b1.startLine + 1
+        );
+        const dup = {
+          file1: b1.file,
+          line1: b1.startLine,
+          endLine1: b1.endLine,
+          file2: b2.file,
+          line2: b2.startLine,
+          endLine2: b2.endLine,
+          code1: b1.code,
+          code2: b2.code,
+          similarity: sim,
+          confidence,
+          patternType: b1.patternType,
+          tokenCost: b1.tokens + b2.tokens,
+          severity,
+          reason,
+          suggestion,
+          matchedRule
+        };
+        duplicates.push(dup);
+        if (streamResults)
+          console.log(
+            `[DUPLICATE] ${dup.file1}:${dup.line1} <-> ${dup.file2}:${dup.line2} (${Math.round(sim * 100)}%, conf: ${Math.round(confidence * 100)}%)`
+          );
+      }
+    }
+  }
+  if (onProgress) {
+    onProgress(
+      totalComparisons,
+      totalComparisons,
+      `Duplicate detection complete. Found ${duplicates.length} patterns.`
+    );
+  }
+  return duplicates.sort((a, b) => b.similarity - a.similarity);
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  detectDuplicatePatterns
+});

package/dist/detector-entry.mjs

@@ -0,0 +1,7 @@
+import {
+  detectDuplicatePatterns
+} from "./chunk-THF4RW63.mjs";
+import "./chunk-I6ETJC7L.mjs";
+export {
+  detectDuplicatePatterns
+};

package/dist/index.d.mts

@@ -1,242 +1,14 @@
-import { ToolProvider, Severity, FileContent, ScanOptions, AnalysisResult, CostConfig, ToolScoringOutput } from '@aiready/core';
+import { ToolProvider } from '@aiready/core';
 export { Severity } from '@aiready/core';
+export { D as DuplicateGroup, P as PatternDetectOptions, a as PatternSummary, R as RefactorCluster, b as analyzePatterns, c as createRefactorClusters, f as filterClustersByImpact, g as generateSummary, d as getSmartDefaults, e as groupDuplicatesByFilePair } from './analyzer-entry-BVz-HnZd.mjs';
+export { detectDuplicatePatterns } from './detector-entry.mjs';
+export { calculatePatternScore } from './scoring-entry.mjs';
+export { C as CONTEXT_RULES, a as ContextRule, c as calculateSeverity, f as filterBySeverity, g as getSeverityLabel, b as getSeverityThreshold } from './context-rules-entry-y2uJSngh.mjs';
+export { D as DuplicatePattern, P as PatternType } from './types-DU2mmhwb.mjs';
 
 /**
  * Pattern Detection Tool Provider
  */
 declare const PatternDetectProvider: ToolProvider;
 
-type PatternType = 'api-handler' | 'validator' | 'utility' | 'class-method' | 'component' | 'function' | 'unknown';
-interface DuplicatePattern {
-    file1: string;
-    line1: number;
-    endLine1: number;
-    file2: string;
-    line2: number;
-    endLine2: number;
-    code1: string;
-    code2: string;
-    similarity: number;
-    confidence: number;
-    patternType: PatternType;
-    tokenCost: number;
-    severity: Severity;
-    reason?: string;
-    suggestion?: string;
-    matchedRule?: string;
-}
-interface DetectionOptions {
-    minSimilarity: number;
-    minLines: number;
-    batchSize: number;
-    approx: boolean;
-    minSharedTokens: number;
-    maxCandidatesPerBlock: number;
-    streamResults: boolean;
-    excludePatterns?: string[];
-    confidenceThreshold?: number;
-    ignoreWhitelist?: string[];
-    onProgress?: (processed: number, total: number, message: string) => void;
-}
-
-/**
- * Detect duplicate patterns across files
- *
- * @param fileContents - Array of file contents to analyze.
- * @param options - Configuration for duplicate detection (thresholds, progress, etc).
- * @returns Promise resolving to an array of detected duplicate patterns sorted by similarity.
- */
-declare function detectDuplicatePatterns(fileContents: FileContent[], options: DetectionOptions): Promise<DuplicatePattern[]>;
-
-interface DuplicateGroup {
-    filePair: string;
-    severity: Severity;
-    occurrences: number;
-    totalTokenCost: number;
-    averageSimilarity: number;
-    patternTypes: Set<PatternType>;
-    lineRanges: Array<{
-        file1: {
-            start: number;
-            end: number;
-        };
-        file2: {
-            start: number;
-            end: number;
-        };
-    }>;
-}
-interface RefactorCluster {
-    id: string;
-    name: string;
-    files: string[];
-    severity: Severity;
-    duplicateCount: number;
-    totalTokenCost: number;
-    averageSimilarity: number;
-    reason?: string;
-    suggestion?: string;
-}
-/**
- * Group raw duplicates by file pairs to reduce noise
- */
-declare function groupDuplicatesByFilePair(duplicates: DuplicatePattern[]): DuplicateGroup[];
-/**
- * Create clusters of highly related files (refactor targets)
- * Uses a simple connected components algorithm
- * @param duplicates - Array of duplicate patterns to cluster
- * @returns Array of refactor clusters
- */
-declare function createRefactorClusters(duplicates: DuplicatePattern[]): RefactorCluster[];
-/**
- * Filter clusters by impact threshold
- * @param clusters - Array of refactor clusters to filter
- * @param minTokenCost - Minimum token cost threshold (default: 1000)
- * @param minFiles - Minimum number of files in cluster (default: 3)
- * @returns Filtered array of refactor clusters
- */
-declare function filterClustersByImpact(clusters: RefactorCluster[], minTokenCost?: number, minFiles?: number): RefactorCluster[];
-
-interface PatternDetectOptions extends ScanOptions {
-    minSimilarity?: number;
-    minLines?: number;
-    batchSize?: number;
-    approx?: boolean;
-    minSharedTokens?: number;
-    maxCandidatesPerBlock?: number;
-    streamResults?: boolean;
-    severity?: string;
-    includeTests?: boolean;
-    useSmartDefaults?: boolean;
-    groupByFilePair?: boolean;
-    createClusters?: boolean;
-    minClusterTokenCost?: number;
-    minClusterFiles?: number;
-    excludePatterns?: string[];
-    confidenceThreshold?: number;
-    ignoreWhitelist?: string[];
-    onProgress?: (processed: number, total: number, message: string) => void;
-}
-interface PatternSummary {
-    totalPatterns: number;
-    totalTokenCost: number;
-    patternsByType: Record<PatternType, number>;
-    topDuplicates: Array<{
-        files: Array<{
-            path: string;
-            startLine: number;
-            endLine: number;
-        }>;
-        similarity: number;
-        patternType: PatternType;
-        tokenCost: number;
-    }>;
-}
-/**
- * Determine smart defaults based on repository size estimation.
- *
- * @param directory - The directory to analyze for size.
- * @param userOptions - User-provided option overrides.
- * @returns Promise resolving to optimal detection options.
- */
-declare function getSmartDefaults(directory: string, userOptions: Partial<PatternDetectOptions>): Promise<PatternDetectOptions>;
-/**
- * Main entry point for pattern detection analysis.
- *
- * @param options - Configuration including rootDir and detection parameters.
- * @returns Promise resolving to the comprehensive pattern detect report.
- * @lastUpdated 2026-03-18
- */
-declare function analyzePatterns(options: PatternDetectOptions): Promise<{
-    results: AnalysisResult[];
-    duplicates: DuplicatePattern[];
-    files: string[];
-    groups?: DuplicateGroup[];
-    clusters?: RefactorCluster[];
-    config: PatternDetectOptions;
-}>;
-/**
- * Generate a summary of pattern detection results.
- *
- * @param results - Array of file-level analysis results.
- * @returns Consolidated pattern summary object.
- */
-declare function generateSummary(results: AnalysisResult[]): PatternSummary;
-
-/**
- * Calculate AI Readiness Score for pattern duplication (0-100)
- *
- * Based on:
- * - Number of duplicates per file
- * - Token waste per file
- * - High-impact duplicates (>1000 tokens or >70% similarity)
- *
- * Includes business value metrics:
- * - Estimated monthly cost of token waste
- * - Estimated developer hours to fix
- *
- * @param duplicates - Array of detected duplicate patterns.
- * @param totalFilesAnalyzed - Total count of files scanned.
- * @param costConfig - Optional configuration for business value calculations.
- * @returns Standardized scoring output for pattern detection.
- */
-declare function calculatePatternScore(duplicates: DuplicatePattern[], totalFilesAnalyzed: number, costConfig?: Partial<CostConfig>): ToolScoringOutput;
-
-/**
- * Context-aware severity detection for duplicate patterns
- * Identifies intentional duplication patterns and adjusts severity accordingly
- */
-interface ContextRule {
-    name: string;
-    detect: (file: string, code: string) => boolean;
-    severity: Severity;
-    reason: string;
-    suggestion?: string;
-}
-/**
- * Context rules for detecting intentional or acceptable duplication patterns
- * Rules are checked in order - first match wins
- */
-declare const CONTEXT_RULES: ContextRule[];
-/**
- * Calculate severity based on context rules and code characteristics
- *
- * @param file1 - First file path in the duplicate pair.
- * @param file2 - Second file path in the duplicate pair.
- * @param code - Snippet of the duplicated code.
- * @param similarity - The calculated similarity score (0-1).
- * @param linesOfCode - Number of lines in the duplicated block.
- * @returns An object containing the severity level and reasoning.
- */
-declare function calculateSeverity(file1: string, file2: string, code: string, similarity: number, linesOfCode: number): {
-    severity: Severity;
-    reason?: string;
-    suggestion?: string;
-    matchedRule?: string;
-};
-/**
- * Get a human-readable severity label with emoji
- *
- * @param severity - The severity level to label.
- * @returns Formatted label string for UI display.
- */
-declare function getSeverityLabel(severity: Severity): string;
-/**
- * Filter duplicates by minimum severity threshold
- *
- * @param duplicates - List of items with a severity property.
- * @param minSeverity - Minimum threshold for inclusion.
- * @returns Filtered list of items.
- */
-declare function filterBySeverity<T extends {
-    severity: Severity;
-}>(duplicates: T[], minSeverity: Severity): T[];
-/**
- * Get numerical similarity threshold associated with a severity level
- *
- * @param severity - The severity level to look up.
- * @returns Minimum similarity value for this severity.
- */
-declare function getSeverityThreshold(severity: Severity): number;
-
-export { CONTEXT_RULES, type ContextRule, type DuplicateGroup, type DuplicatePattern, type PatternDetectOptions, PatternDetectProvider, type PatternSummary, type PatternType, type RefactorCluster, analyzePatterns, calculatePatternScore, calculateSeverity, createRefactorClusters, detectDuplicatePatterns, filterBySeverity, filterClustersByImpact, generateSummary, getSeverityLabel, getSeverityThreshold, getSmartDefaults, groupDuplicatesByFilePair };
+export { PatternDetectProvider };