@fairmint/ui 0.4.10 → 0.4.11

package/dist/utils/glossaryMatcher.js

@@ -0,0 +1,89 @@
+function escapeRegex(str) {
+  return str.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+function findAliasOccurrences(text, alias, sensitive) {
+  const flags = sensitive ? "gu" : "gui";
+  const pattern = `(^|[^\\p{L}\\p{Nd}])(${escapeRegex(alias)})([^\\p{L}\\p{Nd}]|$)`;
+  const regex = new RegExp(pattern, flags);
+  const results = [];
+  let match = regex.exec(text);
+  while (match !== null) {
+    const prefixOffset = match[1]?.length ?? 0;
+    const start = match.index + prefixOffset;
+    const matchedText = match[2] ?? alias;
+    const end = start + matchedText.length;
+    results.push({ start, end, text: matchedText });
+    regex.lastIndex = match.index + prefixOffset + (matchedText.length || 1);
+    match = regex.exec(text);
+  }
+  return results;
+}
+function matchGlossaryTerms(text, terms, taken = /* @__PURE__ */ new Set()) {
+  if (!text) return [];
+  const occurrencesByTerm = /* @__PURE__ */ new Map();
+  for (const term of terms) {
+    if (taken.has(term.id)) continue;
+    const occurrences = [];
+    for (const alias of term.aliases) {
+      const found = findAliasOccurrences(text, alias, term.matchSensitive);
+      for (const occ of found) {
+        occurrences.push({
+          start: occ.start,
+          end: occ.end,
+          text: occ.text,
+          termId: term.id
+        });
+      }
+    }
+    if (occurrences.length === 0) continue;
+    occurrences.sort((a, b) => {
+      if (a.start !== b.start) return a.start - b.start;
+      return b.end - b.start - (a.end - a.start);
+    });
+    occurrencesByTerm.set(term.id, occurrences);
+  }
+  if (occurrencesByTerm.size === 0) return [];
+  const accepted = [];
+  const acceptedTermIds = new Set(taken);
+  const nextIndex = /* @__PURE__ */ new Map();
+  for (const termId of occurrencesByTerm.keys()) {
+    nextIndex.set(termId, 0);
+  }
+  const pendingCandidates = [];
+  for (const [termId, occurrences] of occurrencesByTerm) {
+    if (occurrences.length > 0) {
+      pendingCandidates.push(occurrences[0]);
+      nextIndex.set(termId, 1);
+    }
+  }
+  const sortByLengthDesc = (a, b) => {
+    const lengthDifference = b.end - b.start - (a.end - a.start);
+    return lengthDifference !== 0 ? lengthDifference : a.start - b.start;
+  };
+  pendingCandidates.sort(sortByLengthDesc);
+  while (pendingCandidates.length > 0) {
+    const candidate = pendingCandidates.shift();
+    if (candidate === void 0) break;
+    if (acceptedTermIds.has(candidate.termId)) continue;
+    const overlapsAccepted = accepted.some(
+      (match) => candidate.start < match.end && candidate.end > match.start
+    );
+    if (!overlapsAccepted) {
+      accepted.push(candidate);
+      acceptedTermIds.add(candidate.termId);
+    } else {
+      const occurrences = occurrencesByTerm.get(candidate.termId);
+      const idx = nextIndex.get(candidate.termId) ?? 0;
+      if (occurrences && idx < occurrences.length) {
+        pendingCandidates.push(occurrences[idx]);
+        nextIndex.set(candidate.termId, idx + 1);
+        pendingCandidates.sort(sortByLengthDesc);
+      }
+    }
+  }
+  return accepted.sort((a, b) => a.start - b.start);
+}
+export {
+  matchGlossaryTerms
+};
+//# sourceMappingURL=glossaryMatcher.js.map

package/dist/utils/glossaryMatcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"glossaryMatcher.js","sources":["../../src/utils/glossaryMatcher.ts"],"sourcesContent":["import type { GlossaryTerm } from \"../constants/glossary\";\n\nexport interface GlossaryMatch {\n  /** Index of the first character in `text` covered by the match. */\n  start: number;\n  /** Index one past the last character covered by the match. */\n  end: number;\n  /** Exact substring matched — preserves original source casing. */\n  text: string;\n  /** Glossary term identifier. */\n  termId: string;\n}\n\nfunction escapeRegex(str: string): string {\n  return str.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\nfunction findAliasOccurrences(\n  text: string,\n  alias: string,\n  sensitive: boolean,\n): Array<{ start: number; end: number; text: string }> {\n  const flags = sensitive ? \"gu\" : \"gui\";\n  const pattern = `(^|[^\\\\p{L}\\\\p{Nd}])(${escapeRegex(alias)})([^\\\\p{L}\\\\p{Nd}]|$)`;\n  const regex = new RegExp(pattern, flags);\n  const results: Array<{ start: number; end: number; text: string }> = [];\n\n  let match: RegExpExecArray | null = regex.exec(text);\n  while (match !== null) {\n    const prefixOffset = match[1]?.length ?? 0;\n    const start = match.index + prefixOffset;\n    const matchedText = match[2] ?? alias;\n    const end = start + matchedText.length;\n    results.push({ start, end, text: matchedText });\n\n    regex.lastIndex = match.index + prefixOffset + (matchedText.length || 1);\n    match = regex.exec(text);\n  }\n\n  return results;\n}\n\n/**\n * Searches a plain text string for occurrences of glossary terms.\n *\n * Rules:\n * 1. One match per term: the first non-overlapping occurrence in document order wins.\n * 2. Overlapping matches between different terms: Longest alias wins\n *    (e.g. \"Reg D 506(b)\" beats \"Reg D\").\n * 3. Strict unicode word boundaries on both ends (`\\p{L}\\p{Nd}`).\n * 4. Terms marked `matchSensitive` require exact casing.\n */\nexport function matchGlossaryTerms(\n  text: string,\n  terms: readonly GlossaryTerm[],\n  taken: ReadonlySet<string> = new Set(),\n): GlossaryMatch[] {\n  if (!text) return [];\n\n  // Collect all occurrences for all eligible terms, grouped by term ID.\n  const occurrencesByTerm = new Map<string, GlossaryMatch[]>();\n\n  for (const term of terms) {\n    if (taken.has(term.id)) continue;\n\n    const occurrences: GlossaryMatch[] = [];\n    for (const alias of term.aliases) {\n      const found = findAliasOccurrences(text, alias, term.matchSensitive);\n      for (const occ of found) {\n        occurrences.push({\n          start: occ.start,\n          end: occ.end,\n          text: occ.text,\n          termId: term.id,\n        });\n      }\n    }\n\n    if (occurrences.length === 0) continue;\n\n    // Sort each term's occurrences by document order, then by length descending\n    // so the first entry is the longest match at the earliest position.\n    occurrences.sort((a, b) => {\n      if (a.start !== b.start) return a.start - b.start;\n      return b.end - b.start - (a.end - a.start);\n    });\n    occurrencesByTerm.set(term.id, occurrences);\n  }\n\n  if (occurrencesByTerm.size === 0) return [];\n\n  // Build a flat candidate list sorted by length descending so longer\n  // overlaps are resolved first. Each candidate is the first available\n  // (non-yet-rejected) occurrence for its term.\n  const accepted: GlossaryMatch[] = [];\n  const acceptedTermIds = new Set<string>(taken);\n\n  // Keep an index per term tracking which occurrence to try next.\n  const nextIndex = new Map<string, number>();\n  for (const termId of occurrencesByTerm.keys()) {\n    nextIndex.set(termId, 0);\n  }\n\n  // Process candidates longest-first. When a candidate is rejected (overlaps\n  // an accepted match), advance to the next occurrence of that term and\n  // re-queue it. This ensures we find the first non-overlapping occurrence\n  // for each term, preserving both longest-overlap-wins and first-occurrence.\n  const pendingCandidates: GlossaryMatch[] = [];\n  for (const [termId, occurrences] of occurrencesByTerm) {\n    if (occurrences.length > 0) {\n      pendingCandidates.push(occurrences[0]);\n      nextIndex.set(termId, 1);\n    }\n  }\n\n  const sortByLengthDesc = (a: GlossaryMatch, b: GlossaryMatch) => {\n    const lengthDifference = b.end - b.start - (a.end - a.start);\n    return lengthDifference !== 0 ? lengthDifference : a.start - b.start;\n  };\n  pendingCandidates.sort(sortByLengthDesc);\n\n  while (pendingCandidates.length > 0) {\n    const candidate = pendingCandidates.shift();\n    if (candidate === undefined) break;\n    if (acceptedTermIds.has(candidate.termId)) continue;\n\n    const overlapsAccepted = accepted.some(\n      (match) => candidate.start < match.end && candidate.end > match.start,\n    );\n    if (!overlapsAccepted) {\n      accepted.push(candidate);\n      acceptedTermIds.add(candidate.termId);\n    } else {\n      // This occurrence is blocked — try the next occurrence of the same term.\n      const occurrences = occurrencesByTerm.get(candidate.termId);\n      const idx = nextIndex.get(candidate.termId) ?? 0;\n      if (occurrences && idx < occurrences.length) {\n        pendingCandidates.push(occurrences[idx]);\n        nextIndex.set(candidate.termId, idx + 1);\n        pendingCandidates.sort(sortByLengthDesc);\n      }\n    }\n  }\n\n  return accepted.sort((a, b) => a.start - b.start);\n}\n"],"names":[],"mappings":"AAaA,SAAS,YAAY,KAAqB;AACxC,SAAO,IAAI,QAAQ,uBAAuB,MAAM;AAClD;AAEA,SAAS,qBACP,MACA,OACA,WACqD;AACrD,QAAM,QAAQ,YAAY,OAAO;AACjC,QAAM,UAAU,wBAAwB,YAAY,KAAK,CAAC;AAC1D,QAAM,QAAQ,IAAI,OAAO,SAAS,KAAK;AACvC,QAAM,UAA+D,CAAA;AAErE,MAAI,QAAgC,MAAM,KAAK,IAAI;AACnD,SAAO,UAAU,MAAM;AACrB,UAAM,eAAe,MAAM,CAAC,GAAG,UAAU;AACzC,UAAM,QAAQ,MAAM,QAAQ;AAC5B,UAAM,cAAc,MAAM,CAAC,KAAK;AAChC,UAAM,MAAM,QAAQ,YAAY;AAChC,YAAQ,KAAK,EAAE,OAAO,KAAK,MAAM,aAAa;AAE9C,UAAM,YAAY,MAAM,QAAQ,gBAAgB,YAAY,UAAU;AACtE,YAAQ,MAAM,KAAK,IAAI;AAAA,EACzB;AAEA,SAAO;AACT;AAYO,SAAS,mBACd,MACA,OACA,QAA6B,oBAAI,OAChB;AACjB,MAAI,CAAC,KAAM,QAAO,CAAA;AAGlB,QAAM,wCAAwB,IAAA;AAE9B,aAAW,QAAQ,OAAO;AACxB,QAAI,MAAM,IAAI,KAAK,EAAE,EAAG;AAExB,UAAM,cAA+B,CAAA;AACrC,eAAW,SAAS,KAAK,SAAS;AAChC,YAAM,QAAQ,qBAAqB,MAAM,OAAO,KAAK,cAAc;AACnE,iBAAW,OAAO,OAAO;AACvB,oBAAY,KAAK;AAAA,UACf,OAAO,IAAI;AAAA,UACX,KAAK,IAAI;AAAA,UACT,MAAM,IAAI;AAAA,UACV,QAAQ,KAAK;AAAA,QAAA,CACd;AAAA,MACH;AAAA,IACF;AAEA,QAAI,YAAY,WAAW,EAAG;AAI9B,gBAAY,KAAK,CAAC,GAAG,MAAM;AACzB,UAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE;AAC5C,aAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE;AAAA,IACtC,CAAC;AACD,sBAAkB,IAAI,KAAK,IAAI,WAAW;AAAA,EAC5C;AAEA,MAAI,kBAAkB,SAAS,EAAG,QAAO,CAAA;AAKzC,QAAM,WAA4B,CAAA;AAClC,QAAM,kBAAkB,IAAI,IAAY,KAAK;AAG7C,QAAM,gCAAgB,IAAA;AACtB,aAAW,UAAU,kBAAkB,QAAQ;AAC7C,cAAU,IAAI,QAAQ,CAAC;AAAA,EACzB;AAMA,QAAM,oBAAqC,CAAA;AAC3C,aAAW,CAAC,QAAQ,WAAW,KAAK,mBAAmB;AACrD,QAAI,YAAY,SAAS,GAAG;AAC1B,wBAAkB,KAAK,YAAY,CAAC,CAAC;AACrC,gBAAU,IAAI,QAAQ,CAAC;AAAA,IACzB;AAAA,EACF;AAEA,QAAM,mBAAmB,CAAC,GAAkB,MAAqB;AAC/D,UAAM,mBAAmB,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE;AACtD,WAAO,qBAAqB,IAAI,mBAAmB,EAAE,QAAQ,EAAE;AAAA,EACjE;AACA,oBAAkB,KAAK,gBAAgB;AAEvC,SAAO,kBAAkB,SAAS,GAAG;AACnC,UAAM,YAAY,kBAAkB,MAAA;AACpC,QAAI,cAAc,OAAW;AAC7B,QAAI,gBAAgB,IAAI,UAAU,MAAM,EAAG;AAE3C,UAAM,mBAAmB,SAAS;AAAA,MAChC,CAAC,UAAU,UAAU,QAAQ,MAAM,OAAO,UAAU,MAAM,MAAM;AAAA,IAAA;AAElE,QAAI,CAAC,kBAAkB;AACrB,eAAS,KAAK,SAAS;AACvB,sBAAgB,IAAI,UAAU,MAAM;AAAA,IACtC,OAAO;AAEL,YAAM,cAAc,kBAAkB,IAAI,UAAU,MAAM;AAC1D,YAAM,MAAM,UAAU,IAAI,UAAU,MAAM,KAAK;AAC/C,UAAI,eAAe,MAAM,YAAY,QAAQ;AAC3C,0BAAkB,KAAK,YAAY,GAAG,CAAC;AACvC,kBAAU,IAAI,UAAU,QAAQ,MAAM,CAAC;AACvC,0BAAkB,KAAK,gBAAgB;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,SAAO,SAAS,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAClD;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fairmint/ui",
-  "version": "0.4.10",
+  "version": "0.4.11",
   "type": "module",
   "description": "Fairmint design system and UI component library",
   "license": "SEE LICENSE IN LICENSE",