coverme-scanner 2.0.1 → 4.0.0

package/README.md

@@ -4,7 +4,7 @@
 
 ### The Most Comprehensive AI Security Scanner for Your Codebase
 
-**22 AI Agents | Auto-Detection | Runtime Verification | Zero Config**
+**23 AI Agents | AST Analysis | STRIDE + DREAD | Professional PDF Reports | Zero Config**
 
 [![npm version](https://img.shields.io/npm/v/coverme-scanner.svg?style=flat-square)](https://www.npmjs.com/package/coverme-scanner)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg?style=flat-square)](https://opensource.org/licenses/MIT)
@@ -47,7 +47,7 @@ coverme init
 /coverme
 ```
 
-**That's it.** Watch 22 AI agents analyze your entire codebase and generate a beautiful HTML report.
+**That's it.** Watch 23 AI agents analyze your entire codebase and generate a professional PDF or HTML report.
 
 ---
 
@@ -76,13 +76,14 @@ Agents that aren't relevant to your project **automatically skip**:
 
 ---
 
-## 22 Specialized Agents
+## 23 Specialized Agents
 
 <details>
 <summary><b>Security Agents (Click to expand)</b></summary>
 
 | Agent | What It Finds |
 |-------|---------------|
+| **Advanced Static Analysis** | AST dead code detection, duplication detection, STRIDE classification, DREAD scoring |
 | **Security Core** | OWASP Top 10, SQL/NoSQL injection, XSS, Command injection, SSRF, Path traversal |
 | **Auth & Session** | OAuth flaws, JWT vulnerabilities, session fixation, cookie security, MFA bypass |
 | **API Security** | CORS misconfiguration, rate limiting, IDOR, mass assignment, webhook security |
@@ -124,9 +125,31 @@ Agents that aren't relevant to your project **automatically skip**:
 
 ---
 
+## v3.0 — Enterprise Analysis Engine
+
+New in v3.0:
+
+| Feature | Description |
+|---------|-------------|
+| **Professional PDF Reports** | Enterprise-grade PDFs — cover page, threat model, architecture overview |
+| **AST Dead Code Detection** | Unused imports, variables, functions, unreachable code |
+| **Code Duplication Detection** | Jaro-Winkler similarity; shows lines removable by merging |
+| **STRIDE Threat Modeling** | Auto-classifies findings into STRIDE categories |
+| **DREAD Risk Scoring** | 0-10 risk scores across 5 dimensions per finding |
+
+```bash
+# Generate PDF report
+coverme report .coverme/scan.json -f pdf -o assessment.pdf
+
+# Generate HTML report
+coverme report .coverme/scan.json -f html
+```
+
+---
+
 ## Beautiful Reports
 
-CoverMe generates **professional HTML reports** with:
+CoverMe generates **professional HTML and PDF reports** with:
 
 <table>
 <tr>

package/dist/analyzers/ast-analyzer.d.ts

@@ -0,0 +1,29 @@
+export interface DeadCodeFinding {
+    type: 'unused-import' | 'unused-variable' | 'unused-function' | 'unreachable-code';
+    file: string;
+    line: number;
+    endLine?: number;
+    name?: string;
+    description: string;
+}
+export interface CodeMetrics {
+    linesOfCode: number;
+    totalFunctions: number;
+    totalVariables: number;
+    totalImports: number;
+    cyclomaticComplexity: number;
+    cognitiveComplexity: number;
+}
+export declare class ASTAnalyzer {
+    private usedIdentifiers;
+    private declaredIdentifiers;
+    private imports;
+    analyzeFile(filePath: string): Promise<{
+        deadCode: DeadCodeFinding[];
+        metrics: CodeMetrics;
+    }>;
+    private analyzeJavaScriptAST;
+    private calculateComplexity;
+    reset(): void;
+}
+//# sourceMappingURL=ast-analyzer.d.ts.map

package/dist/analyzers/ast-analyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-analyzer.d.ts","sourceRoot":"","sources":["../../src/analyzers/ast-analyzer.ts"],"names":[],"mappings":"AAMA,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,eAAe,GAAG,iBAAiB,GAAG,iBAAiB,GAAG,kBAAkB,CAAC;IACnF,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,EAAE,MAAM,CAAC;IACrB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED,qBAAa,WAAW;IACtB,OAAO,CAAC,eAAe,CAAqB;IAC5C,OAAO,CAAC,mBAAmB,CAAqD;IAChF,OAAO,CAAC,OAAO,CAAsD;IAE/D,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;QAC3C,QAAQ,EAAE,eAAe,EAAE,CAAC;QAC5B,OAAO,EAAE,WAAW,CAAC;KACtB,CAAC;IA+BF,OAAO,CAAC,oBAAoB;IAqG5B,OAAO,CAAC,mBAAmB;IAyB3B,KAAK,IAAI,IAAI;CAKd"}

package/dist/analyzers/ast-analyzer.js

@@ -0,0 +1,194 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ASTAnalyzer = void 0;
+const parser_1 = require("@babel/parser");
+// @ts-ignore
+const traverse_1 = __importDefault(require("@babel/traverse"));
+const t = __importStar(require("@babel/types"));
+const fs_1 = require("fs");
+class ASTAnalyzer {
+    usedIdentifiers = new Set();
+    declaredIdentifiers = new Map();
+    imports = new Map();
+    async analyzeFile(filePath) {
+        const content = (0, fs_1.readFileSync)(filePath, 'utf-8');
+        const ext = filePath.split('.').pop();
+        let ast;
+        const deadCode = [];
+        const metrics = {
+            linesOfCode: content.split('\n').length,
+            totalFunctions: 0,
+            totalVariables: 0,
+            totalImports: 0,
+            cyclomaticComplexity: 0,
+            cognitiveComplexity: 0,
+        };
+        try {
+            // Use Babel parser for all file types — supports TypeScript, JSX, decorators
+            ast = (0, parser_1.parse)(content, {
+                sourceType: 'module',
+                plugins: ['jsx', 'typescript', 'decorators-legacy'],
+                errorRecovery: true,
+            });
+            this.analyzeJavaScriptAST(ast, filePath, deadCode, metrics);
+        }
+        catch (error) {
+            // Silent fail - file might not be parseable
+            return { deadCode, metrics };
+        }
+        return { deadCode, metrics };
+    }
+    analyzeJavaScriptAST(ast, filePath, deadCode, metrics) {
+        // First pass: collect declarations
+        (0, traverse_1.default)(ast, {
+            ImportDeclaration: (path) => {
+                path.node.specifiers.forEach((spec) => {
+                    const name = spec.local.name;
+                    this.imports.set(name, {
+                        line: spec.loc?.start.line || 0,
+                        used: false,
+                    });
+                    metrics.totalImports++;
+                });
+            },
+            FunctionDeclaration: (path) => {
+                metrics.totalFunctions++;
+                if (path.node.id) {
+                    this.declaredIdentifiers.set(path.node.id.name, {
+                        line: path.node.loc?.start.line || 0,
+                        type: 'function',
+                    });
+                }
+                // Calculate complexity
+                metrics.cyclomaticComplexity += this.calculateComplexity(path.node);
+            },
+            VariableDeclarator: (path) => {
+                metrics.totalVariables++;
+                if (t.isIdentifier(path.node.id)) {
+                    this.declaredIdentifiers.set(path.node.id.name, {
+                        line: path.node.loc?.start.line || 0,
+                        type: 'variable',
+                    });
+                }
+            },
+            // Second pass: track usage
+            Identifier: (path) => {
+                if (!path.isReferencedIdentifier())
+                    return;
+                this.usedIdentifiers.add(path.node.name);
+                if (this.imports.has(path.node.name)) {
+                    const imp = this.imports.get(path.node.name);
+                    imp.used = true;
+                }
+            },
+            // Detect unreachable code after return
+            ReturnStatement: (path) => {
+                const parent = path.getFunctionParent();
+                if (!parent)
+                    return;
+                const bodyPath = parent.get('body');
+                if (!bodyPath.isBlockStatement())
+                    return;
+                const statements = bodyPath.get('body');
+                const returnIndex = statements.findIndex((s) => s === path);
+                if (returnIndex >= 0 && returnIndex < statements.length - 1) {
+                    const nextStmt = statements[returnIndex + 1];
+                    deadCode.push({
+                        type: 'unreachable-code',
+                        file: filePath,
+                        line: nextStmt.node.loc?.start.line || 0,
+                        description: 'Unreachable code after return statement',
+                    });
+                }
+            },
+        });
+        // Find unused imports
+        for (const [name, info] of this.imports.entries()) {
+            if (!info.used && !name.startsWith('_')) {
+                deadCode.push({
+                    type: 'unused-import',
+                    file: filePath,
+                    line: info.line,
+                    name,
+                    description: `Unused import: ${name}`,
+                });
+            }
+        }
+        // Find unused declarations
+        for (const [name, info] of this.declaredIdentifiers.entries()) {
+            if (!this.usedIdentifiers.has(name) && !name.startsWith('_')) {
+                deadCode.push({
+                    type: info.type === 'function' ? 'unused-function' : 'unused-variable',
+                    file: filePath,
+                    line: info.line,
+                    name,
+                    description: `Unused ${info.type}: ${name}`,
+                });
+            }
+        }
+    }
+    calculateComplexity(node) {
+        let complexity = 1;
+        const visitor = {
+            IfStatement: () => complexity++,
+            SwitchCase: () => complexity++,
+            ForStatement: () => complexity++,
+            ForInStatement: () => complexity++,
+            ForOfStatement: () => complexity++,
+            WhileStatement: () => complexity++,
+            DoWhileStatement: () => complexity++,
+            ConditionalExpression: () => complexity++,
+            LogicalExpression: (path) => {
+                if (path.node.operator === '&&' || path.node.operator === '||') {
+                    complexity++;
+                }
+            },
+            CatchClause: () => complexity++,
+        };
+        (0, traverse_1.default)(node, visitor, undefined, {});
+        return complexity;
+    }
+    reset() {
+        this.usedIdentifiers.clear();
+        this.declaredIdentifiers.clear();
+        this.imports.clear();
+    }
+}
+exports.ASTAnalyzer = ASTAnalyzer;
+//# sourceMappingURL=ast-analyzer.js.map

package/dist/analyzers/ast-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-analyzer.js","sourceRoot":"","sources":["../../src/analyzers/ast-analyzer.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,0CAAsC;AACtC,aAAa;AACb,+DAAuC;AACvC,gDAAkC;AAClC,2BAAkC;AAoBlC,MAAa,WAAW;IACd,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,mBAAmB,GAAG,IAAI,GAAG,EAA0C,CAAC;IACxE,OAAO,GAAG,IAAI,GAAG,EAA2C,CAAC;IAErE,KAAK,CAAC,WAAW,CAAC,QAAgB;QAIhC,MAAM,OAAO,GAAG,IAAA,iBAAY,EAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAChD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QAEtC,IAAI,GAAQ,CAAC;QACb,MAAM,QAAQ,GAAsB,EAAE,CAAC;QACvC,MAAM,OAAO,GAAgB;YAC3B,WAAW,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM;YACvC,cAAc,EAAE,CAAC;YACjB,cAAc,EAAE,CAAC;YACjB,YAAY,EAAE,CAAC;YACf,oBAAoB,EAAE,CAAC;YACvB,mBAAmB,EAAE,CAAC;SACvB,CAAC;QAEF,IAAI,CAAC;YACH,6EAA6E;YAC7E,GAAG,GAAG,IAAA,cAAK,EAAC,OAAO,EAAE;gBACnB,UAAU,EAAE,QAAQ;gBACpB,OAAO,EAAE,CAAC,KAAK,EAAE,YAAY,EAAE,mBAAmB,CAAC;gBACnD,aAAa,EAAE,IAAI;aACpB,CAAC,CAAC;YACH,IAAI,CAAC,oBAAoB,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9D,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,4CAA4C;YAC5C,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;QAC/B,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAC/B,CAAC;IAEO,oBAAoB,CAC1B,GAAQ,EACR,QAAgB,EAChB,QAA2B,EAC3B,OAAoB;QAEpB,mCAAmC;QACnC,IAAA,kBAAQ,EAAC,GAAG,EAAE;YACZ,iBAAiB,EAAE,CAAC,IAAS,EAAE,EAAE;gBAC/B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,IAAS,EAAE,EAAE;oBACzC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;oBAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE;wBACrB,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC;wBAC/B,IAAI,EAAE,KAAK;qBACZ,CAAC,CAAC;oBACH,OAAO,CAAC,YAAY,EAAE,CAAC;gBACzB,CAAC,CAAC,CAAC;YACL,CAAC;YAED,mBAAmB,EAAE,CAAC,IAAS,EAAE,EAAE;gBACjC,OAAO,CAAC,cAAc,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;oBACjB,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;wBAC9C,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC;wBACpC,IAAI,EAAE,UAAU;qBACjB,CAAC,CAAC;gBACL,CAAC;gBACD,uBAAuB;gBACvB,OAAO,CAAC,oBAAoB,IAAI,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtE,CAAC;YAED,kBAAkB,EAAE,CAAC,IAAS,EAAE,EAAE;gBAChC,OAAO,CAAC,cAAc,EAAE,CAAC;gBACzB,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACjC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE;wBAC9C,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC;wBACpC,IAAI,EAAE,UAAU;qBACjB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,2BAA2B;YAC3B,UAAU,EAAE,CAAC,IAAS,EAAE,EAAE;gBACxB,IAAI,CAAC,IAAI,CAAC,sBAAsB,EAAE;oBAAE,OAAO;gBAC3C,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzC,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACrC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC;oBAC9C,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;YAED,uCAAuC;YACvC,eAAe,EAAE,CAAC,IAAS,EAAE,EAAE;gBAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;gBACxC,IAAI,CAAC,MAAM;oBAAE,OAAO;gBAEpB,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpC,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE;oBAAE,OAAO;gBAEzC,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACxC,MAAM,WAAW,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;gBAEjE,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC5D,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;oBAC7C,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,kBAAkB;wBACxB,IAAI,EAAE,QAAQ;wBACd,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC;wBACxC,WAAW,EAAE,yCAAyC;qBACvD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;SACF,CAAC,CAAC;QAEH,sBAAsB;QACtB,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAClD,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxC,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,eAAe;oBACrB,IAAI,EAAE,QAAQ;oBACd,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,IAAI;oBACJ,WAAW,EAAE,kBAAkB,IAAI,EAAE;iBACtC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,EAAE,CAAC;YAC9D,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC7D,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,iBAAiB;oBACtE,IAAI,EAAE,QAAQ;oBACd,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,IAAI;oBACJ,WAAW,EAAE,UAAU,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;iBAC5C,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAEO,mBAAmB,CAAC,IAAS;QACnC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,MAAM,OAAO,GAAG;YACd,WAAW,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE;YAC/B,UAAU,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE;YAC9B,YAAY,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE;YAChC,cAAc,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE;YAClC,cAAc,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE;YAClC,cAAc,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE;YAClC,gBAAgB,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE;YACpC,qBAAqB,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE;YACzC,iBAAiB,EAAE,CAAC,IAAS,EAAE,EAAE;gBAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;oBAC/D,UAAU,EAAE,CAAC;gBACf,CAAC;YACH,CAAC;YACD,WAAW,EAAE,GAAG,EAAE,CAAC,UAAU,EAAE;SAChC,CAAC;QAEF,IAAA,kBAAQ,EAAC,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;QAEvC,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;CACF;AA1KD,kCA0KC"}

package/dist/analyzers/duplication-detector.d.ts

@@ -0,0 +1,27 @@
+export interface DuplicationFinding {
+    type: 'exact-duplicate' | 'similar-code';
+    files: string[];
+    lines: Array<{
+        file: string;
+        startLine: number;
+        endLine: number;
+    }>;
+    linesCount: number;
+    similarity: number;
+    code?: string;
+    description: string;
+    recommendation: string;
+}
+export declare class DuplicationDetector {
+    private minLines;
+    private minSimilarity;
+    constructor(minLines?: number, minSimilarity?: number);
+    detectDuplications(files: string[]): Promise<DuplicationFinding[]>;
+    private extractCodeBlocks;
+    private normalizeCode;
+    private isSignificantCode;
+    private hashCode;
+    private calculateSimilarity;
+    private overlaps;
+}
+//# sourceMappingURL=duplication-detector.d.ts.map

package/dist/analyzers/duplication-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplication-detector.d.ts","sourceRoot":"","sources":["../../src/analyzers/duplication-detector.ts"],"names":[],"mappings":"AAIA,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,iBAAiB,GAAG,cAAc,CAAC;IACzC,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACnE,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;CACxB;AAUD,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,aAAa,CAAS;gBAElB,QAAQ,SAAI,EAAE,aAAa,SAAO;IAKxC,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IA6GxE,OAAO,CAAC,iBAAiB;IA4BzB,OAAO,CAAC,aAAa;IAQrB,OAAO,CAAC,iBAAiB;IAMzB,OAAO,CAAC,QAAQ;IAUhB,OAAO,CAAC,mBAAmB;IAS3B,OAAO,CAAC,QAAQ;CAGjB"}

package/dist/analyzers/duplication-detector.js

@@ -0,0 +1,169 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DuplicationDetector = void 0;
+const fs_1 = require("fs");
+// @ts-ignore - no types available; package exports default function directly
+const jaro_winkler_1 = __importDefault(require("jaro-winkler"));
+class DuplicationDetector {
+    minLines;
+    minSimilarity;
+    constructor(minLines = 5, minSimilarity = 0.85) {
+        this.minLines = minLines;
+        this.minSimilarity = minSimilarity;
+    }
+    async detectDuplications(files) {
+        const codeBlocks = [];
+        const findings = [];
+        // Extract code blocks from all files
+        for (const file of files) {
+            try {
+                const content = (0, fs_1.readFileSync)(file, 'utf-8');
+                const blocks = this.extractCodeBlocks(content, file);
+                codeBlocks.push(...blocks);
+            }
+            catch (error) {
+                // Skip files that can't be read
+                continue;
+            }
+        }
+        // Find duplicates using hash matching for exact duplicates
+        const hashMap = new Map();
+        for (const block of codeBlocks) {
+            if (!hashMap.has(block.hash)) {
+                hashMap.set(block.hash, []);
+            }
+            hashMap.get(block.hash).push(block);
+        }
+        // Report exact duplicates — deduplicate overlapping same-file windows
+        for (const [, blocks] of hashMap.entries()) {
+            if (blocks.length < 2)
+                continue;
+            // Keep only one representative per (file, non-overlapping region)
+            const deduped = [];
+            for (const block of blocks) {
+                const alreadyCovered = deduped.some((d) => d.file === block.file &&
+                    this.overlaps(d.startLine, d.endLine, block.startLine, block.endLine));
+                if (!alreadyCovered)
+                    deduped.push(block);
+            }
+            // Only report if duplicates span more than one unique non-overlapping region
+            const uniqueFiles = new Set(deduped.map((b) => b.file));
+            if (deduped.length < 2)
+                continue;
+            // If all in the same file, require non-overlapping and meaningful separation
+            if (uniqueFiles.size === 1) {
+                const sorted = deduped.sort((a, b) => a.startLine - b.startLine);
+                if (sorted[sorted.length - 1].startLine - sorted[0].endLine < 5)
+                    continue;
+            }
+            findings.push({
+                type: 'exact-duplicate',
+                files: [...uniqueFiles],
+                lines: deduped.map((b) => ({
+                    file: b.file,
+                    startLine: b.startLine,
+                    endLine: b.endLine,
+                })),
+                linesCount: deduped[0].code.split('\n').length,
+                similarity: 1.0,
+                code: deduped[0].code,
+                description: `${deduped[0].code.split('\n').length} lines of code duplicated ${deduped.length} times`,
+                recommendation: `Extract to a shared function or module`,
+            });
+        }
+        // Find similar code (not exact matches)
+        const compared = new Set();
+        for (let i = 0; i < codeBlocks.length; i++) {
+            for (let j = i + 1; j < codeBlocks.length; j++) {
+                const block1 = codeBlocks[i];
+                const block2 = codeBlocks[j];
+                const key = `${block1.file}:${block1.startLine}-${block2.file}:${block2.startLine}`;
+                if (compared.has(key))
+                    continue;
+                compared.add(key);
+                // Skip if same file and overlapping lines
+                if (block1.file === block2.file &&
+                    this.overlaps(block1.startLine, block1.endLine, block2.startLine, block2.endLine)) {
+                    continue;
+                }
+                const similarity = this.calculateSimilarity(block1.code, block2.code);
+                if (similarity >= this.minSimilarity && similarity < 1.0) {
+                    findings.push({
+                        type: 'similar-code',
+                        files: [block1.file, block2.file],
+                        lines: [
+                            { file: block1.file, startLine: block1.startLine, endLine: block1.endLine },
+                            { file: block2.file, startLine: block2.startLine, endLine: block2.endLine },
+                        ],
+                        linesCount: block1.code.split('\n').length,
+                        similarity,
+                        description: `Similar code (${(similarity * 100).toFixed(0)}% match) found in 2 locations`,
+                        recommendation: `Consider extracting common logic to reduce duplication`,
+                    });
+                }
+            }
+        }
+        // Sort by lines count (biggest duplications first)
+        findings.sort((a, b) => b.linesCount - a.linesCount);
+        return findings;
+    }
+    extractCodeBlocks(content, file) {
+        const lines = content.split('\n');
+        const blocks = [];
+        // Use non-overlapping windows (step = minLines) to avoid sliding-window noise.
+        // Also try half-step offset to catch duplicates not aligned to the same boundary.
+        const offsets = [0, Math.floor(this.minLines / 2)];
+        for (const offset of offsets) {
+            for (let i = offset; i < lines.length - this.minLines; i += this.minLines) {
+                const block = lines.slice(i, i + this.minLines).join('\n');
+                const normalized = this.normalizeCode(block);
+                if (this.isSignificantCode(normalized)) {
+                    blocks.push({
+                        file,
+                        startLine: i + 1,
+                        endLine: i + this.minLines,
+                        code: block,
+                        hash: this.hashCode(normalized),
+                    });
+                }
+            }
+        }
+        return blocks;
+    }
+    normalizeCode(code) {
+        return code
+            .replace(/\/\*[\s\S]*?\*\/|\/\/.*/g, '') // Remove comments
+            .replace(/\s+/g, ' ') // Normalize whitespace
+            .replace(/['"]([^'"]*)['"]/g, '""') // Normalize strings
+            .trim();
+    }
+    isSignificantCode(code) {
+        // Filter out mostly empty lines, imports, simple declarations
+        const significantChars = code.replace(/[{}();,\s]/g, '').length;
+        return significantChars > 20;
+    }
+    hashCode(str) {
+        let hash = 0;
+        for (let i = 0; i < str.length; i++) {
+            const char = str.charCodeAt(i);
+            hash = (hash << 5) - hash + char;
+            hash = hash & hash;
+        }
+        return hash.toString(36);
+    }
+    calculateSimilarity(code1, code2) {
+        const norm1 = this.normalizeCode(code1);
+        const norm2 = this.normalizeCode(code2);
+        // Use Jaro-Winkler distance (package exports the function as default)
+        const distanceFn = typeof jaro_winkler_1.default === 'function' ? jaro_winkler_1.default : jaro_winkler_1.default.distance;
+        return distanceFn(norm1, norm2);
+    }
+    overlaps(start1, end1, start2, end2) {
+        return start1 <= end2 && start2 <= end1;
+    }
+}
+exports.DuplicationDetector = DuplicationDetector;
+//# sourceMappingURL=duplication-detector.js.map

package/dist/analyzers/duplication-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplication-detector.js","sourceRoot":"","sources":["../../src/analyzers/duplication-detector.ts"],"names":[],"mappings":";;;;;;AAAA,2BAAkC;AAClC,6EAA6E;AAC7E,gEAAuC;AAqBvC,MAAa,mBAAmB;IACtB,QAAQ,CAAS;IACjB,aAAa,CAAS;IAE9B,YAAY,QAAQ,GAAG,CAAC,EAAE,aAAa,GAAG,IAAI;QAC5C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED,KAAK,CAAC,kBAAkB,CAAC,KAAe;QACtC,MAAM,UAAU,GAAgB,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAyB,EAAE,CAAC;QAE1C,qCAAqC;QACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,IAAA,iBAAY,EAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBACrD,UAAU,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;YAC7B,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,gCAAgC;gBAChC,SAAS;YACX,CAAC;QACH,CAAC;QAED,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC;QAED,sEAAsE;QACtE,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAC3C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YAEhC,kEAAkE;YAClE,MAAM,OAAO,GAAgB,EAAE,CAAC;YAChC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,CACjC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;oBACrB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,CACxE,CAAC;gBACF,IAAI,CAAC,cAAc;oBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3C,CAAC;YAED,6EAA6E;YAC7E,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACxD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YACjC,6EAA6E;YAC7E,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC3B,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;gBACjE,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC;oBAAE,SAAS;YAC5E,CAAC;YAED,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,iBAAiB;gBACvB,KAAK,EAAE,CAAC,GAAG,WAAW,CAAC;gBACvB,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACzB,IAAI,EAAE,CAAC,CAAC,IAAI;oBACZ,SAAS,EAAE,CAAC,CAAC,SAAS;oBACtB,OAAO,EAAE,CAAC,CAAC,OAAO;iBACnB,CAAC,CAAC;gBACH,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM;gBAC9C,UAAU,EAAE,GAAG;gBACf,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI;gBACrB,WAAW,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,6BAA6B,OAAO,CAAC,MAAM,QAAQ;gBACrG,cAAc,EAAE,wCAAwC;aACzD,CAAC,CAAC;QACL,CAAC;QAED,wCAAwC;QACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBAE7B,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACpF,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAChC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAElB,0CAA0C;gBAC1C,IACE,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI;oBAC3B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,OAAO,CAAC,EACjF,CAAC;oBACD,SAAS;gBACX,CAAC;gBAED,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;gBAEtE,IAAI,UAAU,IAAI,IAAI,CAAC,aAAa,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;oBACzD,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,cAAc;wBACpB,KAAK,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC;wBACjC,KAAK,EAAE;4BACL,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE;4BAC3E,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE;yBAC5E;wBACD,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM;wBAC1C,UAAU;wBACV,WAAW,EAAE,iBAAiB,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,+BAA+B;wBAC1F,cAAc,EAAE,wDAAwD;qBACzE,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,mDAAmD;QACnD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAErD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,iBAAiB,CAAC,OAAe,EAAE,IAAY;QACrD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,MAAM,GAAgB,EAAE,CAAC;QAE/B,+EAA+E;QAC/E,kFAAkF;QAClF,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;QAEnD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC1E,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3D,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBAE7C,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,CAAC;oBACvC,MAAM,CAAC,IAAI,CAAC;wBACV,IAAI;wBACJ,SAAS,EAAE,CAAC,GAAG,CAAC;wBAChB,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ;wBAC1B,IAAI,EAAE,KAAK;wBACX,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC;qBAChC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,aAAa,CAAC,IAAY;QAChC,OAAO,IAAI;aACR,OAAO,CAAC,0BAA0B,EAAE,EAAE,CAAC,CAAC,kBAAkB;aAC1D,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,uBAAuB;aAC5C,OAAO,CAAC,mBAAmB,EAAE,IAAI,CAAC,CAAC,oBAAoB;aACvD,IAAI,EAAE,CAAC;IACZ,CAAC;IAEO,iBAAiB,CAAC,IAAY;QACpC,8DAA8D;QAC9D,MAAM,gBAAgB,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC;QAChE,OAAO,gBAAgB,GAAG,EAAE,CAAC;IAC/B,CAAC;IAEO,QAAQ,CAAC,GAAW;QAC1B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;YACjC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC3B,CAAC;IAEO,mBAAmB,CAAC,KAAa,EAAE,KAAa;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAExC,sEAAsE;QACtE,MAAM,UAAU,GAAG,OAAO,sBAAW,KAAK,UAAU,CAAC,CAAC,CAAC,sBAAW,CAAC,CAAC,CAAE,sBAAmB,CAAC,QAAQ,CAAC;QACnG,OAAO,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;IAEO,QAAQ,CAAC,MAAc,EAAE,IAAY,EAAE,MAAc,EAAE,IAAY;QACzE,OAAO,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC;IAC1C,CAAC;CACF;AAtLD,kDAsLC"}

package/dist/analyzers/index.d.ts

@@ -0,0 +1,5 @@
+export { ASTAnalyzer } from './ast-analyzer.js';
+export { DuplicationDetector } from './duplication-detector.js';
+export { STRIDEAnalyzer } from './stride-analyzer.js';
+export type { STRIDECategory, STRIDEThreat } from './stride-analyzer.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/analyzers/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/analyzers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,YAAY,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/analyzers/index.js

@@ -0,0 +1,10 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.STRIDEAnalyzer = exports.DuplicationDetector = exports.ASTAnalyzer = void 0;
+var ast_analyzer_js_1 = require("./ast-analyzer.js");
+Object.defineProperty(exports, "ASTAnalyzer", { enumerable: true, get: function () { return ast_analyzer_js_1.ASTAnalyzer; } });
+var duplication_detector_js_1 = require("./duplication-detector.js");
+Object.defineProperty(exports, "DuplicationDetector", { enumerable: true, get: function () { return duplication_detector_js_1.DuplicationDetector; } });
+var stride_analyzer_js_1 = require("./stride-analyzer.js");
+Object.defineProperty(exports, "STRIDEAnalyzer", { enumerable: true, get: function () { return stride_analyzer_js_1.STRIDEAnalyzer; } });
+//# sourceMappingURL=index.js.map

package/dist/analyzers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/analyzers/index.ts"],"names":[],"mappings":";;;AAAA,qDAAgD;AAAvC,8GAAA,WAAW,OAAA;AACpB,qEAAgE;AAAvD,8HAAA,mBAAmB,OAAA;AAC5B,2DAAsD;AAA7C,oHAAA,cAAc,OAAA"}

package/dist/analyzers/stride-analyzer.d.ts

@@ -0,0 +1,20 @@
+import { Finding, DreadScore } from '../types.js';
+export type STRIDECategory = 'Spoofing' | 'Tampering' | 'Repudiation' | 'Information Disclosure' | 'Denial of Service' | 'Elevation of Privilege';
+export interface STRIDEThreat {
+    id: string;
+    category: STRIDECategory;
+    threat: string;
+    component: string;
+    attackVector?: string;
+    mitigation?: string;
+    status: 'open' | 'mitigated' | 'partial' | 'accepted';
+    dreadScore?: DreadScore;
+    relatedFindings?: string[];
+}
+export declare class STRIDEAnalyzer {
+    calculateDREAD(finding: Finding): DreadScore;
+    classifySTRIDE(finding: Finding): STRIDECategory[];
+    generateThreatModel(findings: Finding[]): STRIDEThreat[];
+    private inferStatus;
+}
+//# sourceMappingURL=stride-analyzer.d.ts.map

package/dist/analyzers/stride-analyzer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stride-analyzer.d.ts","sourceRoot":"","sources":["../../src/analyzers/stride-analyzer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAElD,MAAM,MAAM,cAAc,GAAG,UAAU,GAAG,WAAW,GAAG,aAAa,GAAG,wBAAwB,GAAG,mBAAmB,GAAG,wBAAwB,CAAC;AAElJ,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,cAAc,CAAC;IACzB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS,GAAG,UAAU,CAAC;IACtD,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED,qBAAa,cAAc;IACzB,cAAc,CAAC,OAAO,EAAE,OAAO,GAAG,UAAU;IA2E5C,cAAc,CAAC,OAAO,EAAE,OAAO,GAAG,cAAc,EAAE;IA8ElD,mBAAmB,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,YAAY,EAAE;IA4BxD,OAAO,CAAC,WAAW;CAkBpB"}