@aiready/pattern-detect 0.7.7 → 0.7.11

package/README.md

@@ -388,6 +388,136 @@ Use these presets to quickly balance precision, recall, and runtime:
   - `minLines 8–10` → `minSharedTokens 8–10` (precision-first)
 - Default balance: `minLines=5`, `minSharedTokens=8` works well for most repos. Reduce `minSharedTokens` only when you specifically want to catch more short helpers.
 
+## 🎯 Parameter Tuning Guide
+
+### When You Get Too Few Results
+
+If the tool finds fewer duplicates than expected, try these adjustments in order:
+
+**1. Lower similarity threshold** (most effective)
+```bash
+# Default: 0.4, try lowering to find more potential duplicates
+aiready-patterns ./src --similarity 0.3    # More sensitive
+aiready-patterns ./src --similarity 0.2    # Very sensitive (may include noise)
+```
+*Tradeoff: More results but potentially more false positives*
+
+**2. Reduce minimum lines**
+```bash
+# Default: 5, try lowering to catch smaller functions/utilities
+aiready-patterns ./src --min-lines 3        # Include very small functions
+aiready-patterns ./src --min-lines 1        # Include almost everything
+```
+*Tradeoff: More results but slower analysis and more noise*
+
+**3. Lower shared tokens threshold**
+```bash
+# Default: 8, try lowering to expand candidate pool
+aiready-patterns ./src --min-shared-tokens 5  # More candidates
+aiready-patterns ./src --min-shared-tokens 3  # Many more candidates
+```
+*Tradeoff: More results but slower analysis*
+
+**4. Include test files**
+```bash
+aiready-patterns ./src --include-tests
+```
+*Tradeoff: More results but may include test-specific patterns*
+
+**5. Increase max candidates per block**
+```bash
+# Default: 100, try increasing for more thorough search
+aiready-patterns ./src --max-candidates 200  # More thorough
+```
+*Tradeoff: Slower analysis but more comprehensive*
+
+### When Analysis is Too Slow
+
+If the tool takes too long to run, try these optimizations in order:
+
+**1. Increase minimum lines** (most effective)
+```bash
+# Default: 5, try increasing to focus on substantial functions
+aiready-patterns ./src --min-lines 10       # Focus on larger functions
+aiready-patterns ./src --min-lines 15       # Only major functions
+```
+*Tradeoff: Faster but may miss small but important duplicates*
+
+**2. Increase shared tokens threshold**
+```bash
+# Default: 8, try increasing to reduce candidate pool
+aiready-patterns ./src --min-shared-tokens 12  # Fewer candidates
+aiready-patterns ./src --min-shared-tokens 15  # Much fewer candidates
+```
+*Tradeoff: Faster but may miss some duplicates*
+
+**3. Reduce max candidates per block**
+```bash
+# Default: 100, try reducing for faster analysis
+aiready-patterns ./src --max-candidates 50   # Faster
+aiready-patterns ./src --max-candidates 20   # Much faster
+```
+*Tradeoff: Faster but may miss some duplicates*
+
+**4. Increase similarity threshold**
+```bash
+# Default: 0.4, try increasing to reduce comparisons
+aiready-patterns ./src --similarity 0.6     # Fewer but more obvious duplicates
+```
+*Tradeoff: Faster but fewer results*
+
+**5. Analyze by module/directory**
+```bash
+# Instead of analyzing the entire repo, analyze specific directories
+aiready-patterns ./src/api --min-lines 8
+aiready-patterns ./src/components --min-lines 8
+```
+*Tradeoff: Need to run multiple commands but each is faster*
+
+### When You Get Too Many False Positives
+
+If the results include many irrelevant duplicates:
+
+**1. Increase similarity threshold**
+```bash
+# Default: 0.4, try increasing for more accurate matches
+aiready-patterns ./src --similarity 0.6     # More accurate
+aiready-patterns ./src --similarity 0.8     # Very accurate
+```
+*Tradeoff: Fewer results but higher quality*
+
+**2. Increase minimum lines**
+```bash
+# Default: 5, try increasing to focus on substantial duplicates
+aiready-patterns ./src --min-lines 10       # Larger patterns only
+```
+*Tradeoff: Fewer results but more significant ones*
+
+**3. Use severity filtering**
+```bash
+aiready-patterns ./src --severity high      # Only >90% similar
+aiready-patterns ./src --severity critical  # Only >95% similar
+```
+*Tradeoff: Fewer results but highest quality*
+
+**4. Exclude specific patterns**
+```bash
+# Exclude generated files, migrations, etc.
+aiready-patterns ./src --exclude "**/migrations/**,**/generated/**"
+```
+*Tradeoff: Fewer results but more relevant ones*
+
+### Quick Troubleshooting Reference
+
+| Problem | Symptom | Solution | Tradeoff |
+|---------|---------|----------|----------|
+| **No results** | "No duplicate patterns detected" | Lower `--similarity` to 0.3 | More noise |
+| **Few results** | <5 duplicates found | Lower `--min-lines` to 3 | Slower analysis |
+| **Too slow** | Takes >30 seconds | Increase `--min-lines` to 10 | Misses small duplicates |
+| **Too many results** | 100+ duplicates | Increase `--similarity` to 0.6 | Misses subtle duplicates |
+| **False positives** | Many irrelevant matches | Use `--severity critical` | Fewer results |
+| **Memory issues** | Out of memory error | Analyze by directory | Multiple commands needed |
+
 **CLI Options:**
 - `--stream-results` - Output duplicates as found (enabled by default)
 - `--no-approx` - Disable approximate mode (slower, O(B²) complexity, use with caution)

package/dist/chunk-262N2JB7.mjs

@@ -0,0 +1,497 @@
+// src/index.ts
+import { readFileContent } from "@aiready/core";
+
+// src/detector.ts
+import { estimateTokens } from "@aiready/core";
+function categorizePattern(code) {
+  const lower = code.toLowerCase();
+  if (lower.includes("request") && lower.includes("response") || lower.includes("router.") || lower.includes("app.get") || lower.includes("app.post") || lower.includes("express") || lower.includes("ctx.body")) {
+    return "api-handler";
+  }
+  if (lower.includes("validate") || lower.includes("schema") || lower.includes("zod") || lower.includes("yup") || lower.includes("if") && lower.includes("throw")) {
+    return "validator";
+  }
+  if (lower.includes("return (") || lower.includes("jsx") || lower.includes("component") || lower.includes("props")) {
+    return "component";
+  }
+  if (lower.includes("class ") || lower.includes("this.")) {
+    return "class-method";
+  }
+  if (lower.includes("return ") && !lower.includes("this") && !lower.includes("new ")) {
+    return "utility";
+  }
+  if (lower.includes("function") || lower.includes("=>")) {
+    return "function";
+  }
+  return "unknown";
+}
+function extractCodeBlocks(content, minLines) {
+  const lines = content.split("\n");
+  const blocks = [];
+  let currentBlock = [];
+  let blockStart = 0;
+  let braceDepth = 0;
+  let inFunction = false;
+  for (let i = 0; i < lines.length; i++) {
+    const line = lines[i];
+    const trimmed = line.trim();
+    if (!inFunction && (trimmed.includes("function ") || trimmed.includes("=>") || trimmed.includes("async ") || /^(export\s+)?(async\s+)?function\s+/.test(trimmed) || /^(export\s+)?const\s+\w+\s*=\s*(async\s*)?\(/.test(trimmed))) {
+      inFunction = true;
+      blockStart = i;
+    }
+    for (const char of line) {
+      if (char === "{") braceDepth++;
+      if (char === "}") braceDepth--;
+    }
+    if (inFunction) {
+      currentBlock.push(line);
+    }
+    if (inFunction && braceDepth === 0 && currentBlock.length >= minLines) {
+      const blockContent = currentBlock.join("\n");
+      const linesOfCode = currentBlock.filter(
+        (l) => l.trim() && !l.trim().startsWith("//")
+      ).length;
+      blocks.push({
+        content: blockContent,
+        startLine: blockStart + 1,
+        endLine: i + 1,
+        patternType: categorizePattern(blockContent),
+        linesOfCode
+      });
+      currentBlock = [];
+      inFunction = false;
+    } else if (inFunction && braceDepth === 0) {
+      currentBlock = [];
+      inFunction = false;
+    }
+  }
+  return blocks;
+}
+function normalizeCode(code) {
+  return code.replace(/\/\/.*$/gm, "").replace(/\/\*[\s\S]*?\*\//g, "").replace(/"[^"]*"/g, '"STR"').replace(/'[^']*'/g, "'STR'").replace(/`[^`]*`/g, "`STR`").replace(/\b\d+\b/g, "NUM").replace(/\s+/g, " ").trim();
+}
+function jaccardSimilarity(tokens1, tokens2) {
+  const set1 = new Set(tokens1);
+  const set2 = new Set(tokens2);
+  let intersection = 0;
+  for (const token of set1) {
+    if (set2.has(token)) intersection++;
+  }
+  const union = set1.size + set2.size - intersection;
+  return union === 0 ? 0 : intersection / union;
+}
+async function detectDuplicatePatterns(files, options) {
+  const {
+    minSimilarity,
+    minLines,
+    batchSize = 100,
+    approx = true,
+    minSharedTokens = 8,
+    maxCandidatesPerBlock = 100,
+    streamResults = false
+  } = options;
+  const duplicates = [];
+  const maxComparisons = approx ? Infinity : 5e5;
+  const allBlocks = files.flatMap(
+    (file) => extractCodeBlocks(file.content, minLines).map((block) => ({
+      content: block.content,
+      startLine: block.startLine,
+      endLine: block.endLine,
+      file: file.file,
+      normalized: normalizeCode(block.content),
+      patternType: block.patternType,
+      tokenCost: estimateTokens(block.content),
+      linesOfCode: block.linesOfCode
+    }))
+  );
+  console.log(`Extracted ${allBlocks.length} code blocks for analysis`);
+  if (!approx && allBlocks.length > 500) {
+    console.log(`\u26A0\uFE0F  Using --no-approx mode with ${allBlocks.length} blocks may be slow (O(B\xB2) complexity).`);
+    console.log(`   Consider using approximate mode (default) for better performance.`);
+  }
+  const stopwords = /* @__PURE__ */ new Set([
+    "return",
+    "const",
+    "let",
+    "var",
+    "function",
+    "class",
+    "new",
+    "if",
+    "else",
+    "for",
+    "while",
+    "async",
+    "await",
+    "try",
+    "catch",
+    "switch",
+    "case",
+    "default",
+    "import",
+    "export",
+    "from",
+    "true",
+    "false",
+    "null",
+    "undefined",
+    "this"
+  ]);
+  const tokenize = (norm) => norm.split(/[\s(){}\[\];,\.]+/).filter((t) => t && t.length >= 3 && !stopwords.has(t.toLowerCase()));
+  const blockTokens = allBlocks.map((b) => tokenize(b.normalized));
+  const invertedIndex = /* @__PURE__ */ new Map();
+  if (approx) {
+    for (let i = 0; i < blockTokens.length; i++) {
+      for (const tok of blockTokens[i]) {
+        let arr = invertedIndex.get(tok);
+        if (!arr) {
+          arr = [];
+          invertedIndex.set(tok, arr);
+        }
+        arr.push(i);
+      }
+    }
+  }
+  const totalComparisons = approx ? void 0 : allBlocks.length * (allBlocks.length - 1) / 2;
+  if (totalComparisons !== void 0) {
+    console.log(`Processing ${totalComparisons.toLocaleString()} comparisons in batches...`);
+  } else {
+    console.log(`Using approximate candidate selection to reduce comparisons...`);
+  }
+  let comparisonsProcessed = 0;
+  let comparisonsBudgetExhausted = false;
+  const startTime = Date.now();
+  for (let i = 0; i < allBlocks.length; i++) {
+    if (maxComparisons && comparisonsProcessed >= maxComparisons) {
+      comparisonsBudgetExhausted = true;
+      break;
+    }
+    if (i % batchSize === 0 && i > 0) {
+      const elapsed = ((Date.now() - startTime) / 1e3).toFixed(1);
+      const duplicatesFound = duplicates.length;
+      if (totalComparisons !== void 0) {
+        const progress = (comparisonsProcessed / totalComparisons * 100).toFixed(1);
+        const remaining = totalComparisons - comparisonsProcessed;
+        const rate = comparisonsProcessed / parseFloat(elapsed);
+        const eta = remaining > 0 ? (remaining / rate).toFixed(0) : 0;
+        console.log(`   ${progress}% (${comparisonsProcessed.toLocaleString()}/${totalComparisons.toLocaleString()} comparisons, ${elapsed}s elapsed, ~${eta}s remaining, ${duplicatesFound} duplicates)`);
+      } else {
+        console.log(`   Processed ${i.toLocaleString()}/${allBlocks.length} blocks (${elapsed}s elapsed, ${duplicatesFound} duplicates)`);
+      }
+      await new Promise((resolve) => setImmediate(resolve));
+    }
+    const block1 = allBlocks[i];
+    let candidates = null;
+    if (approx) {
+      const counts = /* @__PURE__ */ new Map();
+      for (const tok of blockTokens[i]) {
+        const ids = invertedIndex.get(tok);
+        if (!ids) continue;
+        for (const j of ids) {
+          if (j <= i) continue;
+          if (allBlocks[j].file === block1.file) continue;
+          counts.set(j, (counts.get(j) || 0) + 1);
+        }
+      }
+      candidates = Array.from(counts.entries()).filter(([, shared]) => shared >= minSharedTokens).sort((a, b) => b[1] - a[1]).slice(0, maxCandidatesPerBlock).map(([j, shared]) => ({ j, shared }));
+    }
+    if (approx && candidates) {
+      for (const { j } of candidates) {
+        if (!approx && maxComparisons !== Infinity && comparisonsProcessed >= maxComparisons) {
+          console.log(`\u26A0\uFE0F  Comparison safety limit reached (${maxComparisons.toLocaleString()} comparisons in --no-approx mode).`);
+          console.log(`   This prevents excessive runtime on large repos. Consider using approximate mode (default) or --min-lines to reduce blocks.`);
+          break;
+        }
+        comparisonsProcessed++;
+        const block2 = allBlocks[j];
+        const similarity = jaccardSimilarity(blockTokens[i], blockTokens[j]);
+        if (similarity >= minSimilarity) {
+          const duplicate = {
+            file1: block1.file,
+            file2: block2.file,
+            line1: block1.startLine,
+            line2: block2.startLine,
+            endLine1: block1.endLine,
+            endLine2: block2.endLine,
+            similarity,
+            snippet: block1.content.split("\n").slice(0, 5).join("\n") + "\n...",
+            patternType: block1.patternType,
+            tokenCost: block1.tokenCost + block2.tokenCost,
+            linesOfCode: block1.linesOfCode
+          };
+          duplicates.push(duplicate);
+          if (streamResults) {
+            console.log(`
+   \u2705 Found: ${duplicate.patternType} ${Math.round(similarity * 100)}% similar`);
+            console.log(`      ${duplicate.file1}:${duplicate.line1}-${duplicate.endLine1} \u21D4 ${duplicate.file2}:${duplicate.line2}-${duplicate.endLine2}`);
+            console.log(`      Token cost: ${duplicate.tokenCost.toLocaleString()}`);
+          }
+        }
+      }
+    } else {
+      for (let j = i + 1; j < allBlocks.length; j++) {
+        if (maxComparisons && comparisonsProcessed >= maxComparisons) break;
+        comparisonsProcessed++;
+        const block2 = allBlocks[j];
+        if (block1.file === block2.file) continue;
+        const similarity = jaccardSimilarity(blockTokens[i], blockTokens[j]);
+        if (similarity >= minSimilarity) {
+          const duplicate = {
+            file1: block1.file,
+            file2: block2.file,
+            line1: block1.startLine,
+            line2: block2.startLine,
+            endLine1: block1.endLine,
+            endLine2: block2.endLine,
+            similarity,
+            snippet: block1.content.split("\n").slice(0, 5).join("\n") + "\n...",
+            patternType: block1.patternType,
+            tokenCost: block1.tokenCost + block2.tokenCost,
+            linesOfCode: block1.linesOfCode
+          };
+          duplicates.push(duplicate);
+          if (streamResults) {
+            console.log(`
+   \u2705 Found: ${duplicate.patternType} ${Math.round(similarity * 100)}% similar`);
+            console.log(`      ${duplicate.file1}:${duplicate.line1}-${duplicate.endLine1} \u21D4 ${duplicate.file2}:${duplicate.line2}-${duplicate.endLine2}`);
+            console.log(`      Token cost: ${duplicate.tokenCost.toLocaleString()}`);
+          }
+        }
+      }
+    }
+  }
+  if (comparisonsBudgetExhausted) {
+    console.log(`\u26A0\uFE0F  Comparison budget exhausted (${maxComparisons.toLocaleString()} comparisons). Use --max-comparisons to increase.`);
+  }
+  return duplicates.sort(
+    (a, b) => b.similarity - a.similarity || b.tokenCost - a.tokenCost
+  );
+}
+
+// src/index.ts
+function getRefactoringSuggestion(patternType, similarity) {
+  const baseMessages = {
+    "api-handler": "Extract common middleware or create a base handler class",
+    validator: "Consolidate validation logic into shared schema validators (Zod/Yup)",
+    utility: "Move to a shared utilities file and reuse across modules",
+    "class-method": "Consider inheritance or composition to share behavior",
+    component: "Extract shared logic into a custom hook or HOC",
+    function: "Extract into a shared helper function",
+    unknown: "Extract common logic into a reusable module"
+  };
+  const urgency = similarity > 0.95 ? " (CRITICAL: Nearly identical code)" : similarity > 0.9 ? " (HIGH: Very similar, refactor soon)" : "";
+  return baseMessages[patternType] + urgency;
+}
+async function getSmartDefaults(directory, userOptions) {
+  if (userOptions.useSmartDefaults === false) {
+    return {};
+  }
+  const scanOptions = {
+    rootDir: directory,
+    include: userOptions.include || ["**/*.{ts,tsx,js,jsx,py,java}"],
+    exclude: userOptions.exclude || [
+      "**/node_modules/**",
+      "**/dist/**",
+      "**/build/**",
+      "**/coverage/**",
+      "**/.git/**",
+      "**/.turbo/**"
+    ]
+  };
+  const { scanFiles: scanFiles2 } = await import("@aiready/core");
+  const files = await scanFiles2(scanOptions);
+  const estimatedBlocks = files.length * 3;
+  let smartDefaults = {};
+  if (estimatedBlocks < 1e3) {
+    smartDefaults = {
+      minSimilarity: 0.4,
+      minLines: 5,
+      batchSize: 100,
+      approx: true,
+      minSharedTokens: 8,
+      maxCandidatesPerBlock: 100,
+      severity: "all"
+    };
+  } else if (estimatedBlocks < 5e3) {
+    smartDefaults = {
+      minSimilarity: 0.5,
+      minLines: 6,
+      batchSize: 200,
+      // Increased batch size for better performance
+      approx: true,
+      minSharedTokens: 12,
+      // Increased to reduce candidates
+      maxCandidatesPerBlock: 30,
+      // Reduced for faster processing
+      severity: "all"
+    };
+  } else {
+    smartDefaults = {
+      minSimilarity: 0.6,
+      minLines: 8,
+      batchSize: 200,
+      approx: true,
+      minSharedTokens: 12,
+      maxCandidatesPerBlock: 25,
+      severity: "high"
+    };
+  }
+  const result = {};
+  for (const [key, value] of Object.entries(smartDefaults)) {
+    if (!(key in userOptions) || userOptions[key] === void 0) {
+      result[key] = value;
+    }
+  }
+  return result;
+}
+function logConfiguration(config, estimatedBlocks) {
+  console.log("\u{1F4CB} Configuration:");
+  console.log(`   Repository size: ~${estimatedBlocks} code blocks`);
+  console.log(`   Similarity threshold: ${config.minSimilarity}`);
+  console.log(`   Minimum lines: ${config.minLines}`);
+  console.log(`   Approximate mode: ${config.approx ? "enabled" : "disabled"}`);
+  console.log(`   Max candidates per block: ${config.maxCandidatesPerBlock}`);
+  console.log(`   Min shared tokens: ${config.minSharedTokens}`);
+  console.log(`   Severity filter: ${config.severity}`);
+  console.log(`   Include tests: ${config.includeTests}`);
+  console.log("");
+}
+async function analyzePatterns(options) {
+  const smartDefaults = await getSmartDefaults(options.rootDir || ".", options);
+  const finalOptions = { ...smartDefaults, ...options };
+  const {
+    minSimilarity = 0.4,
+    minLines = 5,
+    batchSize = 100,
+    approx = true,
+    minSharedTokens = 8,
+    maxCandidatesPerBlock = 100,
+    streamResults = false,
+    severity = "all",
+    includeTests = false,
+    ...scanOptions
+  } = finalOptions;
+  const { scanFiles: scanFiles2 } = await import("@aiready/core");
+  const files = await scanFiles2(scanOptions);
+  const estimatedBlocks = files.length * 3;
+  logConfiguration(finalOptions, estimatedBlocks);
+  const results = [];
+  const fileContents = await Promise.all(
+    files.map(async (file) => ({
+      file,
+      content: await readFileContent(file)
+    }))
+  );
+  const duplicates = await detectDuplicatePatterns(fileContents, {
+    minSimilarity,
+    minLines,
+    batchSize,
+    approx,
+    minSharedTokens,
+    maxCandidatesPerBlock,
+    streamResults
+  });
+  for (const file of files) {
+    const fileDuplicates = duplicates.filter(
+      (dup) => dup.file1 === file || dup.file2 === file
+    );
+    const issues = fileDuplicates.map((dup) => {
+      const otherFile = dup.file1 === file ? dup.file2 : dup.file1;
+      const severity2 = dup.similarity > 0.95 ? "critical" : dup.similarity > 0.9 ? "major" : "minor";
+      return {
+        type: "duplicate-pattern",
+        severity: severity2,
+        message: `${dup.patternType} pattern ${Math.round(dup.similarity * 100)}% similar to ${otherFile} (${dup.tokenCost} tokens wasted)`,
+        location: {
+          file,
+          line: dup.file1 === file ? dup.line1 : dup.line2
+        },
+        suggestion: getRefactoringSuggestion(dup.patternType, dup.similarity)
+      };
+    });
+    let filteredIssues = issues;
+    if (severity !== "all") {
+      const severityMap = {
+        critical: ["critical"],
+        high: ["critical", "major"],
+        medium: ["critical", "major", "minor"]
+      };
+      const allowedSeverities = severityMap[severity] || ["critical", "major", "minor"];
+      filteredIssues = issues.filter((issue) => allowedSeverities.includes(issue.severity));
+    }
+    const totalTokenCost = fileDuplicates.reduce(
+      (sum, dup) => sum + dup.tokenCost,
+      0
+    );
+    results.push({
+      fileName: file,
+      issues: filteredIssues,
+      metrics: {
+        tokenCost: totalTokenCost,
+        consistencyScore: Math.max(0, 1 - fileDuplicates.length * 0.1)
+      }
+    });
+  }
+  return { results, duplicates, files };
+}
+function generateSummary(results) {
+  const allIssues = results.flatMap((r) => r.issues);
+  const totalTokenCost = results.reduce(
+    (sum, r) => sum + (r.metrics.tokenCost || 0),
+    0
+  );
+  const patternsByType = {
+    "api-handler": 0,
+    validator: 0,
+    utility: 0,
+    "class-method": 0,
+    component: 0,
+    function: 0,
+    unknown: 0
+  };
+  allIssues.forEach((issue) => {
+    const match = issue.message.match(/^(\S+(?:-\S+)*) pattern/);
+    if (match) {
+      const type = match[1];
+      patternsByType[type] = (patternsByType[type] || 0) + 1;
+    }
+  });
+  const topDuplicates = allIssues.slice(0, 10).map((issue) => {
+    const similarityMatch = issue.message.match(/(\d+)% similar/);
+    const tokenMatch = issue.message.match(/\((\d+) tokens/);
+    const typeMatch = issue.message.match(/^(\S+(?:-\S+)*) pattern/);
+    const fileMatch = issue.message.match(/similar to (.+?) \(/);
+    return {
+      files: [
+        {
+          path: issue.location.file,
+          startLine: issue.location.line,
+          endLine: 0
+          // Not available from Issue
+        },
+        {
+          path: fileMatch?.[1] || "unknown",
+          startLine: 0,
+          // Not available from Issue
+          endLine: 0
+          // Not available from Issue
+        }
+      ],
+      similarity: similarityMatch ? parseInt(similarityMatch[1]) / 100 : 0,
+      patternType: typeMatch?.[1] || "unknown",
+      tokenCost: tokenMatch ? parseInt(tokenMatch[1]) : 0
+    };
+  });
+  return {
+    totalPatterns: allIssues.length,
+    totalTokenCost,
+    patternsByType,
+    topDuplicates
+  };
+}
+
+export {
+  detectDuplicatePatterns,
+  analyzePatterns,
+  generateSummary
+};