@glassly/engine 0.4.0-dev.1037 → 0.4.0-dev.1039

package/build/utils/display/scene/svgPath.js.map

@@ -1 +1 @@
-{"version":3,"file":"svgPath.js","sourceRoot":"","sources":["../../../../src/utils/display/scene/svgPath.ts"],"names":[],"mappings":"AAAA;oFACoF;AACpF,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;AACrD,SAAS,OAAO,CAAC,CAAS,EAAE,GAAW,EAAE,GAAW,EAAE,IAAY;IAChE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,YAAY,GAAG,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,CAAA;IACvG,OAAO,CAAC,CAAA;AACV,CAAC;AACD;gFACgF;AAChF,MAAM,UAAU,OAAO,CAAC,CAAS;IAC/B,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,wDAAwD,CAAC,IAAI,EAAE,CAAA;IACtF,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,wDAAwD,EAAE,EAAE,CAAC,CAAA;IACvF,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAA;IACtE,IAAI,CAAC,GAAG,CAAC,EACP,GAAG,GAAG,EAAE,EACR,CAAC,GAAG,CAAC,EACL,CAAC,GAAG,CAAC,EACL,EAAE,GAAG,CAAC,EACN,EAAE,GAAG,CAAC,EACN,IAAI,GAAG,KAAK,EACZ,QAAQ,GAAG,EAAE,CAAA;IACf,IAAI,EAAE,GAAG,CAAC,EACR,EAAE,GAAG,CAAC,CAAA;IACR,MAAM,GAAG,GAAa,EAAE,CAAA;IACxB,MAAM,IAAI,GAAG,CAAC,EAAU,EAAE,GAAG,MAAgB,EAAE,EAAE;QAC/C,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1G,CAAC,CAAA;IACD,MAAM,MAAM,GAAG,GAAG,EAAE;QAClB,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAA;QAC/F,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC7B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAA;QAC1D,OAAO,CAAC,CAAA;IACV,CAAC,CAAA;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QACzB,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAAE,GAAG,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAA;QACjD,IAAI,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,EAAE,CAAC,CAAA;QAC3F,MAAM,EAAE,GAAG,GAAG,CAAC,WAAW,EAAE,EAC1B,GAAG,GAAG,GAAG,KAAK,EAAE,CAAA;QAClB,MAAM,IAAI,GAAG,GAAqB,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACzF,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,IAAI,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;YACvD,IAAI,CAAC,CAAC,CAAC,CAAA;YACP,CAAC,GAAG,EAAE,CAAA;YACN,CAAC,GAAG,EAAE,CAAA;YACN,IAAI,GAAG,KAAK,CAAA;YACZ,QAAQ,GAAG,GAAG,CAAA;YACd,GAAG,GAAG,EAAE,CAAA;YACR,SAAQ;QACV,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAA;QAClE,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,IAAI,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAC9E;YAAA,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAA;YAChB,EAAE,GAAG,CAAC,CAAA;YACN,EAAE,GAAG,CAAC,CAAA;YACN,IAAI,GAAG,IAAI,CAAA;YACX,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YACb,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAA;QACvB,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAClD,IAAI,EAAE,KAAK,GAAG;gBAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAA;iBAC1B,IAAI,EAAE,KAAK,GAAG;gBAAE,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;;gBAC5C,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACjC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QACf,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,QAAQ,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACxG,MAAM,GAAG,GAAG,IAAI,EAAE,CAAA;YAClB,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CACpB;YAAA,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CACZ;YAAA,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAA;QACf,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,QAAQ,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACxG,MAAM,CAAC,GAAG,IAAI,EAAE,EACd,GAAG,GAAG,IAAI,EAAE,CAAA;YACd,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAC1B;YAAA,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CACZ;YAAA,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAA;QACf,CAAC;QACD,QAAQ,GAAG,EAAE,CAAA;IACf,CAAC;IACD,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;IAClF,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,cAAc,CAAC,CAAS;IACtC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAA;IACvF,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;IAC3B,IAAI,QAAQ,CAAC,MAAM,GAAG,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAA;IAClF,IAAI,KAAK,GAAG,CAAC,EACX,KAAK,GAAG,CAAC,EACT,CAAC,GAAG,CAAC,EACL,CAAC,GAAG,CAAC,EACL,EAAE,GAAG,CAAC,EACN,EAAE,GAAG,CAAC,CAAA;IACR,MAAM,IAAI,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAE;QAC9D,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAA;IACvG,CAAC,CAAA;IACD,MAAM,KAAK,GAAG,CAAC,CAAW,EAAE,KAAa,EAAQ,EAAE;QACjD,MAAM,CAAC,GAAG;YACR,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC3B,CAAA;QACD,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC5B,OAAM;QACR,CAAC;QACD,IAAI,KAAK,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAA;QACvE,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,EAC5B,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAA;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAC1C,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAC1C,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EACnC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAC/B,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YACnC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACX,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YACb,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;YACd,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;YACd,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;YACV,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;YACd,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YACb,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACrB,CAAC;QACD,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;QACnB,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;IACrB,CAAC,CAAA;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAI,CAAC;QACtC,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,EACtB,KAAK,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACxD,IAAI,EAAE,KAAK,GAAG,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAA;QACrE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC;YAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;QACxG,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACf,CAAC;aAAM,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;YAClB,CAAC,GAAG,EAAE,CAAA;YACN,CAAC,GAAG,EAAE,CAAA;QACR,CAAC;aAAM,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACtB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACR,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACV,CAAC;aAAM,CAAC;YACN,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBACb,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;gBACX,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;gBACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;oBACpD,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBAClD,CAAC;YACH,CAAC;YACD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACX,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACR,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACV,CAAC;IACH,CAAC;IACD,OAAO,EAAC,QAAQ,EAAE,KAAK,EAAC,CAAA;AAC1B,CAAC","sourcesContent":["/** SVG path compiler shared by scene validation and native wire encoding.\n * Ported from g2flash revision 21; no DOM, Node or mobile-platform dependencies. */\nconst u16 = (v: number) => [v & 255, (v >>> 8) & 255]\nfunction integer(v: number, min: number, max: number, name: string): number {\n  if (!Number.isInteger(v) || v < min || v > max) throw new Error(`${name} outside ${min}..${max}: ${v}`)\n  return v\n}\n/** SVG d subset: absolute/relative M L H V Q C S T Z; implicit repetitions.\n * Unsupported syntax is rejected. Each filled contour must explicitly close. */\nexport function svgPath(d: string): number[] {\n  const tokens = d.match(/[a-zA-Z]|[-+]?(?:\\d*\\.\\d+|\\d+\\.?\\d*)(?:[eE][-+]?\\d+)?/g) ?? []\n  const residue = d.replace(/[a-zA-Z]|[-+]?(?:\\d*\\.\\d+|\\d+\\.?\\d*)(?:[eE][-+]?\\d+)?/g, \"\")\n  if (/[^\\s,]/.test(residue)) throw new Error(\"Invalid SVG path syntax\")\n  let i = 0,\n    cmd = \"\",\n    x = 0,\n    y = 0,\n    sx = 0,\n    sy = 0,\n    open = false,\n    previous = \"\"\n  let cx = 0,\n    cy = 0\n  const out: number[] = []\n  const emit = (op: number, ...coords: number[]) => {\n    out.push(op, ...coords.flatMap((v) => u16(integer(Math.round(v * 16), -32768, 32767, \"Q4 coordinate\"))))\n  }\n  const number = () => {\n    if (i >= tokens.length || /^[a-z]$/i.test(tokens[i])) throw new Error(\"Missing SVG coordinate\")\n    const v = Number(tokens[i++])\n    if (!Number.isFinite(v)) throw new Error(\"Invalid number\")\n    return v\n  }\n  while (i < tokens.length) {\n    if (/^[a-z]$/i.test(tokens[i])) cmd = tokens[i++]\n    if (!cmd || !/^[MLHVQCSTZ]$/i.test(cmd)) throw new Error(`Unsupported SVG command: ${cmd}`)\n    const op = cmd.toUpperCase(),\n      rel = cmd !== op\n    const pair = (): [number, number] => [number() + (rel ? x : 0), number() + (rel ? y : 0)]\n    if (op === \"Z\") {\n      if (!open) throw new Error(\"Z without an open contour\")\n      emit(4)\n      x = sx\n      y = sy\n      open = false\n      previous = \"Z\"\n      cmd = \"\"\n      continue\n    }\n    if (op !== \"M\" && !open) throw new Error(\"Path must start with M\")\n    if (op === \"M\") {\n      if (open) throw new Error(\"Filled contours must close with Z before another M\")\n      ;[x, y] = pair()\n      sx = x\n      sy = y\n      open = true\n      emit(0, x, y)\n      cmd = rel ? \"l\" : \"L\"\n    } else if (op === \"L\" || op === \"H\" || op === \"V\") {\n      if (op === \"L\") [x, y] = pair()\n      else if (op === \"H\") x = number() + (rel ? x : 0)\n      else y = number() + (rel ? y : 0)\n      emit(1, x, y)\n    } else if (op === \"Q\" || op === \"T\") {\n      const c = op === \"Q\" ? pair() : previous === \"Q\" || previous === \"T\" ? [2 * x - cx, 2 * y - cy] : [x, y]\n      const end = pair()\n      emit(2, ...c, ...end)\n      ;[cx, cy] = c\n      ;[x, y] = end\n    } else {\n      const a = op === \"C\" ? pair() : previous === \"C\" || previous === \"S\" ? [2 * x - cx, 2 * y - cy] : [x, y]\n      const b = pair(),\n        end = pair()\n      emit(3, ...a, ...b, ...end)\n      ;[cx, cy] = b\n      ;[x, y] = end\n    }\n    previous = op\n  }\n  if (open || !out.length) throw new Error(\"Expected explicitly closed filled path\")\n  return out\n}\n\n/** Check the same fixed-point subdivision and budgets as revision 21 firmware. */\nexport function compileSvgPath(d: string): {commands: number[]; edges: number} {\n  if (typeof d !== \"string\" || d.length > 65536) throw new Error(\"Invalid SVG path data\")\n  const commands = svgPath(d)\n  if (commands.length > 8192) throw new Error(\"SVG path exceeds 8192 command bytes\")\n  let edges = 0,\n    count = 0,\n    x = 0,\n    y = 0,\n    sx = 0,\n    sy = 0\n  const edge = (ax: number, ay: number, bx: number, by: number) => {\n    if ((ax !== bx || ay !== by) && ++edges > 512) throw new Error(\"SVG path exceeds 512 compiled edges\")\n  }\n  const curve = (p: number[], depth: number): void => {\n    const u = [\n      3 * p[2] - 2 * p[0] - p[6],\n      3 * p[3] - 2 * p[1] - p[7],\n      3 * p[4] - 2 * p[6] - p[0],\n      3 * p[5] - 2 * p[7] - p[1],\n    ]\n    if (u.every((v) => Math.abs(v) <= 16)) {\n      edge(p[0], p[1], p[6], p[7])\n      return\n    }\n    if (depth === 8) throw new Error(\"SVG curve exceeds subdivision limit\")\n    const a = new Array<number>(8),\n      b = new Array<number>(8)\n    for (let k = 0; k < 2; k++) {\n      const ab = Math.trunc((p[k] + p[k + 2]) / 2),\n        bc = Math.trunc((p[k + 2] + p[k + 4]) / 2),\n        cd = Math.trunc((p[k + 4] + p[k + 6]) / 2)\n      const abc = Math.trunc((ab + bc) / 2),\n        bcd = Math.trunc((bc + cd) / 2),\n        mid = Math.trunc((abc + bcd) / 2)\n      a[k] = p[k]\n      a[k + 2] = ab\n      a[k + 4] = abc\n      a[k + 6] = mid\n      b[k] = mid\n      b[k + 2] = bcd\n      b[k + 4] = cd\n      b[k + 6] = p[k + 6]\n    }\n    curve(a, depth + 1)\n    curve(b, depth + 1)\n  }\n  for (let i = 0; i < commands.length; ) {\n    const op = commands[i++],\n      pairs = op === 4 ? 0 : op === 3 ? 3 : op === 2 ? 2 : 1\n    if (++count > 1024) throw new Error(\"SVG path exceeds 1024 commands\")\n    const p = [x, y]\n    for (let k = 0; k < pairs * 2; k++, i += 2) p.push(((commands[i] | (commands[i + 1] << 8)) << 16) >> 16)\n    if (op === 0) {\n      x = sx = p[2]\n      y = sy = p[3]\n    } else if (op === 4) {\n      edge(x, y, sx, sy)\n      x = sx\n      y = sy\n    } else if (op === 1) {\n      edge(x, y, p[2], p[3])\n      x = p[2]\n      y = p[3]\n    } else {\n      if (op === 2) {\n        p[6] = p[4]\n        p[7] = p[5]\n        for (let k = 0; k < 2; k++) {\n          p[k + 4] = Math.trunc((p[k + 6] + 2 * p[k + 2]) / 3)\n          p[k + 2] = Math.trunc((p[k] + 2 * p[k + 2]) / 3)\n        }\n      }\n      curve(p, 0)\n      x = p[6]\n      y = p[7]\n    }\n  }\n  return {commands, edges}\n}\n"]}
+{"version":3,"file":"svgPath.js","sourceRoot":"","sources":["../../../../src/utils/display/scene/svgPath.ts"],"names":[],"mappings":"AAAA;oFACoF;AACpF,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;AACrD,SAAS,OAAO,CAAC,CAAS,EAAE,GAAW,EAAE,GAAW,EAAE,IAAY;IAChE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,YAAY,GAAG,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,CAAA;IACvG,OAAO,CAAC,CAAA;AACV,CAAC;AACD;gFACgF;AAChF,MAAM,UAAU,OAAO,CAAC,CAAS;IAC/B,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,wDAAwD,CAAC,IAAI,EAAE,CAAA;IACtF,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,wDAAwD,EAAE,EAAE,CAAC,CAAA;IACvF,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAA;IACtE,IAAI,CAAC,GAAG,CAAC,EACP,GAAG,GAAG,EAAE,EACR,CAAC,GAAG,CAAC,EACL,CAAC,GAAG,CAAC,EACL,EAAE,GAAG,CAAC,EACN,EAAE,GAAG,CAAC,EACN,IAAI,GAAG,KAAK,EACZ,QAAQ,GAAG,EAAE,CAAA;IACf,IAAI,EAAE,GAAG,CAAC,EACR,EAAE,GAAG,CAAC,CAAA;IACR,MAAM,GAAG,GAAa,EAAE,CAAA;IACxB,MAAM,IAAI,GAAG,CAAC,EAAU,EAAE,GAAG,MAAgB,EAAE,EAAE;QAC/C,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1G,CAAC,CAAA;IACD,MAAM,MAAM,GAAG,GAAG,EAAE;QAClB,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAA;QAC/F,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC7B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAA;QAC1D,OAAO,CAAC,CAAA;IACV,CAAC,CAAA;IACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QACzB,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAAE,GAAG,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAA;QACjD,IAAI,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,EAAE,CAAC,CAAA;QAC3F,MAAM,EAAE,GAAG,GAAG,CAAC,WAAW,EAAE,EAC1B,GAAG,GAAG,GAAG,KAAK,EAAE,CAAA;QAClB,MAAM,IAAI,GAAG,GAAqB,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACzF,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,IAAI,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;YACvD,IAAI,CAAC,CAAC,CAAC,CAAA;YACP,CAAC,GAAG,EAAE,CAAA;YACN,CAAC,GAAG,EAAE,CAAA;YACN,IAAI,GAAG,KAAK,CAAA;YACZ,QAAQ,GAAG,GAAG,CAAA;YACd,GAAG,GAAG,EAAE,CAAA;YACR,SAAQ;QACV,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAA;QAClE,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,IAAI,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAC9E;YAAA,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAA;YAChB,EAAE,GAAG,CAAC,CAAA;YACN,EAAE,GAAG,CAAC,CAAA;YACN,IAAI,GAAG,IAAI,CAAA;YACX,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;YACb,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAA;QACvB,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAClD,IAAI,EAAE,KAAK,GAAG;gBAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAAE,CAAA;iBAC1B,IAAI,EAAE,KAAK,GAAG;gBAAE,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;;gBAC5C,CAAC,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACjC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;QACf,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,QAAQ,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACxG,MAAM,GAAG,GAAG,IAAI,EAAE,CAAA;YAClB,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CACpB;YAAA,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CACZ;YAAA,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAA;QACf,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,QAAQ,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACxG,MAAM,CAAC,GAAG,IAAI,EAAE,EACd,GAAG,GAAG,IAAI,EAAE,CAAA;YACd,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAC1B;YAAA,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CACZ;YAAA,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAA;QACf,CAAC;QACD,QAAQ,GAAG,EAAE,CAAA;IACf,CAAC;IACD,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM;QAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;IAClF,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,cAAc,CAAC,CAAS;IACtC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAA;IACvF,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;IAC3B,IAAI,QAAQ,CAAC,MAAM,GAAG,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAA;IAClF,IAAI,KAAK,GAAG,CAAC,EACX,KAAK,GAAG,CAAC,EACT,CAAC,GAAG,CAAC,EACL,CAAC,GAAG,CAAC,EACL,EAAE,GAAG,CAAC,EACN,EAAE,GAAG,CAAC,CAAA;IACR,MAAM,IAAI,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAE;QAC9D,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAA;IACvG,CAAC,CAAA;IACD,MAAM,KAAK,GAAG,CAAC,CAAW,EAAE,KAAa,EAAQ,EAAE;QACjD,MAAM,CAAC,GAAG;YACR,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC3B,CAAA;QACD,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC5B,OAAM;QACR,CAAC;QACD,IAAI,KAAK,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAA;QACvE,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,EAC5B,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAA;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAC1C,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAC1C,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EACnC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAC/B,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YACnC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACX,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YACb,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;YACd,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;YACd,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAA;YACV,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAA;YACd,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAA;YACb,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACrB,CAAC;QACD,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;QACnB,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;IACrB,CAAC,CAAA;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC;QACrC,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,EACtB,KAAK,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACxD,IAAI,EAAE,KAAK,GAAG,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAA;QACrE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC;YAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;QACxG,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACb,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACf,CAAC;aAAM,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;YAClB,CAAC,GAAG,EAAE,CAAA;YACN,CAAC,GAAG,EAAE,CAAA;QACR,CAAC;aAAM,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACtB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACR,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACV,CAAC;aAAM,CAAC;YACN,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBACb,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;gBACX,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;gBACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;oBACpD,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;gBAClD,CAAC;YACH,CAAC;YACD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACX,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACR,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACV,CAAC;IACH,CAAC;IACD,OAAO,EAAC,QAAQ,EAAE,KAAK,EAAC,CAAA;AAC1B,CAAC","sourcesContent":["/** SVG path compiler shared by scene validation and native wire encoding.\n * Ported from g2flash revision 21; no DOM, Node or mobile-platform dependencies. */\nconst u16 = (v: number) => [v & 255, (v >>> 8) & 255]\nfunction integer(v: number, min: number, max: number, name: string): number {\n  if (!Number.isInteger(v) || v < min || v > max) throw new Error(`${name} outside ${min}..${max}: ${v}`)\n  return v\n}\n/** SVG d subset: absolute/relative M L H V Q C S T Z; implicit repetitions.\n * Unsupported syntax is rejected. Each filled contour must explicitly close. */\nexport function svgPath(d: string): number[] {\n  const tokens = d.match(/[a-zA-Z]|[-+]?(?:\\d*\\.\\d+|\\d+\\.?\\d*)(?:[eE][-+]?\\d+)?/g) ?? []\n  const residue = d.replace(/[a-zA-Z]|[-+]?(?:\\d*\\.\\d+|\\d+\\.?\\d*)(?:[eE][-+]?\\d+)?/g, \"\")\n  if (/[^\\s,]/.test(residue)) throw new Error(\"Invalid SVG path syntax\")\n  let i = 0,\n    cmd = \"\",\n    x = 0,\n    y = 0,\n    sx = 0,\n    sy = 0,\n    open = false,\n    previous = \"\"\n  let cx = 0,\n    cy = 0\n  const out: number[] = []\n  const emit = (op: number, ...coords: number[]) => {\n    out.push(op, ...coords.flatMap((v) => u16(integer(Math.round(v * 16), -32768, 32767, \"Q4 coordinate\"))))\n  }\n  const number = () => {\n    if (i >= tokens.length || /^[a-z]$/i.test(tokens[i])) throw new Error(\"Missing SVG coordinate\")\n    const v = Number(tokens[i++])\n    if (!Number.isFinite(v)) throw new Error(\"Invalid number\")\n    return v\n  }\n  while (i < tokens.length) {\n    if (/^[a-z]$/i.test(tokens[i])) cmd = tokens[i++]\n    if (!cmd || !/^[MLHVQCSTZ]$/i.test(cmd)) throw new Error(`Unsupported SVG command: ${cmd}`)\n    const op = cmd.toUpperCase(),\n      rel = cmd !== op\n    const pair = (): [number, number] => [number() + (rel ? x : 0), number() + (rel ? y : 0)]\n    if (op === \"Z\") {\n      if (!open) throw new Error(\"Z without an open contour\")\n      emit(4)\n      x = sx\n      y = sy\n      open = false\n      previous = \"Z\"\n      cmd = \"\"\n      continue\n    }\n    if (op !== \"M\" && !open) throw new Error(\"Path must start with M\")\n    if (op === \"M\") {\n      if (open) throw new Error(\"Filled contours must close with Z before another M\")\n      ;[x, y] = pair()\n      sx = x\n      sy = y\n      open = true\n      emit(0, x, y)\n      cmd = rel ? \"l\" : \"L\"\n    } else if (op === \"L\" || op === \"H\" || op === \"V\") {\n      if (op === \"L\") [x, y] = pair()\n      else if (op === \"H\") x = number() + (rel ? x : 0)\n      else y = number() + (rel ? y : 0)\n      emit(1, x, y)\n    } else if (op === \"Q\" || op === \"T\") {\n      const c = op === \"Q\" ? pair() : previous === \"Q\" || previous === \"T\" ? [2 * x - cx, 2 * y - cy] : [x, y]\n      const end = pair()\n      emit(2, ...c, ...end)\n      ;[cx, cy] = c\n      ;[x, y] = end\n    } else {\n      const a = op === \"C\" ? pair() : previous === \"C\" || previous === \"S\" ? [2 * x - cx, 2 * y - cy] : [x, y]\n      const b = pair(),\n        end = pair()\n      emit(3, ...a, ...b, ...end)\n      ;[cx, cy] = b\n      ;[x, y] = end\n    }\n    previous = op\n  }\n  if (open || !out.length) throw new Error(\"Expected explicitly closed filled path\")\n  return out\n}\n\n/** Check the same fixed-point subdivision and budgets as revision 21 firmware. */\nexport function compileSvgPath(d: string): {commands: number[]; edges: number} {\n  if (typeof d !== \"string\" || d.length > 65536) throw new Error(\"Invalid SVG path data\")\n  const commands = svgPath(d)\n  if (commands.length > 8192) throw new Error(\"SVG path exceeds 8192 command bytes\")\n  let edges = 0,\n    count = 0,\n    x = 0,\n    y = 0,\n    sx = 0,\n    sy = 0\n  const edge = (ax: number, ay: number, bx: number, by: number) => {\n    if ((ax !== bx || ay !== by) && ++edges > 512) throw new Error(\"SVG path exceeds 512 compiled edges\")\n  }\n  const curve = (p: number[], depth: number): void => {\n    const u = [\n      3 * p[2] - 2 * p[0] - p[6],\n      3 * p[3] - 2 * p[1] - p[7],\n      3 * p[4] - 2 * p[6] - p[0],\n      3 * p[5] - 2 * p[7] - p[1],\n    ]\n    if (u.every((v) => Math.abs(v) <= 16)) {\n      edge(p[0], p[1], p[6], p[7])\n      return\n    }\n    if (depth === 8) throw new Error(\"SVG curve exceeds subdivision limit\")\n    const a = new Array<number>(8),\n      b = new Array<number>(8)\n    for (let k = 0; k < 2; k++) {\n      const ab = Math.trunc((p[k] + p[k + 2]) / 2),\n        bc = Math.trunc((p[k + 2] + p[k + 4]) / 2),\n        cd = Math.trunc((p[k + 4] + p[k + 6]) / 2)\n      const abc = Math.trunc((ab + bc) / 2),\n        bcd = Math.trunc((bc + cd) / 2),\n        mid = Math.trunc((abc + bcd) / 2)\n      a[k] = p[k]\n      a[k + 2] = ab\n      a[k + 4] = abc\n      a[k + 6] = mid\n      b[k] = mid\n      b[k + 2] = bcd\n      b[k + 4] = cd\n      b[k + 6] = p[k + 6]\n    }\n    curve(a, depth + 1)\n    curve(b, depth + 1)\n  }\n  for (let i = 0; i < commands.length;) {\n    const op = commands[i++],\n      pairs = op === 4 ? 0 : op === 3 ? 3 : op === 2 ? 2 : 1\n    if (++count > 1024) throw new Error(\"SVG path exceeds 1024 commands\")\n    const p = [x, y]\n    for (let k = 0; k < pairs * 2; k++, i += 2) p.push(((commands[i] | (commands[i + 1] << 8)) << 16) >> 16)\n    if (op === 0) {\n      x = sx = p[2]\n      y = sy = p[3]\n    } else if (op === 4) {\n      edge(x, y, sx, sy)\n      x = sx\n      y = sy\n    } else if (op === 1) {\n      edge(x, y, p[2], p[3])\n      x = p[2]\n      y = p[3]\n    } else {\n      if (op === 2) {\n        p[6] = p[4]\n        p[7] = p[5]\n        for (let k = 0; k < 2; k++) {\n          p[k + 4] = Math.trunc((p[k + 6] + 2 * p[k + 2]) / 3)\n          p[k + 2] = Math.trunc((p[k] + 2 * p[k + 2]) / 3)\n        }\n      }\n      curve(p, 0)\n      x = p[6]\n      y = p[7]\n    }\n  }\n  return {commands, edges}\n}\n"]}

package/build/utils/memory/search.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../../src/utils/memory/search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,MAAM,WAAW,qBAAqB;IACpC,IAAI,EAAE,MAAM,CAAA;IACZ,EAAE,EAAE,MAAM,CAAA;CACX;AAED,MAAM,WAAW,iBAAiB;IAChC,wCAAwC;IACxC,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,wCAAwC;IACxC,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,6EAA6E;IAC7E,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;IAChB,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAA;CACd;AAED,MAAM,WAAW,kBAAkB,CAAC,CAAC;IACnC,qEAAqE;IACrE,OAAO,EAAE,CAAC,EAAE,CAAA;IACZ;;;;OAIG;IACH,WAAW,EAAE,MAAM,CAAA;CACpB;AAKD,wBAAgB,mBAAmB,CAAC,CAAC,SAAS,qBAAqB,EACjE,OAAO,EAAE,SAAS,CAAC,EAAE,EACrB,CAAC,EAAE,iBAAiB,GACnB,kBAAkB,CAAC,CAAC,CAAC,CAqBvB;AAkBD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAO5D;AAED,+DAA+D;AAC/D,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAO/C;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAqB7E;AAWD,+CAA+C;AAC/C,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAc5C"}
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../../src/utils/memory/search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,MAAM,WAAW,qBAAqB;IACpC,IAAI,EAAE,MAAM,CAAA;IACZ,EAAE,EAAE,MAAM,CAAA;CACX;AAED,MAAM,WAAW,iBAAiB;IAChC,wCAAwC;IACxC,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,wCAAwC;IACxC,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,6EAA6E;IAC7E,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;IAChB,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAA;CACd;AAED,MAAM,WAAW,kBAAkB,CAAC,CAAC;IACnC,qEAAqE;IACrE,OAAO,EAAE,CAAC,EAAE,CAAA;IACZ;;;;OAIG;IACH,WAAW,EAAE,MAAM,CAAA;CACpB;AAKD,wBAAgB,mBAAmB,CAAC,CAAC,SAAS,qBAAqB,EACjE,OAAO,EAAE,SAAS,CAAC,EAAE,EACrB,CAAC,EAAE,iBAAiB,GACnB,kBAAkB,CAAC,CAAC,CAAC,CAmBvB;AAkBD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAO5D;AAED,+DAA+D;AAC/D,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAO/C;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAqB7E;AAuBD,+CAA+C;AAC/C,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAc5C"}

package/build/utils/memory/search.js

@@ -31,9 +31,7 @@ export function searchMemoryEntries(entries, q) {
     const hi = upperBound(entries, until); // exclusive
     const windowCount = Math.max(0, hi - lo);
     const needle = q.contains?.trim().toLowerCase() || null;
-    const termWords = (q.terms ?? [])
-        .map((t) => tokenize(t))
-        .filter((words) => words.length > 0);
+    const termWords = (q.terms ?? []).map((t) => tokenize(t)).filter((words) => words.length > 0);
     const picked = [];
     for (let i = hi - 1; i >= lo && picked.length < q.limit; i--) {
         const e = entries[i];
@@ -123,11 +121,23 @@ export function editDistanceAtMost(a, b, max) {
     return prev[b.length] <= max;
 }
 const SOUNDEX_CODES = {
-    b: "1", f: "1", p: "1", v: "1",
-    c: "2", g: "2", j: "2", k: "2", q: "2", s: "2", x: "2", z: "2",
-    d: "3", t: "3",
+    b: "1",
+    f: "1",
+    p: "1",
+    v: "1",
+    c: "2",
+    g: "2",
+    j: "2",
+    k: "2",
+    q: "2",
+    s: "2",
+    x: "2",
+    z: "2",
+    d: "3",
+    t: "3",
     l: "4",
-    m: "5", n: "5",
+    m: "5",
+    n: "5",
     r: "6",
 };
 /** Classic Soundex. Empty input returns "". */

package/build/utils/memory/search.js.map

@@ -1 +1 @@
-{"version":3,"file":"search.js","sourceRoot":"","sources":["../../../src/utils/memory/search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AA+BH,kFAAkF;AAClF,MAAM,UAAU,GAAG,IAAI,OAAO,EAAoB,CAAA;AAElD,MAAM,UAAU,mBAAmB,CACjC,OAAqB,EACrB,CAAoB;IAEpB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAA;IAC5B,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,MAAM,CAAC,gBAAgB,CAAA;IAClD,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IACrC,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA,CAAC,YAAY;IAClD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;IAExC,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,WAAW,EAAE,IAAI,IAAI,CAAA;IACvD,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;SAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;SACvB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAEtC,MAAM,MAAM,GAAQ,EAAE,CAAA;IACtB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7D,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QACpB,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,SAAQ;QAC9D,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,SAAS,CAAC;YAAE,SAAQ;QACnE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAChB,CAAC;IACD,MAAM,CAAC,OAAO,EAAE,CAAA;IAChB,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAC,CAAA;AACvC,CAAC;AAED,mFAAmF;AACnF,SAAS,cAAc,CAAC,KAA4B,EAAE,SAAqB;IACzE,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAClC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAC7B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;IAC/B,CAAC;IACD,KAAK,EAAE,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAAE,SAAS,KAAK,CAAA;QACtE,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACxB,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAA;IAC/C,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAA;IAC9C,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACrC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,OAAO,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;QAAE,OAAO,IAAI,CAAA;IAC9F,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACxE,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,SAAS,CAAC,KAAK,CAAC;SAChB,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;SAC/B,KAAK,CAAC,YAAY,CAAC;SACnB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAChC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAS,EAAE,CAAS,EAAE,GAAW;IAClE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG;QAAE,OAAO,KAAK,CAAA;IACrD,IAAI,KAAK,GAAoB,IAAI,CAAA;IACjC,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;QACf,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC1C,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;YACjE,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC9E,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACnC,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACX,IAAI,CAAC,GAAG,MAAM;gBAAE,MAAM,GAAG,CAAC,CAAA;QAC5B,CAAC;QACD,IAAI,MAAM,GAAG,GAAG;YAAE,OAAO,KAAK,CAAA;QAC9B,KAAK,GAAG,IAAI,CAAA;QACZ,IAAI,GAAG,GAAG,CAAA;IACZ,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAA;AAC9B,CAAC;AAED,MAAM,aAAa,GAA2B;IAC5C,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG;IAC9B,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG;IAC9D,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG;IACd,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG;IACd,CAAC,EAAE,GAAG;CACP,CAAA;AAED,+CAA+C;AAC/C,MAAM,UAAU,OAAO,CAAC,IAAY;IAClC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAA;IACnD,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAA;IACjB,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAA;IAC5B,IAAI,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACpD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACf,MAAM,IAAI,GAAG,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QACpC,qEAAqE;QACrE,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;YAAE,SAAQ;QACtC,IAAI,IAAI,IAAI,IAAI,KAAK,QAAQ;YAAE,GAAG,IAAI,IAAI,CAAA;QAC1C,QAAQ,GAAG,IAAI,CAAA;IACjB,CAAC;IACD,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;AAC3B,CAAC;AAED,oEAAoE;AACpE,SAAS,UAAU,CAAC,OAAyC,EAAE,KAAa;IAC1E,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,CAAA;IACvB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;QAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAA;;YACpC,EAAE,GAAG,GAAG,CAAA;IACf,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC;AAED,+EAA+E;AAC/E,SAAS,UAAU,CAAC,OAAyC,EAAE,KAAa;IAC1E,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,CAAA;IACvB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;QAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,KAAK;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAA;;YACrC,EAAE,GAAG,GAAG,CAAA;IACf,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC","sourcesContent":["/**\n * Pure memory-timeline search — the matching engine behind MemoryStore.query\n * and the assistant's get_transcripts tool.\n *\n * Lives outside MemoryStore so it is unit-testable and importable by the\n * assistant's eval harness (which replays the exact host semantics against a\n * mock corpus). Keep it dependency-free and runtime-neutral: it also runs\n * under bun for tests.\n *\n * TWO MATCH MODES, deliberately different:\n *  - `contains`: exact case-insensitive substring — the pre-existing contract,\n *    kept verbatim for callers that need precision (codes, URLs, exact phrases).\n *  - `terms`: ANY-of term matching with per-word fuzziness. Speech-to-text\n *    mangles proper nouns (\"Sompo\" for \"Sampo\", \"Korwin\" for \"Corwin\"), so a\n *    term word matches a transcript token on exact/substring, small edit\n *    distance, OR same Soundex key. A multi-word term (\"ring size\") requires\n *    all of its words to match somewhere in the entry.\n *\n * The scan walks BACKWARDS from the newest in-window entry and stops at\n * `limit` matches: the caller keeps the most recent matches anyway, and the\n * common \"last 90 minutes\" query then touches dozens of entries instead of\n * the full 4000-entry timeline. Window bounds are found by binary search on\n * `at` (the timeline is maintained time-sorted).\n */\n\nexport interface MemorySearchableEntry {\n  text: string\n  at: number\n}\n\nexport interface MemorySearchQuery {\n  /** Epoch ms lower bound (inclusive). */\n  sinceMs?: number\n  /** Epoch ms upper bound (inclusive). */\n  untilMs?: number\n  /** Exact case-insensitive substring filter. */\n  contains?: string\n  /** Fuzzy any-of terms (see file header). Combined with `contains` as AND. */\n  terms?: string[]\n  /** Max matches kept (newest win). Caller enforces its own cap. */\n  limit: number\n}\n\nexport interface MemorySearchResult<T> {\n  /** Matches in chronological order (newest last), at most `limit`. */\n  entries: T[]\n  /**\n   * Entries inside the TIME window before keyword filtering. Lets the caller\n   * tell \"keyword matched nothing\" apart from \"window itself is empty\" — the\n   * distinction that saves an LLM a blind retry round.\n   */\n  windowCount: number\n}\n\n/** Tokenized lowercase text per entry, cached for the entry object's lifetime. */\nconst tokenCache = new WeakMap<object, string[]>()\n\nexport function searchMemoryEntries<T extends MemorySearchableEntry>(\n  entries: readonly T[],\n  q: MemorySearchQuery,\n): MemorySearchResult<T> {\n  const since = q.sinceMs ?? 0\n  const until = q.untilMs ?? Number.MAX_SAFE_INTEGER\n  const lo = lowerBound(entries, since)\n  const hi = upperBound(entries, until) // exclusive\n  const windowCount = Math.max(0, hi - lo)\n\n  const needle = q.contains?.trim().toLowerCase() || null\n  const termWords = (q.terms ?? [])\n    .map((t) => tokenize(t))\n    .filter((words) => words.length > 0)\n\n  const picked: T[] = []\n  for (let i = hi - 1; i >= lo && picked.length < q.limit; i--) {\n    const e = entries[i]\n    if (needle && !e.text.toLowerCase().includes(needle)) continue\n    if (termWords.length > 0 && !matchesAnyTerm(e, termWords)) continue\n    picked.push(e)\n  }\n  picked.reverse()\n  return {entries: picked, windowCount}\n}\n\n/** True when any term matches — a term matches iff ALL its words match a token. */\nfunction matchesAnyTerm(entry: MemorySearchableEntry, termWords: string[][]): boolean {\n  let tokens = tokenCache.get(entry)\n  if (!tokens) {\n    tokens = tokenize(entry.text)\n    tokenCache.set(entry, tokens)\n  }\n  outer: for (const words of termWords) {\n    for (const word of words) {\n      if (!tokens.some((tok) => fuzzyWordMatch(word, tok))) continue outer\n    }\n    return true\n  }\n  return false\n}\n\n/**\n * Does query word `w` match transcript token `t`?\n *  - exact, or substring for w of 3+ chars (\"kestrel\" in \"kestrels\")\n *  - for words of 5+ chars: bounded edit distance (1, or 2 for 7+ chars)\n *    — catches one-vowel STT swaps (\"sompo\"/\"sampo\", \"korwin\"/\"corwin\").\n *    5 is the floor because at 4 chars a one-edit radius swallows unrelated\n *    common words (\"code\"→\"mode\"); mistranscribed NAMES are almost always 5+.\n *  - same Soundex key with similar length — catches phonetic respellings that\n *    edit distance misses (\"warryn\"/\"warren\" style doublings)\n */\nexport function fuzzyWordMatch(w: string, t: string): boolean {\n  if (w === t) return true\n  if (w.length >= 3 && t.includes(w)) return true\n  if (w.length < 5 || t.length < 4) return false\n  const maxDist = w.length >= 7 ? 2 : 1\n  if (Math.abs(w.length - t.length) <= maxDist && editDistanceAtMost(w, t, maxDist)) return true\n  return Math.abs(w.length - t.length) <= 2 && soundex(w) === soundex(t)\n}\n\n/** Lowercase, strip diacritics, split on non-alphanumerics. */\nexport function tokenize(text: string): string[] {\n  return text\n    .toLowerCase()\n    .normalize(\"NFD\")\n    .replace(/[\\u0300-\\u036f]/g, \"\")\n    .split(/[^a-z0-9]+/)\n    .filter((t) => t.length > 0)\n}\n\n/**\n * Optimal-string-alignment edit distance, early-exited: returns whether\n * dist(a, b) <= max. Transpositions count as one edit (common in STT output).\n */\nexport function editDistanceAtMost(a: string, b: string, max: number): boolean {\n  if (Math.abs(a.length - b.length) > max) return false\n  let prev2: number[] | null = null\n  let prev = Array.from({length: b.length + 1}, (_, j) => j)\n  for (let i = 1; i <= a.length; i++) {\n    const cur = [i]\n    let rowMin = i\n    for (let j = 1; j <= b.length; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1\n      let v = Math.min(prev[j] + 1, cur[j - 1] + 1, prev[j - 1] + cost)\n      if (prev2 && i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {\n        v = Math.min(v, prev2[j - 2] + 1)\n      }\n      cur.push(v)\n      if (v < rowMin) rowMin = v\n    }\n    if (rowMin > max) return false\n    prev2 = prev\n    prev = cur\n  }\n  return prev[b.length] <= max\n}\n\nconst SOUNDEX_CODES: Record<string, string> = {\n  b: \"1\", f: \"1\", p: \"1\", v: \"1\",\n  c: \"2\", g: \"2\", j: \"2\", k: \"2\", q: \"2\", s: \"2\", x: \"2\", z: \"2\",\n  d: \"3\", t: \"3\",\n  l: \"4\",\n  m: \"5\", n: \"5\",\n  r: \"6\",\n}\n\n/** Classic Soundex. Empty input returns \"\". */\nexport function soundex(word: string): string {\n  const w = word.toLowerCase().replace(/[^a-z]/g, \"\")\n  if (!w) return \"\"\n  let out = w[0].toUpperCase()\n  let lastCode = SOUNDEX_CODES[w[0]] ?? \"\"\n  for (let i = 1; i < w.length && out.length < 4; i++) {\n    const ch = w[i]\n    const code = SOUNDEX_CODES[ch] ?? \"\"\n    // h/w are transparent: they don't reset the adjacent-duplicate rule.\n    if (ch === \"h\" || ch === \"w\") continue\n    if (code && code !== lastCode) out += code\n    lastCode = code\n  }\n  return out.padEnd(4, \"0\")\n}\n\n/** First index with at >= value (entries time-sorted ascending). */\nfunction lowerBound(entries: readonly MemorySearchableEntry[], value: number): number {\n  let lo = 0\n  let hi = entries.length\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1\n    if (entries[mid].at < value) lo = mid + 1\n    else hi = mid\n  }\n  return lo\n}\n\n/** First index with at > value (i.e. exclusive end for an inclusive bound). */\nfunction upperBound(entries: readonly MemorySearchableEntry[], value: number): number {\n  let lo = 0\n  let hi = entries.length\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1\n    if (entries[mid].at <= value) lo = mid + 1\n    else hi = mid\n  }\n  return lo\n}\n"]}
+{"version":3,"file":"search.js","sourceRoot":"","sources":["../../../src/utils/memory/search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AA+BH,kFAAkF;AAClF,MAAM,UAAU,GAAG,IAAI,OAAO,EAAoB,CAAA;AAElD,MAAM,UAAU,mBAAmB,CACjC,OAAqB,EACrB,CAAoB;IAEpB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAA;IAC5B,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,MAAM,CAAC,gBAAgB,CAAA;IAClD,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IACrC,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA,CAAC,YAAY;IAClD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;IAExC,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,WAAW,EAAE,IAAI,IAAI,CAAA;IACvD,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAE7F,MAAM,MAAM,GAAQ,EAAE,CAAA;IACtB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7D,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QACpB,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,SAAQ;QAC9D,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,SAAS,CAAC;YAAE,SAAQ;QACnE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAChB,CAAC;IACD,MAAM,CAAC,OAAO,EAAE,CAAA;IAChB,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAC,CAAA;AACvC,CAAC;AAED,mFAAmF;AACnF,SAAS,cAAc,CAAC,KAA4B,EAAE,SAAqB;IACzE,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAClC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAC7B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;IAC/B,CAAC;IACD,KAAK,EAAE,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAAE,SAAS,KAAK,CAAA;QACtE,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACxB,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAA;IAC/C,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAA;IAC9C,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACrC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,OAAO,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;QAAE,OAAO,IAAI,CAAA;IAC9F,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACxE,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,SAAS,CAAC,KAAK,CAAC;SAChB,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;SAC/B,KAAK,CAAC,YAAY,CAAC;SACnB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAChC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAS,EAAE,CAAS,EAAE,GAAW;IAClE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG;QAAE,OAAO,KAAK,CAAA;IACrD,IAAI,KAAK,GAAoB,IAAI,CAAA;IACjC,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;QACf,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC1C,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;YACjE,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC9E,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACnC,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACX,IAAI,CAAC,GAAG,MAAM;gBAAE,MAAM,GAAG,CAAC,CAAA;QAC5B,CAAC;QACD,IAAI,MAAM,GAAG,GAAG;YAAE,OAAO,KAAK,CAAA;QAC9B,KAAK,GAAG,IAAI,CAAA;QACZ,IAAI,GAAG,GAAG,CAAA;IACZ,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAA;AAC9B,CAAC;AAED,MAAM,aAAa,GAA2B;IAC5C,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG;CACP,CAAA;AAED,+CAA+C;AAC/C,MAAM,UAAU,OAAO,CAAC,IAAY;IAClC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAA;IACnD,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAA;IACjB,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAA;IAC5B,IAAI,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACpD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACf,MAAM,IAAI,GAAG,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QACpC,qEAAqE;QACrE,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;YAAE,SAAQ;QACtC,IAAI,IAAI,IAAI,IAAI,KAAK,QAAQ;YAAE,GAAG,IAAI,IAAI,CAAA;QAC1C,QAAQ,GAAG,IAAI,CAAA;IACjB,CAAC;IACD,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;AAC3B,CAAC;AAED,oEAAoE;AACpE,SAAS,UAAU,CAAC,OAAyC,EAAE,KAAa;IAC1E,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,CAAA;IACvB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;QAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAA;;YACpC,EAAE,GAAG,GAAG,CAAA;IACf,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC;AAED,+EAA+E;AAC/E,SAAS,UAAU,CAAC,OAAyC,EAAE,KAAa;IAC1E,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,CAAA;IACvB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;QAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,KAAK;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAA;;YACrC,EAAE,GAAG,GAAG,CAAA;IACf,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC","sourcesContent":["/**\n * Pure memory-timeline search — the matching engine behind MemoryStore.query\n * and the assistant's get_transcripts tool.\n *\n * Lives outside MemoryStore so it is unit-testable and importable by the\n * assistant's eval harness (which replays the exact host semantics against a\n * mock corpus). Keep it dependency-free and runtime-neutral: it also runs\n * under bun for tests.\n *\n * TWO MATCH MODES, deliberately different:\n *  - `contains`: exact case-insensitive substring — the pre-existing contract,\n *    kept verbatim for callers that need precision (codes, URLs, exact phrases).\n *  - `terms`: ANY-of term matching with per-word fuzziness. Speech-to-text\n *    mangles proper nouns (\"Sompo\" for \"Sampo\", \"Korwin\" for \"Corwin\"), so a\n *    term word matches a transcript token on exact/substring, small edit\n *    distance, OR same Soundex key. A multi-word term (\"ring size\") requires\n *    all of its words to match somewhere in the entry.\n *\n * The scan walks BACKWARDS from the newest in-window entry and stops at\n * `limit` matches: the caller keeps the most recent matches anyway, and the\n * common \"last 90 minutes\" query then touches dozens of entries instead of\n * the full 4000-entry timeline. Window bounds are found by binary search on\n * `at` (the timeline is maintained time-sorted).\n */\n\nexport interface MemorySearchableEntry {\n  text: string\n  at: number\n}\n\nexport interface MemorySearchQuery {\n  /** Epoch ms lower bound (inclusive). */\n  sinceMs?: number\n  /** Epoch ms upper bound (inclusive). */\n  untilMs?: number\n  /** Exact case-insensitive substring filter. */\n  contains?: string\n  /** Fuzzy any-of terms (see file header). Combined with `contains` as AND. */\n  terms?: string[]\n  /** Max matches kept (newest win). Caller enforces its own cap. */\n  limit: number\n}\n\nexport interface MemorySearchResult<T> {\n  /** Matches in chronological order (newest last), at most `limit`. */\n  entries: T[]\n  /**\n   * Entries inside the TIME window before keyword filtering. Lets the caller\n   * tell \"keyword matched nothing\" apart from \"window itself is empty\" — the\n   * distinction that saves an LLM a blind retry round.\n   */\n  windowCount: number\n}\n\n/** Tokenized lowercase text per entry, cached for the entry object's lifetime. */\nconst tokenCache = new WeakMap<object, string[]>()\n\nexport function searchMemoryEntries<T extends MemorySearchableEntry>(\n  entries: readonly T[],\n  q: MemorySearchQuery,\n): MemorySearchResult<T> {\n  const since = q.sinceMs ?? 0\n  const until = q.untilMs ?? Number.MAX_SAFE_INTEGER\n  const lo = lowerBound(entries, since)\n  const hi = upperBound(entries, until) // exclusive\n  const windowCount = Math.max(0, hi - lo)\n\n  const needle = q.contains?.trim().toLowerCase() || null\n  const termWords = (q.terms ?? []).map((t) => tokenize(t)).filter((words) => words.length > 0)\n\n  const picked: T[] = []\n  for (let i = hi - 1; i >= lo && picked.length < q.limit; i--) {\n    const e = entries[i]\n    if (needle && !e.text.toLowerCase().includes(needle)) continue\n    if (termWords.length > 0 && !matchesAnyTerm(e, termWords)) continue\n    picked.push(e)\n  }\n  picked.reverse()\n  return {entries: picked, windowCount}\n}\n\n/** True when any term matches — a term matches iff ALL its words match a token. */\nfunction matchesAnyTerm(entry: MemorySearchableEntry, termWords: string[][]): boolean {\n  let tokens = tokenCache.get(entry)\n  if (!tokens) {\n    tokens = tokenize(entry.text)\n    tokenCache.set(entry, tokens)\n  }\n  outer: for (const words of termWords) {\n    for (const word of words) {\n      if (!tokens.some((tok) => fuzzyWordMatch(word, tok))) continue outer\n    }\n    return true\n  }\n  return false\n}\n\n/**\n * Does query word `w` match transcript token `t`?\n *  - exact, or substring for w of 3+ chars (\"kestrel\" in \"kestrels\")\n *  - for words of 5+ chars: bounded edit distance (1, or 2 for 7+ chars)\n *    — catches one-vowel STT swaps (\"sompo\"/\"sampo\", \"korwin\"/\"corwin\").\n *    5 is the floor because at 4 chars a one-edit radius swallows unrelated\n *    common words (\"code\"→\"mode\"); mistranscribed NAMES are almost always 5+.\n *  - same Soundex key with similar length — catches phonetic respellings that\n *    edit distance misses (\"warryn\"/\"warren\" style doublings)\n */\nexport function fuzzyWordMatch(w: string, t: string): boolean {\n  if (w === t) return true\n  if (w.length >= 3 && t.includes(w)) return true\n  if (w.length < 5 || t.length < 4) return false\n  const maxDist = w.length >= 7 ? 2 : 1\n  if (Math.abs(w.length - t.length) <= maxDist && editDistanceAtMost(w, t, maxDist)) return true\n  return Math.abs(w.length - t.length) <= 2 && soundex(w) === soundex(t)\n}\n\n/** Lowercase, strip diacritics, split on non-alphanumerics. */\nexport function tokenize(text: string): string[] {\n  return text\n    .toLowerCase()\n    .normalize(\"NFD\")\n    .replace(/[\\u0300-\\u036f]/g, \"\")\n    .split(/[^a-z0-9]+/)\n    .filter((t) => t.length > 0)\n}\n\n/**\n * Optimal-string-alignment edit distance, early-exited: returns whether\n * dist(a, b) <= max. Transpositions count as one edit (common in STT output).\n */\nexport function editDistanceAtMost(a: string, b: string, max: number): boolean {\n  if (Math.abs(a.length - b.length) > max) return false\n  let prev2: number[] | null = null\n  let prev = Array.from({length: b.length + 1}, (_, j) => j)\n  for (let i = 1; i <= a.length; i++) {\n    const cur = [i]\n    let rowMin = i\n    for (let j = 1; j <= b.length; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1\n      let v = Math.min(prev[j] + 1, cur[j - 1] + 1, prev[j - 1] + cost)\n      if (prev2 && i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {\n        v = Math.min(v, prev2[j - 2] + 1)\n      }\n      cur.push(v)\n      if (v < rowMin) rowMin = v\n    }\n    if (rowMin > max) return false\n    prev2 = prev\n    prev = cur\n  }\n  return prev[b.length] <= max\n}\n\nconst SOUNDEX_CODES: Record<string, string> = {\n  b: \"1\",\n  f: \"1\",\n  p: \"1\",\n  v: \"1\",\n  c: \"2\",\n  g: \"2\",\n  j: \"2\",\n  k: \"2\",\n  q: \"2\",\n  s: \"2\",\n  x: \"2\",\n  z: \"2\",\n  d: \"3\",\n  t: \"3\",\n  l: \"4\",\n  m: \"5\",\n  n: \"5\",\n  r: \"6\",\n}\n\n/** Classic Soundex. Empty input returns \"\". */\nexport function soundex(word: string): string {\n  const w = word.toLowerCase().replace(/[^a-z]/g, \"\")\n  if (!w) return \"\"\n  let out = w[0].toUpperCase()\n  let lastCode = SOUNDEX_CODES[w[0]] ?? \"\"\n  for (let i = 1; i < w.length && out.length < 4; i++) {\n    const ch = w[i]\n    const code = SOUNDEX_CODES[ch] ?? \"\"\n    // h/w are transparent: they don't reset the adjacent-duplicate rule.\n    if (ch === \"h\" || ch === \"w\") continue\n    if (code && code !== lastCode) out += code\n    lastCode = code\n  }\n  return out.padEnd(4, \"0\")\n}\n\n/** First index with at >= value (entries time-sorted ascending). */\nfunction lowerBound(entries: readonly MemorySearchableEntry[], value: number): number {\n  let lo = 0\n  let hi = entries.length\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1\n    if (entries[mid].at < value) lo = mid + 1\n    else hi = mid\n  }\n  return lo\n}\n\n/** First index with at > value (i.e. exclusive end for an inclusive bound). */\nfunction upperBound(entries: readonly MemorySearchableEntry[], value: number): number {\n  let lo = 0\n  let hi = entries.length\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1\n    if (entries[mid].at <= value) lo = mid + 1\n    else hi = mid\n  }\n  return lo\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@glassly/engine",
-  "version": "0.4.0-dev.1037",
+  "version": "0.4.0-dev.1039",
   "description": "Glassly Engine — miniapp registry, WebView bridge, and miniapp store",
   "main": "build/index.js",
   "react-native": "src/index.ts",
@@ -97,17 +97,17 @@
     "registry": "https://registry.npmjs.org/"
   },
   "dependencies": {
-    "@glassly/bluetooth-sdk": "0.4.0-dev.1037",
-    "@glassly/cloud-client": "0.4.0-dev.1037",
-    "@glassly/cloud-protocol": "0.4.0-dev.1037",
-    "@glassly/crust": "0.4.0-dev.1037",
-    "@glassly/miniapp": "0.4.0-dev.1037",
+    "@glassly/bluetooth-sdk": "0.4.0-dev.1039",
+    "@glassly/cloud-client": "0.4.0-dev.1039",
+    "@glassly/cloud-protocol": "0.4.0-dev.1039",
+    "@glassly/crust": "0.4.0-dev.1039",
+    "@glassly/miniapp": "0.4.0-dev.1039",
     "buffer": "^6.0.3",
     "events": "^3.3.0",
     "react-native-marked": "8.3.2",
     "semver": "^7.7.4",
     "typesafe-ts": "^1.7.1",
-    "@glassly/llm-providers": "0.4.0-dev.1037",
+    "@glassly/llm-providers": "0.4.0-dev.1039",
     "@huggingface/jinja": "^0.5.9",
     "jsonrepair": "^3.12.0"
   },

package/src/engine.ts

@@ -239,7 +239,7 @@ export const engine = {
   backup,
   /** Device-local voice profiles for on-device speaker ID (Settings > Speakers). */
   speakers,
-  /** AI/voice provider key validation — user-supplied keys (Settings > API Keys). */
+  /** AI/voice provider key validation — user-supplied keys (Settings > Privacy > API Keys). */
   providerKeys,
   display,
 }

package/src/facades/glasses.ts

@@ -114,7 +114,7 @@ function projectKeyboardStatus() {
   const s = useGlassesStore.getState()
   return {
     /** Connected glasses run a firmware that can host a keyboard (G2 Glassly CFW 39+). */
-    available: s.keyboardBridge === true,
+    available: isGlassesReady(s.connection) && s.keyboardBridge === true,
     connected: s.keyboardConnected === true,
     name: s.keyboardName ?? "",
     /** A keyboard is remembered and reconnects automatically. */

package/src/facades/providerKeys.ts

@@ -1,7 +1,7 @@
 /**
  * providerKeys facade — `engine.providerKeys.{anthropic,gemini,openai,deepseek,elevenlabs}`:
  * validate-before-save probes for the user-supplied AI/voice provider keys
- * (Settings > API Keys). Same per-provider shape as `engine.maps.mapbox` /
+ * (Settings > Privacy > API Keys). Same per-provider shape as `engine.maps.mapbox` /
  * `engine.speech.sonioxDirect` so the Keys screen treats providers uniformly.
  */
 import {

package/src/generated/releaseMetadata.ts

@@ -12,9 +12,9 @@ export interface EngineReleaseMetadata {
 export const ENGINE_RELEASE_METADATA: Readonly<EngineReleaseMetadata> = Object.freeze({
   "schemaVersion": 1,
   "familyBaseVersion": "0.4.0",
-  "releaseIdentity": "0.4.0-dev.1037",
-  "releaseSetId": "glassly-0.4.0-dev.1037",
-  "sourceCommit": "11c0697d10a07268ef64da354f4c4e11ca298b28",
+  "releaseIdentity": "0.4.0-dev.1039",
+  "releaseSetId": "glassly-0.4.0-dev.1039",
+  "sourceCommit": "daea71d3a5f3ab0c53c092cb2484c28b2b8d8493",
   "otaManifestUrl": null,
   "otaManifestSha256": null
 })

package/src/react/useMentraLiveOta.ts

@@ -48,10 +48,7 @@ export type MentraLiveOtaScreen =
   | "disconnected"
 
 export type MentraLiveOtaErrorCode =
-  | "check_failed"
-  | "update_info_unavailable"
-  | "install_failed"
-  | "bes_restart_required"
+  "check_failed" | "update_info_unavailable" | "install_failed" | "bes_restart_required"
 
 export type MentraLiveOtaError = {
   code: MentraLiveOtaErrorCode

package/src/runtime/config.ts

@@ -66,12 +66,7 @@ export type NavErrorEvent = {kind: "error"; message: string}
 /** Synthesized by the host when the trip is cancelled outside the miniapp (e.g. wearer exited nav mode on the glasses). */
 export type NavCancelledEvent = {kind: "cancelled"; reason?: string}
 export type NavUpdate =
-  | NavManeuverEvent
-  | NavOffRouteEvent
-  | NavReroutingEvent
-  | NavArrivedEvent
-  | NavErrorEvent
-  | NavCancelledEvent
+  NavManeuverEvent | NavOffRouteEvent | NavReroutingEvent | NavArrivedEvent | NavErrorEvent | NavCancelledEvent
 
 export type NavLocation = {
   lat: number

package/src/services/AiTierResolution.ts

@@ -51,7 +51,7 @@ export const TIER_MODEL_OPTIONS: Record<AiTier, TierModelOption[]> = {
   ],
 }
 
-/** Which providers currently have a user key saved (Settings > API Keys). */
+/** Which providers currently have a user key saved (Settings > Privacy > API Keys). */
 export type SavedLlmKeys = Record<AiTierProvider, boolean>
 
 /**

package/src/services/AutomaticReportResult.ts

@@ -1,9 +1,7 @@
 import type {ReportSubmitResult} from "../facades/reports"
 
 export type AutomaticReportSubmissionStatus =
-  | {status: "filed"; reportId: string}
-  | {status: "skipped"; reason: string}
-  | {status: "failed"; error: string}
+  {status: "filed"; reportId: string} | {status: "skipped"; reason: string} | {status: "failed"; error: string}
 
 export function toAutomaticReportSubmissionStatus(result: ReportSubmitResult): AutomaticReportSubmissionStatus {
   if (result.status === "submitted") {

package/src/services/GestureDotsService.ts

@@ -50,7 +50,7 @@ const MIDDLE_FINGER_GLYPHS: Partial<Record<GestureDotGlyph, GestureDotGlyph>> =
 
 /** `glyph` as `finger` draws it: the middle finger's shapes are hollow. */
 function fingerGlyph(glyph: GestureDotGlyph, finger: number): GestureDotGlyph {
-  return finger === 1 ? MIDDLE_FINGER_GLYPHS[glyph] ?? glyph : glyph
+  return finger === 1 ? (MIDDLE_FINGER_GLYPHS[glyph] ?? glyph) : glyph
 }
 
 function fingerKey(controllerId: string | undefined, finger: number): string {

package/src/services/HotspotOtaTransport.ts

@@ -24,10 +24,7 @@ export type HotspotOtaProgress = {
 }
 
 export type HotspotOtaErrorCode =
-  | "hotspot_wifi_permission_denied"
-  | "hotspot_start_failed"
-  | "hotspot_join_failed"
-  | "hotspot_server_failed"
+  "hotspot_wifi_permission_denied" | "hotspot_start_failed" | "hotspot_join_failed" | "hotspot_server_failed"
 
 export class HotspotOtaTransportError extends Error {
   constructor(

package/src/services/LocalMiniappRuntime.ts

@@ -141,6 +141,7 @@ import {phoneStreamCoordinator} from "./PhoneStreamCoordinator"
 import {phoneVideoCoordinator} from "./PhoneVideoCoordinator"
 import {runSentenceTtsPipeline} from "./SentenceTtsPipeline"
 import {
+  matchesTranscriptionSubscription,
   summarizeTranscriptionRoutes,
   transcriptionDeliveryRoute,
   type TranscriptionDeliveryRoute,
@@ -433,7 +434,7 @@ const PERMISSION_TYPE_TO_CANONICAL: Record<string, string> = {
 }
 
 /**
- * User API keys (Settings > API Keys) a miniapp may read via
+ * User API keys (Settings > Privacy > API Keys) a miniapp may read via
  * session.keys.get(), mapped provider → settings-store key. Explicit
  * allowlist: the Soniox key is deliberately absent — it gates the
  * phone→Soniox direct transcription path and is not exposed to miniapps.
@@ -477,9 +478,9 @@ function directLlmProvider(name: AiTierProvider): LlmProviderImpl {
 }
 
 const QUOTA_EXCEEDED_MESSAGE =
-  "AI credits are used up. Get more in Settings > Membership, or add your own API key in Settings > API Keys."
+  "AI credits are used up. Get more in Settings > Membership, or add your own API key in Settings > Privacy > API Keys."
 
-/** The user's saved key (Settings > API Keys) for an LLM provider, "" if none. */
+/** The user's saved key (Settings > Privacy > API Keys) for an LLM provider, "" if none. */
 function userLlmKey(provider: AiTierProvider): string {
   const raw = useSettingsStore.getState().getSetting(MINIAPP_READABLE_API_KEYS[provider])
   return typeof raw === "string" ? raw.trim() : ""
@@ -4149,7 +4150,7 @@ class LocalMiniappRuntime {
   }
 
   // ---------------------------------------------------------------------------
-  // User API keys (Settings > API Keys)
+  // User API keys (Settings > Privacy > API Keys)
   // ---------------------------------------------------------------------------
 
   /**
@@ -4217,7 +4218,7 @@ class LocalMiniappRuntime {
    * The request names a TIER; this handler resolves it to a provider+model
    * (Settings > AI Models dropdowns, or auto from saved keys) and then picks
    * one of two transport paths, decided by whether the user saved a key for
-   * the resolved provider (Settings > API Keys) — the phone is where both
+   * the resolved provider (Settings > Privacy > API Keys) — the phone is where both
    * settings live, so this is the only place the choice can be made:
    *
    *  - User key saved → the phone calls the vendor DIRECTLY via
@@ -4490,7 +4491,7 @@ class LocalMiniappRuntime {
         this.sendResult(packageName, requestId, false, undefined, {
           code: MiniappErrorCode.QUOTA_EXCEEDED,
           message:
-            "AI credits are used up. Get more in Settings > Membership, or add your own API key in Settings > API Keys.",
+            "AI credits are used up. Get more in Settings > Membership, or add your own API key in Settings > Privacy > API Keys.",
         })
         return
       }
@@ -4744,7 +4745,11 @@ class LocalMiniappRuntime {
    * session.system.webLogin — host in-app browser sheet. Same contract as
    * scanQr: the seam presents a Modal and never clears miniapp foreground.
    */
-  private async handleWebLogin(packageName: string, payload: Record<string, unknown>, requestId?: string): Promise<void> {
+  private async handleWebLogin(
+    packageName: string,
+    payload: Record<string, unknown>,
+    requestId?: string,
+  ): Promise<void> {
     try {
       const result = await invokeWebLoginSeam(getUiSeams().webLogin, payload, packageName)
       this.sendResult(packageName, requestId, true, result)
@@ -5385,6 +5390,9 @@ class LocalMiniappRuntime {
    */
   private buildCloudAudioSubscriptions(cloudStreams: Set<string>): AudioSubscription[] {
     const subs: AudioSubscription[] = []
+    // One auto recognizer serves every transcription listener. Explicit-language
+    // listeners are filtered at delivery; translations still need their own jobs.
+    const hasAutoTranscription = cloudStreams.has("transcription:auto")
     // Union of every connected app's TRANSCRIPTION_CONFIG hints. Hints only
     // apply to the auto-mode TRANSCRIPTION subscription (the wire schema has
     // no hints field on specific-language sources — the language IS the hint
@@ -5395,6 +5403,7 @@ class LocalMiniappRuntime {
     for (const stream of cloudStreams) {
       if (stream.startsWith("transcription:")) {
         const lang = stream.substring("transcription:".length)
+        if (hasAutoTranscription && lang !== "auto") continue
         const source = langSource(lang)
         subs.push({
           kind: "transcription",
@@ -5527,6 +5536,12 @@ class LocalMiniappRuntime {
   }
 
   private handleTranscriptionData(d: TranscriptionData): void {
+    const expectsAuto = [...(this.streamSubscribers.get("transcription:auto") ?? [])].some(
+      (packageName) => this.appTranscriptionRoutesForSubscription(packageName, "transcription:auto").cloud,
+    )
+    // Subscription replacement is asynchronous. Ignore late results from the
+    // old pipeline while switching between auto and language-specific jobs.
+    if ((d.subscription.language.mode === "auto") !== expectsAuto) return
     const receivedAt = Date.now()
     if (TRANSCRIPT_TIMING_TELEMETRY) {
       console.log(
@@ -5565,6 +5580,8 @@ class LocalMiniappRuntime {
         __hostReceivedAt: receivedAt,
       },
       "cloud",
+      undefined,
+      d.subscription,
     )
   }
 
@@ -5642,8 +5659,7 @@ class LocalMiniappRuntime {
   /** Model profile + runtime overrides (the G2 CFW scene canvas) for the default wearable. */
   private currentCapabilities(): Capabilities {
     const defaultWearable = useSettingsStore.getState().getSetting(ISLAND_SETTINGS_KEYS.defaultWearable) as
-      | DeviceTypes
-      | undefined
+      DeviceTypes | undefined
     return getEffectiveCapabilities(defaultWearable || DeviceTypes.NONE)
   }
 
@@ -5790,6 +5806,8 @@ class LocalMiniappRuntime {
     transcriptionSource?: TranscriptionEventSource,
     /** Deliver to this subscriber alone (the designated dashboard app's gestures while it shows). */
     only?: string,
+    /** Producing cloud/direct subscription; auto results also serve matching language listeners. */
+    transcriptionSubscription?: TranscriptionData["subscription"],
   ): void {
     // Paused miniapps (glasses disconnected) hear no streams. The resume push
     // lands before the reconnect's own glasses_connection event, so nothing
@@ -5801,6 +5819,12 @@ class LocalMiniappRuntime {
     if (transcriptionSource === "local") markTranscriptSourceRecent("local")
     // Translate cloud event names to miniapp protocol stream types
     const normalizedStream = this.normalizeStreamType(streamType)
+    const transcriptionStreams =
+      transcriptionSource === "cloud" && transcriptionSubscription
+        ? [...this.streamSubscribers.keys()].filter((stream) =>
+            matchesTranscriptionSubscription(stream, normalizedStream, transcriptionSubscription),
+          )
+        : undefined
 
     // Passive memory capture happens HERE, before subscriber fan-out, so the
     // timeline reflects what was said around the user regardless of which
@@ -5809,10 +5833,10 @@ class LocalMiniappRuntime {
     // recorded while it was open.)
     this.captureTranscriptToMemory(normalizedStream, data)
 
-    // Collect all subscribers: exact match, plus wildcard matches for streams
-    // that carry a language tag. A miniapp subscribed to "transcription:auto"
-    // should receive any "transcription:<lang>" event (the detected language
-    // is conveyed in the event data, not the stream key).
+    // Auto cloud/direct results serve auto listeners and listeners requesting
+    // the detected language. Specific jobs serve only their own subscription.
+    // Local/legacy events have no producing subscription and retain wildcard
+    // matching so one on-device recognizer can serve auto and explicit listeners.
     //
     // Translation streams support cloud v3's wildcard patterns. Incoming
     // events are keyed `translation:<source>:<target>` and we match against
@@ -5824,11 +5848,13 @@ class LocalMiniappRuntime {
     //   translation:auto            — back-compat alias for *:*
     const matchedSubs = new Set<string>()
     let translationPatterns: string[] = []
-    const exact = this.streamSubscribers.get(normalizedStream)
-    if (exact) for (const p of exact) matchedSubs.add(p)
+    for (const stream of transcriptionStreams ?? [normalizedStream]) {
+      const exact = this.streamSubscribers.get(stream)
+      if (exact) for (const p of exact) matchedSubs.add(p)
+    }
 
     if (normalizedStream.startsWith("transcription:")) {
-      const autoSubs = this.streamSubscribers.get("transcription:auto")
+      const autoSubs = transcriptionStreams ? undefined : this.streamSubscribers.get("transcription:auto")
       if (autoSubs) for (const p of autoSubs) matchedSubs.add(p)
     } else if (normalizedStream.startsWith("translation:")) {
       // translation:<source>:<target> — match each wildcard variant.
@@ -5907,8 +5933,18 @@ class LocalMiniappRuntime {
       // The wearer's touches reach a widget-only app through its host's widget events alone.
       if (normalizedStream === MiniappStreamType.TOUCH_EVENT && miniappWidgetMode.isWidgetOnly(packageName)) continue
       let transcriptionRoute: TranscriptionDeliveryRoute | undefined
+      let outboundStream = normalizedStream
       if (normalizedStream.startsWith("transcription:") && transcriptionSource) {
-        const routes = this.appTranscriptionRoutesForEvent(packageName, normalizedStream)
+        const cloudStreams = transcriptionStreams?.filter(
+          (stream) => this.appTranscriptionRoutesForSubscription(packageName, stream).cloud,
+        )
+        const routes = cloudStreams
+          ? {cloud: cloudStreams.length > 0, forceLocal: false}
+          : this.appTranscriptionRoutesForEvent(packageName, normalizedStream)
+        // Existing miniapp bundles dispatch explicit listeners by their BCP-47
+        // subscription key, while providers detect bare codes (es vs es-ES).
+        // Send one envelope per app, even when it also subscribes to auto.
+        outboundStream = cloudStreams?.find((stream) => stream !== "transcription:auto") ?? normalizedStream
         transcriptionRoute =
           transcriptionDeliveryRoute(transcriptionSource, routes, this.transcriptionPrimaryUp()) ?? undefined
         if (!transcriptionRoute) continue
@@ -5937,7 +5973,7 @@ class LocalMiniappRuntime {
       }
       this.sendToMiniapp(packageName, {
         type: MiniappResponseType.EVENT,
-        streamType: normalizedStream,
+        streamType: outboundStream,
         data: outboundData,
         ...(transcriptionRoute ? {transcriptionRoute} : {}),
       })
@@ -6538,7 +6574,12 @@ class LocalMiniappRuntime {
     // and an unplace racing it cannot stop the provider early. A provider the
     // store already runs (a wearer's launch still spawning, say) stays a
     // normal run; the registry alone lags that launch.
-    this.widgetPlacements = placeWidget(this.widgetPlacements, {hostPackageName, providerPackageName: provider, widgetId, box})
+    this.widgetPlacements = placeWidget(this.widgetPlacements, {
+      hostPackageName,
+      providerPackageName: provider,
+      widgetId,
+      box,
+    })
     miniappWidgetMode.setPlaced(provider, true)
     if (!app.running && !miniappRunningRegistry.has(provider)) miniappWidgetMode.setWidgetOnly(provider, true)
     try {
@@ -6575,7 +6616,10 @@ class LocalMiniappRuntime {
     this.widgetPlacements = unplaceWidget(this.widgetPlacements, hostPackageName, provider, target.widgetId)
     this.sendResult(hostPackageName, requestId, true)
     if (!had) return
-    if (this.connectedApps.has(provider) && widgetHostsOf(this.widgetPlacements, provider, target.widgetId).length === 0) {
+    if (
+      this.connectedApps.has(provider) &&
+      widgetHostsOf(this.widgetPlacements, provider, target.widgetId).length === 0
+    ) {
       this.sendWidgetCall(provider, target.widgetId, {kind: "box", box: null})
     }
     await this.settleWidgetProvider(provider)
@@ -6706,9 +6750,7 @@ class LocalMiniappRuntime {
     if (!widget) return
     const view: WidgetView = payload.view === "expanded" ? "expanded" : "card"
     if (view === "expanded" && !widget.expandable) {
-      console.warn(
-        `${LOG_TAG}: dropping expanded frame from ${providerPackageName}/${widgetId}: it does not list EX`,
-      )
+      console.warn(`${LOG_TAG}: dropping expanded frame from ${providerPackageName}/${widgetId}: it does not list EX`)
       return
     }
     const cap =

package/src/services/LocalSttFallbackCoordinator.ts

@@ -28,11 +28,7 @@ import sttModelManager from "./STTModelManager"
  * `force_local` (a forced subscription would keep local STT on either way).
  */
 export type LocalSttFallbackReason =
-  | "force_local"
-  | "cloud_disconnected"
-  | "cloud_disabled"
-  | "stt_quota"
-  | "provider_unreachable"
+  "force_local" | "cloud_disconnected" | "cloud_disabled" | "stt_quota" | "provider_unreachable"
 
 class LocalSttFallbackCoordinator {
   private static instance: LocalSttFallbackCoordinator

package/src/services/NativeNavigationService.ts

@@ -61,8 +61,7 @@ class NativeNavigationService {
    */
   public isSupported(): boolean {
     const defaultWearable = useSettingsStore.getState().getSetting(ISLAND_SETTINGS_KEYS.defaultWearable) as
-      | DeviceTypes
-      | undefined
+      DeviceTypes | undefined
     // Effective, not model: custom firmware drops hasNativeNavigation so the
     // miniapp's scene HUD owns the display (see effectiveCapabilities).
     const capabilities = getEffectiveCapabilities(defaultWearable || DeviceTypes.NONE)

package/src/services/NavigationHandlers.ts

@@ -364,7 +364,7 @@ export class NavigationHandlers {
 
   async handleComputeRoute(packageName: string, payload: Record<string, unknown>, requestId?: string): Promise<void> {
     try {
-      // With the user's own Mapbox key (Settings > API Keys), compute
+      // With the user's own Mapbox key (Settings > Privacy > API Keys), compute
       // on-device so routing works without the cloud and bills their account.
       // Without one, go through the v2 cloud maps proxy — org-token Mapbox
       // usage only ever happens cloud-side.
@@ -437,7 +437,7 @@ export class NavigationHandlers {
 
   /**
    * Type-ahead place search. Runs on-device against Mapbox Search Box when the
-   * user saved their own key (Settings > API Keys) — that key exists precisely
+   * user saved their own key (Settings > Privacy > API Keys) — that key exists precisely
    * so search works without the cloud — and falls back to the v2 cloud maps
    * service otherwise. Resolves `{ok: true, suggestions}` — an empty query or no
    * matches is `{ok: true, suggestions: []}`, not an error.