@aiready/pattern-detect 0.17.8 → 0.17.12

package/dist/python-extractor-ELAKYK2W.mjs

@@ -1,140 +0,0 @@
-// src/extractors/python-extractor.ts
-import { getParser } from "@aiready/core";
-async function extractPythonPatterns(files) {
-  const patterns = [];
-  const parser = getParser("dummy.py");
-  if (!parser) {
-    console.warn("Python parser not available");
-    return patterns;
-  }
-  const pythonFiles = files.filter((f) => f.toLowerCase().endsWith(".py"));
-  for (const file of pythonFiles) {
-    try {
-      const fs = await import("fs");
-      const code = await fs.promises.readFile(file, "utf-8");
-      const result = parser.parse(code, file);
-      for (const exp of result.exports) {
-        if (exp.type === "function") {
-          patterns.push({
-            file,
-            name: exp.name,
-            type: "function",
-            startLine: exp.loc?.start.line || 0,
-            endLine: exp.loc?.end.line || 0,
-            imports: exp.imports || [],
-            dependencies: exp.dependencies || [],
-            signature: generatePythonSignature(exp),
-            language: "python"
-          });
-        } else if (exp.type === "class") {
-          patterns.push({
-            file,
-            name: exp.name,
-            type: "class",
-            startLine: exp.loc?.start.line || 0,
-            endLine: exp.loc?.end.line || 0,
-            imports: exp.imports || [],
-            dependencies: exp.dependencies || [],
-            signature: `class ${exp.name}`,
-            language: "python"
-          });
-        }
-      }
-    } catch (error) {
-      console.warn(`Failed to extract patterns from ${file}:`, error);
-    }
-  }
-  return patterns;
-}
-function generatePythonSignature(exp) {
-  const params = exp.parameters?.join(", ") || "";
-  return `def ${exp.name}(${params})`;
-}
-function calculatePythonSimilarity(pattern1, pattern2) {
-  let similarity = 0;
-  let factors = 0;
-  const nameSimilarity = calculateNameSimilarity(pattern1.name, pattern2.name);
-  similarity += nameSimilarity * 0.3;
-  factors += 0.3;
-  const importSimilarity = calculateImportSimilarity(
-    pattern1.imports || [],
-    pattern2.imports || []
-  );
-  similarity += importSimilarity * 0.4;
-  factors += 0.4;
-  if (pattern1.type === pattern2.type) {
-    similarity += 0.1;
-  }
-  factors += 0.1;
-  const sigSimilarity = calculateSignatureSimilarity(
-    pattern1.signature,
-    pattern2.signature
-  );
-  similarity += sigSimilarity * 0.2;
-  factors += 0.2;
-  return factors > 0 ? similarity / factors : 0;
-}
-function calculateNameSimilarity(name1, name2) {
-  if (name1 === name2) return 1;
-  const clean1 = name1.replace(
-    /^(get|set|is|has|create|delete|update|fetch)_?/,
-    ""
-  );
-  const clean2 = name2.replace(
-    /^(get|set|is|has|create|delete|update|fetch)_?/,
-    ""
-  );
-  if (clean1 === clean2) return 0.9;
-  if (clean1.includes(clean2) || clean2.includes(clean1)) {
-    return 0.7;
-  }
-  const set1 = new Set(clean1.split("_"));
-  const set2 = new Set(clean2.split("_"));
-  const intersection = new Set([...set1].filter((x) => set2.has(x)));
-  const union = /* @__PURE__ */ new Set([...set1, ...set2]);
-  return intersection.size / union.size;
-}
-function calculateImportSimilarity(imports1, imports2) {
-  if (imports1.length === 0 && imports2.length === 0) return 1;
-  if (imports1.length === 0 || imports2.length === 0) return 0;
-  const set1 = new Set(imports1);
-  const set2 = new Set(imports2);
-  const intersection = new Set([...set1].filter((x) => set2.has(x)));
-  const union = /* @__PURE__ */ new Set([...set1, ...set2]);
-  return intersection.size / union.size;
-}
-function calculateSignatureSimilarity(sig1, sig2) {
-  if (sig1 === sig2) return 1;
-  const params1 = (sig1.match(/\([^)]*\)/)?.[0] || "").split(",").filter(Boolean).length;
-  const params2 = (sig2.match(/\([^)]*\)/)?.[0] || "").split(",").filter(Boolean).length;
-  if (params1 === params2) return 0.8;
-  if (Math.abs(params1 - params2) === 1) return 0.5;
-  return 0;
-}
-function detectPythonAntiPatterns(patterns) {
-  const antiPatterns = [];
-  const nameGroups = /* @__PURE__ */ new Map();
-  for (const pattern of patterns) {
-    const baseName = pattern.name.replace(
-      /^(get|set|create|delete|update)_/,
-      ""
-    );
-    if (!nameGroups.has(baseName)) {
-      nameGroups.set(baseName, []);
-    }
-    nameGroups.get(baseName).push(pattern);
-  }
-  for (const [baseName, group] of nameGroups) {
-    if (group.length >= 3) {
-      antiPatterns.push(
-        `Found ${group.length} functions with similar names (${baseName}): Consider consolidating`
-      );
-    }
-  }
-  return antiPatterns;
-}
-export {
-  calculatePythonSimilarity,
-  detectPythonAntiPatterns,
-  extractPythonPatterns
-};

package/dist/scoring-entry.d.mts

@@ -1,23 +0,0 @@
-import { CostConfig, ToolScoringOutput } from '@aiready/core';
-import { a as DuplicatePattern } from './types-C4lmb2Yh.mjs';
-
-/**
- * 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;
-
-export { calculatePatternScore };

package/dist/scoring-entry.d.ts

@@ -1,23 +0,0 @@
-import { CostConfig, ToolScoringOutput } from '@aiready/core';
-import { a as DuplicatePattern } from './types-C4lmb2Yh.js';
-
-/**
- * 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;
-
-export { calculatePatternScore };

package/dist/scoring-entry.mjs

@@ -1,6 +0,0 @@
-import {
-  calculatePatternScore
-} from "./chunk-WBBO35SC.mjs";
-export {
-  calculatePatternScore
-};

package/dist/scoring.d.ts

@@ -1,12 +0,0 @@
-import type { ToolScoringOutput } from '@aiready/core';
-import type { DuplicatePattern } from './detector';
-/**
- * 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)
- */
-export declare function calculatePatternScore(duplicates: DuplicatePattern[], totalFilesAnalyzed: number): ToolScoringOutput;
-//# sourceMappingURL=scoring.d.ts.map

package/dist/scoring.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"scoring.d.ts","sourceRoot":"","sources":["../src/scoring.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAEnD;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,gBAAgB,EAAE,EAC9B,kBAAkB,EAAE,MAAM,GACzB,iBAAiB,CAyHnB"}

package/dist/scoring.js

@@ -1,116 +0,0 @@
-/**
- * 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)
- */
-export function calculatePatternScore(duplicates, totalFilesAnalyzed) {
-    // Calculate raw metrics
-    const totalDuplicates = duplicates.length;
-    const totalTokenCost = duplicates.reduce((sum, d) => sum + d.tokenCost, 0);
-    const highImpactDuplicates = duplicates.filter(d => d.tokenCost > 1000 || d.similarity > 0.7).length;
-    // Avoid division by zero
-    if (totalFilesAnalyzed === 0) {
-        return {
-            toolName: 'pattern-detect',
-            score: 100,
-            rawMetrics: { totalDuplicates: 0, totalTokenCost: 0, highImpactDuplicates: 0, totalFilesAnalyzed: 0 },
-            factors: [],
-            recommendations: [],
-        };
-    }
-    // Normalize to duplicates per 100 files
-    const duplicatesPerFile = (totalDuplicates / totalFilesAnalyzed) * 100;
-    // Token waste per file
-    const tokenWastePerFile = totalTokenCost / totalFilesAnalyzed;
-    // Calculate penalties
-    // Duplicates penalty: 0-60 points
-    // - 0 duplicates = 0 penalty
-    // - 1 duplicate per 10 files (10 per 100) = 6 penalty
-    // - 1 duplicate per 5 files (20 per 100) = 12 penalty
-    // - 1 duplicate per file (100 per 100) = 60 penalty
-    const duplicatesPenalty = Math.min(60, duplicatesPerFile * 0.6);
-    // Token waste penalty: 0-40 points
-    // - 0 waste = 0 penalty
-    // - 1000 tokens/file = 8 penalty
-    // - 5000 tokens/file = 40 penalty
-    const tokenPenalty = Math.min(40, tokenWastePerFile / 125);
-    // High impact adjustment: -15 to +5 points
-    // - No high-impact duplicates = +5 bonus
-    // - 5+ high-impact duplicates = -10 penalty
-    const highImpactPenalty = highImpactDuplicates > 0
-        ? Math.min(15, highImpactDuplicates * 2 - 5)
-        : -5; // bonus
-    const score = 100 - duplicatesPenalty - tokenPenalty - highImpactPenalty;
-    const finalScore = Math.max(0, Math.min(100, Math.round(score)));
-    // Build factors array
-    const factors = [
-        {
-            name: 'Duplication Density',
-            impact: -Math.round(duplicatesPenalty),
-            description: `${duplicatesPerFile.toFixed(1)} duplicates per 100 files`,
-        },
-        {
-            name: 'Token Waste',
-            impact: -Math.round(tokenPenalty),
-            description: `${Math.round(tokenWastePerFile)} tokens wasted per file`,
-        },
-    ];
-    if (highImpactDuplicates > 0) {
-        factors.push({
-            name: 'High-Impact Patterns',
-            impact: -Math.round(highImpactPenalty),
-            description: `${highImpactDuplicates} high-impact duplicates (>1000 tokens or >70% similar)`,
-        });
-    }
-    else {
-        factors.push({
-            name: 'No High-Impact Patterns',
-            impact: 5,
-            description: 'No severe duplicates detected',
-        });
-    }
-    // Generate recommendations
-    const recommendations = [];
-    if (highImpactDuplicates > 0) {
-        const estimatedImpact = Math.min(15, highImpactDuplicates * 3);
-        recommendations.push({
-            action: `Deduplicate ${highImpactDuplicates} high-impact pattern${highImpactDuplicates > 1 ? 's' : ''}`,
-            estimatedImpact,
-            priority: 'high',
-        });
-    }
-    if (totalDuplicates > 10 && duplicatesPerFile > 20) {
-        const estimatedImpact = Math.min(10, Math.round(duplicatesPenalty * 0.3));
-        recommendations.push({
-            action: 'Extract common patterns into shared utilities',
-            estimatedImpact,
-            priority: 'medium',
-        });
-    }
-    if (tokenWastePerFile > 2000) {
-        const estimatedImpact = Math.min(8, Math.round(tokenPenalty * 0.4));
-        recommendations.push({
-            action: 'Consolidate duplicated logic to reduce AI context waste',
-            estimatedImpact,
-            priority: totalTokenCost > 10000 ? 'high' : 'medium',
-        });
-    }
-    return {
-        toolName: 'pattern-detect',
-        score: finalScore,
-        rawMetrics: {
-            totalDuplicates,
-            totalTokenCost,
-            highImpactDuplicates,
-            totalFilesAnalyzed,
-            duplicatesPerFile: Math.round(duplicatesPerFile * 10) / 10,
-            tokenWastePerFile: Math.round(tokenWastePerFile),
-        },
-        factors,
-        recommendations,
-    };
-}
-//# sourceMappingURL=scoring.js.map

package/dist/scoring.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scoring.js","sourceRoot":"","sources":["../src/scoring.ts"],"names":[],"mappings":"AAGA;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACnC,UAA8B,EAC9B,kBAA0B;IAE1B,wBAAwB;IACxB,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC;IAC1C,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAC3E,MAAM,oBAAoB,GAAG,UAAU,CAAC,MAAM,CAC5C,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,IAAI,CAAC,CAAC,UAAU,GAAG,GAAG,CAC9C,CAAC,MAAM,CAAC;IAET,yBAAyB;IACzB,IAAI,kBAAkB,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO;YACL,QAAQ,EAAE,gBAAgB;YAC1B,KAAK,EAAE,GAAG;YACV,UAAU,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,oBAAoB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE;YACrG,OAAO,EAAE,EAAE;YACX,eAAe,EAAE,EAAE;SACpB,CAAC;IACJ,CAAC;IAED,wCAAwC;IACxC,MAAM,iBAAiB,GAAG,CAAC,eAAe,GAAG,kBAAkB,CAAC,GAAG,GAAG,CAAC;IAEvE,uBAAuB;IACvB,MAAM,iBAAiB,GAAG,cAAc,GAAG,kBAAkB,CAAC;IAE9D,sBAAsB;IACtB,kCAAkC;IAClC,6BAA6B;IAC7B,sDAAsD;IACtD,sDAAsD;IACtD,oDAAoD;IACpD,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,iBAAiB,GAAG,GAAG,CAAC,CAAC;IAEhE,mCAAmC;IACnC,wBAAwB;IACxB,iCAAiC;IACjC,kCAAkC;IAClC,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,iBAAiB,GAAG,GAAG,CAAC,CAAC;IAE3D,2CAA2C;IAC3C,yCAAyC;IACzC,4CAA4C;IAC5C,MAAM,iBAAiB,GAAG,oBAAoB,GAAG,CAAC;QAChD,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,oBAAoB,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ;IAEhB,MAAM,KAAK,GAAG,GAAG,GAAG,iBAAiB,GAAG,YAAY,GAAG,iBAAiB,CAAC;IACzE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEjE,sBAAsB;IACtB,MAAM,OAAO,GAAG;QACd;YACE,IAAI,EAAE,qBAAqB;YAC3B,MAAM,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;YACtC,WAAW,EAAE,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,2BAA2B;SACxE;QACD;YACE,IAAI,EAAE,aAAa;YACnB,MAAM,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;YACjC,WAAW,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,yBAAyB;SACvE;KACF,CAAC;IAEF,IAAI,oBAAoB,GAAG,CAAC,EAAE,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,sBAAsB;YAC5B,MAAM,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;YACtC,WAAW,EAAE,GAAG,oBAAoB,wDAAwD;SAC7F,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,yBAAyB;YAC/B,MAAM,EAAE,CAAC;YACT,WAAW,EAAE,+BAA+B;SAC7C,CAAC,CAAC;IACL,CAAC;IAED,2BAA2B;IAC3B,MAAM,eAAe,GAAyC,EAAE,CAAC;IAEjE,IAAI,oBAAoB,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,oBAAoB,GAAG,CAAC,CAAC,CAAC;QAC/D,eAAe,CAAC,IAAI,CAAC;YACnB,MAAM,EAAE,eAAe,oBAAoB,uBAAuB,oBAAoB,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACvG,eAAe;YACf,QAAQ,EAAE,MAAM;SACjB,CAAC,CAAC;IACL,CAAC;IAED,IAAI,eAAe,GAAG,EAAE,IAAI,iBAAiB,GAAG,EAAE,EAAE,CAAC;QACnD,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,iBAAiB,GAAG,GAAG,CAAC,CAAC,CAAC;QAC1E,eAAe,CAAC,IAAI,CAAC;YACnB,MAAM,EAAE,+CAA+C;YACvD,eAAe;YACf,QAAQ,EAAE,QAAQ;SACnB,CAAC,CAAC;IACL,CAAC;IAED,IAAI,iBAAiB,GAAG,IAAI,EAAE,CAAC;QAC7B,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,GAAG,CAAC,CAAC,CAAC;QACpE,eAAe,CAAC,IAAI,CAAC;YACnB,MAAM,EAAE,yDAAyD;YACjE,eAAe;YACf,QAAQ,EAAE,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;SACrD,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,gBAAgB;QAC1B,KAAK,EAAE,UAAU;QACjB,UAAU,EAAE;YACV,eAAe;YACf,cAAc;YACd,oBAAoB;YACpB,kBAAkB;YAClB,iBAAiB,EAAE,IAAI,CAAC,KAAK,CAAC,iBAAiB,GAAG,EAAE,CAAC,GAAG,EAAE;YAC1D,iBAAiB,EAAE,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC;SACjD;QACD,OAAO;QACP,eAAe;KAChB,CAAC;AACJ,CAAC"}

package/dist/types-C4lmb2Yh.d.mts

@@ -1,36 +0,0 @@
-import { Severity } from '@aiready/core';
-
-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;
-}
-
-export type { DetectionOptions as D, PatternType as P, DuplicatePattern as a };

package/dist/types-C4lmb2Yh.d.ts

@@ -1,36 +0,0 @@
-import { Severity } from '@aiready/core';
-
-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;
-}
-
-export type { DetectionOptions as D, PatternType as P, DuplicatePattern as a };