mcp-researchpowerpack-http 3.10.0

package/dist/src/utils/url-aggregator.js

@@ -0,0 +1,357 @@
+import { CTR_WEIGHTS } from "../config/index.js";
+const WEB_CONSENSUS_THRESHOLD = 3;
+const REDDIT_CONSENSUS_THRESHOLD = 2;
+const MIN_BEYOND_TOP10_WEIGHT = 0;
+const BEYOND_TOP10_DECAY = 0.5;
+const BEYOND_TOP10_BASE = 10;
+const DEFAULT_MIN_CONSENSUS_URLS = 5;
+const DEFAULT_REDDIT_MIN_CONSENSUS_URLS = 3;
+const HIGH_CONSENSUS_THRESHOLD = 4;
+function getCtrWeight(position) {
+  if (position >= 1 && position <= 10) {
+    return CTR_WEIGHTS[position] ?? 0;
+  }
+  return Math.max(MIN_BEYOND_TOP10_WEIGHT, BEYOND_TOP10_BASE - (position - BEYOND_TOP10_BASE) * BEYOND_TOP10_DECAY);
+}
+function aggregateResults(searches) {
+  const urlMap = /* @__PURE__ */ new Map();
+  for (const search of searches) {
+    for (const result of search.results) {
+      const normalizedUrl = normalizeUrl(result.link);
+      const existing = urlMap.get(normalizedUrl);
+      if (existing) {
+        existing.frequency += 1;
+        existing.positions.push(result.position);
+        existing.queries.push(search.keyword);
+        const prevBest = existing.bestPosition;
+        existing.bestPosition = Math.min(existing.bestPosition, result.position);
+        existing.totalScore += getCtrWeight(result.position);
+        if (result.position < prevBest) {
+          existing.title = result.title;
+          existing.snippet = result.snippet;
+        }
+      } else {
+        urlMap.set(normalizedUrl, {
+          url: result.link,
+          title: result.title,
+          snippet: result.snippet,
+          frequency: 1,
+          positions: [result.position],
+          queries: [search.keyword],
+          bestPosition: result.position,
+          totalScore: getCtrWeight(result.position)
+        });
+      }
+    }
+  }
+  return urlMap;
+}
+function normalizeUrl(url) {
+  try {
+    const parsed = new URL(url);
+    let host = parsed.hostname.replace(/^www\./, "");
+    let path = parsed.pathname.replace(/\/$/, "") || "/";
+    return `${host}${path}${parsed.search}`.toLowerCase();
+  } catch {
+    return url.toLowerCase().replace(/\/$/, "");
+  }
+}
+function countByFrequency(urlMap, minFrequency) {
+  let count = 0;
+  for (const url of urlMap.values()) {
+    if (url.frequency >= minFrequency) count++;
+  }
+  return count;
+}
+function calculateWeightedScores(urls, consensusThreshold) {
+  if (urls.length === 0) return [];
+  const sorted = [...urls].sort((a, b) => b.totalScore - a.totalScore);
+  const maxScore = sorted[0].totalScore;
+  return sorted.map((url, index) => ({
+    url: url.url,
+    title: url.title,
+    snippet: url.snippet,
+    rank: index + 1,
+    score: maxScore > 0 ? url.totalScore / maxScore * 100 : 0,
+    frequency: url.frequency,
+    positions: url.positions,
+    queries: url.queries,
+    bestPosition: url.bestPosition,
+    isConsensus: url.frequency >= consensusThreshold
+  }));
+}
+function markConsensus(frequency) {
+  return frequency >= WEB_CONSENSUS_THRESHOLD ? "\u2713" : "\u2717";
+}
+function generateJustification(url, rank) {
+  const parts = [];
+  if (url.frequency >= HIGH_CONSENSUS_THRESHOLD) {
+    parts.push(`Appeared in ${url.frequency} different searches showing strong cross-query relevance`);
+  } else if (url.frequency >= WEB_CONSENSUS_THRESHOLD) {
+    parts.push(`Found across ${url.frequency} searches indicating solid topical coverage`);
+  } else {
+    parts.push(`Appeared in ${url.frequency} search${url.frequency > 1 ? "es" : ""}`);
+  }
+  if (url.bestPosition === 1) {
+    parts.push("ranked #1 in at least one search");
+  } else if (url.bestPosition <= 3) {
+    parts.push(`best position was top-3 (#${url.bestPosition})`);
+  }
+  return parts.join(", ") + ".";
+}
+function generateEnhancedOutput(rankedUrls, allKeywords, totalUniqueUrls, frequencyThreshold, thresholdNote) {
+  const lines = [];
+  const consensusCount = rankedUrls.filter((u) => u.isConsensus).length;
+  lines.push(`## Aggregated Search Results (${allKeywords.length} Queries \u2192 ${rankedUrls.length} Unique URLs)`);
+  lines.push("");
+  lines.push(`Based on ${allKeywords.length} distinct searches, we found **${rankedUrls.length} unique resources** (${consensusCount} appear in multiple queries).`);
+  lines.push("");
+  if (thresholdNote) {
+    lines.push(`> ${thresholdNote}`);
+    lines.push("");
+  }
+  lines.push("### \u{1F947} Ranked Resources");
+  lines.push("");
+  for (const url of rankedUrls) {
+    const highConsensus = url.frequency >= HIGH_CONSENSUS_THRESHOLD ? " \u2B50 HIGHEST CONSENSUS" : url.isConsensus ? " \u2713 CONSENSUS" : "";
+    lines.push(`#### #${url.rank}: ${url.title} (Score: ${url.score.toFixed(1)})${highConsensus}`);
+    const queriesList = url.queries.map((q) => `"${q}"`).join(", ");
+    lines.push(`- **Appeared in:** ${url.frequency} queries (${queriesList})`);
+    lines.push(`- **Best ranking:** Position ${url.bestPosition}`);
+    lines.push(`- **Description:** ${url.snippet}`);
+    lines.push(`- **Why it's #${url.rank}:** ${generateJustification(url, url.rank)}`);
+    lines.push(`- **URL:** ${url.url}`);
+    lines.push("");
+  }
+  lines.push("---");
+  lines.push("");
+  lines.push("### \u{1F4C8} Metadata");
+  lines.push("");
+  lines.push(`- **Total Queries:** ${allKeywords.length} (${allKeywords.join(", ")})`);
+  const sortedByFreq = [...rankedUrls].sort((a, b) => b.frequency - a.frequency);
+  const urlFreqList = sortedByFreq.map((u) => `${u.url} (${u.frequency}x)`).join(", ");
+  lines.push(`- **Unique URLs Found:** ${totalUniqueUrls} \u2014 top by frequency: ${urlFreqList}`);
+  lines.push(`- **Consensus Threshold:** \u2265${frequencyThreshold} appearances`);
+  lines.push("");
+  return lines.join("\n");
+}
+function aggregateAndRank(searches, minConsensusUrls = DEFAULT_MIN_CONSENSUS_URLS) {
+  const urlMap = aggregateResults(searches);
+  const totalUniqueUrls = urlMap.size;
+  const totalQueries = searches.length;
+  const thresholds = [3, 2, 1];
+  let usedThreshold = 1;
+  let thresholdNote;
+  for (const threshold of thresholds) {
+    const count = countByFrequency(urlMap, threshold);
+    if (count >= minConsensusUrls || threshold === 1) {
+      usedThreshold = threshold;
+      if (threshold < 3) {
+        thresholdNote = `Note: Consensus threshold set to \u2265${threshold} due to result diversity.`;
+      }
+      break;
+    }
+  }
+  const allUrls = [...urlMap.values()];
+  const rankedUrls = calculateWeightedScores(allUrls, usedThreshold);
+  return {
+    rankedUrls,
+    totalUniqueUrls,
+    totalQueries,
+    frequencyThreshold: usedThreshold,
+    thresholdNote
+  };
+}
+function buildUrlLookup(rankedUrls) {
+  const lookup = /* @__PURE__ */ new Map();
+  for (const url of rankedUrls) {
+    const normalized = normalizeUrl(url.url);
+    lookup.set(normalized, url);
+    lookup.set(url.url.toLowerCase(), url);
+  }
+  return lookup;
+}
+function lookupUrl(url, lookup) {
+  const normalized = normalizeUrl(url);
+  return lookup.get(normalized) || lookup.get(url.toLowerCase());
+}
+function aggregateRedditResults(searches) {
+  const urlMap = /* @__PURE__ */ new Map();
+  for (const [query, results] of searches) {
+    for (let i = 0; i < results.length; i++) {
+      const result = results[i];
+      if (!result) continue;
+      const position = i + 1;
+      const normalizedUrl = normalizeUrl(result.url);
+      const existing = urlMap.get(normalizedUrl);
+      if (existing) {
+        existing.frequency += 1;
+        existing.positions.push(position);
+        existing.queries.push(query);
+        const prevBest = existing.bestPosition;
+        existing.bestPosition = Math.min(existing.bestPosition, position);
+        existing.totalScore += getCtrWeight(position);
+        if (position < prevBest) {
+          existing.title = result.title;
+          existing.snippet = result.snippet;
+          existing.date = result.date;
+        }
+      } else {
+        urlMap.set(normalizedUrl, {
+          url: result.url,
+          title: result.title,
+          snippet: result.snippet,
+          date: result.date,
+          frequency: 1,
+          positions: [position],
+          queries: [query],
+          bestPosition: position,
+          totalScore: getCtrWeight(position)
+        });
+      }
+    }
+  }
+  return urlMap;
+}
+function countRedditByFrequency(urlMap, minFrequency) {
+  let count = 0;
+  for (const url of urlMap.values()) {
+    if (url.frequency >= minFrequency) count++;
+  }
+  return count;
+}
+function calculateRedditWeightedScores(urls, consensusThreshold) {
+  if (urls.length === 0) return [];
+  const sorted = [...urls].sort((a, b) => b.totalScore - a.totalScore);
+  const maxScore = sorted[0].totalScore;
+  return sorted.map((url, index) => ({
+    url: url.url,
+    title: url.title,
+    snippet: url.snippet,
+    date: url.date,
+    rank: index + 1,
+    score: maxScore > 0 ? url.totalScore / maxScore * 100 : 0,
+    frequency: url.frequency,
+    positions: url.positions,
+    queries: url.queries,
+    bestPosition: url.bestPosition,
+    isConsensus: url.frequency >= consensusThreshold
+  }));
+}
+function aggregateAndRankReddit(searches, minConsensusUrls = DEFAULT_REDDIT_MIN_CONSENSUS_URLS) {
+  const urlMap = aggregateRedditResults(searches);
+  const totalUniqueUrls = urlMap.size;
+  const totalQueries = searches.size;
+  const thresholds = [2, 1];
+  let usedThreshold = 1;
+  let thresholdNote;
+  for (const threshold of thresholds) {
+    const count = countRedditByFrequency(urlMap, threshold);
+    if (count >= minConsensusUrls || threshold === 1) {
+      usedThreshold = threshold;
+      if (threshold < 2 && totalQueries > 1) {
+        thresholdNote = `Note: Consensus threshold set to \u2265${threshold} due to result diversity across queries.`;
+      }
+      break;
+    }
+  }
+  const allUrls = [...urlMap.values()];
+  const rankedUrls = calculateRedditWeightedScores(allUrls, usedThreshold);
+  return {
+    rankedUrls,
+    totalUniqueUrls,
+    totalQueries,
+    frequencyThreshold: usedThreshold,
+    thresholdNote
+  };
+}
+function generateRedditEnhancedOutput(aggregation, allQueries, rawResults) {
+  const { rankedUrls, totalUniqueUrls, frequencyThreshold, thresholdNote } = aggregation;
+  const lines = [];
+  lines.push(`# \u{1F50D} Reddit Search Results (Aggregated from ${allQueries.length} Queries)`);
+  lines.push("");
+  lines.push(`**Total Unique Posts:** ${totalUniqueUrls} | **Consensus Threshold:** \u2265${frequencyThreshold} appearances`);
+  lines.push("");
+  if (thresholdNote) {
+    lines.push(`> ${thresholdNote}`);
+    lines.push("");
+  }
+  const consensusUrls = rankedUrls.filter((u) => u.frequency >= frequencyThreshold && u.frequency > 1);
+  if (consensusUrls.length > 0) {
+    lines.push("## \u2B50 High-Consensus Posts (Multiple Queries)");
+    lines.push("");
+    lines.push("*These posts appeared across multiple search queries, indicating high relevance:*");
+    lines.push("");
+    for (const url of consensusUrls) {
+      const dateStr = url.date ? ` \u2022 \u{1F4C5} ${url.date}` : "";
+      const queriesList = url.queries.map((q) => `"${q}"`).join(", ");
+      lines.push(`### #${url.rank}: ${url.title}`);
+      lines.push(`**Score:** ${url.score.toFixed(1)} | **Found in:** ${url.frequency} queries (${queriesList})${dateStr}`);
+      lines.push(`${url.url}`);
+      lines.push(`> ${url.snippet}`);
+      lines.push("");
+    }
+    lines.push("---");
+    lines.push("");
+  }
+  lines.push("## \u{1F4CA} All Results (CTR-Ranked)");
+  lines.push("");
+  for (const url of rankedUrls) {
+    const dateStr = url.date ? ` \u2022 \u{1F4C5} ${url.date}` : "";
+    const consensusMarker = url.frequency > 1 ? " \u2B50" : "";
+    lines.push(`**${url.rank}. ${url.title}**${consensusMarker}${dateStr}`);
+    lines.push(`${url.url}`);
+    lines.push(`> ${url.snippet}`);
+    if (url.frequency > 1) {
+      lines.push(`_Found in ${url.frequency} queries: ${url.queries.map((q) => `"${q}"`).join(", ")}_`);
+    }
+    lines.push("");
+  }
+  if (rawResults && rawResults.size > 0) {
+    lines.push("---");
+    lines.push("");
+    lines.push("## \u{1F4CB} Per-Query Raw Results");
+    lines.push("");
+    lines.push("*Complete results for each individual query before aggregation:*");
+    lines.push("");
+    for (const [query, results] of rawResults) {
+      lines.push(`### \u{1F50E} Query: "${query}"`);
+      lines.push(`**Results:** ${results.length} posts`);
+      lines.push("");
+      if (results.length === 0) {
+        lines.push("_No results found for this query._");
+        lines.push("");
+        continue;
+      }
+      for (let i = 0; i < results.length; i++) {
+        const result = results[i];
+        if (!result) continue;
+        const position = i + 1;
+        const dateStr = result.date ? ` \u2022 \u{1F4C5} ${result.date}` : "";
+        lines.push(`${position}. **${result.title}**${dateStr}`);
+        lines.push(`   ${result.url}`);
+        lines.push(`   > ${result.snippet}`);
+        lines.push("");
+      }
+    }
+  }
+  lines.push("---");
+  lines.push("");
+  lines.push("### \u{1F4C8} Search Metadata");
+  lines.push("");
+  lines.push(`- **Queries:** ${allQueries.map((q) => `"${q}"`).join(", ")}`);
+  lines.push(`- **Unique Posts Found:** ${totalUniqueUrls}`);
+  lines.push(`- **High-Consensus Posts:** ${consensusUrls.length}`);
+  lines.push("");
+  return lines.join("\n");
+}
+export {
+  aggregateAndRank,
+  aggregateAndRankReddit,
+  buildUrlLookup,
+  generateEnhancedOutput,
+  generateRedditEnhancedOutput,
+  lookupUrl,
+  markConsensus
+};
+//# sourceMappingURL=url-aggregator.js.map

package/dist/src/utils/url-aggregator.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/utils/url-aggregator.ts"],
+  "sourcesContent": ["/**\n * URL Aggregator Utility\n * Aggregates search results across multiple queries, calculates CTR-weighted scores,\n * and generates consensus-based rankings.\n */\n\nimport { CTR_WEIGHTS } from '../config/index.js';\nimport type { KeywordSearchResult, RedditSearchResult } from '../clients/search.js';\n\n/** Minimum frequency for web search consensus marking */\nconst WEB_CONSENSUS_THRESHOLD = 3 as const;\n\n/** Minimum frequency for Reddit consensus marking (lower due to fewer overlapping results) */\nconst REDDIT_CONSENSUS_THRESHOLD = 2 as const;\n\n/** Minimum weight assigned to positions beyond top 10 */\nconst MIN_BEYOND_TOP10_WEIGHT = 0 as const;\n\n/** Weight decay per position beyond top 10 */\nconst BEYOND_TOP10_DECAY = 0.5 as const;\n\n/** Base position for beyond-top-10 weight calculation */\nconst BEYOND_TOP10_BASE = 10 as const;\n\n/** Default minimum consensus URLs before lowering threshold (web search) */\nconst DEFAULT_MIN_CONSENSUS_URLS = 5 as const;\n\n/** Default minimum consensus URLs before lowering threshold (Reddit) */\nconst DEFAULT_REDDIT_MIN_CONSENSUS_URLS = 3 as const;\n\n/** High consensus frequency threshold for enhanced output labeling */\nconst HIGH_CONSENSUS_THRESHOLD = 4 as const;\n\n/**\n * Aggregated URL data structure\n */\ninterface AggregatedUrl {\n  readonly url: string;\n  title: string;\n  snippet: string;\n  frequency: number;\n  readonly positions: number[];\n  readonly queries: string[];\n  bestPosition: number;\n  totalScore: number;\n}\n\n/**\n * Ranked URL with normalized score\n */\ninterface RankedUrl {\n  readonly url: string;\n  readonly title: string;\n  readonly snippet: string;\n  readonly rank: number;\n  readonly score: number;\n  readonly frequency: number;\n  readonly positions: number[];\n  readonly queries: string[];\n  readonly bestPosition: number;\n  readonly isConsensus: boolean;\n}\n\n/**\n * Aggregation result containing all processed data\n */\ninterface AggregationResult {\n  readonly rankedUrls: RankedUrl[];\n  readonly totalUniqueUrls: number;\n  readonly totalQueries: number;\n  readonly frequencyThreshold: number;\n  readonly thresholdNote?: string;\n}\n\n/**\n * Get CTR weight for a position (1-10)\n * Positions beyond 10 get minimal weight\n */\nfunction getCtrWeight(position: number): number {\n  if (position >= 1 && position <= 10) {\n    return CTR_WEIGHTS[position] ?? 0;\n  }\n  // Positions beyond 10 get diminishing returns\n  return Math.max(MIN_BEYOND_TOP10_WEIGHT, BEYOND_TOP10_BASE - (position - BEYOND_TOP10_BASE) * BEYOND_TOP10_DECAY);\n}\n\n/**\n * Aggregate results from multiple searches\n * Flattens all results, deduplicates by URL, and tracks frequency/positions\n */\nfunction aggregateResults(searches: KeywordSearchResult[]): Map<string, AggregatedUrl> {\n  const urlMap = new Map<string, AggregatedUrl>();\n\n  for (const search of searches) {\n    for (const result of search.results) {\n      const normalizedUrl = normalizeUrl(result.link);\n      const existing = urlMap.get(normalizedUrl);\n\n      if (existing) {\n        existing.frequency += 1;\n        existing.positions.push(result.position);\n        existing.queries.push(search.keyword);\n        const prevBest = existing.bestPosition;\n        existing.bestPosition = Math.min(existing.bestPosition, result.position);\n        existing.totalScore += getCtrWeight(result.position);\n        // Keep best title/snippet (from highest ranking position)\n        if (result.position < prevBest) {\n          existing.title = result.title;\n          existing.snippet = result.snippet;\n        }\n      } else {\n        urlMap.set(normalizedUrl, {\n          url: result.link,\n          title: result.title,\n          snippet: result.snippet,\n          frequency: 1,\n          positions: [result.position],\n          queries: [search.keyword],\n          bestPosition: result.position,\n          totalScore: getCtrWeight(result.position),\n        });\n      }\n    }\n  }\n\n  return urlMap;\n}\n\n/**\n * Normalize URL for deduplication\n * Removes trailing slashes, www prefix, and normalizes protocol\n */\nfunction normalizeUrl(url: string): string {\n  try {\n    const parsed = new URL(url);\n    let host = parsed.hostname.replace(/^www\\./, '');\n    let path = parsed.pathname.replace(/\\/$/, '') || '/';\n    return `${host}${path}${parsed.search}`.toLowerCase();\n  } catch {\n    return url.toLowerCase().replace(/\\/$/, '');\n  }\n}\n\n/**\n * Count URLs meeting a frequency threshold\n */\nfunction countByFrequency(\n  urlMap: Map<string, AggregatedUrl>,\n  minFrequency: number\n): number {\n  let count = 0;\n  for (const url of urlMap.values()) {\n    if (url.frequency >= minFrequency) count++;\n  }\n  return count;\n}\n\n/**\n * Calculate weighted scores and normalize to 100.0\n * Returns ALL URLs sorted by score with rank assignments and consensus marking\n */\nfunction calculateWeightedScores(urls: AggregatedUrl[], consensusThreshold: number): RankedUrl[] {\n  if (urls.length === 0) return [];\n\n  // Sort by total score descending\n  const sorted = [...urls].sort((a, b) => b.totalScore - a.totalScore);\n\n  // Find max score for normalization\n  const maxScore = sorted[0]!.totalScore;\n\n  // Map to ranked URLs with normalized scores\n  return sorted.map((url, index) => ({\n    url: url.url,\n    title: url.title,\n    snippet: url.snippet,\n    rank: index + 1,\n    score: maxScore > 0 ? (url.totalScore / maxScore) * 100 : 0,\n    frequency: url.frequency,\n    positions: url.positions,\n    queries: url.queries,\n    bestPosition: url.bestPosition,\n    isConsensus: url.frequency >= consensusThreshold,\n  }));\n}\n\n/**\n * Mark consensus status for a URL\n * Returns \"\u2713\" if frequency >= threshold, else \"\u2717\"\n */\nexport function markConsensus(frequency: number): string {\n  return frequency >= WEB_CONSENSUS_THRESHOLD ? '\u2713' : '\u2717';\n}\n\n/**\n * Generate justification for why a URL is ranked at its position\n */\nfunction generateJustification(url: RankedUrl, rank: number): string {\n  const parts: string[] = [];\n  \n  if (url.frequency >= HIGH_CONSENSUS_THRESHOLD) {\n    parts.push(`Appeared in ${url.frequency} different searches showing strong cross-query relevance`);\n  } else if (url.frequency >= WEB_CONSENSUS_THRESHOLD) {\n    parts.push(`Found across ${url.frequency} searches indicating solid topical coverage`);\n  } else {\n    parts.push(`Appeared in ${url.frequency} search${url.frequency > 1 ? 'es' : ''}`);\n  }\n  \n  if (url.bestPosition === 1) {\n    parts.push('ranked #1 in at least one search');\n  } else if (url.bestPosition <= 3) {\n    parts.push(`best position was top-3 (#${url.bestPosition})`);\n  }\n  \n  return parts.join(', ') + '.';\n}\n\n/**\n * Generate enhanced narrative output for consensus URLs\n */\nexport function generateEnhancedOutput(\n  rankedUrls: RankedUrl[],\n  allKeywords: string[],\n  totalUniqueUrls: number,\n  frequencyThreshold: number,\n  thresholdNote?: string\n): string {\n  const lines: string[] = [];\n  \n  // Header\n  const consensusCount = rankedUrls.filter(u => u.isConsensus).length;\n  lines.push(`## Aggregated Search Results (${allKeywords.length} Queries \u2192 ${rankedUrls.length} Unique URLs)`);\n  lines.push('');\n  lines.push(`Based on ${allKeywords.length} distinct searches, we found **${rankedUrls.length} unique resources** (${consensusCount} appear in multiple queries).`);\n  lines.push('');\n\n  if (thresholdNote) {\n    lines.push(`> ${thresholdNote}`);\n    lines.push('');\n  }\n\n  // All ranked resources\n  lines.push('### \uD83E\uDD47 Ranked Resources');\n  lines.push('');\n\n  for (const url of rankedUrls) {\n    const highConsensus = url.frequency >= HIGH_CONSENSUS_THRESHOLD ? ' \u2B50 HIGHEST CONSENSUS' : url.isConsensus ? ' \u2713 CONSENSUS' : '';\n    lines.push(`#### #${url.rank}: ${url.title} (Score: ${url.score.toFixed(1)})${highConsensus}`);\n    \n    // Appeared in queries\n    const queriesList = url.queries.map(q => `\"${q}\"`).join(', ');\n    lines.push(`- **Appeared in:** ${url.frequency} queries (${queriesList})`);\n    \n    // Best ranking\n    lines.push(`- **Best ranking:** Position ${url.bestPosition}`);\n    \n    // Description\n    lines.push(`- **Description:** ${url.snippet}`);\n    \n    // Justification\n    lines.push(`- **Why it's #${url.rank}:** ${generateJustification(url, url.rank)}`);\n    \n    // URL\n    lines.push(`- **URL:** ${url.url}`);\n    lines.push('');\n  }\n  \n  // Metadata section\n  lines.push('---');\n  lines.push('');\n  lines.push('### \uD83D\uDCC8 Metadata');\n  lines.push('');\n  lines.push(`- **Total Queries:** ${allKeywords.length} (${allKeywords.join(', ')})`);\n  \n  // Sort all URLs by frequency for the unique URLs list\n  const sortedByFreq = [...rankedUrls].sort((a, b) => b.frequency - a.frequency);\n  const urlFreqList = sortedByFreq\n    .map(u => `${u.url} (${u.frequency}x)`)\n    .join(', ');\n  \n  lines.push(`- **Unique URLs Found:** ${totalUniqueUrls} \u2014 top by frequency: ${urlFreqList}`);\n  lines.push(`- **Consensus Threshold:** \u2265${frequencyThreshold} appearances`);\n  lines.push('');\n\n  return lines.join('\\n');\n}\n\n/**\n * Full aggregation pipeline \u2014 returns ALL URLs ranked by CTR score.\n * Determines a consensus threshold (\u22653, \u22652, or \u22651) for labeling, but never\n * drops URLs below the threshold. Every collected URL appears in the output.\n */\nexport function aggregateAndRank(\n  searches: KeywordSearchResult[],\n  minConsensusUrls: number = DEFAULT_MIN_CONSENSUS_URLS\n): AggregationResult {\n  const urlMap = aggregateResults(searches);\n  const totalUniqueUrls = urlMap.size;\n  const totalQueries = searches.length;\n\n  // Determine consensus threshold for labeling (not filtering)\n  const thresholds = [3, 2, 1];\n  let usedThreshold = 1;\n  let thresholdNote: string | undefined;\n\n  for (const threshold of thresholds) {\n    const count = countByFrequency(urlMap, threshold);\n    if (count >= minConsensusUrls || threshold === 1) {\n      usedThreshold = threshold;\n      if (threshold < 3) {\n        thresholdNote = `Note: Consensus threshold set to \u2265${threshold} due to result diversity.`;\n      }\n      break;\n    }\n  }\n\n  // Rank ALL URLs, marking consensus based on determined threshold\n  const allUrls = [...urlMap.values()];\n  const rankedUrls = calculateWeightedScores(allUrls, usedThreshold);\n\n  return {\n    rankedUrls,\n    totalUniqueUrls,\n    totalQueries,\n    frequencyThreshold: usedThreshold,\n    thresholdNote,\n  };\n}\n\n/**\n * Build URL lookup map for quick consensus checking during result formatting\n */\nexport function buildUrlLookup(rankedUrls: RankedUrl[]): Map<string, RankedUrl> {\n  const lookup = new Map<string, RankedUrl>();\n  \n  for (const url of rankedUrls) {\n    const normalized = normalizeUrl(url.url);\n    lookup.set(normalized, url);\n    // Also store original URL\n    lookup.set(url.url.toLowerCase(), url);\n  }\n\n  return lookup;\n}\n\n/**\n * Look up a URL in the ranked results\n */\nexport function lookupUrl(url: string, lookup: Map<string, RankedUrl>): RankedUrl | undefined {\n  const normalized = normalizeUrl(url);\n  return lookup.get(normalized) || lookup.get(url.toLowerCase());\n}\n\n// ============================================================================\n// Reddit-Specific Aggregation\n// ============================================================================\n\n/**\n * Aggregated Reddit URL data structure\n */\ninterface AggregatedRedditUrl {\n  readonly url: string;\n  title: string;\n  snippet: string;\n  date?: string;\n  frequency: number;\n  readonly positions: number[];\n  readonly queries: string[];\n  bestPosition: number;\n  totalScore: number;\n}\n\n/**\n * Ranked Reddit URL with normalized score\n */\ninterface RankedRedditUrl {\n  readonly url: string;\n  readonly title: string;\n  readonly snippet: string;\n  readonly date?: string;\n  readonly rank: number;\n  readonly score: number;\n  readonly frequency: number;\n  readonly positions: number[];\n  readonly queries: string[];\n  readonly bestPosition: number;\n  readonly isConsensus: boolean;\n}\n\n/**\n * Reddit aggregation result\n */\ninterface RedditAggregationResult {\n  readonly rankedUrls: RankedRedditUrl[];\n  readonly totalUniqueUrls: number;\n  readonly totalQueries: number;\n  readonly frequencyThreshold: number;\n  readonly thresholdNote?: string;\n}\n\n/**\n * Aggregate Reddit search results from multiple queries\n */\nfunction aggregateRedditResults(\n  searches: Map<string, RedditSearchResult[]>\n): Map<string, AggregatedRedditUrl> {\n  const urlMap = new Map<string, AggregatedRedditUrl>();\n\n  for (const [query, results] of searches) {\n    for (let i = 0; i < results.length; i++) {\n      const result = results[i];\n      if (!result) continue;\n      const position = i + 1;\n      const normalizedUrl = normalizeUrl(result.url);\n      const existing = urlMap.get(normalizedUrl);\n\n      if (existing) {\n        existing.frequency += 1;\n        existing.positions.push(position);\n        existing.queries.push(query);\n        const prevBest = existing.bestPosition;\n        existing.bestPosition = Math.min(existing.bestPosition, position);\n        existing.totalScore += getCtrWeight(position);\n        // Keep best title/snippet (from highest ranking position)\n        if (position < prevBest) {\n          existing.title = result.title;\n          existing.snippet = result.snippet;\n          existing.date = result.date;\n        }\n      } else {\n        urlMap.set(normalizedUrl, {\n          url: result.url,\n          title: result.title,\n          snippet: result.snippet,\n          date: result.date,\n          frequency: 1,\n          positions: [position],\n          queries: [query],\n          bestPosition: position,\n          totalScore: getCtrWeight(position),\n        });\n      }\n    }\n  }\n\n  return urlMap;\n}\n\n/**\n * Count Reddit URLs meeting a frequency threshold\n */\nfunction countRedditByFrequency(\n  urlMap: Map<string, AggregatedRedditUrl>,\n  minFrequency: number\n): number {\n  let count = 0;\n  for (const url of urlMap.values()) {\n    if (url.frequency >= minFrequency) count++;\n  }\n  return count;\n}\n\n/**\n * Calculate weighted scores for Reddit URLs\n * Returns ALL URLs sorted by score with consensus marking\n */\nfunction calculateRedditWeightedScores(urls: AggregatedRedditUrl[], consensusThreshold: number): RankedRedditUrl[] {\n  if (urls.length === 0) return [];\n\n  // Sort by total score descending\n  const sorted = [...urls].sort((a, b) => b.totalScore - a.totalScore);\n\n  // Find max score for normalization\n  const maxScore = sorted[0]!.totalScore;\n\n  // Map to ranked URLs with normalized scores\n  return sorted.map((url, index) => ({\n    url: url.url,\n    title: url.title,\n    snippet: url.snippet,\n    date: url.date,\n    rank: index + 1,\n    score: maxScore > 0 ? (url.totalScore / maxScore) * 100 : 0,\n    frequency: url.frequency,\n    positions: url.positions,\n    queries: url.queries,\n    bestPosition: url.bestPosition,\n    isConsensus: url.frequency >= consensusThreshold,\n  }));\n}\n\n/**\n * Full Reddit aggregation pipeline \u2014 returns ALL URLs ranked by CTR score.\n * Determines a consensus threshold for labeling, never drops URLs.\n */\nexport function aggregateAndRankReddit(\n  searches: Map<string, RedditSearchResult[]>,\n  minConsensusUrls: number = DEFAULT_REDDIT_MIN_CONSENSUS_URLS\n): RedditAggregationResult {\n  const urlMap = aggregateRedditResults(searches);\n  const totalUniqueUrls = urlMap.size;\n  const totalQueries = searches.size;\n\n  // Determine consensus threshold for labeling (not filtering)\n  const thresholds = [2, 1];\n  let usedThreshold = 1;\n  let thresholdNote: string | undefined;\n\n  for (const threshold of thresholds) {\n    const count = countRedditByFrequency(urlMap, threshold);\n    if (count >= minConsensusUrls || threshold === 1) {\n      usedThreshold = threshold;\n      if (threshold < 2 && totalQueries > 1) {\n        thresholdNote = `Note: Consensus threshold set to \u2265${threshold} due to result diversity across queries.`;\n      }\n      break;\n    }\n  }\n\n  // Rank ALL URLs, marking consensus based on determined threshold\n  const allUrls = [...urlMap.values()];\n  const rankedUrls = calculateRedditWeightedScores(allUrls, usedThreshold);\n\n  return {\n    rankedUrls,\n    totalUniqueUrls,\n    totalQueries,\n    frequencyThreshold: usedThreshold,\n    thresholdNote,\n  };\n}\n\n/**\n * Generate enhanced output for Reddit aggregated results\n * Now includes both aggregated view AND per-query raw results\n */\nexport function generateRedditEnhancedOutput(\n  aggregation: RedditAggregationResult,\n  allQueries: string[],\n  rawResults?: Map<string, RedditSearchResult[]>\n): string {\n  const { rankedUrls, totalUniqueUrls, frequencyThreshold, thresholdNote } = aggregation;\n  const lines: string[] = [];\n\n  // Header\n  lines.push(`# \uD83D\uDD0D Reddit Search Results (Aggregated from ${allQueries.length} Queries)`);\n  lines.push('');\n  lines.push(`**Total Unique Posts:** ${totalUniqueUrls} | **Consensus Threshold:** \u2265${frequencyThreshold} appearances`);\n  lines.push('');\n\n  if (thresholdNote) {\n    lines.push(`> ${thresholdNote}`);\n    lines.push('');\n  }\n\n  // Consensus section (URLs appearing in multiple queries)\n  const consensusUrls = rankedUrls.filter(u => u.frequency >= frequencyThreshold && u.frequency > 1);\n  if (consensusUrls.length > 0) {\n    lines.push('## \u2B50 High-Consensus Posts (Multiple Queries)');\n    lines.push('');\n    lines.push('*These posts appeared across multiple search queries, indicating high relevance:*');\n    lines.push('');\n\n    for (const url of consensusUrls) {\n      const dateStr = url.date ? ` \u2022 \uD83D\uDCC5 ${url.date}` : '';\n      const queriesList = url.queries.map(q => `\"${q}\"`).join(', ');\n      lines.push(`### #${url.rank}: ${url.title}`);\n      lines.push(`**Score:** ${url.score.toFixed(1)} | **Found in:** ${url.frequency} queries (${queriesList})${dateStr}`);\n      lines.push(`${url.url}`);\n      lines.push(`> ${url.snippet}`);\n      lines.push('');\n    }\n\n    lines.push('---');\n    lines.push('');\n  }\n\n  // All results ranked by CTR score\n  lines.push('## \uD83D\uDCCA All Results (CTR-Ranked)');\n  lines.push('');\n\n  for (const url of rankedUrls) {\n    const dateStr = url.date ? ` \u2022 \uD83D\uDCC5 ${url.date}` : '';\n    const consensusMarker = url.frequency > 1 ? ' \u2B50' : '';\n    lines.push(`**${url.rank}. ${url.title}**${consensusMarker}${dateStr}`);\n    lines.push(`${url.url}`);\n    lines.push(`> ${url.snippet}`);\n    if (url.frequency > 1) {\n      lines.push(`_Found in ${url.frequency} queries: ${url.queries.map(q => `\"${q}\"`).join(', ')}_`);\n    }\n    lines.push('');\n  }\n\n  // Per-Query Raw Results Section (NEW)\n  if (rawResults && rawResults.size > 0) {\n    lines.push('---');\n    lines.push('');\n    lines.push('## \uD83D\uDCCB Per-Query Raw Results');\n    lines.push('');\n    lines.push('*Complete results for each individual query before aggregation:*');\n    lines.push('');\n\n    for (const [query, results] of rawResults) {\n      lines.push(`### \uD83D\uDD0E Query: \"${query}\"`);\n      lines.push(`**Results:** ${results.length} posts`);\n      lines.push('');\n\n      if (results.length === 0) {\n        lines.push('_No results found for this query._');\n        lines.push('');\n        continue;\n      }\n\n      for (let i = 0; i < results.length; i++) {\n        const result = results[i];\n        if (!result) continue;\n        const position = i + 1;\n        const dateStr = result.date ? ` \u2022 \uD83D\uDCC5 ${result.date}` : '';\n        lines.push(`${position}. **${result.title}**${dateStr}`);\n        lines.push(`   ${result.url}`);\n        lines.push(`   > ${result.snippet}`);\n        lines.push('');\n      }\n    }\n  }\n\n  // Metadata\n  lines.push('---');\n  lines.push('');\n  lines.push('### \uD83D\uDCC8 Search Metadata');\n  lines.push('');\n  lines.push(`- **Queries:** ${allQueries.map(q => `\"${q}\"`).join(', ')}`);\n  lines.push(`- **Unique Posts Found:** ${totalUniqueUrls}`);\n  lines.push(`- **High-Consensus Posts:** ${consensusUrls.length}`);\n  lines.push('');\n\n  return lines.join('\\n');\n}\n"],
+  "mappings": "AAMA,SAAS,mBAAmB;AAI5B,MAAM,0BAA0B;AAGhC,MAAM,6BAA6B;AAGnC,MAAM,0BAA0B;AAGhC,MAAM,qBAAqB;AAG3B,MAAM,oBAAoB;AAG1B,MAAM,6BAA6B;AAGnC,MAAM,oCAAoC;AAG1C,MAAM,2BAA2B;AA+CjC,SAAS,aAAa,UAA0B;AAC9C,MAAI,YAAY,KAAK,YAAY,IAAI;AACnC,WAAO,YAAY,QAAQ,KAAK;AAAA,EAClC;AAEA,SAAO,KAAK,IAAI,yBAAyB,qBAAqB,WAAW,qBAAqB,kBAAkB;AAClH;AAMA,SAAS,iBAAiB,UAA6D;AACrF,QAAM,SAAS,oBAAI,IAA2B;AAE9C,aAAW,UAAU,UAAU;AAC7B,eAAW,UAAU,OAAO,SAAS;AACnC,YAAM,gBAAgB,aAAa,OAAO,IAAI;AAC9C,YAAM,WAAW,OAAO,IAAI,aAAa;AAEzC,UAAI,UAAU;AACZ,iBAAS,aAAa;AACtB,iBAAS,UAAU,KAAK,OAAO,QAAQ;AACvC,iBAAS,QAAQ,KAAK,OAAO,OAAO;AACpC,cAAM,WAAW,SAAS;AAC1B,iBAAS,eAAe,KAAK,IAAI,SAAS,cAAc,OAAO,QAAQ;AACvE,iBAAS,cAAc,aAAa,OAAO,QAAQ;AAEnD,YAAI,OAAO,WAAW,UAAU;AAC9B,mBAAS,QAAQ,OAAO;AACxB,mBAAS,UAAU,OAAO;AAAA,QAC5B;AAAA,MACF,OAAO;AACL,eAAO,IAAI,eAAe;AAAA,UACxB,KAAK,OAAO;AAAA,UACZ,OAAO,OAAO;AAAA,UACd,SAAS,OAAO;AAAA,UAChB,WAAW;AAAA,UACX,WAAW,CAAC,OAAO,QAAQ;AAAA,UAC3B,SAAS,CAAC,OAAO,OAAO;AAAA,UACxB,cAAc,OAAO;AAAA,UACrB,YAAY,aAAa,OAAO,QAAQ;AAAA,QAC1C,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,aAAa,KAAqB;AACzC,MAAI;AACF,UAAM,SAAS,IAAI,IAAI,GAAG;AAC1B,QAAI,OAAO,OAAO,SAAS,QAAQ,UAAU,EAAE;AAC/C,QAAI,OAAO,OAAO,SAAS,QAAQ,OAAO,EAAE,KAAK;AACjD,WAAO,GAAG,IAAI,GAAG,IAAI,GAAG,OAAO,MAAM,GAAG,YAAY;AAAA,EACtD,QAAQ;AACN,WAAO,IAAI,YAAY,EAAE,QAAQ,OAAO,EAAE;AAAA,EAC5C;AACF;AAKA,SAAS,iBACP,QACA,cACQ;AACR,MAAI,QAAQ;AACZ,aAAW,OAAO,OAAO,OAAO,GAAG;AACjC,QAAI,IAAI,aAAa,aAAc;AAAA,EACrC;AACA,SAAO;AACT;AAMA,SAAS,wBAAwB,MAAuB,oBAAyC;AAC/F,MAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAG/B,QAAM,SAAS,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAGnE,QAAM,WAAW,OAAO,CAAC,EAAG;AAG5B,SAAO,OAAO,IAAI,CAAC,KAAK,WAAW;AAAA,IACjC,KAAK,IAAI;AAAA,IACT,OAAO,IAAI;AAAA,IACX,SAAS,IAAI;AAAA,IACb,MAAM,QAAQ;AAAA,IACd,OAAO,WAAW,IAAK,IAAI,aAAa,WAAY,MAAM;AAAA,IAC1D,WAAW,IAAI;AAAA,IACf,WAAW,IAAI;AAAA,IACf,SAAS,IAAI;AAAA,IACb,cAAc,IAAI;AAAA,IAClB,aAAa,IAAI,aAAa;AAAA,EAChC,EAAE;AACJ;AAMO,SAAS,cAAc,WAA2B;AACvD,SAAO,aAAa,0BAA0B,WAAM;AACtD;AAKA,SAAS,sBAAsB,KAAgB,MAAsB;AACnE,QAAM,QAAkB,CAAC;AAEzB,MAAI,IAAI,aAAa,0BAA0B;AAC7C,UAAM,KAAK,eAAe,IAAI,SAAS,0DAA0D;AAAA,EACnG,WAAW,IAAI,aAAa,yBAAyB;AACnD,UAAM,KAAK,gBAAgB,IAAI,SAAS,6CAA6C;AAAA,EACvF,OAAO;AACL,UAAM,KAAK,eAAe,IAAI,SAAS,UAAU,IAAI,YAAY,IAAI,OAAO,EAAE,EAAE;AAAA,EAClF;AAEA,MAAI,IAAI,iBAAiB,GAAG;AAC1B,UAAM,KAAK,kCAAkC;AAAA,EAC/C,WAAW,IAAI,gBAAgB,GAAG;AAChC,UAAM,KAAK,6BAA6B,IAAI,YAAY,GAAG;AAAA,EAC7D;AAEA,SAAO,MAAM,KAAK,IAAI,IAAI;AAC5B;AAKO,SAAS,uBACd,YACA,aACA,iBACA,oBACA,eACQ;AACR,QAAM,QAAkB,CAAC;AAGzB,QAAM,iBAAiB,WAAW,OAAO,OAAK,EAAE,WAAW,EAAE;AAC7D,QAAM,KAAK,iCAAiC,YAAY,MAAM,mBAAc,WAAW,MAAM,eAAe;AAC5G,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,YAAY,YAAY,MAAM,kCAAkC,WAAW,MAAM,wBAAwB,cAAc,+BAA+B;AACjK,QAAM,KAAK,EAAE;AAEb,MAAI,eAAe;AACjB,UAAM,KAAK,KAAK,aAAa,EAAE;AAC/B,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,KAAK,gCAAyB;AACpC,QAAM,KAAK,EAAE;AAEb,aAAW,OAAO,YAAY;AAC5B,UAAM,gBAAgB,IAAI,aAAa,2BAA2B,8BAAyB,IAAI,cAAc,sBAAiB;AAC9H,UAAM,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,KAAK,YAAY,IAAI,MAAM,QAAQ,CAAC,CAAC,IAAI,aAAa,EAAE;AAG7F,UAAM,cAAc,IAAI,QAAQ,IAAI,OAAK,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI;AAC5D,UAAM,KAAK,sBAAsB,IAAI,SAAS,aAAa,WAAW,GAAG;AAGzE,UAAM,KAAK,gCAAgC,IAAI,YAAY,EAAE;AAG7D,UAAM,KAAK,sBAAsB,IAAI,OAAO,EAAE;AAG9C,UAAM,KAAK,iBAAiB,IAAI,IAAI,OAAO,sBAAsB,KAAK,IAAI,IAAI,CAAC,EAAE;AAGjF,UAAM,KAAK,cAAc,IAAI,GAAG,EAAE;AAClC,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,KAAK,KAAK;AAChB,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,wBAAiB;AAC5B,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,wBAAwB,YAAY,MAAM,KAAK,YAAY,KAAK,IAAI,CAAC,GAAG;AAGnF,QAAM,eAAe,CAAC,GAAG,UAAU,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;AAC7E,QAAM,cAAc,aACjB,IAAI,OAAK,GAAG,EAAE,GAAG,KAAK,EAAE,SAAS,IAAI,EACrC,KAAK,IAAI;AAEZ,QAAM,KAAK,4BAA4B,eAAe,6BAAwB,WAAW,EAAE;AAC3F,QAAM,KAAK,oCAA+B,kBAAkB,cAAc;AAC1E,QAAM,KAAK,EAAE;AAEb,SAAO,MAAM,KAAK,IAAI;AACxB;AAOO,SAAS,iBACd,UACA,mBAA2B,4BACR;AACnB,QAAM,SAAS,iBAAiB,QAAQ;AACxC,QAAM,kBAAkB,OAAO;AAC/B,QAAM,eAAe,SAAS;AAG9B,QAAM,aAAa,CAAC,GAAG,GAAG,CAAC;AAC3B,MAAI,gBAAgB;AACpB,MAAI;AAEJ,aAAW,aAAa,YAAY;AAClC,UAAM,QAAQ,iBAAiB,QAAQ,SAAS;AAChD,QAAI,SAAS,oBAAoB,cAAc,GAAG;AAChD,sBAAgB;AAChB,UAAI,YAAY,GAAG;AACjB,wBAAgB,0CAAqC,SAAS;AAAA,MAChE;AACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,UAAU,CAAC,GAAG,OAAO,OAAO,CAAC;AACnC,QAAM,aAAa,wBAAwB,SAAS,aAAa;AAEjE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,oBAAoB;AAAA,IACpB;AAAA,EACF;AACF;AAKO,SAAS,eAAe,YAAiD;AAC9E,QAAM,SAAS,oBAAI,IAAuB;AAE1C,aAAW,OAAO,YAAY;AAC5B,UAAM,aAAa,aAAa,IAAI,GAAG;AACvC,WAAO,IAAI,YAAY,GAAG;AAE1B,WAAO,IAAI,IAAI,IAAI,YAAY,GAAG,GAAG;AAAA,EACvC;AAEA,SAAO;AACT;AAKO,SAAS,UAAU,KAAa,QAAuD;AAC5F,QAAM,aAAa,aAAa,GAAG;AACnC,SAAO,OAAO,IAAI,UAAU,KAAK,OAAO,IAAI,IAAI,YAAY,CAAC;AAC/D;AAoDA,SAAS,uBACP,UACkC;AAClC,QAAM,SAAS,oBAAI,IAAiC;AAEpD,aAAW,CAAC,OAAO,OAAO,KAAK,UAAU;AACvC,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,YAAM,SAAS,QAAQ,CAAC;AACxB,UAAI,CAAC,OAAQ;AACb,YAAM,WAAW,IAAI;AACrB,YAAM,gBAAgB,aAAa,OAAO,GAAG;AAC7C,YAAM,WAAW,OAAO,IAAI,aAAa;AAEzC,UAAI,UAAU;AACZ,iBAAS,aAAa;AACtB,iBAAS,UAAU,KAAK,QAAQ;AAChC,iBAAS,QAAQ,KAAK,KAAK;AAC3B,cAAM,WAAW,SAAS;AAC1B,iBAAS,eAAe,KAAK,IAAI,SAAS,cAAc,QAAQ;AAChE,iBAAS,cAAc,aAAa,QAAQ;AAE5C,YAAI,WAAW,UAAU;AACvB,mBAAS,QAAQ,OAAO;AACxB,mBAAS,UAAU,OAAO;AAC1B,mBAAS,OAAO,OAAO;AAAA,QACzB;AAAA,MACF,OAAO;AACL,eAAO,IAAI,eAAe;AAAA,UACxB,KAAK,OAAO;AAAA,UACZ,OAAO,OAAO;AAAA,UACd,SAAS,OAAO;AAAA,UAChB,MAAM,OAAO;AAAA,UACb,WAAW;AAAA,UACX,WAAW,CAAC,QAAQ;AAAA,UACpB,SAAS,CAAC,KAAK;AAAA,UACf,cAAc;AAAA,UACd,YAAY,aAAa,QAAQ;AAAA,QACnC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKA,SAAS,uBACP,QACA,cACQ;AACR,MAAI,QAAQ;AACZ,aAAW,OAAO,OAAO,OAAO,GAAG;AACjC,QAAI,IAAI,aAAa,aAAc;AAAA,EACrC;AACA,SAAO;AACT;AAMA,SAAS,8BAA8B,MAA6B,oBAA+C;AACjH,MAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAG/B,QAAM,SAAS,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAGnE,QAAM,WAAW,OAAO,CAAC,EAAG;AAG5B,SAAO,OAAO,IAAI,CAAC,KAAK,WAAW;AAAA,IACjC,KAAK,IAAI;AAAA,IACT,OAAO,IAAI;AAAA,IACX,SAAS,IAAI;AAAA,IACb,MAAM,IAAI;AAAA,IACV,MAAM,QAAQ;AAAA,IACd,OAAO,WAAW,IAAK,IAAI,aAAa,WAAY,MAAM;AAAA,IAC1D,WAAW,IAAI;AAAA,IACf,WAAW,IAAI;AAAA,IACf,SAAS,IAAI;AAAA,IACb,cAAc,IAAI;AAAA,IAClB,aAAa,IAAI,aAAa;AAAA,EAChC,EAAE;AACJ;AAMO,SAAS,uBACd,UACA,mBAA2B,mCACF;AACzB,QAAM,SAAS,uBAAuB,QAAQ;AAC9C,QAAM,kBAAkB,OAAO;AAC/B,QAAM,eAAe,SAAS;AAG9B,QAAM,aAAa,CAAC,GAAG,CAAC;AACxB,MAAI,gBAAgB;AACpB,MAAI;AAEJ,aAAW,aAAa,YAAY;AAClC,UAAM,QAAQ,uBAAuB,QAAQ,SAAS;AACtD,QAAI,SAAS,oBAAoB,cAAc,GAAG;AAChD,sBAAgB;AAChB,UAAI,YAAY,KAAK,eAAe,GAAG;AACrC,wBAAgB,0CAAqC,SAAS;AAAA,MAChE;AACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,UAAU,CAAC,GAAG,OAAO,OAAO,CAAC;AACnC,QAAM,aAAa,8BAA8B,SAAS,aAAa;AAEvE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,oBAAoB;AAAA,IACpB;AAAA,EACF;AACF;AAMO,SAAS,6BACd,aACA,YACA,YACQ;AACR,QAAM,EAAE,YAAY,iBAAiB,oBAAoB,cAAc,IAAI;AAC3E,QAAM,QAAkB,CAAC;AAGzB,QAAM,KAAK,sDAA+C,WAAW,MAAM,WAAW;AACtF,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,2BAA2B,eAAe,qCAAgC,kBAAkB,cAAc;AACrH,QAAM,KAAK,EAAE;AAEb,MAAI,eAAe;AACjB,UAAM,KAAK,KAAK,aAAa,EAAE;AAC/B,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,gBAAgB,WAAW,OAAO,OAAK,EAAE,aAAa,sBAAsB,EAAE,YAAY,CAAC;AACjG,MAAI,cAAc,SAAS,GAAG;AAC5B,UAAM,KAAK,mDAA8C;AACzD,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,mFAAmF;AAC9F,UAAM,KAAK,EAAE;AAEb,eAAW,OAAO,eAAe;AAC/B,YAAM,UAAU,IAAI,OAAO,qBAAS,IAAI,IAAI,KAAK;AACjD,YAAM,cAAc,IAAI,QAAQ,IAAI,OAAK,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI;AAC5D,YAAM,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE;AAC3C,YAAM,KAAK,cAAc,IAAI,MAAM,QAAQ,CAAC,CAAC,oBAAoB,IAAI,SAAS,aAAa,WAAW,IAAI,OAAO,EAAE;AACnH,YAAM,KAAK,GAAG,IAAI,GAAG,EAAE;AACvB,YAAM,KAAK,KAAK,IAAI,OAAO,EAAE;AAC7B,YAAM,KAAK,EAAE;AAAA,IACf;AAEA,UAAM,KAAK,KAAK;AAChB,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,QAAM,KAAK,uCAAgC;AAC3C,QAAM,KAAK,EAAE;AAEb,aAAW,OAAO,YAAY;AAC5B,UAAM,UAAU,IAAI,OAAO,qBAAS,IAAI,IAAI,KAAK;AACjD,UAAM,kBAAkB,IAAI,YAAY,IAAI,YAAO;AACnD,UAAM,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK,eAAe,GAAG,OAAO,EAAE;AACtE,UAAM,KAAK,GAAG,IAAI,GAAG,EAAE;AACvB,UAAM,KAAK,KAAK,IAAI,OAAO,EAAE;AAC7B,QAAI,IAAI,YAAY,GAAG;AACrB,YAAM,KAAK,aAAa,IAAI,SAAS,aAAa,IAAI,QAAQ,IAAI,OAAK,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI,CAAC,GAAG;AAAA,IAChG;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAGA,MAAI,cAAc,WAAW,OAAO,GAAG;AACrC,UAAM,KAAK,KAAK;AAChB,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,oCAA6B;AACxC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,kEAAkE;AAC7E,UAAM,KAAK,EAAE;AAEb,eAAW,CAAC,OAAO,OAAO,KAAK,YAAY;AACzC,YAAM,KAAK,yBAAkB,KAAK,GAAG;AACrC,YAAM,KAAK,gBAAgB,QAAQ,MAAM,QAAQ;AACjD,YAAM,KAAK,EAAE;AAEb,UAAI,QAAQ,WAAW,GAAG;AACxB,cAAM,KAAK,oCAAoC;AAC/C,cAAM,KAAK,EAAE;AACb;AAAA,MACF;AAEA,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,cAAM,SAAS,QAAQ,CAAC;AACxB,YAAI,CAAC,OAAQ;AACb,cAAM,WAAW,IAAI;AACrB,cAAM,UAAU,OAAO,OAAO,qBAAS,OAAO,IAAI,KAAK;AACvD,cAAM,KAAK,GAAG,QAAQ,OAAO,OAAO,KAAK,KAAK,OAAO,EAAE;AACvD,cAAM,KAAK,MAAM,OAAO,GAAG,EAAE;AAC7B,cAAM,KAAK,QAAQ,OAAO,OAAO,EAAE;AACnC,cAAM,KAAK,EAAE;AAAA,MACf;AAAA,IACF;AAAA,EACF;AAGA,QAAM,KAAK,KAAK;AAChB,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,+BAAwB;AACnC,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,kBAAkB,WAAW,IAAI,OAAK,IAAI,CAAC,GAAG,EAAE,KAAK,IAAI,CAAC,EAAE;AACvE,QAAM,KAAK,6BAA6B,eAAe,EAAE;AACzD,QAAM,KAAK,+BAA+B,cAAc,MAAM,EAAE;AAChE,QAAM,KAAK,EAAE;AAEb,SAAO,MAAM,KAAK,IAAI;AACxB;",
+  "names": []
+}

package/dist/src/version.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Version Module - Single Source of Truth
+ *
+ * This module reads package metadata from package.json at runtime and keeps a
+ * fallback copy for environments where package.json cannot be resolved.
+ *
+ * Usage:
+ *   import { VERSION, PACKAGE_NAME } from './version.js';
+ */
+/**
+ * Package version from package.json
+ * This is the single source of truth for versioning
+ */
+export declare const VERSION: string;
+/**
+ * Package name from package.json
+ */
+export declare const PACKAGE_NAME: string;
+/**
+ * Package description from package.json
+ */
+export declare const PACKAGE_DESCRIPTION: string;
+/**
+ * Formatted version string for user agents and logging
+ * Example: "mcp-researchpowerpack-http/3.2.0"
+ */
+export declare const USER_AGENT_VERSION: string;
+//# sourceMappingURL=version.d.ts.map

package/dist/src/version.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"version.d.ts","sourceRoot":"","sources":["../../src/version.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AA6BH;;;GAGG;AACH,eAAO,MAAM,OAAO,EAAE,MAA4B,CAAC;AAEnD;;GAEG;AACH,eAAO,MAAM,YAAY,EAAE,MAAyB,CAAC;AAErD;;GAEG;AACH,eAAO,MAAM,mBAAmB,EAAE,MAAgC,CAAC;AAEnE;;;GAGG;AACH,eAAO,MAAM,kBAAkB,EAAE,MAAqC,CAAC"}

package/dist/src/version.js

@@ -0,0 +1,32 @@
+import { createRequire } from "module";
+import { fileURLToPath } from "url";
+import { dirname, join } from "path";
+const DEFAULT_PACKAGE_INFO = {
+  version: "3.9.5",
+  name: "mcp-researchpowerpack-http",
+  description: "Research Powerpack MCP Server"
+};
+let packageJson = { ...DEFAULT_PACKAGE_INFO };
+try {
+  if (typeof import.meta.url === "string" && import.meta.url.startsWith("file:")) {
+    const _require = createRequire(import.meta.url);
+    const _dirname = dirname(fileURLToPath(import.meta.url));
+    try {
+      packageJson = _require(join(_dirname, "..", "package.json"));
+    } catch {
+      packageJson = _require(join(_dirname, "..", "..", "package.json"));
+    }
+  }
+} catch {
+}
+const VERSION = packageJson.version;
+const PACKAGE_NAME = packageJson.name;
+const PACKAGE_DESCRIPTION = packageJson.description;
+const USER_AGENT_VERSION = `${PACKAGE_NAME}/${VERSION}`;
+export {
+  PACKAGE_DESCRIPTION,
+  PACKAGE_NAME,
+  USER_AGENT_VERSION,
+  VERSION
+};
+//# sourceMappingURL=version.js.map

package/dist/src/version.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/version.ts"],
+  "sourcesContent": ["/**\n * Version Module - Single Source of Truth\n * \n * This module reads package metadata from package.json at runtime and keeps a\n * fallback copy for environments where package.json cannot be resolved.\n * \n * Usage:\n *   import { VERSION, PACKAGE_NAME } from './version.js';\n */\n\nimport { createRequire } from 'module';\nimport { fileURLToPath } from 'url';\nimport { dirname, join } from 'path';\n\n// Defaults used if package.json cannot be loaded at runtime.\nconst DEFAULT_PACKAGE_INFO = {\n  version: '3.9.5',\n  name: 'mcp-researchpowerpack-http',\n  description: 'Research Powerpack MCP Server',\n} as const;\n\nlet packageJson: { version: string; name: string; description: string } = { ...DEFAULT_PACKAGE_INFO };\n\ntry {\n  if (typeof import.meta.url === 'string' && import.meta.url.startsWith('file:')) {\n    const _require = createRequire(import.meta.url);\n    const _dirname = dirname(fileURLToPath(import.meta.url));\n    try {\n      packageJson = _require(join(_dirname, '..', 'package.json'));\n    } catch {\n      packageJson = _require(join(_dirname, '..', '..', 'package.json'));\n    }\n  }\n} catch {\n  // Keep hardcoded defaults when package.json is unavailable\n}\n\n/**\n * Package version from package.json\n * This is the single source of truth for versioning\n */\nexport const VERSION: string = packageJson.version;\n\n/**\n * Package name from package.json\n */\nexport const PACKAGE_NAME: string = packageJson.name;\n\n/**\n * Package description from package.json\n */\nexport const PACKAGE_DESCRIPTION: string = packageJson.description;\n\n/**\n * Formatted version string for user agents and logging\n * Example: \"mcp-researchpowerpack-http/3.2.0\"\n */\nexport const USER_AGENT_VERSION: string = `${PACKAGE_NAME}/${VERSION}`;\n\n// VERSION_INFO removed - unused, individual exports sufficient\n"],
+  "mappings": "AAUA,SAAS,qBAAqB;AAC9B,SAAS,qBAAqB;AAC9B,SAAS,SAAS,YAAY;AAG9B,MAAM,uBAAuB;AAAA,EAC3B,SAAS;AAAA,EACT,MAAM;AAAA,EACN,aAAa;AACf;AAEA,IAAI,cAAsE,EAAE,GAAG,qBAAqB;AAEpG,IAAI;AACF,MAAI,OAAO,YAAY,QAAQ,YAAY,YAAY,IAAI,WAAW,OAAO,GAAG;AAC9E,UAAM,WAAW,cAAc,YAAY,GAAG;AAC9C,UAAM,WAAW,QAAQ,cAAc,YAAY,GAAG,CAAC;AACvD,QAAI;AACF,oBAAc,SAAS,KAAK,UAAU,MAAM,cAAc,CAAC;AAAA,IAC7D,QAAQ;AACN,oBAAc,SAAS,KAAK,UAAU,MAAM,MAAM,cAAc,CAAC;AAAA,IACnE;AAAA,EACF;AACF,QAAQ;AAER;AAMO,MAAM,UAAkB,YAAY;AAKpC,MAAM,eAAuB,YAAY;AAKzC,MAAM,sBAA8B,YAAY;AAMhD,MAAM,qBAA6B,GAAG,YAAY,IAAI,OAAO;",
+  "names": []
+}

package/package.json

@@ -0,0 +1,73 @@
+{
+  "name": "mcp-researchpowerpack-http",
+  "version": "3.10.0",
+  "description": "The ultimate research MCP toolkit: Reddit mining, web search with CTR aggregation, AI-powered deep research, and intelligent web scraping - all in one modular package",
+  "type": "module",
+  "main": "dist/index.js",
+  "bin": {
+    "mcp-researchpowerpack-http": "dist/index.js",
+    "mcp-research-powerpack-http": "dist/index.js"
+  },
+  "files": [
+    "dist",
+    "!dist/tests"
+  ],
+  "scripts": {
+    "build": "mcp-use build",
+    "dev": "mcp-use dev",
+    "start": "mcp-use start",
+    "deploy": "mcp-use deploy",
+    "inspect": "npx @mcp-use/inspector --url http://localhost:3000/mcp",
+    "typecheck": "tsc --noEmit",
+    "test": "pnpm test:http",
+    "test:http": "tsx tests/http-server.ts",
+    "prepublishOnly": "pnpm build && pnpm typecheck"
+  },
+  "keywords": [
+    "mcp",
+    "research",
+    "reddit",
+    "serper",
+    "search",
+    "ai",
+    "model-context-protocol",
+    "deep-research",
+    "web-scraping",
+    "claude",
+    "anthropic",
+    "openrouter",
+    "scraping",
+    "research-powerpack",
+    "http-mcp"
+  ],
+  "author": "Yiğit Konur <yigit35@gmail.com>",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/yigitkonur/mcp-researchpowerpack-http.git"
+  },
+  "homepage": "https://github.com/yigitkonur/mcp-researchpowerpack-http#readme",
+  "bugs": {
+    "url": "https://github.com/yigitkonur/mcp-researchpowerpack-http/issues"
+  },
+  "dependencies": {
+    "mcp-use": "1.22.0",
+    "openai": "^4.77.0",
+    "redis": "^5.11.0",
+    "turndown": "^7.2.2",
+    "zod": "^4.3.6"
+  },
+  "devDependencies": {
+    "@mcp-use/cli": "2.20.0",
+    "@types/node": "^22.0.0",
+    "@types/turndown": "^5.0.6",
+    "tsx": "^4.19.0",
+    "typescript": "^5.6.0"
+  },
+  "engines": {
+    "node": "^20.19.0 || >=22.12.0"
+  },
+  "publishConfig": {
+    "access": "public"
+  }
+}