@lucern/graph-primitives 0.1.0-alpha.4 → 0.3.0-alpha.1

package/dist/text-matching.js

@@ -1,246 +1,3 @@
-// ../../packages/contracts/src/text-matching.contract.ts
-var TOKEN_SPLIT_REGEX = /[^a-z0-9]+/;
-var NON_ALPHANUMERIC_REGEX = /[^a-z0-9]/g;
-var STOP_WORDS = /* @__PURE__ */ new Set([
-  "the",
-  "a",
-  "an",
-  "and",
-  "or",
-  "but",
-  "in",
-  "on",
-  "at",
-  "to",
-  "for",
-  "of",
-  "with",
-  "by",
-  "from",
-  "is",
-  "it",
-  "as",
-  "be",
-  "was",
-  "are",
-  "this",
-  "that",
-  "has",
-  "had",
-  "have",
-  "not",
-  "all",
-  "can",
-  "do",
-  "its",
-  "may",
-  "will",
-  "how",
-  "what",
-  "which",
-  "who",
-  "when",
-  "where",
-  "than",
-  "then",
-  "each",
-  "into",
-  "such",
-  "any",
-  "been",
-  "if",
-  "would",
-  "about",
-  "should",
-  "these",
-  "those",
-  "their",
-  "we",
-  "our",
-  "so"
-]);
-function tokenizeSearchText(text) {
-  return text.toLowerCase().split(TOKEN_SPLIT_REGEX).filter((token) => token.length >= 2 && !STOP_WORDS.has(token));
-}
-function stemToken(word) {
-  if (word.length <= 4) {
-    return word;
-  }
-  if (word.endsWith("ation")) {
-    return word.slice(0, -5);
-  }
-  if (word.endsWith("ment")) {
-    return word.slice(0, -4);
-  }
-  if (word.endsWith("ness")) {
-    return word.slice(0, -4);
-  }
-  if (word.endsWith("ical")) {
-    return word.slice(0, -4);
-  }
-  if (word.endsWith("tion")) {
-    return word.slice(0, -4);
-  }
-  if (word.endsWith("sion")) {
-    return word.slice(0, -4);
-  }
-  if (word.endsWith("ing")) {
-    return word.slice(0, -3);
-  }
-  if (word.endsWith("ous")) {
-    return word.slice(0, -3);
-  }
-  if (word.endsWith("ive")) {
-    return word.slice(0, -3);
-  }
-  if (word.endsWith("ity")) {
-    return word.slice(0, -3);
-  }
-  if (word.endsWith("ics")) {
-    return word.slice(0, -3);
-  }
-  if (word.endsWith("ly")) {
-    return word.slice(0, -2);
-  }
-  if (word.endsWith("ed")) {
-    return word.slice(0, -2);
-  }
-  if (word.endsWith("er")) {
-    return word.slice(0, -2);
-  }
-  if (word.endsWith("es")) {
-    return word.slice(0, -2);
-  }
-  if (word.endsWith("al")) {
-    return word.slice(0, -2);
-  }
-  if (word.endsWith("ic")) {
-    return word.slice(0, -2);
-  }
-  if (word.endsWith("s") && !word.endsWith("ss")) {
-    return word.slice(0, -1);
-  }
-  return word;
-}
-function tokenOverlapScore(queryTokens, textTokens) {
-  if (queryTokens.length === 0 || textTokens.length === 0) {
-    return 0;
-  }
-  const stemmedText = new Set(textTokens.map(stemToken));
-  let matchCount = 0;
-  for (const queryToken of queryTokens) {
-    const stemmedQuery = stemToken(queryToken);
-    if (stemmedText.has(stemmedQuery)) {
-      matchCount += 1;
-      continue;
-    }
-    for (const textToken of stemmedText) {
-      if (textToken.startsWith(stemmedQuery) || stemmedQuery.startsWith(textToken)) {
-        matchCount += 0.5;
-        break;
-      }
-    }
-  }
-  return matchCount / queryTokens.length;
-}
-function bigramTokenize(text) {
-  const normalized = text.toLowerCase().replace(NON_ALPHANUMERIC_REGEX, "");
-  const bigrams = /* @__PURE__ */ new Set();
-  for (let i = 0; i < normalized.length - 1; i++) {
-    bigrams.add(normalized.slice(i, i + 2));
-  }
-  return bigrams;
-}
-function wordTokenize(text) {
-  return text.toLowerCase().split(TOKEN_SPLIT_REGEX).filter((token) => token.length > 1);
-}
-function jaccardSimilarity(setA, setB) {
-  if (setA.size === 0 && setB.size === 0) {
-    return 0;
-  }
-  let intersectionSize = 0;
-  const smaller = setA.size <= setB.size ? setA : setB;
-  const larger = setA.size <= setB.size ? setB : setA;
-  for (const item of smaller) {
-    if (larger.has(item)) {
-      intersectionSize++;
-    }
-  }
-  const unionSize = setA.size + setB.size - intersectionSize;
-  return unionSize === 0 ? 0 : intersectionSize / unionSize;
-}
-function wordOverlapScore(inputWords, typeWords) {
-  if (typeWords.length === 0) {
-    return 0;
-  }
-  let matches = 0;
-  for (const word of typeWords) {
-    if (inputWords.includes(word)) {
-      matches++;
-    }
-  }
-  return matches / typeWords.length;
-}
-function prepareLexicalQuery(query) {
-  return {
-    raw: query,
-    tokens: tokenizeSearchText(query),
-    words: wordTokenize(query),
-    bigrams: bigramTokenize(query)
-  };
-}
-function scoreLexicalSignal(query, signal) {
-  const text = signal.text?.trim();
-  if (!text) {
-    return 0;
-  }
-  switch (signal.strategy ?? "tokenOverlap") {
-    case "bigramJaccard":
-      return jaccardSimilarity(query.bigrams, bigramTokenize(text));
-    case "wordOverlap":
-      return wordOverlapScore(query.words, wordTokenize(text));
-    default:
-      return tokenOverlapScore(query.tokens, tokenizeSearchText(text));
-  }
-}
-function scoreLexicalSignals(query, signals) {
-  let weightedScore = 0;
-  let totalWeight = 0;
-  for (const signal of signals) {
-    if (!signal.text?.trim() || signal.weight <= 0) {
-      continue;
-    }
-    weightedScore += scoreLexicalSignal(query, signal) * signal.weight;
-    totalWeight += signal.weight;
-  }
-  return totalWeight === 0 ? 0 : weightedScore / totalWeight;
-}
-function rankWindowScore(index, total) {
-  if (total <= 1) {
-    return 1;
-  }
-  const clampedIndex = Math.max(0, Math.min(index, total - 1));
-  return 1 - clampedIndex / (total - 1);
-}
-function rerankLexicalWindow(query, items, getText, options) {
-  const preparedQuery = prepareLexicalQuery(query);
-  if (preparedQuery.tokens.length === 0 || items.length <= 1) {
-    return items;
-  }
-  const lexicalWeight = options?.lexicalWeight ?? 0.65;
-  const rankWeight = options?.rankWeight ?? 0.35;
-  return items.map((item, index) => {
-    const lexicalScore = scoreLexicalSignals(preparedQuery, [
-      { text: getText(item) ?? "", weight: 1, strategy: "tokenOverlap" }
-    ]);
-    const rankScore = rankWindowScore(index, items.length);
-    return {
-      item,
-      combinedScore: lexicalScore * lexicalWeight + rankScore * rankWeight
-    };
-  }).sort((left, right) => right.combinedScore - left.combinedScore).map(({ item }) => item);
-}
-
-export { bigramTokenize, jaccardSimilarity, prepareLexicalQuery, rankWindowScore, rerankLexicalWindow, scoreLexicalSignal, scoreLexicalSignals, stemToken, tokenOverlapScore, tokenizeSearchText, wordOverlapScore, wordTokenize };
+export { bigramTokenize, jaccardSimilarity, prepareLexicalQuery, rankWindowScore, rerankLexicalWindow, scoreLexicalSignal, scoreLexicalSignals, stemToken, tokenOverlapScore, tokenizeSearchText, wordOverlapScore, wordTokenize } from '@lucern/contracts/text-matching.contract';
 //# sourceMappingURL=text-matching.js.map
 //# sourceMappingURL=text-matching.js.map

package/dist/text-matching.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../packages/contracts/src/text-matching.contract.ts"],"names":[],"mappings":";AA4BA,IAAM,iBAAA,GAAoB,YAAA;AAC1B,IAAM,sBAAA,GAAyB,YAAA;AAG/B,IAAM,UAAA,uBAAiB,GAAA,CAAI;AAAA,EACzB,KAAA;AAAA,EACA,GAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,MAAA;AAAA,EACA,IAAA;AAAA,EACA,MAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,OAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,MAAA;AAAA,EACA,KAAA;AAAA,EACA,MAAA;AAAA,EACA,IAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,OAAA;AAAA,EACA,IAAA;AAAA,EACA,KAAA;AAAA,EACA;AACF,CAAC,CAAA;AAGM,SAAS,mBAAmB,IAAA,EAAwB;AACzD,EAAA,OAAO,KACJ,WAAA,EAAY,CACZ,KAAA,CAAM,iBAAiB,EACvB,MAAA,CAAO,CAAC,KAAA,KAAU,KAAA,CAAM,UAAU,CAAA,IAAK,CAAC,UAAA,CAAW,GAAA,CAAI,KAAK,CAAC,CAAA;AAClE;AAGO,SAAS,UAAU,IAAA,EAAsB;AAC9C,EAAA,IAAI,IAAA,CAAK,UAAU,CAAA,EAAG;AACpB,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,OAAO,CAAA,EAAG;AAC1B,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACzB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACzB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACzB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACzB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAM,CAAA,EAAG;AACzB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,EAAG;AACxB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AACvB,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,IAAI,IAAA,CAAK,SAAS,GAAG,CAAA,IAAK,CAAC,IAAA,CAAK,QAAA,CAAS,IAAI,CAAA,EAAG;AAC9C,IAAA,OAAO,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AAAA,EACzB;AACA,EAAA,OAAO,IAAA;AACT;AAGO,SAAS,iBAAA,CACd,aACA,UAAA,EACQ;AACR,EAAA,IAAI,WAAA,CAAY,MAAA,KAAW,CAAA,IAAK,UAAA,CAAW,WAAW,CAAA,EAAG;AACvD,IAAA,OAAO,CAAA;AAAA,EACT;AAEA,EAAA,MAAM,cAAc,IAAI,GAAA,CAAI,UAAA,CAAW,GAAA,CAAI,SAAS,CAAC,CAAA;AACrD,EAAA,IAAI,UAAA,GAAa,CAAA;AAEjB,EAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACpC,IAAA,MAAM,YAAA,GAAe,UAAU,UAAU,CAAA;AAEzC,IAAA,IAAI,WAAA,CAAY,GAAA,CAAI,YAAY,CAAA,EAAG;AACjC,MAAA,UAAA,IAAc,CAAA;AACd,MAAA;AAAA,IACF;AAEA,IAAA,KAAA,MAAW,aAAa,WAAA,EAAa;AACnC,MAAA,IACE,UAAU,UAAA,CAAW,YAAY,KACjC,YAAA,CAAa,UAAA,CAAW,SAAS,CAAA,EACjC;AACA,QAAA,UAAA,IAAc,GAAA;AACd,QAAA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,aAAa,WAAA,CAAY,MAAA;AAClC;AAMO,SAAS,eAAe,IAAA,EAA2B;AACxD,EAAA,MAAM,aAAa,IAAA,CAAK,WAAA,EAAY,CAAE,OAAA,CAAQ,wBAAwB,EAAE,CAAA;AACxE,EAAA,MAAM,OAAA,uBAAc,GAAA,EAAY;AAChC,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,UAAA,CAAW,MAAA,GAAS,GAAG,CAAA,EAAA,EAAK;AAC9C,IAAA,OAAA,CAAQ,IAAI,UAAA,CAAW,KAAA,CAAM,CAAA,EAAG,CAAA,GAAI,CAAC,CAAC,CAAA;AAAA,EACxC;AACA,EAAA,OAAO,OAAA;AACT;AAMO,SAAS,aAAa,IAAA,EAAwB;AACnD,EAAA,OAAO,IAAA,CACJ,WAAA,EAAY,CACZ,KAAA,CAAM,iBAAiB,CAAA,CACvB,MAAA,CAAO,CAAC,KAAA,KAAU,KAAA,CAAM,MAAA,GAAS,CAAC,CAAA;AACvC;AAGO,SAAS,iBAAA,CACd,MACA,IAAA,EACQ;AACR,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,CAAA,IAAK,IAAA,CAAK,SAAS,CAAA,EAAG;AACtC,IAAA,OAAO,CAAA;AAAA,EACT;AAEA,EAAA,IAAI,gBAAA,GAAmB,CAAA;AACvB,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,IAAA,IAAQ,IAAA,CAAK,OAAO,IAAA,GAAO,IAAA;AAChD,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,IAAA,IAAQ,IAAA,CAAK,OAAO,IAAA,GAAO,IAAA;AAE/C,EAAA,KAAA,MAAW,QAAQ,OAAA,EAAS;AAC1B,IAAA,IAAI,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA,EAAG;AACpB,MAAA,gBAAA,EAAA;AAAA,IACF;AAAA,EACF;AAEA,EAAA,MAAM,SAAA,GAAY,IAAA,CAAK,IAAA,GAAO,IAAA,CAAK,IAAA,GAAO,gBAAA;AAC1C,EAAA,OAAO,SAAA,KAAc,CAAA,GAAI,CAAA,GAAI,gBAAA,GAAmB,SAAA;AAClD;AAGO,SAAS,gBAAA,CACd,YACA,SAAA,EACQ;AACR,EAAA,IAAI,SAAA,CAAU,WAAW,CAAA,EAAG;AAC1B,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,KAAA,MAAW,QAAQ,SAAA,EAAW;AAC5B,IAAA,IAAI,UAAA,CAAW,QAAA,CAAS,IAAI,CAAA,EAAG;AAC7B,MAAA,OAAA,EAAA;AAAA,IACF;AAAA,EACF;AACA,EAAA,OAAO,UAAU,SAAA,CAAU,MAAA;AAC7B;AAGO,SAAS,oBAAoB,KAAA,EAAqC;AACvE,EAAA,OAAO;AAAA,IACL,GAAA,EAAK,KAAA;AAAA,IACL,MAAA,EAAQ,mBAAmB,KAAK,CAAA;AAAA,IAChC,KAAA,EAAO,aAAa,KAAK,CAAA;AAAA,IACzB,OAAA,EAAS,eAAe,KAAK;AAAA,GAC/B;AACF;AAGO,SAAS,kBAAA,CACd,OACA,MAAA,EACQ;AACR,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,IAAA,EAAM,IAAA,EAAK;AAC/B,EAAA,IAAI,CAAC,IAAA,EAAM;AACT,IAAA,OAAO,CAAA;AAAA,EACT;AAEA,EAAA,QAAQ,MAAA,CAAO,YAAY,cAAA;AAAgB,IACzC,KAAK,eAAA;AACH,MAAA,OAAO,iBAAA,CAAkB,KAAA,CAAM,OAAA,EAAS,cAAA,CAAe,IAAI,CAAC,CAAA;AAAA,IAC9D,KAAK,aAAA;AACH,MAAA,OAAO,gBAAA,CAAiB,KAAA,CAAM,KAAA,EAAO,YAAA,CAAa,IAAI,CAAC,CAAA;AAAA,IACzD;AACE,MAAA,OAAO,iBAAA,CAAkB,KAAA,CAAM,MAAA,EAAQ,kBAAA,CAAmB,IAAI,CAAC,CAAA;AAAA;AAErE;AAGO,SAAS,mBAAA,CACd,OACA,OAAA,EACQ;AACR,EAAA,IAAI,aAAA,GAAgB,CAAA;AACpB,EAAA,IAAI,WAAA,GAAc,CAAA;AAElB,EAAA,KAAA,MAAW,UAAU,OAAA,EAAS;AAC5B,IAAA,IAAI,CAAC,MAAA,CAAO,IAAA,EAAM,MAAK,IAAK,MAAA,CAAO,UAAU,CAAA,EAAG;AAC9C,MAAA;AAAA,IACF;AACA,IAAA,aAAA,IAAiB,kBAAA,CAAmB,KAAA,EAAO,MAAM,CAAA,GAAI,MAAA,CAAO,MAAA;AAC5D,IAAA,WAAA,IAAe,MAAA,CAAO,MAAA;AAAA,EACxB;AAEA,EAAA,OAAO,WAAA,KAAgB,CAAA,GAAI,CAAA,GAAI,aAAA,GAAgB,WAAA;AACjD;AAGO,SAAS,eAAA,CAAgB,OAAe,KAAA,EAAuB;AACpE,EAAA,IAAI,SAAS,CAAA,EAAG;AACd,IAAA,OAAO,CAAA;AAAA,EACT;AACA,EAAA,MAAM,YAAA,GAAe,KAAK,GAAA,CAAI,CAAA,EAAG,KAAK,GAAA,CAAI,KAAA,EAAO,KAAA,GAAQ,CAAC,CAAC,CAAA;AAC3D,EAAA,OAAO,CAAA,GAAI,gBAAgB,KAAA,GAAQ,CAAA,CAAA;AACrC;AAGO,SAAS,mBAAA,CACd,KAAA,EACA,KAAA,EACA,OAAA,EACA,OAAA,EACK;AACL,EAAA,MAAM,aAAA,GAAgB,oBAAoB,KAAK,CAAA;AAC/C,EAAA,IAAI,cAAc,MAAA,CAAO,MAAA,KAAW,CAAA,IAAK,KAAA,CAAM,UAAU,CAAA,EAAG;AAC1D,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,MAAM,aAAA,GAAgB,SAAS,aAAA,IAAiB,IAAA;AAChD,EAAA,MAAM,UAAA,GAAa,SAAS,UAAA,IAAc,IAAA;AAE1C,EAAA,OAAO,KAAA,CACJ,GAAA,CAAI,CAAC,IAAA,EAAM,KAAA,KAAU;AACpB,IAAA,MAAM,YAAA,GAAe,oBAAoB,aAAA,EAAe;AAAA,MACtD,EAAE,MAAM,OAAA,CAAQ,IAAI,KAAK,EAAA,EAAI,MAAA,EAAQ,CAAA,EAAG,QAAA,EAAU,cAAA;AAAe,KAClE,CAAA;AACD,IAAA,MAAM,SAAA,GAAY,eAAA,CAAgB,KAAA,EAAO,KAAA,CAAM,MAAM,CAAA;AAErD,IAAA,OAAO;AAAA,MACL,IAAA;AAAA,MACA,aAAA,EAAe,YAAA,GAAe,aAAA,GAAgB,SAAA,GAAY;AAAA,KAC5D;AAAA,EACF,CAAC,CAAA,CACA,IAAA,CAAK,CAAC,IAAA,EAAM,UAAU,KAAA,CAAM,aAAA,GAAgB,IAAA,CAAK,aAAa,EAC9D,GAAA,CAAI,CAAC,EAAE,IAAA,OAAW,IAAI,CAAA;AAC3B","file":"text-matching.js","sourcesContent":["/**\n * Shared lexical matching primitives used across MCP handlers and graph utilities.\n *\n * The goal is not to replace downstream LLM scoring. It provides a fast,\n * deterministic substrate for candidate generation, reranking, and light\n * classification across belief/question/evidence/entity surfaces.\n */\n\nexport type LexicalStrategy = \"tokenOverlap\" | \"bigramJaccard\" | \"wordOverlap\";\n\nexport type PreparedLexicalQuery = {\n  raw: string;\n  tokens: string[];\n  words: string[];\n  bigrams: Set<string>;\n};\n\nexport type LexicalSignal = {\n  strategy?: LexicalStrategy;\n  text: string | null | undefined;\n  weight: number;\n};\n\nexport type LexicalRerankOptions = {\n  lexicalWeight?: number;\n  rankWeight?: number;\n};\n\nconst TOKEN_SPLIT_REGEX = /[^a-z0-9]+/;\nconst NON_ALPHANUMERIC_REGEX = /[^a-z0-9]/g;\n\n/** Stop words that add noise to scoring. */\nconst STOP_WORDS = new Set([\n  \"the\",\n  \"a\",\n  \"an\",\n  \"and\",\n  \"or\",\n  \"but\",\n  \"in\",\n  \"on\",\n  \"at\",\n  \"to\",\n  \"for\",\n  \"of\",\n  \"with\",\n  \"by\",\n  \"from\",\n  \"is\",\n  \"it\",\n  \"as\",\n  \"be\",\n  \"was\",\n  \"are\",\n  \"this\",\n  \"that\",\n  \"has\",\n  \"had\",\n  \"have\",\n  \"not\",\n  \"all\",\n  \"can\",\n  \"do\",\n  \"its\",\n  \"may\",\n  \"will\",\n  \"how\",\n  \"what\",\n  \"which\",\n  \"who\",\n  \"when\",\n  \"where\",\n  \"than\",\n  \"then\",\n  \"each\",\n  \"into\",\n  \"such\",\n  \"any\",\n  \"been\",\n  \"if\",\n  \"would\",\n  \"about\",\n  \"should\",\n  \"these\",\n  \"those\",\n  \"their\",\n  \"we\",\n  \"our\",\n  \"so\",\n]);\n\n/** Tokenize a string into lowercase words, removing stop words. */\nexport function tokenizeSearchText(text: string): string[] {\n  return text\n    .toLowerCase()\n    .split(TOKEN_SPLIT_REGEX)\n    .filter((token) => token.length >= 2 && !STOP_WORDS.has(token));\n}\n\n/** Simple stemmer: strip common English suffixes for fuzzy matching. */\nexport function stemToken(word: string): string {\n  if (word.length <= 4) {\n    return word;\n  }\n  if (word.endsWith(\"ation\")) {\n    return word.slice(0, -5);\n  }\n  if (word.endsWith(\"ment\")) {\n    return word.slice(0, -4);\n  }\n  if (word.endsWith(\"ness\")) {\n    return word.slice(0, -4);\n  }\n  if (word.endsWith(\"ical\")) {\n    return word.slice(0, -4);\n  }\n  if (word.endsWith(\"tion\")) {\n    return word.slice(0, -4);\n  }\n  if (word.endsWith(\"sion\")) {\n    return word.slice(0, -4);\n  }\n  if (word.endsWith(\"ing\")) {\n    return word.slice(0, -3);\n  }\n  if (word.endsWith(\"ous\")) {\n    return word.slice(0, -3);\n  }\n  if (word.endsWith(\"ive\")) {\n    return word.slice(0, -3);\n  }\n  if (word.endsWith(\"ity\")) {\n    return word.slice(0, -3);\n  }\n  if (word.endsWith(\"ics\")) {\n    return word.slice(0, -3);\n  }\n  if (word.endsWith(\"ly\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"ed\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"er\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"es\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"al\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"ic\")) {\n    return word.slice(0, -2);\n  }\n  if (word.endsWith(\"s\") && !word.endsWith(\"ss\")) {\n    return word.slice(0, -1);\n  }\n  return word;\n}\n\n/** Compute token overlap score between query tokens and text tokens. */\nexport function tokenOverlapScore(\n  queryTokens: string[],\n  textTokens: string[]\n): number {\n  if (queryTokens.length === 0 || textTokens.length === 0) {\n    return 0;\n  }\n\n  const stemmedText = new Set(textTokens.map(stemToken));\n  let matchCount = 0;\n\n  for (const queryToken of queryTokens) {\n    const stemmedQuery = stemToken(queryToken);\n\n    if (stemmedText.has(stemmedQuery)) {\n      matchCount += 1;\n      continue;\n    }\n\n    for (const textToken of stemmedText) {\n      if (\n        textToken.startsWith(stemmedQuery) ||\n        stemmedQuery.startsWith(textToken)\n      ) {\n        matchCount += 0.5;\n        break;\n      }\n    }\n  }\n\n  return matchCount / queryTokens.length;\n}\n\n/**\n * Extract character bigrams from text. Normalizes to lowercase, removes\n * non-alphanumeric characters, and generates overlapping pairs.\n */\nexport function bigramTokenize(text: string): Set<string> {\n  const normalized = text.toLowerCase().replace(NON_ALPHANUMERIC_REGEX, \"\");\n  const bigrams = new Set<string>();\n  for (let i = 0; i < normalized.length - 1; i++) {\n    bigrams.add(normalized.slice(i, i + 2));\n  }\n  return bigrams;\n}\n\n/**\n * Extract word-level tokens from text (for coarser matching).\n * Normalizes to lowercase, splits on non-alphanumeric.\n */\nexport function wordTokenize(text: string): string[] {\n  return text\n    .toLowerCase()\n    .split(TOKEN_SPLIT_REGEX)\n    .filter((token) => token.length > 1);\n}\n\n/** Jaccard similarity between two sets: |A ∩ B| / |A ∪ B|. */\nexport function jaccardSimilarity(\n  setA: Set<string>,\n  setB: Set<string>\n): number {\n  if (setA.size === 0 && setB.size === 0) {\n    return 0;\n  }\n\n  let intersectionSize = 0;\n  const smaller = setA.size <= setB.size ? setA : setB;\n  const larger = setA.size <= setB.size ? setB : setA;\n\n  for (const item of smaller) {\n    if (larger.has(item)) {\n      intersectionSize++;\n    }\n  }\n\n  const unionSize = setA.size + setB.size - intersectionSize;\n  return unionSize === 0 ? 0 : intersectionSize / unionSize;\n}\n\n/** Exact word overlap score: fraction of type words found in input text. */\nexport function wordOverlapScore(\n  inputWords: string[],\n  typeWords: string[]\n): number {\n  if (typeWords.length === 0) {\n    return 0;\n  }\n  let matches = 0;\n  for (const word of typeWords) {\n    if (inputWords.includes(word)) {\n      matches++;\n    }\n  }\n  return matches / typeWords.length;\n}\n\n/** Pre-compute reusable lexical structures for a query. */\nexport function prepareLexicalQuery(query: string): PreparedLexicalQuery {\n  return {\n    raw: query,\n    tokens: tokenizeSearchText(query),\n    words: wordTokenize(query),\n    bigrams: bigramTokenize(query),\n  };\n}\n\n/** Score a single lexical signal against a prepared query. */\nexport function scoreLexicalSignal(\n  query: PreparedLexicalQuery,\n  signal: LexicalSignal\n): number {\n  const text = signal.text?.trim();\n  if (!text) {\n    return 0;\n  }\n\n  switch (signal.strategy ?? \"tokenOverlap\") {\n    case \"bigramJaccard\":\n      return jaccardSimilarity(query.bigrams, bigramTokenize(text));\n    case \"wordOverlap\":\n      return wordOverlapScore(query.words, wordTokenize(text));\n    default:\n      return tokenOverlapScore(query.tokens, tokenizeSearchText(text));\n  }\n}\n\n/** Weighted lexical score across multiple textual signals. */\nexport function scoreLexicalSignals(\n  query: PreparedLexicalQuery,\n  signals: LexicalSignal[]\n): number {\n  let weightedScore = 0;\n  let totalWeight = 0;\n\n  for (const signal of signals) {\n    if (!signal.text?.trim() || signal.weight <= 0) {\n      continue;\n    }\n    weightedScore += scoreLexicalSignal(query, signal) * signal.weight;\n    totalWeight += signal.weight;\n  }\n\n  return totalWeight === 0 ? 0 : weightedScore / totalWeight;\n}\n\n/** Map a candidate's original rank position into a 0..1 prior. */\nexport function rankWindowScore(index: number, total: number): number {\n  if (total <= 1) {\n    return 1;\n  }\n  const clampedIndex = Math.max(0, Math.min(index, total - 1));\n  return 1 - clampedIndex / (total - 1);\n}\n\n/** Rerank a candidate window by lexical overlap while preserving original-rank prior. */\nexport function rerankLexicalWindow<T>(\n  query: string,\n  items: T[],\n  getText: (item: T) => string | null | undefined,\n  options?: LexicalRerankOptions\n): T[] {\n  const preparedQuery = prepareLexicalQuery(query);\n  if (preparedQuery.tokens.length === 0 || items.length <= 1) {\n    return items;\n  }\n\n  const lexicalWeight = options?.lexicalWeight ?? 0.65;\n  const rankWeight = options?.rankWeight ?? 0.35;\n\n  return items\n    .map((item, index) => {\n      const lexicalScore = scoreLexicalSignals(preparedQuery, [\n        { text: getText(item) ?? \"\", weight: 1, strategy: \"tokenOverlap\" },\n      ]);\n      const rankScore = rankWindowScore(index, items.length);\n\n      return {\n        item,\n        combinedScore: lexicalScore * lexicalWeight + rankScore * rankWeight,\n      };\n    })\n    .sort((left, right) => right.combinedScore - left.combinedScore)\n    .map(({ item }) => item);\n}\n"]}
+{"version":3,"sources":[],"names":[],"mappings":"","file":"text-matching.js","sourcesContent":[]}

package/dist/workflowBridge.d.ts

@@ -0,0 +1,27 @@
+type WorkflowLikeDoc = {
+    _id?: string;
+    topicId?: string;
+    projectId?: string;
+    metadata?: Record<string, unknown>;
+    [key: string]: unknown;
+};
+type WorkflowBridgeResolution = {
+    inputId: string | null;
+    sprint: WorkflowLikeDoc | null;
+    worktree: WorkflowLikeDoc | null;
+    sprintId: string | null;
+    worktreeId: string | null;
+    topicId?: string;
+    projectId?: string;
+};
+declare function isLegacySprintDoc(doc: unknown): doc is WorkflowLikeDoc;
+declare function isWorktreeDoc(doc: unknown): doc is WorkflowLikeDoc;
+declare function getPairedSprintId(doc: WorkflowLikeDoc | null | undefined): string | null;
+declare function resolveWorkflowBridgeDoc(ctx: {
+    db: {
+        get: (...args: any[]) => Promise<unknown>;
+        query?: (...args: any[]) => any;
+    };
+}, workflowId: string | null | undefined): Promise<WorkflowBridgeResolution>;
+
+export { type WorkflowBridgeResolution, type WorkflowLikeDoc, getPairedSprintId, isLegacySprintDoc, isWorktreeDoc, resolveWorkflowBridgeDoc };

package/dist/workflowBridge.js

@@ -0,0 +1,303 @@
+import { v } from 'convex/values';
+import { componentsGeneric, anyApi } from 'convex/server';
+
+// src/topicScope.ts
+var api = anyApi;
+componentsGeneric();
+
+// src/topicScope.ts
+var LEGACY_SCOPE_FIELD = "graphScopeProjectId";
+function asMappedProjectId(topic) {
+  if (!topic) {
+    return;
+  }
+  const directLegacyProjectId = normalizeScopeValue(topic[LEGACY_SCOPE_FIELD]);
+  if (directLegacyProjectId) {
+    return directLegacyProjectId;
+  }
+  const metadata = topic.metadata || {};
+  const candidate = metadata[LEGACY_SCOPE_FIELD] || metadata.legacyProjectId || metadata.projectId || metadata.scopeProjectId;
+  return candidate ? candidate : void 0;
+}
+function normalizeScopeValue(value) {
+  if (typeof value !== "string") {
+    return;
+  }
+  const normalized = value.trim();
+  return normalized.length > 0 ? normalized : void 0;
+}
+function pickPrimaryTopic(candidates) {
+  return [...candidates].sort((a, b) => {
+    const depthA = a.depth ?? 9999;
+    const depthB = b.depth ?? 9999;
+    if (depthA !== depthB) {
+      return depthA - depthB;
+    }
+    const createdA = a.createdAt ?? Number.MAX_SAFE_INTEGER;
+    const createdB = b.createdAt ?? Number.MAX_SAFE_INTEGER;
+    if (createdA !== createdB) {
+      return createdA - createdB;
+    }
+    return String(a.name || "").localeCompare(String(b.name || ""));
+  })[0];
+}
+async function findTopicsByScopeAlias(ctx, scopeId) {
+  try {
+    return await ctx.db.query("topics").withIndex(
+      "by_graph_scope_project",
+      (q) => q.eq(LEGACY_SCOPE_FIELD, scopeId)
+    ).collect();
+  } catch {
+    const topics = await ctx.db.query("topics").collect();
+    return topics.filter((topic) => {
+      const normalizedGlobalId = normalizeScopeValue(topic.globalId);
+      const mappedProjectId = asMappedProjectId(topic);
+      return String(topic._id) === scopeId || normalizedGlobalId === scopeId || mappedProjectId === scopeId;
+    });
+  }
+}
+async function tryResolveHostTopicById(ctx, topicId) {
+  if (typeof ctx.runQuery !== "function") {
+    return null;
+  }
+  try {
+    return await ctx.runQuery(api.topics.get, {
+      id: topicId
+    }) ?? null;
+  } catch {
+    return null;
+  }
+}
+async function tryResolveHostTopicByLegacyScope(ctx, legacyScopeId) {
+  if (typeof ctx.runQuery !== "function") {
+    return null;
+  }
+  try {
+    return await ctx.runQuery(api.topics.getByLegacyScopeId, {
+      projectId: legacyScopeId
+    }) ?? null;
+  } catch {
+    return null;
+  }
+}
+async function resolveInheritedWorkspaceScope(ctx, topic) {
+  const MAX_DEPTH = 10;
+  let tenantId = normalizeScopeValue(topic.tenantId);
+  let workspaceId = normalizeScopeValue(topic.workspaceId);
+  if (tenantId && workspaceId) {
+    return { tenantId, workspaceId };
+  }
+  let current = topic;
+  for (let i = 0; i < MAX_DEPTH && current?.parentTopicId; i++) {
+    current = await ctx.db.get(current.parentTopicId);
+    if (!current) break;
+    if (!tenantId) {
+      tenantId = normalizeScopeValue(current.tenantId);
+    }
+    if (!workspaceId) {
+      workspaceId = normalizeScopeValue(current.workspaceId);
+    }
+    if (tenantId && workspaceId) break;
+  }
+  return { tenantId, workspaceId };
+}
+async function resolveTopicProjectScope(ctx, args) {
+  if (args.topicId) {
+    let topic = null;
+    try {
+      topic = await ctx.db.get(args.topicId);
+    } catch {
+    }
+    if (!topic) {
+      topic = await tryResolveHostTopicById(ctx, String(args.topicId));
+    }
+    if (!topic) {
+      topic = pickPrimaryTopic(
+        await findTopicsByScopeAlias(ctx, String(args.topicId))
+      ) ?? null;
+    }
+    if (!topic) {
+      throw new Error(`Topic not found: ${String(args.topicId)}`);
+    }
+    const inherited = await resolveInheritedWorkspaceScope(ctx, topic);
+    const mapped = asMappedProjectId(topic);
+    if (mapped) {
+      return {
+        topicId: topic._id,
+        projectId: mapped,
+        tenantId: inherited.tenantId,
+        workspaceId: inherited.workspaceId,
+        source: "topic"
+      };
+    }
+    return {
+      topicId: topic._id,
+      tenantId: inherited.tenantId,
+      workspaceId: inherited.workspaceId,
+      source: "topic"
+    };
+  }
+  if (args.projectId) {
+    let directTopic = null;
+    try {
+      directTopic = await ctx.db.get(
+        args.projectId
+      );
+    } catch {
+    }
+    if (directTopic) {
+      const inherited = await resolveInheritedWorkspaceScope(ctx, directTopic);
+      const mapped = asMappedProjectId(directTopic);
+      return {
+        topicId: directTopic._id,
+        projectId: mapped ?? args.projectId,
+        tenantId: inherited.tenantId,
+        workspaceId: inherited.workspaceId,
+        source: "topic_inferred"
+      };
+    }
+    directTopic = await tryResolveHostTopicByLegacyScope(ctx, args.projectId);
+    if (directTopic) {
+      const inherited = await resolveInheritedWorkspaceScope(ctx, directTopic);
+      const mapped = asMappedProjectId(directTopic);
+      return {
+        topicId: directTopic._id,
+        projectId: mapped ?? args.projectId,
+        tenantId: inherited.tenantId,
+        workspaceId: inherited.workspaceId,
+        source: "topic_inferred"
+      };
+    }
+    const topics = await findTopicsByScopeAlias(ctx, args.projectId);
+    const primary = pickPrimaryTopic(topics);
+    if (primary) {
+      const inherited = await resolveInheritedWorkspaceScope(ctx, primary);
+      return {
+        topicId: primary._id,
+        projectId: args.projectId,
+        tenantId: inherited.tenantId,
+        workspaceId: inherited.workspaceId,
+        source: "project_mapped_topic"
+      };
+    }
+    throw new Error(
+      `Legacy project scope ${String(args.projectId)} has no mapped topic.`
+    );
+  }
+  throw new Error(
+    "Missing scope: provide topicId (preferred) or legacy projectId alias."
+  );
+}
+({
+  projectId: v.optional(v.string()),
+  topicId: v.optional(v.string())
+});
+
+// src/workflowBridge.ts
+function isLegacySprintDoc(doc) {
+  if (!doc || typeof doc !== "object") {
+    return false;
+  }
+  if ("metadata" in doc && doc.metadata?.pairedSprintId) {
+    return false;
+  }
+  return "sprintScope" in doc || "targetPillar" in doc || "pillarThesis" in doc || "synthesisState" in doc || "projectId" in doc && !("worktreeScope" in doc);
+}
+function isWorktreeDoc(doc) {
+  if (!doc || typeof doc !== "object") {
+    return false;
+  }
+  return "worktreeScope" in doc || "targetBranch" in doc || "campaign" in doc || "executionBand" in doc || "proofArtifacts" in doc;
+}
+function getPairedSprintId(doc) {
+  const pairedSprintId = doc?.metadata?.pairedSprintId;
+  return typeof pairedSprintId === "string" && pairedSprintId.trim().length > 0 ? pairedSprintId : null;
+}
+function getStringField(doc, field) {
+  const value = doc?.[field];
+  return typeof value === "string" && value.trim().length > 0 ? value : void 0;
+}
+async function findPairedWorktreeForSprint(ctx, sprint) {
+  const sprintId = typeof sprint._id === "string" && sprint._id.length > 0 ? sprint._id : null;
+  if (!sprintId || typeof ctx.db.query !== "function") {
+    return null;
+  }
+  let topicId = getStringField(sprint, "topicId");
+  if (!topicId) {
+    try {
+      const scope = await resolveTopicProjectScope(ctx, {
+        topicId: getStringField(sprint, "topicId"),
+        projectId: getStringField(sprint, "projectId")
+      });
+      topicId = scope.topicId;
+    } catch {
+      topicId = void 0;
+    }
+  }
+  if (!topicId) {
+    return null;
+  }
+  const worktrees = await ctx.db.query("worktrees").withIndex("by_topicId", (q) => q.eq("topicId", topicId)).collect();
+  return worktrees.find(
+    (worktree) => String(worktree?.metadata?.pairedSprintId || "") === sprintId
+  ) ?? null;
+}
+async function resolveWorkflowBridgeDoc(ctx, workflowId) {
+  const empty = {
+    inputId: workflowId ?? null,
+    sprint: null,
+    worktree: null,
+    sprintId: null,
+    worktreeId: null
+  };
+  if (!workflowId) {
+    return empty;
+  }
+  let doc;
+  try {
+    doc = await ctx.db.get(workflowId);
+  } catch {
+    return empty;
+  }
+  if (!doc || typeof doc !== "object") {
+    return empty;
+  }
+  if (isLegacySprintDoc(doc)) {
+    const worktree2 = await findPairedWorktreeForSprint(ctx, doc);
+    return {
+      ...empty,
+      sprint: doc,
+      worktree: worktree2,
+      sprintId: typeof doc._id === "string" && doc._id.length > 0 ? doc._id : workflowId,
+      worktreeId: worktree2 && typeof worktree2._id === "string" && worktree2._id.length > 0 ? worktree2._id : null,
+      topicId: getStringField(worktree2, "topicId") ?? getStringField(doc, "topicId"),
+      projectId: getStringField(doc, "projectId") ?? getStringField(worktree2, "projectId")
+    };
+  }
+  const worktree = doc;
+  const pairedSprintId = getPairedSprintId(worktree);
+  let sprint = null;
+  if (pairedSprintId) {
+    try {
+      const paired = await ctx.db.get(pairedSprintId);
+      if (isLegacySprintDoc(paired)) {
+        sprint = paired;
+      }
+    } catch {
+      sprint = null;
+    }
+  }
+  return {
+    ...empty,
+    worktree,
+    sprint,
+    worktreeId: typeof worktree._id === "string" && worktree._id.length > 0 ? worktree._id : workflowId,
+    sprintId: sprint && typeof sprint._id === "string" && sprint._id.length > 0 ? sprint._id : pairedSprintId,
+    topicId: getStringField(worktree, "topicId") ?? getStringField(sprint, "topicId"),
+    projectId: getStringField(sprint, "projectId") ?? getStringField(worktree, "projectId")
+  };
+}
+
+export { getPairedSprintId, isLegacySprintDoc, isWorktreeDoc, resolveWorkflowBridgeDoc };
+//# sourceMappingURL=workflowBridge.js.map
+//# sourceMappingURL=workflowBridge.js.map

package/dist/workflowBridge.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/convex.ts","../src/topicScope.ts","../src/workflowBridge.ts"],"names":["worktree"],"mappings":";;;;AAaO,IAAM,GAAA,GAAM,MAAA;AACO,iBAAA;;;ACT1B,IAAM,kBAAA,GAAqB,qBAAA;AA2B3B,SAAS,kBACP,KAAA,EACoB;AACpB,EAAA,IAAI,CAAC,KAAA,EAAO;AACV,IAAA;AAAA,EACF;AACA,EAAA,MAAM,qBAAA,GAAwB,mBAAA,CAAoB,KAAA,CAAM,kBAAkB,CAAC,CAAA;AAC3E,EAAA,IAAI,qBAAA,EAAuB;AACzB,IAAA,OAAO,qBAAA;AAAA,EACT;AACA,EAAA,MAAM,QAAA,GAAY,KAAA,CAAM,QAAA,IAAY,EAAC;AACrC,EAAA,MAAM,SAAA,GACH,SAAS,kBAAkB,CAAA,IAC3B,SAAS,eAAA,IACT,QAAA,CAAS,aACT,QAAA,CAAS,cAAA;AACZ,EAAA,OAAO,YAAa,SAAA,GAAuB,MAAA;AAC7C;AAEA,SAAS,oBAAoB,KAAA,EAAoC;AAC/D,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA;AAAA,EACF;AACA,EAAA,MAAM,UAAA,GAAa,MAAM,IAAA,EAAK;AAC9B,EAAA,OAAO,UAAA,CAAW,MAAA,GAAS,CAAA,GAAI,UAAA,GAAa,MAAA;AAC9C;AAEA,SAAS,iBAAiB,UAAA,EAA8C;AACtE,EAAA,OAAO,CAAC,GAAG,UAAU,EAAE,IAAA,CAAK,CAAC,GAAG,CAAA,KAAM;AACpC,IAAA,MAAM,MAAA,GAAS,EAAE,KAAA,IAAS,IAAA;AAC1B,IAAA,MAAM,MAAA,GAAS,EAAE,KAAA,IAAS,IAAA;AAC1B,IAAA,IAAI,WAAW,MAAA,EAAQ;AACrB,MAAA,OAAO,MAAA,GAAS,MAAA;AAAA,IAClB;AACA,IAAA,MAAM,QAAA,GAAW,CAAA,CAAE,SAAA,IAAa,MAAA,CAAO,gBAAA;AACvC,IAAA,MAAM,QAAA,GAAW,CAAA,CAAE,SAAA,IAAa,MAAA,CAAO,gBAAA;AACvC,IAAA,IAAI,aAAa,QAAA,EAAU;AACzB,MAAA,OAAO,QAAA,GAAW,QAAA;AAAA,IACpB;AACA,IAAA,OAAO,MAAA,CAAO,CAAA,CAAE,IAAA,IAAQ,EAAE,CAAA,CAAE,cAAc,MAAA,CAAO,CAAA,CAAE,IAAA,IAAQ,EAAE,CAAC,CAAA;AAAA,EAChE,CAAC,EAAE,CAAC,CAAA;AACN;AAEA,eAAe,sBAAA,CAAuB,KAAU,OAAA,EAAsC;AACpF,EAAA,IAAI;AACF,IAAA,OAAQ,MAAM,GAAA,CAAI,EAAA,CACf,KAAA,CAAM,QAAQ,CAAA,CACd,SAAA;AAAA,MAAU,wBAAA;AAAA,MAA0B,CAAC,CAAA,KACpC,CAAA,CAAE,EAAA,CAAG,oBAAoB,OAAO;AAAA,MAEjC,OAAA,EAAQ;AAAA,EACb,CAAA,CAAA,MAAQ;AAIN,IAAA,MAAM,SAAU,MAAM,GAAA,CAAI,GAAG,KAAA,CAAM,QAAQ,EAAE,OAAA,EAAQ;AACrD,IAAA,OAAO,MAAA,CAAO,MAAA,CAAO,CAAC,KAAA,KAAU;AAC9B,MAAA,MAAM,kBAAA,GAAqB,mBAAA,CAAoB,KAAA,CAAM,QAAQ,CAAA;AAC7D,MAAA,MAAM,eAAA,GAAkB,kBAAkB,KAAK,CAAA;AAC/C,MAAA,OACE,OAAO,KAAA,CAAM,GAAG,MAAM,OAAA,IACtB,kBAAA,KAAuB,WACvB,eAAA,KAAoB,OAAA;AAAA,IAExB,CAAC,CAAA;AAAA,EACH;AACF;AAEA,eAAe,uBAAA,CACb,KACA,OAAA,EAC0B;AAC1B,EAAA,IAAI,OAAO,GAAA,CAAI,QAAA,KAAa,UAAA,EAAY;AACtC,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI;AACF,IAAA,OAAS,MAAM,GAAA,CAAI,QAAA,CAAS,GAAA,CAAO,OAAO,GAAA,EAAY;AAAA,MACpD,EAAA,EAAI;AAAA,KACL,CAAA,IAAM,IAAA;AAAA,EACT,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,IAAA;AAAA,EACT;AACF;AAEA,eAAe,gCAAA,CACb,KACA,aAAA,EAC0B;AAC1B,EAAA,IAAI,OAAO,GAAA,CAAI,QAAA,KAAa,UAAA,EAAY;AACtC,IAAA,OAAO,IAAA;AAAA,EACT;AACA,EAAA,IAAI;AACF,IAAA,OAAS,MAAM,GAAA,CAAI,QAAA,CAAS,GAAA,CAAO,OAAO,kBAAA,EAA2B;AAAA,MACnE,SAAA,EAAW;AAAA,KACZ,CAAA,IAAM,IAAA;AAAA,EACT,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,IAAA;AAAA,EACT;AACF;AAwBA,eAAe,8BAAA,CACb,KACA,KAAA,EACsD;AACtD,EAAA,MAAM,SAAA,GAAY,EAAA;AAClB,EAAA,IAAI,QAAA,GAAW,mBAAA,CAAoB,KAAA,CAAM,QAAQ,CAAA;AACjD,EAAA,IAAI,WAAA,GAAc,mBAAA,CAAoB,KAAA,CAAM,WAAW,CAAA;AAEvD,EAAA,IAAI,YAAY,WAAA,EAAa;AAC3B,IAAA,OAAO,EAAE,UAAU,WAAA,EAAY;AAAA,EACjC;AAEA,EAAA,IAAI,OAAA,GAA2B,KAAA;AAC/B,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,SAAA,IAAa,OAAA,EAAS,eAAe,CAAA,EAAA,EAAK;AAC5D,IAAA,OAAA,GAAW,MAAM,GAAA,CAAI,EAAA,CAAG,GAAA,CAAI,QAAQ,aAAa,CAAA;AACjD,IAAA,IAAI,CAAC,OAAA,EAAS;AAEd,IAAA,IAAI,CAAC,QAAA,EAAU;AACb,MAAA,QAAA,GAAW,mBAAA,CAAoB,QAAQ,QAAQ,CAAA;AAAA,IACjD;AACA,IAAA,IAAI,CAAC,WAAA,EAAa;AAChB,MAAA,WAAA,GAAc,mBAAA,CAAoB,QAAQ,WAAW,CAAA;AAAA,IACvD;AACA,IAAA,IAAI,YAAY,WAAA,EAAa;AAAA,EAC/B;AAEA,EAAA,OAAO,EAAE,UAAU,WAAA,EAAY;AACjC;AAEA,eAAsB,wBAAA,CACpB,KACA,IAAA,EAC4B;AAC5B,EAAA,IAAI,KAAK,OAAA,EAAS;AAEhB,IAAA,IAAI,KAAA,GAAyB,IAAA;AAC7B,IAAA,IAAI;AACF,MAAA,KAAA,GAAS,MAAM,GAAA,CAAI,EAAA,CAAG,GAAA,CAAI,KAAK,OAAuB,CAAA;AAAA,IACxD,CAAA,CAAA,MAAQ;AAAA,IAER;AACA,IAAA,IAAI,CAAC,KAAA,EAAO;AACV,MAAA,KAAA,GAAQ,MAAM,uBAAA,CAAwB,GAAA,EAAK,MAAA,CAAO,IAAA,CAAK,OAAO,CAAC,CAAA;AAAA,IACjE;AACA,IAAA,IAAI,CAAC,KAAA,EAAO;AAEV,MAAA,KAAA,GACE,gBAAA;AAAA,QACE,MAAM,sBAAA,CAAuB,GAAA,EAAK,MAAA,CAAO,IAAA,CAAK,OAAO,CAAC;AAAA,OACxD,IAAK,IAAA;AAAA,IACT;AACA,IAAA,IAAI,CAAC,KAAA,EAAO;AACV,MAAA,MAAM,IAAI,KAAA,CAAM,CAAA,iBAAA,EAAoB,OAAO,IAAA,CAAK,OAAO,CAAC,CAAA,CAAE,CAAA;AAAA,IAC5D;AACA,IAAA,MAAM,SAAA,GAAY,MAAM,8BAAA,CAA+B,GAAA,EAAK,KAAK,CAAA;AACjE,IAAA,MAAM,MAAA,GAAS,kBAAkB,KAAK,CAAA;AACtC,IAAA,IAAI,MAAA,EAAQ;AACV,MAAA,OAAO;AAAA,QACL,SAAS,KAAA,CAAM,GAAA;AAAA,QACf,SAAA,EAAW,MAAA;AAAA,QACX,UAAU,SAAA,CAAU,QAAA;AAAA,QACpB,aAAa,SAAA,CAAU,WAAA;AAAA,QACvB,MAAA,EAAQ;AAAA,OACV;AAAA,IACF;AACA,IAAA,OAAO;AAAA,MACL,SAAS,KAAA,CAAM,GAAA;AAAA,MACf,UAAU,SAAA,CAAU,QAAA;AAAA,MACpB,aAAa,SAAA,CAAU,WAAA;AAAA,MACvB,MAAA,EAAQ;AAAA,KACV;AAAA,EACF;AAEA,EAAA,IAAI,KAAK,SAAA,EAAW;AAClB,IAAA,IAAI,WAAA,GAA+B,IAAA;AACnC,IAAA,IAAI;AACF,MAAA,WAAA,GAAe,MAAM,IAAI,EAAA,CAAG,GAAA;AAAA,QAC1B,IAAA,CAAK;AAAA,OACP;AAAA,IACF,CAAA,CAAA,MAAQ;AAAA,IAER;AAEA,IAAA,IAAI,WAAA,EAAa;AACf,MAAA,MAAM,SAAA,GAAY,MAAM,8BAAA,CAA+B,GAAA,EAAK,WAAW,CAAA;AACvE,MAAA,MAAM,MAAA,GAAS,kBAAkB,WAAW,CAAA;AAC5C,MAAA,OAAO;AAAA,QACL,SAAS,WAAA,CAAY,GAAA;AAAA,QACrB,SAAA,EAAW,UAAU,IAAA,CAAK,SAAA;AAAA,QAC1B,UAAU,SAAA,CAAU,QAAA;AAAA,QACpB,aAAa,SAAA,CAAU,WAAA;AAAA,QACvB,MAAA,EAAQ;AAAA,OACV;AAAA,IACF;AAEA,IAAA,WAAA,GAAc,MAAM,gCAAA,CAAiC,GAAA,EAAK,IAAA,CAAK,SAAS,CAAA;AACxE,IAAA,IAAI,WAAA,EAAa;AACf,MAAA,MAAM,SAAA,GAAY,MAAM,8BAAA,CAA+B,GAAA,EAAK,WAAW,CAAA;AACvE,MAAA,MAAM,MAAA,GAAS,kBAAkB,WAAW,CAAA;AAC5C,MAAA,OAAO;AAAA,QACL,SAAS,WAAA,CAAY,GAAA;AAAA,QACrB,SAAA,EAAW,UAAU,IAAA,CAAK,SAAA;AAAA,QAC1B,UAAU,SAAA,CAAU,QAAA;AAAA,QACpB,aAAa,SAAA,CAAU,WAAA;AAAA,QACvB,MAAA,EAAQ;AAAA,OACV;AAAA,IACF;AAEA,IAAA,MAAM,MAAA,GAAS,MAAM,sBAAA,CAAuB,GAAA,EAAK,KAAK,SAAS,CAAA;AAC/D,IAAA,MAAM,OAAA,GAAU,iBAAiB,MAAM,CAAA;AACvC,IAAA,IAAI,OAAA,EAAS;AACX,MAAA,MAAM,SAAA,GAAY,MAAM,8BAAA,CAA+B,GAAA,EAAK,OAAO,CAAA;AACnE,MAAA,OAAO;AAAA,QACL,SAAS,OAAA,CAAQ,GAAA;AAAA,QACjB,WAAW,IAAA,CAAK,SAAA;AAAA,QAChB,UAAU,SAAA,CAAU,QAAA;AAAA,QACpB,aAAa,SAAA,CAAU,WAAA;AAAA,QACvB,MAAA,EAAQ;AAAA,OACV;AAAA,IACF;AACA,IAAA,MAAM,IAAI,KAAA;AAAA,MACR,CAAA,qBAAA,EAAwB,MAAA,CAAO,IAAA,CAAK,SAAS,CAAC,CAAA,qBAAA;AAAA,KAChD;AAAA,EACF;AAEA,EAAA,MAAM,IAAI,KAAA;AAAA,IACR;AAAA,GACF;AACF;CAGiC;AAAA,EAC/B,SAAA,EAAW,CAAA,CAAE,QAAA,CAAS,CAAA,CAAE,QAAQ,CAAA;AAAA,EAChC,OAAA,EAAS,CAAA,CAAE,QAAA,CAAS,CAAA,CAAE,QAAQ;AAChC;;;AC5QO,SAAS,kBAAkB,GAAA,EAAsC;AACtE,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,QAAA,EAAU;AACnC,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,UAAA,IAAc,GAAA,IAAQ,GAAA,CAAY,QAAA,EAAU,cAAA,EAAgB;AAC9D,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,OACE,aAAA,IAAiB,GAAA,IACjB,cAAA,IAAkB,GAAA,IAClB,cAAA,IAAkB,GAAA,IAClB,gBAAA,IAAoB,GAAA,IACnB,WAAA,IAAe,GAAA,IAAO,EAAE,eAAA,IAAmB,GAAA,CAAA;AAEhD;AAEO,SAAS,cAAc,GAAA,EAAsC;AAClE,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,QAAA,EAAU;AACnC,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,OACE,eAAA,IAAmB,OACnB,cAAA,IAAkB,GAAA,IAClB,cAAc,GAAA,IACd,eAAA,IAAmB,OACnB,gBAAA,IAAoB,GAAA;AAExB;AAEO,SAAS,kBAAkB,GAAA,EAAyC;AACzE,EAAA,MAAM,cAAA,GAAiB,KAAK,QAAA,EAAU,cAAA;AACtC,EAAA,OAAO,OAAO,mBAAmB,QAAA,IAAY,cAAA,CAAe,MAAK,CAAE,MAAA,GAAS,IACxE,cAAA,GACA,IAAA;AACN;AAEA,SAAS,cAAA,CACP,KACA,KAAA,EACA;AACA,EAAA,MAAM,KAAA,GAAQ,MAAM,KAAK,CAAA;AACzB,EAAA,OAAO,OAAO,UAAU,QAAA,IAAY,KAAA,CAAM,MAAK,CAAE,MAAA,GAAS,IACtD,KAAA,GACA,MAAA;AACN;AAEA,eAAe,2BAAA,CACb,KAOA,MAAA,EACiC;AACjC,EAAA,MAAM,QAAA,GACJ,OAAO,MAAA,CAAO,GAAA,KAAQ,QAAA,IAAY,OAAO,GAAA,CAAI,MAAA,GAAS,CAAA,GAAI,MAAA,CAAO,GAAA,GAAM,IAAA;AACzE,EAAA,IAAI,CAAC,QAAA,IAAY,OAAO,GAAA,CAAI,EAAA,CAAG,UAAU,UAAA,EAAY;AACnD,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,IAAI,OAAA,GAAU,cAAA,CAAe,MAAA,EAAQ,SAAS,CAAA;AAC9C,EAAA,IAAI,CAAC,OAAA,EAAS;AACZ,IAAA,IAAI;AACF,MAAA,MAAM,KAAA,GAAQ,MAAM,wBAAA,CAAyB,GAAA,EAAY;AAAA,QACvD,OAAA,EAAS,cAAA,CAAe,MAAA,EAAQ,SAAS,CAAA;AAAA,QACzC,SAAA,EAAW,cAAA,CAAe,MAAA,EAAQ,WAAW;AAAA,OAC9C,CAAA;AACD,MAAA,OAAA,GAAU,KAAA,CAAM,OAAA;AAAA,IAClB,CAAA,CAAA,MAAQ;AACN,MAAA,OAAA,GAAU,MAAA;AAAA,IACZ;AAAA,EACF;AAEA,EAAA,IAAI,CAAC,OAAA,EAAS;AACZ,IAAA,OAAO,IAAA;AAAA,EACT;AAEA,EAAA,MAAM,YAAa,MAAM,GAAA,CAAI,EAAA,CAC1B,KAAA,CAAM,WAAW,CAAA,CACjB,SAAA,CAAU,YAAA,EAAc,CAAC,MAAW,CAAA,CAAE,EAAA,CAAG,WAAW,OAAO,CAAC,EAC5D,OAAA,EAAQ;AAEX,EAAA,OACE,SAAA,CAAU,IAAA;AAAA,IACR,CAAC,QAAA,KACC,MAAA,CAAO,UAAU,QAAA,EAAU,cAAA,IAAkB,EAAE,CAAA,KAAM;AAAA,GACzD,IAAK,IAAA;AAET;AAEA,eAAsB,wBAAA,CACpB,KAMA,UAAA,EACmC;AACnC,EAAA,MAAM,KAAA,GAAkC;AAAA,IACtC,SAAS,UAAA,IAAc,IAAA;AAAA,IACvB,MAAA,EAAQ,IAAA;AAAA,IACR,QAAA,EAAU,IAAA;AAAA,IACV,QAAA,EAAU,IAAA;AAAA,IACV,UAAA,EAAY;AAAA,GACd;AAEA,EAAA,IAAI,CAAC,UAAA,EAAY;AACf,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,GAAA;AACJ,EAAA,IAAI;AACF,IAAA,GAAA,GAAM,MAAM,GAAA,CAAI,EAAA,CAAG,GAAA,CAAI,UAAiB,CAAA;AAAA,EAC1C,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,CAAC,GAAA,IAAO,OAAO,GAAA,KAAQ,QAAA,EAAU;AACnC,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,iBAAA,CAAkB,GAAG,CAAA,EAAG;AAC1B,IAAA,MAAMA,SAAAA,GAAW,MAAM,2BAAA,CAA4B,GAAA,EAAK,GAAG,CAAA;AAC3D,IAAA,OAAO;AAAA,MACL,GAAG,KAAA;AAAA,MACH,MAAA,EAAQ,GAAA;AAAA,MACR,QAAA,EAAAA,SAAAA;AAAA,MACA,QAAA,EACE,OAAO,GAAA,CAAI,GAAA,KAAQ,QAAA,IAAY,IAAI,GAAA,CAAI,MAAA,GAAS,CAAA,GAAI,GAAA,CAAI,GAAA,GAAM,UAAA;AAAA,MAChE,UAAA,EACEA,SAAAA,IAAY,OAAOA,SAAAA,CAAS,GAAA,KAAQ,QAAA,IAAYA,SAAAA,CAAS,GAAA,CAAI,MAAA,GAAS,CAAA,GAClEA,SAAAA,CAAS,GAAA,GACT,IAAA;AAAA,MACN,SACE,cAAA,CAAeA,SAAAA,EAAU,SAAS,CAAA,IAAK,cAAA,CAAe,KAAK,SAAS,CAAA;AAAA,MACtE,WACE,cAAA,CAAe,GAAA,EAAK,WAAW,CAAA,IAC/B,cAAA,CAAeA,WAAU,WAAW;AAAA,KACxC;AAAA,EACF;AAEA,EAAA,MAAM,QAAA,GAAW,GAAA;AACjB,EAAA,MAAM,cAAA,GAAiB,kBAAkB,QAAQ,CAAA;AACjD,EAAA,IAAI,MAAA,GAAiC,IAAA;AAErC,EAAA,IAAI,cAAA,EAAgB;AAClB,IAAA,IAAI;AACF,MAAA,MAAM,MAAA,GAAS,MAAM,GAAA,CAAI,EAAA,CAAG,IAAI,cAAqB,CAAA;AACrD,MAAA,IAAI,iBAAA,CAAkB,MAAM,CAAA,EAAG;AAC7B,QAAA,MAAA,GAAS,MAAA;AAAA,MACX;AAAA,IACF,CAAA,CAAA,MAAQ;AACN,MAAA,MAAA,GAAS,IAAA;AAAA,IACX;AAAA,EACF;AAEA,EAAA,OAAO;AAAA,IACL,GAAG,KAAA;AAAA,IACH,QAAA;AAAA,IACA,MAAA;AAAA,IACA,UAAA,EACE,OAAO,QAAA,CAAS,GAAA,KAAQ,QAAA,IAAY,SAAS,GAAA,CAAI,MAAA,GAAS,CAAA,GACtD,QAAA,CAAS,GAAA,GACT,UAAA;AAAA,IACN,QAAA,EACE,MAAA,IAAU,OAAO,MAAA,CAAO,GAAA,KAAQ,QAAA,IAAY,MAAA,CAAO,GAAA,CAAI,MAAA,GAAS,CAAA,GAC5D,MAAA,CAAO,GAAA,GACP,cAAA;AAAA,IACN,SACE,cAAA,CAAe,QAAA,EAAU,SAAS,CAAA,IAAK,cAAA,CAAe,QAAQ,SAAS,CAAA;AAAA,IACzE,WACE,cAAA,CAAe,MAAA,EAAQ,WAAW,CAAA,IAClC,cAAA,CAAe,UAAU,WAAW;AAAA,GACxC;AACF","file":"workflowBridge.js","sourcesContent":["import {\n  actionGeneric,\n  anyApi,\n  componentsGeneric,\n  httpActionGeneric,\n  internalActionGeneric,\n  internalMutationGeneric,\n  internalQueryGeneric,\n  mutationGeneric,\n  queryGeneric,\n} from \"convex/server\";\nimport type { GenericId } from \"convex/values\";\n\nexport const api = anyApi as any;\nexport const components = componentsGeneric() as any;\nexport const internal = anyApi as any;\n\nexport type TableNames = string;\nexport type Id<TableName extends TableNames = string> = GenericId<TableName>;\nexport type Doc<TableName extends TableNames = string> = any;\nexport type DataModel = any;\nexport type ActionCtx = any;\nexport type DatabaseReader = any;\nexport type DatabaseWriter = any;\nexport type MutationCtx = any;\nexport type QueryCtx = any;\n\nexport const action = actionGeneric as any;\nexport const httpAction = httpActionGeneric as any;\nexport const internalAction = internalActionGeneric as any;\nexport const internalMutation = internalMutationGeneric as any;\nexport const internalQuery = internalQueryGeneric as any;\nexport const mutation = mutationGeneric as any;\nexport const query = queryGeneric as any;\n","/** Topic-scope resolution helpers for graph-primitive operations. */\nimport { v } from \"convex/values\";\nimport { api as appApi } from \"./convex\";\nimport type { Id } from \"./convex\";\n\nconst LEGACY_SCOPE_FIELD = \"graphScope\" + \"ProjectId\";\n\ntype TopicDoc = Record<string, unknown> & {\n  _id: Id<\"topics\">;\n  globalId?: string;\n  name?: string;\n  depth?: number;\n  createdAt?: number;\n  parentTopicId?: Id<\"topics\">;\n  tenantId?: string;\n  workspaceId?: string;\n  metadata?: Record<string, unknown>;\n};\n\nexport type TopicProjectScope = {\n  topicId: Id<\"topics\">;\n  projectId?: string;\n  tenantId?: string;\n  workspaceId?: string;\n  source: \"topic\" | \"project_mapped_topic\" | \"topic_inferred\";\n};\n\ntype MaterializedTopicNodeDoc = {\n  _id: string | Id<\"epistemicNodes\">;\n  metadata?: Record<string, unknown>;\n};\n\nfunction asMappedProjectId(\n  topic: TopicDoc | null | undefined\n): string | undefined {\n  if (!topic) {\n    return;\n  }\n  const directLegacyProjectId = normalizeScopeValue(topic[LEGACY_SCOPE_FIELD]);\n  if (directLegacyProjectId) {\n    return directLegacyProjectId;\n  }\n  const metadata = (topic.metadata || {}) as Record<string, unknown>;\n  const candidate =\n    (metadata[LEGACY_SCOPE_FIELD] as string | undefined) ||\n    (metadata.legacyProjectId as string | undefined) ||\n    (metadata.projectId as string | undefined) ||\n    (metadata.scopeProjectId as string | undefined);\n  return candidate ? (candidate as string) : undefined;\n}\n\nfunction normalizeScopeValue(value: unknown): string | undefined {\n  if (typeof value !== \"string\") {\n    return;\n  }\n  const normalized = value.trim();\n  return normalized.length > 0 ? normalized : undefined;\n}\n\nfunction pickPrimaryTopic(candidates: TopicDoc[]): TopicDoc | undefined {\n  return [...candidates].sort((a, b) => {\n    const depthA = a.depth ?? 9999;\n    const depthB = b.depth ?? 9999;\n    if (depthA !== depthB) {\n      return depthA - depthB;\n    }\n    const createdA = a.createdAt ?? Number.MAX_SAFE_INTEGER;\n    const createdB = b.createdAt ?? Number.MAX_SAFE_INTEGER;\n    if (createdA !== createdB) {\n      return createdA - createdB;\n    }\n    return String(a.name || \"\").localeCompare(String(b.name || \"\"));\n  })[0];\n}\n\nasync function findTopicsByScopeAlias(ctx: any, scopeId: string): Promise<TopicDoc[]> {\n  try {\n    return (await ctx.db\n      .query(\"topics\")\n      .withIndex(\"by_graph_scope_project\", (q: any) =>\n        q.eq(LEGACY_SCOPE_FIELD, scopeId)\n      )\n      .collect()) as TopicDoc[];\n  } catch {\n    // Older Lucern dev deployments can lag index backfills while still carrying\n    // the underlying topics table. Scan and filter so scope resolution keeps\n    // working during the rollout.\n    const topics = (await ctx.db.query(\"topics\").collect()) as TopicDoc[];\n    return topics.filter((topic) => {\n      const normalizedGlobalId = normalizeScopeValue(topic.globalId);\n      const mappedProjectId = asMappedProjectId(topic);\n      return (\n        String(topic._id) === scopeId ||\n        normalizedGlobalId === scopeId ||\n        mappedProjectId === scopeId\n      );\n    });\n  }\n}\n\nasync function tryResolveHostTopicById(\n  ctx: any,\n  topicId: string\n): Promise<TopicDoc | null> {\n  if (typeof ctx.runQuery !== \"function\") {\n    return null;\n  }\n  try {\n    return ((await ctx.runQuery(appApi.topics.get as any, {\n      id: topicId,\n    })) ?? null) as TopicDoc | null;\n  } catch {\n    return null;\n  }\n}\n\nasync function tryResolveHostTopicByLegacyScope(\n  ctx: any,\n  legacyScopeId: string\n): Promise<TopicDoc | null> {\n  if (typeof ctx.runQuery !== \"function\") {\n    return null;\n  }\n  try {\n    return ((await ctx.runQuery(appApi.topics.getByLegacyScopeId as any, {\n      projectId: legacyScopeId,\n    })) ?? null) as TopicDoc | null;\n  } catch {\n    return null;\n  }\n}\n\nexport function readMaterializedTopicTableId(\n  topicNode: MaterializedTopicNodeDoc | null | undefined\n): string | undefined {\n  if (!topicNode) {\n    return;\n  }\n\n  const metadata = (topicNode.metadata || {}) as Record<string, unknown>;\n  const topicTableId =\n    (metadata.topicTableId as string | undefined) ||\n    (metadata.topicId as string | undefined);\n\n  return typeof topicTableId === \"string\" && topicTableId.trim().length > 0\n    ? topicTableId.trim()\n    : undefined;\n}\n\n/**\n * Walk the topic parent chain to find inherited workspaceId and tenantId.\n * Mirrors the pattern used by resolveTopicOntology for ontologyId inheritance.\n * Max depth: 10 (defensive limit against pathological nesting).\n */\nasync function resolveInheritedWorkspaceScope(\n  ctx: any,\n  topic: TopicDoc\n): Promise<{ tenantId?: string; workspaceId?: string }> {\n  const MAX_DEPTH = 10;\n  let tenantId = normalizeScopeValue(topic.tenantId);\n  let workspaceId = normalizeScopeValue(topic.workspaceId);\n\n  if (tenantId && workspaceId) {\n    return { tenantId, workspaceId };\n  }\n\n  let current: TopicDoc | null = topic;\n  for (let i = 0; i < MAX_DEPTH && current?.parentTopicId; i++) {\n    current = (await ctx.db.get(current.parentTopicId)) as TopicDoc | null;\n    if (!current) break;\n\n    if (!tenantId) {\n      tenantId = normalizeScopeValue(current.tenantId);\n    }\n    if (!workspaceId) {\n      workspaceId = normalizeScopeValue(current.workspaceId);\n    }\n    if (tenantId && workspaceId) break;\n  }\n\n  return { tenantId, workspaceId };\n}\n\nexport async function resolveTopicProjectScope(\n  ctx: any,\n  args: { topicId?: Id<\"topics\"> | string; projectId?: string }\n): Promise<TopicProjectScope> {\n  if (args.topicId) {\n    // Try direct lookup, fall back to the legacy mapped-project bridge\n    let topic: TopicDoc | null = null;\n    try {\n      topic = (await ctx.db.get(args.topicId as Id<\"topics\">)) as TopicDoc | null;\n    } catch {\n      // Not a valid topics table ID\n    }\n    if (!topic) {\n      topic = await tryResolveHostTopicById(ctx, String(args.topicId));\n    }\n    if (!topic) {\n      // Try as legacy projectId / globalId via the mapped-project bridge.\n      topic =\n        pickPrimaryTopic(\n          await findTopicsByScopeAlias(ctx, String(args.topicId))\n        ) ?? null;\n    }\n    if (!topic) {\n      throw new Error(`Topic not found: ${String(args.topicId)}`);\n    }\n    const inherited = await resolveInheritedWorkspaceScope(ctx, topic);\n    const mapped = asMappedProjectId(topic);\n    if (mapped) {\n      return {\n        topicId: topic._id,\n        projectId: mapped,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"topic\",\n      };\n    }\n    return {\n      topicId: topic._id,\n      tenantId: inherited.tenantId,\n      workspaceId: inherited.workspaceId,\n      source: \"topic\",\n    };\n  }\n\n  if (args.projectId) {\n    let directTopic: TopicDoc | null = null;\n    try {\n      directTopic = (await ctx.db.get(\n        args.projectId as Id<\"topics\">\n      )) as TopicDoc | null;\n    } catch {\n      // Not a valid topics table ID, continue to legacy graph-scope lookup.\n    }\n\n    if (directTopic) {\n      const inherited = await resolveInheritedWorkspaceScope(ctx, directTopic);\n      const mapped = asMappedProjectId(directTopic);\n      return {\n        topicId: directTopic._id,\n        projectId: mapped ?? args.projectId,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"topic_inferred\",\n      };\n    }\n\n    directTopic = await tryResolveHostTopicByLegacyScope(ctx, args.projectId);\n    if (directTopic) {\n      const inherited = await resolveInheritedWorkspaceScope(ctx, directTopic);\n      const mapped = asMappedProjectId(directTopic);\n      return {\n        topicId: directTopic._id,\n        projectId: mapped ?? args.projectId,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"topic_inferred\",\n      };\n    }\n\n    const topics = await findTopicsByScopeAlias(ctx, args.projectId);\n    const primary = pickPrimaryTopic(topics);\n    if (primary) {\n      const inherited = await resolveInheritedWorkspaceScope(ctx, primary);\n      return {\n        topicId: primary._id,\n        projectId: args.projectId,\n        tenantId: inherited.tenantId,\n        workspaceId: inherited.workspaceId,\n        source: \"project_mapped_topic\",\n      };\n    }\n    throw new Error(\n      `Legacy project scope ${String(args.projectId)} has no mapped topic.`\n    );\n  }\n\n  throw new Error(\n    \"Missing scope: provide topicId (preferred) or legacy projectId alias.\"\n  );\n}\n\n/** Shared scope args for graph-primitive functions. topicId is canonical; projectId is a legacy alias. */\nexport const optionalScopeArgs = {\n  projectId: v.optional(v.string()),\n  topicId: v.optional(v.string()),\n} as const;\n","import { resolveTopicProjectScope } from \"./topicScope\";\n\nexport type WorkflowLikeDoc = {\n  _id?: string;\n  topicId?: string;\n  projectId?: string;\n  metadata?: Record<string, unknown>;\n  [key: string]: unknown;\n};\n\nexport type WorkflowBridgeResolution = {\n  inputId: string | null;\n  sprint: WorkflowLikeDoc | null;\n  worktree: WorkflowLikeDoc | null;\n  sprintId: string | null;\n  worktreeId: string | null;\n  topicId?: string;\n  projectId?: string;\n};\n\nexport function isLegacySprintDoc(doc: unknown): doc is WorkflowLikeDoc {\n  if (!doc || typeof doc !== \"object\") {\n    return false;\n  }\n\n  if (\"metadata\" in doc && (doc as any).metadata?.pairedSprintId) {\n    return false;\n  }\n\n  return (\n    \"sprintScope\" in doc ||\n    \"targetPillar\" in doc ||\n    \"pillarThesis\" in doc ||\n    \"synthesisState\" in doc ||\n    (\"projectId\" in doc && !(\"worktreeScope\" in doc))\n  );\n}\n\nexport function isWorktreeDoc(doc: unknown): doc is WorkflowLikeDoc {\n  if (!doc || typeof doc !== \"object\") {\n    return false;\n  }\n\n  return (\n    \"worktreeScope\" in doc ||\n    \"targetBranch\" in doc ||\n    \"campaign\" in doc ||\n    \"executionBand\" in doc ||\n    \"proofArtifacts\" in doc\n  );\n}\n\nexport function getPairedSprintId(doc: WorkflowLikeDoc | null | undefined) {\n  const pairedSprintId = doc?.metadata?.pairedSprintId;\n  return typeof pairedSprintId === \"string\" && pairedSprintId.trim().length > 0\n    ? pairedSprintId\n    : null;\n}\n\nfunction getStringField(\n  doc: WorkflowLikeDoc | null | undefined,\n  field: \"topicId\" | \"projectId\"\n) {\n  const value = doc?.[field];\n  return typeof value === \"string\" && value.trim().length > 0\n    ? value\n    : undefined;\n}\n\nasync function findPairedWorktreeForSprint(\n  ctx: {\n    db: {\n      query?: (...args: any[]) => {\n        withIndex: (...args: any[]) => { collect: () => Promise<unknown[]> };\n      };\n    };\n  },\n  sprint: WorkflowLikeDoc\n): Promise<WorkflowLikeDoc | null> {\n  const sprintId =\n    typeof sprint._id === \"string\" && sprint._id.length > 0 ? sprint._id : null;\n  if (!sprintId || typeof ctx.db.query !== \"function\") {\n    return null;\n  }\n\n  let topicId = getStringField(sprint, \"topicId\");\n  if (!topicId) {\n    try {\n      const scope = await resolveTopicProjectScope(ctx as any, {\n        topicId: getStringField(sprint, \"topicId\"),\n        projectId: getStringField(sprint, \"projectId\"),\n      });\n      topicId = scope.topicId;\n    } catch {\n      topicId = undefined;\n    }\n  }\n\n  if (!topicId) {\n    return null;\n  }\n\n  const worktrees = (await ctx.db\n    .query(\"worktrees\")\n    .withIndex(\"by_topicId\", (q: any) => q.eq(\"topicId\", topicId))\n    .collect()) as WorkflowLikeDoc[];\n\n  return (\n    worktrees.find(\n      (worktree) =>\n        String(worktree?.metadata?.pairedSprintId || \"\") === sprintId\n    ) ?? null\n  );\n}\n\nexport async function resolveWorkflowBridgeDoc(\n  ctx: {\n    db: {\n      get: (...args: any[]) => Promise<unknown>;\n      query?: (...args: any[]) => any;\n    };\n  },\n  workflowId: string | null | undefined\n): Promise<WorkflowBridgeResolution> {\n  const empty: WorkflowBridgeResolution = {\n    inputId: workflowId ?? null,\n    sprint: null,\n    worktree: null,\n    sprintId: null,\n    worktreeId: null,\n  };\n\n  if (!workflowId) {\n    return empty;\n  }\n\n  let doc: unknown;\n  try {\n    doc = await ctx.db.get(workflowId as any);\n  } catch {\n    return empty;\n  }\n\n  if (!doc || typeof doc !== \"object\") {\n    return empty;\n  }\n\n  if (isLegacySprintDoc(doc)) {\n    const worktree = await findPairedWorktreeForSprint(ctx, doc);\n    return {\n      ...empty,\n      sprint: doc,\n      worktree,\n      sprintId:\n        typeof doc._id === \"string\" && doc._id.length > 0 ? doc._id : workflowId,\n      worktreeId:\n        worktree && typeof worktree._id === \"string\" && worktree._id.length > 0\n          ? worktree._id\n          : null,\n      topicId:\n        getStringField(worktree, \"topicId\") ?? getStringField(doc, \"topicId\"),\n      projectId:\n        getStringField(doc, \"projectId\") ??\n        getStringField(worktree, \"projectId\"),\n    };\n  }\n\n  const worktree = doc as WorkflowLikeDoc;\n  const pairedSprintId = getPairedSprintId(worktree);\n  let sprint: WorkflowLikeDoc | null = null;\n\n  if (pairedSprintId) {\n    try {\n      const paired = await ctx.db.get(pairedSprintId as any);\n      if (isLegacySprintDoc(paired)) {\n        sprint = paired;\n      }\n    } catch {\n      sprint = null;\n    }\n  }\n\n  return {\n    ...empty,\n    worktree,\n    sprint,\n    worktreeId:\n      typeof worktree._id === \"string\" && worktree._id.length > 0\n        ? worktree._id\n        : workflowId,\n    sprintId:\n      sprint && typeof sprint._id === \"string\" && sprint._id.length > 0\n        ? sprint._id\n        : pairedSprintId,\n    topicId:\n      getStringField(worktree, \"topicId\") ?? getStringField(sprint, \"topicId\"),\n    projectId:\n      getStringField(sprint, \"projectId\") ??\n      getStringField(worktree, \"projectId\"),\n  };\n}\n"]}