prompts.chat 0.0.1 → 0.0.2

package/dist/quality/index.js

@@ -0,0 +1,212 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/quality/index.ts
+var quality_exports = {};
+__export(quality_exports, {
+  check: () => check,
+  getSuggestions: () => getSuggestions,
+  isValid: () => isValid,
+  validate: () => validate
+});
+module.exports = __toCommonJS(quality_exports);
+var MIN_CHAR_COUNT = 20;
+var MIN_WORD_COUNT = 5;
+var OPTIMAL_MIN_WORDS = 20;
+var OPTIMAL_MAX_WORDS = 2e3;
+function isGibberish(text) {
+  if (/(.)\1{4,}/.test(text)) return true;
+  const keyboardPatterns = ["qwerty", "asdfgh", "zxcvbn", "qwertz", "azerty"];
+  const lower = text.toLowerCase();
+  if (keyboardPatterns.some((p) => lower.includes(p))) return true;
+  const vowels = (text.match(/[aeiouAEIOU]/g) || []).length;
+  const consonants = (text.match(/[bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ]/g) || []).length;
+  if (consonants > 0 && vowels / consonants < 0.1) return true;
+  return false;
+}
+function detectPatterns(text) {
+  const lower = text.toLowerCase();
+  return {
+    hasRole: /\b(act as|you are|imagine you|pretend to be|role:|persona:)\b/i.test(text),
+    hasTask: /\b(your task|you (will|should|must)|please|help me|i need|i want you to)\b/i.test(text),
+    hasConstraints: /\b(do not|don't|never|always|must|should not|avoid|only|limit)\b/i.test(text) || /\b(rule|constraint|requirement|guideline)\b/i.test(lower),
+    hasExamples: /\b(example|for instance|such as|e\.g\.|like this)\b/i.test(lower) || /```[\s\S]*```/.test(text)
+  };
+}
+function countVariables(text) {
+  const patterns = [
+    /\$\{[^}]+\}/g,
+    // ${var}
+    /\{\{[^}]+\}\}/g,
+    // {{var}}
+    /\[\[[^\]]+\]\]/g,
+    // [[var]]
+    /\[[A-Z][A-Z0-9_\s]*\]/g
+    // [VAR]
+  ];
+  let count = 0;
+  for (const pattern of patterns) {
+    const matches = text.match(pattern);
+    if (matches) count += matches.length;
+  }
+  return count;
+}
+function calculateScore(stats, issues) {
+  let score = 1;
+  const errors = issues.filter((i) => i.type === "error").length;
+  const warnings = issues.filter((i) => i.type === "warning").length;
+  score -= errors * 0.2;
+  score -= warnings * 0.05;
+  if (stats.hasRole) score += 0.05;
+  if (stats.hasTask) score += 0.05;
+  if (stats.hasConstraints) score += 0.03;
+  if (stats.hasExamples) score += 0.05;
+  if (stats.wordCount < OPTIMAL_MIN_WORDS) {
+    score -= 0.1 * (1 - stats.wordCount / OPTIMAL_MIN_WORDS);
+  }
+  if (stats.wordCount > OPTIMAL_MAX_WORDS) {
+    score -= 0.05;
+  }
+  if (stats.variableCount > 0) {
+    score += 0.05;
+  }
+  return Math.max(0, Math.min(1, score));
+}
+function check(prompt) {
+  const issues = [];
+  const trimmed = prompt.trim();
+  const characterCount = trimmed.length;
+  const words = trimmed.split(/\s+/).filter((w) => w.length > 0);
+  const wordCount = words.length;
+  const sentenceCount = (trimmed.match(/[.!?]+/g) || []).length || 1;
+  const variableCount = countVariables(trimmed);
+  const patterns = detectPatterns(trimmed);
+  if (characterCount === 0) {
+    issues.push({
+      type: "error",
+      code: "EMPTY",
+      message: "Prompt is empty"
+    });
+  } else if (characterCount < MIN_CHAR_COUNT) {
+    issues.push({
+      type: "error",
+      code: "TOO_SHORT",
+      message: `Prompt is too short (${characterCount} chars, minimum ${MIN_CHAR_COUNT})`
+    });
+  }
+  if (wordCount > 0 && wordCount < MIN_WORD_COUNT) {
+    issues.push({
+      type: "warning",
+      code: "FEW_WORDS",
+      message: `Prompt has very few words (${wordCount} words, recommended ${OPTIMAL_MIN_WORDS}+)`
+    });
+  }
+  if (isGibberish(trimmed)) {
+    issues.push({
+      type: "error",
+      code: "GIBBERISH",
+      message: "Prompt appears to contain gibberish or random characters"
+    });
+  }
+  if (!patterns.hasTask && !patterns.hasRole) {
+    issues.push({
+      type: "suggestion",
+      code: "NO_CLEAR_INSTRUCTION",
+      message: "Consider adding a clear task or role definition"
+    });
+  }
+  const brackets = [
+    { open: "{", close: "}" },
+    { open: "[", close: "]" },
+    { open: "(", close: ")" }
+  ];
+  for (const { open, close } of brackets) {
+    const openCount = (trimmed.match(new RegExp(`\\${open}`, "g")) || []).length;
+    const closeCount = (trimmed.match(new RegExp(`\\${close}`, "g")) || []).length;
+    if (openCount !== closeCount) {
+      issues.push({
+        type: "warning",
+        code: "UNBALANCED_BRACKETS",
+        message: `Unbalanced ${open}${close} brackets (${openCount} open, ${closeCount} close)`
+      });
+    }
+  }
+  const lines = trimmed.split("\n");
+  const longLines = lines.filter((l) => l.length > 500);
+  if (longLines.length > 0) {
+    issues.push({
+      type: "suggestion",
+      code: "LONG_LINES",
+      message: "Some lines are very long. Consider breaking them up for readability."
+    });
+  }
+  const stats = {
+    characterCount,
+    wordCount,
+    sentenceCount,
+    variableCount,
+    ...patterns
+  };
+  const score = calculateScore(stats, issues);
+  const hasErrors = issues.some((i) => i.type === "error");
+  return {
+    valid: !hasErrors,
+    score,
+    issues,
+    stats
+  };
+}
+function validate(prompt) {
+  const result = check(prompt);
+  if (!result.valid) {
+    const errors = result.issues.filter((i) => i.type === "error").map((i) => i.message).join("; ");
+    throw new Error(`Invalid prompt: ${errors}`);
+  }
+}
+function isValid(prompt) {
+  return check(prompt).valid;
+}
+function getSuggestions(prompt) {
+  const result = check(prompt);
+  const suggestions = [];
+  suggestions.push(
+    ...result.issues.filter((i) => i.type === "suggestion" || i.type === "warning").map((i) => i.message)
+  );
+  if (!result.stats.hasRole) {
+    suggestions.push('Add a role definition (e.g., "Act as a...")');
+  }
+  if (!result.stats.hasConstraints && result.stats.wordCount > 50) {
+    suggestions.push("Consider adding constraints or rules for better control");
+  }
+  if (!result.stats.hasExamples && result.stats.wordCount > 100) {
+    suggestions.push("Adding examples can improve output quality");
+  }
+  if (result.stats.variableCount === 0 && result.stats.wordCount > 30) {
+    suggestions.push("Consider adding variables (${var}) to make the prompt reusable");
+  }
+  return suggestions;
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  check,
+  getSuggestions,
+  isValid,
+  validate
+});
+//# sourceMappingURL=index.js.map

package/dist/quality/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/quality/index.ts"],"sourcesContent":["/**\n * Prompt Quality Checker - Local validation for prompt quality\n * \n * @example\n * ```ts\n * import { quality } from 'prompts.chat';\n * \n * const result = quality.check(\"Act as a developer...\");\n * console.log(result.score); // 0.85\n * console.log(result.issues); // []\n * ```\n */\n\nexport interface QualityIssue {\n  type: 'error' | 'warning' | 'suggestion';\n  code: string;\n  message: string;\n  position?: { start: number; end: number };\n}\n\nexport interface QualityResult {\n  valid: boolean;\n  score: number; // 0-1\n  issues: QualityIssue[];\n  stats: {\n    characterCount: number;\n    wordCount: number;\n    sentenceCount: number;\n    variableCount: number;\n    hasRole: boolean;\n    hasTask: boolean;\n    hasConstraints: boolean;\n    hasExamples: boolean;\n  };\n}\n\n// Minimum thresholds\nconst MIN_CHAR_COUNT = 20;\nconst MIN_WORD_COUNT = 5;\nconst OPTIMAL_MIN_WORDS = 20;\nconst OPTIMAL_MAX_WORDS = 2000;\n\n/**\n * Check if text looks like gibberish\n */\nfunction isGibberish(text: string): boolean {\n  // Check for repeated characters\n  if (/(.)\\1{4,}/.test(text)) return true;\n  \n  // Check for keyboard patterns\n  const keyboardPatterns = ['qwerty', 'asdfgh', 'zxcvbn', 'qwertz', 'azerty'];\n  const lower = text.toLowerCase();\n  if (keyboardPatterns.some(p => lower.includes(p))) return true;\n  \n  // Check consonant/vowel ratio (gibberish often has unusual ratios)\n  const vowels = (text.match(/[aeiouAEIOU]/g) || []).length;\n  const consonants = (text.match(/[bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ]/g) || []).length;\n  \n  if (consonants > 0 && vowels / consonants < 0.1) return true;\n  \n  return false;\n}\n\n/**\n * Detect common prompt patterns\n */\nfunction detectPatterns(text: string): {\n  hasRole: boolean;\n  hasTask: boolean;\n  hasConstraints: boolean;\n  hasExamples: boolean;\n} {\n  const lower = text.toLowerCase();\n  \n  return {\n    hasRole: /\\b(act as|you are|imagine you|pretend to be|role:|persona:)\\b/i.test(text),\n    hasTask: /\\b(your task|you (will|should|must)|please|help me|i need|i want you to)\\b/i.test(text),\n    hasConstraints: /\\b(do not|don't|never|always|must|should not|avoid|only|limit)\\b/i.test(text) ||\n                    /\\b(rule|constraint|requirement|guideline)\\b/i.test(lower),\n    hasExamples: /\\b(example|for instance|such as|e\\.g\\.|like this)\\b/i.test(lower) ||\n                 /```[\\s\\S]*```/.test(text),\n  };\n}\n\n/**\n * Count variables in the prompt\n */\nfunction countVariables(text: string): number {\n  // Match various variable formats\n  const patterns = [\n    /\\$\\{[^}]+\\}/g,           // ${var}\n    /\\{\\{[^}]+\\}\\}/g,         // {{var}}\n    /\\[\\[[^\\]]+\\]\\]/g,        // [[var]]\n    /\\[[A-Z][A-Z0-9_\\s]*\\]/g, // [VAR]\n  ];\n  \n  let count = 0;\n  for (const pattern of patterns) {\n    const matches = text.match(pattern);\n    if (matches) count += matches.length;\n  }\n  \n  return count;\n}\n\n/**\n * Calculate quality score based on various factors\n */\nfunction calculateScore(\n  stats: QualityResult['stats'],\n  issues: QualityIssue[]\n): number {\n  let score = 1.0;\n  \n  // Deduct for errors\n  const errors = issues.filter(i => i.type === 'error').length;\n  const warnings = issues.filter(i => i.type === 'warning').length;\n  \n  score -= errors * 0.2;\n  score -= warnings * 0.05;\n  \n  // Bonus for good structure\n  if (stats.hasRole) score += 0.05;\n  if (stats.hasTask) score += 0.05;\n  if (stats.hasConstraints) score += 0.03;\n  if (stats.hasExamples) score += 0.05;\n  \n  // Penalty for being too short\n  if (stats.wordCount < OPTIMAL_MIN_WORDS) {\n    score -= 0.1 * (1 - stats.wordCount / OPTIMAL_MIN_WORDS);\n  }\n  \n  // Slight penalty for being very long\n  if (stats.wordCount > OPTIMAL_MAX_WORDS) {\n    score -= 0.05;\n  }\n  \n  // Bonus for having variables (indicates reusability)\n  if (stats.variableCount > 0) {\n    score += 0.05;\n  }\n  \n  return Math.max(0, Math.min(1, score));\n}\n\n/**\n * Check prompt quality locally (no API needed)\n */\nexport function check(prompt: string): QualityResult {\n  const issues: QualityIssue[] = [];\n  const trimmed = prompt.trim();\n  \n  // Basic stats\n  const characterCount = trimmed.length;\n  const words = trimmed.split(/\\s+/).filter(w => w.length > 0);\n  const wordCount = words.length;\n  const sentenceCount = (trimmed.match(/[.!?]+/g) || []).length || 1;\n  const variableCount = countVariables(trimmed);\n  const patterns = detectPatterns(trimmed);\n  \n  // Check for empty or too short\n  if (characterCount === 0) {\n    issues.push({\n      type: 'error',\n      code: 'EMPTY',\n      message: 'Prompt is empty',\n    });\n  } else if (characterCount < MIN_CHAR_COUNT) {\n    issues.push({\n      type: 'error',\n      code: 'TOO_SHORT',\n      message: `Prompt is too short (${characterCount} chars, minimum ${MIN_CHAR_COUNT})`,\n    });\n  }\n  \n  if (wordCount > 0 && wordCount < MIN_WORD_COUNT) {\n    issues.push({\n      type: 'warning',\n      code: 'FEW_WORDS',\n      message: `Prompt has very few words (${wordCount} words, recommended ${OPTIMAL_MIN_WORDS}+)`,\n    });\n  }\n  \n  // Check for gibberish\n  if (isGibberish(trimmed)) {\n    issues.push({\n      type: 'error',\n      code: 'GIBBERISH',\n      message: 'Prompt appears to contain gibberish or random characters',\n    });\n  }\n  \n  // Check for common issues\n  if (!patterns.hasTask && !patterns.hasRole) {\n    issues.push({\n      type: 'suggestion',\n      code: 'NO_CLEAR_INSTRUCTION',\n      message: 'Consider adding a clear task or role definition',\n    });\n  }\n  \n  // Check for unbalanced brackets/quotes\n  const brackets = [\n    { open: '{', close: '}' },\n    { open: '[', close: ']' },\n    { open: '(', close: ')' },\n  ];\n  \n  for (const { open, close } of brackets) {\n    const openCount = (trimmed.match(new RegExp(`\\\\${open}`, 'g')) || []).length;\n    const closeCount = (trimmed.match(new RegExp(`\\\\${close}`, 'g')) || []).length;\n    \n    if (openCount !== closeCount) {\n      issues.push({\n        type: 'warning',\n        code: 'UNBALANCED_BRACKETS',\n        message: `Unbalanced ${open}${close} brackets (${openCount} open, ${closeCount} close)`,\n      });\n    }\n  }\n  \n  // Check for very long lines (readability)\n  const lines = trimmed.split('\\n');\n  const longLines = lines.filter(l => l.length > 500);\n  if (longLines.length > 0) {\n    issues.push({\n      type: 'suggestion',\n      code: 'LONG_LINES',\n      message: 'Some lines are very long. Consider breaking them up for readability.',\n    });\n  }\n  \n  const stats = {\n    characterCount,\n    wordCount,\n    sentenceCount,\n    variableCount,\n    ...patterns,\n  };\n  \n  const score = calculateScore(stats, issues);\n  const hasErrors = issues.some(i => i.type === 'error');\n  \n  return {\n    valid: !hasErrors,\n    score,\n    issues,\n    stats,\n  };\n}\n\n/**\n * Validate a prompt and throw if invalid\n */\nexport function validate(prompt: string): void {\n  const result = check(prompt);\n  \n  if (!result.valid) {\n    const errors = result.issues\n      .filter(i => i.type === 'error')\n      .map(i => i.message)\n      .join('; ');\n    \n    throw new Error(`Invalid prompt: ${errors}`);\n  }\n}\n\n/**\n * Check if a prompt is valid\n */\nexport function isValid(prompt: string): boolean {\n  return check(prompt).valid;\n}\n\n/**\n * Get suggestions for improving a prompt\n */\nexport function getSuggestions(prompt: string): string[] {\n  const result = check(prompt);\n  const suggestions: string[] = [];\n  \n  // From issues\n  suggestions.push(\n    ...result.issues\n      .filter(i => i.type === 'suggestion' || i.type === 'warning')\n      .map(i => i.message)\n  );\n  \n  // Additional suggestions based on stats\n  if (!result.stats.hasRole) {\n    suggestions.push('Add a role definition (e.g., \"Act as a...\")');\n  }\n  \n  if (!result.stats.hasConstraints && result.stats.wordCount > 50) {\n    suggestions.push('Consider adding constraints or rules for better control');\n  }\n  \n  if (!result.stats.hasExamples && result.stats.wordCount > 100) {\n    suggestions.push('Adding examples can improve output quality');\n  }\n  \n  if (result.stats.variableCount === 0 && result.stats.wordCount > 30) {\n    suggestions.push('Consider adding variables (${var}) to make the prompt reusable');\n  }\n  \n  return suggestions;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAqCA,IAAM,iBAAiB;AACvB,IAAM,iBAAiB;AACvB,IAAM,oBAAoB;AAC1B,IAAM,oBAAoB;AAK1B,SAAS,YAAY,MAAuB;AAE1C,MAAI,YAAY,KAAK,IAAI,EAAG,QAAO;AAGnC,QAAM,mBAAmB,CAAC,UAAU,UAAU,UAAU,UAAU,QAAQ;AAC1E,QAAM,QAAQ,KAAK,YAAY;AAC/B,MAAI,iBAAiB,KAAK,OAAK,MAAM,SAAS,CAAC,CAAC,EAAG,QAAO;AAG1D,QAAM,UAAU,KAAK,MAAM,eAAe,KAAK,CAAC,GAAG;AACnD,QAAM,cAAc,KAAK,MAAM,+CAA+C,KAAK,CAAC,GAAG;AAEvF,MAAI,aAAa,KAAK,SAAS,aAAa,IAAK,QAAO;AAExD,SAAO;AACT;AAKA,SAAS,eAAe,MAKtB;AACA,QAAM,QAAQ,KAAK,YAAY;AAE/B,SAAO;AAAA,IACL,SAAS,iEAAiE,KAAK,IAAI;AAAA,IACnF,SAAS,8EAA8E,KAAK,IAAI;AAAA,IAChG,gBAAgB,oEAAoE,KAAK,IAAI,KAC7E,+CAA+C,KAAK,KAAK;AAAA,IACzE,aAAa,uDAAuD,KAAK,KAAK,KACjE,gBAAgB,KAAK,IAAI;AAAA,EACxC;AACF;AAKA,SAAS,eAAe,MAAsB;AAE5C,QAAM,WAAW;AAAA,IACf;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,EACF;AAEA,MAAI,QAAQ;AACZ,aAAW,WAAW,UAAU;AAC9B,UAAM,UAAU,KAAK,MAAM,OAAO;AAClC,QAAI,QAAS,UAAS,QAAQ;AAAA,EAChC;AAEA,SAAO;AACT;AAKA,SAAS,eACP,OACA,QACQ;AACR,MAAI,QAAQ;AAGZ,QAAM,SAAS,OAAO,OAAO,OAAK,EAAE,SAAS,OAAO,EAAE;AACtD,QAAM,WAAW,OAAO,OAAO,OAAK,EAAE,SAAS,SAAS,EAAE;AAE1D,WAAS,SAAS;AAClB,WAAS,WAAW;AAGpB,MAAI,MAAM,QAAS,UAAS;AAC5B,MAAI,MAAM,QAAS,UAAS;AAC5B,MAAI,MAAM,eAAgB,UAAS;AACnC,MAAI,MAAM,YAAa,UAAS;AAGhC,MAAI,MAAM,YAAY,mBAAmB;AACvC,aAAS,OAAO,IAAI,MAAM,YAAY;AAAA,EACxC;AAGA,MAAI,MAAM,YAAY,mBAAmB;AACvC,aAAS;AAAA,EACX;AAGA,MAAI,MAAM,gBAAgB,GAAG;AAC3B,aAAS;AAAA,EACX;AAEA,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;AAKO,SAAS,MAAM,QAA+B;AACnD,QAAM,SAAyB,CAAC;AAChC,QAAM,UAAU,OAAO,KAAK;AAG5B,QAAM,iBAAiB,QAAQ;AAC/B,QAAM,QAAQ,QAAQ,MAAM,KAAK,EAAE,OAAO,OAAK,EAAE,SAAS,CAAC;AAC3D,QAAM,YAAY,MAAM;AACxB,QAAM,iBAAiB,QAAQ,MAAM,SAAS,KAAK,CAAC,GAAG,UAAU;AACjE,QAAM,gBAAgB,eAAe,OAAO;AAC5C,QAAM,WAAW,eAAe,OAAO;AAGvC,MAAI,mBAAmB,GAAG;AACxB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH,WAAW,iBAAiB,gBAAgB;AAC1C,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS,wBAAwB,cAAc,mBAAmB,cAAc;AAAA,IAClF,CAAC;AAAA,EACH;AAEA,MAAI,YAAY,KAAK,YAAY,gBAAgB;AAC/C,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS,8BAA8B,SAAS,uBAAuB,iBAAiB;AAAA,IAC1F,CAAC;AAAA,EACH;AAGA,MAAI,YAAY,OAAO,GAAG;AACxB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,MAAI,CAAC,SAAS,WAAW,CAAC,SAAS,SAAS;AAC1C,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,QAAM,WAAW;AAAA,IACf,EAAE,MAAM,KAAK,OAAO,IAAI;AAAA,IACxB,EAAE,MAAM,KAAK,OAAO,IAAI;AAAA,IACxB,EAAE,MAAM,KAAK,OAAO,IAAI;AAAA,EAC1B;AAEA,aAAW,EAAE,MAAM,MAAM,KAAK,UAAU;AACtC,UAAM,aAAa,QAAQ,MAAM,IAAI,OAAO,KAAK,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG;AACtE,UAAM,cAAc,QAAQ,MAAM,IAAI,OAAO,KAAK,KAAK,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG;AAExE,QAAI,cAAc,YAAY;AAC5B,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,MAAM;AAAA,QACN,SAAS,cAAc,IAAI,GAAG,KAAK,cAAc,SAAS,UAAU,UAAU;AAAA,MAChF,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,YAAY,MAAM,OAAO,OAAK,EAAE,SAAS,GAAG;AAClD,MAAI,UAAU,SAAS,GAAG;AACxB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAEA,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACL;AAEA,QAAM,QAAQ,eAAe,OAAO,MAAM;AAC1C,QAAM,YAAY,OAAO,KAAK,OAAK,EAAE,SAAS,OAAO;AAErD,SAAO;AAAA,IACL,OAAO,CAAC;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAKO,SAAS,SAAS,QAAsB;AAC7C,QAAM,SAAS,MAAM,MAAM;AAE3B,MAAI,CAAC,OAAO,OAAO;AACjB,UAAM,SAAS,OAAO,OACnB,OAAO,OAAK,EAAE,SAAS,OAAO,EAC9B,IAAI,OAAK,EAAE,OAAO,EAClB,KAAK,IAAI;AAEZ,UAAM,IAAI,MAAM,mBAAmB,MAAM,EAAE;AAAA,EAC7C;AACF;AAKO,SAAS,QAAQ,QAAyB;AAC/C,SAAO,MAAM,MAAM,EAAE;AACvB;AAKO,SAAS,eAAe,QAA0B;AACvD,QAAM,SAAS,MAAM,MAAM;AAC3B,QAAM,cAAwB,CAAC;AAG/B,cAAY;AAAA,IACV,GAAG,OAAO,OACP,OAAO,OAAK,EAAE,SAAS,gBAAgB,EAAE,SAAS,SAAS,EAC3D,IAAI,OAAK,EAAE,OAAO;AAAA,EACvB;AAGA,MAAI,CAAC,OAAO,MAAM,SAAS;AACzB,gBAAY,KAAK,6CAA6C;AAAA,EAChE;AAEA,MAAI,CAAC,OAAO,MAAM,kBAAkB,OAAO,MAAM,YAAY,IAAI;AAC/D,gBAAY,KAAK,yDAAyD;AAAA,EAC5E;AAEA,MAAI,CAAC,OAAO,MAAM,eAAe,OAAO,MAAM,YAAY,KAAK;AAC7D,gBAAY,KAAK,4CAA4C;AAAA,EAC/D;AAEA,MAAI,OAAO,MAAM,kBAAkB,KAAK,OAAO,MAAM,YAAY,IAAI;AACnE,gBAAY,KAAK,gEAAgE;AAAA,EACnF;AAEA,SAAO;AACT;","names":[]}

package/dist/quality/index.mjs

@@ -0,0 +1,184 @@
+// src/quality/index.ts
+var MIN_CHAR_COUNT = 20;
+var MIN_WORD_COUNT = 5;
+var OPTIMAL_MIN_WORDS = 20;
+var OPTIMAL_MAX_WORDS = 2e3;
+function isGibberish(text) {
+  if (/(.)\1{4,}/.test(text)) return true;
+  const keyboardPatterns = ["qwerty", "asdfgh", "zxcvbn", "qwertz", "azerty"];
+  const lower = text.toLowerCase();
+  if (keyboardPatterns.some((p) => lower.includes(p))) return true;
+  const vowels = (text.match(/[aeiouAEIOU]/g) || []).length;
+  const consonants = (text.match(/[bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ]/g) || []).length;
+  if (consonants > 0 && vowels / consonants < 0.1) return true;
+  return false;
+}
+function detectPatterns(text) {
+  const lower = text.toLowerCase();
+  return {
+    hasRole: /\b(act as|you are|imagine you|pretend to be|role:|persona:)\b/i.test(text),
+    hasTask: /\b(your task|you (will|should|must)|please|help me|i need|i want you to)\b/i.test(text),
+    hasConstraints: /\b(do not|don't|never|always|must|should not|avoid|only|limit)\b/i.test(text) || /\b(rule|constraint|requirement|guideline)\b/i.test(lower),
+    hasExamples: /\b(example|for instance|such as|e\.g\.|like this)\b/i.test(lower) || /```[\s\S]*```/.test(text)
+  };
+}
+function countVariables(text) {
+  const patterns = [
+    /\$\{[^}]+\}/g,
+    // ${var}
+    /\{\{[^}]+\}\}/g,
+    // {{var}}
+    /\[\[[^\]]+\]\]/g,
+    // [[var]]
+    /\[[A-Z][A-Z0-9_\s]*\]/g
+    // [VAR]
+  ];
+  let count = 0;
+  for (const pattern of patterns) {
+    const matches = text.match(pattern);
+    if (matches) count += matches.length;
+  }
+  return count;
+}
+function calculateScore(stats, issues) {
+  let score = 1;
+  const errors = issues.filter((i) => i.type === "error").length;
+  const warnings = issues.filter((i) => i.type === "warning").length;
+  score -= errors * 0.2;
+  score -= warnings * 0.05;
+  if (stats.hasRole) score += 0.05;
+  if (stats.hasTask) score += 0.05;
+  if (stats.hasConstraints) score += 0.03;
+  if (stats.hasExamples) score += 0.05;
+  if (stats.wordCount < OPTIMAL_MIN_WORDS) {
+    score -= 0.1 * (1 - stats.wordCount / OPTIMAL_MIN_WORDS);
+  }
+  if (stats.wordCount > OPTIMAL_MAX_WORDS) {
+    score -= 0.05;
+  }
+  if (stats.variableCount > 0) {
+    score += 0.05;
+  }
+  return Math.max(0, Math.min(1, score));
+}
+function check(prompt) {
+  const issues = [];
+  const trimmed = prompt.trim();
+  const characterCount = trimmed.length;
+  const words = trimmed.split(/\s+/).filter((w) => w.length > 0);
+  const wordCount = words.length;
+  const sentenceCount = (trimmed.match(/[.!?]+/g) || []).length || 1;
+  const variableCount = countVariables(trimmed);
+  const patterns = detectPatterns(trimmed);
+  if (characterCount === 0) {
+    issues.push({
+      type: "error",
+      code: "EMPTY",
+      message: "Prompt is empty"
+    });
+  } else if (characterCount < MIN_CHAR_COUNT) {
+    issues.push({
+      type: "error",
+      code: "TOO_SHORT",
+      message: `Prompt is too short (${characterCount} chars, minimum ${MIN_CHAR_COUNT})`
+    });
+  }
+  if (wordCount > 0 && wordCount < MIN_WORD_COUNT) {
+    issues.push({
+      type: "warning",
+      code: "FEW_WORDS",
+      message: `Prompt has very few words (${wordCount} words, recommended ${OPTIMAL_MIN_WORDS}+)`
+    });
+  }
+  if (isGibberish(trimmed)) {
+    issues.push({
+      type: "error",
+      code: "GIBBERISH",
+      message: "Prompt appears to contain gibberish or random characters"
+    });
+  }
+  if (!patterns.hasTask && !patterns.hasRole) {
+    issues.push({
+      type: "suggestion",
+      code: "NO_CLEAR_INSTRUCTION",
+      message: "Consider adding a clear task or role definition"
+    });
+  }
+  const brackets = [
+    { open: "{", close: "}" },
+    { open: "[", close: "]" },
+    { open: "(", close: ")" }
+  ];
+  for (const { open, close } of brackets) {
+    const openCount = (trimmed.match(new RegExp(`\\${open}`, "g")) || []).length;
+    const closeCount = (trimmed.match(new RegExp(`\\${close}`, "g")) || []).length;
+    if (openCount !== closeCount) {
+      issues.push({
+        type: "warning",
+        code: "UNBALANCED_BRACKETS",
+        message: `Unbalanced ${open}${close} brackets (${openCount} open, ${closeCount} close)`
+      });
+    }
+  }
+  const lines = trimmed.split("\n");
+  const longLines = lines.filter((l) => l.length > 500);
+  if (longLines.length > 0) {
+    issues.push({
+      type: "suggestion",
+      code: "LONG_LINES",
+      message: "Some lines are very long. Consider breaking them up for readability."
+    });
+  }
+  const stats = {
+    characterCount,
+    wordCount,
+    sentenceCount,
+    variableCount,
+    ...patterns
+  };
+  const score = calculateScore(stats, issues);
+  const hasErrors = issues.some((i) => i.type === "error");
+  return {
+    valid: !hasErrors,
+    score,
+    issues,
+    stats
+  };
+}
+function validate(prompt) {
+  const result = check(prompt);
+  if (!result.valid) {
+    const errors = result.issues.filter((i) => i.type === "error").map((i) => i.message).join("; ");
+    throw new Error(`Invalid prompt: ${errors}`);
+  }
+}
+function isValid(prompt) {
+  return check(prompt).valid;
+}
+function getSuggestions(prompt) {
+  const result = check(prompt);
+  const suggestions = [];
+  suggestions.push(
+    ...result.issues.filter((i) => i.type === "suggestion" || i.type === "warning").map((i) => i.message)
+  );
+  if (!result.stats.hasRole) {
+    suggestions.push('Add a role definition (e.g., "Act as a...")');
+  }
+  if (!result.stats.hasConstraints && result.stats.wordCount > 50) {
+    suggestions.push("Consider adding constraints or rules for better control");
+  }
+  if (!result.stats.hasExamples && result.stats.wordCount > 100) {
+    suggestions.push("Adding examples can improve output quality");
+  }
+  if (result.stats.variableCount === 0 && result.stats.wordCount > 30) {
+    suggestions.push("Consider adding variables (${var}) to make the prompt reusable");
+  }
+  return suggestions;
+}
+export {
+  check,
+  getSuggestions,
+  isValid,
+  validate
+};
+//# sourceMappingURL=index.mjs.map

package/dist/quality/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/quality/index.ts"],"sourcesContent":["/**\n * Prompt Quality Checker - Local validation for prompt quality\n * \n * @example\n * ```ts\n * import { quality } from 'prompts.chat';\n * \n * const result = quality.check(\"Act as a developer...\");\n * console.log(result.score); // 0.85\n * console.log(result.issues); // []\n * ```\n */\n\nexport interface QualityIssue {\n  type: 'error' | 'warning' | 'suggestion';\n  code: string;\n  message: string;\n  position?: { start: number; end: number };\n}\n\nexport interface QualityResult {\n  valid: boolean;\n  score: number; // 0-1\n  issues: QualityIssue[];\n  stats: {\n    characterCount: number;\n    wordCount: number;\n    sentenceCount: number;\n    variableCount: number;\n    hasRole: boolean;\n    hasTask: boolean;\n    hasConstraints: boolean;\n    hasExamples: boolean;\n  };\n}\n\n// Minimum thresholds\nconst MIN_CHAR_COUNT = 20;\nconst MIN_WORD_COUNT = 5;\nconst OPTIMAL_MIN_WORDS = 20;\nconst OPTIMAL_MAX_WORDS = 2000;\n\n/**\n * Check if text looks like gibberish\n */\nfunction isGibberish(text: string): boolean {\n  // Check for repeated characters\n  if (/(.)\\1{4,}/.test(text)) return true;\n  \n  // Check for keyboard patterns\n  const keyboardPatterns = ['qwerty', 'asdfgh', 'zxcvbn', 'qwertz', 'azerty'];\n  const lower = text.toLowerCase();\n  if (keyboardPatterns.some(p => lower.includes(p))) return true;\n  \n  // Check consonant/vowel ratio (gibberish often has unusual ratios)\n  const vowels = (text.match(/[aeiouAEIOU]/g) || []).length;\n  const consonants = (text.match(/[bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ]/g) || []).length;\n  \n  if (consonants > 0 && vowels / consonants < 0.1) return true;\n  \n  return false;\n}\n\n/**\n * Detect common prompt patterns\n */\nfunction detectPatterns(text: string): {\n  hasRole: boolean;\n  hasTask: boolean;\n  hasConstraints: boolean;\n  hasExamples: boolean;\n} {\n  const lower = text.toLowerCase();\n  \n  return {\n    hasRole: /\\b(act as|you are|imagine you|pretend to be|role:|persona:)\\b/i.test(text),\n    hasTask: /\\b(your task|you (will|should|must)|please|help me|i need|i want you to)\\b/i.test(text),\n    hasConstraints: /\\b(do not|don't|never|always|must|should not|avoid|only|limit)\\b/i.test(text) ||\n                    /\\b(rule|constraint|requirement|guideline)\\b/i.test(lower),\n    hasExamples: /\\b(example|for instance|such as|e\\.g\\.|like this)\\b/i.test(lower) ||\n                 /```[\\s\\S]*```/.test(text),\n  };\n}\n\n/**\n * Count variables in the prompt\n */\nfunction countVariables(text: string): number {\n  // Match various variable formats\n  const patterns = [\n    /\\$\\{[^}]+\\}/g,           // ${var}\n    /\\{\\{[^}]+\\}\\}/g,         // {{var}}\n    /\\[\\[[^\\]]+\\]\\]/g,        // [[var]]\n    /\\[[A-Z][A-Z0-9_\\s]*\\]/g, // [VAR]\n  ];\n  \n  let count = 0;\n  for (const pattern of patterns) {\n    const matches = text.match(pattern);\n    if (matches) count += matches.length;\n  }\n  \n  return count;\n}\n\n/**\n * Calculate quality score based on various factors\n */\nfunction calculateScore(\n  stats: QualityResult['stats'],\n  issues: QualityIssue[]\n): number {\n  let score = 1.0;\n  \n  // Deduct for errors\n  const errors = issues.filter(i => i.type === 'error').length;\n  const warnings = issues.filter(i => i.type === 'warning').length;\n  \n  score -= errors * 0.2;\n  score -= warnings * 0.05;\n  \n  // Bonus for good structure\n  if (stats.hasRole) score += 0.05;\n  if (stats.hasTask) score += 0.05;\n  if (stats.hasConstraints) score += 0.03;\n  if (stats.hasExamples) score += 0.05;\n  \n  // Penalty for being too short\n  if (stats.wordCount < OPTIMAL_MIN_WORDS) {\n    score -= 0.1 * (1 - stats.wordCount / OPTIMAL_MIN_WORDS);\n  }\n  \n  // Slight penalty for being very long\n  if (stats.wordCount > OPTIMAL_MAX_WORDS) {\n    score -= 0.05;\n  }\n  \n  // Bonus for having variables (indicates reusability)\n  if (stats.variableCount > 0) {\n    score += 0.05;\n  }\n  \n  return Math.max(0, Math.min(1, score));\n}\n\n/**\n * Check prompt quality locally (no API needed)\n */\nexport function check(prompt: string): QualityResult {\n  const issues: QualityIssue[] = [];\n  const trimmed = prompt.trim();\n  \n  // Basic stats\n  const characterCount = trimmed.length;\n  const words = trimmed.split(/\\s+/).filter(w => w.length > 0);\n  const wordCount = words.length;\n  const sentenceCount = (trimmed.match(/[.!?]+/g) || []).length || 1;\n  const variableCount = countVariables(trimmed);\n  const patterns = detectPatterns(trimmed);\n  \n  // Check for empty or too short\n  if (characterCount === 0) {\n    issues.push({\n      type: 'error',\n      code: 'EMPTY',\n      message: 'Prompt is empty',\n    });\n  } else if (characterCount < MIN_CHAR_COUNT) {\n    issues.push({\n      type: 'error',\n      code: 'TOO_SHORT',\n      message: `Prompt is too short (${characterCount} chars, minimum ${MIN_CHAR_COUNT})`,\n    });\n  }\n  \n  if (wordCount > 0 && wordCount < MIN_WORD_COUNT) {\n    issues.push({\n      type: 'warning',\n      code: 'FEW_WORDS',\n      message: `Prompt has very few words (${wordCount} words, recommended ${OPTIMAL_MIN_WORDS}+)`,\n    });\n  }\n  \n  // Check for gibberish\n  if (isGibberish(trimmed)) {\n    issues.push({\n      type: 'error',\n      code: 'GIBBERISH',\n      message: 'Prompt appears to contain gibberish or random characters',\n    });\n  }\n  \n  // Check for common issues\n  if (!patterns.hasTask && !patterns.hasRole) {\n    issues.push({\n      type: 'suggestion',\n      code: 'NO_CLEAR_INSTRUCTION',\n      message: 'Consider adding a clear task or role definition',\n    });\n  }\n  \n  // Check for unbalanced brackets/quotes\n  const brackets = [\n    { open: '{', close: '}' },\n    { open: '[', close: ']' },\n    { open: '(', close: ')' },\n  ];\n  \n  for (const { open, close } of brackets) {\n    const openCount = (trimmed.match(new RegExp(`\\\\${open}`, 'g')) || []).length;\n    const closeCount = (trimmed.match(new RegExp(`\\\\${close}`, 'g')) || []).length;\n    \n    if (openCount !== closeCount) {\n      issues.push({\n        type: 'warning',\n        code: 'UNBALANCED_BRACKETS',\n        message: `Unbalanced ${open}${close} brackets (${openCount} open, ${closeCount} close)`,\n      });\n    }\n  }\n  \n  // Check for very long lines (readability)\n  const lines = trimmed.split('\\n');\n  const longLines = lines.filter(l => l.length > 500);\n  if (longLines.length > 0) {\n    issues.push({\n      type: 'suggestion',\n      code: 'LONG_LINES',\n      message: 'Some lines are very long. Consider breaking them up for readability.',\n    });\n  }\n  \n  const stats = {\n    characterCount,\n    wordCount,\n    sentenceCount,\n    variableCount,\n    ...patterns,\n  };\n  \n  const score = calculateScore(stats, issues);\n  const hasErrors = issues.some(i => i.type === 'error');\n  \n  return {\n    valid: !hasErrors,\n    score,\n    issues,\n    stats,\n  };\n}\n\n/**\n * Validate a prompt and throw if invalid\n */\nexport function validate(prompt: string): void {\n  const result = check(prompt);\n  \n  if (!result.valid) {\n    const errors = result.issues\n      .filter(i => i.type === 'error')\n      .map(i => i.message)\n      .join('; ');\n    \n    throw new Error(`Invalid prompt: ${errors}`);\n  }\n}\n\n/**\n * Check if a prompt is valid\n */\nexport function isValid(prompt: string): boolean {\n  return check(prompt).valid;\n}\n\n/**\n * Get suggestions for improving a prompt\n */\nexport function getSuggestions(prompt: string): string[] {\n  const result = check(prompt);\n  const suggestions: string[] = [];\n  \n  // From issues\n  suggestions.push(\n    ...result.issues\n      .filter(i => i.type === 'suggestion' || i.type === 'warning')\n      .map(i => i.message)\n  );\n  \n  // Additional suggestions based on stats\n  if (!result.stats.hasRole) {\n    suggestions.push('Add a role definition (e.g., \"Act as a...\")');\n  }\n  \n  if (!result.stats.hasConstraints && result.stats.wordCount > 50) {\n    suggestions.push('Consider adding constraints or rules for better control');\n  }\n  \n  if (!result.stats.hasExamples && result.stats.wordCount > 100) {\n    suggestions.push('Adding examples can improve output quality');\n  }\n  \n  if (result.stats.variableCount === 0 && result.stats.wordCount > 30) {\n    suggestions.push('Consider adding variables (${var}) to make the prompt reusable');\n  }\n  \n  return suggestions;\n}\n"],"mappings":";AAqCA,IAAM,iBAAiB;AACvB,IAAM,iBAAiB;AACvB,IAAM,oBAAoB;AAC1B,IAAM,oBAAoB;AAK1B,SAAS,YAAY,MAAuB;AAE1C,MAAI,YAAY,KAAK,IAAI,EAAG,QAAO;AAGnC,QAAM,mBAAmB,CAAC,UAAU,UAAU,UAAU,UAAU,QAAQ;AAC1E,QAAM,QAAQ,KAAK,YAAY;AAC/B,MAAI,iBAAiB,KAAK,OAAK,MAAM,SAAS,CAAC,CAAC,EAAG,QAAO;AAG1D,QAAM,UAAU,KAAK,MAAM,eAAe,KAAK,CAAC,GAAG;AACnD,QAAM,cAAc,KAAK,MAAM,+CAA+C,KAAK,CAAC,GAAG;AAEvF,MAAI,aAAa,KAAK,SAAS,aAAa,IAAK,QAAO;AAExD,SAAO;AACT;AAKA,SAAS,eAAe,MAKtB;AACA,QAAM,QAAQ,KAAK,YAAY;AAE/B,SAAO;AAAA,IACL,SAAS,iEAAiE,KAAK,IAAI;AAAA,IACnF,SAAS,8EAA8E,KAAK,IAAI;AAAA,IAChG,gBAAgB,oEAAoE,KAAK,IAAI,KAC7E,+CAA+C,KAAK,KAAK;AAAA,IACzE,aAAa,uDAAuD,KAAK,KAAK,KACjE,gBAAgB,KAAK,IAAI;AAAA,EACxC;AACF;AAKA,SAAS,eAAe,MAAsB;AAE5C,QAAM,WAAW;AAAA,IACf;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,IACA;AAAA;AAAA,EACF;AAEA,MAAI,QAAQ;AACZ,aAAW,WAAW,UAAU;AAC9B,UAAM,UAAU,KAAK,MAAM,OAAO;AAClC,QAAI,QAAS,UAAS,QAAQ;AAAA,EAChC;AAEA,SAAO;AACT;AAKA,SAAS,eACP,OACA,QACQ;AACR,MAAI,QAAQ;AAGZ,QAAM,SAAS,OAAO,OAAO,OAAK,EAAE,SAAS,OAAO,EAAE;AACtD,QAAM,WAAW,OAAO,OAAO,OAAK,EAAE,SAAS,SAAS,EAAE;AAE1D,WAAS,SAAS;AAClB,WAAS,WAAW;AAGpB,MAAI,MAAM,QAAS,UAAS;AAC5B,MAAI,MAAM,QAAS,UAAS;AAC5B,MAAI,MAAM,eAAgB,UAAS;AACnC,MAAI,MAAM,YAAa,UAAS;AAGhC,MAAI,MAAM,YAAY,mBAAmB;AACvC,aAAS,OAAO,IAAI,MAAM,YAAY;AAAA,EACxC;AAGA,MAAI,MAAM,YAAY,mBAAmB;AACvC,aAAS;AAAA,EACX;AAGA,MAAI,MAAM,gBAAgB,GAAG;AAC3B,aAAS;AAAA,EACX;AAEA,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;AAKO,SAAS,MAAM,QAA+B;AACnD,QAAM,SAAyB,CAAC;AAChC,QAAM,UAAU,OAAO,KAAK;AAG5B,QAAM,iBAAiB,QAAQ;AAC/B,QAAM,QAAQ,QAAQ,MAAM,KAAK,EAAE,OAAO,OAAK,EAAE,SAAS,CAAC;AAC3D,QAAM,YAAY,MAAM;AACxB,QAAM,iBAAiB,QAAQ,MAAM,SAAS,KAAK,CAAC,GAAG,UAAU;AACjE,QAAM,gBAAgB,eAAe,OAAO;AAC5C,QAAM,WAAW,eAAe,OAAO;AAGvC,MAAI,mBAAmB,GAAG;AACxB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH,WAAW,iBAAiB,gBAAgB;AAC1C,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS,wBAAwB,cAAc,mBAAmB,cAAc;AAAA,IAClF,CAAC;AAAA,EACH;AAEA,MAAI,YAAY,KAAK,YAAY,gBAAgB;AAC/C,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS,8BAA8B,SAAS,uBAAuB,iBAAiB;AAAA,IAC1F,CAAC;AAAA,EACH;AAGA,MAAI,YAAY,OAAO,GAAG;AACxB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,MAAI,CAAC,SAAS,WAAW,CAAC,SAAS,SAAS;AAC1C,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAGA,QAAM,WAAW;AAAA,IACf,EAAE,MAAM,KAAK,OAAO,IAAI;AAAA,IACxB,EAAE,MAAM,KAAK,OAAO,IAAI;AAAA,IACxB,EAAE,MAAM,KAAK,OAAO,IAAI;AAAA,EAC1B;AAEA,aAAW,EAAE,MAAM,MAAM,KAAK,UAAU;AACtC,UAAM,aAAa,QAAQ,MAAM,IAAI,OAAO,KAAK,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG;AACtE,UAAM,cAAc,QAAQ,MAAM,IAAI,OAAO,KAAK,KAAK,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG;AAExE,QAAI,cAAc,YAAY;AAC5B,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,MAAM;AAAA,QACN,SAAS,cAAc,IAAI,GAAG,KAAK,cAAc,SAAS,UAAU,UAAU;AAAA,MAChF,CAAC;AAAA,IACH;AAAA,EACF;AAGA,QAAM,QAAQ,QAAQ,MAAM,IAAI;AAChC,QAAM,YAAY,MAAM,OAAO,OAAK,EAAE,SAAS,GAAG;AAClD,MAAI,UAAU,SAAS,GAAG;AACxB,WAAO,KAAK;AAAA,MACV,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAEA,QAAM,QAAQ;AAAA,IACZ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAG;AAAA,EACL;AAEA,QAAM,QAAQ,eAAe,OAAO,MAAM;AAC1C,QAAM,YAAY,OAAO,KAAK,OAAK,EAAE,SAAS,OAAO;AAErD,SAAO;AAAA,IACL,OAAO,CAAC;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAKO,SAAS,SAAS,QAAsB;AAC7C,QAAM,SAAS,MAAM,MAAM;AAE3B,MAAI,CAAC,OAAO,OAAO;AACjB,UAAM,SAAS,OAAO,OACnB,OAAO,OAAK,EAAE,SAAS,OAAO,EAC9B,IAAI,OAAK,EAAE,OAAO,EAClB,KAAK,IAAI;AAEZ,UAAM,IAAI,MAAM,mBAAmB,MAAM,EAAE;AAAA,EAC7C;AACF;AAKO,SAAS,QAAQ,QAAyB;AAC/C,SAAO,MAAM,MAAM,EAAE;AACvB;AAKO,SAAS,eAAe,QAA0B;AACvD,QAAM,SAAS,MAAM,MAAM;AAC3B,QAAM,cAAwB,CAAC;AAG/B,cAAY;AAAA,IACV,GAAG,OAAO,OACP,OAAO,OAAK,EAAE,SAAS,gBAAgB,EAAE,SAAS,SAAS,EAC3D,IAAI,OAAK,EAAE,OAAO;AAAA,EACvB;AAGA,MAAI,CAAC,OAAO,MAAM,SAAS;AACzB,gBAAY,KAAK,6CAA6C;AAAA,EAChE;AAEA,MAAI,CAAC,OAAO,MAAM,kBAAkB,OAAO,MAAM,YAAY,IAAI;AAC/D,gBAAY,KAAK,yDAAyD;AAAA,EAC5E;AAEA,MAAI,CAAC,OAAO,MAAM,eAAe,OAAO,MAAM,YAAY,KAAK;AAC7D,gBAAY,KAAK,4CAA4C;AAAA,EAC/D;AAEA,MAAI,OAAO,MAAM,kBAAkB,KAAK,OAAO,MAAM,YAAY,IAAI;AACnE,gBAAY,KAAK,gEAAgE;AAAA,EACnF;AAEA,SAAO;AACT;","names":[]}

package/dist/similarity/index.d.mts

@@ -0,0 +1 @@
+export { b as calculate, c as calculateSimilarity, d as deduplicate, f as findDuplicates, g as getContentFingerprint, e as isDuplicate, a as isSimilarContent, n as normalizeContent } from '../index-BEIO8LCd.mjs';

package/dist/similarity/index.d.ts

@@ -0,0 +1 @@
+export { b as calculate, c as calculateSimilarity, d as deduplicate, f as findDuplicates, g as getContentFingerprint, e as isDuplicate, a as isSimilarContent, n as normalizeContent } from '../index-BEIO8LCd.js';

package/dist/similarity/index.js

@@ -0,0 +1,123 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/similarity/index.ts
+var similarity_exports = {};
+__export(similarity_exports, {
+  calculate: () => calculate,
+  calculateSimilarity: () => calculateSimilarity,
+  deduplicate: () => deduplicate,
+  findDuplicates: () => findDuplicates,
+  getContentFingerprint: () => getContentFingerprint,
+  isDuplicate: () => isDuplicate,
+  isSimilarContent: () => isSimilarContent,
+  normalizeContent: () => normalizeContent
+});
+module.exports = __toCommonJS(similarity_exports);
+function normalizeContent(content) {
+  return content.replace(/\$\{[^}]+\}/g, "").replace(/\[[^\]]+\]/g, "").replace(/<[^>]+>/g, "").toLowerCase().replace(/[^\w\s]/g, "").replace(/\s+/g, " ").trim();
+}
+function jaccardSimilarity(str1, str2) {
+  const set1 = new Set(str1.split(" ").filter(Boolean));
+  const set2 = new Set(str2.split(" ").filter(Boolean));
+  if (set1.size === 0 && set2.size === 0) return 1;
+  if (set1.size === 0 || set2.size === 0) return 0;
+  const intersection = new Set([...set1].filter((x) => set2.has(x)));
+  const union = /* @__PURE__ */ new Set([...set1, ...set2]);
+  return intersection.size / union.size;
+}
+function ngramSimilarity(str1, str2, n = 3) {
+  const getNgrams = (str) => {
+    const ngrams = /* @__PURE__ */ new Set();
+    const padded = " ".repeat(n - 1) + str + " ".repeat(n - 1);
+    for (let i = 0; i <= padded.length - n; i++) {
+      ngrams.add(padded.slice(i, i + n));
+    }
+    return ngrams;
+  };
+  const ngrams1 = getNgrams(str1);
+  const ngrams2 = getNgrams(str2);
+  if (ngrams1.size === 0 && ngrams2.size === 0) return 1;
+  if (ngrams1.size === 0 || ngrams2.size === 0) return 0;
+  const intersection = new Set([...ngrams1].filter((x) => ngrams2.has(x)));
+  const union = /* @__PURE__ */ new Set([...ngrams1, ...ngrams2]);
+  return intersection.size / union.size;
+}
+function calculateSimilarity(content1, content2) {
+  const normalized1 = normalizeContent(content1);
+  const normalized2 = normalizeContent(content2);
+  if (normalized1 === normalized2) return 1;
+  if (!normalized1 || !normalized2) return 0;
+  const jaccard = jaccardSimilarity(normalized1, normalized2);
+  const ngram = ngramSimilarity(normalized1, normalized2);
+  return jaccard * 0.6 + ngram * 0.4;
+}
+var calculate = calculateSimilarity;
+function isSimilarContent(content1, content2, threshold = 0.85) {
+  return calculateSimilarity(content1, content2) >= threshold;
+}
+var isDuplicate = isSimilarContent;
+function getContentFingerprint(content) {
+  const normalized = normalizeContent(content);
+  return normalized.slice(0, 500);
+}
+function findDuplicates(prompts, threshold = 0.85) {
+  const groups = [];
+  const used = /* @__PURE__ */ new Set();
+  for (let i = 0; i < prompts.length; i++) {
+    if (used.has(i)) continue;
+    const group = [prompts[i]];
+    used.add(i);
+    for (let j = i + 1; j < prompts.length; j++) {
+      if (used.has(j)) continue;
+      if (isSimilarContent(prompts[i].content, prompts[j].content, threshold)) {
+        group.push(prompts[j]);
+        used.add(j);
+      }
+    }
+    if (group.length > 1) {
+      groups.push(group);
+    }
+  }
+  return groups;
+}
+function deduplicate(prompts, threshold = 0.85) {
+  const result = [];
+  for (const prompt of prompts) {
+    const isDupe = result.some(
+      (existing) => isSimilarContent(existing.content, prompt.content, threshold)
+    );
+    if (!isDupe) {
+      result.push(prompt);
+    }
+  }
+  return result;
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  calculate,
+  calculateSimilarity,
+  deduplicate,
+  findDuplicates,
+  getContentFingerprint,
+  isDuplicate,
+  isSimilarContent,
+  normalizeContent
+});
+//# sourceMappingURL=index.js.map

package/dist/similarity/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/similarity/index.ts"],"sourcesContent":["/**\n * Content similarity utilities for duplicate detection\n */\n\n/**\n * Normalize content for comparison by:\n * - Removing variables (${...} patterns)\n * - Converting to lowercase\n * - Removing extra whitespace\n * - Removing punctuation\n */\nexport function normalizeContent(content: string): string {\n  return content\n    // Remove variables like ${variable} or ${variable:default}\n    .replace(/\\$\\{[^}]+\\}/g, \"\")\n    // Remove common placeholder patterns like [placeholder] or <placeholder>\n    .replace(/\\[[^\\]]+\\]/g, \"\")\n    .replace(/<[^>]+>/g, \"\")\n    // Convert to lowercase\n    .toLowerCase()\n    // Remove punctuation\n    .replace(/[^\\w\\s]/g, \"\")\n    // Normalize whitespace\n    .replace(/\\s+/g, \" \")\n    .trim();\n}\n\n/**\n * Calculate Jaccard similarity between two strings\n * Returns a value between 0 (completely different) and 1 (identical)\n */\nfunction jaccardSimilarity(str1: string, str2: string): number {\n  const set1 = new Set(str1.split(\" \").filter(Boolean));\n  const set2 = new Set(str2.split(\" \").filter(Boolean));\n  \n  if (set1.size === 0 && set2.size === 0) return 1;\n  if (set1.size === 0 || set2.size === 0) return 0;\n  \n  const intersection = new Set([...set1].filter(x => set2.has(x)));\n  const union = new Set([...set1, ...set2]);\n  \n  return intersection.size / union.size;\n}\n\n/**\n * Calculate n-gram similarity for better sequence matching\n * Uses trigrams (3-character sequences) by default\n */\nfunction ngramSimilarity(str1: string, str2: string, n: number = 3): number {\n  const getNgrams = (str: string): Set<string> => {\n    const ngrams = new Set<string>();\n    const padded = \" \".repeat(n - 1) + str + \" \".repeat(n - 1);\n    for (let i = 0; i <= padded.length - n; i++) {\n      ngrams.add(padded.slice(i, i + n));\n    }\n    return ngrams;\n  };\n  \n  const ngrams1 = getNgrams(str1);\n  const ngrams2 = getNgrams(str2);\n  \n  if (ngrams1.size === 0 && ngrams2.size === 0) return 1;\n  if (ngrams1.size === 0 || ngrams2.size === 0) return 0;\n  \n  const intersection = new Set([...ngrams1].filter(x => ngrams2.has(x)));\n  const union = new Set([...ngrams1, ...ngrams2]);\n  \n  return intersection.size / union.size;\n}\n\n/**\n * Combined similarity score using multiple algorithms\n * Returns a value between 0 (completely different) and 1 (identical)\n */\nexport function calculateSimilarity(content1: string, content2: string): number {\n  const normalized1 = normalizeContent(content1);\n  const normalized2 = normalizeContent(content2);\n  \n  // Exact match after normalization\n  if (normalized1 === normalized2) return 1;\n  \n  // Empty content edge case\n  if (!normalized1 || !normalized2) return 0;\n  \n  // Combine Jaccard (word-level) and n-gram (character-level) similarities\n  const jaccard = jaccardSimilarity(normalized1, normalized2);\n  const ngram = ngramSimilarity(normalized1, normalized2);\n  \n  // Weighted average: 60% Jaccard (word overlap), 40% n-gram (sequence similarity)\n  return jaccard * 0.6 + ngram * 0.4;\n}\n\n/**\n * Alias for calculateSimilarity\n */\nexport const calculate = calculateSimilarity;\n\n/**\n * Check if two contents are similar enough to be considered duplicates\n * Default threshold is 0.85 (85% similar)\n */\nexport function isSimilarContent(\n  content1: string, \n  content2: string, \n  threshold: number = 0.85\n): boolean {\n  return calculateSimilarity(content1, content2) >= threshold;\n}\n\n/**\n * Alias for isSimilarContent\n */\nexport const isDuplicate = isSimilarContent;\n\n/**\n * Get normalized content hash for database indexing/comparison\n * This is a simple hash for quick lookups before full similarity check\n */\nexport function getContentFingerprint(content: string): string {\n  const normalized = normalizeContent(content);\n  // Take first 500 chars of normalized content as fingerprint\n  return normalized.slice(0, 500);\n}\n\n/**\n * Find duplicates in an array of prompts\n * Returns groups of similar prompts\n */\nexport function findDuplicates<T extends { content: string }>(\n  prompts: T[],\n  threshold: number = 0.85\n): T[][] {\n  const groups: T[][] = [];\n  const used = new Set<number>();\n\n  for (let i = 0; i < prompts.length; i++) {\n    if (used.has(i)) continue;\n\n    const group: T[] = [prompts[i]];\n    used.add(i);\n\n    for (let j = i + 1; j < prompts.length; j++) {\n      if (used.has(j)) continue;\n\n      if (isSimilarContent(prompts[i].content, prompts[j].content, threshold)) {\n        group.push(prompts[j]);\n        used.add(j);\n      }\n    }\n\n    if (group.length > 1) {\n      groups.push(group);\n    }\n  }\n\n  return groups;\n}\n\n/**\n * Deduplicate an array of prompts, keeping the first occurrence\n */\nexport function deduplicate<T extends { content: string }>(\n  prompts: T[],\n  threshold: number = 0.85\n): T[] {\n  const result: T[] = [];\n\n  for (const prompt of prompts) {\n    const isDupe = result.some(existing => \n      isSimilarContent(existing.content, prompt.content, threshold)\n    );\n\n    if (!isDupe) {\n      result.push(prompt);\n    }\n  }\n\n  return result;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWO,SAAS,iBAAiB,SAAyB;AACxD,SAAO,QAEJ,QAAQ,gBAAgB,EAAE,EAE1B,QAAQ,eAAe,EAAE,EACzB,QAAQ,YAAY,EAAE,EAEtB,YAAY,EAEZ,QAAQ,YAAY,EAAE,EAEtB,QAAQ,QAAQ,GAAG,EACnB,KAAK;AACV;AAMA,SAAS,kBAAkB,MAAc,MAAsB;AAC7D,QAAM,OAAO,IAAI,IAAI,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO,CAAC;AACpD,QAAM,OAAO,IAAI,IAAI,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO,CAAC;AAEpD,MAAI,KAAK,SAAS,KAAK,KAAK,SAAS,EAAG,QAAO;AAC/C,MAAI,KAAK,SAAS,KAAK,KAAK,SAAS,EAAG,QAAO;AAE/C,QAAM,eAAe,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,OAAO,OAAK,KAAK,IAAI,CAAC,CAAC,CAAC;AAC/D,QAAM,QAAQ,oBAAI,IAAI,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;AAExC,SAAO,aAAa,OAAO,MAAM;AACnC;AAMA,SAAS,gBAAgB,MAAc,MAAc,IAAY,GAAW;AAC1E,QAAM,YAAY,CAAC,QAA6B;AAC9C,UAAM,SAAS,oBAAI,IAAY;AAC/B,UAAM,SAAS,IAAI,OAAO,IAAI,CAAC,IAAI,MAAM,IAAI,OAAO,IAAI,CAAC;AACzD,aAAS,IAAI,GAAG,KAAK,OAAO,SAAS,GAAG,KAAK;AAC3C,aAAO,IAAI,OAAO,MAAM,GAAG,IAAI,CAAC,CAAC;AAAA,IACnC;AACA,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,UAAU,IAAI;AAC9B,QAAM,UAAU,UAAU,IAAI;AAE9B,MAAI,QAAQ,SAAS,KAAK,QAAQ,SAAS,EAAG,QAAO;AACrD,MAAI,QAAQ,SAAS,KAAK,QAAQ,SAAS,EAAG,QAAO;AAErD,QAAM,eAAe,IAAI,IAAI,CAAC,GAAG,OAAO,EAAE,OAAO,OAAK,QAAQ,IAAI,CAAC,CAAC,CAAC;AACrE,QAAM,QAAQ,oBAAI,IAAI,CAAC,GAAG,SAAS,GAAG,OAAO,CAAC;AAE9C,SAAO,aAAa,OAAO,MAAM;AACnC;AAMO,SAAS,oBAAoB,UAAkB,UAA0B;AAC9E,QAAM,cAAc,iBAAiB,QAAQ;AAC7C,QAAM,cAAc,iBAAiB,QAAQ;AAG7C,MAAI,gBAAgB,YAAa,QAAO;AAGxC,MAAI,CAAC,eAAe,CAAC,YAAa,QAAO;AAGzC,QAAM,UAAU,kBAAkB,aAAa,WAAW;AAC1D,QAAM,QAAQ,gBAAgB,aAAa,WAAW;AAGtD,SAAO,UAAU,MAAM,QAAQ;AACjC;AAKO,IAAM,YAAY;AAMlB,SAAS,iBACd,UACA,UACA,YAAoB,MACX;AACT,SAAO,oBAAoB,UAAU,QAAQ,KAAK;AACpD;AAKO,IAAM,cAAc;AAMpB,SAAS,sBAAsB,SAAyB;AAC7D,QAAM,aAAa,iBAAiB,OAAO;AAE3C,SAAO,WAAW,MAAM,GAAG,GAAG;AAChC;AAMO,SAAS,eACd,SACA,YAAoB,MACb;AACP,QAAM,SAAgB,CAAC;AACvB,QAAM,OAAO,oBAAI,IAAY;AAE7B,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,QAAI,KAAK,IAAI,CAAC,EAAG;AAEjB,UAAM,QAAa,CAAC,QAAQ,CAAC,CAAC;AAC9B,SAAK,IAAI,CAAC;AAEV,aAAS,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AAC3C,UAAI,KAAK,IAAI,CAAC,EAAG;AAEjB,UAAI,iBAAiB,QAAQ,CAAC,EAAE,SAAS,QAAQ,CAAC,EAAE,SAAS,SAAS,GAAG;AACvE,cAAM,KAAK,QAAQ,CAAC,CAAC;AACrB,aAAK,IAAI,CAAC;AAAA,MACZ;AAAA,IACF;AAEA,QAAI,MAAM,SAAS,GAAG;AACpB,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,EACF;AAEA,SAAO;AACT;AAKO,SAAS,YACd,SACA,YAAoB,MACf;AACL,QAAM,SAAc,CAAC;AAErB,aAAW,UAAU,SAAS;AAC5B,UAAM,SAAS,OAAO;AAAA,MAAK,cACzB,iBAAiB,SAAS,SAAS,OAAO,SAAS,SAAS;AAAA,IAC9D;AAEA,QAAI,CAAC,QAAQ;AACX,aAAO,KAAK,MAAM;AAAA,IACpB;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}