npm - @itwin/core-geometry - Versions diffs - 5.4.0-dev.4 → 5.4.0-dev.6 - Mend

@itwin/core-geometry 5.4.0-dev.4 → 5.4.0-dev.6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (451) hide show

package/lib/esm/polyface/Polyface.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"Polyface.js","sourceRoot":"","sources":["../../../src/polyface/Polyface.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,2BAA2B;AAE3B,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,OAAO,EAAW,MAAM,qBAAqB,CAAC;AAEvD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;GAIG;AACH,MAAM,OAAgB,QAAS,SAAQ,aAAa;IAClD,wCAAwC;IACxB,gBAAgB,GAAG,UAAU,CAAC;IAC9C,gCAAgC;IACzB,IAAI,CAAe;IAC1B,kBAAkB;IAClB,YAAsB,IAAkB;QACtC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAMD;;OAEG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;IAC5B,CAAC;IACD,IAAW,QAAQ,CAAC,KAAc;QAChC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IAC7B,CAAC;IACD;;;;OAIG;IACH,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC;IACnC,CAAC;IACD,IAAW,eAAe,CAAC,KAAa;QACtC,IAAI,CAAC,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC;IACpC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,eAAe,CAC3B,OAA6B,EAC7B,cAAsB,EACtB,cAAsB,EACtB,IAAS,EACT,UAAkB;QAElB,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAC7C,OAAO,IAAI,CAAC;QACd,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAC7C,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,IAAI,OAAO,CAAC,MAAM;YACxD,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,IAAI,cAAc,IAAI,cAAc,GAAG,OAAO,CAAC,MAAM;YACrE,OAAO,KAAK,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,cAAc,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE;YAClD,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,UAAU;gBAC5C,OAAO,KAAK,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,iFAAiF;IACjF,IAAW,UAAU;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,eAAgB,SAAQ,QAAQ;IAC3C;;;;;;;OAOG;IACO,WAAW,CAAW;IAChC;;;OAGG;IACO,gBAAgB,CAAW;IACrC;;;;;OAKG;IACH,YAAsB,IAAkB,EAAE,UAAqB,EAAE,eAA0B;QACzF,KAAK,CAAC,IAAI,CAAC,CAAC;QACZ,IAAI,UAAU;YACZ,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,YAAY;aAChD,CAAC;YACJ,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,eAAe;YACjB,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,YAAY;;YAE7D,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;IAC/B,CAAC;IAED,4GAA4G;IACrG,qBAAqB,CAAC,CAAqB;QAChD,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,SAAS,CAAC;QACnB,OAAO,WAAW,CAAC,+BAA+B,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,CAAqB;QAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,wDAAwD;IACjD,mBAAmB,CAAC,KAAU;QACnC,OAAO,KAAK,YAAY,eAAe,CAAC;IAC1C,CAAC;IACD,0DAA0D;IAC1C,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC;gBACxC,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC;gBAC7D,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,gBAAgB,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,gFAAgF;IAChF,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;IACzE,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC;YACpC,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,0CAA0C;IACnC,kBAAkB,CAAC,OAAe;QACvC,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACjE,CAAC;IACD,2BAA2B;IACpB,KAAK;QACV,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,sDAAsD;IAC/C,cAAc;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7C,CAAC;IACD,mDAAmD;IAC5C,cAAc;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;IAC7B,CAAC;IACD;;;;MAIE;IACK,cAAc,CAAC,CAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM;YAC5C,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YACrD,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IACD;;;;;;OAMG;IACI,kBAAkB,CAAC,MAAuB,EAAE,QAAiB,EAAE,SAAgC;QACpG,MAAM,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC;QAC1C,mDAAmD;QACnD,2FAA2F;QAC3F,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAChD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1D,IAAI,SAAS,EAAE,CAAC;gBACd,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACrB,CAAC;;gBACC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrC,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,oEAAoE;oBAChG,IAAI,CAAC,aAAa,CAChB,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAC5C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CACjD,CAAC;gBACJ,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,IAAI,CAAC,aAAa,CAChB,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAC5C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAC3B,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,iCAAiC;QACjC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAC7G,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAChD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,0DAA0D;gBACpG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;YACH,CAAC;QACH,CAAC;QACD,mCAAmC;QACnC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAChH,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,CAAE,CAAC;gBAC5E,IAAI,SAAS;oBACX,SAAS,CAAC,cAAc,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;gBACvD,IAAI,QAAQ;oBACV,YAAY,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;gBAClC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YAC/B,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,0DAA0D;gBACpG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,cAAc,CAAC,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,cAAc,CAAC,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,CAAC;YACH,CAAC;QACH,CAAC;QACD,iCAAiC;QACjC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAC7G,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAChD,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK;gBACzC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,yDAAyD;gBACnG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;YACH,CAAC;QACH,CAAC;QACD,sCAAsC;QACtC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YACjD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACpC,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACtC,CAAC;YACD,KAAK,MAAM,cAAc,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBACrD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,GAAG,cAAc,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACH,IAAW,wBAAwB;QACjC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IACnE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,MAAM,CAClB,cAAuB,KAAK,EAC5B,aAAsB,KAAK,EAC3B,aAAsB,KAAK,EAC3B,WAAoB,IAAI;QAExB,OAAO,IAAI,eAAe,CAAC,IAAI,YAAY,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAc,EAAE,UAAmB;QACjD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACzE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;gBACpE,OAAO,UAAU,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACI,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAChD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;OAIG;IACI,QAAQ,CAAC,KAAc;QAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;OAOG;IACI,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,WAAoB,EAAE,WAAoB;QAChF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC1C,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;YACrF,OAAO,WAAW,CAAC;QACrB,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;YACrF,OAAO,WAAW,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACI,SAAS,CAAC,MAAgB,EAAE,WAAoB,EAAE,WAAoB;QAC3E,8DAA8D;QAC9D,MAAM,iBAAiB,GAAG,CAAC,CAAS,EAAE,EAAE;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,CAAC,oBAAoB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACnE,OAAO,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAC5E,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACnC,IAAI,WAAW,KAAK,SAAS,IAAI,iBAAiB,CAAC,WAAW,CAAC;gBAC7D,OAAO,WAAW,CAAC;YACrB,IAAI,WAAW,KAAK,SAAS,IAAI,iBAAiB,CAAC,WAAW,CAAC;gBAC7D,OAAO,WAAW,CAAC;YACrB,8CAA8C;YAC9C,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC9C,IAAI,iBAAiB,CAAC,SAAS,CAAC;oBAC9B,OAAO,SAAS,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IACD;;;;;;OAMG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YACnB,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;QAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC,CAAC;IACD;;;;OAIG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,mDAAmD;IAC5C,aAAa,CAAC,KAAa,EAAE,UAAmB,IAAI;QACzD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC;IACD,0BAA0B;IACnB,cAAc,CAAC,KAAa;QACjC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW;YACxB,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IACD,yBAAyB;IAClB,aAAa,CAAC,KAAa;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU;YACvB,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IACD,yBAAyB;IAClB,aAAa,CAAC,KAAa;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU;YACvB,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IACD;;;;OAIG;IACI,gBAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC;IAED;;;;;OAKG;IACI,kBAAkB,CAAC,SAAiB,CAAC,EAAE,MAAiB;QAC7D,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACpD,MAAM,QAAQ,GAAG,MAAM,IAAI,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,eAAe,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;YACxC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,eAAe,EAAE,CAAC;YAC5C,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;YACtC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,eAAe;YAC3E,QAAQ,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;QACjE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,eAAe;YACzE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,eAAe;YACzE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,eAAe;YAClD,QAAQ,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;QAClE,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7I,QAAQ,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;QACpD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,eAAe;gBACpD,QAAQ,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;iBAC9D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAqB,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBAClH,QAAQ,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,CAAC,KAAK,QAAQ,CAAC,MAAM,CAAC;IAC/B,CAAC;IAED;;;;;;;OAOG;IACI,cAAc,CAAC,qBAA8B,IAAI;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9C,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAC5C,sFAAsF;QACtF,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,IAAI,kBAAkB,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,IAAI,OAAO,GAAG,OAAO,GAAG,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,uCAAuC,CAAC,CAAC;YACzD,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAC3C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;gBACtC,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,yCAAyC;QACzE,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6CAA6C;IAC7C,IAAoB,UAAU;QAC5B,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC,CAAC;IACD,4CAA4C;IAC5C,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC;IAC7B,CAAC;IACD,6CAA6C;IAC7C,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,6CAA6C;IAC7C,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,iDAAiD;IACjD,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,8CAA8C;IAC9C,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;IAC/B,CAAC;IACD,8CAA8C;IACvC,iBAAiB,CAAC,UAAkB;QACzC,OAAO,UAAU,IAAI,CAAC,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACzD,CAAC;IACD,wDAAwD;IACjD,cAAc,CAAC,UAAkB;QACtC,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC;YACpC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QACzE,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,WAAW,CAAC,UAAkB;QACnC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;IACtC,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,UAAkB;QACnC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,2GAA2G;IAC3G,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IACD,yCAAyC;IAClC,aAAa,CAAC,UAAkB,CAAC;QACtC,OAAO,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IACD,8EAA8E;IACvE,WAAW,CAAC,KAAc,EAAE,SAAqB;QACtD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC1C,CAAC;IACD;;;OAGG;IACI,uBAAuB,CAAC,UAAkB;QAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3D,CAAC;IACD;;;;OAIG;IACI,cAAc,CAAC,gBAAwB,CAAC;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;QAChD,IAAI,UAAU,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM;YACvC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,KAAK,aAAa,EAAE,yDAAyD;YAChF,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,mDAAmD;QAC9F,MAAM,QAAQ,GAAG,aAAa,CAAC,UAAU,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,0CAA0C;YACpF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,gFAAgF;QAChF,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC;QACnD,MAAM,aAAa,GAAY,QAAQ,CAAC,UAAU,CAAC,MAAM,IAAI,YAAY,CAAC;QAC1E,GAAG,CAAC;YACF,IAAI,aAAa,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;gBAC9C,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACnD,CAAC,QAAQ,OAAO,CAAC,eAAe,EAAE,IAAI,OAAO,CAAC,gBAAgB,EAAE,GAAG,aAAa,EAAE;QAClF,IAAI,YAAY,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM;YACxF,QAAQ,CAAC,oCAAoC,CAAC,IAAI,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;QACjF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9B,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE;YAC/D,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;QAC5E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD,qGAAqG;IAC9F,MAAM,CAAC,gBAAgB,CAAC,QAAoC;QACjE,IAAI,MAAmC,CAAC;QACxC,IAAI,QAAQ,YAAY,QAAQ,EAAE,CAAC;YACjC,IAAI,QAAQ,YAAY,eAAe;gBACrC,MAAM,GAAG,QAAQ,CAAC;QACtB,CAAC;aAAM,IAAI,QAAQ,CAAC,cAAc,EAAE,IAAI,QAAQ,CAAC,cAAc,EAAE,YAAY,eAAe;YAC1F,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAqB,CAAC;QACxD,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC;YAChD,IAAI,aAAa,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU;gBAC9F,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n\n/** @packageDocumentation\n * @module Polyface\n /\n\n// cspell:word internaldocs\n\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { Geometry } from \"../Geometry\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { GrowableXYArray } from \"../geometry3d/GrowableXYArray\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { NumberArray } from \"../geometry3d/PointHelpers\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { FacetFaceData } from \"./FacetFaceData\";\nimport { IndexedPolyfaceVisitor } from \"./IndexedPolyfaceVisitor\";\nimport { PolyfaceData } from \"./PolyfaceData\";\n\n/\n A Polyface is an abstract mesh structure (of unspecified implementation) that provides a PolyfaceVisitor\n * to iterate over its facets.\n * @public\n /\nexport abstract class Polyface extends GeometryQuery {\n /* String name for schema properties /\n public readonly geometryCategory = \"polyface\";\n /* Underlying polyface data. /\n public data: PolyfaceData;\n /* Constructor /\n protected constructor(data: PolyfaceData) {\n super();\n this.data = data;\n }\n /\n Create and return a visitor for this concrete polyface.\n * @param numWrap the number of vertices to replicate in visitor arrays.\n /\n public abstract createVisitor(numWrap: number): PolyfaceVisitor;\n /\n The [[PolyfaceData.twoSided]] flag.\n /\n public get twoSided() {\n return this.data.twoSided;\n }\n public set twoSided(value: boolean) {\n this.data.twoSided = value;\n }\n /\n Flag indicating if the mesh closure is unknown (0), open sheet (1), closed solid (2).\n * * A boundary edge of a mesh is defined as an edge with only one connected facet.\n * * Closed solid is a mesh with no boundary edge. Open sheet is a mesh that has boundary edge(s).\n /\n public get expectedClosure(): number {\n return this.data.expectedClosure;\n }\n public set expectedClosure(value: number) {\n this.data.expectedClosure = value;\n }\n /\n Check validity of indices into a data array.\n * * It is valid to have both indices and data undefined.\n * * It is NOT valid for just one to be defined.\n * * Index values at indices[indexPositionA <= i < indexPositionB] must be valid indices to the data array.\n * @param indices array of indices.\n * @param indexPositionA first index to test.\n * @param indexPositionB one past final index to test.\n * @param data data array.\n * @param dataLength length of data array.\n /\n public static areIndicesValid(\n indices: number[] \| undefined,\n indexPositionA: number,\n indexPositionB: number,\n data: any,\n dataLength: number,\n ): boolean {\n if (indices === undefined && data === undefined)\n return true;\n if (indices === undefined \|\| data === undefined)\n return false;\n if (indexPositionA < 0 \|\| indexPositionA >= indices.length)\n return false;\n if (indexPositionB <= indexPositionA \|\| indexPositionB > indices.length)\n return false;\n for (let i = indexPositionA; i < indexPositionB; i++)\n if (indices[i] < 0 \|\| indices[i] >= dataLength)\n return false;\n return true;\n }\n /* Returns true if this polyface has no facets. /\n public abstract get isEmpty(): boolean;\n /* Returns the number of facets of this polyface. Subclasses should override. /\n public get facetCount(): number \| undefined {\n return undefined;\n }\n}\n\n/\n An `IndexedPolyface` is a set of facets which can have normal, param, and color arrays with independent point,\n * normal, param, and color indices.\n * @public\n /\nexport class IndexedPolyface extends Polyface { // more info can be found at geometry/internaldocs/Polyface.md\n /\n Start indices of all facets of the polyface.\n * * Each element is an index to the `this.data.pointIndex` array entry for a specific facet.\n * * The facet count is `_facetStart.length - 1`.\n * * The face loop for the i_th facet consists of the entries in `this.data.pointIndex` at indices `_facetStart[i]`\n * up to (but not including) `_facetStart[i + 1]`.\n * * Note the array is initialized with one entry (value 0).\n /\n protected _facetStart: number[];\n /\n Index to the `this.data.face` array entry for a specific facet.\n * * `_facetToFaceData` has one entry per facet.\n /\n protected _facetToFaceData: number[];\n /\n Constructor for a new polyface.\n * @param data PolyfaceData arrays to capture.\n * @param facetStart optional array of facet start indices (e.g. known during clone)\n * @param facetToFacetData optional array of face identifiers (e.g. known during clone)\n /\n protected constructor(data: PolyfaceData, facetStart?: number[], facetToFaceData?: number[]) {\n super(data);\n if (facetStart)\n this._facetStart = facetStart.slice(); // deep copy\n else {\n this._facetStart = [];\n this._facetStart.push(0);\n }\n if (facetToFaceData)\n this._facetToFaceData = facetToFaceData.slice(); // deep copy\n else\n this._facetToFaceData = [];\n }\n\n /* Given an edgeIndex (index into `data.pointIndex`), return the index of the facet containing the edge. /\n public edgeIndexToFacetIndex(k: number \| undefined): number \| undefined {\n if (k === undefined)\n return undefined;\n return NumberArray.searchStrictlyIncreasingNumbers(this._facetStart, k);\n }\n /\n Given an edgeIndex (index into `data.pointIndex`), return the range of the edgeIndices of the containing facet.\n * * If an edge with edgeIndex `k` is found in the facet with facetIndex `f`, then the returned range `r` satisfies\n * `r.low = this.facetIndex0(f) <= k < this.facetIndex1(f) = r.high` and can be used to iterate the facet's face\n * loop. See [[facetIndex0]].\n /\n public edgeIndexToFaceLoop(k: number \| undefined): Range1d \| undefined {\n const q = this.edgeIndexToFacetIndex(k);\n if (q !== undefined)\n return Range1d.createXX(this.facetIndex0(q), this.facetIndex1(q));\n return undefined;\n }\n\n /* Test if other is an instance of `IndexedPolyface` /\n public isSameGeometryClass(other: any): boolean {\n return other instanceof IndexedPolyface;\n }\n /* Tests for equivalence between two IndexedPolyfaces. /\n public override isAlmostEqual(other: any): boolean {\n if (other instanceof IndexedPolyface) {\n return this.data.isAlmostEqual(other.data) &&\n NumberArray.isExactEqual(this._facetStart, other._facetStart) &&\n NumberArray.isExactEqual(this._facetToFaceData, other._facetToFaceData);\n }\n return false;\n }\n /* Returns true if either the point array or the point index array is empty. /\n public get isEmpty(): boolean {\n return this.data.pointCount === 0 \|\| this.data.pointIndex.length === 0;\n }\n /\n Transform the mesh.\n * * If `transform` is a mirror, also reverse the index order around each facet.\n * * Note that this method always returns true. If transforming the normals fails (due to singular matrix or zero\n * normal), the original normal(s) are left unchanged.\n /\n public tryTransformInPlace(transform: Transform): boolean {\n this.data.tryTransformInPlace(transform);\n if (transform.matrix.determinant() < 0)\n this.reverseIndices();\n return true;\n }\n /* Reverse indices for a single facet. /\n public reverseSingleFacet(facetId: number) {\n this.data.reverseIndicesSingleFacet(facetId, this._facetStart);\n }\n /* Return a deep clone. /\n public clone(): IndexedPolyface {\n return new IndexedPolyface(this.data.clone(), this._facetStart.slice(), this._facetToFaceData.slice());\n }\n /\n Return a deep clone with transformed points and normals.\n * @see [[IndexedPolyface.tryTransformInPlace]] for details of how transform is done.\n /\n public cloneTransformed(transform: Transform): IndexedPolyface { // we know tryTransformInPlace succeeds.\n const result = this.clone();\n result.tryTransformInPlace(transform);\n return result;\n }\n /* Reverse the order of indices around all facets. /\n public reverseIndices() {\n this.data.reverseIndices(this._facetStart);\n }\n /* Reverse the direction of all normal vectors. /\n public reverseNormals() {\n this.data.reverseNormals();\n }\n /\n Return face data using a facet index.\n * * Returns `undefined` if none found.\n * * This is the REFERENCE to the FacetFaceData not a copy.\n /\n public tryGetFaceData(i: number): FacetFaceData \| undefined {\n if (i < 0 \|\| i >= this._facetToFaceData.length)\n return undefined;\n const faceIndex = this._facetToFaceData[i];\n if (faceIndex < 0 \|\| faceIndex >= this.data.face.length)\n return undefined;\n return this.data.face[faceIndex];\n }\n /\n Add facets from `source` to `this` polyface.\n * * Optionally reverse facet indices as per `PolyfaceData.reverseIndicesSingleFacet()` with `preserveStart = false` and\n * invert source normals.\n * * Optionally apply a `transform` to points and normals.\n * * Will only copy param, normal, color, and face data if we are already tracking them AND/OR the source contains them.\n /\n public addIndexedPolyface(source: IndexedPolyface, reversed: boolean, transform: Transform \| undefined) {\n const numSourceFacets = source.facetCount;\n // add point, point index, and edge visibility data\n // note that there is no need to build an intermediate index map since all points are added\n const startOfNewPoints = this.data.point.length;\n const xyz = Point3d.create();\n for (let i = 0; i < source.data.point.length; i++) {\n source.data.point.getPoint3dAtUncheckedPointIndex(i, xyz);\n if (transform) {\n transform.multiplyPoint3d(xyz, xyz);\n this.addPoint(xyz);\n } else\n this.addPoint(xyz);\n }\n for (let i = 0; i < numSourceFacets; i++) {\n const i0 = source._facetStart[i];\n const i1 = source._facetStart[i + 1];\n if (reversed) {\n for (let j = i1; j-- > i0;) { // visibility is transferred from far vertex, e.g., -abc-d => dc-b-a\n this.addPointIndex(\n startOfNewPoints + source.data.pointIndex[j],\n source.data.edgeVisible[j > i0 ? j - 1 : i1 - 1],\n );\n }\n } else {\n for (let j = i0; j < i1; j++) {\n this.addPointIndex(\n startOfNewPoints + source.data.pointIndex[j],\n source.data.edgeVisible[j],\n );\n }\n }\n this.terminateFacet(false);\n }\n // add param and param index data\n if (undefined !== this.data.param && undefined !== source.data.param && undefined !== source.data.paramIndex) {\n const startOfNewParams = this.data.param.length;\n this.data.param.pushFromGrowableXYArray(source.data.param);\n for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match normals\n const i0 = source._facetStart[i];\n const i1 = source._facetStart[i + 1];\n if (reversed) {\n for (let j = i1; j-- > i0;)\n this.addParamIndex(startOfNewParams + source.data.paramIndex[j]);\n } else {\n for (let j = i0; j < i1; j++)\n this.addParamIndex(startOfNewParams + source.data.paramIndex[j]);\n }\n }\n }\n // add normal and normal index data\n if (undefined !== this.data.normal && undefined !== source.data.normal && undefined !== source.data.normalIndex) {\n const startOfNewNormals = this.data.normal.length;\n for (let i = 0; i < source.data.normal.length; i++) {\n const sourceNormal = source.data.normal.getVector3dAtCheckedVectorIndex(i)!;\n if (transform)\n transform.multiplyVector(sourceNormal, sourceNormal);\n if (reversed)\n sourceNormal.scaleInPlace(-1.0);\n this.addNormal(sourceNormal);\n }\n for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match normals\n const i0 = source._facetStart[i];\n const i1 = source._facetStart[i + 1];\n if (reversed) {\n for (let j = i1; j-- > i0;)\n this.addNormalIndex(startOfNewNormals + source.data.normalIndex[j]);\n } else {\n for (let j = i0; j < i1; j++)\n this.addNormalIndex(startOfNewNormals + source.data.normalIndex[j]);\n }\n }\n }\n // add color and color index data\n if (undefined !== this.data.color && undefined !== source.data.color && undefined !== source.data.colorIndex) {\n const startOfNewColors = this.data.color.length;\n for (const sourceColor of source.data.color)\n this.addColor(sourceColor);\n for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match colors\n const i0 = source._facetStart[i];\n const i1 = source._facetStart[i + 1];\n if (reversed) {\n for (let j = i1; j-- > i0;)\n this.addColorIndex(startOfNewColors + source.data.colorIndex[j]);\n } else {\n for (let j = i0; j < i1; j++)\n this.addColorIndex(startOfNewColors + source.data.colorIndex[j]);\n }\n }\n }\n // add face and facetToFace index data\n if (source.data.face.length !== 0) {\n const startOfNewFaceData = this.data.face.length;\n for (const face of source.data.face) {\n const sourceFaceData = face.clone();\n this.data.face.push(sourceFaceData);\n }\n for (const facetToFaceIdx of source._facetToFaceData) {\n this._facetToFaceData.push(startOfNewFaceData + facetToFaceIdx);\n }\n }\n }\n /\n Return the total number of indices in zero-terminated style, which includes\n * * all the indices in the packed zero-based table.\n * * one additional index for the zero-terminator of each facet.\n * @note Note that all index arrays (pointIndex, normalIndex, paramIndex, colorIndex) have the same counts, so there\n * is not a separate query for each of them.\n /\n public get zeroTerminatedIndexCount(): number {\n return this.data.pointIndex.length + this._facetStart.length - 1;\n }\n /\n Create an empty facet set with coordinate and index data to be supplied later.\n * @param needNormals `true` to allocate empty normal data and index arrays; `false` (default) to leave undefined.\n * @param needParams `true` to allocate empty uv parameter data and index arrays; `false` (default) to leave undefined.\n * @param needColors `true` to allocate empty color data and index arrays; `false` (default) to leave undefined.\n * @param twoSided `true` (default) if the facets are to be considered viewable from the back; `false` if they are amenable to backface culling.\n /\n public static create(\n needNormals: boolean = false,\n needParams: boolean = false,\n needColors: boolean = false,\n twoSided: boolean = true,\n ): IndexedPolyface {\n return new IndexedPolyface(new PolyfaceData(needNormals, needParams, needColors, twoSided));\n }\n /\n Add (a clone of) a point to point array.\n * @param point the point.\n * @param priorIndex (optional) index of prior point to check for possible duplicate value.\n * @returns the zero-based index of the added or duplicate point.\n /\n public addPoint(point: Point3d, priorIndex?: number): number {\n if (priorIndex !== undefined) {\n const distance = this.data.point.distanceIndexToPoint(priorIndex, point);\n if (distance !== undefined && Geometry.isSmallMetricDistance(distance))\n return priorIndex;\n }\n this.data.point.pushXYZ(point.x, point.y, point.z);\n return this.data.point.length - 1;\n }\n /\n Add a point to point array.\n * @param x the x coordinate of point.\n * @param y the y coordinate of point.\n * @param z the z coordinate of point.\n * @returns the zero-based index of the added point.\n /\n public addPointXYZ(x: number, y: number, z: number): number {\n this.data.point.pushXYZ(x, y, z);\n return this.data.point.length - 1;\n }\n /\n Add (a clone of) a uv parameter to the parameter array.\n * @param param the parameter.\n * @returns zero-based index of the added param.\n /\n public addParam(param: Point2d): number {\n if (!this.data.param)\n this.data.param = new GrowableXYArray();\n this.data.param.push(param);\n return this.data.param.length - 1;\n }\n /\n Add a uv parameter to the parameter array.\n * @param u the u part of parameter.\n * @param v the v part of parameter.\n * @param priorIndexA first index to check for possible duplicate value.\n * @param priorIndexB second index to check for possible duplicate value.\n * @returns zero-based index of the added or duplicate parameter.\n /\n public addParamUV(u: number, v: number, priorIndexA?: number, priorIndexB?: number): number {\n if (!this.data.param)\n this.data.param = new GrowableXYArray();\n if (priorIndexA !== undefined && this.data.isAlmostEqualParamIndexUV(priorIndexA, u, v))\n return priorIndexA;\n if (priorIndexB !== undefined && this.data.isAlmostEqualParamIndexUV(priorIndexB, u, v))\n return priorIndexB;\n this.data.param.pushXY(u, v);\n return this.data.param.length - 1;\n }\n /\n Add (a clone of) a normal vector to the normal array.\n * @param normal the normal vector.\n * @param priorIndexA first index to check for possible duplicate value.\n * @param priorIndexB second index to check for possible duplicate value.\n * @returns zero-based index of the added or duplicate normal.\n /\n public addNormal(normal: Vector3d, priorIndexA?: number, priorIndexB?: number): number {\n // check if `normal` is duplicate of `dataNormal` at index `i`\n const normalIsDuplicate = (i: number) => {\n const distance = this.data.normal!.distanceIndexToPoint(i, normal);\n return distance !== undefined && Geometry.isSmallMetricDistance(distance);\n };\n if (this.data.normal !== undefined) {\n if (priorIndexA !== undefined && normalIsDuplicate(priorIndexA))\n return priorIndexA;\n if (priorIndexB !== undefined && normalIsDuplicate(priorIndexB))\n return priorIndexB;\n // check the tail index for possible duplicate\n if (priorIndexA !== undefined \|\| priorIndexB !== undefined) {\n const tailIndex = this.data.normal.length - 1;\n if (normalIsDuplicate(tailIndex))\n return tailIndex;\n }\n }\n return this.addNormalXYZ(normal.x, normal.y, normal.z);\n }\n /\n Add a normal vector to the normal array.\n * @param x the x coordinate of normal.\n * @param y the y coordinate of normal.\n * @param z the z coordinate of normal.\n * @returns zero-based index of the added normal vector.\n /\n public addNormalXYZ(x: number, y: number, z: number): number {\n if (!this.data.normal)\n this.data.normal = new GrowableXYZArray();\n this.data.normal.pushXYZ(x, y, z);\n return this.data.normal.length - 1;\n }\n /\n Add a color to the color array\n * @param color the color.\n * @returns zero-based index of the added color.\n /\n public addColor(color: number): number {\n if (!this.data.color)\n this.data.color = [];\n this.data.color.push(color);\n return this.data.color.length - 1;\n }\n /* Add a point index with edge visibility flag. /\n public addPointIndex(index: number, visible: boolean = true): void {\n this.data.pointIndex.push(index);\n this.data.edgeVisible.push(visible);\n }\n /* Add a normal index. /\n public addNormalIndex(index: number): void {\n if (!this.data.normalIndex)\n this.data.normalIndex = [];\n this.data.normalIndex.push(index);\n }\n /* Add a param index. /\n public addParamIndex(index: number): void {\n if (!this.data.paramIndex)\n this.data.paramIndex = [];\n this.data.paramIndex.push(index);\n }\n /* Add a color index. /\n public addColorIndex(index: number): void {\n if (!this.data.colorIndex)\n this.data.colorIndex = [];\n this.data.colorIndex.push(index);\n }\n /\n Clean up the open facet.\n * @deprecated in 4.5.0 - will not be removed until after 2026-06-13. To remove nebulous \"open facet\" concept from the API. Call [[PolyfaceData.trimAllIndexArrays]]\n * instead.\n /\n public cleanupOpenFacet(): void {\n this.data.trimAllIndexArrays(this.data.pointIndex.length);\n }\n\n /\n Validate (the tail of) the active index arrays: point, normal, param, color.\n * @param index0 optional offset into the index arrays at which to start validating indices. Default 0.\n * @param errors optional array appended with error message(s) if invalid indices are encountered\n * @return whether the indices are valid\n /\n public validateAllIndices(index0: number = 0, errors?: string[]): boolean {\n const numPointIndices = this.data.pointIndex.length;\n const messages = errors ?? [];\n if (0 === numPointIndices) {\n messages.push(\"empty pointIndex array\");\n return false;\n }\n if (index0 < 0 \|\| index0 >= numPointIndices) {\n messages.push(\"invalid input offset\");\n return false;\n }\n if (this.data.normalIndex && this.data.normalIndex.length !== numPointIndices)\n messages.push(\"normalIndex count must match pointIndex count\");\n if (this.data.paramIndex && this.data.paramIndex.length !== numPointIndices)\n messages.push(\"paramIndex count must equal pointIndex count\");\n if (this.data.colorIndex && this.data.colorIndex.length !== numPointIndices)\n messages.push(\"colorIndex count must equal pointIndex count\");\n if (this.data.edgeVisible.length !== numPointIndices)\n messages.push(\"visibleIndex count must equal pointIndex count\");\n if (!Polyface.areIndicesValid(this.data.pointIndex, index0, numPointIndices, this.data.point, this.data.point ? this.data.point.length : 0))\n messages.push(\"invalid point index encountered\");\n if (!Polyface.areIndicesValid(this.data.normalIndex, index0, numPointIndices, this.data.normal, this.data.normal ? this.data.normal.length : 0))\n messages.push(\"invalid normal index encountered\");\n if (!Polyface.areIndicesValid(this.data.paramIndex, index0, numPointIndices, this.data.param, this.data.param ? this.data.param.length : 0))\n messages.push(\"invalid param index encountered\");\n if (!Polyface.areIndicesValid(this.data.colorIndex, index0, numPointIndices, this.data.color, this.data.color ? this.data.color.length : 0))\n messages.push(\"invalid color index encountered\");\n if (this.data.edgeMateIndex) {\n if (this.data.edgeMateIndex.length !== numPointIndices)\n messages.push(\"edgeMateIndex count must equal pointIndex count\");\n else if (!this.data.edgeMateIndex.every((i: number \| undefined) => i === undefined \|\| this.data.isValidEdgeIndex(i)))\n messages.push(\"invalid edgeMate encountered\");\n }\n return 0 === messages.length;\n }\n\n /\n Announce the end of construction of a facet.\n * * Optionally check for:\n * * Same number of indices among all active index arrays -- point, normal, param, color\n * * All indices for the latest facet are within bounds of the respective data arrays.\n * * In error cases, all index arrays are trimmed back to the size when previous facet was terminated.\n * * A return value of `undefined` is normal. Otherwise, a string array of error messages is returned.\n /\n public terminateFacet(validateAllIndices: boolean = true): string[] \| undefined {\n const numFacets = this._facetStart.length - 1;\n // number of indices in accepted facets\n const lengthA = this._facetStart[numFacets];\n // number of indices in all facets (accepted facet plus the last facet to be accepted)\n const lengthB = this.data.pointIndex.length;\n if (validateAllIndices) {\n const messages: string[] = [];\n if (lengthB < lengthA + 2)\n messages.push(\"Less than 3 indices in the last facet\");\n this.validateAllIndices(lengthA, messages);\n if (messages.length > 0) {\n this.data.trimAllIndexArrays(lengthA);\n return messages;\n }\n }\n this._facetStart.push(lengthB); // append start index of the future facet\n return undefined;\n }\n /* Number of facets (read-only property). /\n public override get facetCount(): number {\n return this._facetStart.length - 1;\n }\n /* Number of faces (read-only property). /\n public get faceCount(): number {\n return this.data.faceCount;\n }\n /* Number of points (read-only property). /\n public get pointCount(): number {\n return this.data.pointCount;\n }\n /* Number of colors (read-only property). /\n public get colorCount(): number {\n return this.data.colorCount;\n }\n /* Number of parameters (read-only property). /\n public get paramCount(): number {\n return this.data.paramCount;\n }\n /* Number of normals (read-only property). /\n public get normalCount(): number {\n return this.data.normalCount;\n }\n /* Test if `index` is a valid facet index. /\n public isValidFacetIndex(facetIndex: number): boolean {\n return facetIndex >= 0 && facetIndex < this.facetCount;\n }\n /* Return the number of edges in a particular facet. /\n public numEdgeInFacet(facetIndex: number): number {\n if (this.isValidFacetIndex(facetIndex))\n return this._facetStart[facetIndex + 1] - this._facetStart[facetIndex];\n return 0;\n }\n /\n Given a valid facet index, return the index at which its face loop starts in the index arrays.\n * * A \"face loop\" is a contiguous block of indices into the parallel polyface index arrays.\n * * Each of these indices represents an edge of a facet, thus it is sometimes called an \"edgeIndex\".\n * * Together with [[facetIndex1]], this method can be used to iterate the face loop of the facet\n * with index `iFacet` as follows:\n * ````\n * for (let iEdge = this.facetIndex0(iFacet); iEdge < this.facetIndex1(iFacet); iEdge++) {\n * const iPoint = this.data.pointIndex[iEdge];\n * const p = this.data.point[iPoint];\n * // ... process the edge of this facet starting at point p\n * }\n * ````\n /\n public facetIndex0(facetIndex: number): number {\n return this._facetStart[facetIndex];\n }\n /\n Given a valid facet index, return one past the index at which its face loop ends in the index arrays.\n * * For details, see [[facetIndex0]].\n /\n public facetIndex1(facetIndex: number): number {\n return this._facetStart[facetIndex + 1];\n }\n /* Return a readonly reference to the facetStart array accessed by [[facetIndex0]] and [[facetIndex1]]. /\n public get facetStart(): ReadonlyArray<number> {\n return this._facetStart;\n }\n /* create a visitor for this polyface /\n public createVisitor(numWrap: number = 0): IndexedPolyfaceVisitor {\n return IndexedPolyfaceVisitor.create(this, numWrap);\n }\n /* Extend `range` with coordinates from this mesh, optionally transformed. /\n public extendRange(range: Range3d, transform?: Transform): void {\n this.data.extendRange(range, transform);\n }\n /\n Given the index of a facet, return the data pertaining to the face it is a part of.\n * @deprecated in 4.5.0 - will not be removed until after 2026-06-13. Use [[IndexedPolyface.tryGetFaceData]], which verifies the index is in range.\n /\n public getFaceDataByFacetIndex(facetIndex: number): FacetFaceData {\n return this.data.face[this._facetToFaceData[facetIndex]];\n }\n /\n Set new FacetFaceData.\n * * All terminated facets since the last face declaration will be mapped to a single new FacetFaceData object using\n * facetToFaceData[]. FacetFaceData holds the 2D range of the face. Returns `true` if successful, `false` otherwise.\n /\n public setNewFaceData(endFacetIndex: number = 0): boolean {\n const facetStart = this._facetToFaceData.length;\n if (facetStart >= this._facetStart.length)\n return false;\n if (0 === endFacetIndex) // the default for endFacetIndex is really the last facet\n endFacetIndex = this._facetStart.length; // last facet index corresponds to the future facet\n const faceData = FacetFaceData.createNull();\n const visitor = IndexedPolyfaceVisitor.create(this, 0);\n if (!visitor.moveToReadIndex(facetStart)) { // move visitor to first facet of new face\n return false;\n }\n // if parameter range is provided (by the polyface planeSet clipper) then use it\n const paramDefined = this.data.param !== undefined;\n const setParamRange: boolean = faceData.paramRange.isNull && paramDefined;\n do {\n if (setParamRange && visitor.param !== undefined)\n visitor.param.extendRange(faceData.paramRange);\n } while (visitor.moveToNextFacet() && visitor.currentReadIndex() < endFacetIndex);\n if (paramDefined && !(this.data.param!.length === 0) && faceData.paramDistanceRange.isNull)\n faceData.setParamDistanceRangeFromNewFaceData(this, facetStart, endFacetIndex);\n this.data.face.push(faceData);\n const faceDataIndex = this.data.face.length - 1;\n for (let i = this._facetToFaceData.length; i < endFacetIndex; i++)\n this._facetToFaceData.push(0 === this._facetStart[i] ? 0 : faceDataIndex);\n return true;\n }\n /* Second step of double dispatch: call `handler.handleIndexedPolyface(this)`. /\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\n return handler.handleIndexedPolyface(this);\n }\n /* If the input accesses an edgeMateIndex array, return it along with the owning IndexedPolyface. /\n public static hasEdgeMateIndex(polyface: Polyface \| PolyfaceVisitor): { parent: IndexedPolyface, edgeMateIndex: Array<number \| undefined> } \| undefined {\n let parent: IndexedPolyface \| undefined;\n if (polyface instanceof Polyface) {\n if (polyface instanceof IndexedPolyface)\n parent = polyface;\n } else if (polyface.clientPolyface() && polyface.clientPolyface() instanceof IndexedPolyface)\n parent = polyface.clientPolyface() as IndexedPolyface;\n if (parent) {\n const edgeMateIndex = parent.data.edgeMateIndex;\n if (edgeMateIndex && edgeMateIndex.length > 0 && edgeMateIndex.length === parent.data.indexCount)\n return { parent, edgeMateIndex };\n }\n return undefined;\n }\n}\n\n/\n A PolyfaceVisitor manages data while iterating facets.\n * * The polyface visitor holds data for one facet at a time.\n * * The caller can request the position in the addressed polyfaceData as a \"readIndex\".\n * * The readIndex values (as numbers) are not assumed to be sequential (i.e., they might be contiguous facet indices\n * or the indexing scheme might have gaps at the whim of the particular PolyfaceVisitor implementation).\n * * Example usage:\n * ```\n * const visitor = myPolyface.createVisitor();\n * for (visitor.reset(); visitor.moveToNextFacet(); ) {\n * // process the current facet\n * }\n * ```\n * @public\n /\nexport interface PolyfaceVisitor extends PolyfaceData {\n /* Load data for the facet with given index. /\n moveToReadIndex(index: number): boolean;\n /* Return the index of the currently loaded facet. /\n currentReadIndex(): number;\n /* Load data for the next facet. /\n moveToNextFacet(): boolean;\n /* Restart the visitor at the first facet. /\n reset(): void;\n /* Return the point index of vertex i within the currently loaded facet. /\n clientPointIndex(i: number): number;\n /* Return the param index of vertex i within the currently loaded facet. /\n clientParamIndex(i: number): number;\n /* Return the normal index of vertex i within the currently loaded facet. /\n clientNormalIndex(i: number): number;\n /* Return the color index of vertex i within the currently loaded facet. /\n clientColorIndex(i: number): number;\n /* Return the aux data index of vertex i within the currently loaded facet. /\n clientAuxIndex(i: number): number;\n /* Return the client polyface. /\n clientPolyface(): Polyface \| undefined;\n /\n Set the number of vertices replicated in visitor arrays (both data and index arrays).\n * * 0,1,2 are the most common values.\n * * Example: suppose `[6,7,8]` is the pointIndex array representing a triangle. First edge would be `6,7`. Second\n * edge is `7,8`. Third edge is `8,6`. To access `6` for the third edge, we have to go back to the start of array.\n * Therefore, it is useful to store `6` at the end of pointIndex array, i.e., `[6,7,8,6]` meaning `numWrap = 1`.\n * * Continuing this example, `numWrap = 2` (i.e., `[6,7,8,6,7]`) is useful when each vertex visit requires\n * the next two points, e.g., to form two adjacent vectors for a cross product.\n /\n setNumWrap(numWrap: number): void;\n /* Clear the contents of the data arrays. Use this along with `pushDataFrom` to build up new facets. /\n clearArrays(): void;\n /* Transfer data from a specified index of the other visitor as new data in this visitor. /\n pushDataFrom(other: PolyfaceVisitor, index: number): void;\n /\n Transfer interpolated data from the other visitor.\n * * All data values are interpolated at `fraction` between `other` values at `index0` and `index1`.\n /\n pushInterpolatedDataFrom(other: PolyfaceVisitor, index0: number, fraction: number, index1: number): void;\n /\n Return the number of facets this visitor is able to visit.\n * * Allows implementers to improve the efficiency of e.g., [[PolyfaceQuery.visitorClientFacetCount]].\n /\n getVisitableFacetCount?(): number;\n /* Create a visitor for a subset of the facets visitable by the instance. */\n createSubsetVisitor?(facetIndices: number[], numWrap: number): PolyfaceVisitor;\n}\n"]}
1	+ {"version":3,"file":"Polyface.js","sourceRoot":"","sources":["../../../src/polyface/Polyface.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,2BAA2B;AAE3B,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,OAAO,EAAW,MAAM,qBAAqB,CAAC;AAEvD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;GAIG;AACH,MAAM,OAAgB,QAAS,SAAQ,aAAa;IAClD,wCAAwC;IACxB,gBAAgB,GAAG,UAAU,CAAC;IAC9C,gCAAgC;IACzB,IAAI,CAAe;IAC1B,kBAAkB;IAClB,YAAsB,IAAkB;QACtC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAMD;;OAEG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;IAC5B,CAAC;IACD,IAAW,QAAQ,CAAC,KAAc;QAChC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IAC7B,CAAC;IACD;;;;OAIG;IACH,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC;IACnC,CAAC;IACD,IAAW,eAAe,CAAC,KAAa;QACtC,IAAI,CAAC,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC;IACpC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,eAAe,CAC3B,OAA6B,EAC7B,cAAsB,EACtB,cAAsB,EACtB,IAAS,EACT,UAAkB;QAElB,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAC7C,OAAO,IAAI,CAAC;QACd,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAC7C,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,IAAI,OAAO,CAAC,MAAM;YACxD,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,IAAI,cAAc,IAAI,cAAc,GAAG,OAAO,CAAC,MAAM;YACrE,OAAO,KAAK,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,cAAc,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE;YAClD,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,UAAU;gBAC5C,OAAO,KAAK,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,iFAAiF;IACjF,IAAW,UAAU;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,eAAgB,SAAQ,QAAQ;IAC3C;;;;;;;OAOG;IACO,WAAW,CAAW;IAChC;;;OAGG;IACO,gBAAgB,CAAW;IACrC;;;;;OAKG;IACH,YAAsB,IAAkB,EAAE,UAAqB,EAAE,eAA0B;QACzF,KAAK,CAAC,IAAI,CAAC,CAAC;QACZ,IAAI,UAAU;YACZ,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,YAAY;aAChD,CAAC;YACJ,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,eAAe;YACjB,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,YAAY;;YAE7D,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;IAC/B,CAAC;IAED,4GAA4G;IACrG,qBAAqB,CAAC,CAAqB;QAChD,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,SAAS,CAAC;QACnB,OAAO,WAAW,CAAC,+BAA+B,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,CAAqB;QAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,wDAAwD;IACjD,mBAAmB,CAAC,KAAU;QACnC,OAAO,KAAK,YAAY,eAAe,CAAC;IAC1C,CAAC;IACD,0DAA0D;IAC1C,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC;gBACxC,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC;gBAC7D,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,gBAAgB,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,gFAAgF;IAChF,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;IACzE,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC;YACpC,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,0CAA0C;IACnC,kBAAkB,CAAC,OAAe;QACvC,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACjE,CAAC;IACD,2BAA2B;IACpB,KAAK;QACV,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,sDAAsD;IAC/C,cAAc;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7C,CAAC;IACD,mDAAmD;IAC5C,cAAc;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;IAC7B,CAAC;IACD;;;;MAIE;IACK,cAAc,CAAC,CAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM;YAC5C,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YACrD,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IACD;;;;;;OAMG;IACI,kBAAkB,CAAC,MAAuB,EAAE,QAAiB,EAAE,SAAgC;QACpG,MAAM,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC;QAC1C,mDAAmD;QACnD,2FAA2F;QAC3F,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAChD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1D,IAAI,SAAS,EAAE,CAAC;gBACd,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACrB,CAAC;;gBACC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrC,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,oEAAoE;oBAChG,IAAI,CAAC,aAAa,CAChB,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAC5C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CACjD,CAAC;gBACJ,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,IAAI,CAAC,aAAa,CAChB,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAC5C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAC3B,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,iCAAiC;QACjC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAC7G,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAChD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,0DAA0D;gBACpG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;YACH,CAAC;QACH,CAAC;QACD,mCAAmC;QACnC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAChH,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,CAAE,CAAC;gBAC5E,IAAI,SAAS;oBACX,SAAS,CAAC,cAAc,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;gBACvD,IAAI,QAAQ;oBACV,YAAY,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;gBAClC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YAC/B,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,0DAA0D;gBACpG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,cAAc,CAAC,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,cAAc,CAAC,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,CAAC;YACH,CAAC;QACH,CAAC;QACD,iCAAiC;QACjC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAC7G,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAChD,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK;gBACzC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,yDAAyD;gBACnG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;YACH,CAAC;QACH,CAAC;QACD,sCAAsC;QACtC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YACjD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACpC,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACtC,CAAC;YACD,KAAK,MAAM,cAAc,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBACrD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,GAAG,cAAc,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACH,IAAW,wBAAwB;QACjC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IACnE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,MAAM,CAClB,cAAuB,KAAK,EAC5B,aAAsB,KAAK,EAC3B,aAAsB,KAAK,EAC3B,WAAoB,IAAI;QAExB,OAAO,IAAI,eAAe,CAAC,IAAI,YAAY,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAc,EAAE,UAAmB;QACjD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACzE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;gBACpE,OAAO,UAAU,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACI,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAChD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;OAIG;IACI,QAAQ,CAAC,KAAc;QAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;OAOG;IACI,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,WAAoB,EAAE,WAAoB;QAChF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC1C,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;YACrF,OAAO,WAAW,CAAC;QACrB,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;YACrF,OAAO,WAAW,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACI,SAAS,CAAC,MAAgB,EAAE,WAAoB,EAAE,WAAoB;QAC3E,8DAA8D;QAC9D,MAAM,iBAAiB,GAAG,CAAC,CAAS,EAAE,EAAE;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,CAAC,oBAAoB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACnE,OAAO,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAC5E,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACnC,IAAI,WAAW,KAAK,SAAS,IAAI,iBAAiB,CAAC,WAAW,CAAC;gBAC7D,OAAO,WAAW,CAAC;YACrB,IAAI,WAAW,KAAK,SAAS,IAAI,iBAAiB,CAAC,WAAW,CAAC;gBAC7D,OAAO,WAAW,CAAC;YACrB,8CAA8C;YAC9C,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC9C,IAAI,iBAAiB,CAAC,SAAS,CAAC;oBAC9B,OAAO,SAAS,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IACD;;;;;;OAMG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YACnB,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;QAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC,CAAC;IACD;;;;OAIG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,mDAAmD;IAC5C,aAAa,CAAC,KAAa,EAAE,UAAmB,IAAI;QACzD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC;IACD,0BAA0B;IACnB,cAAc,CAAC,KAAa;QACjC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW;YACxB,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IACD,yBAAyB;IAClB,aAAa,CAAC,KAAa;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU;YACvB,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IACD,yBAAyB;IAClB,aAAa,CAAC,KAAa;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU;YACvB,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IACD;;;;OAIG;IACI,gBAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC;IAED;;;;;OAKG;IACI,kBAAkB,CAAC,SAAiB,CAAC,EAAE,MAAiB;QAC7D,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACpD,MAAM,QAAQ,GAAG,MAAM,IAAI,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,eAAe,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;YACxC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,eAAe,EAAE,CAAC;YAC5C,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;YACtC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,eAAe;YAC3E,QAAQ,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;QACjE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,eAAe;YACzE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,eAAe;YACzE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,eAAe;YAClD,QAAQ,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;QAClE,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7I,QAAQ,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;QACpD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,eAAe;gBACpD,QAAQ,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;iBAC9D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAqB,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBAClH,QAAQ,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,CAAC,KAAK,QAAQ,CAAC,MAAM,CAAC;IAC/B,CAAC;IAED;;;;;;;OAOG;IACI,cAAc,CAAC,qBAA8B,IAAI;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9C,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAC5C,sFAAsF;QACtF,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,IAAI,kBAAkB,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,IAAI,OAAO,GAAG,OAAO,GAAG,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,uCAAuC,CAAC,CAAC;YACzD,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAC3C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;gBACtC,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,yCAAyC;QACzE,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6CAA6C;IAC7C,IAAoB,UAAU;QAC5B,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC,CAAC;IACD,4CAA4C;IAC5C,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC;IAC7B,CAAC;IACD,6CAA6C;IAC7C,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,6CAA6C;IAC7C,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,iDAAiD;IACjD,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,8CAA8C;IAC9C,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;IAC/B,CAAC;IACD,8CAA8C;IACvC,iBAAiB,CAAC,UAAkB;QACzC,OAAO,UAAU,IAAI,CAAC,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACzD,CAAC;IACD,wDAAwD;IACjD,cAAc,CAAC,UAAkB;QACtC,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC;YACpC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QACzE,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,WAAW,CAAC,UAAkB;QACnC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;IACtC,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,UAAkB;QACnC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,2GAA2G;IAC3G,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IACD,yCAAyC;IAClC,aAAa,CAAC,UAAkB,CAAC;QACtC,OAAO,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IACD,8EAA8E;IACvE,WAAW,CAAC,KAAc,EAAE,SAAqB;QACtD,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC1C,CAAC;IACD;;;OAGG;IACI,uBAAuB,CAAC,UAAkB;QAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3D,CAAC;IACD;;;;OAIG;IACI,cAAc,CAAC,gBAAwB,CAAC;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;QAChD,IAAI,UAAU,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM;YACvC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,KAAK,aAAa,EAAE,yDAAyD;YAChF,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,mDAAmD;QAC9F,MAAM,QAAQ,GAAG,aAAa,CAAC,UAAU,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,0CAA0C;YACpF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,gFAAgF;QAChF,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC;QACnD,MAAM,aAAa,GAAY,QAAQ,CAAC,UAAU,CAAC,MAAM,IAAI,YAAY,CAAC;QAC1E,GAAG,CAAC;YACF,IAAI,aAAa,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;gBAC9C,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACnD,CAAC,QAAQ,OAAO,CAAC,eAAe,EAAE,IAAI,OAAO,CAAC,gBAAgB,EAAE,GAAG,aAAa,EAAE;QAClF,IAAI,YAAY,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM;YACxF,QAAQ,CAAC,oCAAoC,CAAC,IAAI,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;QACjF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9B,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE;YAC/D,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;QAC5E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD,qGAAqG;IAC9F,MAAM,CAAC,gBAAgB,CAAC,QAAoC;QACjE,IAAI,MAAmC,CAAC;QACxC,IAAI,QAAQ,YAAY,QAAQ,EAAE,CAAC;YACjC,IAAI,QAAQ,YAAY,eAAe;gBACrC,MAAM,GAAG,QAAQ,CAAC;QACtB,CAAC;aAAM,IAAI,QAAQ,CAAC,cAAc,EAAE,IAAI,QAAQ,CAAC,cAAc,EAAE,YAAY,eAAe;YAC1F,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAqB,CAAC;QACxD,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC;YAChD,IAAI,aAAa,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU;gBAC9F,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,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\r\n/** @packageDocumentation\r\n * @module Polyface\r\n /\r\n\r\n// cspell:word internaldocs\r\n\r\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { GrowableXYArray } from \"../geometry3d/GrowableXYArray\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { NumberArray } from \"../geometry3d/PointHelpers\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { FacetFaceData } from \"./FacetFaceData\";\r\nimport { IndexedPolyfaceVisitor } from \"./IndexedPolyfaceVisitor\";\r\nimport { PolyfaceData } from \"./PolyfaceData\";\r\n\r\n/\r\n A Polyface is an abstract mesh structure (of unspecified implementation) that provides a PolyfaceVisitor\r\n * to iterate over its facets.\r\n * @public\r\n /\r\nexport abstract class Polyface extends GeometryQuery {\r\n /* String name for schema properties /\r\n public readonly geometryCategory = \"polyface\";\r\n /* Underlying polyface data. /\r\n public data: PolyfaceData;\r\n /* Constructor /\r\n protected constructor(data: PolyfaceData) {\r\n super();\r\n this.data = data;\r\n }\r\n /\r\n Create and return a visitor for this concrete polyface.\r\n * @param numWrap the number of vertices to replicate in visitor arrays.\r\n /\r\n public abstract createVisitor(numWrap: number): PolyfaceVisitor;\r\n /\r\n The [[PolyfaceData.twoSided]] flag.\r\n /\r\n public get twoSided() {\r\n return this.data.twoSided;\r\n }\r\n public set twoSided(value: boolean) {\r\n this.data.twoSided = value;\r\n }\r\n /\r\n Flag indicating if the mesh closure is unknown (0), open sheet (1), closed solid (2).\r\n * * A boundary edge of a mesh is defined as an edge with only one connected facet.\r\n * * Closed solid is a mesh with no boundary edge. Open sheet is a mesh that has boundary edge(s).\r\n /\r\n public get expectedClosure(): number {\r\n return this.data.expectedClosure;\r\n }\r\n public set expectedClosure(value: number) {\r\n this.data.expectedClosure = value;\r\n }\r\n /\r\n Check validity of indices into a data array.\r\n * * It is valid to have both indices and data undefined.\r\n * * It is NOT valid for just one to be defined.\r\n * * Index values at indices[indexPositionA <= i < indexPositionB] must be valid indices to the data array.\r\n * @param indices array of indices.\r\n * @param indexPositionA first index to test.\r\n * @param indexPositionB one past final index to test.\r\n * @param data data array.\r\n * @param dataLength length of data array.\r\n /\r\n public static areIndicesValid(\r\n indices: number[] \| undefined,\r\n indexPositionA: number,\r\n indexPositionB: number,\r\n data: any,\r\n dataLength: number,\r\n ): boolean {\r\n if (indices === undefined && data === undefined)\r\n return true;\r\n if (indices === undefined \|\| data === undefined)\r\n return false;\r\n if (indexPositionA < 0 \|\| indexPositionA >= indices.length)\r\n return false;\r\n if (indexPositionB <= indexPositionA \|\| indexPositionB > indices.length)\r\n return false;\r\n for (let i = indexPositionA; i < indexPositionB; i++)\r\n if (indices[i] < 0 \|\| indices[i] >= dataLength)\r\n return false;\r\n return true;\r\n }\r\n /* Returns true if this polyface has no facets. /\r\n public abstract get isEmpty(): boolean;\r\n /* Returns the number of facets of this polyface. Subclasses should override. /\r\n public get facetCount(): number \| undefined {\r\n return undefined;\r\n }\r\n}\r\n\r\n/\r\n An `IndexedPolyface` is a set of facets which can have normal, param, and color arrays with independent point,\r\n * normal, param, and color indices.\r\n * @public\r\n /\r\nexport class IndexedPolyface extends Polyface { // more info can be found at geometry/internaldocs/Polyface.md\r\n /\r\n Start indices of all facets of the polyface.\r\n * * Each element is an index to the `this.data.pointIndex` array entry for a specific facet.\r\n * * The facet count is `_facetStart.length - 1`.\r\n * * The face loop for the i_th facet consists of the entries in `this.data.pointIndex` at indices `_facetStart[i]`\r\n * up to (but not including) `_facetStart[i + 1]`.\r\n * * Note the array is initialized with one entry (value 0).\r\n /\r\n protected _facetStart: number[];\r\n /\r\n Index to the `this.data.face` array entry for a specific facet.\r\n * * `_facetToFaceData` has one entry per facet.\r\n /\r\n protected _facetToFaceData: number[];\r\n /\r\n Constructor for a new polyface.\r\n * @param data PolyfaceData arrays to capture.\r\n * @param facetStart optional array of facet start indices (e.g. known during clone)\r\n * @param facetToFacetData optional array of face identifiers (e.g. known during clone)\r\n /\r\n protected constructor(data: PolyfaceData, facetStart?: number[], facetToFaceData?: number[]) {\r\n super(data);\r\n if (facetStart)\r\n this._facetStart = facetStart.slice(); // deep copy\r\n else {\r\n this._facetStart = [];\r\n this._facetStart.push(0);\r\n }\r\n if (facetToFaceData)\r\n this._facetToFaceData = facetToFaceData.slice(); // deep copy\r\n else\r\n this._facetToFaceData = [];\r\n }\r\n\r\n /* Given an edgeIndex (index into `data.pointIndex`), return the index of the facet containing the edge. /\r\n public edgeIndexToFacetIndex(k: number \| undefined): number \| undefined {\r\n if (k === undefined)\r\n return undefined;\r\n return NumberArray.searchStrictlyIncreasingNumbers(this._facetStart, k);\r\n }\r\n /\r\n Given an edgeIndex (index into `data.pointIndex`), return the range of the edgeIndices of the containing facet.\r\n * * If an edge with edgeIndex `k` is found in the facet with facetIndex `f`, then the returned range `r` satisfies\r\n * `r.low = this.facetIndex0(f) <= k < this.facetIndex1(f) = r.high` and can be used to iterate the facet's face\r\n * loop. See [[facetIndex0]].\r\n /\r\n public edgeIndexToFaceLoop(k: number \| undefined): Range1d \| undefined {\r\n const q = this.edgeIndexToFacetIndex(k);\r\n if (q !== undefined)\r\n return Range1d.createXX(this.facetIndex0(q), this.facetIndex1(q));\r\n return undefined;\r\n }\r\n\r\n /* Test if other is an instance of `IndexedPolyface` /\r\n public isSameGeometryClass(other: any): boolean {\r\n return other instanceof IndexedPolyface;\r\n }\r\n /* Tests for equivalence between two IndexedPolyfaces. /\r\n public override isAlmostEqual(other: any): boolean {\r\n if (other instanceof IndexedPolyface) {\r\n return this.data.isAlmostEqual(other.data) &&\r\n NumberArray.isExactEqual(this._facetStart, other._facetStart) &&\r\n NumberArray.isExactEqual(this._facetToFaceData, other._facetToFaceData);\r\n }\r\n return false;\r\n }\r\n /* Returns true if either the point array or the point index array is empty. /\r\n public get isEmpty(): boolean {\r\n return this.data.pointCount === 0 \|\| this.data.pointIndex.length === 0;\r\n }\r\n /\r\n Transform the mesh.\r\n * * If `transform` is a mirror, also reverse the index order around each facet.\r\n * * Note that this method always returns true. If transforming the normals fails (due to singular matrix or zero\r\n * normal), the original normal(s) are left unchanged.\r\n /\r\n public tryTransformInPlace(transform: Transform): boolean {\r\n this.data.tryTransformInPlace(transform);\r\n if (transform.matrix.determinant() < 0)\r\n this.reverseIndices();\r\n return true;\r\n }\r\n /* Reverse indices for a single facet. /\r\n public reverseSingleFacet(facetId: number) {\r\n this.data.reverseIndicesSingleFacet(facetId, this._facetStart);\r\n }\r\n /* Return a deep clone. /\r\n public clone(): IndexedPolyface {\r\n return new IndexedPolyface(this.data.clone(), this._facetStart.slice(), this._facetToFaceData.slice());\r\n }\r\n /\r\n Return a deep clone with transformed points and normals.\r\n * @see [[IndexedPolyface.tryTransformInPlace]] for details of how transform is done.\r\n /\r\n public cloneTransformed(transform: Transform): IndexedPolyface { // we know tryTransformInPlace succeeds.\r\n const result = this.clone();\r\n result.tryTransformInPlace(transform);\r\n return result;\r\n }\r\n /* Reverse the order of indices around all facets. /\r\n public reverseIndices() {\r\n this.data.reverseIndices(this._facetStart);\r\n }\r\n /* Reverse the direction of all normal vectors. /\r\n public reverseNormals() {\r\n this.data.reverseNormals();\r\n }\r\n /\r\n Return face data using a facet index.\r\n * * Returns `undefined` if none found.\r\n * * This is the REFERENCE to the FacetFaceData not a copy.\r\n /\r\n public tryGetFaceData(i: number): FacetFaceData \| undefined {\r\n if (i < 0 \|\| i >= this._facetToFaceData.length)\r\n return undefined;\r\n const faceIndex = this._facetToFaceData[i];\r\n if (faceIndex < 0 \|\| faceIndex >= this.data.face.length)\r\n return undefined;\r\n return this.data.face[faceIndex];\r\n }\r\n /\r\n Add facets from `source` to `this` polyface.\r\n * * Optionally reverse facet indices as per `PolyfaceData.reverseIndicesSingleFacet()` with `preserveStart = false` and\r\n * invert source normals.\r\n * * Optionally apply a `transform` to points and normals.\r\n * * Will only copy param, normal, color, and face data if we are already tracking them AND/OR the source contains them.\r\n /\r\n public addIndexedPolyface(source: IndexedPolyface, reversed: boolean, transform: Transform \| undefined) {\r\n const numSourceFacets = source.facetCount;\r\n // add point, point index, and edge visibility data\r\n // note that there is no need to build an intermediate index map since all points are added\r\n const startOfNewPoints = this.data.point.length;\r\n const xyz = Point3d.create();\r\n for (let i = 0; i < source.data.point.length; i++) {\r\n source.data.point.getPoint3dAtUncheckedPointIndex(i, xyz);\r\n if (transform) {\r\n transform.multiplyPoint3d(xyz, xyz);\r\n this.addPoint(xyz);\r\n } else\r\n this.addPoint(xyz);\r\n }\r\n for (let i = 0; i < numSourceFacets; i++) {\r\n const i0 = source._facetStart[i];\r\n const i1 = source._facetStart[i + 1];\r\n if (reversed) {\r\n for (let j = i1; j-- > i0;) { // visibility is transferred from far vertex, e.g., -abc-d => dc-b-a\r\n this.addPointIndex(\r\n startOfNewPoints + source.data.pointIndex[j],\r\n source.data.edgeVisible[j > i0 ? j - 1 : i1 - 1],\r\n );\r\n }\r\n } else {\r\n for (let j = i0; j < i1; j++) {\r\n this.addPointIndex(\r\n startOfNewPoints + source.data.pointIndex[j],\r\n source.data.edgeVisible[j],\r\n );\r\n }\r\n }\r\n this.terminateFacet(false);\r\n }\r\n // add param and param index data\r\n if (undefined !== this.data.param && undefined !== source.data.param && undefined !== source.data.paramIndex) {\r\n const startOfNewParams = this.data.param.length;\r\n this.data.param.pushFromGrowableXYArray(source.data.param);\r\n for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match normals\r\n const i0 = source._facetStart[i];\r\n const i1 = source._facetStart[i + 1];\r\n if (reversed) {\r\n for (let j = i1; j-- > i0;)\r\n this.addParamIndex(startOfNewParams + source.data.paramIndex[j]);\r\n } else {\r\n for (let j = i0; j < i1; j++)\r\n this.addParamIndex(startOfNewParams + source.data.paramIndex[j]);\r\n }\r\n }\r\n }\r\n // add normal and normal index data\r\n if (undefined !== this.data.normal && undefined !== source.data.normal && undefined !== source.data.normalIndex) {\r\n const startOfNewNormals = this.data.normal.length;\r\n for (let i = 0; i < source.data.normal.length; i++) {\r\n const sourceNormal = source.data.normal.getVector3dAtCheckedVectorIndex(i)!;\r\n if (transform)\r\n transform.multiplyVector(sourceNormal, sourceNormal);\r\n if (reversed)\r\n sourceNormal.scaleInPlace(-1.0);\r\n this.addNormal(sourceNormal);\r\n }\r\n for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match normals\r\n const i0 = source._facetStart[i];\r\n const i1 = source._facetStart[i + 1];\r\n if (reversed) {\r\n for (let j = i1; j-- > i0;)\r\n this.addNormalIndex(startOfNewNormals + source.data.normalIndex[j]);\r\n } else {\r\n for (let j = i0; j < i1; j++)\r\n this.addNormalIndex(startOfNewNormals + source.data.normalIndex[j]);\r\n }\r\n }\r\n }\r\n // add color and color index data\r\n if (undefined !== this.data.color && undefined !== source.data.color && undefined !== source.data.colorIndex) {\r\n const startOfNewColors = this.data.color.length;\r\n for (const sourceColor of source.data.color)\r\n this.addColor(sourceColor);\r\n for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match colors\r\n const i0 = source._facetStart[i];\r\n const i1 = source._facetStart[i + 1];\r\n if (reversed) {\r\n for (let j = i1; j-- > i0;)\r\n this.addColorIndex(startOfNewColors + source.data.colorIndex[j]);\r\n } else {\r\n for (let j = i0; j < i1; j++)\r\n this.addColorIndex(startOfNewColors + source.data.colorIndex[j]);\r\n }\r\n }\r\n }\r\n // add face and facetToFace index data\r\n if (source.data.face.length !== 0) {\r\n const startOfNewFaceData = this.data.face.length;\r\n for (const face of source.data.face) {\r\n const sourceFaceData = face.clone();\r\n this.data.face.push(sourceFaceData);\r\n }\r\n for (const facetToFaceIdx of source._facetToFaceData) {\r\n this._facetToFaceData.push(startOfNewFaceData + facetToFaceIdx);\r\n }\r\n }\r\n }\r\n /\r\n Return the total number of indices in zero-terminated style, which includes\r\n * * all the indices in the packed zero-based table.\r\n * * one additional index for the zero-terminator of each facet.\r\n * @note Note that all index arrays (pointIndex, normalIndex, paramIndex, colorIndex) have the same counts, so there\r\n * is not a separate query for each of them.\r\n /\r\n public get zeroTerminatedIndexCount(): number {\r\n return this.data.pointIndex.length + this._facetStart.length - 1;\r\n }\r\n /\r\n Create an empty facet set with coordinate and index data to be supplied later.\r\n * @param needNormals `true` to allocate empty normal data and index arrays; `false` (default) to leave undefined.\r\n * @param needParams `true` to allocate empty uv parameter data and index arrays; `false` (default) to leave undefined.\r\n * @param needColors `true` to allocate empty color data and index arrays; `false` (default) to leave undefined.\r\n * @param twoSided `true` (default) if the facets are to be considered viewable from the back; `false` if they are amenable to backface culling.\r\n /\r\n public static create(\r\n needNormals: boolean = false,\r\n needParams: boolean = false,\r\n needColors: boolean = false,\r\n twoSided: boolean = true,\r\n ): IndexedPolyface {\r\n return new IndexedPolyface(new PolyfaceData(needNormals, needParams, needColors, twoSided));\r\n }\r\n /\r\n Add (a clone of) a point to point array.\r\n * @param point the point.\r\n * @param priorIndex (optional) index of prior point to check for possible duplicate value.\r\n * @returns the zero-based index of the added or duplicate point.\r\n /\r\n public addPoint(point: Point3d, priorIndex?: number): number {\r\n if (priorIndex !== undefined) {\r\n const distance = this.data.point.distanceIndexToPoint(priorIndex, point);\r\n if (distance !== undefined && Geometry.isSmallMetricDistance(distance))\r\n return priorIndex;\r\n }\r\n this.data.point.pushXYZ(point.x, point.y, point.z);\r\n return this.data.point.length - 1;\r\n }\r\n /\r\n Add a point to point array.\r\n * @param x the x coordinate of point.\r\n * @param y the y coordinate of point.\r\n * @param z the z coordinate of point.\r\n * @returns the zero-based index of the added point.\r\n /\r\n public addPointXYZ(x: number, y: number, z: number): number {\r\n this.data.point.pushXYZ(x, y, z);\r\n return this.data.point.length - 1;\r\n }\r\n /\r\n Add (a clone of) a uv parameter to the parameter array.\r\n * @param param the parameter.\r\n * @returns zero-based index of the added param.\r\n /\r\n public addParam(param: Point2d): number {\r\n if (!this.data.param)\r\n this.data.param = new GrowableXYArray();\r\n this.data.param.push(param);\r\n return this.data.param.length - 1;\r\n }\r\n /\r\n Add a uv parameter to the parameter array.\r\n * @param u the u part of parameter.\r\n * @param v the v part of parameter.\r\n * @param priorIndexA first index to check for possible duplicate value.\r\n * @param priorIndexB second index to check for possible duplicate value.\r\n * @returns zero-based index of the added or duplicate parameter.\r\n /\r\n public addParamUV(u: number, v: number, priorIndexA?: number, priorIndexB?: number): number {\r\n if (!this.data.param)\r\n this.data.param = new GrowableXYArray();\r\n if (priorIndexA !== undefined && this.data.isAlmostEqualParamIndexUV(priorIndexA, u, v))\r\n return priorIndexA;\r\n if (priorIndexB !== undefined && this.data.isAlmostEqualParamIndexUV(priorIndexB, u, v))\r\n return priorIndexB;\r\n this.data.param.pushXY(u, v);\r\n return this.data.param.length - 1;\r\n }\r\n /\r\n Add (a clone of) a normal vector to the normal array.\r\n * @param normal the normal vector.\r\n * @param priorIndexA first index to check for possible duplicate value.\r\n * @param priorIndexB second index to check for possible duplicate value.\r\n * @returns zero-based index of the added or duplicate normal.\r\n /\r\n public addNormal(normal: Vector3d, priorIndexA?: number, priorIndexB?: number): number {\r\n // check if `normal` is duplicate of `dataNormal` at index `i`\r\n const normalIsDuplicate = (i: number) => {\r\n const distance = this.data.normal!.distanceIndexToPoint(i, normal);\r\n return distance !== undefined && Geometry.isSmallMetricDistance(distance);\r\n };\r\n if (this.data.normal !== undefined) {\r\n if (priorIndexA !== undefined && normalIsDuplicate(priorIndexA))\r\n return priorIndexA;\r\n if (priorIndexB !== undefined && normalIsDuplicate(priorIndexB))\r\n return priorIndexB;\r\n // check the tail index for possible duplicate\r\n if (priorIndexA !== undefined \|\| priorIndexB !== undefined) {\r\n const tailIndex = this.data.normal.length - 1;\r\n if (normalIsDuplicate(tailIndex))\r\n return tailIndex;\r\n }\r\n }\r\n return this.addNormalXYZ(normal.x, normal.y, normal.z);\r\n }\r\n /\r\n Add a normal vector to the normal array.\r\n * @param x the x coordinate of normal.\r\n * @param y the y coordinate of normal.\r\n * @param z the z coordinate of normal.\r\n * @returns zero-based index of the added normal vector.\r\n /\r\n public addNormalXYZ(x: number, y: number, z: number): number {\r\n if (!this.data.normal)\r\n this.data.normal = new GrowableXYZArray();\r\n this.data.normal.pushXYZ(x, y, z);\r\n return this.data.normal.length - 1;\r\n }\r\n /\r\n Add a color to the color array\r\n * @param color the color.\r\n * @returns zero-based index of the added color.\r\n /\r\n public addColor(color: number): number {\r\n if (!this.data.color)\r\n this.data.color = [];\r\n this.data.color.push(color);\r\n return this.data.color.length - 1;\r\n }\r\n /* Add a point index with edge visibility flag. /\r\n public addPointIndex(index: number, visible: boolean = true): void {\r\n this.data.pointIndex.push(index);\r\n this.data.edgeVisible.push(visible);\r\n }\r\n /* Add a normal index. /\r\n public addNormalIndex(index: number): void {\r\n if (!this.data.normalIndex)\r\n this.data.normalIndex = [];\r\n this.data.normalIndex.push(index);\r\n }\r\n /* Add a param index. /\r\n public addParamIndex(index: number): void {\r\n if (!this.data.paramIndex)\r\n this.data.paramIndex = [];\r\n this.data.paramIndex.push(index);\r\n }\r\n /* Add a color index. /\r\n public addColorIndex(index: number): void {\r\n if (!this.data.colorIndex)\r\n this.data.colorIndex = [];\r\n this.data.colorIndex.push(index);\r\n }\r\n /\r\n Clean up the open facet.\r\n * @deprecated in 4.5.0 - will not be removed until after 2026-06-13. To remove nebulous \"open facet\" concept from the API. Call [[PolyfaceData.trimAllIndexArrays]]\r\n * instead.\r\n /\r\n public cleanupOpenFacet(): void {\r\n this.data.trimAllIndexArrays(this.data.pointIndex.length);\r\n }\r\n\r\n /\r\n Validate (the tail of) the active index arrays: point, normal, param, color.\r\n * @param index0 optional offset into the index arrays at which to start validating indices. Default 0.\r\n * @param errors optional array appended with error message(s) if invalid indices are encountered\r\n * @return whether the indices are valid\r\n /\r\n public validateAllIndices(index0: number = 0, errors?: string[]): boolean {\r\n const numPointIndices = this.data.pointIndex.length;\r\n const messages = errors ?? [];\r\n if (0 === numPointIndices) {\r\n messages.push(\"empty pointIndex array\");\r\n return false;\r\n }\r\n if (index0 < 0 \|\| index0 >= numPointIndices) {\r\n messages.push(\"invalid input offset\");\r\n return false;\r\n }\r\n if (this.data.normalIndex && this.data.normalIndex.length !== numPointIndices)\r\n messages.push(\"normalIndex count must match pointIndex count\");\r\n if (this.data.paramIndex && this.data.paramIndex.length !== numPointIndices)\r\n messages.push(\"paramIndex count must equal pointIndex count\");\r\n if (this.data.colorIndex && this.data.colorIndex.length !== numPointIndices)\r\n messages.push(\"colorIndex count must equal pointIndex count\");\r\n if (this.data.edgeVisible.length !== numPointIndices)\r\n messages.push(\"visibleIndex count must equal pointIndex count\");\r\n if (!Polyface.areIndicesValid(this.data.pointIndex, index0, numPointIndices, this.data.point, this.data.point ? this.data.point.length : 0))\r\n messages.push(\"invalid point index encountered\");\r\n if (!Polyface.areIndicesValid(this.data.normalIndex, index0, numPointIndices, this.data.normal, this.data.normal ? this.data.normal.length : 0))\r\n messages.push(\"invalid normal index encountered\");\r\n if (!Polyface.areIndicesValid(this.data.paramIndex, index0, numPointIndices, this.data.param, this.data.param ? this.data.param.length : 0))\r\n messages.push(\"invalid param index encountered\");\r\n if (!Polyface.areIndicesValid(this.data.colorIndex, index0, numPointIndices, this.data.color, this.data.color ? this.data.color.length : 0))\r\n messages.push(\"invalid color index encountered\");\r\n if (this.data.edgeMateIndex) {\r\n if (this.data.edgeMateIndex.length !== numPointIndices)\r\n messages.push(\"edgeMateIndex count must equal pointIndex count\");\r\n else if (!this.data.edgeMateIndex.every((i: number \| undefined) => i === undefined \|\| this.data.isValidEdgeIndex(i)))\r\n messages.push(\"invalid edgeMate encountered\");\r\n }\r\n return 0 === messages.length;\r\n }\r\n\r\n /\r\n Announce the end of construction of a facet.\r\n * * Optionally check for:\r\n * * Same number of indices among all active index arrays -- point, normal, param, color\r\n * * All indices for the latest facet are within bounds of the respective data arrays.\r\n * * In error cases, all index arrays are trimmed back to the size when previous facet was terminated.\r\n * * A return value of `undefined` is normal. Otherwise, a string array of error messages is returned.\r\n /\r\n public terminateFacet(validateAllIndices: boolean = true): string[] \| undefined {\r\n const numFacets = this._facetStart.length - 1;\r\n // number of indices in accepted facets\r\n const lengthA = this._facetStart[numFacets];\r\n // number of indices in all facets (accepted facet plus the last facet to be accepted)\r\n const lengthB = this.data.pointIndex.length;\r\n if (validateAllIndices) {\r\n const messages: string[] = [];\r\n if (lengthB < lengthA + 2)\r\n messages.push(\"Less than 3 indices in the last facet\");\r\n this.validateAllIndices(lengthA, messages);\r\n if (messages.length > 0) {\r\n this.data.trimAllIndexArrays(lengthA);\r\n return messages;\r\n }\r\n }\r\n this._facetStart.push(lengthB); // append start index of the future facet\r\n return undefined;\r\n }\r\n /* Number of facets (read-only property). /\r\n public override get facetCount(): number {\r\n return this._facetStart.length - 1;\r\n }\r\n /* Number of faces (read-only property). /\r\n public get faceCount(): number {\r\n return this.data.faceCount;\r\n }\r\n /* Number of points (read-only property). /\r\n public get pointCount(): number {\r\n return this.data.pointCount;\r\n }\r\n /* Number of colors (read-only property). /\r\n public get colorCount(): number {\r\n return this.data.colorCount;\r\n }\r\n /* Number of parameters (read-only property). /\r\n public get paramCount(): number {\r\n return this.data.paramCount;\r\n }\r\n /* Number of normals (read-only property). /\r\n public get normalCount(): number {\r\n return this.data.normalCount;\r\n }\r\n /* Test if `index` is a valid facet index. /\r\n public isValidFacetIndex(facetIndex: number): boolean {\r\n return facetIndex >= 0 && facetIndex < this.facetCount;\r\n }\r\n /* Return the number of edges in a particular facet. /\r\n public numEdgeInFacet(facetIndex: number): number {\r\n if (this.isValidFacetIndex(facetIndex))\r\n return this._facetStart[facetIndex + 1] - this._facetStart[facetIndex];\r\n return 0;\r\n }\r\n /\r\n Given a valid facet index, return the index at which its face loop starts in the index arrays.\r\n * * A \"face loop\" is a contiguous block of indices into the parallel polyface index arrays.\r\n * * Each of these indices represents an edge of a facet, thus it is sometimes called an \"edgeIndex\".\r\n * * Together with [[facetIndex1]], this method can be used to iterate the face loop of the facet\r\n * with index `iFacet` as follows:\r\n * ````\r\n * for (let iEdge = this.facetIndex0(iFacet); iEdge < this.facetIndex1(iFacet); iEdge++) {\r\n * const iPoint = this.data.pointIndex[iEdge];\r\n * const p = this.data.point[iPoint];\r\n * // ... process the edge of this facet starting at point p\r\n * }\r\n * ````\r\n /\r\n public facetIndex0(facetIndex: number): number {\r\n return this._facetStart[facetIndex];\r\n }\r\n /\r\n Given a valid facet index, return one past the index at which its face loop ends in the index arrays.\r\n * * For details, see [[facetIndex0]].\r\n /\r\n public facetIndex1(facetIndex: number): number {\r\n return this._facetStart[facetIndex + 1];\r\n }\r\n /* Return a readonly reference to the facetStart array accessed by [[facetIndex0]] and [[facetIndex1]]. /\r\n public get facetStart(): ReadonlyArray<number> {\r\n return this._facetStart;\r\n }\r\n /* create a visitor for this polyface /\r\n public createVisitor(numWrap: number = 0): IndexedPolyfaceVisitor {\r\n return IndexedPolyfaceVisitor.create(this, numWrap);\r\n }\r\n /* Extend `range` with coordinates from this mesh, optionally transformed. /\r\n public extendRange(range: Range3d, transform?: Transform): void {\r\n this.data.extendRange(range, transform);\r\n }\r\n /\r\n Given the index of a facet, return the data pertaining to the face it is a part of.\r\n * @deprecated in 4.5.0 - will not be removed until after 2026-06-13. Use [[IndexedPolyface.tryGetFaceData]], which verifies the index is in range.\r\n /\r\n public getFaceDataByFacetIndex(facetIndex: number): FacetFaceData {\r\n return this.data.face[this._facetToFaceData[facetIndex]];\r\n }\r\n /\r\n Set new FacetFaceData.\r\n * * All terminated facets since the last face declaration will be mapped to a single new FacetFaceData object using\r\n * facetToFaceData[]. FacetFaceData holds the 2D range of the face. Returns `true` if successful, `false` otherwise.\r\n /\r\n public setNewFaceData(endFacetIndex: number = 0): boolean {\r\n const facetStart = this._facetToFaceData.length;\r\n if (facetStart >= this._facetStart.length)\r\n return false;\r\n if (0 === endFacetIndex) // the default for endFacetIndex is really the last facet\r\n endFacetIndex = this._facetStart.length; // last facet index corresponds to the future facet\r\n const faceData = FacetFaceData.createNull();\r\n const visitor = IndexedPolyfaceVisitor.create(this, 0);\r\n if (!visitor.moveToReadIndex(facetStart)) { // move visitor to first facet of new face\r\n return false;\r\n }\r\n // if parameter range is provided (by the polyface planeSet clipper) then use it\r\n const paramDefined = this.data.param !== undefined;\r\n const setParamRange: boolean = faceData.paramRange.isNull && paramDefined;\r\n do {\r\n if (setParamRange && visitor.param !== undefined)\r\n visitor.param.extendRange(faceData.paramRange);\r\n } while (visitor.moveToNextFacet() && visitor.currentReadIndex() < endFacetIndex);\r\n if (paramDefined && !(this.data.param!.length === 0) && faceData.paramDistanceRange.isNull)\r\n faceData.setParamDistanceRangeFromNewFaceData(this, facetStart, endFacetIndex);\r\n this.data.face.push(faceData);\r\n const faceDataIndex = this.data.face.length - 1;\r\n for (let i = this._facetToFaceData.length; i < endFacetIndex; i++)\r\n this._facetToFaceData.push(0 === this._facetStart[i] ? 0 : faceDataIndex);\r\n return true;\r\n }\r\n /* Second step of double dispatch: call `handler.handleIndexedPolyface(this)`. /\r\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n return handler.handleIndexedPolyface(this);\r\n }\r\n /* If the input accesses an edgeMateIndex array, return it along with the owning IndexedPolyface. /\r\n public static hasEdgeMateIndex(polyface: Polyface \| PolyfaceVisitor): { parent: IndexedPolyface, edgeMateIndex: Array<number \| undefined> } \| undefined {\r\n let parent: IndexedPolyface \| undefined;\r\n if (polyface instanceof Polyface) {\r\n if (polyface instanceof IndexedPolyface)\r\n parent = polyface;\r\n } else if (polyface.clientPolyface() && polyface.clientPolyface() instanceof IndexedPolyface)\r\n parent = polyface.clientPolyface() as IndexedPolyface;\r\n if (parent) {\r\n const edgeMateIndex = parent.data.edgeMateIndex;\r\n if (edgeMateIndex && edgeMateIndex.length > 0 && edgeMateIndex.length === parent.data.indexCount)\r\n return { parent, edgeMateIndex };\r\n }\r\n return undefined;\r\n }\r\n}\r\n\r\n/\r\n A PolyfaceVisitor manages data while iterating facets.\r\n * * The polyface visitor holds data for one facet at a time.\r\n * * The caller can request the position in the addressed polyfaceData as a \"readIndex\".\r\n * * The readIndex values (as numbers) are not assumed to be sequential (i.e., they might be contiguous facet indices\r\n * or the indexing scheme might have gaps at the whim of the particular PolyfaceVisitor implementation).\r\n * * Example usage:\r\n * ```\r\n * const visitor = myPolyface.createVisitor();\r\n * for (visitor.reset(); visitor.moveToNextFacet(); ) {\r\n * // process the current facet\r\n * }\r\n * ```\r\n * @public\r\n /\r\nexport interface PolyfaceVisitor extends PolyfaceData {\r\n /* Load data for the facet with given index. /\r\n moveToReadIndex(index: number): boolean;\r\n /* Return the index of the currently loaded facet. /\r\n currentReadIndex(): number;\r\n /* Load data for the next facet. /\r\n moveToNextFacet(): boolean;\r\n /* Restart the visitor at the first facet. /\r\n reset(): void;\r\n /* Return the point index of vertex i within the currently loaded facet. /\r\n clientPointIndex(i: number): number;\r\n /* Return the param index of vertex i within the currently loaded facet. /\r\n clientParamIndex(i: number): number;\r\n /* Return the normal index of vertex i within the currently loaded facet. /\r\n clientNormalIndex(i: number): number;\r\n /* Return the color index of vertex i within the currently loaded facet. /\r\n clientColorIndex(i: number): number;\r\n /* Return the aux data index of vertex i within the currently loaded facet. /\r\n clientAuxIndex(i: number): number;\r\n /* Return the client polyface. /\r\n clientPolyface(): Polyface \| undefined;\r\n /\r\n Set the number of vertices replicated in visitor arrays (both data and index arrays).\r\n * * 0,1,2 are the most common values.\r\n * * Example: suppose `[6,7,8]` is the pointIndex array representing a triangle. First edge would be `6,7`. Second\r\n * edge is `7,8`. Third edge is `8,6`. To access `6` for the third edge, we have to go back to the start of array.\r\n * Therefore, it is useful to store `6` at the end of pointIndex array, i.e., `[6,7,8,6]` meaning `numWrap = 1`.\r\n * * Continuing this example, `numWrap = 2` (i.e., `[6,7,8,6,7]`) is useful when each vertex visit requires\r\n * the next two points, e.g., to form two adjacent vectors for a cross product.\r\n /\r\n setNumWrap(numWrap: number): void;\r\n /* Clear the contents of the data arrays. Use this along with `pushDataFrom` to build up new facets. /\r\n clearArrays(): void;\r\n /* Transfer data from a specified index of the other visitor as new data in this visitor. /\r\n pushDataFrom(other: PolyfaceVisitor, index: number): void;\r\n /\r\n Transfer interpolated data from the other visitor.\r\n * * All data values are interpolated at `fraction` between `other` values at `index0` and `index1`.\r\n /\r\n pushInterpolatedDataFrom(other: PolyfaceVisitor, index0: number, fraction: number, index1: number): void;\r\n /\r\n Return the number of facets this visitor is able to visit.\r\n * * Allows implementers to improve the efficiency of e.g., [[PolyfaceQuery.visitorClientFacetCount]].\r\n /\r\n getVisitableFacetCount?(): number;\r\n /* Create a visitor for a subset of the facets visitable by the instance. */\r\n createSubsetVisitor?(facetIndices: number[], numWrap: number): PolyfaceVisitor;\r\n}\r\n"]}