@itwin/core-common 4.0.0-dev.7 → 4.0.0-dev.72

package/lib/esm/FeatureTable.js.map

@@ -1 +1 @@
-{"version":3,"file":"FeatureTable.js","sourceRoot":"","sources":["../../src/FeatureTable.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,cAAc,EAAE,IAAI,EAAc,YAAY,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AACvH,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD;;;;;;;;GAQG;AACH,MAAM,OAAO,OAAO;IAKlB,YAAmB,YAAwB,IAAI,CAAC,OAAO,EAAE,gBAA4B,IAAI,CAAC,OAAO,EAAE,gBAA+B,aAAa,CAAC,OAAO;QACrJ,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED,IAAW,SAAS,KAAc,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,IAAI,CAAC,aAAa,KAAK,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;IAClK,IAAW,WAAW,KAAc,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAE7D,0EAA0E;IACnE,MAAM,CAAC,KAAc,IAAa,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE5E;;;OAGG;IACI,OAAO,CAAC,GAAY;QACzB,IAAI,IAAI,KAAK,GAAG;YACd,OAAO,CAAC,CAAC;QAEX,IAAI,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,GAAG,EAAE;YACb,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;YACpD,IAAI,CAAC,KAAK,GAAG,EAAE;gBACb,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;aAC7D;SACF;QAED,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAUD;;;;;GAKG;AACH,MAAM,CAAN,IAAY,SAeX;AAfD,WAAY,SAAS;IACnB,4EAA4E;IAC5E,+CAAO,CAAA;IACP;;;;OAIG;IACH,iEAAgB,CAAA;IAChB;;;;OAIG;IACH,iEAAgB,CAAA;AAClB,CAAC,EAfW,SAAS,KAAT,SAAS,QAepB;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,YAAa,SAAQ,QAAiB;IAIjD,uCAAuC;IACvC,YAAmB,WAAmB,EAAE,UAAsB,IAAI,CAAC,OAAO,EAAE,OAAkB,SAAS,CAAC,OAAO;QAC7G,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;QACnD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,gFAAgF;IAChF,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IAC9D,gBAAgB;IAChB,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACrH,0EAA0E;IAC1E,IAAW,SAAS,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7D,gHAAgH;IAChH,IAAW,OAAO,KAA0B,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC1G,oGAAoG;IACpG,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7F,oGAAoG;IACpG,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAE7F,0GAA0G;IACnG,WAAW,CAAC,KAAa;QAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAC7B,IAAI,KAAK,CAAC,KAAK,KAAK,KAAK;gBACvB,OAAO,KAAK,CAAC,KAAK,CAAC;QAEvB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,gBAAgB;IACT,eAAe,CAAC,OAAgB,EAAE,KAAa;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvC,MAAM,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACrB,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,YAAY,CAAU,OAAO,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED,gBAAgB;IACT,QAAQ,KAAmC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;CACxE;AAKD;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IAY7B;;;OAGG;IACH,YAAmB,IAAiB,EAAE,OAAmB,EAAE,WAAmB,EAAE,WAAmB,EAAE,IAAe,EAAE,gBAAyD;QAC7K,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,iBAAiB,GAAG,gBAAgB,CAAC;QAE1C,QAAQ,IAAI,CAAC,WAAW,EAAE;YACxB,KAAK,CAAC;gBACJ,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;gBACxB,MAAM;YACR,KAAK,CAAC;gBACJ,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC/C,MAAM;YACR;gBACE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;gBACvB,MAAM;SACT;QAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,oBAAoB,CAAC,CAAC;QACvD,MAAM,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC;QAC7C,MAAM,CAAC,SAAS,KAAK,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC;IACrG,CAAC;IA9BD,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IACjE,IAAW,gBAAgB,KAAmE,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;IA+B9H,6DAA6D;IACtD,MAAM,CAAC,IAAI,CAAC,YAA0B;QAC3C,4GAA4G;QAC5G,mDAAmD;QACnD,wIAAwI;QACxI,6DAA6D;QAC7D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;QAChD,KAAK,MAAM,EAAE,IAAI,YAAY,CAAC,QAAQ,EAAE,EAAE;YACxC,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC;YACnE,IAAI,SAAS,KAAK,KAAK;gBACrB,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;SACjE;QAED,iFAAiF;QACjF,MAAM,mBAAmB,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QACpD,MAAM,QAAQ,GAAG,mBAAmB,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC;QAC9D,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;QAE1C,KAAK,MAAM,EAAE,IAAI,YAAY,CAAC,QAAQ,EAAE,EAAE;YACxC,MAAM,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;YACzB,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC;YAE3B,IAAI,gBAAgB,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,CAAE,CAAC;YACjE,MAAM,CAAC,SAAS,KAAK,gBAAgB,CAAC,CAAC,CAAC,0BAA0B;YAClE,gBAAgB,IAAI,CAAC,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC,CAAC;YAElD,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC5D,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC5D,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,gBAAgB,CAAC;SACvC;QAED,aAAa,CAAC,OAAO,CAAC,CAAC,KAAa,EAAE,EAAU,EAAE,IAAI,EAAE,EAAE;YACxD,MAAM,OAAO,GAAG,mBAAmB,GAAG,CAAC,GAAG,KAAK,CAAC;YAChD,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;YAC/C,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,kBAAkB,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,WAAW,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;IACjI,CAAC;IAED,gEAAgE;IACzD,UAAU,CAAC,YAAoB;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,YAAY,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnF,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC7F,OAAO,IAAI,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;IAC7D,CAAC;IAED,0GAA0G;IACnG,WAAW,CAAC,YAAoB;QACrC,OAAO,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrF,CAAC;IAED,gBAAgB;IACT,gBAAgB,CAAC,YAAoB,EAAE,GAAqB;QACjE,GAAG,GAAG,GAAG,aAAH,GAAG,cAAH,GAAG,GAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACpC,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC;QAChC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC/B,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,gBAAgB;IACT,oBAAoB,CAAC,YAAoB;QAC9C,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,CAAC;QAC/B,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACxC,WAAW,GAAG,CAAC,WAAW,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC/C,WAAW,GAAG,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC;QAC1D,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC;IAChF,CAAC;IAED,gBAAgB;IACT,kBAAkB,CAAC,YAAoB;QAC5C,OAAO,SAAS,KAAK,IAAI,CAAC,iBAAiB,IAAI,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5H,CAAC;IAED,gBAAgB;IACT,gBAAgB,CAAC,YAAoB;QAC1C,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QAExC,MAAM,OAAO,GAAG,CAAC,GAAG,YAAY,CAAC;QACjC,MAAM,SAAS,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC;QAEjF,MAAM,mBAAmB,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACpD,MAAM,aAAa,GAAG,CAAC,mBAAmB,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QAE1D,IAAI,WAAW,GAAG,CAAC,mBAAmB,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3D,WAAW,GAAG,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC;QAC1D,MAAM,aAAa,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC;QAE7F,MAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC;QAC9D,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,aAAa,EAAE,eAAe,EAAE,CAAC;IACtE,CAAC;IAED,4HAA4H;IACrH,aAAa,CAAC,YAAoB;QACvC,IAAI,YAAY,IAAI,IAAI,CAAC,WAAW;YAClC,OAAO,SAAS,CAAC;;YAEjB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;IACzC,CAAC;IAED,4DAA4D;IAC5D,IAAW,SAAS,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAElE,2DAA2D;IAC3D,IAAW,OAAO,KAA0B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAErG,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7F,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7F,IAAW,YAAY,KAAc,OAAO,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;IAEjG,mDAAmD;IAC5C,MAAM;QACX,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE;YACzC,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACnC,KAAK,CAAC,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;SACnC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,wBAAwB,CAAC,aAA4B,EAAE,SAAiB;QAC7E,MAAM,CAAC,SAAS,KAAK,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC7C,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAEtB,MAAM,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACpC,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;QAC9B,MAAM,OAAO,GAAG,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;QACjI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC/B,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK,MAAM,EAAE;gBAChB,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;gBACpB,SAAS,GAAG,IAAI,CAAC;aAClB;SACF;QAED,IAAI,SAAS;YACX,IAAI,CAAC,iBAAiB,GAAG,OAAO,CAAC;IACrC,CAAC;IAED,IAAY,oBAAoB,KAAa,OAAO,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC;IAEnE,MAAM,CAAC,QAAgB;QAC7B,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7E,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Rendering\r\n */\r\n\r\nimport { assert, compareNumbers, compareStrings, Id64, Id64String, IndexedValue, IndexMap } from \"@itwin/core-bentley\";\r\nimport { GeometryClass } from \"./GeometryParams\";\r\n\r\n/** Describes a discrete entity within a batched [RenderGraphic]($frontend) that can be\r\n * grouped with other such entities in a [[FeatureTable]].\r\n * Features roughly correlate to elements: a [Tile]($frontend)'s graphics combines geometry from every\r\n * [GeometricElement]($backend) that intersects the tile's volume, so each element produces at least one feature.\r\n * However, an element's geometry stream can contain geometry belonging to multiple different combinations of [SubCategory]($backend) and\r\n * [[GeometryClass]], so an individual element may produce more than one feature.\r\n * @see [[FeatureOverrides]] for customizing the appearance of individual features.\r\n * @public\r\n */\r\nexport class Feature {\r\n  public readonly elementId: string;\r\n  public readonly subCategoryId: string;\r\n  public readonly geometryClass: GeometryClass;\r\n\r\n  public constructor(elementId: Id64String = Id64.invalid, subCategoryId: Id64String = Id64.invalid, geometryClass: GeometryClass = GeometryClass.Primary) {\r\n    this.elementId = elementId;\r\n    this.subCategoryId = subCategoryId;\r\n    this.geometryClass = geometryClass;\r\n  }\r\n\r\n  public get isDefined(): boolean { return !Id64.isInvalid(this.elementId) || !Id64.isInvalid(this.subCategoryId) || this.geometryClass !== GeometryClass.Primary; }\r\n  public get isUndefined(): boolean { return !this.isDefined; }\r\n\r\n  /** Returns true if this feature is equivalent to the supplied feature. */\r\n  public equals(other: Feature): boolean { return 0 === this.compare(other); }\r\n\r\n  /** Performs ordinal comparison of this feature with another.\r\n   * @param rhs The feature to compare with.\r\n   * @returns zero if the features are equivalent, a negative value if this feature compares as \"less than\" `rhs`, or a positive value if this feature compares \"greater than\" `rhs`.\r\n   */\r\n  public compare(rhs: Feature): number {\r\n    if (this === rhs)\r\n      return 0;\r\n\r\n    let cmp = compareNumbers(this.geometryClass, rhs.geometryClass);\r\n    if (0 === cmp) {\r\n      cmp = compareStrings(this.elementId, rhs.elementId);\r\n      if (0 === cmp) {\r\n        cmp = compareStrings(this.subCategoryId, rhs.subCategoryId);\r\n      }\r\n    }\r\n\r\n    return cmp;\r\n  }\r\n}\r\n\r\n/** @internal */\r\nexport interface PackedFeature {\r\n  elementId: Id64.Uint32Pair;\r\n  subCategoryId: Id64.Uint32Pair;\r\n  geometryClass: GeometryClass;\r\n  animationNodeId: number;\r\n}\r\n\r\n/** Describes the type of a 'batch' of graphics representing multiple [[Feature]]s.\r\n * The most commonly-encountered batches are Tiles, which can be of either Primary or\r\n * Classifier type.\r\n * @public\r\n * @extensions\r\n */\r\nexport enum BatchType {\r\n  /** This batch contains graphics derived from a model's visible geometry. */\r\n  Primary,\r\n  /**\r\n   * This batch contains color volumes which are used to classify a model's visible geometry.\r\n   * The graphics themselves are not rendered to the screen; instead they are rendered to the stencil buffer\r\n   * to resymbolize the primary geometry.\r\n   */\r\n  VolumeClassifier,\r\n  /**\r\n   * This batch contains planar graphics which are used to classify a model's visible geometry.\r\n   * The graphics themselves are not rendered to the screen; instead they are rendered to a texture buffer\r\n   * to resymbolize the primary geometry.\r\n   */\r\n  PlanarClassifier,\r\n}\r\n\r\n/** Defines a look-up table for [[Feature]]s within a batched [RenderGraphic]($frontend). Consecutive 32-bit\r\n * indices are assigned to each unique Feature. Primitives within the RenderGraphic can\r\n * use per-vertex indices to specify the distribution of Features within the primitive. The appearance of individual\r\n * features can be customized using [[FeatureOverrides]]. Typically a [Tile]($frontend) will contain a feature table\r\n * identifying the elements whose geometry appears within that tile.\r\n * @see [[FeatureOverrides]] for customizing the appearance of individual features.\r\n * @public\r\n */\r\nexport class FeatureTable extends IndexMap<Feature> {\r\n  public readonly modelId: Id64String;\r\n  public readonly type: BatchType;\r\n\r\n  /** Construct an empty FeatureTable. */\r\n  public constructor(maxFeatures: number, modelId: Id64String = Id64.invalid, type: BatchType = BatchType.Primary) {\r\n    super((lhs, rhs) => lhs.compare(rhs), maxFeatures);\r\n    this.modelId = modelId;\r\n    this.type = type;\r\n  }\r\n\r\n  /** Returns the maximum number of [[Feature]]s this FeatureTable can contain. */\r\n  public get maxFeatures(): number { return this._maximumSize; }\r\n  /** @internal */\r\n  public get anyDefined(): boolean { return this.length > 1 || (1 === this.length && this._array[0].value.isDefined); }\r\n  /** Returns true if this FeatureTable contains exactly one [[Feature]]. */\r\n  public get isUniform(): boolean { return 1 === this.length; }\r\n  /** If this FeatureTable contains exactly one [[Feature]], returns that Feature; otherwise returns undefined. */\r\n  public get uniform(): Feature | undefined { return 1 === this.length ? this._array[0].value : undefined; }\r\n  /** Returns true if this FeatureTable is associated with [[BatchType.VolumeClassifier]] geometry. */\r\n  public get isVolumeClassifier(): boolean { return BatchType.VolumeClassifier === this.type; }\r\n  /** Returns true if this FeatureTable is associated with [[BatchType.PlanarClassifier]] geometry. */\r\n  public get isPlanarClassifier(): boolean { return BatchType.PlanarClassifier === this.type; }\r\n\r\n  /** Returns the Feature corresponding to the specified index, or undefined if the index is not present. */\r\n  public findFeature(index: number): Feature | undefined {\r\n    for (const entry of this._array)\r\n      if (entry.index === index)\r\n        return entry.value;\r\n\r\n    return undefined;\r\n  }\r\n\r\n  /** @internal */\r\n  public insertWithIndex(feature: Feature, index: number): void {\r\n    const bound = this.lowerBound(feature);\r\n    assert(!bound.equal);\r\n    assert(!this.isFull);\r\n    const entry = new IndexedValue<Feature>(feature, index);\r\n    this._array.splice(bound.index, 0, entry);\r\n  }\r\n\r\n  /** @internal */\r\n  public getArray(): Array<IndexedValue<Feature>> { return this._array; }\r\n}\r\n\r\n/** @alpha */\r\nexport type ComputeNodeId = (elementId: Id64.Uint32Pair, featureIndex: number) => number;\r\n\r\n/**\r\n * An immutable, packed representation of a [[FeatureTable]]. The features are packed into a single array of 32-bit integer values,\r\n * wherein each feature occupies 3 32-bit integers.\r\n * @internal\r\n */\r\nexport class PackedFeatureTable {\r\n  private readonly _data: Uint32Array;\r\n  public readonly modelId: Id64String;\r\n  public readonly maxFeatures: number;\r\n  public readonly numFeatures: number;\r\n  public readonly anyDefined: boolean;\r\n  public readonly type: BatchType;\r\n  private _animationNodeIds?: Uint8Array | Uint16Array | Uint32Array;\r\n\r\n  public get byteLength(): number { return this._data.byteLength; }\r\n  public get animationNodeIds(): Readonly<Uint8Array | Uint16Array | Uint32Array> | undefined { return this._animationNodeIds; }\r\n\r\n  /** Construct a PackedFeatureTable from the packed binary data.\r\n   * This is used internally when deserializing Tiles in iMdl format.\r\n   * @internal\r\n   */\r\n  public constructor(data: Uint32Array, modelId: Id64String, numFeatures: number, maxFeatures: number, type: BatchType, animationNodeIds?: Uint8Array | Uint16Array | Uint32Array) {\r\n    this._data = data;\r\n    this.modelId = modelId;\r\n    this.maxFeatures = maxFeatures;\r\n    this.numFeatures = numFeatures;\r\n    this.type = type;\r\n    this._animationNodeIds = animationNodeIds;\r\n\r\n    switch (this.numFeatures) {\r\n      case 0:\r\n        this.anyDefined = false;\r\n        break;\r\n      case 1:\r\n        this.anyDefined = this.getFeature(0).isDefined;\r\n        break;\r\n      default:\r\n        this.anyDefined = true;\r\n        break;\r\n    }\r\n\r\n    assert(this._data.length >= this._subCategoriesOffset);\r\n    assert(this.maxFeatures >= this.numFeatures);\r\n    assert(undefined === this._animationNodeIds || this._animationNodeIds.length === this.numFeatures);\r\n  }\r\n\r\n  /** Create a packed feature table from a [[FeatureTable]]. */\r\n  public static pack(featureTable: FeatureTable): PackedFeatureTable {\r\n    // We must determine how many subcategories we have ahead of time to compute the size of the Uint32Array, as\r\n    // the array cannot be resized after it is created.\r\n    // We are not too worried about this as FeatureTables created on the front-end will contain few if any features; those obtained from the\r\n    // back-end arrive within tiles already in the packed format.\r\n    const subcategories = new Map<string, number>();\r\n    for (const iv of featureTable.getArray()) {\r\n      const found = subcategories.get(iv.value.subCategoryId.toString());\r\n      if (undefined === found)\r\n        subcategories.set(iv.value.subCategoryId, subcategories.size);\r\n    }\r\n\r\n    // We need 3 32-bit integers per feature, plus 2 32-bit integers per subcategory.\r\n    const subCategoriesOffset = 3 * featureTable.length;\r\n    const nUint32s = subCategoriesOffset + 2 * subcategories.size;\r\n    const uint32s = new Uint32Array(nUint32s);\r\n\r\n    for (const iv of featureTable.getArray()) {\r\n      const feature = iv.value;\r\n      const index = iv.index * 3;\r\n\r\n      let subCategoryIndex = subcategories.get(feature.subCategoryId)!;\r\n      assert(undefined !== subCategoryIndex); // we inserted it above...\r\n      subCategoryIndex |= (feature.geometryClass << 24);\r\n\r\n      uint32s[index + 0] = Id64.getLowerUint32(feature.elementId);\r\n      uint32s[index + 1] = Id64.getUpperUint32(feature.elementId);\r\n      uint32s[index + 2] = subCategoryIndex;\r\n    }\r\n\r\n    subcategories.forEach((index: number, id: string, _map) => {\r\n      const index32 = subCategoriesOffset + 2 * index;\r\n      uint32s[index32 + 0] = Id64.getLowerUint32(id);\r\n      uint32s[index32 + 1] = Id64.getUpperUint32(id);\r\n    });\r\n\r\n    return new PackedFeatureTable(uint32s, featureTable.modelId, featureTable.length, featureTable.maxFeatures, featureTable.type);\r\n  }\r\n\r\n  /** Retrieve the Feature associated with the specified index. */\r\n  public getFeature(featureIndex: number): Feature {\r\n    const packed = this.getPackedFeature(featureIndex);\r\n    const elemId = Id64.fromUint32Pair(packed.elementId.lower, packed.elementId.upper);\r\n    const subcatId = Id64.fromUint32Pair(packed.subCategoryId.lower, packed.subCategoryId.upper);\r\n    return new Feature(elemId, subcatId, packed.geometryClass);\r\n  }\r\n\r\n  /** Returns the Feature associated with the specified index, or undefined if the index is out of range. */\r\n  public findFeature(featureIndex: number): Feature | undefined {\r\n    return featureIndex < this.numFeatures ? this.getFeature(featureIndex) : undefined;\r\n  }\r\n\r\n  /** @internal */\r\n  public getElementIdPair(featureIndex: number, out?: Id64.Uint32Pair): Id64.Uint32Pair {\r\n    out = out ?? { lower: 0, upper: 0 };\r\n    assert(featureIndex < this.numFeatures);\r\n    const offset = 3 * featureIndex;\r\n    out.lower = this._data[offset];\r\n    out.upper = this._data[offset + 1];\r\n    return out;\r\n  }\r\n\r\n  /** @internal */\r\n  public getSubCategoryIdPair(featureIndex: number): Id64.Uint32Pair {\r\n    const index = 3 * featureIndex;\r\n    let subCatIndex = this._data[index + 2];\r\n    subCatIndex = (subCatIndex & 0x00ffffff) >>> 0;\r\n    subCatIndex = subCatIndex * 2 + this._subCategoriesOffset;\r\n    return { lower: this._data[subCatIndex], upper: this._data[subCatIndex + 1] };\r\n  }\r\n\r\n  /** @internal */\r\n  public getAnimationNodeId(featureIndex: number): number {\r\n    return undefined !== this._animationNodeIds && featureIndex < this.numFeatures ? this._animationNodeIds[featureIndex] : 0;\r\n  }\r\n\r\n  /** @internal */\r\n  public getPackedFeature(featureIndex: number): PackedFeature {\r\n    assert(featureIndex < this.numFeatures);\r\n\r\n    const index32 = 3 * featureIndex;\r\n    const elementId = { lower: this._data[index32], upper: this._data[index32 + 1] };\r\n\r\n    const subCatIndexAndClass = this._data[index32 + 2];\r\n    const geometryClass = (subCatIndexAndClass >>> 24) & 0xff;\r\n\r\n    let subCatIndex = (subCatIndexAndClass & 0x00ffffff) >>> 0;\r\n    subCatIndex = subCatIndex * 2 + this._subCategoriesOffset;\r\n    const subCategoryId = { lower: this._data[subCatIndex], upper: this._data[subCatIndex + 1] };\r\n\r\n    const animationNodeId = this.getAnimationNodeId(featureIndex);\r\n    return { elementId, subCategoryId, geometryClass, animationNodeId };\r\n  }\r\n\r\n  /** Returns the element ID of the Feature associated with the specified index, or undefined if the index is out of range. */\r\n  public findElementId(featureIndex: number): Id64String | undefined {\r\n    if (featureIndex >= this.numFeatures)\r\n      return undefined;\r\n    else\r\n      return this.readId(3 * featureIndex);\r\n  }\r\n\r\n  /** Return true if this table contains exactly 1 feature. */\r\n  public get isUniform(): boolean { return 1 === this.numFeatures; }\r\n\r\n  /** If this table contains exactly 1 feature, return it. */\r\n  public get uniform(): Feature | undefined { return this.isUniform ? this.getFeature(0) : undefined; }\r\n\r\n  public get isVolumeClassifier(): boolean { return BatchType.VolumeClassifier === this.type; }\r\n  public get isPlanarClassifier(): boolean { return BatchType.VolumeClassifier === this.type; }\r\n  public get isClassifier(): boolean { return this.isVolumeClassifier || this.isPlanarClassifier; }\r\n\r\n  /** Unpack the features into a [[FeatureTable]]. */\r\n  public unpack(): FeatureTable {\r\n    const table = new FeatureTable(this.maxFeatures, this.modelId);\r\n    for (let i = 0; i < this.numFeatures; i++) {\r\n      const feature = this.getFeature(i);\r\n      table.insertWithIndex(feature, i);\r\n    }\r\n\r\n    return table;\r\n  }\r\n\r\n  public populateAnimationNodeIds(computeNodeId: ComputeNodeId, maxNodeId: number): void {\r\n    assert(undefined === this._animationNodeIds);\r\n    assert(maxNodeId > 0);\r\n\r\n    const pair = { lower: 0, upper: 0 };\r\n    let haveNodes = false;\r\n    const size = this.numFeatures;\r\n    const nodeIds = maxNodeId < 0x100 ? new Uint8Array(size) : (maxNodeId < 0x10000 ? new Uint16Array(size) : new Uint32Array(size));\r\n    for (let i = 0; i < this.numFeatures; i++) {\r\n      this.getElementIdPair(i, pair);\r\n      const nodeId = computeNodeId(pair, i);\r\n      assert(nodeId <= maxNodeId);\r\n      if (0 !== nodeId) {\r\n        nodeIds[i] = nodeId;\r\n        haveNodes = true;\r\n      }\r\n    }\r\n\r\n    if (haveNodes)\r\n      this._animationNodeIds = nodeIds;\r\n  }\r\n\r\n  private get _subCategoriesOffset(): number { return this.numFeatures * 3; }\r\n\r\n  private readId(offset32: number): Id64String {\r\n    return Id64.fromUint32Pair(this._data[offset32], this._data[offset32 + 1]);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"FeatureTable.js","sourceRoot":"","sources":["../../src/FeatureTable.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,cAAc,EAAE,IAAI,EAAc,YAAY,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AACvH,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD;;;;;;;;GAQG;AACH,MAAM,OAAO,OAAO;IAKlB,YAAmB,YAAwB,IAAI,CAAC,OAAO,EAAE,gBAA4B,IAAI,CAAC,OAAO,EAAE,gBAA+B,aAAa,CAAC,OAAO;QACrJ,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED,IAAW,SAAS,KAAc,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,IAAI,CAAC,aAAa,KAAK,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;IAClK,IAAW,WAAW,KAAc,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAE7D,0EAA0E;IACnE,MAAM,CAAC,KAAc,IAAa,OAAO,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE5E;;;OAGG;IACI,OAAO,CAAC,GAAY;QACzB,IAAI,IAAI,KAAK,GAAG;YACd,OAAO,CAAC,CAAC;QAEX,IAAI,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,GAAG,EAAE;YACb,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;YACpD,IAAI,CAAC,KAAK,GAAG,EAAE;gBACb,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;aAC7D;SACF;QAED,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAeD,gBAAgB;AAChB,MAAM,KAAW,YAAY,CAqB5B;AArBD,WAAiB,YAAY;IAC3B,SAAgB,MAAM;QACpB,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,SAAS,EAAE,IAAI,CAAC,OAAO;YACvB,aAAa,EAAE,IAAI,CAAC,OAAO;YAC3B,aAAa,EAAE,aAAa,CAAC,OAAO;SACrC,CAAC;IACJ,CAAC;IAPe,mBAAM,SAOrB,CAAA;IAED,SAAgB,SAAS,CAAC,OAAqB;QAC7C,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,OAAO,CAAC,aAAa,KAAK,aAAa,CAAC,OAAO,CAAC;IAC7K,CAAC;IAFe,sBAAS,YAExB,CAAA;IAED,SAAgB,MAAM,CAAC,MAAqB,EAAE,MAAoB,EAAE,eAA4B;QAC9F,MAAM,CAAC,OAAO,GAAG,eAAe,IAAI,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC9E,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC/D,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACvE,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,aAAa,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IANe,mBAAM,SAMrB,CAAA;AACH,CAAC,EArBgB,YAAY,KAAZ,YAAY,QAqB5B;AAgBD,gBAAgB;AAChB,MAAM,KAAW,aAAa,CAiB7B;AAjBD,WAAiB,aAAa;IAC5B,SAAgB,MAAM;QACpB,MAAM,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACpC,OAAO;YACL,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE;YACpB,SAAS,EAAE,EAAE,GAAG,IAAI,EAAE;YACtB,aAAa,EAAE,EAAE,GAAG,IAAI,EAAE;YAC1B,aAAa,EAAE,aAAa,CAAC,OAAO;YACpC,eAAe,EAAE,CAAC;SACnB,CAAC;IACJ,CAAC;IATe,oBAAM,SASrB,CAAA;IAED,SAAgB,eAAe;QAC7B,MAAM,MAAM,GAAG,MAAM,EAA4B,CAAC;QAClD,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;QACjB,OAAO,MAAM,CAAC;IAChB,CAAC;IAJe,6BAAe,kBAI9B,CAAA;AACH,CAAC,EAjBgB,aAAa,KAAb,aAAa,QAiB7B;AAED;;;;;GAKG;AACH,MAAM,CAAN,IAAY,SAeX;AAfD,WAAY,SAAS;IACnB,4EAA4E;IAC5E,+CAAO,CAAA;IACP;;;;OAIG;IACH,iEAAgB,CAAA;IAChB;;;;OAIG;IACH,iEAAgB,CAAA;AAClB,CAAC,EAfW,SAAS,KAAT,SAAS,QAepB;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,YAAa,SAAQ,QAAiB;IAIjD,uCAAuC;IACvC,YAAmB,WAAmB,EAAE,UAAsB,IAAI,CAAC,OAAO,EAAE,OAAkB,SAAS,CAAC,OAAO;QAC7G,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;QACnD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,gFAAgF;IAChF,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IAC9D,gBAAgB;IAChB,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACrH,0EAA0E;IAC1E,IAAW,SAAS,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7D,gHAAgH;IAChH,IAAW,OAAO,KAA0B,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC1G,oGAAoG;IACpG,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7F,oGAAoG;IACpG,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAE7F,0GAA0G;IACnG,WAAW,CAAC,KAAa;QAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAC7B,IAAI,KAAK,CAAC,KAAK,KAAK,KAAK;gBACvB,OAAO,KAAK,CAAC,KAAK,CAAC;QAEvB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,gBAAgB;IACT,eAAe,CAAC,OAAgB,EAAE,KAAa;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvC,MAAM,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACrB,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,YAAY,CAAU,OAAO,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED,gBAAgB;IACT,QAAQ,KAAmC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;CACxE;AAoCD,MAAM,oBAAoB,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC;AAEpD;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IAS7B,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IACjE,IAAW,gBAAgB,KAAmE,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;IAE9H;;;OAGG;IACH,YAAmB,IAAiB,EAAE,OAAmB,EAAE,WAAmB,EAAE,IAAe,EAAE,gBAAyD;QACxJ,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC;QAC5B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QACpD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,iBAAiB,GAAG,gBAAgB,CAAC;QAE1C,QAAQ,IAAI,CAAC,WAAW,EAAE;YACxB,KAAK,CAAC;gBACJ,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;gBACxB,MAAM;YACR,KAAK,CAAC;gBACJ,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACpF,MAAM;YACR;gBACE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;gBACvB,MAAM;SACT;QAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,oBAAoB,CAAC,CAAC;QACvD,MAAM,CAAC,SAAS,KAAK,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC;IACrG,CAAC;IAED,6DAA6D;IACtD,MAAM,CAAC,IAAI,CAAC,YAA0B;QAC3C,4GAA4G;QAC5G,mDAAmD;QACnD,wIAAwI;QACxI,6DAA6D;QAC7D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;QAChD,KAAK,MAAM,EAAE,IAAI,YAAY,CAAC,QAAQ,EAAE,EAAE;YACxC,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC;YACnE,IAAI,SAAS,KAAK,KAAK;gBACrB,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;SACjE;QAED,iFAAiF;QACjF,MAAM,mBAAmB,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QACpD,MAAM,QAAQ,GAAG,mBAAmB,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC;QAC9D,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;QAE1C,KAAK,MAAM,EAAE,IAAI,YAAY,CAAC,QAAQ,EAAE,EAAE;YACxC,MAAM,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;YACzB,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC;YAE3B,IAAI,gBAAgB,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,CAAE,CAAC;YACjE,MAAM,CAAC,SAAS,KAAK,gBAAgB,CAAC,CAAC,CAAC,0BAA0B;YAClE,gBAAgB,IAAI,CAAC,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC,CAAC;YAElD,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC5D,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC5D,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,gBAAgB,CAAC;SACvC;QAED,aAAa,CAAC,OAAO,CAAC,CAAC,KAAa,EAAE,EAAU,EAAE,IAAI,EAAE,EAAE;YACxD,MAAM,OAAO,GAAG,mBAAmB,GAAG,CAAC,GAAG,KAAK,CAAC;YAChD,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;YAC/C,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,kBAAkB,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;IACvG,CAAC;IAED,gEAAgE;IACzD,UAAU,CAAC,YAAoB,EAAE,MAAoB;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,oBAAoB,CAAC,CAAC;QACzE,OAAO,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IAChE,CAAC;IAED,0GAA0G;IACnG,WAAW,CAAC,YAAoB,EAAE,MAAoB;QAC3D,OAAO,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7F,CAAC;IAED,gBAAgB;IACT,gBAAgB,CAAC,YAAoB,EAAE,GAAqB;QACjE,GAAG,GAAG,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACpC,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC;QAChC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC/B,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,gBAAgB;IACT,oBAAoB,CAAC,YAAoB;QAC9C,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,CAAC;QAC/B,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACxC,WAAW,GAAG,CAAC,WAAW,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC/C,WAAW,GAAG,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC;QAC1D,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC;IAChF,CAAC;IAED,gBAAgB;IACT,kBAAkB,CAAC,YAAoB;QAC5C,OAAO,SAAS,KAAK,IAAI,CAAC,iBAAiB,IAAI,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5H,CAAC;IAED,gBAAgB;IACT,gBAAgB,CAAC,YAAoB,EAAE,MAAqB;QACjE,MAAM,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QAExC,MAAM,OAAO,GAAG,CAAC,GAAG,YAAY,CAAC;QACjC,MAAM,CAAC,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC7C,MAAM,CAAC,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QAEjD,MAAM,mBAAmB,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,aAAa,GAAG,CAAC,mBAAmB,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;QAE3D,IAAI,WAAW,GAAG,CAAC,mBAAmB,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3D,WAAW,GAAG,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC;QAC1D,MAAM,CAAC,aAAa,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QACrD,MAAM,CAAC,aAAa,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;QAEzD,MAAM,CAAC,eAAe,GAAG,IAAI,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC;QAC/D,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;QACnD,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;QAEnD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,4HAA4H;IACrH,aAAa,CAAC,YAAoB;QACvC,IAAI,YAAY,IAAI,IAAI,CAAC,WAAW;YAClC,OAAO,SAAS,CAAC;;YAEjB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;IACzC,CAAC;IAED,4DAA4D;IAC5D,IAAW,SAAS,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAElE,2DAA2D;IACpD,UAAU,CAAC,MAAoB;QACpC,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACjE,CAAC;IAED,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7F,IAAW,kBAAkB,KAAc,OAAO,SAAS,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7F,IAAW,YAAY,KAAc,OAAO,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;IAEjG,mDAAmD;IAC5C,MAAM;QACX,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACpE,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC5B,KAAK,CAAC,eAAe,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;SACxG;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IACM,wBAAwB,CAAC,aAA4B,EAAE,SAAiB;QAC7E,MAAM,CAAC,SAAS,KAAK,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC7C,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAEtB,MAAM,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACpC,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;QAC9B,MAAM,OAAO,GAAG,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;QACjI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC/B,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK,MAAM,EAAE;gBAChB,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;gBACpB,SAAS,GAAG,IAAI,CAAC;aAClB;SACF;QAED,IAAI,SAAS;YACX,IAAI,CAAC,iBAAiB,GAAG,OAAO,CAAC;IACrC,CAAC;IAEM,CAAE,QAAQ,CAAC,MAA8B;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;YACjB,MAAM,MAAM,CAAC;SACd;IACH,CAAC;IAEM,QAAQ,CAAC,MAA8B;QAC5C,OAAO;YACL,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;SAC/C,CAAC;IACJ,CAAC;IAED,IAAY,oBAAoB,KAAa,OAAO,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC;IAEnE,MAAM,CAAC,QAAgB;QAC7B,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7E,CAAC;CACF;AAQD,MAAM,8BAA8B,GAAG,EAAE,gBAAgB,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC;AAE1F;;;;;;;;;GASG;AACH,MAAM,OAAO,uBAAuB;IAGlC,YAAmB,IAAiB;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,yCAAyC;IACzC,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC;IAC/B,CAAC;IAEO,mBAAmB,CAAC,UAAkB;QAC5C,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IAEM,QAAQ,CAAC,UAAkB,EAAG,MAA+B;QAClE,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,EAAE;YAC7B,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC;YACpC,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC;YAClD,OAAO,MAAM,CAAC;SACf;QAED,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;QAC7B,MAAM,CAAC,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACvC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,uIAAuI;IAChI,cAAc,CAAC,YAAoB,EAAE,MAAwB;QAClE,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;;YAEhC,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;QAElC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,OAAO,KAAK,GAAG,CAAC,EAAE;YAChB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACnC,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC;YACzB,MAAM,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;YACvD,IAAI,YAAY,GAAG,gBAAgB,EAAE;gBACnC,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;gBAChB,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC;aACnB;iBAAM;gBACL,KAAK,GAAG,IAAI,CAAC;aACd;SACF;QAED,IAAI,KAAK,GAAG,IAAI,EAAE;YAChB,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;SAC1C;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,4BAA4B;IAIvC,YAAmB,QAA4B,EAAE,MAA+B;QAC9E,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,IAAiB,EAAE,YAAwB,EAAE,WAAmB,EAAE,IAAe,EAAE,gBAAwB;QAC9H,MAAM,gBAAgB,GAAG,CAAC,GAAG,WAAW,GAAG,CAAC,GAAG,gBAAgB,CAAC;QAChE,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,kBAAkB,CAAC,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;QAEtF,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,uBAAuB,CAAC,SAAS,CAAC,CAAC;QAEtD,OAAO,IAAI,4BAA4B,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC5D,CAAC;IAED,IAAW,YAAY,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC;IACjE,IAAW,gBAAgB,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACzE,IAAW,WAAW,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC;IAC/D,IAAW,IAAI,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IAEjD,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;IAC7D,CAAC;IAEM,gBAAgB,CAAC,YAAoB,EAAE,MAAqB;QACjE,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,YAAY,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;QAC1D,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,UAAU,CAAC,YAAoB,EAAE,MAAoB;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,oBAAoB,CAAC,CAAC;QACzE,OAAO,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7C,CAAC;IAEM,WAAW,CAAC,YAAoB,EAAE,MAAoB;QAC3D,OAAO,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7F,CAAC;IAEM,gBAAgB,CAAC,YAAoB,EAAE,GAAoB;QAChE,OAAO,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;IAC5D,CAAC;IAEM,aAAa,CAAC,YAAoB;QACvC,OAAO,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;IACpD,CAAC;IAEM,CAAE,QAAQ,CAAC,MAA8B;QAC9C,uJAAuJ;QACvJ,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,8BAA8B,CAAC,CAAC;QAErF,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,IAAI,CAAC,WAAW,EAAE,YAAY,EAAE,EAAE;YAC1E,IAAI,YAAY,GAAG,UAAU,CAAC,gBAAgB;gBAC5C,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;YAElD,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;YACtD,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC;YAC1C,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC;YAC1C,MAAM,CAAC,KAAK,GAAG,YAAY,CAAC;YAC5B,MAAM,MAAM,CAAC;SACd;IACH,CAAC;IAEM,QAAQ,CAAC,MAA8B;QAC5C,OAAO;YACL,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;SAC/C,CAAC;IACJ,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Rendering\r\n */\r\n\r\nimport { assert, compareNumbers, compareStrings, Id64, Id64String, IndexedValue, IndexMap } from \"@itwin/core-bentley\";\r\nimport { GeometryClass } from \"./GeometryParams\";\r\n\r\n/** Describes a discrete entity within a batched [RenderGraphic]($frontend) that can be\r\n * grouped with other such entities in a [[FeatureTable]].\r\n * Features roughly correlate to elements: a [Tile]($frontend)'s graphics combines geometry from every\r\n * [GeometricElement]($backend) that intersects the tile's volume, so each element produces at least one feature.\r\n * However, an element's geometry stream can contain geometry belonging to multiple different combinations of [SubCategory]($backend) and\r\n * [[GeometryClass]], so an individual element may produce more than one feature.\r\n * @see [[FeatureOverrides]] for customizing the appearance of individual features.\r\n * @public\r\n */\r\nexport class Feature {\r\n  public readonly elementId: Id64String;\r\n  public readonly subCategoryId: Id64String;\r\n  public readonly geometryClass: GeometryClass;\r\n\r\n  public constructor(elementId: Id64String = Id64.invalid, subCategoryId: Id64String = Id64.invalid, geometryClass: GeometryClass = GeometryClass.Primary) {\r\n    this.elementId = elementId;\r\n    this.subCategoryId = subCategoryId;\r\n    this.geometryClass = geometryClass;\r\n  }\r\n\r\n  public get isDefined(): boolean { return !Id64.isInvalid(this.elementId) || !Id64.isInvalid(this.subCategoryId) || this.geometryClass !== GeometryClass.Primary; }\r\n  public get isUndefined(): boolean { return !this.isDefined; }\r\n\r\n  /** Returns true if this feature is equivalent to the supplied feature. */\r\n  public equals(other: Feature): boolean { return 0 === this.compare(other); }\r\n\r\n  /** Performs ordinal comparison of this feature with another.\r\n   * @param rhs The feature to compare with.\r\n   * @returns zero if the features are equivalent, a negative value if this feature compares as \"less than\" `rhs`, or a positive value if this feature compares \"greater than\" `rhs`.\r\n   */\r\n  public compare(rhs: Feature): number {\r\n    if (this === rhs)\r\n      return 0;\r\n\r\n    let cmp = compareNumbers(this.geometryClass, rhs.geometryClass);\r\n    if (0 === cmp) {\r\n      cmp = compareStrings(this.elementId, rhs.elementId);\r\n      if (0 === cmp) {\r\n        cmp = compareStrings(this.subCategoryId, rhs.subCategoryId);\r\n      }\r\n    }\r\n\r\n    return cmp;\r\n  }\r\n}\r\n\r\n/** A [[Feature]] with a modelId identifying the model containing the feature.\r\n * Typically produced from a PackedFeature.\r\n * Prior to the introduction of MultiModelPackedFeatureTable, every (Packed)FeatureTable was associated with exactly one model.\r\n * Now, each feature in a table may be associated with a different model.\r\n * @internal\r\n */\r\nexport interface ModelFeature {\r\n  modelId: Id64String;\r\n  elementId: Id64String;\r\n  subCategoryId: Id64String;\r\n  geometryClass: GeometryClass;\r\n}\r\n\r\n/** @internal */\r\nexport namespace ModelFeature {\r\n  export function create(): ModelFeature {\r\n    return {\r\n      modelId: Id64.invalid,\r\n      elementId: Id64.invalid,\r\n      subCategoryId: Id64.invalid,\r\n      geometryClass: GeometryClass.Primary,\r\n    };\r\n  }\r\n\r\n  export function isDefined(feature: ModelFeature): boolean {\r\n    return !Id64.isInvalid(feature.modelId) || !Id64.isInvalid(feature.elementId) || !Id64.isInvalid(feature.subCategoryId) || feature.geometryClass !== GeometryClass.Primary;\r\n  }\r\n\r\n  export function unpack(packed: PackedFeature, result: ModelFeature, unpackedModelId?: Id64String): ModelFeature {\r\n    result.modelId = unpackedModelId ?? Id64.fromUint32PairObject(packed.modelId);\r\n    result.elementId = Id64.fromUint32PairObject(packed.elementId);\r\n    result.subCategoryId = Id64.fromUint32PairObject(packed.subCategoryId);\r\n    result.geometryClass = packed.geometryClass;\r\n    return result;\r\n  }\r\n}\r\n\r\n/** @internal */\r\nexport interface PackedFeature {\r\n  modelId: Id64.Uint32Pair;\r\n  elementId: Id64.Uint32Pair;\r\n  subCategoryId: Id64.Uint32Pair;\r\n  geometryClass: GeometryClass;\r\n  animationNodeId: number;\r\n}\r\n\r\n/** @internal */\r\nexport interface PackedFeatureWithIndex extends PackedFeature {\r\n  index: number;\r\n}\r\n\r\n/** @internal */\r\nexport namespace PackedFeature {\r\n  export function create(): PackedFeature {\r\n    const pair = { upper: 0, lower: 0 };\r\n    return {\r\n      modelId: { ...pair },\r\n      elementId: { ...pair },\r\n      subCategoryId: { ...pair },\r\n      geometryClass: GeometryClass.Primary,\r\n      animationNodeId: 0,\r\n    };\r\n  }\r\n\r\n  export function createWithIndex(): PackedFeatureWithIndex {\r\n    const result = create() as PackedFeatureWithIndex;\r\n    result.index = 0;\r\n    return result;\r\n  }\r\n}\r\n\r\n/** Describes the type of a 'batch' of graphics representing multiple [[Feature]]s.\r\n * The most commonly-encountered batches are Tiles, which can be of either Primary or\r\n * Classifier type.\r\n * @public\r\n * @extensions\r\n */\r\nexport enum BatchType {\r\n  /** This batch contains graphics derived from a model's visible geometry. */\r\n  Primary,\r\n  /**\r\n   * This batch contains color volumes which are used to classify a model's visible geometry.\r\n   * The graphics themselves are not rendered to the screen; instead they are rendered to the stencil buffer\r\n   * to resymbolize the primary geometry.\r\n   */\r\n  VolumeClassifier,\r\n  /**\r\n   * This batch contains planar graphics which are used to classify a model's visible geometry.\r\n   * The graphics themselves are not rendered to the screen; instead they are rendered to a texture buffer\r\n   * to resymbolize the primary geometry.\r\n   */\r\n  PlanarClassifier,\r\n}\r\n\r\n/** Defines a look-up table for [[Feature]]s within a batched [RenderGraphic]($frontend). Consecutive 32-bit\r\n * indices are assigned to each unique Feature. Primitives within the RenderGraphic can\r\n * use per-vertex indices to specify the distribution of Features within the primitive. The appearance of individual\r\n * features can be customized using [[FeatureOverrides]]. Typically a [Tile]($frontend) will contain a feature table\r\n * identifying the elements whose geometry appears within that tile.\r\n * @see [[FeatureOverrides]] for customizing the appearance of individual features.\r\n * @public\r\n */\r\nexport class FeatureTable extends IndexMap<Feature> {\r\n  public readonly modelId: Id64String;\r\n  public readonly type: BatchType;\r\n\r\n  /** Construct an empty FeatureTable. */\r\n  public constructor(maxFeatures: number, modelId: Id64String = Id64.invalid, type: BatchType = BatchType.Primary) {\r\n    super((lhs, rhs) => lhs.compare(rhs), maxFeatures);\r\n    this.modelId = modelId;\r\n    this.type = type;\r\n  }\r\n\r\n  /** Returns the maximum number of [[Feature]]s this FeatureTable can contain. */\r\n  public get maxFeatures(): number { return this._maximumSize; }\r\n  /** @internal */\r\n  public get anyDefined(): boolean { return this.length > 1 || (1 === this.length && this._array[0].value.isDefined); }\r\n  /** Returns true if this FeatureTable contains exactly one [[Feature]]. */\r\n  public get isUniform(): boolean { return 1 === this.length; }\r\n  /** If this FeatureTable contains exactly one [[Feature]], returns that Feature; otherwise returns undefined. */\r\n  public get uniform(): Feature | undefined { return 1 === this.length ? this._array[0].value : undefined; }\r\n  /** Returns true if this FeatureTable is associated with [[BatchType.VolumeClassifier]] geometry. */\r\n  public get isVolumeClassifier(): boolean { return BatchType.VolumeClassifier === this.type; }\r\n  /** Returns true if this FeatureTable is associated with [[BatchType.PlanarClassifier]] geometry. */\r\n  public get isPlanarClassifier(): boolean { return BatchType.PlanarClassifier === this.type; }\r\n\r\n  /** Returns the Feature corresponding to the specified index, or undefined if the index is not present. */\r\n  public findFeature(index: number): Feature | undefined {\r\n    for (const entry of this._array)\r\n      if (entry.index === index)\r\n        return entry.value;\r\n\r\n    return undefined;\r\n  }\r\n\r\n  /** @internal */\r\n  public insertWithIndex(feature: Feature, index: number): void {\r\n    const bound = this.lowerBound(feature);\r\n    assert(!bound.equal);\r\n    assert(!this.isFull);\r\n    const entry = new IndexedValue<Feature>(feature, index);\r\n    this._array.splice(bound.index, 0, entry);\r\n  }\r\n\r\n  /** @internal */\r\n  public getArray(): Array<IndexedValue<Feature>> { return this._array; }\r\n}\r\n\r\n/** @alpha */\r\nexport type ComputeNodeId = (elementId: Id64.Uint32Pair, featureIndex: number) => number;\r\n\r\n/** Interface common to PackedFeatureTable and MultiModelPackedFeatureTable.\r\n * @internal\r\n */\r\nexport interface RenderFeatureTable {\r\n  /** The \"model Id\" of the tile tree containing the tile from which this feature table originated.\r\n   * It may be a transient Id if, for example, the tile tree represents a reality model or represents the geometry of multiple\r\n   * persistent models batched together.\r\n   */\r\n  readonly batchModelId: Id64String;\r\n  /** Split representation of batchModelId, so we're not constantly having to parse the string. */\r\n  readonly batchModelIdPair: Id64.Uint32Pair;\r\n  /** The number of features in the table; equivalently, one more than the largest feature index. */\r\n  readonly numFeatures: number;\r\n  /** Strictly for reporting memory usage. */\r\n  readonly byteLength: number;\r\n  readonly type: BatchType;\r\n\r\n  /** Get the feature at the specified index. Caller is responsible for validating featureIndex less than numFeatures. */\r\n  getFeature(featureIndex: number, result: ModelFeature): ModelFeature;\r\n  /** Find the specified feature. Returns undefined if featureIndex >= numFeatures. */\r\n  findFeature(featureIndex: number, result: ModelFeature): ModelFeature | undefined;\r\n  /** Find the Id of the element of the specified feature. */\r\n  findElementId(featureIndex: number): Id64String | undefined;\r\n  /** Get the Id of the element of the specified feature as a pair of 32-bit integers, asserting that feature index < numFeatures. */\r\n  getElementIdPair(featureIndex: number, out: Id64.Uint32Pair): Id64.Uint32Pair;\r\n  /** Get the feature at the specified index. Caller is responsible for validating featureIndex less than numFeatures. */\r\n  getPackedFeature(featureIndex: number, result: PackedFeature): PackedFeature;\r\n  /** Get an object that provides iteration over all features, in order. `output` is reused as the current value on each iteration. */\r\n  iterable(output: PackedFeatureWithIndex): Iterable<PackedFeatureWithIndex>;\r\n}\r\n\r\nconst scratchPackedFeature = PackedFeature.create();\r\n\r\n/**\r\n * An immutable, packed representation of a [[FeatureTable]]. The features are packed into a single array of 32-bit integer values,\r\n * wherein each feature occupies 3 32-bit integers.\r\n * @internal\r\n */\r\nexport class PackedFeatureTable implements RenderFeatureTable {\r\n  private readonly _data: Uint32Array;\r\n  public readonly batchModelId: Id64String;\r\n  public readonly batchModelIdPair: Id64.Uint32Pair;\r\n  public readonly numFeatures: number;\r\n  public readonly anyDefined: boolean;\r\n  public readonly type: BatchType;\r\n  private _animationNodeIds?: Uint8Array | Uint16Array | Uint32Array;\r\n\r\n  public get byteLength(): number { return this._data.byteLength; }\r\n  public get animationNodeIds(): Readonly<Uint8Array | Uint16Array | Uint32Array> | undefined { return this._animationNodeIds; }\r\n\r\n  /** Construct a PackedFeatureTable from the packed binary data.\r\n   * This is used internally when deserializing Tiles in iMdl format.\r\n   * @internal\r\n   */\r\n  public constructor(data: Uint32Array, modelId: Id64String, numFeatures: number, type: BatchType, animationNodeIds?: Uint8Array | Uint16Array | Uint32Array) {\r\n    this._data = data;\r\n    this.batchModelId = modelId;\r\n    this.batchModelIdPair = Id64.getUint32Pair(modelId);\r\n    this.numFeatures = numFeatures;\r\n    this.type = type;\r\n    this._animationNodeIds = animationNodeIds;\r\n\r\n    switch (this.numFeatures) {\r\n      case 0:\r\n        this.anyDefined = false;\r\n        break;\r\n      case 1:\r\n        this.anyDefined = ModelFeature.isDefined(this.getFeature(0, ModelFeature.create()));\r\n        break;\r\n      default:\r\n        this.anyDefined = true;\r\n        break;\r\n    }\r\n\r\n    assert(this._data.length >= this._subCategoriesOffset);\r\n    assert(undefined === this._animationNodeIds || this._animationNodeIds.length === this.numFeatures);\r\n  }\r\n\r\n  /** Create a packed feature table from a [[FeatureTable]]. */\r\n  public static pack(featureTable: FeatureTable): PackedFeatureTable {\r\n    // We must determine how many subcategories we have ahead of time to compute the size of the Uint32Array, as\r\n    // the array cannot be resized after it is created.\r\n    // We are not too worried about this as FeatureTables created on the front-end will contain few if any features; those obtained from the\r\n    // back-end arrive within tiles already in the packed format.\r\n    const subcategories = new Map<string, number>();\r\n    for (const iv of featureTable.getArray()) {\r\n      const found = subcategories.get(iv.value.subCategoryId.toString());\r\n      if (undefined === found)\r\n        subcategories.set(iv.value.subCategoryId, subcategories.size);\r\n    }\r\n\r\n    // We need 3 32-bit integers per feature, plus 2 32-bit integers per subcategory.\r\n    const subCategoriesOffset = 3 * featureTable.length;\r\n    const nUint32s = subCategoriesOffset + 2 * subcategories.size;\r\n    const uint32s = new Uint32Array(nUint32s);\r\n\r\n    for (const iv of featureTable.getArray()) {\r\n      const feature = iv.value;\r\n      const index = iv.index * 3;\r\n\r\n      let subCategoryIndex = subcategories.get(feature.subCategoryId)!;\r\n      assert(undefined !== subCategoryIndex); // we inserted it above...\r\n      subCategoryIndex |= (feature.geometryClass << 24);\r\n\r\n      uint32s[index + 0] = Id64.getLowerUint32(feature.elementId);\r\n      uint32s[index + 1] = Id64.getUpperUint32(feature.elementId);\r\n      uint32s[index + 2] = subCategoryIndex;\r\n    }\r\n\r\n    subcategories.forEach((index: number, id: string, _map) => {\r\n      const index32 = subCategoriesOffset + 2 * index;\r\n      uint32s[index32 + 0] = Id64.getLowerUint32(id);\r\n      uint32s[index32 + 1] = Id64.getUpperUint32(id);\r\n    });\r\n\r\n    return new PackedFeatureTable(uint32s, featureTable.modelId, featureTable.length, featureTable.type);\r\n  }\r\n\r\n  /** Retrieve the Feature associated with the specified index. */\r\n  public getFeature(featureIndex: number, result: ModelFeature): ModelFeature {\r\n    const packed = this.getPackedFeature(featureIndex, scratchPackedFeature);\r\n    return ModelFeature.unpack(packed, result, this.batchModelId);\r\n  }\r\n\r\n  /** Returns the Feature associated with the specified index, or undefined if the index is out of range. */\r\n  public findFeature(featureIndex: number, result: ModelFeature): ModelFeature | undefined {\r\n    return featureIndex < this.numFeatures ? this.getFeature(featureIndex, result) : undefined;\r\n  }\r\n\r\n  /** @internal */\r\n  public getElementIdPair(featureIndex: number, out?: Id64.Uint32Pair): Id64.Uint32Pair {\r\n    out = out ?? { lower: 0, upper: 0 };\r\n    assert(featureIndex < this.numFeatures);\r\n    const offset = 3 * featureIndex;\r\n    out.lower = this._data[offset];\r\n    out.upper = this._data[offset + 1];\r\n    return out;\r\n  }\r\n\r\n  /** @internal */\r\n  public getSubCategoryIdPair(featureIndex: number): Id64.Uint32Pair {\r\n    const index = 3 * featureIndex;\r\n    let subCatIndex = this._data[index + 2];\r\n    subCatIndex = (subCatIndex & 0x00ffffff) >>> 0;\r\n    subCatIndex = subCatIndex * 2 + this._subCategoriesOffset;\r\n    return { lower: this._data[subCatIndex], upper: this._data[subCatIndex + 1] };\r\n  }\r\n\r\n  /** @internal */\r\n  public getAnimationNodeId(featureIndex: number): number {\r\n    return undefined !== this._animationNodeIds && featureIndex < this.numFeatures ? this._animationNodeIds[featureIndex] : 0;\r\n  }\r\n\r\n  /** @internal */\r\n  public getPackedFeature(featureIndex: number, result: PackedFeature): PackedFeature {\r\n    assert(featureIndex < this.numFeatures);\r\n\r\n    const index32 = 3 * featureIndex;\r\n    result.elementId.lower = this._data[index32];\r\n    result.elementId.upper = this._data[index32 + 1];\r\n\r\n    const subCatIndexAndClass = this._data[index32 + 2];\r\n    result.geometryClass = (subCatIndexAndClass >>> 24) & 0xff;\r\n\r\n    let subCatIndex = (subCatIndexAndClass & 0x00ffffff) >>> 0;\r\n    subCatIndex = subCatIndex * 2 + this._subCategoriesOffset;\r\n    result.subCategoryId.lower = this._data[subCatIndex];\r\n    result.subCategoryId.upper = this._data[subCatIndex + 1];\r\n\r\n    result.animationNodeId = this.getAnimationNodeId(featureIndex);\r\n    result.modelId.lower = this.batchModelIdPair.lower;\r\n    result.modelId.upper = this.batchModelIdPair.upper;\r\n\r\n    return result;\r\n  }\r\n\r\n  /** Returns the element ID of the Feature associated with the specified index, or undefined if the index is out of range. */\r\n  public findElementId(featureIndex: number): Id64String | undefined {\r\n    if (featureIndex >= this.numFeatures)\r\n      return undefined;\r\n    else\r\n      return this.readId(3 * featureIndex);\r\n  }\r\n\r\n  /** Return true if this table contains exactly 1 feature. */\r\n  public get isUniform(): boolean { return 1 === this.numFeatures; }\r\n\r\n  /** If this table contains exactly 1 feature, return it. */\r\n  public getUniform(result: ModelFeature): ModelFeature | undefined {\r\n    return this.isUniform ? this.getFeature(0, result) : undefined;\r\n  }\r\n\r\n  public get isVolumeClassifier(): boolean { return BatchType.VolumeClassifier === this.type; }\r\n  public get isPlanarClassifier(): boolean { return BatchType.VolumeClassifier === this.type; }\r\n  public get isClassifier(): boolean { return this.isVolumeClassifier || this.isPlanarClassifier; }\r\n\r\n  /** Unpack the features into a [[FeatureTable]]. */\r\n  public unpack(): FeatureTable {\r\n    const table = new FeatureTable(this.numFeatures, this.batchModelId);\r\n    const feature = ModelFeature.create();\r\n    for (let i = 0; i < this.numFeatures; i++) {\r\n      this.getFeature(i, feature);\r\n      table.insertWithIndex(new Feature(feature.elementId, feature.subCategoryId, feature.geometryClass), i);\r\n    }\r\n\r\n    return table;\r\n  }\r\n  public populateAnimationNodeIds(computeNodeId: ComputeNodeId, maxNodeId: number): void {\r\n    assert(undefined === this._animationNodeIds);\r\n    assert(maxNodeId > 0);\r\n\r\n    const pair = { lower: 0, upper: 0 };\r\n    let haveNodes = false;\r\n    const size = this.numFeatures;\r\n    const nodeIds = maxNodeId < 0x100 ? new Uint8Array(size) : (maxNodeId < 0x10000 ? new Uint16Array(size) : new Uint32Array(size));\r\n    for (let i = 0; i < this.numFeatures; i++) {\r\n      this.getElementIdPair(i, pair);\r\n      const nodeId = computeNodeId(pair, i);\r\n      assert(nodeId <= maxNodeId);\r\n      if (0 !== nodeId) {\r\n        nodeIds[i] = nodeId;\r\n        haveNodes = true;\r\n      }\r\n    }\r\n\r\n    if (haveNodes)\r\n      this._animationNodeIds = nodeIds;\r\n  }\r\n\r\n  public * iterator(output: PackedFeatureWithIndex): Iterator<PackedFeatureWithIndex> {\r\n    for (let i = 0; i < this.numFeatures; i++) {\r\n      this.getPackedFeature(i, output);\r\n      output.index = i;\r\n      yield output;\r\n    }\r\n  }\r\n\r\n  public iterable(output: PackedFeatureWithIndex): Iterable<PackedFeatureWithIndex> {\r\n    return {\r\n      [Symbol.iterator]: () => this.iterator(output),\r\n    };\r\n  }\r\n\r\n  private get _subCategoriesOffset(): number { return this.numFeatures * 3; }\r\n\r\n  private readId(offset32: number): Id64String {\r\n    return Id64.fromUint32Pair(this._data[offset32], this._data[offset32 + 1]);\r\n  }\r\n}\r\n\r\ninterface PackedFeatureModelEntry {\r\n  lastFeatureIndex: number;\r\n  idLower: number;\r\n  idUpper: number;\r\n}\r\n\r\nconst scratchPackedFeatureModelEntry = { lastFeatureIndex: -1, idLower: -1, idUpper: -1 };\r\n\r\n/** A table of model Ids associated with a [[MultiModelPackedFeatureTable]].\r\n * The feature indices in the packed feature table are grouped together by model, such that the first N features belong to model 1, the next M features to model 2, and so on.\r\n * The model table itself consists of one entry per model, where each entry looks like:\r\n *  indexOfLastFeatureInModel: u32\r\n *  modelId: u64\r\n * The modelId associated with a feature can therefore be derived by finding the entry in the model table with the highest indexOfLastFeatureInModel no greater than the feature index.\r\n * This lookup can be optimized using binary search.\r\n * Moreover, while iterating the feature table in sequence, the model table can be iterated in parallel so that no per-feature lookup of model Id is required.\r\n * @internal\r\n */\r\nexport class PackedFeatureModelTable {\r\n  private readonly _data: Uint32Array;\r\n\r\n  public constructor(data: Uint32Array) {\r\n    this._data = data;\r\n    assert(this._data.length % 3 === 0);\r\n  }\r\n\r\n  /** The number of models in the table. */\r\n  public get length(): number {\r\n    return this._data.length / 3;\r\n  }\r\n\r\n  public get byteLength(): number {\r\n    return this._data.byteLength;\r\n  }\r\n\r\n  private getLastFeatureIndex(modelIndex: number): number {\r\n    return this._data[modelIndex * 3];\r\n  }\r\n\r\n  public getEntry(modelIndex: number,  result: PackedFeatureModelEntry): PackedFeatureModelEntry {\r\n    if (modelIndex >= this.length) {\r\n      result.idLower = result.idUpper = 0;\r\n      result.lastFeatureIndex = Number.MAX_SAFE_INTEGER;\r\n      return result;\r\n    }\r\n\r\n    const index = modelIndex * 3;\r\n    result.lastFeatureIndex = this._data[index + 0];\r\n    result.idLower = this._data[index + 1];\r\n    result.idUpper = this._data[index + 2];\r\n    return result;\r\n  }\r\n\r\n  /** Get the Id of the model associated with the specified feature, or an invalid Id if the feature is not associated with any model. */\r\n  public getModelIdPair(featureIndex: number, result?: Id64.Uint32Pair): Id64.Uint32Pair {\r\n    if (!result)\r\n      result = { lower: 0, upper: 0 };\r\n    else\r\n      result.lower = result.upper = 0;\r\n\r\n    let first = 0;\r\n    const last = this.length;\r\n    let count = last;\r\n    while (count > 0) {\r\n      const step = Math.floor(count / 2);\r\n      const mid = first + step;\r\n      const lastFeatureIndex = this.getLastFeatureIndex(mid);\r\n      if (featureIndex > lastFeatureIndex) {\r\n        first = mid + 1;\r\n        count -= step + 1;\r\n      } else {\r\n        count = step;\r\n      }\r\n    }\r\n\r\n    if (first < last) {\r\n      result.lower = this._data[first * 3 + 1];\r\n      result.upper = this._data[first * 3 + 2];\r\n    }\r\n\r\n    return result;\r\n  }\r\n}\r\n\r\n/** A PackedFeatureTable with a PackedFeatureModelTable appended to it, capable of storing features belonging to more than one model.\r\n * @internal\r\n */\r\nexport class MultiModelPackedFeatureTable implements RenderFeatureTable {\r\n  private readonly _features: PackedFeatureTable;\r\n  private readonly _models: PackedFeatureModelTable;\r\n\r\n  public constructor(features: PackedFeatureTable, models: PackedFeatureModelTable) {\r\n    this._features = features;\r\n    this._models = models;\r\n  }\r\n\r\n  public static create(data: Uint32Array, batchModelId: Id64String, numFeatures: number, type: BatchType, numSubCategories: number): MultiModelPackedFeatureTable {\r\n    const modelTableOffset = 3 * numFeatures + 2 * numSubCategories;\r\n    const featureData = data.subarray(0, modelTableOffset);\r\n    const features = new PackedFeatureTable(featureData, batchModelId, numFeatures, type);\r\n\r\n    const modelData = data.subarray(modelTableOffset);\r\n    const models = new PackedFeatureModelTable(modelData);\r\n\r\n    return new MultiModelPackedFeatureTable(features, models);\r\n  }\r\n\r\n  public get batchModelId() { return this._features.batchModelId; }\r\n  public get batchModelIdPair() { return this._features.batchModelIdPair; }\r\n  public get numFeatures() { return this._features.numFeatures; }\r\n  public get type() { return this._features.type; }\r\n\r\n  public get byteLength() {\r\n    return this._features.byteLength + this._models.byteLength;\r\n  }\r\n\r\n  public getPackedFeature(featureIndex: number, result: PackedFeature): PackedFeature {\r\n    this._features.getPackedFeature(featureIndex, result);\r\n    this._models.getModelIdPair(featureIndex, result.modelId);\r\n    return result;\r\n  }\r\n\r\n  public getFeature(featureIndex: number, result: ModelFeature): ModelFeature {\r\n    const packed = this.getPackedFeature(featureIndex, scratchPackedFeature);\r\n    return ModelFeature.unpack(packed, result);\r\n  }\r\n\r\n  public findFeature(featureIndex: number, result: ModelFeature): ModelFeature | undefined {\r\n    return featureIndex < this.numFeatures ? this.getFeature(featureIndex, result) : undefined;\r\n  }\r\n\r\n  public getElementIdPair(featureIndex: number, out: Id64.Uint32Pair): Id64.Uint32Pair {\r\n    return this._features.getElementIdPair(featureIndex, out);\r\n  }\r\n\r\n  public findElementId(featureIndex: number): Id64String | undefined {\r\n    return this._features.findElementId(featureIndex);\r\n  }\r\n\r\n  public * iterator(output: PackedFeatureWithIndex): Iterator<PackedFeatureWithIndex> {\r\n    // Rather than perform a binary search on the model table to find each feature's model Id, traverse the model table in parallel with the feature table.\r\n    let modelIndex = 0;\r\n    const modelEntry = this._models.getEntry(modelIndex, scratchPackedFeatureModelEntry);\r\n\r\n    for (let featureIndex = 0; featureIndex < this.numFeatures; featureIndex++) {\r\n      if (featureIndex > modelEntry.lastFeatureIndex)\r\n        this._models.getEntry(++modelIndex, modelEntry);\r\n\r\n      this._features.getPackedFeature(featureIndex, output);\r\n      output.modelId.lower = modelEntry.idLower;\r\n      output.modelId.upper = modelEntry.idUpper;\r\n      output.index = featureIndex;\r\n      yield output;\r\n    }\r\n  }\r\n\r\n  public iterable(output: PackedFeatureWithIndex): Iterable<PackedFeatureWithIndex> {\r\n    return {\r\n      [Symbol.iterator]: () => this.iterator(output),\r\n    };\r\n  }\r\n}\r\n"]}

package/lib/esm/Fonts.d.ts

@@ -1,52 +1,52 @@
-/** @packageDocumentation
- * @module Symbology
- */
-/** The type of a font.
- * @public
- * @extensions
- */
-export declare enum FontType {
-    TrueType = 1,
-    Rsc = 2,
-    Shx = 3
-}
-/** An iModel-local identifier for a font.
- * @public
- * @extensions
- */
-export declare type FontId = number;
-/** The properties of a Font.
- * @public
- */
-export interface FontProps {
-    /** the Id, within an iModel, of this font. */
-    id: FontId;
-    /** The type of font */
-    type: FontType;
-    /** The name of the font. */
-    name: string;
-}
-/** The properties of a FontMap
- * @public
- * @extensions
- */
-export interface FontMapProps {
-    fonts: FontProps[];
-}
-/**
- * A FontMap holds the set of font names available in an iModel.
- * Within the GeometryStream of an Element, a specific font is referenced by its FontId that is local to the iModel.
- * This class maps FontIds to FontProps.
- * @note The font map is generally established when the iModel is first created to specify the set of fonts available
- * for editors. Adding new entries requires that the schema lock be held.
- * @public
- */
-export declare class FontMap {
-    readonly fonts: Map<number, FontProps>;
-    constructor(props?: FontMapProps);
-    addFonts(fonts: FontProps[]): void;
-    toJSON(): FontMapProps;
-    /** look up a font by name or number and return its FontProps */
-    getFont(arg: string | FontId): FontProps | undefined;
-}
+/** @packageDocumentation
+ * @module Symbology
+ */
+/** The type of a font.
+ * @public
+ * @extensions
+ */
+export declare enum FontType {
+    TrueType = 1,
+    Rsc = 2,
+    Shx = 3
+}
+/** An iModel-local identifier for a font.
+ * @public
+ * @extensions
+ */
+export type FontId = number;
+/** The properties of a Font.
+ * @public
+ */
+export interface FontProps {
+    /** the Id, within an iModel, of this font. */
+    id: FontId;
+    /** The type of font */
+    type: FontType;
+    /** The name of the font. */
+    name: string;
+}
+/** The properties of a FontMap
+ * @public
+ * @extensions
+ */
+export interface FontMapProps {
+    fonts: FontProps[];
+}
+/**
+ * A FontMap holds the set of font names available in an iModel.
+ * Within the GeometryStream of an Element, a specific font is referenced by its FontId that is local to the iModel.
+ * This class maps FontIds to FontProps.
+ * @note The font map is generally established when the iModel is first created to specify the set of fonts available
+ * for editors. Adding new entries requires that the schema lock be held.
+ * @public
+ */
+export declare class FontMap {
+    readonly fonts: Map<number, FontProps>;
+    constructor(props?: FontMapProps);
+    addFonts(fonts: FontProps[]): void;
+    toJSON(): FontMapProps;
+    /** look up a font by name or number and return its FontProps */
+    getFont(arg: string | FontId): FontProps | undefined;
+}
 //# sourceMappingURL=Fonts.d.ts.map

package/lib/esm/Fonts.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Fonts.d.ts","sourceRoot":"","sources":["../../src/Fonts.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;GAGG;AACH,oBAAY,QAAQ;IAAG,QAAQ,IAAI;IAAE,GAAG,IAAI;IAAE,GAAG,IAAI;CAAE;AAEvD;;;GAGG;AACH,oBAAY,MAAM,GAAG,MAAM,CAAC;AAE5B;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,8CAA8C;IAC9C,EAAE,EAAE,MAAM,CAAC;IACX,uBAAuB;IACvB,IAAI,EAAE,QAAQ,CAAC;IACf,4BAA4B;IAC5B,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY;IAAG,KAAK,EAAE,SAAS,EAAE,CAAA;CAAE;AAEpD;;;;;;;GAOG;AACH,qBAAa,OAAO;IAClB,SAAgB,KAAK,yBAAgC;gBACzC,KAAK,CAAC,EAAE,YAAY;IAIzB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE;IAG3B,MAAM,IAAI,YAAY;IAK7B,gEAAgE;IACzD,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,SAAS;CAU5D"}
+{"version":3,"file":"Fonts.d.ts","sourceRoot":"","sources":["../../src/Fonts.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;GAGG;AACH,oBAAY,QAAQ;IAAG,QAAQ,IAAI;IAAE,GAAG,IAAI;IAAE,GAAG,IAAI;CAAE;AAEvD;;;GAGG;AACH,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC;AAE5B;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,8CAA8C;IAC9C,EAAE,EAAE,MAAM,CAAC;IACX,uBAAuB;IACvB,IAAI,EAAE,QAAQ,CAAC;IACf,4BAA4B;IAC5B,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY;IAAG,KAAK,EAAE,SAAS,EAAE,CAAA;CAAE;AAEpD;;;;;;;GAOG;AACH,qBAAa,OAAO;IAClB,SAAgB,KAAK,yBAAgC;gBACzC,KAAK,CAAC,EAAE,YAAY;IAIzB,QAAQ,CAAC,KAAK,EAAE,SAAS,EAAE;IAG3B,MAAM,IAAI,YAAY;IAK7B,gEAAgE;IACzD,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,SAAS;CAU5D"}

package/lib/esm/Fonts.js

@@ -1,50 +1,50 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Symbology
- */
-/** The type of a font.
- * @public
- * @extensions
- */
-export var FontType;
-(function (FontType) {
-    FontType[FontType["TrueType"] = 1] = "TrueType";
-    FontType[FontType["Rsc"] = 2] = "Rsc";
-    FontType[FontType["Shx"] = 3] = "Shx";
-})(FontType || (FontType = {}));
-/**
- * A FontMap holds the set of font names available in an iModel.
- * Within the GeometryStream of an Element, a specific font is referenced by its FontId that is local to the iModel.
- * This class maps FontIds to FontProps.
- * @note The font map is generally established when the iModel is first created to specify the set of fonts available
- * for editors. Adding new entries requires that the schema lock be held.
- * @public
- */
-export class FontMap {
-    constructor(props) {
-        this.fonts = new Map();
-        if (undefined !== props)
-            this.addFonts(props.fonts);
-    }
-    addFonts(fonts) {
-        fonts.forEach((font) => this.fonts.set(font.id, font));
-    }
-    toJSON() {
-        const fonts = [];
-        this.fonts.forEach((font) => fonts.push(font));
-        return { fonts };
-    }
-    /** look up a font by name or number and return its FontProps */
-    getFont(arg) {
-        if (typeof arg === "number")
-            return this.fonts.get(arg);
-        for (const font of this.fonts.values())
-            if (font.name === arg)
-                return font;
-        return undefined;
-    }
-}
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Symbology
+ */
+/** The type of a font.
+ * @public
+ * @extensions
+ */
+export var FontType;
+(function (FontType) {
+    FontType[FontType["TrueType"] = 1] = "TrueType";
+    FontType[FontType["Rsc"] = 2] = "Rsc";
+    FontType[FontType["Shx"] = 3] = "Shx";
+})(FontType || (FontType = {}));
+/**
+ * A FontMap holds the set of font names available in an iModel.
+ * Within the GeometryStream of an Element, a specific font is referenced by its FontId that is local to the iModel.
+ * This class maps FontIds to FontProps.
+ * @note The font map is generally established when the iModel is first created to specify the set of fonts available
+ * for editors. Adding new entries requires that the schema lock be held.
+ * @public
+ */
+export class FontMap {
+    constructor(props) {
+        this.fonts = new Map();
+        if (undefined !== props)
+            this.addFonts(props.fonts);
+    }
+    addFonts(fonts) {
+        fonts.forEach((font) => this.fonts.set(font.id, font));
+    }
+    toJSON() {
+        const fonts = [];
+        this.fonts.forEach((font) => fonts.push(font));
+        return { fonts };
+    }
+    /** look up a font by name or number and return its FontProps */
+    getFont(arg) {
+        if (typeof arg === "number")
+            return this.fonts.get(arg);
+        for (const font of this.fonts.values())
+            if (font.name === arg)
+                return font;
+        return undefined;
+    }
+}
 //# sourceMappingURL=Fonts.js.map

package/lib/esm/Frustum.d.ts

@@ -1,115 +1,115 @@
-/** @packageDocumentation
- * @module Views
- */
-import { ConvexClipPlaneSet, LowAndHighXY, LowAndHighXYZ, Map4d, Matrix3d, Plane3dByOriginAndUnitNormal, Point3d, Range3d, Transform, XYAndZ } from "@itwin/core-geometry";
-/** The 8 corners of the [Normalized Plane Coordinate]($docs/learning/glossary.md#npc) cube.
- * @public
- * @extensions
- */
-export declare enum Npc {
-    /** Left bottom rear */
-    _000 = 0,
-    /** Right bottom rear */
-    _100 = 1,
-    /** Left top rear */
-    _010 = 2,
-    /** Right top rear */
-    _110 = 3,
-    /** Left bottom front */
-    _001 = 4,
-    /** Right bottom front */
-    _101 = 5,
-    /** Left top front */
-    _011 = 6,
-    /** Right top front */
-    _111 = 7,
-    LeftBottomRear = 0,
-    RightBottomRear = 1,
-    LeftTopRear = 2,
-    RightTopRear = 3,
-    LeftBottomFront = 4,
-    RightBottomFront = 5,
-    LeftTopFront = 6,
-    RightTopFront = 7,
-    /** useful for sizing arrays */
-    CORNER_COUNT = 8
-}
-/** The 8 corners of an [[Npc]] Frustum.
- * @public
- */
-export declare const NpcCorners: Point3d[];
-/** The center point of the [Normalized Plane Coordinate]($docs/learning/glossary.md#npc) cube.
- * @public
- */
-export declare const NpcCenter: Point3d;
-/** The region of physical (3d) space that appears in a view. It forms the field-of-view of a camera.
- * It is stored as 8 points, in [[Npc]] order, that must define a truncated pyramid.
- * @public
- */
-export declare class Frustum {
-    /** Array of the 8 points of this Frustum. */
-    readonly points: Point3d[];
-    /** Constructor for Frustum. Members are initialized to the Npc cube. */
-    constructor();
-    /** Initialize this Frustum to the 8 corners of the NPC cube. */
-    initNpc(): this;
-    /** Get a corner Point from this Frustum. */
-    getCorner(i: number): Point3d;
-    /** Get the point at the center of this Frustum (halfway between RightTopFront and LeftBottomRear. */
-    getCenter(): Point3d;
-    /** Get the distance between two corners of this Frustum. */
-    distance(corner1: number, corner2: number): number;
-    /** Get the ratio of the length of the diagonal of the front plane to the diagonal of the back plane. */
-    getFraction(): number;
-    /** Multiply all the points of this Frustum by a Transform, in place. */
-    multiply(trans: Transform): void;
-    /** Offset all of the points of this Frustum by a vector. */
-    translate(offset: XYAndZ): void;
-    /** Transform all the points of this Frustum and return the result in another Frustum. */
-    transformBy(trans: Transform, result?: Frustum): Frustum;
-    /** Calculate a bounding range from the 8 points in this Frustum. */
-    toRange(range?: Range3d): Range3d;
-    /** Make a copy of this Frustum.
-     * @param result Optional Frustum for copy. If undefined allocate a new Frustum.
-     */
-    clone(result?: Frustum): Frustum;
-    /** Set the points of this Frustum to be copies of the points in another Frustum. */
-    setFrom(other: Frustum): void;
-    /** Set the points of this frustum from array of corner points in NPC order. */
-    setFromCorners(corners: Point3d[]): void;
-    /** Scale this Frustum, in place, about its center by a scale factor. */
-    scaleAboutCenter(scale: number): void;
-    /** The point at the center of the front face of this frustum */
-    get frontCenter(): Point3d;
-    /** The point at the center of the rear face of this frustum */
-    get rearCenter(): Point3d;
-    /** Scale this frustum's XY (viewing) plane about its center */
-    scaleXYAboutCenter(scale: number): void;
-    /** Create a Map4d that converts world coordinates to/from [[Npc]] coordinates of this Frustum. */
-    toMap4d(): Map4d | undefined;
-    /** Get the rotation matrix to the frame of this frustum.  This is equivalent to the view rotation matrix. */
-    getRotation(result?: Matrix3d): Matrix3d | undefined;
-    /** Get the eye point  - undefined if parallel projection */
-    getEyePoint(result?: Point3d): Point3d | undefined;
-    /** Invalidate this Frustum by setting all 8 points to zero. */
-    invalidate(): void;
-    /** Return true if this Frustum is equal to another Frustum */
-    equals(rhs: Frustum): boolean;
-    /** Return true if all of the points in this Frustum are *almost* the same as the points in another Frustum.
-     * @see [[equals]], [XYZ.isAlmostEqual]($geometry)
-     */
-    isSame(other: Frustum): boolean;
-    /** Initialize this Frustum from a Range */
-    initFromRange(range: LowAndHighXYZ | LowAndHighXY): void;
-    /** Create a new Frustum from a Range3d */
-    static fromRange(range: LowAndHighXYZ | LowAndHighXY, out?: Frustum): Frustum;
-    /** Return true if this Frustum has a mirror (is not in the correct order.) */
-    get hasMirror(): boolean;
-    /** Make sure the frustum point order does not include mirroring. If so, reverse the order. */
-    fixPointOrder(): void;
-    /** Get a convex set of clipping planes bounding the region contained by this Frustum. */
-    getRangePlanes(clipFront: boolean, clipBack: boolean, expandPlaneDistance: number): ConvexClipPlaneSet;
-    /** Get a (convex) polygon that represents the intersection of this frustum with a plane, or undefined if no intersection exists */
-    getIntersectionWithPlane(plane: Plane3dByOriginAndUnitNormal): Point3d[] | undefined;
-}
+/** @packageDocumentation
+ * @module Views
+ */
+import { ConvexClipPlaneSet, LowAndHighXY, LowAndHighXYZ, Map4d, Matrix3d, Plane3dByOriginAndUnitNormal, Point3d, Range3d, Transform, XYAndZ } from "@itwin/core-geometry";
+/** The 8 corners of the [Normalized Plane Coordinate]($docs/learning/glossary.md#npc) cube.
+ * @public
+ * @extensions
+ */
+export declare enum Npc {
+    /** Left bottom rear */
+    _000 = 0,
+    /** Right bottom rear */
+    _100 = 1,
+    /** Left top rear */
+    _010 = 2,
+    /** Right top rear */
+    _110 = 3,
+    /** Left bottom front */
+    _001 = 4,
+    /** Right bottom front */
+    _101 = 5,
+    /** Left top front */
+    _011 = 6,
+    /** Right top front */
+    _111 = 7,
+    LeftBottomRear = 0,
+    RightBottomRear = 1,
+    LeftTopRear = 2,
+    RightTopRear = 3,
+    LeftBottomFront = 4,
+    RightBottomFront = 5,
+    LeftTopFront = 6,
+    RightTopFront = 7,
+    /** useful for sizing arrays */
+    CORNER_COUNT = 8
+}
+/** The 8 corners of an [[Npc]] Frustum.
+ * @public
+ */
+export declare const NpcCorners: Point3d[];
+/** The center point of the [Normalized Plane Coordinate]($docs/learning/glossary.md#npc) cube.
+ * @public
+ */
+export declare const NpcCenter: Point3d;
+/** The region of physical (3d) space that appears in a view. It forms the field-of-view of a camera.
+ * It is stored as 8 points, in [[Npc]] order, that must define a truncated pyramid.
+ * @public
+ */
+export declare class Frustum {
+    /** Array of the 8 points of this Frustum. */
+    readonly points: Point3d[];
+    /** Constructor for Frustum. Members are initialized to the Npc cube. */
+    constructor();
+    /** Initialize this Frustum to the 8 corners of the NPC cube. */
+    initNpc(): this;
+    /** Get a corner Point from this Frustum. */
+    getCorner(i: number): Point3d;
+    /** Get the point at the center of this Frustum (halfway between RightTopFront and LeftBottomRear. */
+    getCenter(): Point3d;
+    /** Get the distance between two corners of this Frustum. */
+    distance(corner1: number, corner2: number): number;
+    /** Get the ratio of the length of the diagonal of the front plane to the diagonal of the back plane. */
+    getFraction(): number;
+    /** Multiply all the points of this Frustum by a Transform, in place. */
+    multiply(trans: Transform): void;
+    /** Offset all of the points of this Frustum by a vector. */
+    translate(offset: XYAndZ): void;
+    /** Transform all the points of this Frustum and return the result in another Frustum. */
+    transformBy(trans: Transform, result?: Frustum): Frustum;
+    /** Calculate a bounding range from the 8 points in this Frustum. */
+    toRange(range?: Range3d): Range3d;
+    /** Make a copy of this Frustum.
+     * @param result Optional Frustum for copy. If undefined allocate a new Frustum.
+     */
+    clone(result?: Frustum): Frustum;
+    /** Set the points of this Frustum to be copies of the points in another Frustum. */
+    setFrom(other: Frustum): void;
+    /** Set the points of this frustum from array of corner points in NPC order. */
+    setFromCorners(corners: Point3d[]): void;
+    /** Scale this Frustum, in place, about its center by a scale factor. */
+    scaleAboutCenter(scale: number): void;
+    /** The point at the center of the front face of this frustum */
+    get frontCenter(): Point3d;
+    /** The point at the center of the rear face of this frustum */
+    get rearCenter(): Point3d;
+    /** Scale this frustum's XY (viewing) plane about its center */
+    scaleXYAboutCenter(scale: number): void;
+    /** Create a Map4d that converts world coordinates to/from [[Npc]] coordinates of this Frustum. */
+    toMap4d(): Map4d | undefined;
+    /** Get the rotation matrix to the frame of this frustum.  This is equivalent to the view rotation matrix. */
+    getRotation(result?: Matrix3d): Matrix3d | undefined;
+    /** Get the eye point  - undefined if parallel projection */
+    getEyePoint(result?: Point3d): Point3d | undefined;
+    /** Invalidate this Frustum by setting all 8 points to zero. */
+    invalidate(): void;
+    /** Return true if this Frustum is equal to another Frustum */
+    equals(rhs: Frustum): boolean;
+    /** Return true if all of the points in this Frustum are *almost* the same as the points in another Frustum.
+     * @see [[equals]], [XYZ.isAlmostEqual]($geometry)
+     */
+    isSame(other: Frustum): boolean;
+    /** Initialize this Frustum from a Range */
+    initFromRange(range: LowAndHighXYZ | LowAndHighXY): void;
+    /** Create a new Frustum from a Range3d */
+    static fromRange(range: LowAndHighXYZ | LowAndHighXY, out?: Frustum): Frustum;
+    /** Return true if this Frustum has a mirror (is not in the correct order.) */
+    get hasMirror(): boolean;
+    /** Make sure the frustum point order does not include mirroring. If so, reverse the order. */
+    fixPointOrder(): void;
+    /** Get a convex set of clipping planes bounding the region contained by this Frustum. */
+    getRangePlanes(clipFront: boolean, clipBack: boolean, expandPlaneDistance: number): ConvexClipPlaneSet;
+    /** Get a (convex) polygon that represents the intersection of this frustum with a plane, or undefined if no intersection exists */
+    getIntersectionWithPlane(plane: Plane3dByOriginAndUnitNormal): Point3d[] | undefined;
+}
 //# sourceMappingURL=Frustum.d.ts.map