@niscorp/nova 0.2.0 → 0.2.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +61 -0
- package/README.md +56 -13
- package/SHELL_DOCS.md +13 -4
- package/dist/adapters/dom/components/index.cjs +4 -51
- package/dist/adapters/dom/components/index.cjs.map +1 -1
- package/dist/adapters/dom/index.cjs +22 -686
- package/dist/adapters/dom/index.cjs.map +1 -1
- package/dist/adapters/dom/index.js +2 -2
- package/dist/adapters/dom/server.cjs +14 -411
- package/dist/adapters/dom/server.cjs.map +1 -1
- package/dist/adapters/dom/server.js +2 -2
- package/dist/adapters/react/components/index.cjs +87 -562
- package/dist/adapters/react/components/index.cjs.map +1 -1
- package/dist/adapters/react/components/index.d.cts +2 -2
- package/dist/adapters/react/components/index.d.ts +2 -2
- package/dist/adapters/react/components/index.js +3 -3
- package/dist/adapters/react/index.cjs +97 -1815
- package/dist/adapters/react/index.cjs.map +1 -1
- package/dist/adapters/react/index.js +3 -3
- package/dist/adapters/tty/components/index.cjs +3 -44
- package/dist/adapters/tty/components/index.cjs.map +1 -1
- package/dist/adapters/tty/index.cjs +13 -5
- package/dist/adapters/tty/index.cjs.map +1 -1
- package/dist/adapters/tty/index.js +1 -1
- package/dist/adapters/vue/components/index.cjs +88 -639
- package/dist/adapters/vue/components/index.cjs.map +1 -1
- package/dist/adapters/vue/components/index.d.cts +10 -10
- package/dist/adapters/vue/components/index.d.ts +10 -10
- package/dist/adapters/vue/components/index.js +3 -3
- package/dist/adapters/vue/index.cjs +96 -962
- package/dist/adapters/vue/index.cjs.map +1 -1
- package/dist/adapters/vue/index.js +4 -4
- package/dist/agent/index.cjs +13 -151
- package/dist/agent/index.cjs.map +1 -1
- package/dist/chunk-3IPM5QBT.cjs +436 -0
- package/dist/chunk-3IPM5QBT.cjs.map +1 -0
- package/dist/chunk-5AF72LOE.cjs +97 -0
- package/dist/chunk-5AF72LOE.cjs.map +1 -0
- package/dist/chunk-5YQIAS4V.cjs +184 -0
- package/dist/chunk-5YQIAS4V.cjs.map +1 -0
- package/dist/chunk-D4PUWBN6.cjs +72 -0
- package/dist/chunk-D4PUWBN6.cjs.map +1 -0
- package/dist/{chunk-RYIIIXDX.js → chunk-DU2VIJAF.js} +57 -15
- package/dist/chunk-DU2VIJAF.js.map +1 -0
- package/dist/{chunk-VU6NNCEJ.js → chunk-F2H7WP6R.js} +4 -4
- package/dist/{chunk-VU6NNCEJ.js.map → chunk-F2H7WP6R.js.map} +1 -1
- package/dist/chunk-FSUMCJAR.cjs +646 -0
- package/dist/chunk-FSUMCJAR.cjs.map +1 -0
- package/dist/{chunk-QXQCPH33.js → chunk-G4LSLLGI.js} +4 -4
- package/dist/{chunk-QXQCPH33.js.map → chunk-G4LSLLGI.js.map} +1 -1
- package/dist/chunk-GV7UC3SS.cjs +33 -0
- package/dist/chunk-GV7UC3SS.cjs.map +1 -0
- package/dist/chunk-IZ2UU5UL.cjs +808 -0
- package/dist/chunk-IZ2UU5UL.cjs.map +1 -0
- package/dist/chunk-KOYRJXTI.cjs +123 -0
- package/dist/chunk-KOYRJXTI.cjs.map +1 -0
- package/dist/chunk-KW34ZKF5.cjs +12 -0
- package/dist/chunk-KW34ZKF5.cjs.map +1 -0
- package/dist/chunk-OE527MXF.cjs +49 -0
- package/dist/chunk-OE527MXF.cjs.map +1 -0
- package/dist/chunk-OO247V4J.cjs +2117 -0
- package/dist/chunk-OO247V4J.cjs.map +1 -0
- package/dist/chunk-PMKWYOOX.cjs +64 -0
- package/dist/chunk-PMKWYOOX.cjs.map +1 -0
- package/dist/chunk-PNQY6OFB.cjs +132 -0
- package/dist/chunk-PNQY6OFB.cjs.map +1 -0
- package/dist/chunk-Q7SFCCGT.cjs +11 -0
- package/dist/chunk-Q7SFCCGT.cjs.map +1 -0
- package/dist/{chunk-MHW5VEIM.js → chunk-SVNK5NIK.js} +3 -3
- package/dist/{chunk-MHW5VEIM.js.map → chunk-SVNK5NIK.js.map} +1 -1
- package/dist/chunk-TMLNVU5W.cjs +318 -0
- package/dist/chunk-TMLNVU5W.cjs.map +1 -0
- package/dist/chunk-TRJYDVWK.cjs +623 -0
- package/dist/chunk-TRJYDVWK.cjs.map +1 -0
- package/dist/chunk-UGG7MCX4.cjs +34 -0
- package/dist/chunk-UGG7MCX4.cjs.map +1 -0
- package/dist/{chunk-UDCXGDLQ.js → chunk-VOD5JA4D.js} +3 -3
- package/dist/{chunk-UDCXGDLQ.js.map → chunk-VOD5JA4D.js.map} +1 -1
- package/dist/chunk-WGPFR7MN.cjs +808 -0
- package/dist/chunk-WGPFR7MN.cjs.map +1 -0
- package/dist/chunk-WGZZKCJQ.cjs +157 -0
- package/dist/chunk-WGZZKCJQ.cjs.map +1 -0
- package/dist/chunk-XQTI4Q4I.js +178 -0
- package/dist/chunk-XQTI4Q4I.js.map +1 -0
- package/dist/devtools/index.cjs +13 -697
- package/dist/devtools/index.cjs.map +1 -1
- package/dist/document/index.cjs +56 -301
- package/dist/document/index.cjs.map +1 -1
- package/dist/examples/index.cjs +1161 -0
- package/dist/examples/index.cjs.map +1 -0
- package/dist/examples/index.d.cts +63 -0
- package/dist/examples/index.d.ts +63 -0
- package/dist/examples/index.js +1158 -0
- package/dist/examples/index.js.map +1 -0
- package/dist/i18n/index.cjs +44 -292
- package/dist/i18n/index.cjs.map +1 -1
- package/dist/i18n/index.js +2 -176
- package/dist/i18n/index.js.map +1 -1
- package/dist/index.cjs +335 -3911
- package/dist/index.cjs.map +1 -1
- package/dist/index.d.cts +5 -1
- package/dist/index.d.ts +5 -1
- package/dist/index.js +1 -1
- package/dist/migrations/index.cjs +7 -590
- package/dist/migrations/index.cjs.map +1 -1
- package/dist/reflect/index.cjs +85 -994
- package/dist/reflect/index.cjs.map +1 -1
- package/package.json +19 -8
- package/dist/chunk-RYIIIXDX.js.map +0 -1
- package/dist/{primitive-props-CGoJvmcH.d.cts → primitive-props-Cl5jiC8g.d.cts} +5 -5
- package/dist/{primitive-props-CGoJvmcH.d.ts → primitive-props-Cl5jiC8g.d.ts} +5 -5
package/dist/i18n/index.cjs.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../../src/shared/common.ts","../../src/i18n/phrases.ts","../../src/i18n/swap.ts","../../src/i18n/translate.ts","../../src/i18n/harvest.ts"],"names":["children"],"mappings":";;;AAOO,IAAM,QAAA,GAAW,CAAC,KAAA,KACvB,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,IAAA,IAAQ,CAAC,KAAA,CAAM,OAAA,CAAQ,KAAK,CAAA;AAQ9D,IAAM,OAAA,GAAU,CAAC,KAAA,KAAuC,KAAA,CAAM,QAAQ,KAAK,CAAA;;;AC0C3E,IAAM,mBAAA,GAAoE;AAAA;AAAA;AAAA;AAAA;AAAA,EAK/E,KAAA,EAAO;AAAA,IACL,OAAA;AAAA,IACA,OAAA;AAAA,IACA,UAAA;AAAA,IACA,SAAA;AAAA,IACA,SAAA;AAAA,IACA,MAAA;AAAA,IACA,OAAA;AAAA,IACA,aAAA;AAAA,IACA,MAAA;AAAA,IACA,MAAA;AAAA,IACA,SAAA;AAAA,IACA,OAAA;AAAA,IACA,WAAA;AAAA,IACA,YAAA;AAAA,IACA,SAAA;AAAA,IACA,SAAA;AAAA,IACA,aAAA;AAAA,IACA,cAAA;AAAA,IACA,aAAA;AAAA,IACA,KAAA;AAAA,IACA;AAAA,GACF;AAAA,EACA,IAAA,EAAM;AACR;AAOO,IAAM,UAAA,GAAa,CAAC,IAAA,KAAmD;AAC5E,EAAA,MAAM,QAAQ,IAAI,GAAA,CAAI,IAAA,EAAM,KAAA,IAAS,oBAAoB,KAAK,CAAA;AAC9D,EAAA,MAAM,QAAA,GAAW,IAAA,EAAM,QAAA,IAAY,EAAC;AACpC,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,CAAC,GAAA,KAAyB,KAAA,CAAM,IAAI,GAAG,CAAA,IAAK,QAAA,CAAS,IAAA,CAAK,CAAC,MAAA,KAAW,GAAA,CAAI,QAAA,CAAS,MAAM,CAAC,CAAA;AAAA,IACnG,IAAA,EAAM,IAAA,EAAM,IAAA,IAAQ,mBAAA,CAAoB;AAAA,GAC1C;AACF;AAYA,IAAM,SAAA,GAAY,qBAAA;AAClB,IAAM,WAAA,GAAc,aAAA;AAEb,IAAM,SAAA,GAAY,CAAC,KAAA,KACxB,SAAA,CAAU,IAAA,CAAK,KAAK,CAAA,IAAK,WAAA,CAAY,IAAA,CAAK,KAAK,CAAA,IAAK,KAAA,CAAM,SAAS,IAAI;AAKlE,IAAM,QAAA,GAAW,CAAC,KAAA,KAA2B;AAClD,EAAA,MAAM,OAAA,GAAU,MAAM,IAAA,EAAK;AAC3B,EAAA,IAAI,OAAA,KAAY,EAAA,IAAM,SAAA,CAAU,OAAO,GAAG,OAAO,KAAA;AAEjD,EAAA,OAAO,QAAA,CAAS,KAAK,OAAO,CAAA;AAC9B;;;ACnGA,IAAM,QAAoB,EAAC;AAWpB,IAAM,OAAA,GAAU,CAAC,OAAA,KAAuD;AAC7E,EAAA,IAAI,OAAA,KAAY,QAAW,OAAO,MAAA;AAClC,EAAA,IAAI,QAAQ,OAAA,KAAY,MAAA,IAAa,OAAA,CAAQ,IAAA,KAAS,QAAW,OAAO,MAAA;AACxE,EAAA,MAAM,OAAA,GAAU,UAAA,CAAW,OAAA,CAAQ,IAAI,CAAA;AACvC,EAAA,OAAO;AAAA,IACL,OAAA,EAAS,QAAQ,OAAA,IAAW,KAAA;AAAA,IAC5B,SAAS,OAAA,CAAQ,OAAA;AAAA,IACjB,MAAM,OAAA,CAAQ,IAAA;AAAA,IACd,QAAQ,OAAA,CAAQ;AAAA,GAClB;AACF,CAAA;AAEO,IAAM,IAAA,GAAO,CAAC,KAAA,EAAe,KAAA,EAAe,IAAA,KAAuB;AACxE,EAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG,OAAO,KAAA;AAC7B,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,KAAK,CAAA;AAC9B,EAAA,IAAI,GAAA,KAAQ,QAAW,OAAO,GAAA;AAI9B,EAAA,MAAM,OAAA,GAAU,MAAM,IAAA,EAAK;AAC3B,EAAA,IAAI,YAAY,KAAA,EAAO;AACrB,IAAA,MAAM,SAAA,GAAY,IAAA,CAAK,OAAA,CAAQ,OAAO,CAAA;AACtC,IAAA,IAAI,cAAc,MAAA,EAAW,OAAO,KAAA,CAAM,OAAA,CAAQ,SAAS,SAAS,CAAA;AAAA,EACtE;AACA,EAAA,IAAA,CAAK,MAAA,GAAS,SAAS,KAAK,CAAA;AAC5B,EAAA,OAAO,KAAA;AACT,CAAA;AAUA,IAAM,SAAA,GAAY,CAAC,KAAA,KACjB,OAAO,KAAA,CAAM,QAAQ,CAAA,KAAM,QAAA,IAAY,QAAA,CAAS,KAAA,CAAM,OAAO,CAAC,CAAA;AAEhE,IAAM,WAAA,GAAc,CAAC,OAAA,EAA6D,KAAA,EAAe,SAC/F,IAAA,CAAK,OAAA,CAAQ,MAAA,EAAQ,KAAA,EAAO,IAAI,CAAA,CAAE,OAAA,CAAQ,+BAAA,EAAiC,CAAC,MAAM,IAAA,KAAiB;AACjG,EAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,KAAA,CAAM,IAAI,CAAA;AAC/B,EAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,IAAA,EAAM,OAAO,IAAA;AAChD,EAAA,OAAO,OAAO,IAAA,KAAS,QAAA,IAAY,QAAA,CAAS,IAAI,IAAI,IAAA,CAAK,IAAA,EAAM,CAAA,EAAG,KAAK,IAAI,IAAI,CAAA,CAAA,EAAI,IAAI,CAAA,GAAI,OAAO,IAAI,CAAA;AACxG,CAAC,CAAA;AAIH,IAAM,MAAA,GAAe,EAAE,OAAA,EAAS,KAAA,EAAO,OAAA,EAAS,MAAM,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,MAAA,EAAQ,MAAA,EAAU;AAanF,IAAM,UAAA,GAAa,CAAC,KAAA,KAA4B;AACrD,EAAA,IAAI,CAAC,SAAS,KAAK,CAAA,IAAK,CAAC,SAAA,CAAU,KAAK,GAAG,OAAO,KAAA;AAClD,EAAA,OAAO,WAAA,CAAY,KAAA,EAAO,EAAA,EAAI,MAAM,CAAA;AACtC;AAUO,IAAM,SAAA,GAAY,CAAC,KAAA,EAAgB,KAAA,EAAgB,OAAe,IAAA,KAAwB;AAC/F,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU,OAAO,QAAQ,IAAA,CAAK,KAAA,EAAO,KAAA,EAAO,IAAI,CAAA,GAAI,KAAA;AACzE,EAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,EAAG;AAClB,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,GAAA,CAAI,CAAC,OAAO,KAAA,KAAU;AAGtC,MAAA,MAAM,IAAA,GAAO,SAAA,CAAU,KAAA,EAAO,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA,EAAK,IAAI,CAAA;AACvE,MAAA,IAAI,IAAA,KAAS,OAAO,OAAA,GAAU,IAAA;AAC9B,MAAA,OAAO,IAAA;AAAA,IACT,CAAC,CAAA;AACD,IAAA,OAAO,UAAU,GAAA,GAAM,KAAA;AAAA,EACzB;AACA,EAAA,IAAI,QAAA,CAAS,KAAK,CAAA,EAAG;AACnB,IAAA,IAAI,KAAA,IAAS,UAAU,KAAK,CAAA,SAAU,WAAA,CAAY,KAAA,EAAO,OAAO,IAAI,CAAA;AACpE,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,MAAM,MAA+B,EAAC;AACtC,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,MAAA,MAAM,IAAA,GAAO,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,EAAG,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,EAAI,IAAI,CAAA;AACxE,MAAA,IAAI,IAAA,KAAS,OAAO,OAAA,GAAU,IAAA;AAC9B,MAAA,GAAA,CAAI,GAAG,CAAA,GAAI,IAAA;AAAA,IACb;AACA,IAAA,OAAO,UAAU,GAAA,GAAM,KAAA;AAAA,EACzB;AACA,EAAA,OAAO,KAAA;AACT,CAAA;;;ACtGA,IAAM,QAAA,GAAW,CAAC,IAAA,EAAkB,KAAA,EAAe,IAAA,KAA2B;AAC5E,EAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AACxB,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,EAAM,OAAO,IAAA;AACvB,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,CAAK,KAAA,EAAO,OAAO,IAAI,CAAA;AAC1C,IAAA,OAAO,UAAU,IAAA,CAAK,KAAA,GAAQ,OAAO,EAAE,GAAG,MAAM,KAAA,EAAM;AAAA,EACxD;AAEA,EAAA,IAAI,IAAA,CAAK,SAAS,UAAA,EAAY;AAC5B,IAAA,MAAMA,SAAAA,GAAW,SAAA,CAAU,IAAA,CAAK,QAAA,EAAU,OAAO,IAAI,CAAA;AACrD,IAAA,OAAOA,SAAAA,KAAa,KAAK,QAAA,GAAW,IAAA,GAAO,EAAE,GAAG,IAAA,EAAM,UAAAA,SAAAA,EAAS;AAAA,EACjE;AAIA,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,OAAA,EAAS,OAAO,IAAA;AAElC,EAAA,MAAM,KAAK,IAAA,CAAK,GAAA,KAAQ,MAAA,GAAY,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,IAAA,CAAK,IAAI,CAAA,CAAA,GAAK,GAAG,KAAK,CAAA,CAAA,EAAI,KAAK,IAAI,CAAA,CAAA,EAAI,KAAK,GAAG,CAAA,CAAA;AAC/F,EAAA,IAAI,QAAQ,IAAA,CAAK,KAAA;AACjB,EAAA,IAAI,YAAA,GAAe,KAAA;AACnB,EAAA,MAAM,YAAqC,EAAC;AAC5C,EAAA,KAAA,MAAW,CAAC,KAAK,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA,EAAG;AACrD,IAAA,MAAM,IAAA,GAAO,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,EAAG,CAAA,EAAG,EAAE,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,EAAI,IAAI,CAAA;AACrE,IAAA,IAAI,IAAA,KAAS,OAAO,YAAA,GAAe,IAAA;AACnC,IAAA,SAAA,CAAU,GAAG,CAAA,GAAI,IAAA;AAAA,EACnB;AACA,EAAA,IAAI,cAAc,KAAA,GAAQ,SAAA;AAE1B,EAAA,MAAM,QAAA,GAAW,SAAA,CAAU,IAAA,CAAK,QAAA,EAAU,IAAI,IAAI,CAAA;AAClD,EAAA,IAAI,CAAC,YAAA,IAAgB,QAAA,KAAa,IAAA,CAAK,UAAU,OAAO,IAAA;AACxD,EAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,QAAA,EAAS;AACpC,CAAA;AAMA,IAAM,SAAA,GAAY,CAAC,KAAA,EAAqB,KAAA,EAAe,IAAA,KAA6B;AAClF,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,MAAM,GAAA,GAAM,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAC9B,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,IAAA,EAAM,KAAA,EAAO,IAAI,CAAA;AACvC,IAAA,IAAI,IAAA,KAAS,MAAM,OAAA,GAAU,IAAA;AAC7B,IAAA,OAAO,IAAA;AAAA,EACT,CAAC,CAAA;AACD,EAAA,OAAO,UAAU,GAAA,GAAM,KAAA;AACzB,CAAA;AAEO,IAAM,mBAAA,GAAsB,CAAC,IAAA,EAAoB,OAAA,KAA4C;AAGlG,EAAA,IAAI,OAAO,IAAA,CAAK,OAAA,CAAQ,OAAO,CAAA,CAAE,MAAA,KAAW,GAAG,OAAO,IAAA;AACtD,EAAA,MAAM,OAAO,OAAA,CAAQ;AAAA,IACnB,SAAS,OAAA,CAAQ,OAAA;AAAA,IACjB,GAAI,QAAQ,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,EAAE,IAAA,EAAM,OAAA,CAAQ,IAAA,EAAK;AAAA,IAC3D,GAAI,QAAQ,MAAA,KAAW,MAAA,GAAY,EAAC,GAAI,EAAE,MAAA,EAAQ,OAAA,CAAQ,MAAA;AAAO,GAClE,CAAA;AACD,EAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,EAAA,OAAO,SAAA,CAAU,IAAA,EAAM,EAAA,EAAI,IAAI,CAAA;AACjC;;;AC3DA,IAAM,QAAA,GAAW,CAAC,KAAA,EAAiC,IAAA,KAAuC;AACxF,EAAA,MAAM,OAAA,GAAU,WAAW,IAAI,CAAA;AAC/B,EAAA,OAAO;AAAA,IACL,GAAA,EAAK,CAAC,MAAA,EAAQ,KAAA,KAAU;AACtB,MAAA,MAAM,OAAA,GAAU,OAAO,IAAA,EAAK;AAC5B,MAAA,IAAI,CAAC,QAAA,CAAS,OAAO,CAAA,EAAG;AACxB,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,OAAO,CAAA;AAC/B,MAAA,IAAI,KAAA,KAAU,MAAA,EAAW,KAAA,CAAM,GAAA,CAAI,OAAA,sBAAa,GAAA,CAAI,CAAC,KAAK,CAAC,CAAC,CAAA;AAAA,WACvD,KAAA,CAAM,IAAI,KAAK,CAAA;AAAA,IACtB,CAAA;AAAA,IACA,SAAS,OAAA,CAAQ,OAAA;AAAA,IACjB,MAAM,OAAA,CAAQ;AAAA,GAChB;AACF,CAAA;AAMA,IAAM,aAAA,GAAgB,CAAC,KAAA,EAAgB,KAAA,EAAe,IAAA,KAAqB;AACzE,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,IAAA,CAAK,GAAA,CAAI,OAAO,KAAK,CAAA;AACrB,IAAA;AAAA,EACF;AACA,EAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,EAAG;AAClB,IAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAA,EAAO,KAAA,KAAU,cAAc,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA,EAAK,IAAI,CAAC,CAAA;AACxF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,QAAA,CAAS,KAAK,CAAA,EAAG;AACnB,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,KAAK,CAAA,EAAG,aAAA,CAAc,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,IAAI,CAAA;AAAA,EAChG;AACF,CAAA;AAEA,IAAM,YAAA,GAAe,CAAC,KAAA,EAAgC,KAAA,EAAe,IAAA,KAAqB;AACxF,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,EAAG;AACrB,MAAA,aAAA,CAAc,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,IAAI,CAAA;AAC5C,MAAA;AAAA,IACF;AAIA,IAAA,IAAI,QAAA,CAAS,KAAK,CAAA,IAAK,OAAA,CAAQ,KAAK,CAAA,EAAG,aAAA,CAAc,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,IAAI,CAAA;AAAA,EACrF;AACF,CAAA;AAEA,IAAM,aAAA,GAAgB,CAAC,KAAA,EAAgB,KAAA,EAAe,IAAA,KAAqB;AACzE,EAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,EAAG;AAClB,IAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAA,EAAO,KAAA,KAAU,cAAc,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA,EAAK,IAAI,CAAC,CAAA;AACxF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG;AACtB,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,EAAG,aAAA,CAAc,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,EAAI,IAAI,CAAA;AAAA,uBAChD,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,IAAI,CAAA;AAAA,EACnD;AACF,CAAA;AAKA,IAAM,WAAA,GAAc,CAAC,IAAA,EAAe,KAAA,EAAe,IAAA,KAAqB;AACtE,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,IAAA,KAAS,MAAA,EAAW;AACzC,EAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAE5B,IAAA,IAAI,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,GAAA,CAAI,MAAM,KAAK,CAAA;AACnC,IAAA;AAAA,EACF;AACA,EAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,OAAO,SAAS,SAAA,EAAW;AAC3D,EAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,IAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,KAAA,EAAO,KAAA,KAAU,YAAY,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA,EAAK,IAAI,CAAC,CAAA;AACrF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,CAAC,QAAA,CAAS,IAAI,CAAA,EAAG;AAErB,EAAA,MAAM,SAAA,GAAY,KAAK,WAAW,CAAA;AAClC,EAAA,IAAI,cAAc,MAAA,EAAW;AAE3B,IAAA,IAAI,KAAA,IAAS,IAAA,IAAQ,MAAA,IAAU,IAAA,EAAM;AACrC,IAAA,IAAI,QAAQ,IAAA,EAAM;AAChB,MAAA,WAAA,CAAY,KAAK,MAAM,CAAA,EAAG,CAAA,EAAG,KAAK,SAAS,IAAI,CAAA;AAC/C,MAAA,WAAA,CAAY,KAAK,MAAM,CAAA,EAAG,CAAA,EAAG,KAAK,SAAS,IAAI,CAAA;AAC/C,MAAA;AAAA,IACF;AACA,IAAA,IAAI,KAAA,IAAS,IAAA,IAAQ,IAAA,IAAQ,IAAA,EAAM;AACjC,MAAA,WAAA,CAAY,KAAK,IAAI,CAAA,EAAG,CAAA,EAAG,KAAK,OAAO,IAAI,CAAA;AAC3C,MAAA;AAAA,IACF;AACA,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,KAAK,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,SAAS,CAAC,CAAA,CAAA;AACxC,EAAA,MAAM,KAAA,GAAQ,KAAK,OAAO,CAAA;AAC1B,EAAA,IAAI,SAAS,KAAK,CAAA,EAAG,YAAA,CAAa,KAAA,EAAO,IAAI,IAAI,CAAA;AACjD,EAAA,WAAA,CAAY,KAAK,UAAU,CAAA,EAAG,CAAA,EAAG,EAAE,aAAa,IAAI,CAAA;AACtD,CAAA;AAEA,IAAM,MAAA,GAAS,CAAC,KAAA,KACd,CAAC,GAAG,KAAA,CAAM,OAAA,EAAS,CAAA,CAChB,IAAI,CAAC,CAAC,MAAA,EAAQ,KAAK,OAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,CAAC,GAAG,KAAK,CAAA,CAAE,IAAA,EAAK,GAAI,CAAA,CAC/D,IAAA,CAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,MAAA,CAAO,aAAA,CAAc,CAAA,CAAE,MAAM,CAAC,CAAA;AAE7C,IAAM,aAAA,GAAgB,CAAC,MAAA,EAAoB,IAAA,KAAyC;AACzF,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAC3C,EAAA,WAAA,CAAY,MAAA,EAAQ,EAAA,EAAI,QAAA,CAAS,KAAA,EAAO,IAAI,CAAC,CAAA;AAC7C,EAAA,OAAO,OAAO,KAAK,CAAA;AACrB;AAMA,IAAM,YAAA,GAAe,CAAC,KAAA,EAAgB,KAAA,EAAe,IAAA,KAAqB;AACxE,EAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,EAAG;AAClB,IAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAA,EAAO,KAAA,KAAU,aAAa,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA,EAAK,IAAI,CAAC,CAAA;AACvF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG;AACtB,EAAA,MAAM,MAAA,GAAS,MAAM,KAAK,CAAA;AAC1B,EAAA,MAAM,OAAA,GAAU,MAAM,OAAO,CAAA;AAC7B,EAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,OAAO,OAAA,KAAY,QAAA,EAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,CAAA,EAAG,KAAK,CAAA,KAAA,EAAQ,MAAM,CAAA,CAAE,CAAA;AACzG,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,IAAA,IAAI,GAAA,KAAQ,KAAA,IAAS,GAAA,KAAQ,OAAA,EAAS;AACtC,IAAA,YAAA,CAAa,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,IAAI,CAAA;AAAA,EAC7C;AACF,CAAA;AAEO,IAAM,iBAAA,GAAoB,CAAC,UAAA,EAA8B,IAAA,KAAyC;AACvG,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAC3C,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,KAAA,EAAO,IAAI,CAAA;AACjC,EAAA,MAAM,KAAK,UAAA,CAAW,EAAA;AAItB,EAAA,IAAI,OAAO,UAAA,CAAW,KAAA,KAAU,QAAA,EAAU,IAAA,CAAK,IAAI,UAAA,CAAW,KAAA,EAAO,CAAA,EAAG,EAAE,CAAA,MAAA,CAAQ,CAAA;AAkBlF,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,MAAA,CAAO,QAAQ,UAAA,CAAW,IAAA,IAAQ,EAAE,CAAA,EAAG;AAChE,IAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,IAAA,CAAK,GAAA,CAAI,OAAO,CAAA,EAAG,EAAE,CAAA,MAAA,EAAS,GAAG,CAAA,CAAE,CAAA;AAAA,SAAA,IACzD,QAAA,CAAS,KAAK,CAAA,IAAK,OAAA,CAAQ,KAAK,CAAA,EAAG,aAAA,CAAc,KAAA,EAAO,CAAA,EAAG,EAAE,CAAA,MAAA,EAAS,GAAG,IAAI,IAAI,CAAA;AAAA,EAC5F;AAEA,EAAA,IAAI,WAAW,MAAA,KAAW,MAAA,cAAuB,UAAA,CAAW,MAAA,EAAQ,IAAI,IAAI,CAAA;AAC5E,EAAA,IAAI,UAAA,CAAW,aAAa,MAAA,EAAW,YAAA,CAAa,WAAW,QAAA,EAAU,CAAA,EAAG,EAAE,CAAA,SAAA,CAAA,EAAa,IAAI,CAAA;AAC/F,EAAA,IAAI,UAAA,CAAW,cAAc,MAAA,EAAW,YAAA,CAAa,WAAW,SAAA,EAAW,CAAA,EAAG,EAAE,CAAA,UAAA,CAAA,EAAc,IAAI,CAAA;AAElG,EAAA,OAAO,OAAO,KAAK,CAAA;AACrB;AAEO,IAAM,kBAAA,GAAqB,CAChC,WAAA,EACA,IAAA,KACsB;AACtB,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAC3C,EAAA,KAAA,MAAW,UAAA,IAAc,MAAA,CAAO,MAAA,CAAO,WAAW,CAAA,EAAG;AACnD,IAAA,KAAA,MAAW,KAAA,IAAS,iBAAA,CAAkB,UAAA,EAAY,IAAI,CAAA,EAAG;AACvD,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,MAAM,CAAA;AACpC,MAAA,IAAI,KAAA,KAAU,MAAA,EAAW,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,QAAQ,IAAI,GAAA,CAAI,KAAA,CAAM,KAAK,CAAC,CAAA;AAAA,sBACrD,IAAA,IAAQ,KAAA,CAAM,KAAA,EAAO,KAAA,CAAM,IAAI,IAAI,CAAA;AAAA,IACrD;AAAA,EACF;AACA,EAAA,OAAO,OAAO,KAAK,CAAA;AACrB;AAGO,IAAM,WAAA,GAAc,CACzB,SAAA,EACA,OAAA,KACsB,SAAA,CAAU,MAAA,CAAO,CAAC,KAAA,KAAU,OAAA,CAAQ,KAAA,CAAM,MAAM,CAAA,KAAM,MAAS","file":"index.cjs","sourcesContent":["// ═══════════════════════════════════════════════════════════\n// Shared primitives — common types + generic guards used to\n// narrow `unknown` across the package.\n// ═══════════════════════════════════════════════════════════\n\nexport type Unsubscribe = () => void;\n\nexport const isObject = (value: unknown): value is Record<string, unknown> =>\n typeof value === 'object' && value !== null && !Array.isArray(value);\n\nexport const isString = (value: unknown): value is string => typeof value === 'string';\n\nexport const isNumber = (value: unknown): value is number => typeof value === 'number';\n\nexport const isBoolean = (value: unknown): value is boolean => typeof value === 'boolean';\n\nexport const isArray = (value: unknown): value is unknown[] => Array.isArray(value);\n\nexport const isNonNull = <T>(value: T | null | undefined): value is T =>\n value !== null && value !== undefined;\n\nexport const hasKey = <K extends string>(\n obj: unknown,\n key: K,\n): obj is Record<K, unknown> => isObject(obj) && key in obj;\n","// ═══════════════════════════════════════════════════════════\n// NOVA IS LANGUAGE-BLIND, the same way it is surface-blind.\n//\n// The core renders a layout into a `RenderNode` tree and knows nothing about\n// what language the words in it are. This area adds one late pass over that\n// tree — swap the words, leave the structure — plus the harvester that tells\n// you which words there are to swap.\n//\n// WHY A LATE PASS AND NOT A `$t` IN THE LAYOUT. Both work; they cost\n// differently. A key-per-string layout (`label: '@t.people.add'`) is precise\n// and makes every layout in the application unreadable — the file stops saying\n// what it draws. A late pass leaves the layouts as the readable English they\n// already are and moves the whole problem to one walk, at the price of keying\n// the dictionary on the source string rather than on an invented id.\n//\n// The price is real and worth naming: English-as-key cannot distinguish two\n// senses of one word. \"Book\" the verb and \"Book\" the noun are one key here and\n// two words in German. When that bites, the answer is not to abandon the pass\n// — it is to disambiguate that one string at its author site, and a `$t`\n// directive is the natural place for it. The two compose; this is the layer\n// that makes the other one optional rather than mandatory.\n//\n// WHAT THIS PASS CANNOT DO, and where the rest of the work goes:\n// - Open-ended formatted values — dates, money, counts. \"Fri 14 Mar\" has\n// unbounded cardinality and no dictionary will ever hold it. Those are\n// formatted at their source with a locale (prism's `$localeDate`,\n// `$localeMoney`, `$localeNumber`).\n// - Anything not in the tree: a server error message, a notification body.\n// ═══════════════════════════════════════════════════════════\n\n/** Source phrase → the words a reader of this locale should see. */\nexport type Phrasebook = Readonly<Record<string, string>>;\n\n// WHICH STRINGS IN A TREE ARE PROSE, declared by the host rather than guessed.\n//\n// A render tree is mostly not prose. It carries person names, ids, css values,\n// tone words, icon names and row data, and a pass that translated every string\n// it found would rename a member called \"Pass\" the first time somebody bought\n// one. So the host names the carriers, and everything else is left alone.\nexport type PhraseKeys = {\n // Prop names whose string values are prose: `label`, `title`, `placeholder`.\n // Matched at ANY depth inside a prop value, which is what makes a spec prop\n // work — a `Table`'s `columns: [{ label }]` and a `Select`'s\n // `options: [{ label }]` are the same rule as a bare `label`.\n props?: readonly string[];\n // Suffixes marking a DATA field as a display string. An app that spells its\n // read-time display fields `status_display`, `term_display` declares\n // `['_display']` once here, and every closed-set word a query manufactures\n // becomes translatable without the app naming them one by one.\n //\n // Only for CLOSED sets. A `_display` field holding a formatted date or an\n // amount will simply miss, every time, and should be formatted with a locale\n // at its source instead.\n suffixes?: readonly string[];\n // Translate bare text nodes (a layout's literal children). Default: true.\n text?: boolean;\n};\n\nexport const DEFAULT_PHRASE_KEYS: Required<Pick<PhraseKeys, 'props' | 'text'>> = {\n // A starting set, not a standard — an app with its own vocabulary passes its\n // own. Deliberately absent: `name`, `value`, `id`, `icon`, `tone`, `variant`,\n // `key`. Those carry data or design tokens, and translating them is how a\n // person called \"Active\" gets renamed.\n props: [\n 'label',\n 'title',\n 'subtitle',\n 'heading',\n 'eyebrow',\n 'lead',\n 'blurb',\n 'placeholder',\n 'hint',\n 'help',\n 'message',\n 'empty',\n 'emptyHint',\n 'emptyLabel',\n 'noMatch',\n 'caption',\n 'description',\n 'confirmLabel',\n 'cancelLabel',\n 'alt',\n 'tooltip',\n ],\n text: true,\n};\n\nexport type PhraseKeyMatcher = {\n isProse: (key: string) => boolean;\n text: boolean;\n};\n\nexport const matcherFor = (keys: PhraseKeys | undefined): PhraseKeyMatcher => {\n const props = new Set(keys?.props ?? DEFAULT_PHRASE_KEYS.props);\n const suffixes = keys?.suffixes ?? [];\n return {\n isProse: (key: string): boolean => props.has(key) || suffixes.some((suffix) => key.endsWith(suffix)),\n text: keys?.text ?? DEFAULT_PHRASE_KEYS.text,\n };\n};\n\n// A string that is a BINDING resolves to data at render time, so it is never a\n// phrase: harvesting `'$.member.person_name'` would put a path in the\n// dictionary and translating it would do nothing.\n//\n// Three forms, matching what the resolver recognises\n// (`shared/bindings/resolve.ts`): a bare `$` path, a `{{ }}` template, and an\n// `@`-prefixed EXTRA scope. The last one is easy to forget and shows up\n// immediately — a trigger's `{ set: 'x', value: '@event.payload.theme_id' }`\n// is a step's plumbing, and a harvester without this rule fills a language\n// file with several dozen of them.\nconst BARE_PATH = /^\\$(\\.|[A-Za-z_]|$)/;\nconst EXTRA_SCOPE = /^@[A-Za-z_]/;\n\nexport const isBinding = (value: string): boolean =>\n BARE_PATH.test(value) || EXTRA_SCOPE.test(value) || value.includes('{{');\n\n// Worth translating at all: a non-empty string that is not a binding and is not\n// obviously machine vocabulary. The last clause is a cheap guard against\n// harvesting css values and tokens that happen to sit at an allowlisted key.\nexport const isPhrase = (value: string): boolean => {\n const trimmed = value.trim();\n if (trimmed === '' || isBinding(trimmed)) return false;\n // A phrase has a letter in it. '—', '18:30', '#fff', '100%' do not.\n return /\\p{L}/u.test(trimmed);\n};\n","import { isArray, isObject } from '../shared/common';\nimport { matcherFor } from './phrases';\nimport { isPhrase } from './phrases';\nimport type { PhraseKeys, Phrasebook } from './phrases';\n\n// ═══════════════════════════════════════════════════════════\n// The swap itself — over VALUES, knowing nothing about trees.\n//\n// Deliberately free of any layout import, because the renderer needs it and\n// the renderer is what layout IS. `translate.ts` (the tree walk) and\n// `layout/renderer.ts` (the mint) are two callers of this one engine, and the\n// whole point of the file is that they can never disagree about what a swap\n// means.\n// ═══════════════════════════════════════════════════════════\n\nexport type Pass = {\n phrases: Phrasebook;\n isProse: (key: string) => boolean;\n text: boolean;\n onMiss: ((phrase: string, where: string) => void) | undefined;\n};\n\nexport type PassOptions = {\n phrases?: Phrasebook;\n keys?: PhraseKeys;\n onMiss?: (phrase: string, where: string) => void;\n};\n\nconst EMPTY: Phrasebook = {};\n\n// ACTIVE OR ABSENT, decided once. A host that named neither a book nor a key\n// set is not doing i18n, and pays nothing: `undefined` here means the renderer\n// skips every branch below, and a `{ phrase, slots }` object passes through as\n// the object it is.\n//\n// A key set WITHOUT a book is the source language, and is NOT nothing: patterns\n// still have to be filled, because a counted phrase reaches the glass as a\n// structure and nobody downstream knows how to read it. That is the one job\n// this pass keeps doing when there is nothing to translate.\nexport const passFor = (options: PassOptions | undefined): Pass | undefined => {\n if (options === undefined) return undefined;\n if (options.phrases === undefined && options.keys === undefined) return undefined;\n const matcher = matcherFor(options.keys);\n return {\n phrases: options.phrases ?? EMPTY,\n isProse: matcher.isProse,\n text: matcher.text,\n onMiss: options.onMiss,\n };\n};\n\nexport const swap = (value: string, where: string, pass: Pass): string => {\n if (!isPhrase(value)) return value;\n const hit = pass.phrases[value];\n if (hit !== undefined) return hit;\n // Trailing/leading whitespace is a layout accident, not part of the phrase.\n // Trying the trimmed form keeps `'Save '` from being a second dictionary\n // entry nobody remembers to fill in.\n const trimmed = value.trim();\n if (trimmed !== value) {\n const onTrimmed = pass.phrases[trimmed];\n if (onTrimmed !== undefined) return value.replace(trimmed, onTrimmed);\n }\n pass.onMiss?.(trimmed, where);\n return value;\n};\n\n// A PATTERN: a counted phrase, translated WHOLE and filled here — the one\n// point that has the book. `{ phrase: '{n} of {total}', slots: { n: 1,\n// total: 12 } }` becomes `'1 von 12'`: the pattern is a dictionary row like\n// any other, so cardinality stays out of the book. A string slot is offered\n// to the book too — a composed sentence's fragments (\"somebody enquires\")\n// are vocabulary in their own right — and everything else interpolates as\n// itself. An empty book fills the holes and translates nothing, which is\n// exactly what a source-language session needs.\nconst isPattern = (value: Record<string, unknown>): value is { phrase: string; slots: Record<string, unknown> } =>\n typeof value['phrase'] === 'string' && isObject(value['slots']);\n\nconst fillPattern = (pattern: { phrase: string; slots: Record<string, unknown> }, where: string, pass: Pass): string =>\n swap(pattern.phrase, where, pass).replace(/\\{([A-Za-z_][A-Za-z0-9_]*)\\}/g, (hole, name: string) => {\n const slot = pattern.slots[name];\n if (slot === undefined || slot === null) return hole;\n return typeof slot === 'string' && isPhrase(slot) ? swap(slot, `${where}.${name}`, pass) : String(slot);\n });\n\n// A book that translates nothing — for filling a pattern outside a render,\n// which is the only thing left to do with one when there are no words to swap.\nconst SOURCE: Pass = { phrases: EMPTY, isProse: () => true, text: true, onMiss: undefined };\n\n// FILL A COUNTED PHRASE THAT NEVER WENT THROUGH A RENDER.\n//\n// The renderer fills patterns on the way to a screen, so nothing downstream of\n// it needs this. What does need it is everything UPSTREAM: a check that reads\n// an entry straight from the engine, a fixture, an exporter — anywhere a\n// `{ phrase, slots }` is held as data rather than shown as words. Nova defines\n// the shape, so nova reads it; a host writing its own copy of this loop is how\n// two spellings of one rule start drifting.\n//\n// Anything that is not a pattern comes back untouched, so it is safe to call\n// on a whole column of mixed values.\nexport const fillPhrase = (value: unknown): unknown => {\n if (!isObject(value) || !isPattern(value)) return value;\n return fillPattern(value, '', SOURCE);\n};\n\n// Walk a prop VALUE. Depth matters: a spec prop is where the repeated structure\n// of a screen lives (`columns: [{ label }]`, `options: [{ label }]`), so the\n// rule cannot be \"top-level props only\" without missing most of a table.\n//\n// Returns the value it was given when nothing under it changed. Identity is\n// load-bearing rather than tidy: a source-language render must produce the\n// props object it produced before this existed, or every untranslated session\n// pays a rebuild for a walk that did nothing.\nexport const walkValue = (value: unknown, prose: boolean, where: string, pass: Pass): unknown => {\n if (typeof value === 'string') return prose ? swap(value, where, pass) : value;\n if (isArray(value)) {\n let changed = false;\n const out = value.map((entry, index) => {\n // An array inherits its key's proseness — `options: ['Yes', 'No']` is as\n // much prose as `options: [{ label: 'Yes' }]`.\n const next = walkValue(entry, prose, `${where}[${String(index)}]`, pass);\n if (next !== entry) changed = true;\n return next;\n });\n return changed ? out : value;\n }\n if (isObject(value)) {\n if (prose && isPattern(value)) return fillPattern(value, where, pass);\n let changed = false;\n const out: Record<string, unknown> = {};\n for (const [key, entry] of Object.entries(value)) {\n const next = walkValue(entry, pass.isProse(key), `${where}.${key}`, pass);\n if (next !== entry) changed = true;\n out[key] = next;\n }\n return changed ? out : value;\n }\n return value;\n};\n","import type { RenderNode } from '../layout';\nimport { passFor, swap, walkValue } from './swap';\nimport type { Pass } from './swap';\nimport type { PhraseKeys, Phrasebook } from './phrases';\n\n// ═══════════════════════════════════════════════════════════\n// translateRenderTree — the late pass, for whoever holds a tree they did not\n// render.\n//\n// NOT the main road any more. Since the swap moved into the renderer\n// (`layout/renderer.ts`), a tree that came out of a nova shell is already in\n// the reader's language and this pass would find nothing to do. What is left\n// for it is every tree that arrived from somewhere else: a frame replayed from\n// a cache, an exporter's fixture, a test that builds nodes by hand.\n//\n// Structure in, same structure out, with prose swapped. A phrase with no entry\n// passes through unchanged — the only sane failure, since a missing\n// translation should show the source language, never an empty box and never a\n// key. `onMiss` is how a check turns those into a list.\n//\n// One deliberate difference from the renderer: an EMPTY book short-circuits\n// here and returns the very same tree, patterns included. The renderer fills\n// patterns even with no book, because a source-language session has nobody\n// else to do it; a tree-holder with no book has nothing to say about a tree it\n// did not make.\n// ═══════════════════════════════════════════════════════════\n\nexport type TranslateOptions = {\n phrases: Phrasebook;\n keys?: PhraseKeys;\n // Called once per untranslated phrase, with where it was found. For a dev\n // check that has to answer \"what did we forget\" without a human reading every\n // screen. Never call it from a hot path — it is a reporting seam.\n onMiss?: (phrase: string, where: string) => void;\n};\n\nconst walkNode = (node: RenderNode, where: string, pass: Pass): RenderNode => {\n if (node.type === 'text') {\n if (!pass.text) return node;\n const value = swap(node.value, where, pass);\n return value === node.value ? node : { ...node, value };\n }\n\n if (node.type === 'fragment') {\n const children = walkNodes(node.children, where, pass);\n return children === node.children ? node : { ...node, children };\n }\n\n // An error node's message is a diagnostic for whoever is on call, not product\n // copy — left in the language the stack throws in, deliberately.\n if (node.type === 'error') return node;\n\n const at = node.ref === undefined ? `${where}/${node.name}` : `${where}/${node.name}#${node.ref}`;\n let props = node.props;\n let propsChanged = false;\n const nextProps: Record<string, unknown> = {};\n for (const [key, value] of Object.entries(node.props)) {\n const next = walkValue(value, pass.isProse(key), `${at}.${key}`, pass);\n if (next !== value) propsChanged = true;\n nextProps[key] = next;\n }\n if (propsChanged) props = nextProps;\n\n const children = walkNodes(node.children, at, pass);\n if (!propsChanged && children === node.children) return node;\n return { ...node, props, children };\n};\n\n// Identity is returned when nothing under a node changed. Not an optimisation\n// for its own sake: an untranslated locale (the source language) must produce\n// the byte-identical frame it produced before this pass existed, or every\n// English session pays a delta rebuild for a walk that did nothing.\nconst walkNodes = (nodes: RenderNode[], where: string, pass: Pass): RenderNode[] => {\n let changed = false;\n const out = nodes.map((node) => {\n const next = walkNode(node, where, pass);\n if (next !== node) changed = true;\n return next;\n });\n return changed ? out : nodes;\n};\n\nexport const translateRenderTree = (tree: RenderNode[], options: TranslateOptions): RenderNode[] => {\n // An empty phrasebook is the source language. Skip the walk entirely rather\n // than doing it and finding nothing.\n if (Object.keys(options.phrases).length === 0) return tree;\n const pass = passFor({\n phrases: options.phrases,\n ...(options.keys === undefined ? {} : { keys: options.keys }),\n ...(options.onMiss === undefined ? {} : { onMiss: options.onMiss }),\n });\n if (pass === undefined) return tree;\n return walkNodes(tree, '', pass);\n};\n","import { isArray, isObject } from '../shared/common';\nimport type { ActionDefinition } from '../action';\nimport type { LayoutNode } from '../layout';\nimport { isPhrase, matcherFor } from './phrases';\nimport type { PhraseKeys } from './phrases';\n\n// ═══════════════════════════════════════════════════════════\n// harvest — read every phrase an action could put on a screen, without\n// running it.\n//\n// The other half of the late pass. Keying a dictionary on source strings only\n// works if there is a mechanical way to enumerate them; otherwise \"translate\n// the app\" means a human reading every layout, and the second language is\n// permanently 90% done.\n//\n// This walks the AUTHORED artifacts — definitions and layouts — not a rendered\n// tree, and that is the point: what comes back is exactly the set of strings a\n// person wrote, never a value that arrived from the database. A member called\n// \"Pass\" can therefore never enter the dictionary by being on screen the day\n// somebody ran the harvest.\n// ═══════════════════════════════════════════════════════════\n\nexport type HarvestedPhrase = {\n phrase: string;\n /** Every author site it came from — sorted, deduped. */\n where: readonly string[];\n};\n\ntype Sink = {\n add: (phrase: string, where: string) => void;\n isProse: (key: string) => boolean;\n text: boolean;\n};\n\nconst sinkInto = (found: Map<string, Set<string>>, keys: PhraseKeys | undefined): Sink => {\n const matcher = matcherFor(keys);\n return {\n add: (phrase, where) => {\n const trimmed = phrase.trim();\n if (!isPhrase(trimmed)) return;\n const sites = found.get(trimmed);\n if (sites === undefined) found.set(trimmed, new Set([where]));\n else sites.add(where);\n },\n isProse: matcher.isProse,\n text: matcher.text,\n };\n};\n\n// Inside an allowlisted prop, EVERY reachable literal is a phrase. A `label`\n// holding `{ $if: …, $then: 'Save', $else: 'Create' }` has two of them, and a\n// harvester that only accepted a direct string would silently drop the branch\n// nobody was looking at.\nconst harvestWithin = (value: unknown, where: string, sink: Sink): void => {\n if (typeof value === 'string') {\n sink.add(value, where);\n return;\n }\n if (isArray(value)) {\n value.forEach((entry, index) => harvestWithin(entry, `${where}[${String(index)}]`, sink));\n return;\n }\n if (isObject(value)) {\n for (const [key, entry] of Object.entries(value)) harvestWithin(entry, `${where}.${key}`, sink);\n }\n};\n\nconst harvestProps = (props: Record<string, unknown>, where: string, sink: Sink): void => {\n for (const [key, value] of Object.entries(props)) {\n if (sink.isProse(key)) {\n harvestWithin(value, `${where}.${key}`, sink);\n continue;\n }\n // Not a prose key itself — but a nested object under it may hold one\n // (`cell: { label }` inside a column spec). Keep descending; only the KEY\n // decides, never the depth.\n if (isObject(value) || isArray(value)) harvestNested(value, `${where}.${key}`, sink);\n }\n};\n\nconst harvestNested = (value: unknown, where: string, sink: Sink): void => {\n if (isArray(value)) {\n value.forEach((entry, index) => harvestNested(entry, `${where}[${String(index)}]`, sink));\n return;\n }\n if (!isObject(value)) return;\n for (const [key, entry] of Object.entries(value)) {\n if (sink.isProse(key)) harvestWithin(entry, `${where}.${key}`, sink);\n else harvestNested(entry, `${where}.${key}`, sink);\n }\n};\n\n// Takes `unknown` rather than `LayoutNode`: the walk discriminates the node\n// kinds structurally, and narrowing a union by `in` checks fights the compiler\n// for no benefit here — every branch reads what it needs and guards it.\nconst harvestNode = (node: unknown, where: string, sink: Sink): void => {\n if (node === null || node === undefined) return;\n if (typeof node === 'string') {\n // A text position: the layout's literal children.\n if (sink.text) sink.add(node, where);\n return;\n }\n if (typeof node === 'number' || typeof node === 'boolean') return;\n if (isArray(node)) {\n node.forEach((child, index) => harvestNode(child, `${where}[${String(index)}]`, sink));\n return;\n }\n if (!isObject(node)) return;\n\n const component = node['component'];\n if (component === undefined) {\n // A stored-layout reference and a fragment slot are ids, never words.\n if ('ref' in node || 'slot' in node) return;\n if ('if' in node) {\n harvestNode(node['then'], `${where}.then`, sink);\n harvestNode(node['else'], `${where}.else`, sink);\n return;\n }\n if ('for' in node && 'do' in node) {\n harvestNode(node['do'], `${where}.do`, sink);\n return;\n }\n return;\n }\n\n const at = `${where}/${String(component)}`;\n const props = node['props'];\n if (isObject(props)) harvestProps(props, at, sink);\n harvestNode(node['children'], `${at}.children`, sink);\n};\n\nconst toList = (found: Map<string, Set<string>>): HarvestedPhrase[] =>\n [...found.entries()]\n .map(([phrase, sites]) => ({ phrase, where: [...sites].sort() }))\n .sort((a, b) => a.phrase.localeCompare(b.phrase));\n\nexport const harvestLayout = (layout: LayoutNode, keys?: PhraseKeys): HarvestedPhrase[] => {\n const found = new Map<string, Set<string>>();\n harvestNode(layout, '', sinkInto(found, keys));\n return toList(found);\n};\n\n// A `{ set: '<key>', value: '<literal>' }` step writes words into data, and\n// data lands in props. An error message a trigger sets is as much product copy\n// as a heading, and is otherwise invisible to a harvester that only reads\n// layouts.\nconst harvestSteps = (value: unknown, where: string, sink: Sink): void => {\n if (isArray(value)) {\n value.forEach((entry, index) => harvestSteps(entry, `${where}[${String(index)}]`, sink));\n return;\n }\n if (!isObject(value)) return;\n const target = value['set'];\n const written = value['value'];\n if (typeof target === 'string' && typeof written === 'string') sink.add(written, `${where}.set:${target}`);\n for (const [key, entry] of Object.entries(value)) {\n if (key === 'set' || key === 'value') continue;\n harvestSteps(entry, `${where}.${key}`, sink);\n }\n};\n\nexport const harvestDefinition = (definition: ActionDefinition, keys?: PhraseKeys): HarvestedPhrase[] => {\n const found = new Map<string, Set<string>>();\n const sink = sinkInto(found, keys);\n const id = definition.id;\n\n // The title is chrome's words — a Sheet header, a catalog entry — and reaches\n // the tree as a prop rather than from the layout.\n if (typeof definition.title === 'string') sink.add(definition.title, `${id}.title`);\n\n // Defaulted data is a screen's opening text: the 'Stock' in a theme name, the\n // placeholder a list shows before its first read lands.\n //\n // TWO RULES, because `data` is two things at once.\n //\n // A top-level string is taken WHOLE, whatever its key. Where it lands decides\n // whether it is prose, and only the LAYOUT knows that: `runningHint` is not a\n // prose key and reaches the glass as a text child, so a matcher applied here\n // would drop a sentence the pass goes on to translate. The cost of taking\n // them all is enum values and ids in the report, which a host filters by name.\n //\n // Anything NESTED is walked by the matcher instead, and that is the rule that\n // reaches an options array — `views: [{ value: 'running', label: 'Running' }]`\n // yields `Running` and never `running`. Without it a tab strip built in data\n // is not merely untranslatable but UNCOUNTED, which is the worse half: the\n // harvest reports a full book while the words are missing from the screen.\n for (const [key, value] of Object.entries(definition.data ?? {})) {\n if (typeof value === 'string') sink.add(value, `${id}.data.${key}`);\n else if (isObject(value) || isArray(value)) harvestNested(value, `${id}.data.${key}`, sink);\n }\n\n if (definition.layout !== undefined) harvestNode(definition.layout, id, sink);\n if (definition.triggers !== undefined) harvestSteps(definition.triggers, `${id}.triggers`, sink);\n if (definition.lifecycle !== undefined) harvestSteps(definition.lifecycle, `${id}.lifecycle`, sink);\n\n return toList(found);\n};\n\nexport const harvestDefinitions = (\n definitions: Record<string, ActionDefinition>,\n keys?: PhraseKeys,\n): HarvestedPhrase[] => {\n const found = new Map<string, Set<string>>();\n for (const definition of Object.values(definitions)) {\n for (const entry of harvestDefinition(definition, keys)) {\n const sites = found.get(entry.phrase);\n if (sites === undefined) found.set(entry.phrase, new Set(entry.where));\n else for (const site of entry.where) sites.add(site);\n }\n }\n return toList(found);\n};\n\n/** Phrases with no entry in the book — what a language is still missing. */\nexport const missingFrom = (\n harvested: readonly HarvestedPhrase[],\n phrases: Readonly<Record<string, string>>,\n): HarvestedPhrase[] => harvested.filter((entry) => phrases[entry.phrase] === undefined);\n"]}
|
|
1
|
+
{"version":3,"sources":[],"names":[],"mappings":"","file":"index.cjs"}
|
package/dist/i18n/index.js
CHANGED
|
@@ -1,180 +1,6 @@
|
|
|
1
|
-
|
|
1
|
+
export { harvestDefinition, harvestDefinitions, harvestLayout, missingFrom, translateRenderTree } from '../chunk-XQTI4Q4I.js';
|
|
2
2
|
export { DEFAULT_PHRASE_KEYS, fillPhrase, isBinding, isPhrase, matcherFor } from '../chunk-7TS3YVQR.js';
|
|
3
|
-
import
|
|
3
|
+
import '../chunk-RBU5PHN4.js';
|
|
4
4
|
import '../chunk-PZ5AY32C.js';
|
|
5
|
-
|
|
6
|
-
// src/i18n/translate.ts
|
|
7
|
-
var walkNode = (node, where, pass) => {
|
|
8
|
-
if (node.type === "text") {
|
|
9
|
-
if (!pass.text) return node;
|
|
10
|
-
const value = swap(node.value, where, pass);
|
|
11
|
-
return value === node.value ? node : { ...node, value };
|
|
12
|
-
}
|
|
13
|
-
if (node.type === "fragment") {
|
|
14
|
-
const children2 = walkNodes(node.children, where, pass);
|
|
15
|
-
return children2 === node.children ? node : { ...node, children: children2 };
|
|
16
|
-
}
|
|
17
|
-
if (node.type === "error") return node;
|
|
18
|
-
const at = node.ref === void 0 ? `${where}/${node.name}` : `${where}/${node.name}#${node.ref}`;
|
|
19
|
-
let props = node.props;
|
|
20
|
-
let propsChanged = false;
|
|
21
|
-
const nextProps = {};
|
|
22
|
-
for (const [key, value] of Object.entries(node.props)) {
|
|
23
|
-
const next = walkValue(value, pass.isProse(key), `${at}.${key}`, pass);
|
|
24
|
-
if (next !== value) propsChanged = true;
|
|
25
|
-
nextProps[key] = next;
|
|
26
|
-
}
|
|
27
|
-
if (propsChanged) props = nextProps;
|
|
28
|
-
const children = walkNodes(node.children, at, pass);
|
|
29
|
-
if (!propsChanged && children === node.children) return node;
|
|
30
|
-
return { ...node, props, children };
|
|
31
|
-
};
|
|
32
|
-
var walkNodes = (nodes, where, pass) => {
|
|
33
|
-
let changed = false;
|
|
34
|
-
const out = nodes.map((node) => {
|
|
35
|
-
const next = walkNode(node, where, pass);
|
|
36
|
-
if (next !== node) changed = true;
|
|
37
|
-
return next;
|
|
38
|
-
});
|
|
39
|
-
return changed ? out : nodes;
|
|
40
|
-
};
|
|
41
|
-
var translateRenderTree = (tree, options) => {
|
|
42
|
-
if (Object.keys(options.phrases).length === 0) return tree;
|
|
43
|
-
const pass = passFor({
|
|
44
|
-
phrases: options.phrases,
|
|
45
|
-
...options.keys === void 0 ? {} : { keys: options.keys },
|
|
46
|
-
...options.onMiss === void 0 ? {} : { onMiss: options.onMiss }
|
|
47
|
-
});
|
|
48
|
-
if (pass === void 0) return tree;
|
|
49
|
-
return walkNodes(tree, "", pass);
|
|
50
|
-
};
|
|
51
|
-
|
|
52
|
-
// src/i18n/harvest.ts
|
|
53
|
-
var sinkInto = (found, keys) => {
|
|
54
|
-
const matcher = matcherFor(keys);
|
|
55
|
-
return {
|
|
56
|
-
add: (phrase, where) => {
|
|
57
|
-
const trimmed = phrase.trim();
|
|
58
|
-
if (!isPhrase(trimmed)) return;
|
|
59
|
-
const sites = found.get(trimmed);
|
|
60
|
-
if (sites === void 0) found.set(trimmed, /* @__PURE__ */ new Set([where]));
|
|
61
|
-
else sites.add(where);
|
|
62
|
-
},
|
|
63
|
-
isProse: matcher.isProse,
|
|
64
|
-
text: matcher.text
|
|
65
|
-
};
|
|
66
|
-
};
|
|
67
|
-
var harvestWithin = (value, where, sink) => {
|
|
68
|
-
if (typeof value === "string") {
|
|
69
|
-
sink.add(value, where);
|
|
70
|
-
return;
|
|
71
|
-
}
|
|
72
|
-
if (isArray(value)) {
|
|
73
|
-
value.forEach((entry, index) => harvestWithin(entry, `${where}[${String(index)}]`, sink));
|
|
74
|
-
return;
|
|
75
|
-
}
|
|
76
|
-
if (isObject(value)) {
|
|
77
|
-
for (const [key, entry] of Object.entries(value)) harvestWithin(entry, `${where}.${key}`, sink);
|
|
78
|
-
}
|
|
79
|
-
};
|
|
80
|
-
var harvestProps = (props, where, sink) => {
|
|
81
|
-
for (const [key, value] of Object.entries(props)) {
|
|
82
|
-
if (sink.isProse(key)) {
|
|
83
|
-
harvestWithin(value, `${where}.${key}`, sink);
|
|
84
|
-
continue;
|
|
85
|
-
}
|
|
86
|
-
if (isObject(value) || isArray(value)) harvestNested(value, `${where}.${key}`, sink);
|
|
87
|
-
}
|
|
88
|
-
};
|
|
89
|
-
var harvestNested = (value, where, sink) => {
|
|
90
|
-
if (isArray(value)) {
|
|
91
|
-
value.forEach((entry, index) => harvestNested(entry, `${where}[${String(index)}]`, sink));
|
|
92
|
-
return;
|
|
93
|
-
}
|
|
94
|
-
if (!isObject(value)) return;
|
|
95
|
-
for (const [key, entry] of Object.entries(value)) {
|
|
96
|
-
if (sink.isProse(key)) harvestWithin(entry, `${where}.${key}`, sink);
|
|
97
|
-
else harvestNested(entry, `${where}.${key}`, sink);
|
|
98
|
-
}
|
|
99
|
-
};
|
|
100
|
-
var harvestNode = (node, where, sink) => {
|
|
101
|
-
if (node === null || node === void 0) return;
|
|
102
|
-
if (typeof node === "string") {
|
|
103
|
-
if (sink.text) sink.add(node, where);
|
|
104
|
-
return;
|
|
105
|
-
}
|
|
106
|
-
if (typeof node === "number" || typeof node === "boolean") return;
|
|
107
|
-
if (isArray(node)) {
|
|
108
|
-
node.forEach((child, index) => harvestNode(child, `${where}[${String(index)}]`, sink));
|
|
109
|
-
return;
|
|
110
|
-
}
|
|
111
|
-
if (!isObject(node)) return;
|
|
112
|
-
const component = node["component"];
|
|
113
|
-
if (component === void 0) {
|
|
114
|
-
if ("ref" in node || "slot" in node) return;
|
|
115
|
-
if ("if" in node) {
|
|
116
|
-
harvestNode(node["then"], `${where}.then`, sink);
|
|
117
|
-
harvestNode(node["else"], `${where}.else`, sink);
|
|
118
|
-
return;
|
|
119
|
-
}
|
|
120
|
-
if ("for" in node && "do" in node) {
|
|
121
|
-
harvestNode(node["do"], `${where}.do`, sink);
|
|
122
|
-
return;
|
|
123
|
-
}
|
|
124
|
-
return;
|
|
125
|
-
}
|
|
126
|
-
const at = `${where}/${String(component)}`;
|
|
127
|
-
const props = node["props"];
|
|
128
|
-
if (isObject(props)) harvestProps(props, at, sink);
|
|
129
|
-
harvestNode(node["children"], `${at}.children`, sink);
|
|
130
|
-
};
|
|
131
|
-
var toList = (found) => [...found.entries()].map(([phrase, sites]) => ({ phrase, where: [...sites].sort() })).sort((a, b) => a.phrase.localeCompare(b.phrase));
|
|
132
|
-
var harvestLayout = (layout, keys) => {
|
|
133
|
-
const found = /* @__PURE__ */ new Map();
|
|
134
|
-
harvestNode(layout, "", sinkInto(found, keys));
|
|
135
|
-
return toList(found);
|
|
136
|
-
};
|
|
137
|
-
var harvestSteps = (value, where, sink) => {
|
|
138
|
-
if (isArray(value)) {
|
|
139
|
-
value.forEach((entry, index) => harvestSteps(entry, `${where}[${String(index)}]`, sink));
|
|
140
|
-
return;
|
|
141
|
-
}
|
|
142
|
-
if (!isObject(value)) return;
|
|
143
|
-
const target = value["set"];
|
|
144
|
-
const written = value["value"];
|
|
145
|
-
if (typeof target === "string" && typeof written === "string") sink.add(written, `${where}.set:${target}`);
|
|
146
|
-
for (const [key, entry] of Object.entries(value)) {
|
|
147
|
-
if (key === "set" || key === "value") continue;
|
|
148
|
-
harvestSteps(entry, `${where}.${key}`, sink);
|
|
149
|
-
}
|
|
150
|
-
};
|
|
151
|
-
var harvestDefinition = (definition, keys) => {
|
|
152
|
-
const found = /* @__PURE__ */ new Map();
|
|
153
|
-
const sink = sinkInto(found, keys);
|
|
154
|
-
const id = definition.id;
|
|
155
|
-
if (typeof definition.title === "string") sink.add(definition.title, `${id}.title`);
|
|
156
|
-
for (const [key, value] of Object.entries(definition.data ?? {})) {
|
|
157
|
-
if (typeof value === "string") sink.add(value, `${id}.data.${key}`);
|
|
158
|
-
else if (isObject(value) || isArray(value)) harvestNested(value, `${id}.data.${key}`, sink);
|
|
159
|
-
}
|
|
160
|
-
if (definition.layout !== void 0) harvestNode(definition.layout, id, sink);
|
|
161
|
-
if (definition.triggers !== void 0) harvestSteps(definition.triggers, `${id}.triggers`, sink);
|
|
162
|
-
if (definition.lifecycle !== void 0) harvestSteps(definition.lifecycle, `${id}.lifecycle`, sink);
|
|
163
|
-
return toList(found);
|
|
164
|
-
};
|
|
165
|
-
var harvestDefinitions = (definitions, keys) => {
|
|
166
|
-
const found = /* @__PURE__ */ new Map();
|
|
167
|
-
for (const definition of Object.values(definitions)) {
|
|
168
|
-
for (const entry of harvestDefinition(definition, keys)) {
|
|
169
|
-
const sites = found.get(entry.phrase);
|
|
170
|
-
if (sites === void 0) found.set(entry.phrase, new Set(entry.where));
|
|
171
|
-
else for (const site of entry.where) sites.add(site);
|
|
172
|
-
}
|
|
173
|
-
}
|
|
174
|
-
return toList(found);
|
|
175
|
-
};
|
|
176
|
-
var missingFrom = (harvested, phrases) => harvested.filter((entry) => phrases[entry.phrase] === void 0);
|
|
177
|
-
|
|
178
|
-
export { harvestDefinition, harvestDefinitions, harvestLayout, missingFrom, translateRenderTree };
|
|
179
5
|
//# sourceMappingURL=index.js.map
|
|
180
6
|
//# sourceMappingURL=index.js.map
|
package/dist/i18n/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../../src/i18n/translate.ts","../../src/i18n/harvest.ts"],"names":["children"],"mappings":";;;;;;AAoCA,IAAM,QAAA,GAAW,CAAC,IAAA,EAAkB,KAAA,EAAe,IAAA,KAA2B;AAC5E,EAAA,IAAI,IAAA,CAAK,SAAS,MAAA,EAAQ;AACxB,IAAA,IAAI,CAAC,IAAA,CAAK,IAAA,EAAM,OAAO,IAAA;AACvB,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,CAAK,KAAA,EAAO,OAAO,IAAI,CAAA;AAC1C,IAAA,OAAO,UAAU,IAAA,CAAK,KAAA,GAAQ,OAAO,EAAE,GAAG,MAAM,KAAA,EAAM;AAAA,EACxD;AAEA,EAAA,IAAI,IAAA,CAAK,SAAS,UAAA,EAAY;AAC5B,IAAA,MAAMA,SAAAA,GAAW,SAAA,CAAU,IAAA,CAAK,QAAA,EAAU,OAAO,IAAI,CAAA;AACrD,IAAA,OAAOA,SAAAA,KAAa,KAAK,QAAA,GAAW,IAAA,GAAO,EAAE,GAAG,IAAA,EAAM,UAAAA,SAAAA,EAAS;AAAA,EACjE;AAIA,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,OAAA,EAAS,OAAO,IAAA;AAElC,EAAA,MAAM,KAAK,IAAA,CAAK,GAAA,KAAQ,MAAA,GAAY,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,IAAA,CAAK,IAAI,CAAA,CAAA,GAAK,GAAG,KAAK,CAAA,CAAA,EAAI,KAAK,IAAI,CAAA,CAAA,EAAI,KAAK,GAAG,CAAA,CAAA;AAC/F,EAAA,IAAI,QAAQ,IAAA,CAAK,KAAA;AACjB,EAAA,IAAI,YAAA,GAAe,KAAA;AACnB,EAAA,MAAM,YAAqC,EAAC;AAC5C,EAAA,KAAA,MAAW,CAAC,KAAK,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA,EAAG;AACrD,IAAA,MAAM,IAAA,GAAO,SAAA,CAAU,KAAA,EAAO,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,EAAG,CAAA,EAAG,EAAE,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,EAAI,IAAI,CAAA;AACrE,IAAA,IAAI,IAAA,KAAS,OAAO,YAAA,GAAe,IAAA;AACnC,IAAA,SAAA,CAAU,GAAG,CAAA,GAAI,IAAA;AAAA,EACnB;AACA,EAAA,IAAI,cAAc,KAAA,GAAQ,SAAA;AAE1B,EAAA,MAAM,QAAA,GAAW,SAAA,CAAU,IAAA,CAAK,QAAA,EAAU,IAAI,IAAI,CAAA;AAClD,EAAA,IAAI,CAAC,YAAA,IAAgB,QAAA,KAAa,IAAA,CAAK,UAAU,OAAO,IAAA;AACxD,EAAA,OAAO,EAAE,GAAG,IAAA,EAAM,KAAA,EAAO,QAAA,EAAS;AACpC,CAAA;AAMA,IAAM,SAAA,GAAY,CAAC,KAAA,EAAqB,KAAA,EAAe,IAAA,KAA6B;AAClF,EAAA,IAAI,OAAA,GAAU,KAAA;AACd,EAAA,MAAM,GAAA,GAAM,KAAA,CAAM,GAAA,CAAI,CAAC,IAAA,KAAS;AAC9B,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,IAAA,EAAM,KAAA,EAAO,IAAI,CAAA;AACvC,IAAA,IAAI,IAAA,KAAS,MAAM,OAAA,GAAU,IAAA;AAC7B,IAAA,OAAO,IAAA;AAAA,EACT,CAAC,CAAA;AACD,EAAA,OAAO,UAAU,GAAA,GAAM,KAAA;AACzB,CAAA;AAEO,IAAM,mBAAA,GAAsB,CAAC,IAAA,EAAoB,OAAA,KAA4C;AAGlG,EAAA,IAAI,OAAO,IAAA,CAAK,OAAA,CAAQ,OAAO,CAAA,CAAE,MAAA,KAAW,GAAG,OAAO,IAAA;AACtD,EAAA,MAAM,OAAO,OAAA,CAAQ;AAAA,IACnB,SAAS,OAAA,CAAQ,OAAA;AAAA,IACjB,GAAI,QAAQ,IAAA,KAAS,MAAA,GAAY,EAAC,GAAI,EAAE,IAAA,EAAM,OAAA,CAAQ,IAAA,EAAK;AAAA,IAC3D,GAAI,QAAQ,MAAA,KAAW,MAAA,GAAY,EAAC,GAAI,EAAE,MAAA,EAAQ,OAAA,CAAQ,MAAA;AAAO,GAClE,CAAA;AACD,EAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,EAAA,OAAO,SAAA,CAAU,IAAA,EAAM,EAAA,EAAI,IAAI,CAAA;AACjC;;;AC3DA,IAAM,QAAA,GAAW,CAAC,KAAA,EAAiC,IAAA,KAAuC;AACxF,EAAA,MAAM,OAAA,GAAU,WAAW,IAAI,CAAA;AAC/B,EAAA,OAAO;AAAA,IACL,GAAA,EAAK,CAAC,MAAA,EAAQ,KAAA,KAAU;AACtB,MAAA,MAAM,OAAA,GAAU,OAAO,IAAA,EAAK;AAC5B,MAAA,IAAI,CAAC,QAAA,CAAS,OAAO,CAAA,EAAG;AACxB,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,OAAO,CAAA;AAC/B,MAAA,IAAI,KAAA,KAAU,MAAA,EAAW,KAAA,CAAM,GAAA,CAAI,OAAA,sBAAa,GAAA,CAAI,CAAC,KAAK,CAAC,CAAC,CAAA;AAAA,WACvD,KAAA,CAAM,IAAI,KAAK,CAAA;AAAA,IACtB,CAAA;AAAA,IACA,SAAS,OAAA,CAAQ,OAAA;AAAA,IACjB,MAAM,OAAA,CAAQ;AAAA,GAChB;AACF,CAAA;AAMA,IAAM,aAAA,GAAgB,CAAC,KAAA,EAAgB,KAAA,EAAe,IAAA,KAAqB;AACzE,EAAA,IAAI,OAAO,UAAU,QAAA,EAAU;AAC7B,IAAA,IAAA,CAAK,GAAA,CAAI,OAAO,KAAK,CAAA;AACrB,IAAA;AAAA,EACF;AACA,EAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,EAAG;AAClB,IAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAA,EAAO,KAAA,KAAU,cAAc,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA,EAAK,IAAI,CAAC,CAAA;AACxF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,QAAA,CAAS,KAAK,CAAA,EAAG;AACnB,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,KAAK,CAAA,EAAG,aAAA,CAAc,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,IAAI,CAAA;AAAA,EAChG;AACF,CAAA;AAEA,IAAM,YAAA,GAAe,CAAC,KAAA,EAAgC,KAAA,EAAe,IAAA,KAAqB;AACxF,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,EAAG;AACrB,MAAA,aAAA,CAAc,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,IAAI,CAAA;AAC5C,MAAA;AAAA,IACF;AAIA,IAAA,IAAI,QAAA,CAAS,KAAK,CAAA,IAAK,OAAA,CAAQ,KAAK,CAAA,EAAG,aAAA,CAAc,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,IAAI,CAAA;AAAA,EACrF;AACF,CAAA;AAEA,IAAM,aAAA,GAAgB,CAAC,KAAA,EAAgB,KAAA,EAAe,IAAA,KAAqB;AACzE,EAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,EAAG;AAClB,IAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAA,EAAO,KAAA,KAAU,cAAc,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA,EAAK,IAAI,CAAC,CAAA;AACxF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG;AACtB,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,IAAA,IAAI,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA,EAAG,aAAA,CAAc,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA,EAAI,IAAI,CAAA;AAAA,uBAChD,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,IAAI,CAAA;AAAA,EACnD;AACF,CAAA;AAKA,IAAM,WAAA,GAAc,CAAC,IAAA,EAAe,KAAA,EAAe,IAAA,KAAqB;AACtE,EAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,IAAA,KAAS,MAAA,EAAW;AACzC,EAAA,IAAI,OAAO,SAAS,QAAA,EAAU;AAE5B,IAAA,IAAI,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,GAAA,CAAI,MAAM,KAAK,CAAA;AACnC,IAAA;AAAA,EACF;AACA,EAAA,IAAI,OAAO,IAAA,KAAS,QAAA,IAAY,OAAO,SAAS,SAAA,EAAW;AAC3D,EAAA,IAAI,OAAA,CAAQ,IAAI,CAAA,EAAG;AACjB,IAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,KAAA,EAAO,KAAA,KAAU,YAAY,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA,EAAK,IAAI,CAAC,CAAA;AACrF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,CAAC,QAAA,CAAS,IAAI,CAAA,EAAG;AAErB,EAAA,MAAM,SAAA,GAAY,KAAK,WAAW,CAAA;AAClC,EAAA,IAAI,cAAc,MAAA,EAAW;AAE3B,IAAA,IAAI,KAAA,IAAS,IAAA,IAAQ,MAAA,IAAU,IAAA,EAAM;AACrC,IAAA,IAAI,QAAQ,IAAA,EAAM;AAChB,MAAA,WAAA,CAAY,KAAK,MAAM,CAAA,EAAG,CAAA,EAAG,KAAK,SAAS,IAAI,CAAA;AAC/C,MAAA,WAAA,CAAY,KAAK,MAAM,CAAA,EAAG,CAAA,EAAG,KAAK,SAAS,IAAI,CAAA;AAC/C,MAAA;AAAA,IACF;AACA,IAAA,IAAI,KAAA,IAAS,IAAA,IAAQ,IAAA,IAAQ,IAAA,EAAM;AACjC,MAAA,WAAA,CAAY,KAAK,IAAI,CAAA,EAAG,CAAA,EAAG,KAAK,OAAO,IAAI,CAAA;AAC3C,MAAA;AAAA,IACF;AACA,IAAA;AAAA,EACF;AAEA,EAAA,MAAM,KAAK,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,SAAS,CAAC,CAAA,CAAA;AACxC,EAAA,MAAM,KAAA,GAAQ,KAAK,OAAO,CAAA;AAC1B,EAAA,IAAI,SAAS,KAAK,CAAA,EAAG,YAAA,CAAa,KAAA,EAAO,IAAI,IAAI,CAAA;AACjD,EAAA,WAAA,CAAY,KAAK,UAAU,CAAA,EAAG,CAAA,EAAG,EAAE,aAAa,IAAI,CAAA;AACtD,CAAA;AAEA,IAAM,MAAA,GAAS,CAAC,KAAA,KACd,CAAC,GAAG,KAAA,CAAM,OAAA,EAAS,CAAA,CAChB,IAAI,CAAC,CAAC,MAAA,EAAQ,KAAK,OAAO,EAAE,MAAA,EAAQ,KAAA,EAAO,CAAC,GAAG,KAAK,CAAA,CAAE,IAAA,EAAK,GAAI,CAAA,CAC/D,IAAA,CAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,MAAA,CAAO,aAAA,CAAc,CAAA,CAAE,MAAM,CAAC,CAAA;AAE7C,IAAM,aAAA,GAAgB,CAAC,MAAA,EAAoB,IAAA,KAAyC;AACzF,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAC3C,EAAA,WAAA,CAAY,MAAA,EAAQ,EAAA,EAAI,QAAA,CAAS,KAAA,EAAO,IAAI,CAAC,CAAA;AAC7C,EAAA,OAAO,OAAO,KAAK,CAAA;AACrB;AAMA,IAAM,YAAA,GAAe,CAAC,KAAA,EAAgB,KAAA,EAAe,IAAA,KAAqB;AACxE,EAAA,IAAI,OAAA,CAAQ,KAAK,CAAA,EAAG;AAClB,IAAA,KAAA,CAAM,OAAA,CAAQ,CAAC,KAAA,EAAO,KAAA,KAAU,aAAa,KAAA,EAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAA,CAAO,KAAK,CAAC,CAAA,CAAA,CAAA,EAAK,IAAI,CAAC,CAAA;AACvF,IAAA;AAAA,EACF;AACA,EAAA,IAAI,CAAC,QAAA,CAAS,KAAK,CAAA,EAAG;AACtB,EAAA,MAAM,MAAA,GAAS,MAAM,KAAK,CAAA;AAC1B,EAAA,MAAM,OAAA,GAAU,MAAM,OAAO,CAAA;AAC7B,EAAA,IAAI,OAAO,MAAA,KAAW,QAAA,IAAY,OAAO,OAAA,KAAY,QAAA,EAAU,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,CAAA,EAAG,KAAK,CAAA,KAAA,EAAQ,MAAM,CAAA,CAAE,CAAA;AACzG,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,KAAK,CAAA,EAAG;AAChD,IAAA,IAAI,GAAA,KAAQ,KAAA,IAAS,GAAA,KAAQ,OAAA,EAAS;AACtC,IAAA,YAAA,CAAa,OAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,GAAG,IAAI,IAAI,CAAA;AAAA,EAC7C;AACF,CAAA;AAEO,IAAM,iBAAA,GAAoB,CAAC,UAAA,EAA8B,IAAA,KAAyC;AACvG,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAC3C,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,KAAA,EAAO,IAAI,CAAA;AACjC,EAAA,MAAM,KAAK,UAAA,CAAW,EAAA;AAItB,EAAA,IAAI,OAAO,UAAA,CAAW,KAAA,KAAU,QAAA,EAAU,IAAA,CAAK,IAAI,UAAA,CAAW,KAAA,EAAO,CAAA,EAAG,EAAE,CAAA,MAAA,CAAQ,CAAA;AAkBlF,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,CAAA,IAAK,MAAA,CAAO,QAAQ,UAAA,CAAW,IAAA,IAAQ,EAAE,CAAA,EAAG;AAChE,IAAA,IAAI,OAAO,KAAA,KAAU,QAAA,EAAU,IAAA,CAAK,GAAA,CAAI,OAAO,CAAA,EAAG,EAAE,CAAA,MAAA,EAAS,GAAG,CAAA,CAAE,CAAA;AAAA,SAAA,IACzD,QAAA,CAAS,KAAK,CAAA,IAAK,OAAA,CAAQ,KAAK,CAAA,EAAG,aAAA,CAAc,KAAA,EAAO,CAAA,EAAG,EAAE,CAAA,MAAA,EAAS,GAAG,IAAI,IAAI,CAAA;AAAA,EAC5F;AAEA,EAAA,IAAI,WAAW,MAAA,KAAW,MAAA,cAAuB,UAAA,CAAW,MAAA,EAAQ,IAAI,IAAI,CAAA;AAC5E,EAAA,IAAI,UAAA,CAAW,aAAa,MAAA,EAAW,YAAA,CAAa,WAAW,QAAA,EAAU,CAAA,EAAG,EAAE,CAAA,SAAA,CAAA,EAAa,IAAI,CAAA;AAC/F,EAAA,IAAI,UAAA,CAAW,cAAc,MAAA,EAAW,YAAA,CAAa,WAAW,SAAA,EAAW,CAAA,EAAG,EAAE,CAAA,UAAA,CAAA,EAAc,IAAI,CAAA;AAElG,EAAA,OAAO,OAAO,KAAK,CAAA;AACrB;AAEO,IAAM,kBAAA,GAAqB,CAChC,WAAA,EACA,IAAA,KACsB;AACtB,EAAA,MAAM,KAAA,uBAAY,GAAA,EAAyB;AAC3C,EAAA,KAAA,MAAW,UAAA,IAAc,MAAA,CAAO,MAAA,CAAO,WAAW,CAAA,EAAG;AACnD,IAAA,KAAA,MAAW,KAAA,IAAS,iBAAA,CAAkB,UAAA,EAAY,IAAI,CAAA,EAAG;AACvD,MAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,MAAM,CAAA;AACpC,MAAA,IAAI,KAAA,KAAU,MAAA,EAAW,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,QAAQ,IAAI,GAAA,CAAI,KAAA,CAAM,KAAK,CAAC,CAAA;AAAA,sBACrD,IAAA,IAAQ,KAAA,CAAM,KAAA,EAAO,KAAA,CAAM,IAAI,IAAI,CAAA;AAAA,IACrD;AAAA,EACF;AACA,EAAA,OAAO,OAAO,KAAK,CAAA;AACrB;AAGO,IAAM,WAAA,GAAc,CACzB,SAAA,EACA,OAAA,KACsB,SAAA,CAAU,MAAA,CAAO,CAAC,KAAA,KAAU,OAAA,CAAQ,KAAA,CAAM,MAAM,CAAA,KAAM,MAAS","file":"index.js","sourcesContent":["import type { RenderNode } from '../layout';\nimport { passFor, swap, walkValue } from './swap';\nimport type { Pass } from './swap';\nimport type { PhraseKeys, Phrasebook } from './phrases';\n\n// ═══════════════════════════════════════════════════════════\n// translateRenderTree — the late pass, for whoever holds a tree they did not\n// render.\n//\n// NOT the main road any more. Since the swap moved into the renderer\n// (`layout/renderer.ts`), a tree that came out of a nova shell is already in\n// the reader's language and this pass would find nothing to do. What is left\n// for it is every tree that arrived from somewhere else: a frame replayed from\n// a cache, an exporter's fixture, a test that builds nodes by hand.\n//\n// Structure in, same structure out, with prose swapped. A phrase with no entry\n// passes through unchanged — the only sane failure, since a missing\n// translation should show the source language, never an empty box and never a\n// key. `onMiss` is how a check turns those into a list.\n//\n// One deliberate difference from the renderer: an EMPTY book short-circuits\n// here and returns the very same tree, patterns included. The renderer fills\n// patterns even with no book, because a source-language session has nobody\n// else to do it; a tree-holder with no book has nothing to say about a tree it\n// did not make.\n// ═══════════════════════════════════════════════════════════\n\nexport type TranslateOptions = {\n phrases: Phrasebook;\n keys?: PhraseKeys;\n // Called once per untranslated phrase, with where it was found. For a dev\n // check that has to answer \"what did we forget\" without a human reading every\n // screen. Never call it from a hot path — it is a reporting seam.\n onMiss?: (phrase: string, where: string) => void;\n};\n\nconst walkNode = (node: RenderNode, where: string, pass: Pass): RenderNode => {\n if (node.type === 'text') {\n if (!pass.text) return node;\n const value = swap(node.value, where, pass);\n return value === node.value ? node : { ...node, value };\n }\n\n if (node.type === 'fragment') {\n const children = walkNodes(node.children, where, pass);\n return children === node.children ? node : { ...node, children };\n }\n\n // An error node's message is a diagnostic for whoever is on call, not product\n // copy — left in the language the stack throws in, deliberately.\n if (node.type === 'error') return node;\n\n const at = node.ref === undefined ? `${where}/${node.name}` : `${where}/${node.name}#${node.ref}`;\n let props = node.props;\n let propsChanged = false;\n const nextProps: Record<string, unknown> = {};\n for (const [key, value] of Object.entries(node.props)) {\n const next = walkValue(value, pass.isProse(key), `${at}.${key}`, pass);\n if (next !== value) propsChanged = true;\n nextProps[key] = next;\n }\n if (propsChanged) props = nextProps;\n\n const children = walkNodes(node.children, at, pass);\n if (!propsChanged && children === node.children) return node;\n return { ...node, props, children };\n};\n\n// Identity is returned when nothing under a node changed. Not an optimisation\n// for its own sake: an untranslated locale (the source language) must produce\n// the byte-identical frame it produced before this pass existed, or every\n// English session pays a delta rebuild for a walk that did nothing.\nconst walkNodes = (nodes: RenderNode[], where: string, pass: Pass): RenderNode[] => {\n let changed = false;\n const out = nodes.map((node) => {\n const next = walkNode(node, where, pass);\n if (next !== node) changed = true;\n return next;\n });\n return changed ? out : nodes;\n};\n\nexport const translateRenderTree = (tree: RenderNode[], options: TranslateOptions): RenderNode[] => {\n // An empty phrasebook is the source language. Skip the walk entirely rather\n // than doing it and finding nothing.\n if (Object.keys(options.phrases).length === 0) return tree;\n const pass = passFor({\n phrases: options.phrases,\n ...(options.keys === undefined ? {} : { keys: options.keys }),\n ...(options.onMiss === undefined ? {} : { onMiss: options.onMiss }),\n });\n if (pass === undefined) return tree;\n return walkNodes(tree, '', pass);\n};\n","import { isArray, isObject } from '../shared/common';\nimport type { ActionDefinition } from '../action';\nimport type { LayoutNode } from '../layout';\nimport { isPhrase, matcherFor } from './phrases';\nimport type { PhraseKeys } from './phrases';\n\n// ═══════════════════════════════════════════════════════════\n// harvest — read every phrase an action could put on a screen, without\n// running it.\n//\n// The other half of the late pass. Keying a dictionary on source strings only\n// works if there is a mechanical way to enumerate them; otherwise \"translate\n// the app\" means a human reading every layout, and the second language is\n// permanently 90% done.\n//\n// This walks the AUTHORED artifacts — definitions and layouts — not a rendered\n// tree, and that is the point: what comes back is exactly the set of strings a\n// person wrote, never a value that arrived from the database. A member called\n// \"Pass\" can therefore never enter the dictionary by being on screen the day\n// somebody ran the harvest.\n// ═══════════════════════════════════════════════════════════\n\nexport type HarvestedPhrase = {\n phrase: string;\n /** Every author site it came from — sorted, deduped. */\n where: readonly string[];\n};\n\ntype Sink = {\n add: (phrase: string, where: string) => void;\n isProse: (key: string) => boolean;\n text: boolean;\n};\n\nconst sinkInto = (found: Map<string, Set<string>>, keys: PhraseKeys | undefined): Sink => {\n const matcher = matcherFor(keys);\n return {\n add: (phrase, where) => {\n const trimmed = phrase.trim();\n if (!isPhrase(trimmed)) return;\n const sites = found.get(trimmed);\n if (sites === undefined) found.set(trimmed, new Set([where]));\n else sites.add(where);\n },\n isProse: matcher.isProse,\n text: matcher.text,\n };\n};\n\n// Inside an allowlisted prop, EVERY reachable literal is a phrase. A `label`\n// holding `{ $if: …, $then: 'Save', $else: 'Create' }` has two of them, and a\n// harvester that only accepted a direct string would silently drop the branch\n// nobody was looking at.\nconst harvestWithin = (value: unknown, where: string, sink: Sink): void => {\n if (typeof value === 'string') {\n sink.add(value, where);\n return;\n }\n if (isArray(value)) {\n value.forEach((entry, index) => harvestWithin(entry, `${where}[${String(index)}]`, sink));\n return;\n }\n if (isObject(value)) {\n for (const [key, entry] of Object.entries(value)) harvestWithin(entry, `${where}.${key}`, sink);\n }\n};\n\nconst harvestProps = (props: Record<string, unknown>, where: string, sink: Sink): void => {\n for (const [key, value] of Object.entries(props)) {\n if (sink.isProse(key)) {\n harvestWithin(value, `${where}.${key}`, sink);\n continue;\n }\n // Not a prose key itself — but a nested object under it may hold one\n // (`cell: { label }` inside a column spec). Keep descending; only the KEY\n // decides, never the depth.\n if (isObject(value) || isArray(value)) harvestNested(value, `${where}.${key}`, sink);\n }\n};\n\nconst harvestNested = (value: unknown, where: string, sink: Sink): void => {\n if (isArray(value)) {\n value.forEach((entry, index) => harvestNested(entry, `${where}[${String(index)}]`, sink));\n return;\n }\n if (!isObject(value)) return;\n for (const [key, entry] of Object.entries(value)) {\n if (sink.isProse(key)) harvestWithin(entry, `${where}.${key}`, sink);\n else harvestNested(entry, `${where}.${key}`, sink);\n }\n};\n\n// Takes `unknown` rather than `LayoutNode`: the walk discriminates the node\n// kinds structurally, and narrowing a union by `in` checks fights the compiler\n// for no benefit here — every branch reads what it needs and guards it.\nconst harvestNode = (node: unknown, where: string, sink: Sink): void => {\n if (node === null || node === undefined) return;\n if (typeof node === 'string') {\n // A text position: the layout's literal children.\n if (sink.text) sink.add(node, where);\n return;\n }\n if (typeof node === 'number' || typeof node === 'boolean') return;\n if (isArray(node)) {\n node.forEach((child, index) => harvestNode(child, `${where}[${String(index)}]`, sink));\n return;\n }\n if (!isObject(node)) return;\n\n const component = node['component'];\n if (component === undefined) {\n // A stored-layout reference and a fragment slot are ids, never words.\n if ('ref' in node || 'slot' in node) return;\n if ('if' in node) {\n harvestNode(node['then'], `${where}.then`, sink);\n harvestNode(node['else'], `${where}.else`, sink);\n return;\n }\n if ('for' in node && 'do' in node) {\n harvestNode(node['do'], `${where}.do`, sink);\n return;\n }\n return;\n }\n\n const at = `${where}/${String(component)}`;\n const props = node['props'];\n if (isObject(props)) harvestProps(props, at, sink);\n harvestNode(node['children'], `${at}.children`, sink);\n};\n\nconst toList = (found: Map<string, Set<string>>): HarvestedPhrase[] =>\n [...found.entries()]\n .map(([phrase, sites]) => ({ phrase, where: [...sites].sort() }))\n .sort((a, b) => a.phrase.localeCompare(b.phrase));\n\nexport const harvestLayout = (layout: LayoutNode, keys?: PhraseKeys): HarvestedPhrase[] => {\n const found = new Map<string, Set<string>>();\n harvestNode(layout, '', sinkInto(found, keys));\n return toList(found);\n};\n\n// A `{ set: '<key>', value: '<literal>' }` step writes words into data, and\n// data lands in props. An error message a trigger sets is as much product copy\n// as a heading, and is otherwise invisible to a harvester that only reads\n// layouts.\nconst harvestSteps = (value: unknown, where: string, sink: Sink): void => {\n if (isArray(value)) {\n value.forEach((entry, index) => harvestSteps(entry, `${where}[${String(index)}]`, sink));\n return;\n }\n if (!isObject(value)) return;\n const target = value['set'];\n const written = value['value'];\n if (typeof target === 'string' && typeof written === 'string') sink.add(written, `${where}.set:${target}`);\n for (const [key, entry] of Object.entries(value)) {\n if (key === 'set' || key === 'value') continue;\n harvestSteps(entry, `${where}.${key}`, sink);\n }\n};\n\nexport const harvestDefinition = (definition: ActionDefinition, keys?: PhraseKeys): HarvestedPhrase[] => {\n const found = new Map<string, Set<string>>();\n const sink = sinkInto(found, keys);\n const id = definition.id;\n\n // The title is chrome's words — a Sheet header, a catalog entry — and reaches\n // the tree as a prop rather than from the layout.\n if (typeof definition.title === 'string') sink.add(definition.title, `${id}.title`);\n\n // Defaulted data is a screen's opening text: the 'Stock' in a theme name, the\n // placeholder a list shows before its first read lands.\n //\n // TWO RULES, because `data` is two things at once.\n //\n // A top-level string is taken WHOLE, whatever its key. Where it lands decides\n // whether it is prose, and only the LAYOUT knows that: `runningHint` is not a\n // prose key and reaches the glass as a text child, so a matcher applied here\n // would drop a sentence the pass goes on to translate. The cost of taking\n // them all is enum values and ids in the report, which a host filters by name.\n //\n // Anything NESTED is walked by the matcher instead, and that is the rule that\n // reaches an options array — `views: [{ value: 'running', label: 'Running' }]`\n // yields `Running` and never `running`. Without it a tab strip built in data\n // is not merely untranslatable but UNCOUNTED, which is the worse half: the\n // harvest reports a full book while the words are missing from the screen.\n for (const [key, value] of Object.entries(definition.data ?? {})) {\n if (typeof value === 'string') sink.add(value, `${id}.data.${key}`);\n else if (isObject(value) || isArray(value)) harvestNested(value, `${id}.data.${key}`, sink);\n }\n\n if (definition.layout !== undefined) harvestNode(definition.layout, id, sink);\n if (definition.triggers !== undefined) harvestSteps(definition.triggers, `${id}.triggers`, sink);\n if (definition.lifecycle !== undefined) harvestSteps(definition.lifecycle, `${id}.lifecycle`, sink);\n\n return toList(found);\n};\n\nexport const harvestDefinitions = (\n definitions: Record<string, ActionDefinition>,\n keys?: PhraseKeys,\n): HarvestedPhrase[] => {\n const found = new Map<string, Set<string>>();\n for (const definition of Object.values(definitions)) {\n for (const entry of harvestDefinition(definition, keys)) {\n const sites = found.get(entry.phrase);\n if (sites === undefined) found.set(entry.phrase, new Set(entry.where));\n else for (const site of entry.where) sites.add(site);\n }\n }\n return toList(found);\n};\n\n/** Phrases with no entry in the book — what a language is still missing. */\nexport const missingFrom = (\n harvested: readonly HarvestedPhrase[],\n phrases: Readonly<Record<string, string>>,\n): HarvestedPhrase[] => harvested.filter((entry) => phrases[entry.phrase] === undefined);\n"]}
|
|
1
|
+
{"version":3,"sources":[],"names":[],"mappings":"","file":"index.js"}
|