@babylonjs/loaders 9.12.0 → 9.13.0

package/FBX/parsers/zlibInflate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"zlibInflate.js","sourceRoot":"","sources":["../../../../../dev/loaders/src/FBX/parsers/zlibInflate.ts"],"names":[],"mappings":"AAAA,qGAAqG;AACrG,MAAM,SAAS,GAAG,KAAK,CAAC;AACxB,MAAM,QAAQ,GAAG,EAAE,CAAC;AAEpB,MAAM,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACxI,MAAM,iBAAiB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAClH,MAAM,aAAa,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AACrK,MAAM,mBAAmB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;AAC/H,MAAM,iBAAiB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AAE7F;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,KAAiB,EAAE,cAAsB;IACjE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;QAC1D,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACrD,CAAC;IACD,IAAI,KAAK,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACrD,CAAC;IAED,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACrB,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC;QACtE,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;IAC5C,CAAC;IACD,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACrB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IAC7D,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,cAAc,CAAC,CAAC;IAEhD,IAAI,YAAY,GAAG,KAAK,CAAC;IACzB,OAAO,CAAC,YAAY,EAAE,CAAC;QACnB,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrC,QAAQ,SAAS,EAAE,CAAC;YAChB,KAAK,CAAC;gBACF,kBAAkB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACnC,MAAM;YACV,KAAK,CAAC;gBACF,sBAAsB,CAAC,MAAM,EAAE,MAAM,EAAE,yBAAyB,EAAE,EAAE,oBAAoB,EAAE,CAAC,CAAC;gBAC5F,MAAM;YACV,KAAK,CAAC,CAAC,CAAC,CAAC;gBACL,MAAM,EAAE,iBAAiB,EAAE,YAAY,EAAE,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;gBACrE,sBAAsB,CAAC,MAAM,EAAE,MAAM,EAAE,iBAAiB,EAAE,YAAY,CAAC,CAAC;gBACxE,MAAM;YACV,CAAC;YACD;gBACI,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;QACvD,CAAC;IACL,CAAC;IAED,IAAI,MAAM,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,CAAC,MAAM,EAAE,CAAC;IAChB,MAAM,aAAa,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC3K,IAAI,MAAM,CAAC,OAAO,EAAE,KAAK,aAAa,EAAE,CAAC;QACrC,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,MAAM,CAAC,KAAK,CAAC;AACxB,CAAC;AAED,MAAM,SAAS;IAIX,YACqB,KAAiB,EAC3B,UAAkB,EACR,SAAiB;QAFjB,UAAK,GAAL,KAAK,CAAY;QAC3B,eAAU,GAAV,UAAU,CAAQ;QACR,cAAS,GAAT,SAAS,CAAQ;QAN9B,cAAS,GAAG,CAAC,CAAC;QACd,aAAQ,GAAG,CAAC,CAAC;IAMlB,CAAC;IAEG,QAAQ,CAAC,KAAa;QACzB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,IAAI,CAAC,SAAS,MAAM,KAAK,CAAC;QAC1B,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC;QACvB,OAAO,KAAK,CAAC;IACjB,CAAC;IAEM,OAAO;QACV,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;YACtB,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACpC,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;YACrD,CAAC;YACD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QACtB,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,SAAS,MAAM,CAAC,CAAC;QACtB,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,OAAO,GAAG,CAAC;IACf,CAAC;IAEM,WAAW;QACd,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACtB,CAAC;IAEM,YAAY;QACf,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACvC,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACrD,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACnF,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC;QACrB,OAAO,KAAK,CAAC;IACjB,CAAC;IAEM,QAAQ;QACX,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;IACzC,CAAC;IAEO,iBAAiB;QACrB,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACxD,CAAC;IACL,CAAC;IAEO,UAAU,CAAC,KAAa;QAC5B,OAAO,IAAI,CAAC,QAAQ,GAAG,KAAK,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACpC,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;YACrD,CAAC;YACD,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC;YACjE,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;CACJ;AAED,MAAM,YAAY;IAOd,YAAmB,cAAsB;QANjC,WAAM,GAAG,CAAC,CAAC;QACX,WAAM,GAAG,CAAC,CAAC;QACX,WAAM,GAAG,CAAC,CAAC;QAKf,IAAI,CAAC,KAAK,GAAG,IAAI,UAAU,CAAC,cAAc,CAAC,CAAC;IAChD,CAAC;IAEM,SAAS,CAAC,KAAa;QAC1B,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACvC,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACpD,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,GAAG,IAAI,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC;QACjC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC;QACpB,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC;QACzB,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC;IAC7B,CAAC;IAEM,IAAI,CAAC,QAAgB,EAAE,MAAc;QACxC,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACtD,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC;QACvD,CAAC;IACL,CAAC;IAEM,MAAM;QACT,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACpD,CAAC;IACL,CAAC;IAEM,OAAO;QACV,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACrD,CAAC;CACJ;AAED,MAAM,WAAW;IAIb,YAAmB,WAA8B,EAAE,UAAoC,EAAE;QACrF,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,QAAQ,EAAE,CAAC;gBAC/D,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;YAC7D,CAAC;YACD,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACb,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjB,YAAY,EAAE,CAAC;gBACf,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;YACpD,CAAC;QACL,CAAC;QAED,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;YACrB,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACrB,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC;gBAC1B,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;gBACvB,OAAO;YACX,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC7D,CAAC;QAED,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;YAC1C,SAAS,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5C,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBAChB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;YAC7D,CAAC;QACL,CAAC;QACD,IAAI,SAAS,KAAK,CAAC,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC7D,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAS,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;YAC1C,IAAI,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACtC,QAAQ,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QAC1B,CAAC;QAED,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;YACtE,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC;YAC5C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACjB,OAAO,OAAO,CAAC;QACnB,CAAC,CAAC,CAAC;QACH,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACf,SAAS;YACb,CAAC;YACD,IAAI,CAAC,eAAe,CAAC,MAAM,CAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC;QAC/D,CAAC;QACD,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACvC,CAAC;IAEM,MAAM,CAAC,MAAiB;QAC3B,IAAI,IAAI,CAAC,aAAa,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,IAAI,IAAI,CAAC,aAAa,EAAE,MAAM,EAAE,EAAE,CAAC;YAC1D,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1D,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;gBACd,OAAO,MAAM,CAAC;YAClB,CAAC;QACL,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACrD,CAAC;CACJ;AAED,IAAI,sBAA+C,CAAC;AACpD,IAAI,iBAA0C,CAAC;AAE/C,SAAS,yBAAyB;IAC9B,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC;QACvC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,IAAI,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC;YAC3C,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;QACD,KAAK,IAAI,MAAM,GAAG,GAAG,EAAE,MAAM,IAAI,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC;YAC7C,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;QACD,KAAK,IAAI,MAAM,GAAG,GAAG,EAAE,MAAM,IAAI,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC;YAC7C,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;QACD,KAAK,IAAI,MAAM,GAAG,GAAG,EAAE,MAAM,IAAI,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC;YAC7C,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;QACD,sBAAsB,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,sBAAsB,CAAC;AAClC,CAAC;AAED,SAAS,oBAAoB;IACzB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACrB,iBAAiB,GAAG,IAAI,WAAW,CAAC,IAAI,KAAK,CAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,iBAAiB,CAAC;AAC7B,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAiB,EAAE,MAAoB;IAC/D,MAAM,CAAC,WAAW,EAAE,CAAC;IACrB,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;IACrC,MAAM,aAAa,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;IAC5C,IAAI,CAAC,CAAC,MAAM,GAAG,aAAa,CAAC,GAAG,MAAM,CAAC,KAAK,MAAM,EAAE,CAAC;QACjD,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC5D,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;IACxC,CAAC;AACL,CAAC;AAED,SAAS,sBAAsB,CAAC,MAAiB,EAAE,MAAoB,EAAE,iBAA8B,EAAE,YAAyB;IAC9H,OAAO,IAAI,EAAE,CAAC;QACV,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,MAAM,GAAG,GAAG,EAAE,CAAC;YACf,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YACzB,SAAS;QACb,CAAC;QACD,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;YACjB,OAAO;QACX,CAAC;QACD,IAAI,MAAM,GAAG,GAAG,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC9D,CAAC;QAED,MAAM,WAAW,GAAG,MAAM,GAAG,GAAG,CAAC;QACjC,MAAM,MAAM,GAAG,WAAW,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC,CAAC;QAC1F,MAAM,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,cAAc,GAAG,EAAE,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACxD,CAAC;QACD,MAAM,QAAQ,GAAG,aAAa,CAAC,cAAc,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,mBAAmB,CAAC,cAAc,CAAC,CAAC,CAAC;QACtG,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAClC,CAAC;AACL,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAiB;IAIvC,MAAM,kBAAkB,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACpD,MAAM,aAAa,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7C,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE/C,MAAM,iBAAiB,GAAG,IAAI,KAAK,CAAS,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,iBAAiB,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IAED,MAAM,cAAc,GAAG,IAAI,WAAW,CAAC,iBAAiB,CAAC,CAAC;IAC1D,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,EAAE,cAAc,EAAE,kBAAkB,GAAG,aAAa,CAAC,CAAC;IAC5F,MAAM,oBAAoB,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAClE,MAAM,eAAe,GAAG,OAAO,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;IAE1D,IAAI,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO;QACH,iBAAiB,EAAE,IAAI,WAAW,CAAC,oBAAoB,CAAC;QACxD,YAAY,EAAE,IAAI,WAAW,CAAC,eAAe,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;KACvE,CAAC;AACN,CAAC;AAED,SAAS,eAAe,CAAC,MAAiB,EAAE,cAA2B,EAAE,KAAa;IAClF,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,OAAO,OAAO,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,MAAM,IAAI,EAAE,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,SAAS;QACb,CAAC;QAED,IAAI,YAAoB,CAAC;QACzB,IAAI,aAAqB,CAAC;QAC1B,QAAQ,MAAM,EAAE,CAAC;YACb,KAAK,EAAE;gBACH,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACvB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;gBAC3D,CAAC;gBACD,aAAa,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC5C,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACtC,MAAM;YACV,KAAK,EAAE;gBACH,aAAa,GAAG,CAAC,CAAC;gBAClB,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACtC,MAAM;YACV,KAAK,EAAE;gBACH,aAAa,GAAG,CAAC,CAAC;gBAClB,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACvC,MAAM;YACV;gBACI,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAC/D,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,GAAG,YAAY,GAAG,KAAK,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QAC3D,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAChC,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAC;AACnB,CAAC","sourcesContent":["/* eslint-disable @typescript-eslint/naming-convention, jsdoc/require-param, jsdoc/require-returns */\r\nconst ADLER_MOD = 65521;\r\nconst MAX_BITS = 15;\r\n\r\nconst LENGTH_BASE = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258];\r\nconst LENGTH_EXTRA_BITS = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0];\r\nconst DISTANCE_BASE = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577];\r\nconst DISTANCE_EXTRA_BITS = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13];\r\nconst CODE_LENGTH_ORDER = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];\r\n\r\n/**\r\n * Inflate a zlib-wrapped deflate stream.\r\n *\r\n * This implementation is intentionally scoped to FBX binary array payloads: one-shot,\r\n * synchronous zlib streams with the exact uncompressed length known up front.\r\n */\r\nexport function inflateZlib(input: Uint8Array, expectedLength: number): Uint8Array {\r\n    if (!Number.isInteger(expectedLength) || expectedLength < 0) {\r\n        throw new Error(\"zlib: invalid expected length\");\r\n    }\r\n    if (input.byteLength < 6) {\r\n        throw new Error(\"zlib: unexpected end of input\");\r\n    }\r\n\r\n    const cmf = input[0];\r\n    const flg = input[1];\r\n    if ((cmf & 0x0f) !== 8 || cmf >> 4 > 7 || ((cmf << 8) + flg) % 31 !== 0) {\r\n        throw new Error(\"zlib: invalid header\");\r\n    }\r\n    if ((flg & 0x20) !== 0) {\r\n        throw new Error(\"zlib: preset dictionary not supported\");\r\n    }\r\n\r\n    const reader = new BitReader(input, 2, input.byteLength - 4);\r\n    const output = new OutputWriter(expectedLength);\r\n\r\n    let isFinalBlock = false;\r\n    while (!isFinalBlock) {\r\n        isFinalBlock = reader.readBits(1) === 1;\r\n        const blockType = reader.readBits(2);\r\n        switch (blockType) {\r\n            case 0:\r\n                inflateStoredBlock(reader, output);\r\n                break;\r\n            case 1:\r\n                inflateCompressedBlock(reader, output, getFixedLiteralLengthTree(), getFixedDistanceTree());\r\n                break;\r\n            case 2: {\r\n                const { literalLengthTree, distanceTree } = readDynamicTrees(reader);\r\n                inflateCompressedBlock(reader, output, literalLengthTree, distanceTree);\r\n                break;\r\n            }\r\n            default:\r\n                throw new Error(\"deflate: invalid block type\");\r\n        }\r\n    }\r\n\r\n    if (reader.byteOffset < input.byteLength - 4) {\r\n        throw new Error(\"zlib: trailing deflate data\");\r\n    }\r\n\r\n    output.finish();\r\n    const expectedAdler = ((input[input.byteLength - 4] << 24) | (input[input.byteLength - 3] << 16) | (input[input.byteLength - 2] << 8) | input[input.byteLength - 1]) >>> 0;\r\n    if (output.adler32() !== expectedAdler) {\r\n        throw new Error(\"zlib: adler32 mismatch\");\r\n    }\r\n\r\n    return output.bytes;\r\n}\r\n\r\nclass BitReader {\r\n    private bitBuffer = 0;\r\n    private bitCount = 0;\r\n\r\n    public constructor(\r\n        private readonly input: Uint8Array,\r\n        public byteOffset: number,\r\n        private readonly endOffset: number\r\n    ) {}\r\n\r\n    public readBits(count: number): number {\r\n        this.ensureBits(count);\r\n        const value = this.bitBuffer & ((1 << count) - 1);\r\n        this.bitBuffer >>>= count;\r\n        this.bitCount -= count;\r\n        return value;\r\n    }\r\n\r\n    public readBit(): number {\r\n        if (this.bitCount === 0) {\r\n            if (this.byteOffset >= this.endOffset) {\r\n                throw new Error(\"zlib: unexpected end of input\");\r\n            }\r\n            this.bitBuffer = this.input[this.byteOffset++];\r\n            this.bitCount = 8;\r\n        }\r\n        const bit = this.bitBuffer & 1;\r\n        this.bitBuffer >>>= 1;\r\n        this.bitCount--;\r\n        return bit;\r\n    }\r\n\r\n    public alignToByte(): void {\r\n        this.bitBuffer = 0;\r\n        this.bitCount = 0;\r\n    }\r\n\r\n    public readUint16LE(): number {\r\n        this.ensureByteAligned();\r\n        if (this.byteOffset + 2 > this.endOffset) {\r\n            throw new Error(\"zlib: unexpected end of input\");\r\n        }\r\n        const value = this.input[this.byteOffset] | (this.input[this.byteOffset + 1] << 8);\r\n        this.byteOffset += 2;\r\n        return value;\r\n    }\r\n\r\n    public readByte(): number {\r\n        this.ensureByteAligned();\r\n        if (this.byteOffset >= this.endOffset) {\r\n            throw new Error(\"zlib: unexpected end of input\");\r\n        }\r\n        return this.input[this.byteOffset++];\r\n    }\r\n\r\n    private ensureByteAligned(): void {\r\n        if (this.bitCount !== 0) {\r\n            throw new Error(\"deflate: expected byte alignment\");\r\n        }\r\n    }\r\n\r\n    private ensureBits(count: number): void {\r\n        while (this.bitCount < count) {\r\n            if (this.byteOffset >= this.endOffset) {\r\n                throw new Error(\"zlib: unexpected end of input\");\r\n            }\r\n            this.bitBuffer |= this.input[this.byteOffset++] << this.bitCount;\r\n            this.bitCount += 8;\r\n        }\r\n    }\r\n}\r\n\r\nclass OutputWriter {\r\n    private offset = 0;\r\n    private adlerA = 1;\r\n    private adlerB = 0;\r\n\r\n    public readonly bytes: Uint8Array;\r\n\r\n    public constructor(expectedLength: number) {\r\n        this.bytes = new Uint8Array(expectedLength);\r\n    }\r\n\r\n    public writeByte(value: number): void {\r\n        if (this.offset >= this.bytes.byteLength) {\r\n            throw new Error(\"zlib: output length mismatch\");\r\n        }\r\n        const byte = value & 0xff;\r\n        this.bytes[this.offset++] = byte;\r\n        this.adlerA += byte;\r\n        this.adlerB += this.adlerA;\r\n        this.adlerA %= ADLER_MOD;\r\n        this.adlerB %= ADLER_MOD;\r\n    }\r\n\r\n    public copy(distance: number, length: number): void {\r\n        if (distance <= 0 || distance > this.offset) {\r\n            throw new Error(\"deflate: distance out of range\");\r\n        }\r\n        for (let i = 0; i < length; i++) {\r\n            this.writeByte(this.bytes[this.offset - distance]);\r\n        }\r\n    }\r\n\r\n    public finish(): void {\r\n        if (this.offset !== this.bytes.byteLength) {\r\n            throw new Error(\"zlib: output length mismatch\");\r\n        }\r\n    }\r\n\r\n    public adler32(): number {\r\n        return ((this.adlerB << 16) | this.adlerA) >>> 0;\r\n    }\r\n}\r\n\r\nclass HuffmanTree {\r\n    private readonly symbolsByLength: Array<Int16Array | undefined>;\r\n    private readonly maxCodeLength: number;\r\n\r\n    public constructor(codeLengths: readonly number[], options: { allowEmpty?: boolean } = {}) {\r\n        const counts = new Array<number>(MAX_BITS + 1).fill(0);\r\n        let nonZeroCount = 0;\r\n        let maxCodeLength = 0;\r\n\r\n        for (const length of codeLengths) {\r\n            if (!Number.isInteger(length) || length < 0 || length > MAX_BITS) {\r\n                throw new Error(\"deflate: invalid huffman code lengths\");\r\n            }\r\n            if (length > 0) {\r\n                counts[length]++;\r\n                nonZeroCount++;\r\n                maxCodeLength = Math.max(maxCodeLength, length);\r\n            }\r\n        }\r\n\r\n        if (nonZeroCount === 0) {\r\n            if (options.allowEmpty) {\r\n                this.symbolsByLength = [];\r\n                this.maxCodeLength = 0;\r\n                return;\r\n            }\r\n            throw new Error(\"deflate: invalid huffman code lengths\");\r\n        }\r\n\r\n        let remaining = 1;\r\n        for (let bits = 1; bits <= MAX_BITS; bits++) {\r\n            remaining = (remaining << 1) - counts[bits];\r\n            if (remaining < 0) {\r\n                throw new Error(\"deflate: invalid huffman code lengths\");\r\n            }\r\n        }\r\n        if (remaining !== 0 && nonZeroCount !== 1) {\r\n            throw new Error(\"deflate: invalid huffman code lengths\");\r\n        }\r\n\r\n        const nextCode = new Array<number>(MAX_BITS + 1).fill(0);\r\n        let code = 0;\r\n        for (let bits = 1; bits <= MAX_BITS; bits++) {\r\n            code = (code + counts[bits - 1]) << 1;\r\n            nextCode[bits] = code;\r\n        }\r\n\r\n        this.symbolsByLength = Array.from({ length: MAX_BITS + 1 }, (_, length) => {\r\n            if (counts[length] === 0) {\r\n                return undefined;\r\n            }\r\n            const symbols = new Int16Array(1 << length);\r\n            symbols.fill(-1);\r\n            return symbols;\r\n        });\r\n        for (let symbol = 0; symbol < codeLengths.length; symbol++) {\r\n            const length = codeLengths[symbol];\r\n            if (length === 0) {\r\n                continue;\r\n            }\r\n            this.symbolsByLength[length]![nextCode[length]++] = symbol;\r\n        }\r\n        this.maxCodeLength = maxCodeLength;\r\n    }\r\n\r\n    public decode(reader: BitReader): number {\r\n        if (this.maxCodeLength === 0) {\r\n            throw new Error(\"deflate: invalid huffman code\");\r\n        }\r\n\r\n        let code = 0;\r\n        for (let length = 1; length <= this.maxCodeLength; length++) {\r\n            code = (code << 1) | reader.readBit();\r\n            const symbol = this.symbolsByLength[length]?.[code] ?? -1;\r\n            if (symbol >= 0) {\r\n                return symbol;\r\n            }\r\n        }\r\n        throw new Error(\"deflate: invalid huffman code\");\r\n    }\r\n}\r\n\r\nlet fixedLiteralLengthTree: HuffmanTree | undefined;\r\nlet fixedDistanceTree: HuffmanTree | undefined;\r\n\r\nfunction getFixedLiteralLengthTree(): HuffmanTree {\r\n    if (!fixedLiteralLengthTree) {\r\n        const lengths = new Array<number>(288);\r\n        for (let symbol = 0; symbol <= 143; symbol++) {\r\n            lengths[symbol] = 8;\r\n        }\r\n        for (let symbol = 144; symbol <= 255; symbol++) {\r\n            lengths[symbol] = 9;\r\n        }\r\n        for (let symbol = 256; symbol <= 279; symbol++) {\r\n            lengths[symbol] = 7;\r\n        }\r\n        for (let symbol = 280; symbol <= 287; symbol++) {\r\n            lengths[symbol] = 8;\r\n        }\r\n        fixedLiteralLengthTree = new HuffmanTree(lengths);\r\n    }\r\n    return fixedLiteralLengthTree;\r\n}\r\n\r\nfunction getFixedDistanceTree(): HuffmanTree {\r\n    if (!fixedDistanceTree) {\r\n        fixedDistanceTree = new HuffmanTree(new Array<number>(32).fill(5));\r\n    }\r\n    return fixedDistanceTree;\r\n}\r\n\r\nfunction inflateStoredBlock(reader: BitReader, output: OutputWriter): void {\r\n    reader.alignToByte();\r\n    const length = reader.readUint16LE();\r\n    const inverseLength = reader.readUint16LE();\r\n    if (((length ^ inverseLength) & 0xffff) !== 0xffff) {\r\n        throw new Error(\"deflate: invalid stored block length\");\r\n    }\r\n\r\n    for (let i = 0; i < length; i++) {\r\n        output.writeByte(reader.readByte());\r\n    }\r\n}\r\n\r\nfunction inflateCompressedBlock(reader: BitReader, output: OutputWriter, literalLengthTree: HuffmanTree, distanceTree: HuffmanTree): void {\r\n    while (true) {\r\n        const symbol = literalLengthTree.decode(reader);\r\n        if (symbol < 256) {\r\n            output.writeByte(symbol);\r\n            continue;\r\n        }\r\n        if (symbol === 256) {\r\n            return;\r\n        }\r\n        if (symbol > 285) {\r\n            throw new Error(\"deflate: invalid literal/length symbol\");\r\n        }\r\n\r\n        const lengthIndex = symbol - 257;\r\n        const length = LENGTH_BASE[lengthIndex] + reader.readBits(LENGTH_EXTRA_BITS[lengthIndex]);\r\n        const distanceSymbol = distanceTree.decode(reader);\r\n        if (distanceSymbol > 29) {\r\n            throw new Error(\"deflate: invalid distance symbol\");\r\n        }\r\n        const distance = DISTANCE_BASE[distanceSymbol] + reader.readBits(DISTANCE_EXTRA_BITS[distanceSymbol]);\r\n        output.copy(distance, length);\r\n    }\r\n}\r\n\r\nfunction readDynamicTrees(reader: BitReader): {\r\n    literalLengthTree: HuffmanTree;\r\n    distanceTree: HuffmanTree;\r\n} {\r\n    const literalLengthCount = reader.readBits(5) + 257;\r\n    const distanceCount = reader.readBits(5) + 1;\r\n    const codeLengthCount = reader.readBits(4) + 4;\r\n\r\n    const codeLengthLengths = new Array<number>(19).fill(0);\r\n    for (let i = 0; i < codeLengthCount; i++) {\r\n        codeLengthLengths[CODE_LENGTH_ORDER[i]] = reader.readBits(3);\r\n    }\r\n\r\n    const codeLengthTree = new HuffmanTree(codeLengthLengths);\r\n    const lengths = readCodeLengths(reader, codeLengthTree, literalLengthCount + distanceCount);\r\n    const literalLengthLengths = lengths.slice(0, literalLengthCount);\r\n    const distanceLengths = lengths.slice(literalLengthCount);\r\n\r\n    if (literalLengthLengths[256] === 0) {\r\n        throw new Error(\"deflate: missing end-of-block code\");\r\n    }\r\n\r\n    return {\r\n        literalLengthTree: new HuffmanTree(literalLengthLengths),\r\n        distanceTree: new HuffmanTree(distanceLengths, { allowEmpty: true }),\r\n    };\r\n}\r\n\r\nfunction readCodeLengths(reader: BitReader, codeLengthTree: HuffmanTree, count: number): number[] {\r\n    const lengths: number[] = [];\r\n    while (lengths.length < count) {\r\n        const symbol = codeLengthTree.decode(reader);\r\n        if (symbol <= 15) {\r\n            lengths.push(symbol);\r\n            continue;\r\n        }\r\n\r\n        let repeatLength: number;\r\n        let repeatedValue: number;\r\n        switch (symbol) {\r\n            case 16:\r\n                if (lengths.length === 0) {\r\n                    throw new Error(\"deflate: invalid code length repeat\");\r\n                }\r\n                repeatedValue = lengths[lengths.length - 1];\r\n                repeatLength = reader.readBits(2) + 3;\r\n                break;\r\n            case 17:\r\n                repeatedValue = 0;\r\n                repeatLength = reader.readBits(3) + 3;\r\n                break;\r\n            case 18:\r\n                repeatedValue = 0;\r\n                repeatLength = reader.readBits(7) + 11;\r\n                break;\r\n            default:\r\n                throw new Error(\"deflate: invalid code length symbol\");\r\n        }\r\n\r\n        if (lengths.length + repeatLength > count) {\r\n            throw new Error(\"deflate: invalid code length repeat\");\r\n        }\r\n        for (let i = 0; i < repeatLength; i++) {\r\n            lengths.push(repeatedValue);\r\n        }\r\n    }\r\n    return lengths;\r\n}\r\n"]}

package/FBX/types/fbxTypes.d.ts

@@ -0,0 +1,54 @@
+/**
+ * Intermediate representation for parsed FBX data.
+ * Both binary and ASCII parsers produce this same structure.
+ */
+/** Individual property value within an FBX node */
+export type FBXPropertyValue = boolean | number | string | Float32Array | Float64Array | Int32Array | Uint8Array;
+/** Parsed FBX property type identifier. */
+export type FBXPropertyType = "boolean" | "int16" | "int32" | "int64" | "float32" | "float64" | "string" | "raw" | "float32[]" | "float64[]" | "int32[]" | "int64[]" | "boolean[]";
+/** Individual property within an FBX node. */
+export interface FBXProperty {
+    /** Parsed property type. */
+    type: FBXPropertyType;
+    /** Parsed property value. */
+    value: FBXPropertyValue;
+}
+/** A node in the FBX document tree */
+export interface FBXNode {
+    /** Node name. */
+    name: string;
+    /** Node properties. */
+    properties: FBXProperty[];
+    /** Child nodes. */
+    children: FBXNode[];
+}
+/** Top-level parsed FBX document */
+export interface FBXDocument {
+    /** FBX file version. */
+    version: number;
+    /** Top-level document nodes. */
+    nodes: FBXNode[];
+}
+/** Helper to find a child node by name */
+export declare function findChildByName(node: FBXNode, name: string): FBXNode | undefined;
+/** Helper to find all children with a given name */
+export declare function findChildrenByName(node: FBXNode, name: string): FBXNode[];
+/** Helper to find a top-level node in a document */
+export declare function findDocumentNode(doc: FBXDocument, name: string): FBXNode | undefined;
+/** Extract a property value by index, with type narrowing */
+export declare function getPropertyValue<T extends FBXPropertyValue>(node: FBXNode, index: number): T | undefined;
+/**
+ * Converts an FBX object ID value to a safe JavaScript number.
+ * @param value - Parsed FBX object ID value
+ * @returns The object ID, or undefined when the value is not numeric
+ */
+export declare function getSafeFBXObjectId(value: unknown): number | undefined;
+/** Get the numeric ID from a node (first property is typically the int64 UID) */
+export declare function getNodeId(node: FBXNode): number | undefined;
+/**
+ * Clean FBX object names.
+ * FBX names may contain:
+ *   - A "Class::" prefix (e.g. "Model::valkyrie_mesh") — strip it
+ *   - A binary null/control-character class suffix — strip it
+ */
+export declare function cleanFBXName(fbxName: string): string;

package/FBX/types/fbxTypes.js

@@ -0,0 +1,66 @@
+/* eslint-disable @typescript-eslint/naming-convention, jsdoc/require-param, jsdoc/require-returns */
+/**
+ * Intermediate representation for parsed FBX data.
+ * Both binary and ASCII parsers produce this same structure.
+ */
+/** Helper to find a child node by name */
+export function findChildByName(node, name) {
+    return node.children.find((c) => c.name === name);
+}
+/** Helper to find all children with a given name */
+export function findChildrenByName(node, name) {
+    return node.children.filter((c) => c.name === name);
+}
+/** Helper to find a top-level node in a document */
+export function findDocumentNode(doc, name) {
+    return doc.nodes.find((n) => n.name === name);
+}
+/** Extract a property value by index, with type narrowing */
+export function getPropertyValue(node, index) {
+    if (index < node.properties.length) {
+        return node.properties[index].value;
+    }
+    return undefined;
+}
+/**
+ * Converts an FBX object ID value to a safe JavaScript number.
+ * @param value - Parsed FBX object ID value
+ * @returns The object ID, or undefined when the value is not numeric
+ */
+export function getSafeFBXObjectId(value) {
+    if (typeof value !== "number") {
+        return undefined;
+    }
+    if (!Number.isSafeInteger(value)) {
+        throw new Error(`Unsafe FBX object ID ${value.toString()}: object IDs must be safe integers.`);
+    }
+    return value;
+}
+/** Get the numeric ID from a node (first property is typically the int64 UID) */
+export function getNodeId(node) {
+    const prop = node.properties[0];
+    if (prop && (prop.type === "int64" || prop.type === "int32")) {
+        return getSafeFBXObjectId(prop.value);
+    }
+    return undefined;
+}
+/**
+ * Clean FBX object names.
+ * FBX names may contain:
+ *   - A "Class::" prefix (e.g. "Model::valkyrie_mesh") — strip it
+ *   - A binary null/control-character class suffix — strip it
+ */
+export function cleanFBXName(fbxName) {
+    // Strip \x00\x01 suffix (binary FBX name/class separator)
+    const nullIdx = fbxName.indexOf("\0");
+    if (nullIdx >= 0) {
+        fbxName = fbxName.substring(0, nullIdx);
+    }
+    // Strip "ClassName::" prefix (ASCII FBX)
+    const colonIdx = fbxName.indexOf("::");
+    if (colonIdx >= 0) {
+        fbxName = fbxName.substring(colonIdx + 2);
+    }
+    return fbxName;
+}
+//# sourceMappingURL=fbxTypes.js.map

package/FBX/types/fbxTypes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fbxTypes.js","sourceRoot":"","sources":["../../../../../dev/loaders/src/FBX/types/fbxTypes.ts"],"names":[],"mappings":"AAAA,qGAAqG;AACrG;;;GAGG;AA+CH,0CAA0C;AAC1C,MAAM,UAAU,eAAe,CAAC,IAAa,EAAE,IAAY;IACvD,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AACtD,CAAC;AAED,oDAAoD;AACpD,MAAM,UAAU,kBAAkB,CAAC,IAAa,EAAE,IAAY;IAC1D,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AACxD,CAAC;AAED,oDAAoD;AACpD,MAAM,UAAU,gBAAgB,CAAC,GAAgB,EAAE,IAAY;IAC3D,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AAClD,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,gBAAgB,CAA6B,IAAa,EAAE,KAAa;IACrF,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,KAAU,CAAC;IAC7C,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAc;IAC7C,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC5B,OAAO,SAAS,CAAC;IACrB,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,KAAK,CAAC,wBAAwB,KAAK,CAAC,QAAQ,EAAE,qCAAqC,CAAC,CAAC;IACnG,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,SAAS,CAAC,IAAa;IACnC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAChC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,EAAE,CAAC;QAC3D,OAAO,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,OAAe;IACxC,0DAA0D;IAC1D,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACf,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC5C,CAAC;IAED,yCAAyC;IACzC,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;QAChB,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,OAAO,CAAC;AACnB,CAAC","sourcesContent":["/* eslint-disable @typescript-eslint/naming-convention, jsdoc/require-param, jsdoc/require-returns */\r\n/**\r\n * Intermediate representation for parsed FBX data.\r\n * Both binary and ASCII parsers produce this same structure.\r\n */\r\n\r\n/** Individual property value within an FBX node */\r\nexport type FBXPropertyValue = boolean | number | string | Float32Array | Float64Array | Int32Array | Uint8Array;\r\n\r\n/** Parsed FBX property type identifier. */\r\nexport type FBXPropertyType =\r\n    | \"boolean\" // 'C'\r\n    | \"int16\" // 'Y'\r\n    | \"int32\" // 'I'\r\n    | \"int64\" // 'L'\r\n    | \"float32\" // 'F'\r\n    | \"float64\" // 'D'\r\n    | \"string\" // 'S'\r\n    | \"raw\" // 'R'\r\n    | \"float32[]\" // 'f'\r\n    | \"float64[]\" // 'd'\r\n    | \"int32[]\" // 'i'\r\n    | \"int64[]\" // 'l'\r\n    | \"boolean[]\"; // 'b' (stored as Uint8Array where 0=false, 1=true)\r\n\r\n/** Individual property within an FBX node. */\r\nexport interface FBXProperty {\r\n    /** Parsed property type. */\r\n    type: FBXPropertyType;\r\n    /** Parsed property value. */\r\n    value: FBXPropertyValue;\r\n}\r\n\r\n/** A node in the FBX document tree */\r\nexport interface FBXNode {\r\n    /** Node name. */\r\n    name: string;\r\n    /** Node properties. */\r\n    properties: FBXProperty[];\r\n    /** Child nodes. */\r\n    children: FBXNode[];\r\n}\r\n\r\n/** Top-level parsed FBX document */\r\nexport interface FBXDocument {\r\n    /** FBX file version. */\r\n    version: number;\r\n    /** Top-level document nodes. */\r\n    nodes: FBXNode[];\r\n}\r\n\r\n/** Helper to find a child node by name */\r\nexport function findChildByName(node: FBXNode, name: string): FBXNode | undefined {\r\n    return node.children.find((c) => c.name === name);\r\n}\r\n\r\n/** Helper to find all children with a given name */\r\nexport function findChildrenByName(node: FBXNode, name: string): FBXNode[] {\r\n    return node.children.filter((c) => c.name === name);\r\n}\r\n\r\n/** Helper to find a top-level node in a document */\r\nexport function findDocumentNode(doc: FBXDocument, name: string): FBXNode | undefined {\r\n    return doc.nodes.find((n) => n.name === name);\r\n}\r\n\r\n/** Extract a property value by index, with type narrowing */\r\nexport function getPropertyValue<T extends FBXPropertyValue>(node: FBXNode, index: number): T | undefined {\r\n    if (index < node.properties.length) {\r\n        return node.properties[index].value as T;\r\n    }\r\n    return undefined;\r\n}\r\n\r\n/**\r\n * Converts an FBX object ID value to a safe JavaScript number.\r\n * @param value - Parsed FBX object ID value\r\n * @returns The object ID, or undefined when the value is not numeric\r\n */\r\nexport function getSafeFBXObjectId(value: unknown): number | undefined {\r\n    if (typeof value !== \"number\") {\r\n        return undefined;\r\n    }\r\n    if (!Number.isSafeInteger(value)) {\r\n        throw new Error(`Unsafe FBX object ID ${value.toString()}: object IDs must be safe integers.`);\r\n    }\r\n    return value;\r\n}\r\n\r\n/** Get the numeric ID from a node (first property is typically the int64 UID) */\r\nexport function getNodeId(node: FBXNode): number | undefined {\r\n    const prop = node.properties[0];\r\n    if (prop && (prop.type === \"int64\" || prop.type === \"int32\")) {\r\n        return getSafeFBXObjectId(prop.value);\r\n    }\r\n    return undefined;\r\n}\r\n\r\n/**\r\n * Clean FBX object names.\r\n * FBX names may contain:\r\n *   - A \"Class::\" prefix (e.g. \"Model::valkyrie_mesh\") — strip it\r\n *   - A binary null/control-character class suffix — strip it\r\n */\r\nexport function cleanFBXName(fbxName: string): string {\r\n    // Strip \\x00\\x01 suffix (binary FBX name/class separator)\r\n    const nullIdx = fbxName.indexOf(\"\\0\");\r\n    if (nullIdx >= 0) {\r\n        fbxName = fbxName.substring(0, nullIdx);\r\n    }\r\n\r\n    // Strip \"ClassName::\" prefix (ASCII FBX)\r\n    const colonIdx = fbxName.indexOf(\"::\");\r\n    if (colonIdx >= 0) {\r\n        fbxName = fbxName.substring(colonIdx + 2);\r\n    }\r\n\r\n    return fbxName;\r\n}\r\n"]}

package/SPLAT/gaussianSplattingStream.d.ts

@@ -0,0 +1,404 @@
+import { GaussianSplattingMesh } from "@babylonjs/core/Meshes/GaussianSplatting/gaussianSplattingMesh.js";
+import { type Scene } from "@babylonjs/core/scene.js";
+import { type Nullable } from "@babylonjs/core/types.js";
+import { Camera } from "@babylonjs/core/Cameras/camera.js";
+import { BoundingInfo } from "@babylonjs/core/Culling/boundingInfo.js";
+/**
+ * A single LOD variant of a tree node: a contiguous splat range inside one streamed SOG file.
+ */
+interface ISOGLODEntry {
+    /** Index into {@link ISOGLODMetadata.filenames}. */
+    file: number;
+    /** First splat index inside that file. */
+    offset: number;
+    /** Number of splats. */
+    count: number;
+}
+/**
+ * A node of the PlayCanvas-style SOG LOD octree. Internal nodes have `children`; leaves have `lods`.
+ */
+interface ISOGLODNode {
+    bound: {
+        min: number[];
+        max: number[];
+    };
+    children?: ISOGLODNode[];
+    lods?: {
+        [level: string]: ISOGLODEntry;
+    };
+    /** LOD level currently streamed/rendered for this node, or undefined until its base LOD is ready. */
+    activeLod?: number;
+    /** Distance-based ideal LOD level for this node, recomputed per frame. */
+    optimalLod?: number;
+    /** Available LOD levels for this leaf, sorted ascending (0 = finest). Set during the tree walk. */
+    availableLevels?: number[];
+    /** Coarsest available level (= max key), always streamed as the permanent base layer. */
+    baseLod?: number;
+    /** Final LOD level the node should stream/render (distance optimal, capped by maxDetailLod). */
+    targetLevel?: number;
+    /** Frames remaining before this node may switch LOD again (oscillation damping). */
+    lodCooldown?: number;
+    /** True when the node's bounding box currently intersects the camera frustum. Drives the LOD bias that
+     * pushes off-screen nodes to the coarsest level (they stay rendered, not hidden). */
+    inFrustum?: boolean;
+    /** Cached local-space bounding info used for the per-node frustum test (created once per leaf). */
+    cullBounds?: BoundingInfo;
+}
+/**
+ * Parsed contents of a PlayCanvas-style `lod-meta.json` file.
+ */
+export interface ISOGLODMetadata {
+    /** Number of LOD levels (0 = highest detail). */
+    lodLevels: number;
+    /** SOG `meta.json` paths, relative to the metadata file, indexed by `ISOGLODEntry.file`. */
+    filenames: string[];
+    /** Optional always-on environment `.sog` bundle, relative to the metadata file. */
+    environment?: string;
+    /** Root of the LOD octree. */
+    tree: ISOGLODNode;
+}
+/**
+ * Selects which LOD value drives the {@link GaussianSplattingStream} debug wireframe colors.
+ */
+export type GaussianSplattingStreamDebugLodSource = "optimal" | "current";
+/**
+ * Options for {@link GaussianSplattingStream}.
+ */
+export interface IGaussianSplattingStreamOptions {
+    /** URL of the fflate UMD module used to unzip `.sog` environment bundles. */
+    deflateURL?: string;
+    /** Pre-loaded fflate module. */
+    fflate?: any;
+    /** When true, renders a wireframe box per LOD node, colored by the node's LOD level. */
+    debugDisplay?: boolean;
+    /** Which LOD value drives the debug wireframe colors. Defaults to `"optimal"`. */
+    debugLodSource?: GaussianSplattingStreamDebugLodSource;
+    /** Distance (in local units) of the first LOD transition. PlayCanvas default `5`. */
+    lodBaseDistance?: number;
+    /** Geometric ratio between successive LOD transition distances. PlayCanvas default `3`. */
+    lodMultiplier?: number;
+    /** Distance multiplier applied to nodes behind the camera (`1` = no penalty). PlayCanvas default `1`. */
+    lodBehindPenalty?: number;
+    /** Lowest LOD index the optimal-LOD heuristic may select. Defaults to `0`. */
+    lodRangeMin?: number;
+    /** Highest LOD index the optimal-LOD heuristic may select. Defaults to `lodLevels - 1`. */
+    lodRangeMax?: number;
+    /** Maximum number of LOD source files to GPU-decode per frame (spreads work to avoid hitches). Defaults to `1`. */
+    maxDecodesPerFrame?: number;
+    /** Frames a node must wait after switching LOD before it may switch again (oscillation damping). Defaults to `10`. */
+    lodCooldownFrames?: number;
+    /** Minimum number of frames between LOD re-evaluations (throttles per-frame work during motion). Defaults to `4`. */
+    lodUpdateInterval?: number;
+    /** Minimum camera movement (world units) required to re-evaluate LODs. Defaults to `0.5`. */
+    lodUpdateDistance?: number;
+    /**
+     * Finest (most detailed) LOD level any node is allowed to render. `0` allows full detail (level 0);
+     * `1` caps detail at the next-coarser level, and so on. Higher values force a coarser maximum detail.
+     */
+    maxDetailLod?: number;
+    /**
+     * When true (default), LOD nodes outside the camera frustum are biased to their coarsest LOD rather than
+     * rendered at full detail. They stay in the sort/render set so they appear instantly (at low detail) when
+     * the camera turns toward them, then refine. Set to `false` to render every node at its distance LOD.
+     */
+    frustumCulling?: boolean;
+}
+/**
+ * Streams a PlayCanvas-style SOG LOD scene (`lod-meta.json`) into a single Gaussian Splatting mesh.
+ *
+ * Each selected SOG file (plus the environment) is loaded directly as GPU textures and decoded on the
+ * GPU into one unified, PlayCanvas-style square work buffer (no CPU splat decode or `updateData`). Only
+ * the splats of each node's currently-selected LOD are rendered/sorted via the mesh's interval filter.
+ *
+ * The coarsest (least-detail) LOD of every node is streamed first as a permanent base layer so the whole
+ * scene is visible quickly with no holes. A distance-based "optimal" LOD is then computed per node (see
+ * {@link evaluateOptimalLods}); finer LOD source files are streamed on demand and a node only switches to
+ * a finer LOD once that file is decoded, so transitions never flash or leave gaps.
+ *
+ * @experimental
+ */
+export declare class GaussianSplattingStream extends GaussianSplattingMesh {
+    private readonly _metadata;
+    private readonly _rootUrl;
+    private readonly _streamOptions;
+    private readonly _leafNodes;
+    private _lodBaseDistance;
+    private _lodMultiplier;
+    private _lodBehindPenalty;
+    private _lodRangeMin;
+    private _lodRangeMax;
+    private _maxDecodesPerFrame;
+    private _lodCooldownFrames;
+    private _lodUpdateInterval;
+    private _lodUpdateDistance;
+    private _maxDetailLod;
+    private _frustumCulling;
+    private readonly _frustumPlanes;
+    private readonly _cullViewProj;
+    private _workBuffer;
+    private _useGpuPositionReadback;
+    private _readbackCandidate;
+    private _readbackProbed;
+    private readonly _fileBaseSplat;
+    private readonly _fileCounts;
+    private readonly _fileMeta;
+    private readonly _decodedFiles;
+    private readonly _loadingFiles;
+    private readonly _decodeQueue;
+    private _environmentRange;
+    private _environmentFiles;
+    private _lodObserver;
+    private _baseLayerReady;
+    private _framesSinceLodUpdate;
+    private readonly _lastLodCamPos;
+    private _forceLodUpdate;
+    private readonly _boundsMin;
+    private readonly _boundsMax;
+    private _debugDisplay;
+    private _debugLodSource;
+    private _debugMesh;
+    private _debugObserver;
+    private _debugColorData;
+    private _debugSignature;
+    private _disposed;
+    /**
+     * Returns true when the parsed JSON looks like a PlayCanvas-style `lod-meta.json` payload.
+     * @param data parsed JSON
+     * @returns whether the data is SOG LOD metadata
+     */
+    static IsLODMetadata(data: unknown): data is ISOGLODMetadata;
+    /**
+     * Creates a new SOG LOD streaming mesh and immediately starts streaming (non-blocking).
+     * @param name mesh name
+     * @param metadata parsed `lod-meta.json`
+     * @param rootUrl base URL the metadata's relative paths resolve against
+     * @param scene hosting scene
+     * @param options streaming options
+     */
+    constructor(name: string, metadata: ISOGLODMetadata, rootUrl: string, scene: Scene, options?: IGaussianSplattingStreamOptions);
+    getClassName(): string;
+    /**
+     * Finest (most detailed) LOD level any node is allowed to render. `0` allows full detail (level 0);
+     * `1` caps detail at the next-coarser level, and so on. Nodes already coarser than this cap (by
+     * distance) are unaffected. Changes take effect in real time.
+     */
+    get maxDetailLod(): number;
+    set maxDetailLod(value: number);
+    /**
+     * Coarsest LOD level index in the scene (number of LOD levels minus one). Useful as the upper bound
+     * for {@link maxDetailLod}.
+     */
+    get maxLodLevel(): number;
+    /**
+     * When true (default), nodes whose bounding box is outside the camera frustum are biased to the coarsest
+     * LOD instead of being hidden. They stay in the sort/render set (their off-screen splats are clipped), so
+     * turning the camera toward them shows low detail immediately with no invisible frames, then refines.
+     * Changes take effect in real time.
+     */
+    get frustumCulling(): boolean;
+    set frustumCulling(value: boolean);
+    /**
+     * When true, renders a wireframe box per LOD node, colored by the LOD level selected by {@link debugLodSource}.
+     */
+    get debugDisplay(): boolean;
+    set debugDisplay(value: boolean);
+    /**
+     * Selects which LOD value drives the debug wireframe colors: the distance-based `"optimal"` LOD
+     * (default, recomputed as the camera moves) or the `"current"` streamed/rendered LOD.
+     */
+    get debugLodSource(): GaussianSplattingStreamDebugLodSource;
+    set debugLodSource(value: GaussianSplattingStreamDebugLodSource);
+    dispose(doNotRecurse?: boolean): void;
+    /**
+     * Re-evaluates the optimal LOD for every node based on the camera position. The result is stored in
+     * each node's `optimalLod`. Rendering is unaffected; this currently drives only diagnostics and the
+     * debug wireframe display.
+     * @param camera camera to evaluate against (defaults to the scene's active camera)
+     */
+    evaluateOptimalLods(camera?: Nullable<Camera>): void;
+    /**
+     * The LOD level used to color a node's debug box, per {@link debugLodSource}.
+     * @param node leaf node
+     * @returns the displayed LOD level
+     */
+    private _displayedLodLevel;
+    /**
+     * Rebuilds the debug wireframe (evaluating the optimal LOD first when needed) and wires up the per-frame
+     * recolor observer. The observer runs for both LOD sources: "optimal" colors track the camera, and
+     * "current" colors track LOD levels as they stream in/out.
+     */
+    private _refreshDebugDisplay;
+    /**
+     * Per-frame debug update: recolors the existing wireframe in place whenever the displayed LOD levels
+     * change. For the "optimal" source the optimal LOD is recomputed first (it tracks the camera); for the
+     * "current" source the levels are driven by the streaming loop, so no recomputation is needed here. The
+     * geometry is never rebuilt, which avoids the dispose/recreate flicker while the camera moves.
+     */
+    private _onDebugFrame;
+    /**
+     * Builds the LOD-node wireframe boxes once (one box per leaf node), colored by the displayed LOD level.
+     * The color vertex buffer is created updatable so subsequent recolors can happen in place.
+     */
+    private _buildDebugMesh;
+    /**
+     * Recolors the existing wireframe in place from the current displayed LOD levels, without rebuilding geometry.
+     */
+    private _updateDebugColors;
+    /**
+     * Computes a cheap 32-bit rolling hash of every leaf's displayed LOD level, used to detect when the
+     * debug wireframe needs recoloring. Avoids per-frame string allocation in the render loop.
+     * @returns a numeric signature of the current displayed LOD levels
+     */
+    private _computeDebugSignature;
+    /**
+     * Disposes the LOD-node wireframe boxes and stops live debug updates.
+     */
+    private _clearDebugDisplay;
+    /**
+     * Walks the LOD tree and records every leaf that carries renderable LOD entries, capturing the set of
+     * available levels and the coarsest (base) level for each.
+     * @param node current tree node
+     */
+    private _collectLodEntries;
+    /**
+     * Streams the scene: learns every source file's splat count, allocates one unified GPU work buffer
+     * sized for all LOD files, decodes the environment and the coarsest LOD of every node as a permanent
+     * base layer, then installs the per-frame loop that streams finer LODs on demand.
+     */
+    private _streamAllAsync;
+    /**
+     * Collects the unique set of source file indices referenced by any LOD of any leaf, sorted ascending.
+     * @returns sorted unique file indices
+     */
+    private _collectAllFileIds;
+    /**
+     * Fetches the environment bundle and every referenced file's metadata to learn splat counts, caching
+     * each file's parsed metadata for the later on-demand decode. Metadata fetches run in parallel.
+     * @param fileIds file indices to fetch metadata for
+     * @returns the environment splat count (0 when there is no environment)
+     */
+    private _gatherCountsAsync;
+    /**
+     * Queues a file for on-demand decode if it isn't already decoded, in flight, or already queued.
+     * @param fileId file index to decode
+     */
+    private _enqueueDecode;
+    /**
+     * Starts up to {@link _maxDecodesPerFrame} queued decodes for this frame. Decodes run asynchronously
+     * and promote any waiting nodes once they complete.
+     */
+    private _pumpDecodeQueue;
+    /**
+     * Writes a decoded splat range's positions into the shared buffer, expands the bounds, and incrementally
+     * patches the sort worker.
+     * @param positions stride-4 positions for the range
+     * @param base first splat index of the range in the work buffer
+     * @param count number of splats in the range
+     */
+    private _applyPositions;
+    /**
+     * One-time validation of GPU position readback: reads a sample of the just-decoded range back from the work
+     * buffer and compares it to the CPU-decoded positions. Enables {@link _useGpuPositionReadback} only on an
+     * exact (within float tolerance) match, so an unsupported or incorrect readback (e.g. a backend without the
+     * required texture usage, or an orientation mismatch) safely keeps the CPU decode path.
+     * @param base first splat index of the validated range
+     * @param count number of splats in the range
+     * @param cpuPositions the CPU-decoded stride-4 positions for the range (ground truth)
+     */
+    private _probeReadbackAsync;
+    /**
+     * Resolves the decoded positions for a splat range and applies them. Once GPU readback has been validated,
+     * positions are read back from the work buffer (non-blocking) and `pack.positions` is empty; otherwise the
+     * CPU-decoded `pack.positions` are used, and — on the first such decode — the GPU readback is validated
+     * against them so subsequent decodes can use the fast path.
+     * @param pack the parsed SOG pack (its `positions` is populated only on the CPU path)
+     * @param base first splat index of the range in the work buffer
+     * @param count number of splats in the range
+     * @returns whether positions were applied
+     */
+    private _applyDecodedPositionsAsync;
+    /**
+     * Decodes the always-on environment bundle into its work-buffer block and activates its range.
+     */
+    private _decodeEnvironmentAsync;
+    /**
+     * Loads one LOD source file as GPU textures, decodes it into its fixed work-buffer block, records its
+     * CPU centers for sorting, frees the source textures, then promotes any nodes that were waiting for it.
+     * Concurrent or repeat requests for the same file are ignored.
+     * @param fileId file index to decode
+     */
+    private _decodeFileAsync;
+    /**
+     * Snaps a desired LOD level to the nearest level the node provides, while never selecting a level finer
+     * than {@link maxDetailLod} (i.e. with an index below the cap). Ties prefer the finer allowed level. If
+     * the node has no level at or coarser than the cap, its coarsest available level is used.
+     * @param node leaf node
+     * @param desired desired LOD level
+     * @returns the chosen available level
+     */
+    private _cappedLevelForNode;
+    /**
+     * Computes each node's {@link ISOGLODNode.targetLevel}: the distance-based optimal level snapped to an
+     * available level, capped so no node renders finer (more detailed) than {@link maxDetailLod}.
+     */
+    private _computeTargetLevels;
+    /**
+     * Applies each node's {@link ISOGLODNode.targetLevel}: switches a node to its target level when that
+     * level's file is already decoded, otherwise queues the file and leaves the node on its current LOD (so
+     * nothing ever disappears). Nodes within their post-switch cooldown are left untouched to damp oscillation.
+     * @returns true when at least one node changed LOD (callers should refresh the active ranges)
+     */
+    private _applyDesiredLods;
+    /**
+     * Per-frame LOD streaming loop. Ticks cooldowns and pumps the decode queue every frame, and runs the
+     * cheap per-node frustum test every frame so the off-screen LOD bias tracks camera rotation. The LOD
+     * re-evaluation is throttled to at most every {@link _lodUpdateInterval} frames once the camera has
+     * translated far enough, but also runs immediately whenever a node enters/leaves the frustum (so its
+     * detail upgrades/downgrades promptly) or a cap change forces it. Active ranges rebuild on any LOD change.
+     */
+    private _onLodFrame;
+    /**
+     * Updates each leaf node's {@link ISOGLODNode.inFrustum} flag from a per-node frustum test against the
+     * active camera. When {@link frustumCulling} is disabled (or there is no camera) every node is marked
+     * in-frustum. Bounds are static (from the LOD tree), so flags are valid for all nodes regardless of
+     * decode state. Returns true when any node's in-frustum state changed (so the LOD bias must be re-applied).
+     * @returns whether any node's in-frustum state changed
+     */
+    private _updateNodeFrustum;
+    /**
+     * Reads the splat count from SOG metadata.
+     * @param data SOG metadata
+     * @returns the splat count
+     */
+    private static _GetSplatCount;
+    /**
+     * Disposes all GPU source textures of a SOG pack (they are only needed for the one decode pass).
+     * @param pack the SOG texture pack
+     */
+    private static _DisposePack;
+    /**
+     * Expands the running splat-center bounds with a newly decoded file's centers and updates the
+     * mesh bounding info so the GS is correctly frustum-culled and pickable.
+     * @param positions stride-4 splat centers for the new file
+     * @param count number of splats
+     */
+    private _updateBounds;
+    /**
+     * Rebuilds the active interval set from the environment plus each node's currently-selected LOD entry,
+     * coalesces adjacent ranges, and pushes the result to the sort worker.
+     */
+    private _refreshActiveRanges;
+    /**
+     * Sorts and merges adjacent/overlapping ranges to keep the interval list compact.
+     * @param ranges raw ranges
+     * @returns coalesced ranges
+     */
+    private static _CoalesceRanges;
+    /**
+     * Unzips a `.sog` bundle into a name -> bytes map, loading fflate on demand.
+     * @param data zipped bytes
+     * @returns map of entry name to bytes
+     */
+    private _unzipAsync;
+}
+export {};