@itwin/core-geometry 4.4.0-dev.9 → 4.5.0-dev.2

package/lib/esm/polyface/GreedyTriangulationBetweenLineStrings.js.map

@@ -1 +1 @@
-{"version":3,"file":"GreedyTriangulationBetweenLineStrings.js","sourceRoot":"","sources":["../../../src/polyface/GreedyTriangulationBetweenLineStrings.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,4BAA4B,EAAE,MAAM,yCAAyC,CAAC;AAEvF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD;;GAEG;AACH;;;GAGG;AACH,MAAa,qCAAqC;IAGhD,YAAoB,WAAmB;QACrC,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;IACnC,CAAC;IAIO,eAAe,CACrB,SAAmB,EACnB,OAAiB,EACjB,IAAc;QACd,IAAI,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,GAAG;YACtC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAG,SAAS,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,YAAY;YAC7C,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACO,YAAY,CAClB,OAA6B,EAC7B,KAAa,EACb,OAA6B,EAC7B,KAAa,EACb,IAAa,EACb,MAAgB,EAChB,QAAkB,EAClB,IAAa,EACb,MAAgB,EAChB,QAAkB;QAClB,IAAI,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE;YAC5D,OAAO,CAAC,+BAA+B,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACrD,OAAO,CAAC,+BAA+B,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACrD,OAAO,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YACrD,OAAO,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YACrD,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY;gBACjF,OAAO,IAAI,CAAC;SACf;QACD,OAAO,KAAK,CAAC;IAEf,CAAC;IACD;;;;;;OAMG;IACK,oBAAoB,CAC1B,MAAoC,EACpC,KAAmC,EACnC,QAAgB,EAChB,IAAa,EACb,KAAe,EACf,QAAkB,EAClB,KAAe,EACf,QAAkB;QAClB,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAE,gCAAgC;QAChF,OAAO,KAAK,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE;YAC7B,KAAK,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC/D,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;gBACvD,MAAM;YACR,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;gBACvD,MAAM;YACR,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE;gBACjB,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvE,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;oBACvD,MAAM;aACT;YACD,KAAK,CAAC,GAAG,EAAE,CAAC;SACb;IACH,CAAC;IAYD;;OAEG;IACK,SAAS,CACf,SAAuC,EACvC,SAAuC,EACvC,OAAgD,EAChD,WAAoB,KAAK;QACzB,SAAS,CAAC,WAAW,EAAE,CAAC;QACxB,SAAS,CAAC,WAAW,EAAE,CAAC;QAExB,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;YAEnD,wCAAwC;YACxC,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5L,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAChM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAEhM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC7L,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjM,gCAAgC;YAChC,kCAAkC;YAClC,qFAAqF;YACrF,uEAAuE;YACvE,6BAA6B;YAC7B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACpH,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACpH,iBAAiB,CAAC,6BAA6B,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACxF,2HAA2H;YAC3H,2HAA2H;YAE3H,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,EAAE;gBAC7B,SAAS,CAAC,YAAY,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,IAAI,QAAQ;oBACV,OAAO;aACV;iBAAM;gBACL,SAAS,CAAC,YAAY,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,IAAI,QAAQ;oBACV,OAAO;aACV;SACF;QACD,8JAA8J;QAC9J,IAAI,SAAS,CAAC,WAAW,EAAE;YACzB,OAAO,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE;gBAC5B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;gBAChM,gIAAgI;gBAChI,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,SAAS,CAAC,YAAY,EAAE,CAAC;aAC1B;SACF;QAED,0IAA0I;QAC1I,IAAI,SAAS,CAAC,WAAW,EAAE;YACzB,OAAO,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE;gBAC5B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;gBAChM,+HAA+H;gBAC/H,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,SAAS,CAAC,YAAY,EAAE,CAAC;aAC1B;SACF;IACH,CAAC;IAQD;;;;;OAKG;IACI,aAAa,CAClB,OAA6B,EAC7B,OAA6B,EAC7B,OAAgD;QAChD,mDAAmD;QACnD,IAAI,CAAC,eAAe,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,qBAAqB,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAChG,CAAC;IACD;;;;;OAKG;IACK,eAAe,CACrB,OAA6B,EAC7B,OAA6B,EAC7B,OAAgD;QAChD,MAAM,SAAS,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,SAAS,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACpE,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;YACrG,+BAA+B;YAC/B,+BAA+B;YAC/B,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE;gBAC7J,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1I,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1I,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;iBAAM,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE;gBACxK,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;iBAAM,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE;gBACxK,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvD,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;gBAC9C,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;gBAC/B,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;gBAC/B,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;YACD;;;;;sBAKU;SACX;QACD,gCAAgC;QAChC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IAGM,MAAM,CAAC,aAAa,CAAC,kBAAyB,IAAI,CAAC,wBAAwB;QAChF,OAAO,IAAI,qCAAqC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;IAC5E,CAAC;;AAJD,+DAA+D;AACjD,8DAAwB,GAAG,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;SAnPtD,qCAAqC;AAyPlD;;;;;GAKG;AACH,SAAS,qBAAqB,CAAC,IAA0B,EAAE,SAAS,GAAG,QAAQ,CAAC,mBAAmB;IACjG,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,SAAS,EAAE;YACnD,aAAa,GAAG,IAAI,CAAC;YACrB,MAAM;SACP;KACF;IACD,IAAI,CAAC,aAAa;QAChB,OAAO,IAAI,CAAC;IACd,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC;IACxH,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,IAAI,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,CAAC,CAAE,GAAG,SAAS,EAAE;YAC/C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC;YACxH,EAAE,GAAG,CAAC,CAAC;SACR;KACF;IACD,oDAAoD;IACpD,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,SAAS,EAAE;QACnD,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,MAAM,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;KAC5C;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","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\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { BarycentricTriangle } from \"../geometry3d/BarycentricTriangle\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { IndexedXYZCollectionInterval } from \"../geometry3d/IndexedCollectionInterval\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { TriangleCandidate } from \"./TriangleCandidate\";\r\n\r\n/** @packageDocumentation\r\n * @module Polyface\r\n */\r\n/**\r\n * * Context for constructing triangulations between linestrings with dis-similar point counts and distribution.\r\n * @internal\r\n */\r\nexport class GreedyTriangulationBetweenLineStrings {\r\n\r\n  private _vector1: Vector3d;\r\n  private constructor(turnRadians: number) {\r\n    this._turnRadians = turnRadians;\r\n    this._xyzA = Point3d.create();\r\n    this._xyzB = Point3d.create();\r\n    this._forwardA = Vector3d.create();\r\n    this._forwardB = Vector3d.create();\r\n    this._vector1 = Vector3d.create();\r\n    this._crossA = Vector3d.create();\r\n    this._crossB = Vector3d.create();\r\n  }\r\n\r\n  private _turnRadians: number;\r\n\r\n  private isForwardVector(\r\n    candidate: Vector3d,\r\n    forward: Vector3d,\r\n    perp: Vector3d): boolean {\r\n    if (candidate.dotProduct(forward) <= 0.0)\r\n      return false;\r\n    const theta = candidate.angleFromPerpendicular(perp);\r\n    if (Math.abs(theta.radians) > this._turnRadians)\r\n      return false;\r\n    return true;\r\n  }\r\n  private isPlanarBase(\r\n    pointsA: IndexedXYZCollection,\r\n    baseA: number,\r\n    pointsB: IndexedXYZCollection,\r\n    baseB: number,\r\n    xyzA: Point3d,\r\n    crossA: Vector3d,\r\n    forwardA: Vector3d,\r\n    xyzB: Point3d,\r\n    crossB: Vector3d,\r\n    forwardB: Vector3d): boolean {\r\n    if (baseA + 1 < pointsA.length && baseB + 1 < pointsB.length) {\r\n      pointsA.getPoint3dAtUncheckedPointIndex(baseA, xyzA);\r\n      pointsB.getPoint3dAtUncheckedPointIndex(baseB, xyzB);\r\n      pointsA.vectorXYAndZIndex(xyzA, baseA + 1, forwardA);\r\n      pointsB.vectorXYAndZIndex(xyzB, baseB + 1, forwardB);\r\n      Vector3d.createStartEnd(xyzA, xyzB, this._vector1);\r\n      this._vector1.crossProduct(forwardA, crossA);\r\n      this._vector1.crossProduct(forwardB, crossB);\r\n      if (!xyzA.isAlmostEqual(xyzB) && crossA.angleTo(crossB).radians < this._turnRadians)\r\n        return true;\r\n    }\r\n    return false;\r\n\r\n  }\r\n  /**\r\n   * Starting at start in source, examine points to see how long they are close to being \"in plane\"\r\n   * * child interval begins at parent.begin\r\n   * * child interval end initializes at trialEnd and grows.\r\n   * * child must be predefined by caller\r\n   * * Return the accepted interval\r\n   */\r\n  private advanceToPlanarLimit(\r\n    parent: IndexedXYZCollectionInterval,\r\n    child: IndexedXYZCollectionInterval,\r\n    trialEnd: number,\r\n    xyzA: Point3d,\r\n    perpA: Vector3d,\r\n    forwardA: Vector3d,\r\n    perpB: Vector3d,\r\n    forwardB: Vector3d) {\r\n    child.setFrom(parent, parent.begin, trialEnd);  // initialize as empty interval.\r\n    while (child.end < parent.end) {\r\n      child.points.vectorXYAndZIndex(xyzA, child.end, this._vector1);\r\n      if (!this.isForwardVector(this._vector1, forwardA, perpA))\r\n        break;\r\n      if (!this.isForwardVector(this._vector1, forwardB, perpB))\r\n        break;\r\n      if (child.end > 0) {\r\n        child.points.vectorIndexIndex(child.end - 1, child.end, this._vector1);\r\n        if (!this.isForwardVector(this._vector1, forwardA, perpA))\r\n          break;\r\n      }\r\n      child.end++;\r\n    }\r\n  }\r\n\r\n  private _triangleA1?: TriangleCandidate;\r\n  private _triangleB1?: TriangleCandidate;\r\n\r\n  private _triangleA2?: TriangleCandidate;\r\n  private _triangleB2?: TriangleCandidate;\r\n\r\n  private _triangleA3?: TriangleCandidate;\r\n  private _triangleB3?: TriangleCandidate;\r\n  private _bestTriangle?: TriangleCandidate;\r\n  private _workTriangle?: TriangleCandidate;\r\n  /** evaluate aspect ratios to select heuristically best triangles with given index intervals.\r\n   * (ASSUME NO DUPLICATES, as in caller.)\r\n   */\r\n  private addGreedy(\r\n    intervalA: IndexedXYZCollectionInterval,\r\n    intervalB: IndexedXYZCollectionInterval,\r\n    handler: (triangle: BarycentricTriangle) => void,\r\n    addOnly1: boolean = false) {\r\n    intervalA.restrictEnd();\r\n    intervalB.restrictEnd();\r\n\r\n    while (intervalA.length > 1 && intervalB.length > 1) {\r\n\r\n      // triangles A1 and B1 are always valid.\r\n      this._triangleA1 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin, 1, this._triangleA1);\r\n      this._triangleA2 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin + 1, intervalA.points, intervalA.begin + 2, intervalB.points, intervalB.begin, 2, this._triangleA2);\r\n      this._triangleA3 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin + 1, 3, this._triangleA3);\r\n\r\n      this._triangleB1 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin, -1, this._triangleB1);\r\n      this._triangleB2 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 2, intervalB.points, intervalB.begin + 1, intervalA.points, intervalA.begin, -2, this._triangleB2);\r\n      this._triangleB3 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin + 1, -3, this._triangleB3);\r\n      // Look at pairs of 2 triangles.\r\n      // (each pair begins with 1 or -1)\r\n      // For each pair find the smallest aspect ratio of its two triangles.  (Small is bad)\r\n      // Choose the pair where that (smaller aspect ratio of two) is largest.\r\n      // Advance in that direction.\r\n      this._bestTriangle = TriangleCandidate.copyWithLowerQuality(this._triangleA1, this._triangleB3, this._bestTriangle);\r\n      this._workTriangle = TriangleCandidate.copyWithLowerQuality(this._triangleB1, this._triangleA3, this._workTriangle);\r\n      TriangleCandidate.updateIfOtherHasHigherQuality(this._bestTriangle, this._workTriangle);\r\n      // TestTriangle::UpdateIfOtherHasLargerAspectRatio (bestTriangle, TestTriangle::MergeAspectRatio (triangleB1, triangleB2));\r\n      // TestTriangle::UpdateIfOtherHasLargerAspectRatio (bestTriangle, TestTriangle::MergeAspectRatio (triangleA1, triangleA2));\r\n\r\n      if (this._bestTriangle.id > 0) {\r\n        intervalA.advanceBegin();\r\n        handler(this._bestTriangle);\r\n        if (addOnly1)\r\n          return;\r\n      } else {\r\n        intervalB.advanceBegin();\r\n        handler(this._bestTriangle);\r\n        if (addOnly1)\r\n          return;\r\n      }\r\n    }\r\n    // sweep in trailing points from either side.  At least one of intervalA.begin, intervalB.begin is at its limit, so only one of these will execute any bodies.\r\n    if (intervalA.isSingleton) {\r\n      while (intervalB.length >= 2) {\r\n        this._workTriangle = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin, 0, this._workTriangle);\r\n        //  this._workTriangle.scaleFromPointInPlace(this._workTriangle.points[2], 0.95); // crude visualization aid for tracking logic.\r\n        handler(this._workTriangle);\r\n        intervalB.advanceBegin();\r\n      }\r\n    }\r\n\r\n    // sweep in trailing points from either side.  At least one of baseA, baseB is at its limit, so only one of these will execute any bodies.\r\n    if (intervalB.isSingleton) {\r\n      while (intervalA.length >= 2) {\r\n        this._workTriangle = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin, 0, this._workTriangle);\r\n        // this._workTriangle.scaleFromPointInPlace(this._workTriangle.points[2], 0.95); // crude visualization aid for tracking logic.\r\n        handler(this._workTriangle);\r\n        intervalA.advanceBegin();\r\n      }\r\n    }\r\n  }\r\n\r\n  private _xyzA: Point3d;\r\n  private _xyzB: Point3d;\r\n  private _forwardA: Vector3d;\r\n  private _forwardB: Vector3d;\r\n  private _crossA: Vector3d;\r\n  private _crossB: Vector3d;\r\n  /**\r\n   * Working from start to finish, emit triangles with heuristic lookahead to get pleasing matching between the linestrings.\r\n   * @param pointsA\r\n   * @param pointsB\r\n   * @param handler\r\n   */\r\n  public emitTriangles(\r\n    pointsA: IndexedXYZCollection,\r\n    pointsB: IndexedXYZCollection,\r\n    handler: (triangle: BarycentricTriangle) => void) {\r\n    /** Clean up duplicates for the real logic . . . */\r\n    this.emitTrianglesGo(resolveToNoDuplicates(pointsA), resolveToNoDuplicates(pointsB), handler);\r\n  }\r\n  /**\r\n   * Run triangle logic on inputs with no duplicates.\r\n   * @param pointsA\r\n   * @param pointsB\r\n   * @param handler\r\n   */\r\n  private emitTrianglesGo(\r\n    pointsA: IndexedXYZCollection,\r\n    pointsB: IndexedXYZCollection,\r\n    handler: (triangle: BarycentricTriangle) => void) {\r\n    const intervalA = IndexedXYZCollectionInterval.createComplete(pointsA);\r\n    const intervalB = IndexedXYZCollectionInterval.createComplete(pointsB);\r\n    const childA = IndexedXYZCollectionInterval.createComplete(pointsA);\r\n    const childB = IndexedXYZCollectionInterval.createComplete(pointsB);\r\n    while (intervalA.length > 0 && intervalB.length > 0 && (intervalA.length > 1 || intervalB.length > 1)) {\r\n      // const lA = intervalA.length;\r\n      // const lB = intervalB.length;\r\n      if (this.isPlanarBase(pointsA, intervalA.begin, pointsB, intervalB.begin, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\r\n        this.advanceToPlanarLimit(intervalA, childA, intervalA.begin + 1, this._xyzA, this._crossA, this._forwardA, this._crossB, this._forwardB);\r\n        this.advanceToPlanarLimit(intervalB, childB, intervalB.begin + 1, this._xyzB, this._crossB, this._forwardB, this._crossA, this._forwardA);\r\n        this.addGreedy(childA, childB, handler);\r\n        intervalA.advanceToTail(childA);\r\n        intervalB.advanceToTail(childB);\r\n      } else if (this.isPlanarBase(pointsA, intervalA.begin + 1, pointsB, intervalB.begin, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\r\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\r\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 1);\r\n        this.addGreedy(childA, childB, handler);\r\n        intervalA.advanceToTail(childA);\r\n        intervalB.advanceToTail(childB);\r\n      } else if (this.isPlanarBase(pointsA, intervalA.begin, pointsB, intervalB.begin + 1, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\r\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 1);\r\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\r\n        this.addGreedy(childA, childB, handler);\r\n        intervalA.advanceToTail(childA);\r\n        intervalB.advanceToTail(childB);\r\n      } else if (intervalA.length > 1 && intervalB.length > 1) {\r\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\r\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\r\n        this.addGreedy(childA, childB, handler, true);\r\n        intervalA.advanceToHead(childA);\r\n        intervalB.advanceToHead(childB);\r\n      } else if (intervalA.length > 1) {\r\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\r\n        childB.setFrom(intervalB);\r\n        this.addGreedy(childA, childB, handler);\r\n        intervalA.advanceToTail(childA);\r\n        intervalB.advanceToTail(childB);\r\n      } else if (intervalB.length > 1) {\r\n        childA.setFrom(intervalA);\r\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\r\n        this.addGreedy(childA, childB, handler);\r\n        intervalA.advanceToTail(childA);\r\n        intervalB.advanceToTail(childB);\r\n      }\r\n      /*      if (intervalA.length >= lA && intervalB.length >= lB) {\r\n              // This should not happen == neither one advanced.   Just move ahead in the longer one ..\r\n              if (intervalA.length > intervalB.length)\r\n                intervalA.advanceBegin();\r\n              else intervalB.advanceBegin();\r\n            } */\r\n    }\r\n    // catch everything else blindly\r\n    this.addGreedy(intervalA, intervalB, handler);\r\n  }\r\n  /** Default angle for considering two vectors to be colinear */\r\n  public static defaultNearColinearAngle = Angle.createDegrees(15);\r\n  public static createContext(planarTurnAngle: Angle = this.defaultNearColinearAngle) {\r\n    return new GreedyTriangulationBetweenLineStrings(planarTurnAngle.radians);\r\n  }\r\n}\r\n\r\n/**\r\n * * If there are no contiguous duplicated points in `data` return `data` unchanged.\r\n * * If there are duplicates, compress to a new array.\r\n * @param data\r\n * @param tolerance\r\n */\r\nfunction resolveToNoDuplicates(data: IndexedXYZCollection, tolerance = Geometry.smallMetricDistance): IndexedXYZCollection {\r\n  let hasDuplicates = false;\r\n  const n = data.length;\r\n  for (let i = 0; i + 1 < n; i++) {\r\n    if (data.distanceIndexIndex(i, i + 1)! <= tolerance) {\r\n      hasDuplicates = true;\r\n      break;\r\n    }\r\n  }\r\n  if (!hasDuplicates)\r\n    return data;\r\n  const result = new GrowableXYZArray(n);\r\n  result.pushXYZ(data.getXAtUncheckedPointIndex(0), data.getYAtUncheckedPointIndex(0), data.getZAtUncheckedPointIndex(0));\r\n  let i0 = 0;\r\n  for (let i = 1; i < n; i++) {\r\n    if (data.distanceIndexIndex(i0, i)! > tolerance) {\r\n      result.pushXYZ(data.getXAtUncheckedPointIndex(i), data.getYAtUncheckedPointIndex(i), data.getZAtUncheckedPointIndex(i));\r\n      i0 = i;\r\n    }\r\n  }\r\n  /** enforce exact closure if original was closed. */\r\n  if (data.distanceIndexIndex(0, n - 1)! <= tolerance) {\r\n    result.pop();\r\n    result.pushFromGrowableXYZArray(result, 0);\r\n  }\r\n  return result;\r\n}\r\n"]}
+{"version":3,"file":"GreedyTriangulationBetweenLineStrings.js","sourceRoot":"","sources":["../../../src/polyface/GreedyTriangulationBetweenLineStrings.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,4BAA4B,EAAE,MAAM,yCAAyC,CAAC;AAEvF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD;;GAEG;AACH;;;GAGG;AACH,MAAa,qCAAqC;IAGhD,YAAoB,WAAmB;QACrC,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;IACnC,CAAC;IAIO,eAAe,CACrB,SAAmB,EACnB,OAAiB,EACjB,IAAc;QACd,IAAI,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,GAAG;YACtC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAG,SAAS,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,YAAY;YAC7C,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACO,YAAY,CAClB,OAA6B,EAC7B,KAAa,EACb,OAA6B,EAC7B,KAAa,EACb,IAAa,EACb,MAAgB,EAChB,QAAkB,EAClB,IAAa,EACb,MAAgB,EAChB,QAAkB;QAClB,IAAI,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE;YAC5D,OAAO,CAAC,+BAA+B,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACrD,OAAO,CAAC,+BAA+B,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACrD,OAAO,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YACrD,OAAO,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YACrD,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY;gBACjF,OAAO,IAAI,CAAC;SACf;QACD,OAAO,KAAK,CAAC;IAEf,CAAC;IACD;;;;;;OAMG;IACK,oBAAoB,CAC1B,MAAoC,EACpC,KAAmC,EACnC,QAAgB,EAChB,IAAa,EACb,KAAe,EACf,QAAkB,EAClB,KAAe,EACf,QAAkB;QAClB,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAE,gCAAgC;QAChF,OAAO,KAAK,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE;YAC7B,KAAK,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC/D,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;gBACvD,MAAM;YACR,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;gBACvD,MAAM;YACR,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE;gBACjB,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvE,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;oBACvD,MAAM;aACT;YACD,KAAK,CAAC,GAAG,EAAE,CAAC;SACb;IACH,CAAC;IAYD;;OAEG;IACK,SAAS,CACf,SAAuC,EACvC,SAAuC,EACvC,OAAgD,EAChD,WAAoB,KAAK;QACzB,SAAS,CAAC,WAAW,EAAE,CAAC;QACxB,SAAS,CAAC,WAAW,EAAE,CAAC;QAExB,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;YAEnD,wCAAwC;YACxC,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5L,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAChM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAEhM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC7L,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjM,gCAAgC;YAChC,kCAAkC;YAClC,qFAAqF;YACrF,uEAAuE;YACvE,6BAA6B;YAC7B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACpH,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACpH,iBAAiB,CAAC,6BAA6B,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACxF,2HAA2H;YAC3H,2HAA2H;YAE3H,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,EAAE;gBAC7B,SAAS,CAAC,YAAY,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,IAAI,QAAQ;oBACV,OAAO;aACV;iBAAM;gBACL,SAAS,CAAC,YAAY,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,IAAI,QAAQ;oBACV,OAAO;aACV;SACF;QACD,8JAA8J;QAC9J,IAAI,SAAS,CAAC,WAAW,EAAE;YACzB,OAAO,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE;gBAC5B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;gBAChM,gIAAgI;gBAChI,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,SAAS,CAAC,YAAY,EAAE,CAAC;aAC1B;SACF;QAED,0IAA0I;QAC1I,IAAI,SAAS,CAAC,WAAW,EAAE;YACzB,OAAO,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE;gBAC5B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;gBAChM,+HAA+H;gBAC/H,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,SAAS,CAAC,YAAY,EAAE,CAAC;aAC1B;SACF;IACH,CAAC;IAQD;;;;;OAKG;IACI,aAAa,CAClB,OAA6B,EAC7B,OAA6B,EAC7B,OAAgD;QAChD,mDAAmD;QACnD,IAAI,CAAC,eAAe,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,qBAAqB,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAChG,CAAC;IACD;;;;;OAKG;IACK,eAAe,CACrB,OAA6B,EAC7B,OAA6B,EAC7B,OAAgD;QAChD,MAAM,SAAS,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,SAAS,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACpE,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;YACrG,+BAA+B;YAC/B,+BAA+B;YAC/B,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE;gBAC7J,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1I,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1I,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;iBAAM,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE;gBACxK,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;iBAAM,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE;gBACxK,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvD,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;gBAC9C,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;gBAC/B,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;gBAC/B,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aACjC;YACD;;;;;sBAKU;SACX;QACD,gCAAgC;QAChC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IAGM,MAAM,CAAC,aAAa,CAAC,kBAAyB,IAAI,CAAC,wBAAwB;QAChF,OAAO,IAAI,qCAAqC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;IAC5E,CAAC;;AAJD,+DAA+D;AACjD,8DAAwB,GAAG,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;SAnPtD,qCAAqC;AAyPlD;;;;;GAKG;AACH,SAAS,qBAAqB,CAAC,IAA0B,EAAE,SAAS,GAAG,QAAQ,CAAC,mBAAmB;IACjG,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,SAAS,EAAE;YACnD,aAAa,GAAG,IAAI,CAAC;YACrB,MAAM;SACP;KACF;IACD,IAAI,CAAC,aAAa;QAChB,OAAO,IAAI,CAAC;IACd,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC;IACxH,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,IAAI,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,CAAC,CAAE,GAAG,SAAS,EAAE;YAC/C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC;YACxH,EAAE,GAAG,CAAC,CAAC;SACR;KACF;IACD,oDAAoD;IACpD,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,SAAS,EAAE;QACnD,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,MAAM,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;KAC5C;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","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*--------------------------------------------------------------------------------------------*/\nimport { Geometry } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { BarycentricTriangle } from \"../geometry3d/BarycentricTriangle\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollectionInterval } from \"../geometry3d/IndexedCollectionInterval\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { TriangleCandidate } from \"./TriangleCandidate\";\n\n/** @packageDocumentation\n * @module Polyface\n */\n/**\n * * Context for constructing triangulations between linestrings with dis-similar point counts and distribution.\n * @internal\n */\nexport class GreedyTriangulationBetweenLineStrings {\n\n  private _vector1: Vector3d;\n  private constructor(turnRadians: number) {\n    this._turnRadians = turnRadians;\n    this._xyzA = Point3d.create();\n    this._xyzB = Point3d.create();\n    this._forwardA = Vector3d.create();\n    this._forwardB = Vector3d.create();\n    this._vector1 = Vector3d.create();\n    this._crossA = Vector3d.create();\n    this._crossB = Vector3d.create();\n  }\n\n  private _turnRadians: number;\n\n  private isForwardVector(\n    candidate: Vector3d,\n    forward: Vector3d,\n    perp: Vector3d): boolean {\n    if (candidate.dotProduct(forward) <= 0.0)\n      return false;\n    const theta = candidate.angleFromPerpendicular(perp);\n    if (Math.abs(theta.radians) > this._turnRadians)\n      return false;\n    return true;\n  }\n  private isPlanarBase(\n    pointsA: IndexedXYZCollection,\n    baseA: number,\n    pointsB: IndexedXYZCollection,\n    baseB: number,\n    xyzA: Point3d,\n    crossA: Vector3d,\n    forwardA: Vector3d,\n    xyzB: Point3d,\n    crossB: Vector3d,\n    forwardB: Vector3d): boolean {\n    if (baseA + 1 < pointsA.length && baseB + 1 < pointsB.length) {\n      pointsA.getPoint3dAtUncheckedPointIndex(baseA, xyzA);\n      pointsB.getPoint3dAtUncheckedPointIndex(baseB, xyzB);\n      pointsA.vectorXYAndZIndex(xyzA, baseA + 1, forwardA);\n      pointsB.vectorXYAndZIndex(xyzB, baseB + 1, forwardB);\n      Vector3d.createStartEnd(xyzA, xyzB, this._vector1);\n      this._vector1.crossProduct(forwardA, crossA);\n      this._vector1.crossProduct(forwardB, crossB);\n      if (!xyzA.isAlmostEqual(xyzB) && crossA.angleTo(crossB).radians < this._turnRadians)\n        return true;\n    }\n    return false;\n\n  }\n  /**\n   * Starting at start in source, examine points to see how long they are close to being \"in plane\"\n   * * child interval begins at parent.begin\n   * * child interval end initializes at trialEnd and grows.\n   * * child must be predefined by caller\n   * * Return the accepted interval\n   */\n  private advanceToPlanarLimit(\n    parent: IndexedXYZCollectionInterval,\n    child: IndexedXYZCollectionInterval,\n    trialEnd: number,\n    xyzA: Point3d,\n    perpA: Vector3d,\n    forwardA: Vector3d,\n    perpB: Vector3d,\n    forwardB: Vector3d) {\n    child.setFrom(parent, parent.begin, trialEnd);  // initialize as empty interval.\n    while (child.end < parent.end) {\n      child.points.vectorXYAndZIndex(xyzA, child.end, this._vector1);\n      if (!this.isForwardVector(this._vector1, forwardA, perpA))\n        break;\n      if (!this.isForwardVector(this._vector1, forwardB, perpB))\n        break;\n      if (child.end > 0) {\n        child.points.vectorIndexIndex(child.end - 1, child.end, this._vector1);\n        if (!this.isForwardVector(this._vector1, forwardA, perpA))\n          break;\n      }\n      child.end++;\n    }\n  }\n\n  private _triangleA1?: TriangleCandidate;\n  private _triangleB1?: TriangleCandidate;\n\n  private _triangleA2?: TriangleCandidate;\n  private _triangleB2?: TriangleCandidate;\n\n  private _triangleA3?: TriangleCandidate;\n  private _triangleB3?: TriangleCandidate;\n  private _bestTriangle?: TriangleCandidate;\n  private _workTriangle?: TriangleCandidate;\n  /** evaluate aspect ratios to select heuristically best triangles with given index intervals.\n   * (ASSUME NO DUPLICATES, as in caller.)\n   */\n  private addGreedy(\n    intervalA: IndexedXYZCollectionInterval,\n    intervalB: IndexedXYZCollectionInterval,\n    handler: (triangle: BarycentricTriangle) => void,\n    addOnly1: boolean = false) {\n    intervalA.restrictEnd();\n    intervalB.restrictEnd();\n\n    while (intervalA.length > 1 && intervalB.length > 1) {\n\n      // triangles A1 and B1 are always valid.\n      this._triangleA1 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin, 1, this._triangleA1);\n      this._triangleA2 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin + 1, intervalA.points, intervalA.begin + 2, intervalB.points, intervalB.begin, 2, this._triangleA2);\n      this._triangleA3 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin + 1, 3, this._triangleA3);\n\n      this._triangleB1 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin, -1, this._triangleB1);\n      this._triangleB2 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 2, intervalB.points, intervalB.begin + 1, intervalA.points, intervalA.begin, -2, this._triangleB2);\n      this._triangleB3 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin + 1, -3, this._triangleB3);\n      // Look at pairs of 2 triangles.\n      // (each pair begins with 1 or -1)\n      // For each pair find the smallest aspect ratio of its two triangles.  (Small is bad)\n      // Choose the pair where that (smaller aspect ratio of two) is largest.\n      // Advance in that direction.\n      this._bestTriangle = TriangleCandidate.copyWithLowerQuality(this._triangleA1, this._triangleB3, this._bestTriangle);\n      this._workTriangle = TriangleCandidate.copyWithLowerQuality(this._triangleB1, this._triangleA3, this._workTriangle);\n      TriangleCandidate.updateIfOtherHasHigherQuality(this._bestTriangle, this._workTriangle);\n      // TestTriangle::UpdateIfOtherHasLargerAspectRatio (bestTriangle, TestTriangle::MergeAspectRatio (triangleB1, triangleB2));\n      // TestTriangle::UpdateIfOtherHasLargerAspectRatio (bestTriangle, TestTriangle::MergeAspectRatio (triangleA1, triangleA2));\n\n      if (this._bestTriangle.id > 0) {\n        intervalA.advanceBegin();\n        handler(this._bestTriangle);\n        if (addOnly1)\n          return;\n      } else {\n        intervalB.advanceBegin();\n        handler(this._bestTriangle);\n        if (addOnly1)\n          return;\n      }\n    }\n    // sweep in trailing points from either side.  At least one of intervalA.begin, intervalB.begin is at its limit, so only one of these will execute any bodies.\n    if (intervalA.isSingleton) {\n      while (intervalB.length >= 2) {\n        this._workTriangle = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin, 0, this._workTriangle);\n        //  this._workTriangle.scaleFromPointInPlace(this._workTriangle.points[2], 0.95); // crude visualization aid for tracking logic.\n        handler(this._workTriangle);\n        intervalB.advanceBegin();\n      }\n    }\n\n    // sweep in trailing points from either side.  At least one of baseA, baseB is at its limit, so only one of these will execute any bodies.\n    if (intervalB.isSingleton) {\n      while (intervalA.length >= 2) {\n        this._workTriangle = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin, 0, this._workTriangle);\n        // this._workTriangle.scaleFromPointInPlace(this._workTriangle.points[2], 0.95); // crude visualization aid for tracking logic.\n        handler(this._workTriangle);\n        intervalA.advanceBegin();\n      }\n    }\n  }\n\n  private _xyzA: Point3d;\n  private _xyzB: Point3d;\n  private _forwardA: Vector3d;\n  private _forwardB: Vector3d;\n  private _crossA: Vector3d;\n  private _crossB: Vector3d;\n  /**\n   * Working from start to finish, emit triangles with heuristic lookahead to get pleasing matching between the linestrings.\n   * @param pointsA\n   * @param pointsB\n   * @param handler\n   */\n  public emitTriangles(\n    pointsA: IndexedXYZCollection,\n    pointsB: IndexedXYZCollection,\n    handler: (triangle: BarycentricTriangle) => void) {\n    /** Clean up duplicates for the real logic . . . */\n    this.emitTrianglesGo(resolveToNoDuplicates(pointsA), resolveToNoDuplicates(pointsB), handler);\n  }\n  /**\n   * Run triangle logic on inputs with no duplicates.\n   * @param pointsA\n   * @param pointsB\n   * @param handler\n   */\n  private emitTrianglesGo(\n    pointsA: IndexedXYZCollection,\n    pointsB: IndexedXYZCollection,\n    handler: (triangle: BarycentricTriangle) => void) {\n    const intervalA = IndexedXYZCollectionInterval.createComplete(pointsA);\n    const intervalB = IndexedXYZCollectionInterval.createComplete(pointsB);\n    const childA = IndexedXYZCollectionInterval.createComplete(pointsA);\n    const childB = IndexedXYZCollectionInterval.createComplete(pointsB);\n    while (intervalA.length > 0 && intervalB.length > 0 && (intervalA.length > 1 || intervalB.length > 1)) {\n      // const lA = intervalA.length;\n      // const lB = intervalB.length;\n      if (this.isPlanarBase(pointsA, intervalA.begin, pointsB, intervalB.begin, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\n        this.advanceToPlanarLimit(intervalA, childA, intervalA.begin + 1, this._xyzA, this._crossA, this._forwardA, this._crossB, this._forwardB);\n        this.advanceToPlanarLimit(intervalB, childB, intervalB.begin + 1, this._xyzB, this._crossB, this._forwardB, this._crossA, this._forwardA);\n        this.addGreedy(childA, childB, handler);\n        intervalA.advanceToTail(childA);\n        intervalB.advanceToTail(childB);\n      } else if (this.isPlanarBase(pointsA, intervalA.begin + 1, pointsB, intervalB.begin, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 1);\n        this.addGreedy(childA, childB, handler);\n        intervalA.advanceToTail(childA);\n        intervalB.advanceToTail(childB);\n      } else if (this.isPlanarBase(pointsA, intervalA.begin, pointsB, intervalB.begin + 1, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 1);\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\n        this.addGreedy(childA, childB, handler);\n        intervalA.advanceToTail(childA);\n        intervalB.advanceToTail(childB);\n      } else if (intervalA.length > 1 && intervalB.length > 1) {\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\n        this.addGreedy(childA, childB, handler, true);\n        intervalA.advanceToHead(childA);\n        intervalB.advanceToHead(childB);\n      } else if (intervalA.length > 1) {\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\n        childB.setFrom(intervalB);\n        this.addGreedy(childA, childB, handler);\n        intervalA.advanceToTail(childA);\n        intervalB.advanceToTail(childB);\n      } else if (intervalB.length > 1) {\n        childA.setFrom(intervalA);\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\n        this.addGreedy(childA, childB, handler);\n        intervalA.advanceToTail(childA);\n        intervalB.advanceToTail(childB);\n      }\n      /*      if (intervalA.length >= lA && intervalB.length >= lB) {\n              // This should not happen == neither one advanced.   Just move ahead in the longer one ..\n              if (intervalA.length > intervalB.length)\n                intervalA.advanceBegin();\n              else intervalB.advanceBegin();\n            } */\n    }\n    // catch everything else blindly\n    this.addGreedy(intervalA, intervalB, handler);\n  }\n  /** Default angle for considering two vectors to be colinear */\n  public static defaultNearColinearAngle = Angle.createDegrees(15);\n  public static createContext(planarTurnAngle: Angle = this.defaultNearColinearAngle) {\n    return new GreedyTriangulationBetweenLineStrings(planarTurnAngle.radians);\n  }\n}\n\n/**\n * * If there are no contiguous duplicated points in `data` return `data` unchanged.\n * * If there are duplicates, compress to a new array.\n * @param data\n * @param tolerance\n */\nfunction resolveToNoDuplicates(data: IndexedXYZCollection, tolerance = Geometry.smallMetricDistance): IndexedXYZCollection {\n  let hasDuplicates = false;\n  const n = data.length;\n  for (let i = 0; i + 1 < n; i++) {\n    if (data.distanceIndexIndex(i, i + 1)! <= tolerance) {\n      hasDuplicates = true;\n      break;\n    }\n  }\n  if (!hasDuplicates)\n    return data;\n  const result = new GrowableXYZArray(n);\n  result.pushXYZ(data.getXAtUncheckedPointIndex(0), data.getYAtUncheckedPointIndex(0), data.getZAtUncheckedPointIndex(0));\n  let i0 = 0;\n  for (let i = 1; i < n; i++) {\n    if (data.distanceIndexIndex(i0, i)! > tolerance) {\n      result.pushXYZ(data.getXAtUncheckedPointIndex(i), data.getYAtUncheckedPointIndex(i), data.getZAtUncheckedPointIndex(i));\n      i0 = i;\n    }\n  }\n  /** enforce exact closure if original was closed. */\n  if (data.distanceIndexIndex(0, n - 1)! <= tolerance) {\n    result.pop();\n    result.pushFromGrowableXYZArray(result, 0);\n  }\n  return result;\n}\n"]}

package/lib/esm/polyface/IndexedEdgeMatcher.js.map

@@ -1 +1 @@
-{"version":3,"file":"IndexedEdgeMatcher.js","sourceRoot":"","sources":["../../../src/polyface/IndexedEdgeMatcher.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH;;;;;;GAMG;AACH,MAAM,OAAO,YAAa,SAAQ,YAAY;IAC5C,uEAAuE;IACvE,IAAW,YAAY,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,wEAAwE;IACxE,IAAW,YAAY,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,+BAA+B;IAC/B,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,4DAA4D;IAC5D,IAAW,SAAS,KAAc,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,uDAAuD;IACvD,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrF,wDAAwD;IACxD,IAAW,eAAe,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,gGAAgG;IACzF,MAAM,CAAC,mBAAmB,CAAC,KAAmB,EAAE,KAAmB,IAAa,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/I,6GAA6G;IACtG,MAAM,CAAC,qBAAqB,CAAC,KAAmB,EAAE,KAAmB;QAC1E,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,KAAmB,EAAE,KAAmB;QACxE,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QAC7D,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QAC9D,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE;;;;;;OAMG;IACI,MAAM,CAAC,QAAQ,CAAC,KAAmB,EAAE,KAAmB;QAC7D,+CAA+C;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC;QAClC,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC;QAClC,IAAI,IAAI,GAAG,IAAI;YACb,OAAO,CAAC,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,IAAI;YACb,OAAO,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,IAAI,KAAK,GAAG,KAAK;YACf,OAAO,CAAC,CAAC,CAAC;QACZ,IAAI,KAAK,GAAG,KAAK;YACf,OAAO,CAAC,CAAC;QACX,yDAAyD;QACzD,OAAO,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;IACjD,CAAC;IACD,YAAmB,OAAe,EAAE,OAAe,EAAE,UAAkB;QACrE,KAAK,CAAC,CAAC,CAAC,CAAC;QACT,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;IACvB,CAAC;IACM,MAAM,KAAU,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,CAAC,aAAa,CAAC,IAAyB;QACnD,IAAI,IAAI,YAAY,YAAY;YAC9B,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;QAEvB,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,IAAI;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACtD,CAAC;IACM,MAAM,CAAC,kBAAkB,CAAC,IAA2B;QAC1D,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,OAAO,IAAI,IAAI;YACxB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;QACnD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAGD;;GAEG;AACH,MAAM,OAAO,kBAAkB;IAG7B;QACE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IACD;;;;;;OAMG;IACI,OAAO,CAAC,OAAe,EAAE,OAAe,EAAE,UAAkB;QACjE,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QAC5D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,OAAO,CAAC,WAAqB,EAAE,UAAkB,EAAE,YAAqB,IAAI;QACjF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACrC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;SAC9D;QACD,IAAI,SAAS;YACX,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAC7D,CAAC;IACD,iCAAiC;IAC1B,IAAI;QACT,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IACzE,CAAC;IACD,+DAA+D;IACvD,0BAA0B,CAAC,MAAc,EAAE,MAAc,EAAE,IAAuC;QACxG,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,GAAG,MAAM,EAAE;YACzC,IAAI,MAAM,KAAK,MAAM,GAAG,CAAC,EAAE;gBACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;aAC/B;iBAAM;gBACL,MAAM,OAAO,GAAG,EAAE,CAAC;gBACnB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;oBAClC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aACpB;SAEF;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,sBAAsB,CAAC,aAAgD,EAAE,UAAkC,EAAE,SAAiC,EAAE,gBAAwC;QAC7L,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,aAAa;YAAE,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5C,IAAI,UAAU;YAAE,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,IAAI,SAAS;YAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QACpC,IAAI,gBAAgB;YAAE,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC5B,IAAI,aAAa,CAAC;QAClB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,IAAI,aAAa,EAAE;YACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACpC,aAAa,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,IAAI,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;gBACtH,aAAa,EAAE,CAAC;aACjB;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE;gBACjC,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,SAAS,CAAC,CAAC;aAC5E;iBAAM,IAAI,aAAa,KAAK,CAAC,IAAI,YAAY,CAAC,mBAAmB,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE;gBACpG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,aAAa,CAAC,CAAC;aAChF;iBAAM,IAAI,aAAa,KAAK,CAAC,EAAE;gBAC9B,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;aACjE;iBAAM;gBACL,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,gBAAgB,CAAC,CAAC;aACnF;SACF;IACH,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/**\r\n * * For boundary sorting, an edge is a (packed!) Float64Array.\r\n * * Fixed entry positions are:\r\n *   * [0] is start vertex index (in CCW order around its facet)\r\n *   * [1] is end vertex index (in CCW order around its facet)\r\n *   * [2] is facet index.\r\n */\r\nexport class SortableEdge extends Float64Array {\r\n  /** Return the vertex index that appears first in the order stored.  */\r\n  public get vertexIndexA(): number { return this[0]; }\r\n  /** Return the vertex index that appears second in the order stored.  */\r\n  public get vertexIndexB(): number { return this[1]; }\r\n  /** Return the facet index.  */\r\n  public get facetIndex(): number { return this[2]; }\r\n  /** return true if vertexIndexA is less than vertexIndexB */\r\n  public get isLowHigh(): boolean { return this[0] < this[1]; }\r\n  /** Return the vertex index with lower numeric value */\r\n  public get lowVertexIndex(): number { return this[0] < this[1] ? this[0] : this[1]; }\r\n  /** Return the vertex index with higher numeric value */\r\n  public get highVertexIndex(): number { return this[0] > this[1] ? this[0] : this[1]; }\r\n  /** Return true if the vertices edgeA and edgeB are the same vertex indices in opposite order */\r\n  public static areDirectedPartners(edgeA: SortableEdge, edgeB: SortableEdge): boolean { return edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]; }\r\n  /** Return true if the vertices edgeA and edgeB are the same vertex indices with no consideration of order */\r\n  public static areUndirectedPartners(edgeA: SortableEdge, edgeB: SortableEdge): boolean {\r\n    return (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) || ((edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]));\r\n  }\r\n  /** Return numeric relationship of edgeA and edgeB:\r\n   * * 1 if they share start and end in the same order\r\n   * * -1 if they share start and end in reversed order\r\n   * * 0 otherwise.\r\n   */\r\n  public static relativeOrientation(edgeA: SortableEdge, edgeB: SortableEdge): number {\r\n    if (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) return 1;\r\n    if (edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]) return -1;\r\n    return 0;\r\n  }\r\n\r\n  public get isNullEdge(): boolean { return this[0] === this[1]; }\r\n  /**\r\n   * lexical comparison of two edges.\r\n   * * If the edges have the same vertex pair (in same or opposite order) they will end up adjacent in a sort\r\n   * * If the edges have 0 or 1 shared vertex indices, the one with lowest low comes first.\r\n   * @param edgeA first edge\r\n   * @param edgeB second edge\r\n   */\r\n  public static lessThan(edgeA: SortableEdge, edgeB: SortableEdge): number {\r\n    // primary compare is based on indirect indices\r\n    const lowA = edgeA.lowVertexIndex;\r\n    const lowB = edgeB.lowVertexIndex;\r\n    if (lowA < lowB)\r\n      return -1;\r\n    if (lowB < lowA)\r\n      return 1;\r\n    const highA = edgeA.highVertexIndex;\r\n    const highB = edgeB.highVertexIndex;\r\n    if (highA < highB)\r\n      return -1;\r\n    if (highB < highA)\r\n      return 1;\r\n    // undirected indices match ... use directed vertexIndexA\r\n    return edgeA.vertexIndexA - edgeB.vertexIndexA;\r\n  }\r\n  public constructor(vertexA: number, vertexB: number, facetIndex: number) {\r\n    super(3);\r\n    this[0] = vertexA;\r\n    this[1] = vertexB;\r\n    this[2] = facetIndex;\r\n  }\r\n  public toJSON(): any { return [this[0], this[1], this[2]]; }\r\n  public static clusterToJSON(data: SortableEdgeCluster): any {\r\n    if (data instanceof SortableEdge)\r\n      return data.toJSON();\r\n\r\n    const result = [];\r\n    for (const edge of data) result.push(edge.toJSON());\r\n  }\r\n  public static clusterArrayToJSON(data: SortableEdgeCluster[]) {\r\n    const result = [];\r\n    for (const cluster of data)\r\n      result.push(SortableEdge.clusterToJSON(cluster));\r\n    return result;\r\n  }\r\n}\r\n\r\nexport type SortableEdgeCluster = SortableEdge | SortableEdge[];\r\n/**\r\n * An IndexedEdgeMatcher carries an array (`edges`) of edges start & end indices for sorting and subsequent analyses (such as testing for closed mesh)\r\n */\r\nexport class IndexedEdgeMatcher {\r\n  public edges: SortableEdge[];\r\n\r\n  constructor() {\r\n    this.edges = [];\r\n  }\r\n  /**\r\n   * push a new edge.\r\n   * @returns the edge (as emplaced at the back of the sortableEdge array)\r\n   * @param vertexA start vertex\r\n   * @param vertexB end vertex\r\n   * @param facetIndex facet index\r\n   */\r\n  public addEdge(vertexA: number, vertexB: number, facetIndex: number): SortableEdge {\r\n    const edge = new SortableEdge(vertexA, vertexB, facetIndex);\r\n    this.edges.push(edge);\r\n    return edge;\r\n  }\r\n  /**\r\n   * Push edges all around a facet, returning to vertexArray[0]\r\n   * @param vertexArray array of vertex indices around facet\r\n   * @param facetIndex\r\n   */\r\n  public addPath(vertexArray: number[], facetIndex: number, closeLoop: boolean = true) {\r\n    if (vertexArray.length === 0) return;\r\n    const m = vertexArray.length - 1;\r\n    for (let i = 0; i < m; i++) {\r\n      this.addEdge(vertexArray[i], vertexArray[i + 1], facetIndex);\r\n    }\r\n    if (closeLoop)\r\n      this.addEdge(vertexArray[m], vertexArray[0], facetIndex);\r\n  }\r\n  /** Sort the edge index array. */\r\n  public sort() {\r\n    this.edges.sort((edgeA, edgeB) => SortableEdge.lessThan(edgeA, edgeB));\r\n  }\r\n  /** Create a single or compound SortableEdgeCluster in dest. */\r\n  private collectSortableEdgeCluster(index0: number, index1: number, dest: SortableEdgeCluster[] | undefined) {\r\n    if (dest !== undefined && index1 > index0) {\r\n      if (index1 === index0 + 1) {\r\n        dest.push(this.edges[index0]);\r\n      } else {\r\n        const cluster = [];\r\n        for (let i = index0; i < index1; i++)\r\n          cluster.push(this.edges[i]);\r\n        dest.push(cluster);\r\n      }\r\n\r\n    }\r\n  }\r\n  /**\r\n   * sort the edges, and look for three categories of paired edges:\r\n   * * caller must allocate all result arrays of interest.\r\n   * * Any combination of the result arrays may be `undefined`, indicating that category is to be ignored.\r\n   * * Any combination of the result arrays may be aliased as the same target, in which case those to categories are merged into the target.\r\n   * * For instance, to ignore manifold pairs and collect all others (singleton, null, and other) as a single array `allOther`, create `const allOther = []` as an empty array and call\r\n   * `sortAndCollectClusters (undefined, allOther, allOther, allOther);`\r\n   * @param manifoldPairs optional array to receive pairs of properly mated SortableEdgePairs, i.e. simple interior edges adjacent to two facets in opposing directions.\r\n   * @param singletons optional array to receive edges that are simple boundary edges.\r\n   * @param nullEdges optional array to receive arrays of null edges (same start and end vertex)\r\n   * @param allOtherClusters optional array to receive arrays in which all the edges are partners in an undirected sense but not a simple directed pair.\r\n   */\r\n  public sortAndCollectClusters(manifoldPairs: SortableEdgeCluster[] | undefined, singletons?: SortableEdgeCluster[], nullEdges?: SortableEdgeCluster[], allOtherClusters?: SortableEdgeCluster[]) {\r\n    this.sort();\r\n    if (manifoldPairs) manifoldPairs.length = 0;\r\n    if (singletons) singletons.length = 0;\r\n    if (nullEdges) nullEdges.length = 0;\r\n    if (allOtherClusters) allOtherClusters.length = 0;\r\n    const n = this.edges.length;\r\n    let clusterLength;\r\n    for (let index0 = 0; index0 < n; index0 += clusterLength) {\r\n      const baseEdge = this.edges[index0];\r\n      clusterLength = 1;\r\n      for (let index1 = index0 + 1; index1 < n && SortableEdge.areUndirectedPartners(baseEdge, this.edges[index1]); index1++) {\r\n        clusterLength++;\r\n      }\r\n      if (this.edges[index0].isNullEdge) {\r\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, nullEdges);\r\n      } else if (clusterLength === 2 && SortableEdge.areDirectedPartners(baseEdge, this.edges[index0 + 1])) {\r\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, manifoldPairs);\r\n      } else if (clusterLength === 1) {\r\n        this.collectSortableEdgeCluster(index0, index0 + 1, singletons);\r\n      } else {\r\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, allOtherClusters);\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"IndexedEdgeMatcher.js","sourceRoot":"","sources":["../../../src/polyface/IndexedEdgeMatcher.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH;;;;;;GAMG;AACH,MAAM,OAAO,YAAa,SAAQ,YAAY;IAC5C,uEAAuE;IACvE,IAAW,YAAY,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,wEAAwE;IACxE,IAAW,YAAY,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,+BAA+B;IAC/B,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,4DAA4D;IAC5D,IAAW,SAAS,KAAc,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,uDAAuD;IACvD,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrF,wDAAwD;IACxD,IAAW,eAAe,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,gGAAgG;IACzF,MAAM,CAAC,mBAAmB,CAAC,KAAmB,EAAE,KAAmB,IAAa,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/I,6GAA6G;IACtG,MAAM,CAAC,qBAAqB,CAAC,KAAmB,EAAE,KAAmB;QAC1E,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,KAAmB,EAAE,KAAmB;QACxE,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QAC7D,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QAC9D,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE;;;;;;OAMG;IACI,MAAM,CAAC,QAAQ,CAAC,KAAmB,EAAE,KAAmB;QAC7D,+CAA+C;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC;QAClC,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC;QAClC,IAAI,IAAI,GAAG,IAAI;YACb,OAAO,CAAC,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,IAAI;YACb,OAAO,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,IAAI,KAAK,GAAG,KAAK;YACf,OAAO,CAAC,CAAC,CAAC;QACZ,IAAI,KAAK,GAAG,KAAK;YACf,OAAO,CAAC,CAAC;QACX,yDAAyD;QACzD,OAAO,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;IACjD,CAAC;IACD,YAAmB,OAAe,EAAE,OAAe,EAAE,UAAkB;QACrE,KAAK,CAAC,CAAC,CAAC,CAAC;QACT,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;IACvB,CAAC;IACM,MAAM,KAAU,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,CAAC,aAAa,CAAC,IAAyB;QACnD,IAAI,IAAI,YAAY,YAAY;YAC9B,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;QAEvB,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,IAAI;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACtD,CAAC;IACM,MAAM,CAAC,kBAAkB,CAAC,IAA2B;QAC1D,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,OAAO,IAAI,IAAI;YACxB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;QACnD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAGD;;GAEG;AACH,MAAM,OAAO,kBAAkB;IAG7B;QACE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IACD;;;;;;OAMG;IACI,OAAO,CAAC,OAAe,EAAE,OAAe,EAAE,UAAkB;QACjE,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QAC5D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,OAAO,CAAC,WAAqB,EAAE,UAAkB,EAAE,YAAqB,IAAI;QACjF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACrC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;SAC9D;QACD,IAAI,SAAS;YACX,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAC7D,CAAC;IACD,iCAAiC;IAC1B,IAAI;QACT,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IACzE,CAAC;IACD,+DAA+D;IACvD,0BAA0B,CAAC,MAAc,EAAE,MAAc,EAAE,IAAuC;QACxG,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,GAAG,MAAM,EAAE;YACzC,IAAI,MAAM,KAAK,MAAM,GAAG,CAAC,EAAE;gBACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;aAC/B;iBAAM;gBACL,MAAM,OAAO,GAAG,EAAE,CAAC;gBACnB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;oBAClC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aACpB;SAEF;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,sBAAsB,CAAC,aAAgD,EAAE,UAAkC,EAAE,SAAiC,EAAE,gBAAwC;QAC7L,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,aAAa;YAAE,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5C,IAAI,UAAU;YAAE,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,IAAI,SAAS;YAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QACpC,IAAI,gBAAgB;YAAE,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC5B,IAAI,aAAa,CAAC;QAClB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,IAAI,aAAa,EAAE;YACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACpC,aAAa,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,IAAI,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;gBACtH,aAAa,EAAE,CAAC;aACjB;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE;gBACjC,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,SAAS,CAAC,CAAC;aAC5E;iBAAM,IAAI,aAAa,KAAK,CAAC,IAAI,YAAY,CAAC,mBAAmB,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE;gBACpG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,aAAa,CAAC,CAAC;aAChF;iBAAM,IAAI,aAAa,KAAK,CAAC,EAAE;gBAC9B,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;aACjE;iBAAM;gBACL,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,gBAAgB,CAAC,CAAC;aACnF;SACF;IACH,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/**\n * * For boundary sorting, an edge is a (packed!) Float64Array.\n * * Fixed entry positions are:\n *   * [0] is start vertex index (in CCW order around its facet)\n *   * [1] is end vertex index (in CCW order around its facet)\n *   * [2] is facet index.\n */\nexport class SortableEdge extends Float64Array {\n  /** Return the vertex index that appears first in the order stored.  */\n  public get vertexIndexA(): number { return this[0]; }\n  /** Return the vertex index that appears second in the order stored.  */\n  public get vertexIndexB(): number { return this[1]; }\n  /** Return the facet index.  */\n  public get facetIndex(): number { return this[2]; }\n  /** return true if vertexIndexA is less than vertexIndexB */\n  public get isLowHigh(): boolean { return this[0] < this[1]; }\n  /** Return the vertex index with lower numeric value */\n  public get lowVertexIndex(): number { return this[0] < this[1] ? this[0] : this[1]; }\n  /** Return the vertex index with higher numeric value */\n  public get highVertexIndex(): number { return this[0] > this[1] ? this[0] : this[1]; }\n  /** Return true if the vertices edgeA and edgeB are the same vertex indices in opposite order */\n  public static areDirectedPartners(edgeA: SortableEdge, edgeB: SortableEdge): boolean { return edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]; }\n  /** Return true if the vertices edgeA and edgeB are the same vertex indices with no consideration of order */\n  public static areUndirectedPartners(edgeA: SortableEdge, edgeB: SortableEdge): boolean {\n    return (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) || ((edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]));\n  }\n  /** Return numeric relationship of edgeA and edgeB:\n   * * 1 if they share start and end in the same order\n   * * -1 if they share start and end in reversed order\n   * * 0 otherwise.\n   */\n  public static relativeOrientation(edgeA: SortableEdge, edgeB: SortableEdge): number {\n    if (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) return 1;\n    if (edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]) return -1;\n    return 0;\n  }\n\n  public get isNullEdge(): boolean { return this[0] === this[1]; }\n  /**\n   * lexical comparison of two edges.\n   * * If the edges have the same vertex pair (in same or opposite order) they will end up adjacent in a sort\n   * * If the edges have 0 or 1 shared vertex indices, the one with lowest low comes first.\n   * @param edgeA first edge\n   * @param edgeB second edge\n   */\n  public static lessThan(edgeA: SortableEdge, edgeB: SortableEdge): number {\n    // primary compare is based on indirect indices\n    const lowA = edgeA.lowVertexIndex;\n    const lowB = edgeB.lowVertexIndex;\n    if (lowA < lowB)\n      return -1;\n    if (lowB < lowA)\n      return 1;\n    const highA = edgeA.highVertexIndex;\n    const highB = edgeB.highVertexIndex;\n    if (highA < highB)\n      return -1;\n    if (highB < highA)\n      return 1;\n    // undirected indices match ... use directed vertexIndexA\n    return edgeA.vertexIndexA - edgeB.vertexIndexA;\n  }\n  public constructor(vertexA: number, vertexB: number, facetIndex: number) {\n    super(3);\n    this[0] = vertexA;\n    this[1] = vertexB;\n    this[2] = facetIndex;\n  }\n  public toJSON(): any { return [this[0], this[1], this[2]]; }\n  public static clusterToJSON(data: SortableEdgeCluster): any {\n    if (data instanceof SortableEdge)\n      return data.toJSON();\n\n    const result = [];\n    for (const edge of data) result.push(edge.toJSON());\n  }\n  public static clusterArrayToJSON(data: SortableEdgeCluster[]) {\n    const result = [];\n    for (const cluster of data)\n      result.push(SortableEdge.clusterToJSON(cluster));\n    return result;\n  }\n}\n\nexport type SortableEdgeCluster = SortableEdge | SortableEdge[];\n/**\n * An IndexedEdgeMatcher carries an array (`edges`) of edges start & end indices for sorting and subsequent analyses (such as testing for closed mesh)\n */\nexport class IndexedEdgeMatcher {\n  public edges: SortableEdge[];\n\n  constructor() {\n    this.edges = [];\n  }\n  /**\n   * push a new edge.\n   * @returns the edge (as emplaced at the back of the sortableEdge array)\n   * @param vertexA start vertex\n   * @param vertexB end vertex\n   * @param facetIndex facet index\n   */\n  public addEdge(vertexA: number, vertexB: number, facetIndex: number): SortableEdge {\n    const edge = new SortableEdge(vertexA, vertexB, facetIndex);\n    this.edges.push(edge);\n    return edge;\n  }\n  /**\n   * Push edges all around a facet, returning to vertexArray[0]\n   * @param vertexArray array of vertex indices around facet\n   * @param facetIndex\n   */\n  public addPath(vertexArray: number[], facetIndex: number, closeLoop: boolean = true) {\n    if (vertexArray.length === 0) return;\n    const m = vertexArray.length - 1;\n    for (let i = 0; i < m; i++) {\n      this.addEdge(vertexArray[i], vertexArray[i + 1], facetIndex);\n    }\n    if (closeLoop)\n      this.addEdge(vertexArray[m], vertexArray[0], facetIndex);\n  }\n  /** Sort the edge index array. */\n  public sort() {\n    this.edges.sort((edgeA, edgeB) => SortableEdge.lessThan(edgeA, edgeB));\n  }\n  /** Create a single or compound SortableEdgeCluster in dest. */\n  private collectSortableEdgeCluster(index0: number, index1: number, dest: SortableEdgeCluster[] | undefined) {\n    if (dest !== undefined && index1 > index0) {\n      if (index1 === index0 + 1) {\n        dest.push(this.edges[index0]);\n      } else {\n        const cluster = [];\n        for (let i = index0; i < index1; i++)\n          cluster.push(this.edges[i]);\n        dest.push(cluster);\n      }\n\n    }\n  }\n  /**\n   * sort the edges, and look for three categories of paired edges:\n   * * caller must allocate all result arrays of interest.\n   * * Any combination of the result arrays may be `undefined`, indicating that category is to be ignored.\n   * * Any combination of the result arrays may be aliased as the same target, in which case those to categories are merged into the target.\n   * * For instance, to ignore manifold pairs and collect all others (singleton, null, and other) as a single array `allOther`, create `const allOther = []` as an empty array and call\n   * `sortAndCollectClusters (undefined, allOther, allOther, allOther);`\n   * @param manifoldPairs optional array to receive pairs of properly mated SortableEdgePairs, i.e. simple interior edges adjacent to two facets in opposing directions.\n   * @param singletons optional array to receive edges that are simple boundary edges.\n   * @param nullEdges optional array to receive arrays of null edges (same start and end vertex)\n   * @param allOtherClusters optional array to receive arrays in which all the edges are partners in an undirected sense but not a simple directed pair.\n   */\n  public sortAndCollectClusters(manifoldPairs: SortableEdgeCluster[] | undefined, singletons?: SortableEdgeCluster[], nullEdges?: SortableEdgeCluster[], allOtherClusters?: SortableEdgeCluster[]) {\n    this.sort();\n    if (manifoldPairs) manifoldPairs.length = 0;\n    if (singletons) singletons.length = 0;\n    if (nullEdges) nullEdges.length = 0;\n    if (allOtherClusters) allOtherClusters.length = 0;\n    const n = this.edges.length;\n    let clusterLength;\n    for (let index0 = 0; index0 < n; index0 += clusterLength) {\n      const baseEdge = this.edges[index0];\n      clusterLength = 1;\n      for (let index1 = index0 + 1; index1 < n && SortableEdge.areUndirectedPartners(baseEdge, this.edges[index1]); index1++) {\n        clusterLength++;\n      }\n      if (this.edges[index0].isNullEdge) {\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, nullEdges);\n      } else if (clusterLength === 2 && SortableEdge.areDirectedPartners(baseEdge, this.edges[index0 + 1])) {\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, manifoldPairs);\n      } else if (clusterLength === 1) {\n        this.collectSortableEdgeCluster(index0, index0 + 1, singletons);\n      } else {\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, allOtherClusters);\n      }\n    }\n  }\n}\n"]}

package/lib/esm/polyface/IndexedPolyfaceVisitor.js.map

@@ -1 +1 @@
-{"version":3,"file":"IndexedPolyfaceVisitor.js","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceVisitor.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,sCAAsC;AAEtC;;;;GAIG;AACH,MAAM,OAAO,sBAAuB,SAAQ,YAAY;IAMtD,0EAA0E;IAC1E,YAAsB,MAAuB,EAAE,OAAe;QAC5D,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC5G,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO;YACrB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAExD,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;IAE/B,CAAC;IACD,yCAAyC;IAClC,cAAc,KAAe,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5D,iGAAiG;IAC1F,UAAU,CAAC,OAAe,IAAI,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC;IAE/D;;OAEG;IACH,IAAW,iBAAiB,KAAa,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACjE;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,QAAyB,EAAE,OAAe;QAC7D,OAAO,IAAI,sBAAsB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;IACD,wEAAwE;IACjE,eAAe,CAAC,UAAkB;QACvC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,iBAAiB,CAAC,UAAU,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,kBAAkB,GAAG,UAAU,CAAC;QACrC,IAAI,CAAC,eAAe,GAAG,UAAU,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QAC3D,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrK,OAAO,IAAI,CAAC;IACd,CAAC;IACD,wEAAwE;IACjE,eAAe;QACpB,IAAI,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC,kBAAkB;YAClD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QACpD,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sEAAsE;IAC/D,KAAK;QACV,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,2CAA2C;IACvE,CAAC;IAED;;;OAGG;IACI,uBAAuB,CAAC,KAAa,EAAE,MAAgB;QAC5D,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB;YACjC,OAAO,SAAS,CAAC;QAEnB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACnE,OAAO,SAAS,CAAC;QAEnB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACxE,IAAI,CAAC,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,OAAO,QAAQ,CAAC,wBAAwB,CAAC,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;IAC7I,CAAC;IAED;;;OAGG;IACI,yBAAyB,CAAC,KAAa,EAAE,MAAgB;QAC9D,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB;YACjC,OAAO,SAAS,CAAC;QAEnB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACnE,OAAO,SAAS,CAAC;QAEnB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACxE,IAAI,CAAC,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,OAAO,QAAQ,CAAC,0BAA0B,CAAC,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/I,CAAC;IACD,qEAAqE;IAC9D,gBAAgB,KAAa,OAAO,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;IACrE,2EAA2E;IACpE,gBAAgB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,2EAA2E;IACpE,gBAAgB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,4EAA4E;IACrE,iBAAiB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnG,2EAA2E;IACpE,gBAAgB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,8EAA8E;IACvE,cAAc,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhG,6GAA6G;IACtG,WAAW;QAChB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,6FAA6F;IACtF,YAAY,CAAC,KAAsB,EAAE,KAAa;QACvD,IAAI,CAAC,KAAK,CAAC,wBAAwB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzD,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM;YAC5D,IAAI,CAAC,MAAM,CAAC,wBAAwB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC9D,CAAC;IACD;;OAEG;IACI,wBAAwB,CAAC,KAAsB,EAAE,MAAc,EAAE,QAAgB,EAAE,MAAc;QACtG,IAAI,CAAC,KAAK,CAAC,oCAAoC,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvF,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxF,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzF,IAAI,CAAC,KAAK,CAAC,mCAAmC,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACxF,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM;YAC7F,IAAI,CAAC,MAAM,CAAC,oCAAoC,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC7F,CAAC;CACF;AACD;;;;;;;;;;;GAWG;AACH,SAAS,eAAe,CAAC,MAAc,EAAE,QAAgB,EAAE,MAAc,EAAE,SAAiB;IAC1F,MAAM,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC;IACvC,MAAM,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;IACvE,OAAO,KAAK,IAAI,SAAS,CAAC;AAC5B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,QAAgB,EAAE,MAAc;IAC/E,4DAA4D;IAC5D,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,sCAAsC;IACtC;;;;;MAKE;IACF,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAE5D,OAAO,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,4BAA6B,SAAQ,sBAAsB;IAItE,YAAoB,QAAyB,EAAE,kBAA4B,EAAE,OAAe;QAC1F,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC;QACtD,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,mBAAmB,CAAC,QAAyB,EAAE,kBAA4B,EAAE,OAAe;QACxG,OAAO,IAAI,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,EAAE,OAAO,CAAC,CAAC;IACjF,CAAC;IACD,wEAAwE;IACxD,eAAe,CAAC,WAAmB;QACjD,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,IAAI,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE;YACtE,IAAI,CAAC,gBAAgB,GAAG,WAAW,CAAC;YACpC,OAAO,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,mBAAmB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;SACvE;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wEAAwE;IACxD,eAAe;QAC7B,IAAI,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE;YAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAC3D,IAAI,MAAM,EAAE;gBACV,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxB,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,sEAAsE;IACtD,KAAK;QACnB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD,oFAAoF;IAC7E,gBAAgB,CAAC,WAAmB;QACzC,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,IAAI,IAAI,CAAC,gBAAgB,EAAE;YAC5D,OAAO,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC;SAC9C;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\nimport { Geometry } from \"../Geometry\";\r\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { IndexedPolyface, Polyface, PolyfaceVisitor } from \"./Polyface\";\r\nimport { PolyfaceData } from \"./PolyfaceData\";\r\n\r\n/* eslint-disable @itwin/prefer-get */\r\n\r\n/**\r\n * An `IndexedPolyfaceVisitor` is an iterator-like object that \"visits\" facets of a mesh.\r\n * * The visitor extends a `PolyfaceData ` class, so it can at any time hold all the data of a single facet.\r\n * @public\r\n */\r\nexport class IndexedPolyfaceVisitor extends PolyfaceData implements PolyfaceVisitor {\r\n  private _currentFacetIndex: number;\r\n  private _nextFacetIndex: number;\r\n  private _numWrap: number;\r\n  private _numEdges: number;\r\n  private _polyface: IndexedPolyface;\r\n  // to be called from static factory method that validates the polyface ...\r\n  protected constructor(facets: IndexedPolyface, numWrap: number) {\r\n    super(facets.data.normalCount > 0, facets.data.paramCount > 0, facets.data.colorCount > 0, facets.twoSided);\r\n    this._polyface = facets;\r\n    this._numWrap = numWrap;\r\n    if (facets.data.auxData)\r\n      this.auxData = facets.data.auxData.createForVisitor();\r\n\r\n    this.reset();\r\n    this._numEdges = 0;\r\n    this._nextFacetIndex = 0;\r\n    this._currentFacetIndex = -1;\r\n\r\n  }\r\n  /** Return the client polyface object. */\r\n  public clientPolyface(): Polyface { return this._polyface; }\r\n  /** Set the number of vertices duplicated (e.g. 1 for start and end) in arrays in the visitor. */\r\n  public setNumWrap(numWrap: number) { this._numWrap = numWrap; }\r\n\r\n  /** Return the number of edges in the current facet.\r\n   * * Note that if this visitor has `numWrap` greater than zero, the number of edges is smaller than the number of points.\r\n   */\r\n  public get numEdgesThisFacet(): number { return this._numEdges; }\r\n  /** Create a visitor for iterating the facets of `polyface`, with indicated number of points to be added to each facet to produce closed point arrays\r\n   * Typical wrap counts are:\r\n   * * 0 -- leave the point arrays with \"missing final edge\"\r\n   * * 1 -- add point 0 as closure point\r\n   * * 2 -- add points 0 and 1 as closure and wrap point.  This is useful when vertex visit requires two adjacent vectors, e.g. for cross products.\r\n   */\r\n  public static create(polyface: IndexedPolyface, numWrap: number): IndexedPolyfaceVisitor {\r\n    return new IndexedPolyfaceVisitor(polyface, numWrap);\r\n  }\r\n  /** Advance the iterator to a particular facet in the client polyface */\r\n  public moveToReadIndex(facetIndex: number): boolean {\r\n    if (!this._polyface.isValidFacetIndex(facetIndex))\r\n      return false;\r\n    this._currentFacetIndex = facetIndex;\r\n    this._nextFacetIndex = facetIndex + 1;\r\n    this._numEdges = this._polyface.numEdgeInFacet(facetIndex);\r\n    this.resizeAllDataArrays(this._numEdges + this._numWrap);\r\n    this.gatherIndexedData(this._polyface.data, this._polyface.facetIndex0(this._currentFacetIndex), this._polyface.facetIndex1(this._currentFacetIndex), this._numWrap);\r\n    return true;\r\n  }\r\n  /** Advance the iterator to a the 'next' facet in the client polyface */\r\n  public moveToNextFacet(): boolean {\r\n    if (this._nextFacetIndex !== this._currentFacetIndex)\r\n      return this.moveToReadIndex(this._nextFacetIndex);\r\n    this._nextFacetIndex++;\r\n    return true;\r\n  }\r\n\r\n  /** Reset the iterator to start at the first facet of the polyface. */\r\n  public reset(): void {\r\n    this.moveToReadIndex(0);\r\n    this._nextFacetIndex = 0; // so immediate moveToNextFacet stays here.\r\n  }\r\n\r\n  /**\r\n   * Attempts to extract the distance parameter for the given vertex index on the current facet\r\n   * Returns the distance parameter as a point. Returns undefined on failure.\r\n   */\r\n  public tryGetDistanceParameter(index: number, result?: Point2d): Point2d | undefined {\r\n    if (index >= this.numEdgesThisFacet)\r\n      return undefined;\r\n\r\n    if (this.param === undefined || this._polyface.data.face.length === 0)\r\n      return undefined;\r\n\r\n    const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);\r\n    if (!faceData)\r\n      return undefined;\r\n    return faceData.convertParamXYToDistance(this.param.getXAtUncheckedPointIndex(index), this.param.getYAtUncheckedPointIndex(index), result);\r\n  }\r\n\r\n  /**\r\n   * Attempts to extract the normalized parameter (0,1) for the given vertex index on the current facet.\r\n   * Returns the normalized parameter as a point. Returns undefined on failure.\r\n   */\r\n  public tryGetNormalizedParameter(index: number, result?: Point2d): Point2d | undefined {\r\n    if (index >= this.numEdgesThisFacet)\r\n      return undefined;\r\n\r\n    if (this.param === undefined || this._polyface.data.face.length === 0)\r\n      return undefined;\r\n\r\n    const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);\r\n    if (!faceData)\r\n      return undefined;\r\n    return faceData.convertParamXYToNormalized(this.param.getXAtUncheckedPointIndex(index), this.param.getYAtUncheckedPointIndex(index), result);\r\n  }\r\n  /** Return the index (in the client polyface) of the current facet */\r\n  public currentReadIndex(): number { return this._currentFacetIndex; }\r\n  /** Return the point index of vertex i within the currently loaded facet */\r\n  public clientPointIndex(i: number): number { return this.pointIndex[i]; }\r\n  /** Return the param index of vertex i within the currently loaded facet */\r\n  public clientParamIndex(i: number): number { return this.paramIndex ? this.paramIndex[i] : -1; }\r\n  /** Return the normal index of vertex i within the currently loaded facet */\r\n  public clientNormalIndex(i: number): number { return this.normalIndex ? this.normalIndex[i] : -1; }\r\n  /** Return the color index of vertex i within the currently loaded facet */\r\n  public clientColorIndex(i: number): number { return this.colorIndex ? this.colorIndex[i] : -1; }\r\n  /** Return the aux data index of vertex i within the currently loaded facet */\r\n  public clientAuxIndex(i: number): number { return this.auxData ? this.auxData.indices[i] : -1; }\r\n\r\n  /** clear the contents of all arrays.  Use this along with transferDataFrom methods to build up new facets */\r\n  public clearArrays(): void {\r\n    if (this.point !== undefined)\r\n      this.point.length = 0;\r\n    if (this.param !== undefined)\r\n      this.param.length = 0;\r\n    if (this.normal !== undefined)\r\n      this.normal.length = 0;\r\n    if (this.color !== undefined)\r\n      this.color.length = 0;\r\n  }\r\n  /** transfer data from a specified index of the other visitor as new data in this visitor. */\r\n  public pushDataFrom(other: PolyfaceVisitor, index: number): void {\r\n    this.point.pushFromGrowableXYZArray(other.point, index);\r\n    if (this.color && other.color && index < other.color.length)\r\n      this.color.push(other.color[index]);\r\n    if (this.param && other.param && index < other.param.length)\r\n      this.param.pushFromGrowableXYArray(other.param, index);\r\n    if (this.normal && other.normal && index < other.normal.length)\r\n      this.normal.pushFromGrowableXYZArray(other.normal, index);\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  public pushInterpolatedDataFrom(other: PolyfaceVisitor, index0: number, fraction: number, index1: number): void {\r\n    this.point.pushInterpolatedFromGrowableXYZArray(other.point, index0, fraction, index1);\r\n    if (this.color && other.color && index0 < other.color.length && index1 < other.color.length)\r\n      this.color.push(interpolateColor(other.color[index0], fraction, other.color[index1]));\r\n    if (this.param && other.param && index0 < other.param.length && index1 < other.param.length)\r\n      this.param.pushInterpolatedFromGrowableXYArray(other.param, index0, fraction, index1);\r\n    if (this.normal && other.normal && index0 < other.normal.length && index1 < other.normal.length)\r\n      this.normal.pushInterpolatedFromGrowableXYZArray(other.normal, index0, fraction, index1);\r\n  }\r\n}\r\n/**\r\n * * shift to right by shiftBits.\r\n * * mask off the low 8 bits\r\n * * interpolate the number\r\n * * truncate to floor\r\n * * shift left\r\n * * Hence all numbers in and out of the floating point are 0..255.\r\n * @param color0\r\n * @param fraction\r\n * @param color1\r\n * @param shiftBits\r\n */\r\nfunction interpolateByte(color0: number, fraction: number, color1: number, shiftBits: number): number {\r\n  color0 = (color0 >>> shiftBits) & 0xFF;\r\n  color1 = (color1 >>> shiftBits) & 0xFF;\r\n  const color = Math.floor(color0 + fraction * (color1 - color0)) & 0xFF;\r\n  return color << shiftBits;\r\n}\r\n\r\n/**\r\n * Interpolate each byte of color0 and color1 as integers.\r\n * @param color0 32 bit color (e.g. rgb+transparency)\r\n * @param fraction fractional position.  This is clamped to 0..1 to prevent byte values outside their 0..255 range.\r\n * @param color1\r\n * @param shiftBits\r\n * @internal\r\n */\r\nexport function interpolateColor(color0: number, fraction: number, color1: number) {\r\n  // don't allow fractions outside the individual byte ranges.\r\n  fraction = Geometry.clamp(fraction, 0, 1);\r\n  // interpolate each byte in place ....\r\n  /*\r\n  const byte0 = interpolateLowByte(color0 & 0xFF, fraction, color1 & 0xFF);\r\n  const byte1 = interpolateLowByte((color0 & 0xFF00) >>> 8, fraction, (color1 & 0xFF00) >>> 8) << 8;\r\n  const byte2 = interpolateLowByte((color0 & 0xFF0000) >>> 16, fraction, (color1 & 0xFF0000) >>> 16) << 16;\r\n  const byte3 = interpolateLowByte((color0 & 0xFF000000) >>> 24, fraction, (color1 & 0xFF000000) >>> 24) << 24;\r\n  */\r\n  const byte0 = interpolateByte(color0, fraction, color1, 0);\r\n  const byte1 = interpolateByte(color0, fraction, color1, 8);\r\n  const byte2 = interpolateByte(color0, fraction, color1, 16);\r\n  const byte3 = interpolateByte(color0, fraction, color1, 24);\r\n\r\n  return (byte0 | byte1 | byte2 | byte3);\r\n}\r\n\r\n/**\r\n * An `IndexedPolyfaceSubsetVisitor` is an IndexedPolyfaceVisitor which only visits a subset of facets in the polyface.\r\n * * The subset is defined by an array of facet indices provided when this visitor is created.\r\n * * Within the subset visitor, \"facetIndex\" is understood as index within the subset array:\r\n *   * moveToNextFacet moves only within the subset\r\n *   * moveToReadIndex(i) moves underlying visitor's parentFacetIndex(i)\r\n * @public\r\n */\r\nexport class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {\r\n  private _parentFacetIndices: number[];\r\n  // index WITHIN THE _parentFacetIndices array.\r\n  private _nextActiveIndex: number;\r\n  private constructor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number) {\r\n    super(polyface, numWrap);\r\n    this._parentFacetIndices = activeFacetIndices.slice();\r\n    this._nextActiveIndex = 0;\r\n  }\r\n  /** Create a visitor for iterating a subset of the facets of `polyface`, with indicated number of points to be added to each facet to produce closed point arrays\r\n   * * Typical wrap counts are:\r\n   *   * 0 -- leave the point arrays with \"missing final edge\"\r\n   *   * 1 -- add point 0 as closure point\r\n   *   * 2 -- add points 0 and 1 as closure and wrap point.  This is useful when vertex visit requires two adjacent vectors, e.g. for cross products.\r\n   * * The activeFacetIndices array indicates all facets to be visited.\r\n   */\r\n  public static createSubsetVisitor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number): IndexedPolyfaceSubsetVisitor {\r\n    return new IndexedPolyfaceSubsetVisitor(polyface, activeFacetIndices, numWrap);\r\n  }\r\n  /** Advance the iterator to a particular facet in the client polyface */\r\n  public override moveToReadIndex(activeIndex: number): boolean {\r\n    if (activeIndex >= 0 && activeIndex <= this._parentFacetIndices.length) {\r\n      this._nextActiveIndex = activeIndex;\r\n      return super.moveToReadIndex(this._parentFacetIndices[activeIndex++]);\r\n    }\r\n    return false;\r\n  }\r\n  /** Advance the iterator to a the 'next' facet in the client polyface */\r\n  public override moveToNextFacet(): boolean {\r\n    if (this._nextActiveIndex < this._parentFacetIndices.length) {\r\n      const result = this.moveToReadIndex(this._nextActiveIndex);\r\n      if (result) {\r\n        this._nextActiveIndex++;\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** Reset the iterator to start at the first facet of the polyface. */\r\n  public override reset(): void {\r\n    this._nextActiveIndex = 0;\r\n  }\r\n  /** return the parent facet index of the indicated index within the active facets */\r\n  public parentFacetIndex(activeIndex: number): number | undefined {\r\n    if (activeIndex >= 0 && activeIndex <= this._nextActiveIndex) {\r\n      return this._parentFacetIndices[activeIndex];\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"IndexedPolyfaceVisitor.js","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceVisitor.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,sCAAsC;AAEtC;;;;GAIG;AACH,MAAM,OAAO,sBAAuB,SAAQ,YAAY;IAMtD,0EAA0E;IAC1E,YAAsB,MAAuB,EAAE,OAAe;QAC5D,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC5G,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO;YACrB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAExD,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;IAE/B,CAAC;IACD,yCAAyC;IAClC,cAAc,KAAe,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5D,iGAAiG;IAC1F,UAAU,CAAC,OAAe,IAAI,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC;IAE/D;;OAEG;IACH,IAAW,iBAAiB,KAAa,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACjE;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,QAAyB,EAAE,OAAe;QAC7D,OAAO,IAAI,sBAAsB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;IACD,wEAAwE;IACjE,eAAe,CAAC,UAAkB;QACvC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,iBAAiB,CAAC,UAAU,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,kBAAkB,GAAG,UAAU,CAAC;QACrC,IAAI,CAAC,eAAe,GAAG,UAAU,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QAC3D,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrK,OAAO,IAAI,CAAC;IACd,CAAC;IACD,wEAAwE;IACjE,eAAe;QACpB,IAAI,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC,kBAAkB;YAClD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QACpD,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sEAAsE;IAC/D,KAAK;QACV,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,2CAA2C;IACvE,CAAC;IAED;;;OAGG;IACI,uBAAuB,CAAC,KAAa,EAAE,MAAgB;QAC5D,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB;YACjC,OAAO,SAAS,CAAC;QAEnB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACnE,OAAO,SAAS,CAAC;QAEnB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACxE,IAAI,CAAC,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,OAAO,QAAQ,CAAC,wBAAwB,CAAC,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;IAC7I,CAAC;IAED;;;OAGG;IACI,yBAAyB,CAAC,KAAa,EAAE,MAAgB;QAC9D,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB;YACjC,OAAO,SAAS,CAAC;QAEnB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACnE,OAAO,SAAS,CAAC;QAEnB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACxE,IAAI,CAAC,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,OAAO,QAAQ,CAAC,0BAA0B,CAAC,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/I,CAAC;IACD,qEAAqE;IAC9D,gBAAgB,KAAa,OAAO,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;IACrE,2EAA2E;IACpE,gBAAgB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,2EAA2E;IACpE,gBAAgB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,4EAA4E;IACrE,iBAAiB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnG,2EAA2E;IACpE,gBAAgB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,8EAA8E;IACvE,cAAc,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhG,6GAA6G;IACtG,WAAW;QAChB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,6FAA6F;IACtF,YAAY,CAAC,KAAsB,EAAE,KAAa;QACvD,IAAI,CAAC,KAAK,CAAC,wBAAwB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzD,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM;YAC5D,IAAI,CAAC,MAAM,CAAC,wBAAwB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC9D,CAAC;IACD;;OAEG;IACI,wBAAwB,CAAC,KAAsB,EAAE,MAAc,EAAE,QAAgB,EAAE,MAAc;QACtG,IAAI,CAAC,KAAK,CAAC,oCAAoC,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvF,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxF,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzF,IAAI,CAAC,KAAK,CAAC,mCAAmC,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACxF,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM;YAC7F,IAAI,CAAC,MAAM,CAAC,oCAAoC,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC7F,CAAC;CACF;AACD;;;;;;;;;;;GAWG;AACH,SAAS,eAAe,CAAC,MAAc,EAAE,QAAgB,EAAE,MAAc,EAAE,SAAiB;IAC1F,MAAM,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC;IACvC,MAAM,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;IACvE,OAAO,KAAK,IAAI,SAAS,CAAC;AAC5B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,QAAgB,EAAE,MAAc;IAC/E,4DAA4D;IAC5D,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,sCAAsC;IACtC;;;;;MAKE;IACF,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAE5D,OAAO,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,4BAA6B,SAAQ,sBAAsB;IAItE,YAAoB,QAAyB,EAAE,kBAA4B,EAAE,OAAe;QAC1F,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC;QACtD,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,mBAAmB,CAAC,QAAyB,EAAE,kBAA4B,EAAE,OAAe;QACxG,OAAO,IAAI,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,EAAE,OAAO,CAAC,CAAC;IACjF,CAAC;IACD,wEAAwE;IACxD,eAAe,CAAC,WAAmB;QACjD,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,IAAI,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE;YACtE,IAAI,CAAC,gBAAgB,GAAG,WAAW,CAAC;YACpC,OAAO,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,mBAAmB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;SACvE;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wEAAwE;IACxD,eAAe;QAC7B,IAAI,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE;YAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAC3D,IAAI,MAAM,EAAE;gBACV,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxB,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,sEAAsE;IACtD,KAAK;QACnB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD,oFAAoF;IAC7E,gBAAgB,CAAC,WAAmB;QACzC,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,IAAI,IAAI,CAAC,gBAAgB,EAAE;YAC5D,OAAO,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC;SAC9C;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\nimport { Geometry } from \"../Geometry\";\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\nimport { IndexedPolyface, Polyface, PolyfaceVisitor } from \"./Polyface\";\nimport { PolyfaceData } from \"./PolyfaceData\";\n\n/* eslint-disable @itwin/prefer-get */\n\n/**\n * An `IndexedPolyfaceVisitor` is an iterator-like object that \"visits\" facets of a mesh.\n * * The visitor extends a `PolyfaceData ` class, so it can at any time hold all the data of a single facet.\n * @public\n */\nexport class IndexedPolyfaceVisitor extends PolyfaceData implements PolyfaceVisitor {\n  private _currentFacetIndex: number;\n  private _nextFacetIndex: number;\n  private _numWrap: number;\n  private _numEdges: number;\n  private _polyface: IndexedPolyface;\n  // to be called from static factory method that validates the polyface ...\n  protected constructor(facets: IndexedPolyface, numWrap: number) {\n    super(facets.data.normalCount > 0, facets.data.paramCount > 0, facets.data.colorCount > 0, facets.twoSided);\n    this._polyface = facets;\n    this._numWrap = numWrap;\n    if (facets.data.auxData)\n      this.auxData = facets.data.auxData.createForVisitor();\n\n    this.reset();\n    this._numEdges = 0;\n    this._nextFacetIndex = 0;\n    this._currentFacetIndex = -1;\n\n  }\n  /** Return the client polyface object. */\n  public clientPolyface(): Polyface { return this._polyface; }\n  /** Set the number of vertices duplicated (e.g. 1 for start and end) in arrays in the visitor. */\n  public setNumWrap(numWrap: number) { this._numWrap = numWrap; }\n\n  /** Return the number of edges in the current facet.\n   * * Note that if this visitor has `numWrap` greater than zero, the number of edges is smaller than the number of points.\n   */\n  public get numEdgesThisFacet(): number { return this._numEdges; }\n  /** Create a visitor for iterating the facets of `polyface`, with indicated number of points to be added to each facet to produce closed point arrays\n   * Typical wrap counts are:\n   * * 0 -- leave the point arrays with \"missing final edge\"\n   * * 1 -- add point 0 as closure point\n   * * 2 -- add points 0 and 1 as closure and wrap point.  This is useful when vertex visit requires two adjacent vectors, e.g. for cross products.\n   */\n  public static create(polyface: IndexedPolyface, numWrap: number): IndexedPolyfaceVisitor {\n    return new IndexedPolyfaceVisitor(polyface, numWrap);\n  }\n  /** Advance the iterator to a particular facet in the client polyface */\n  public moveToReadIndex(facetIndex: number): boolean {\n    if (!this._polyface.isValidFacetIndex(facetIndex))\n      return false;\n    this._currentFacetIndex = facetIndex;\n    this._nextFacetIndex = facetIndex + 1;\n    this._numEdges = this._polyface.numEdgeInFacet(facetIndex);\n    this.resizeAllDataArrays(this._numEdges + this._numWrap);\n    this.gatherIndexedData(this._polyface.data, this._polyface.facetIndex0(this._currentFacetIndex), this._polyface.facetIndex1(this._currentFacetIndex), this._numWrap);\n    return true;\n  }\n  /** Advance the iterator to a the 'next' facet in the client polyface */\n  public moveToNextFacet(): boolean {\n    if (this._nextFacetIndex !== this._currentFacetIndex)\n      return this.moveToReadIndex(this._nextFacetIndex);\n    this._nextFacetIndex++;\n    return true;\n  }\n\n  /** Reset the iterator to start at the first facet of the polyface. */\n  public reset(): void {\n    this.moveToReadIndex(0);\n    this._nextFacetIndex = 0; // so immediate moveToNextFacet stays here.\n  }\n\n  /**\n   * Attempts to extract the distance parameter for the given vertex index on the current facet\n   * Returns the distance parameter as a point. Returns undefined on failure.\n   */\n  public tryGetDistanceParameter(index: number, result?: Point2d): Point2d | undefined {\n    if (index >= this.numEdgesThisFacet)\n      return undefined;\n\n    if (this.param === undefined || this._polyface.data.face.length === 0)\n      return undefined;\n\n    const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);\n    if (!faceData)\n      return undefined;\n    return faceData.convertParamXYToDistance(this.param.getXAtUncheckedPointIndex(index), this.param.getYAtUncheckedPointIndex(index), result);\n  }\n\n  /**\n   * Attempts to extract the normalized parameter (0,1) for the given vertex index on the current facet.\n   * Returns the normalized parameter as a point. Returns undefined on failure.\n   */\n  public tryGetNormalizedParameter(index: number, result?: Point2d): Point2d | undefined {\n    if (index >= this.numEdgesThisFacet)\n      return undefined;\n\n    if (this.param === undefined || this._polyface.data.face.length === 0)\n      return undefined;\n\n    const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);\n    if (!faceData)\n      return undefined;\n    return faceData.convertParamXYToNormalized(this.param.getXAtUncheckedPointIndex(index), this.param.getYAtUncheckedPointIndex(index), result);\n  }\n  /** Return the index (in the client polyface) of the current facet */\n  public currentReadIndex(): number { return this._currentFacetIndex; }\n  /** Return the point index of vertex i within the currently loaded facet */\n  public clientPointIndex(i: number): number { return this.pointIndex[i]; }\n  /** Return the param index of vertex i within the currently loaded facet */\n  public clientParamIndex(i: number): number { return this.paramIndex ? this.paramIndex[i] : -1; }\n  /** Return the normal index of vertex i within the currently loaded facet */\n  public clientNormalIndex(i: number): number { return this.normalIndex ? this.normalIndex[i] : -1; }\n  /** Return the color index of vertex i within the currently loaded facet */\n  public clientColorIndex(i: number): number { return this.colorIndex ? this.colorIndex[i] : -1; }\n  /** Return the aux data index of vertex i within the currently loaded facet */\n  public clientAuxIndex(i: number): number { return this.auxData ? this.auxData.indices[i] : -1; }\n\n  /** clear the contents of all arrays.  Use this along with transferDataFrom methods to build up new facets */\n  public clearArrays(): void {\n    if (this.point !== undefined)\n      this.point.length = 0;\n    if (this.param !== undefined)\n      this.param.length = 0;\n    if (this.normal !== undefined)\n      this.normal.length = 0;\n    if (this.color !== undefined)\n      this.color.length = 0;\n  }\n  /** transfer data from a specified index of the other visitor as new data in this visitor. */\n  public pushDataFrom(other: PolyfaceVisitor, index: number): void {\n    this.point.pushFromGrowableXYZArray(other.point, index);\n    if (this.color && other.color && index < other.color.length)\n      this.color.push(other.color[index]);\n    if (this.param && other.param && index < other.param.length)\n      this.param.pushFromGrowableXYArray(other.param, index);\n    if (this.normal && other.normal && index < other.normal.length)\n      this.normal.pushFromGrowableXYZArray(other.normal, index);\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  public pushInterpolatedDataFrom(other: PolyfaceVisitor, index0: number, fraction: number, index1: number): void {\n    this.point.pushInterpolatedFromGrowableXYZArray(other.point, index0, fraction, index1);\n    if (this.color && other.color && index0 < other.color.length && index1 < other.color.length)\n      this.color.push(interpolateColor(other.color[index0], fraction, other.color[index1]));\n    if (this.param && other.param && index0 < other.param.length && index1 < other.param.length)\n      this.param.pushInterpolatedFromGrowableXYArray(other.param, index0, fraction, index1);\n    if (this.normal && other.normal && index0 < other.normal.length && index1 < other.normal.length)\n      this.normal.pushInterpolatedFromGrowableXYZArray(other.normal, index0, fraction, index1);\n  }\n}\n/**\n * * shift to right by shiftBits.\n * * mask off the low 8 bits\n * * interpolate the number\n * * truncate to floor\n * * shift left\n * * Hence all numbers in and out of the floating point are 0..255.\n * @param color0\n * @param fraction\n * @param color1\n * @param shiftBits\n */\nfunction interpolateByte(color0: number, fraction: number, color1: number, shiftBits: number): number {\n  color0 = (color0 >>> shiftBits) & 0xFF;\n  color1 = (color1 >>> shiftBits) & 0xFF;\n  const color = Math.floor(color0 + fraction * (color1 - color0)) & 0xFF;\n  return color << shiftBits;\n}\n\n/**\n * Interpolate each byte of color0 and color1 as integers.\n * @param color0 32 bit color (e.g. rgb+transparency)\n * @param fraction fractional position.  This is clamped to 0..1 to prevent byte values outside their 0..255 range.\n * @param color1\n * @param shiftBits\n * @internal\n */\nexport function interpolateColor(color0: number, fraction: number, color1: number) {\n  // don't allow fractions outside the individual byte ranges.\n  fraction = Geometry.clamp(fraction, 0, 1);\n  // interpolate each byte in place ....\n  /*\n  const byte0 = interpolateLowByte(color0 & 0xFF, fraction, color1 & 0xFF);\n  const byte1 = interpolateLowByte((color0 & 0xFF00) >>> 8, fraction, (color1 & 0xFF00) >>> 8) << 8;\n  const byte2 = interpolateLowByte((color0 & 0xFF0000) >>> 16, fraction, (color1 & 0xFF0000) >>> 16) << 16;\n  const byte3 = interpolateLowByte((color0 & 0xFF000000) >>> 24, fraction, (color1 & 0xFF000000) >>> 24) << 24;\n  */\n  const byte0 = interpolateByte(color0, fraction, color1, 0);\n  const byte1 = interpolateByte(color0, fraction, color1, 8);\n  const byte2 = interpolateByte(color0, fraction, color1, 16);\n  const byte3 = interpolateByte(color0, fraction, color1, 24);\n\n  return (byte0 | byte1 | byte2 | byte3);\n}\n\n/**\n * An `IndexedPolyfaceSubsetVisitor` is an IndexedPolyfaceVisitor which only visits a subset of facets in the polyface.\n * * The subset is defined by an array of facet indices provided when this visitor is created.\n * * Within the subset visitor, \"facetIndex\" is understood as index within the subset array:\n *   * moveToNextFacet moves only within the subset\n *   * moveToReadIndex(i) moves underlying visitor's parentFacetIndex(i)\n * @public\n */\nexport class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {\n  private _parentFacetIndices: number[];\n  // index WITHIN THE _parentFacetIndices array.\n  private _nextActiveIndex: number;\n  private constructor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number) {\n    super(polyface, numWrap);\n    this._parentFacetIndices = activeFacetIndices.slice();\n    this._nextActiveIndex = 0;\n  }\n  /** Create a visitor for iterating a subset of the facets of `polyface`, with indicated number of points to be added to each facet to produce closed point arrays\n   * * Typical wrap counts are:\n   *   * 0 -- leave the point arrays with \"missing final edge\"\n   *   * 1 -- add point 0 as closure point\n   *   * 2 -- add points 0 and 1 as closure and wrap point.  This is useful when vertex visit requires two adjacent vectors, e.g. for cross products.\n   * * The activeFacetIndices array indicates all facets to be visited.\n   */\n  public static createSubsetVisitor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number): IndexedPolyfaceSubsetVisitor {\n    return new IndexedPolyfaceSubsetVisitor(polyface, activeFacetIndices, numWrap);\n  }\n  /** Advance the iterator to a particular facet in the client polyface */\n  public override moveToReadIndex(activeIndex: number): boolean {\n    if (activeIndex >= 0 && activeIndex <= this._parentFacetIndices.length) {\n      this._nextActiveIndex = activeIndex;\n      return super.moveToReadIndex(this._parentFacetIndices[activeIndex++]);\n    }\n    return false;\n  }\n  /** Advance the iterator to a the 'next' facet in the client polyface */\n  public override moveToNextFacet(): boolean {\n    if (this._nextActiveIndex < this._parentFacetIndices.length) {\n      const result = this.moveToReadIndex(this._nextActiveIndex);\n      if (result) {\n        this._nextActiveIndex++;\n        return true;\n      }\n    }\n    return false;\n  }\n  /** Reset the iterator to start at the first facet of the polyface. */\n  public override reset(): void {\n    this._nextActiveIndex = 0;\n  }\n  /** return the parent facet index of the indicated index within the active facets */\n  public parentFacetIndex(activeIndex: number): number | undefined {\n    if (activeIndex >= 0 && activeIndex <= this._nextActiveIndex) {\n      return this._parentFacetIndices[activeIndex];\n    }\n    return undefined;\n  }\n}\n"]}

package/lib/esm/polyface/Polyface.d.ts

@@ -21,7 +21,7 @@ export declare abstract class Polyface extends GeometryQuery {
     data: PolyfaceData;
     protected constructor(data: PolyfaceData);
     /** create and return a visitor for this concrete polyface. */
-    abstract createVisitor(_numWrap: number): PolyfaceVisitor;
+    abstract createVisitor(numWrap: number): PolyfaceVisitor;
     /** Flag indicating if the mesh display must assume both sides are visible. */
     get twoSided(): boolean;
     set twoSided(value: boolean);

package/lib/esm/polyface/Polyface.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Polyface.d.ts","sourceRoot":"","sources":["../../../src/polyface/Polyface.ts"],"names":[],"mappings":"AAKA;;GAEG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAEvD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAGhE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;GAIG;AACH,8BAAsB,QAAS,SAAQ,aAAa;IAClD,wCAAwC;IACxC,SAAgB,gBAAgB,cAAc;IAE9C,gCAAgC;IACzB,IAAI,EAAE,YAAY,CAAC;IAC1B,SAAS,aAAa,IAAI,EAAE,YAAY;IAIxC,8DAA8D;aAC9C,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,eAAe;IAChE,8EAA8E;IAC9E,IAAW,QAAQ,IACQ,OAAO,CADkB;IACpD,IAAW,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAiC;IACnE,qFAAqF;IACrF,IAAW,eAAe,IAAI,MAAM,CAAsC;IAC1E,IAAW,eAAe,CAAC,KAAK,EAAE,MAAM,EAAwC;IAChF;;;;;;;;;;SAUK;WACS,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,SAAS,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,SAAS,EAAE,UAAU,EAAE,MAAM,GAAG,OAAO;IAchK;;OAEG;IACH,aAAoB,OAAO,IAAI,OAAO,CAAC;IACvC;;OAEG;IACH,IAAW,UAAU,IAAI,MAAM,GAAG,SAAS,CAE1C;CACF;AACD;;;GAGG;AACH,qBAAa,eAAgB,SAAQ,QAAQ;IAC3C,wDAAwD;IACjD,mBAAmB,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAC/C,0DAA0D;IAC1C,aAAa,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAOlD;;OAEG;IACH,IAAW,OAAO,IAAI,OAAO,CAA4E;IACzG;;;;;;;OAOG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS;IAY/C,0CAA0C;IACnC,kBAAkB,CAAC,OAAO,EAAE,MAAM;IAGzC,2BAA2B;IACpB,KAAK,IAAI,eAAe;IAI/B,8DAA8D;IACvD,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,eAAe;IAK9D,sDAAsD;IAC/C,cAAc;IACrB,mDAAmD;IAC5C,cAAc;IACrB;;;;;OAKG;IACH,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;IAEhC;;;OAGG;IACH,SAAS,CAAC,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAErC,qIAAqI;IAC9H,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS;IAM3D;;;;;OAKG;IACH,SAAS,aAAa,IAAI,EAAE,YAAY,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,eAAe,CAAC,EAAE,MAAM,EAAE;IAa3F;;;;;OAKG;IACI,kBAAkB,CAAC,MAAM,EAAE,eAAe,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,GAAG,SAAS;IAsGtG;;;;;OAKG;IACH,IAAW,wBAAwB,IAAI,MAAM,CAAsE;IACnH;;;;OAIG;WACW,MAAM,CAAC,WAAW,GAAE,OAAe,EAAE,UAAU,GAAE,OAAe,EAAE,UAAU,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,GAAG,eAAe;IAGxJ;;;;OAIG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM;IAU5D;;OAEG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAC3D;;OAEG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAKvC;;;;OAIG;IACI,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM;IAU3F;;;;OAIG;IACI,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM;IA2BtF;;OAEG;IACI,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAM5D;;OAEG;IACI,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAKtC,mDAAmD;IAC5C,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,OAAc,GAAG,IAAI;IAClE,yBAAyB;IAClB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAK1C,wBAAwB;IACjB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAKzC,wBAAwB;IACjB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAMzC,iHAAiH;IAC1G,gBAAgB,IAAI,IAAI;IAG/B;;;;;;;;OAQG;IACI,cAAc,CAAC,kBAAkB,GAAE,OAAc,GAAG,GAAG;IA6B9D;;;OAGG;IACH,4CAA4C;IAC5C,IAAoB,UAAU,IAAI,MAAM,CAAwC;IAChF,2CAA2C;IAC3C,IAAW,SAAS,IAAI,MAAM,CAAgC;IAC9D,4CAA4C;IAC5C,IAAW,UAAU,IAAI,MAAM,CAAiC;IAChE,4CAA4C;IAC5C,IAAW,UAAU,IAAI,MAAM,CAAiC;IAChE,gDAAgD;IAChD,IAAW,UAAU,IAAI,MAAM,CAAiC;IAChE,6CAA6C;IAC7C,IAAW,WAAW,IAAI,MAAM,CAAkC;IAClE,wDAAwD;IACjD,cAAc,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAKjD,8CAA8C;IACvC,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAChD,4EAA4E;IACrE,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IACzC,0EAA0E;IACnE,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IACzC,yCAAyC;IAClC,aAAa,CAAC,OAAO,GAAE,MAAU,GAAG,eAAe;IAC1D,wEAAwE;IACxD,KAAK,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IACvE,qDAAqD;IAC9C,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAE/D,0FAA0F;IACnF,uBAAuB,CAAC,UAAU,EAAE,MAAM,GAAG,aAAa;IAIjE;;;OAGG;IACI,cAAc,CAAC,aAAa,GAAE,MAAU,GAAG,OAAO;IAkCzD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,eAAgB,SAAQ,YAAY;IACnD,gDAAgD;IAChD,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;IACxC,0DAA0D;IAC1D,gBAAgB,IAAI,MAAM,CAAC;IAC3B,oCAAoC;IACpC,eAAe,IAAI,OAAO,CAAC;IAC3B,sFAAsF;IACtF,KAAK,IAAI,IAAI,CAAC;IACd,2EAA2E;IAC3E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,2EAA2E;IAC3E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,4EAA4E;IAC5E,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACrC,2EAA2E;IAC3E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,8EAA8E;IAC9E,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAClC,iCAAiC;IACjC,cAAc,IAAI,QAAQ,GAAG,SAAS,CAAC;IACvC,iEAAiE;IACjE,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,oGAAoG;IACpG,WAAW,IAAI,IAAI,CAAC;IACpB,6FAA6F;IAC7F,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1D;;OAEG;IACH,wBAAwB,CAAC,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1G"}
+{"version":3,"file":"Polyface.d.ts","sourceRoot":"","sources":["../../../src/polyface/Polyface.ts"],"names":[],"mappings":"AAKA;;GAEG;AAGH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAEvD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAGhE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;GAIG;AACH,8BAAsB,QAAS,SAAQ,aAAa;IAClD,wCAAwC;IACxC,SAAgB,gBAAgB,cAAc;IAE9C,gCAAgC;IACzB,IAAI,EAAE,YAAY,CAAC;IAC1B,SAAS,aAAa,IAAI,EAAE,YAAY;IAIxC,8DAA8D;aAC9C,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,eAAe;IAC/D,8EAA8E;IAC9E,IAAW,QAAQ,IACQ,OAAO,CADkB;IACpD,IAAW,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAiC;IACnE,qFAAqF;IACrF,IAAW,eAAe,IAAI,MAAM,CAAsC;IAC1E,IAAW,eAAe,CAAC,KAAK,EAAE,MAAM,EAAwC;IAChF;;;;;;;;;;SAUK;WACS,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,SAAS,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,SAAS,EAAE,UAAU,EAAE,MAAM,GAAG,OAAO;IAchK;;OAEG;IACH,aAAoB,OAAO,IAAI,OAAO,CAAC;IACvC;;OAEG;IACH,IAAW,UAAU,IAAI,MAAM,GAAG,SAAS,CAE1C;CACF;AACD;;;GAGG;AACH,qBAAa,eAAgB,SAAQ,QAAQ;IAC3C,wDAAwD;IACjD,mBAAmB,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAC/C,0DAA0D;IAC1C,aAAa,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAOlD;;OAEG;IACH,IAAW,OAAO,IAAI,OAAO,CAA4E;IACzG;;;;;;;OAOG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS;IAY/C,0CAA0C;IACnC,kBAAkB,CAAC,OAAO,EAAE,MAAM;IAGzC,2BAA2B;IACpB,KAAK,IAAI,eAAe;IAI/B,8DAA8D;IACvD,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,eAAe;IAK9D,sDAAsD;IAC/C,cAAc;IACrB,mDAAmD;IAC5C,cAAc;IACrB;;;;;OAKG;IACH,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;IAEhC;;;OAGG;IACH,SAAS,CAAC,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAErC,qIAAqI;IAC9H,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS;IAM3D;;;;;OAKG;IACH,SAAS,aAAa,IAAI,EAAE,YAAY,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,eAAe,CAAC,EAAE,MAAM,EAAE;IAa3F;;;;;OAKG;IACI,kBAAkB,CAAC,MAAM,EAAE,eAAe,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,GAAG,SAAS;IAsGtG;;;;;OAKG;IACH,IAAW,wBAAwB,IAAI,MAAM,CAAsE;IACnH;;;;OAIG;WACW,MAAM,CAAC,WAAW,GAAE,OAAe,EAAE,UAAU,GAAE,OAAe,EAAE,UAAU,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,GAAG,eAAe;IAGxJ;;;;OAIG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM;IAU5D;;OAEG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAC3D;;OAEG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAKvC;;;;OAIG;IACI,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM;IAU3F;;;;OAIG;IACI,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM;IA2BtF;;OAEG;IACI,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAM5D;;OAEG;IACI,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAKtC,mDAAmD;IAC5C,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,OAAc,GAAG,IAAI;IAClE,yBAAyB;IAClB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAK1C,wBAAwB;IACjB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAKzC,wBAAwB;IACjB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAMzC,iHAAiH;IAC1G,gBAAgB,IAAI,IAAI;IAG/B;;;;;;;;OAQG;IACI,cAAc,CAAC,kBAAkB,GAAE,OAAc,GAAG,GAAG;IA6B9D;;;OAGG;IACH,4CAA4C;IAC5C,IAAoB,UAAU,IAAI,MAAM,CAAwC;IAChF,2CAA2C;IAC3C,IAAW,SAAS,IAAI,MAAM,CAAgC;IAC9D,4CAA4C;IAC5C,IAAW,UAAU,IAAI,MAAM,CAAiC;IAChE,4CAA4C;IAC5C,IAAW,UAAU,IAAI,MAAM,CAAiC;IAChE,gDAAgD;IAChD,IAAW,UAAU,IAAI,MAAM,CAAiC;IAChE,6CAA6C;IAC7C,IAAW,WAAW,IAAI,MAAM,CAAkC;IAClE,wDAAwD;IACjD,cAAc,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAKjD,8CAA8C;IACvC,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAChD,4EAA4E;IACrE,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IACzC,0EAA0E;IACnE,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IACzC,yCAAyC;IAClC,aAAa,CAAC,OAAO,GAAE,MAAU,GAAG,eAAe;IAC1D,wEAAwE;IACxD,KAAK,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IACvE,qDAAqD;IAC9C,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAE/D,0FAA0F;IACnF,uBAAuB,CAAC,UAAU,EAAE,MAAM,GAAG,aAAa;IAIjE;;;OAGG;IACI,cAAc,CAAC,aAAa,GAAE,MAAU,GAAG,OAAO;IAkCzD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,eAAgB,SAAQ,YAAY;IACnD,gDAAgD;IAChD,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;IACxC,0DAA0D;IAC1D,gBAAgB,IAAI,MAAM,CAAC;IAC3B,oCAAoC;IACpC,eAAe,IAAI,OAAO,CAAC;IAC3B,sFAAsF;IACtF,KAAK,IAAI,IAAI,CAAC;IACd,2EAA2E;IAC3E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,2EAA2E;IAC3E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,4EAA4E;IAC5E,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACrC,2EAA2E;IAC3E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,8EAA8E;IAC9E,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAClC,iCAAiC;IACjC,cAAc,IAAI,QAAQ,GAAG,SAAS,CAAC;IACvC,iEAAiE;IACjE,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,oGAAoG;IACpG,WAAW,IAAI,IAAI,CAAC;IACpB,6FAA6F;IAC7F,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1D;;OAEG;IACH,wBAAwB,CAAC,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1G"}

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

@@ -1 +1 @@
-{"version":3,"file":"Polyface.js","sourceRoot":"","sources":["../../../src/polyface/Polyface.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,mEAAmE;AACnE,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;AAGzD,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;IAMlD,YAAsB,IAAkB;QACtC,KAAK,EAAE,CAAC;QANV,wCAAwC;QACxB,qBAAgB,GAAG,UAAU,CAAC;QAM5C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAGD,8EAA8E;IAC9E,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACpD,IAAW,QAAQ,CAAC,KAAc,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC;IACnE,qFAAqF;IACrF,IAAW,eAAe,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;IAC1E,IAAW,eAAe,CAAC,KAAa,IAAI,IAAI,CAAC,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC,CAAC,CAAC;IAChF;;;;;;;;;;SAUK;IACE,MAAM,CAAC,eAAe,CAAC,OAA6B,EAAE,cAAsB,EAAE,cAAsB,EAAE,IAAqB,EAAE,UAAkB;QACpJ,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAC7C,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI;YACnB,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,IAAI,OAAO,CAAC,MAAM;YACxD,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,GAAG,cAAc,IAAI,cAAc,GAAG,OAAO,CAAC,MAAM;YACpE,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;IAKD;;OAEG;IACH,IAAW,UAAU;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,eAAgB,SAAQ,QAAQ;IAC3C,wDAAwD;IACjD,mBAAmB,CAAC,KAAU,IAAa,OAAO,KAAK,YAAY,eAAe,CAAC,CAAC,CAAC;IAC5F,0DAA0D;IAC1C,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,eAAe,EAAE;YACpC,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC;gBACzG,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,gBAAgB,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;SAC3E;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;OAEG;IACH,IAAW,OAAO,KAAc,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;IACzG;;;;;;;OAOG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC3C,OAAO,KAAK,CAAC;QAEf,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;QACnD,IAAI,WAAW,GAAG,CAAC,EAAE;YACnB,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,IAAI,CAAC,cAAc,EAAE,CAAC;SACvB;QAED,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,MAAM,MAAM,GAAG,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;QAC/G,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,8DAA8D;IACvD,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,KAAK,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IACvE,mDAAmD;IAC5C,cAAc,KAAK,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAevD,qIAAqI;IAC9H,cAAc,CAAC,CAAS;QAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YACpC,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IACD;;;;;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;aACnC;YACH,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAC1B;QACD,IAAI,eAAe;YACjB,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC;;YAEhD,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;IAC/B,CAAC;IACD;;;;;OAKG;IACI,kBAAkB,CAAC,MAAuB,EAAE,QAAiB,EAAE,SAAgC;QACpG,MAAM,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC;QAE1C,mDAAmD;QACnD,uFAAuF;QACvF,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;YACjD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1D,IAAI,SAAS,EAAE;gBACb,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;aACpB;;gBACC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;SACtB;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE;YACxC,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;gBACZ,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,oEAAoE;oBAChG,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;iBACpH;aACF;iBAAM;gBACL,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;oBAC5B,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC9F;aACF;YACD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;SAC5B;QAED,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;YAC5G,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,EAAG,0DAA0D;gBACrG,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;oBACZ,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;iBACpE;qBAAM;oBACL,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;iBACpE;aACF;SACF;QAED,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;YAC/G,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;gBAClD,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;aAC9B;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,EAAG,0DAA0D;gBACrG,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;oBACZ,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;iBACvE;qBAAM;oBACL,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;iBACvE;aACF;SACF;QAED,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;YAC5G,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,EAAG,yDAAyD;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;oBACZ,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;iBACpE;qBAAM;oBACL,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;iBACpE;aACF;SACF;QAED,sCAAsC;QACtC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;YACjC,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YACjD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE;gBACnC,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;aACrC;YACD,KAAK,MAAM,cAAc,IAAI,MAAM,CAAC,gBAAgB,EAAE;gBACpD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,GAAG,cAAc,CAAC,CAAC;aACjE;SACF;IACH,CAAC;IAED;;;;;OAKG;IACH,IAAW,wBAAwB,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACnH;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,cAAuB,KAAK,EAAE,aAAsB,KAAK,EAAE,aAAsB,KAAK,EAAE,WAAoB,KAAK;QACpI,OAAO,IAAI,eAAe,CAAC,IAAI,YAAY,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD;;;;OAIG;IACI,QAAQ,CAAC,KAAc,EAAE,UAAmB;QACjD,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,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;SACrB;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;IAED;;OAEG;IACI,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,IAAY,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACpI;;OAEG;IACI,QAAQ,CAAC,KAAc;QAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC9D,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;;;;OAIG;IACI,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,WAAoB,EAAE,WAAoB;QAChF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC9D,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;IAED;;;;OAIG;IACI,SAAS,CAAC,MAAgB,EAAE,WAAoB,EAAE,WAAoB;QAC3E,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;YAClC,IAAI,QAAQ,CAAC;YAEb,IAAI,WAAW,KAAK,SAAS,EAAE;gBAC7B,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBACtE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBACpE,OAAO,WAAW,CAAC;aACtB;YACD,IAAI,WAAW,KAAK,SAAS,EAAE;gBAC7B,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBACtE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBACpE,OAAO,WAAW,CAAC;aACtB;YACD,mEAAmE;YACnE,0CAA0C;YAC1C,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE;gBAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC9C,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;gBACpE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBACpE,OAAO,SAAS,CAAC;aACpB;SACF;QAED,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACjE,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;IAED;;OAEG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAC3C,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,IAAU,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC7I,yBAAyB;IAClB,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,wBAAwB;IACjB,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,wBAAwB;IACjB,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;IAED,iHAAiH;IAC1G,gBAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC;IACD;;;;;;;;OAQG;IACI,cAAc,CAAC,qBAA8B,IAAI;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAE,uCAAuC;QACrF,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,6CAA6C;QAC1F,IAAI,kBAAkB,EAAE;YACtB,MAAM,QAAQ,GAAU,EAAE,CAAC;YAE3B,IAAI,OAAO,GAAG,OAAO,GAAG,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,mCAAmC,CAAC,CAAC;YACrD,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,OAAO;gBACnE,QAAQ,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;YACjE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,OAAO;gBACjE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;YAChE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,OAAO;gBACjE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;YAChE,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,OAAO;gBAC1C,QAAQ,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;YAElE,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,EAAE,OAAO,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;gBACtI,QAAQ,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC;YACxD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvB,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxB,OAAO,QAAQ,CAAC;aACjB;SACF;QACD,gDAAgD;QAChD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACH,4CAA4C;IAC5C,IAAoB,UAAU,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAChF,2CAA2C;IAC3C,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAC9D,4CAA4C;IAC5C,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAChE,4CAA4C;IAC5C,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAChE,gDAAgD;IAChD,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAChE,6CAA6C;IAC7C,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAClE,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,8CAA8C;IACvC,iBAAiB,CAAC,KAAa,IAAa,OAAO,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9G,4EAA4E;IACrE,WAAW,CAAC,KAAa,IAAY,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7E,0EAA0E;IACnE,WAAW,CAAC,KAAa,IAAY,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,yCAAyC;IAClC,aAAa,CAAC,UAAkB,CAAC,IAAqB,OAAO,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IACnH,wEAAwE;IACxD,KAAK,CAAC,SAAqB,EAAE,MAAgB,IAAa,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IACtH,qDAAqD;IAC9C,WAAW,CAAC,KAAc,EAAE,SAAqB,IAAU,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IAEtG,0FAA0F;IACnF,uBAAuB,CAAC,UAAkB;QAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;;OAGG;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;QAEf,IAAI,CAAC,KAAK,aAAa,EAAG,yDAAyD;YACjF,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,+EAA+E;QAE1H,MAAM,QAAQ,GAAG,aAAa,CAAC,UAAU,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAEvD,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,EAAG,0CAA0C;YACrF,OAAO,KAAK,CAAC;SACd;QAED,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;QAE1E,GAAG;YACD,IAAI,aAAa,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;gBAC9C,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;SAClD,QAAQ,OAAO,CAAC,eAAe,EAAE,IAAI,OAAO,CAAC,gBAAgB,EAAE,GAAG,aAAa,EAAE;QAElF,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;QAEjF,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;QAE5E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC7C,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/* eslint-disable @typescript-eslint/naming-convention, no-empty */\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 { 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\r\n  /** Underlying polyface data. */\r\n  public data: PolyfaceData;\r\n  protected constructor(data: PolyfaceData) {\r\n    super();\r\n    this.data = data;\r\n  }\r\n  /** create and return a visitor for this concrete polyface. */\r\n  public abstract createVisitor(_numWrap: number): PolyfaceVisitor;\r\n  /** Flag indicating if the mesh display must assume both sides are visible. */\r\n  public get twoSided() { return this.data.twoSided; }\r\n  public set twoSided(value: boolean) { this.data.twoSided = value; }\r\n  /** Flag indicating if the mesh closure is unknown (0), open sheet (1), closed (2) */\r\n  public get expectedClosure(): number { return this.data.expectedClosure; }\r\n  public set expectedClosure(value: number) { this.data.expectedClosure = value; }\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(indices: number[] | undefined, indexPositionA: number, indexPositionB: number, data: any | undefined, dataLength: number): boolean {\r\n    if (indices === undefined && data === undefined)\r\n      return true;\r\n    if (!indices || !data)\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  /**\r\n   * Returns true if this polyface has no facets.\r\n   */\r\n  public abstract get isEmpty(): boolean;\r\n  /**\r\n   * Returns the number of facets of this polyface. Subclasses should override.\r\n   */\r\n  public get facetCount(): number | undefined {\r\n    return undefined;\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, normal, param, and color indices.\r\n * @public\r\n */\r\nexport class IndexedPolyface extends Polyface {\r\n  /** Test if other is an instance of `IndexedPolyface` */\r\n  public isSameGeometryClass(other: any): boolean { return other instanceof IndexedPolyface; }\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) && NumberArray.isExactEqual(this._facetStart, other._facetStart) &&\r\n        NumberArray.isExactEqual(this._facetToFaceData, other._facetToFaceData);\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Returns true if either the point array or the point index array is empty.\r\n   */\r\n  public get isEmpty(): boolean { return this.data.pointCount === 0 || this.data.pointIndex.length === 0; }\r\n  /**\r\n   * * apply the transform to points\r\n   * * apply the (inverse transpose of) the matrix part to normals\r\n   * * If determinant is negative, also\r\n   *   * negate normals\r\n   *   * reverse index order around each facet.\r\n   * @param transform\r\n   */\r\n  public tryTransformInPlace(transform: Transform) {\r\n    if (!this.data.tryTransformInPlace(transform))\r\n      return false;\r\n\r\n    const determinant = transform.matrix.determinant();\r\n    if (determinant < 0) {\r\n      this.reverseIndices();\r\n      this.reverseNormals();\r\n    }\r\n\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    const result = new IndexedPolyface(this.data.clone(), this._facetStart.slice(), this._facetToFaceData.slice());\r\n    return result;\r\n  }\r\n  /** Return a deep clone with transformed points and normals */\r\n  public cloneTransformed(transform: Transform): IndexedPolyface {\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() { this.data.reverseIndices(this._facetStart); }\r\n  /** Reverse the direction of all normal vectors. */\r\n  public reverseNormals() { this.data.reverseNormals(); }\r\n  /**\r\n   * * index to the index array entries for a specific facet.\r\n   * * the facet count is facetStart.length - 1\r\n   * * facet [f] indices run from facetStart[f] to upper limit facetStart[f+1].\r\n   * * Note the array is initialized with one entry.\r\n   */\r\n  protected _facetStart: number[];\r\n\r\n  /**\r\n   * * For facet i, _facetToFaceData[i] is the index of the faceData entry for the facet.\r\n   * * _facetToFaceData has one entry per facet.\r\n   */\r\n  protected _facetToFaceData: number[];\r\n\r\n  /** return face data using a facet index. This is the REFERENCE to the FacetFaceData, not a copy. Returns undefined if none found. */\r\n  public tryGetFaceData(i: number): FacetFaceData | undefined {\r\n    const faceIndex = this._facetToFaceData[i];\r\n    if (faceIndex >= this.data.face.length)\r\n      return undefined;\r\n    return this.data.face[faceIndex];\r\n  }\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();\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();\r\n    else\r\n      this._facetToFaceData = [];\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 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\r\n    // Add point, point index, and edge visibility data\r\n    // Note: 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(startOfNewPoints + source.data.pointIndex[j], source.data.edgeVisible[j > i0 ? j - 1 : i1 - 1]);\r\n        }\r\n      } else {\r\n        for (let j = i0; j < i1; j++) {\r\n          this.addPointIndex(startOfNewPoints + source.data.pointIndex[j], source.data.edgeVisible[j]);\r\n        }\r\n      }\r\n      this.terminateFacet(false);\r\n    }\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\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\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\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 param 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 (point, normal, param, color) 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 { return this.data.pointIndex.length + this._facetStart.length - 1; }\r\n  /** Create an empty facet set, with coordinate and index data to be supplied later.\r\n   * @param needNormals true if normals will be constructed\r\n   * @param needParams true if uv parameters will be constructed\r\n   * @param needColors true if colors will e constructed.\r\n   */\r\n  public static create(needNormals: boolean = false, needParams: boolean = false, needColors: boolean = false, twoSided: boolean = false): IndexedPolyface {\r\n    return new IndexedPolyface(new PolyfaceData(needNormals, needParams, needColors, twoSided));\r\n  }\r\n  /** add (a clone of ) a point. return its 0 based index.\r\n   * @param point point coordinates\r\n   * @param priorIndex optional index of prior point to check for repeated coordinates\r\n   * @returns Returns the zero-based index of the added or reused 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.\r\n   * @returns Returns the zero-based index of the added point.\r\n   */\r\n  public addPointXYZ(x: number, y: number, z: number): number { this.data.point.pushXYZ(x, y, z); return this.data.point.length - 1; }\r\n  /** Add a uv param.\r\n   * @returns 0-based index of the added param.\r\n   */\r\n  public addParam(param: Point2d): number {\r\n    if (!this.data.param) this.data.param = new GrowableXYArray();\r\n    this.data.param.push(param);\r\n    return this.data.param.length - 1;\r\n  }\r\n  /** Add a uv parameter to the parameter array.\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 0-based index of the added or reused param.\r\n   */\r\n  public addParamUV(u: number, v: number, priorIndexA?: number, priorIndexB?: number): number {\r\n    if (!this.data.param) 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 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 0-based index of the added or reused normal.\r\n   */\r\n  public addNormal(normal: Vector3d, priorIndexA?: number, priorIndexB?: number): number {\r\n    if (this.data.normal !== undefined) {\r\n      let distance;\r\n\r\n      if (priorIndexA !== undefined) {\r\n        distance = this.data.normal.distanceIndexToPoint(priorIndexA, normal);\r\n        if (distance !== undefined && Geometry.isSmallMetricDistance(distance))\r\n          return priorIndexA;\r\n      }\r\n      if (priorIndexB !== undefined) {\r\n        distance = this.data.normal.distanceIndexToPoint(priorIndexB, normal);\r\n        if (distance !== undefined && Geometry.isSmallMetricDistance(distance))\r\n          return priorIndexB;\r\n      }\r\n      // Note: Do NOT attempt to chain to tail if no prior indices given.\r\n      // But if they are, look also to the tail.\r\n      if (priorIndexA !== undefined || priorIndexB !== undefined) {\r\n        const tailIndex = this.data.normal.length - 1;\r\n        distance = this.data.normal.distanceIndexToPoint(tailIndex, normal);\r\n        if (distance !== undefined && Geometry.isSmallMetricDistance(distance))\r\n          return tailIndex;\r\n      }\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 given by direct coordinates\r\n   * @returns 0-based index of the added or reused param.\r\n   */\r\n  public addNormalXYZ(x: number, y: number, z: number): number {\r\n    if (!this.data.normal) 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\r\n   * @returns 0-based index of the added or reused color.\r\n   */\r\n  public addColor(color: number): number {\r\n    if (!this.data.color) 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 { this.data.pointIndex.push(index); this.data.edgeVisible.push(visible); }\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.  return the returnValue (so caller can easily return cleanupOpenFacet(\"message\")) */\r\n  public cleanupOpenFacet(): void {\r\n    this.data.trimAllIndexArrays(this.data.pointIndex.length);\r\n  }\r\n  /** announce the end of construction of a facet.\r\n   *\r\n   * * The \"open\" facet is checked for:\r\n   *\r\n   * **  Same number of indices among all active index arrays --  point, normal, param, color\r\n   * **  All indices 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   * *  \"undefined\" return is normal.   Any other return is a description of an error.\r\n   */\r\n  public terminateFacet(validateAllIndices: boolean = true): any {\r\n    const numFacets = this._facetStart.length - 1;\r\n    const lengthA = this._facetStart[numFacets];  // number of indices in accepted facets\r\n    const lengthB = this.data.pointIndex.length; // number of indices including the open facet\r\n    if (validateAllIndices) {\r\n      const messages: any[] = [];\r\n\r\n      if (lengthB < lengthA + 2)\r\n        messages.push(\"Less than 3 indices in open facet\");\r\n      if (this.data.normalIndex && this.data.normalIndex.length !== lengthB)\r\n        messages.push(\"normalIndex count must match pointIndex count\");\r\n      if (this.data.paramIndex && this.data.paramIndex.length !== lengthB)\r\n        messages.push(\"paramIndex count must equal pointIndex count\");\r\n      if (this.data.colorIndex && this.data.colorIndex.length !== lengthB)\r\n        messages.push(\"colorIndex count must equal pointIndex count\");\r\n      if (this.data.edgeVisible.length !== lengthB)\r\n        messages.push(\"visibleIndex count must equal pointIndex count\");\r\n\r\n      if (!Polyface.areIndicesValid(this.data.normalIndex, lengthA, lengthB, this.data.normal, this.data.normal ? this.data.normal.length : 0))\r\n        messages.push(\"invalid normal indices in open facet\");\r\n      if (messages.length > 0) {\r\n        this.cleanupOpenFacet();\r\n        return messages;\r\n      }\r\n    }\r\n    // appending to facetStart accepts the facet !!!\r\n    this._facetStart.push(lengthB);\r\n    return undefined;\r\n  }\r\n  /**\r\n   * All terminated facets added since the declaration of the previous face\r\n   * will be grouped into a new face with their own 2D range.\r\n   */\r\n  /** (read-only property) number of facets */\r\n  public override get facetCount(): number { return this._facetStart.length - 1; }\r\n  /** (read-only property) number of faces */\r\n  public get faceCount(): number { return this.data.faceCount; }\r\n  /** (read-only property) number of points */\r\n  public get pointCount(): number { return this.data.pointCount; }\r\n  /** (read-only property) number of colors */\r\n  public get colorCount(): number { return this.data.colorCount; }\r\n  /** (read-only property) number of parameters */\r\n  public get paramCount(): number { return this.data.paramCount; }\r\n  /** (read-only property) number of normals */\r\n  public get normalCount(): number { return this.data.normalCount; }\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  /** test if `index` is a valid facet index. */\r\n  public isValidFacetIndex(index: number): boolean { return index >= 0 && index + 1 < this._facetStart.length; }\r\n  /** ASSUME valid facet index . .. return its start index in index arrays. */\r\n  public facetIndex0(index: number): number { return this._facetStart[index]; }\r\n  /** ASSUME valid facet index . .. return its end index in index arrays. */\r\n  public facetIndex1(index: number): number { return this._facetStart[index + 1]; }\r\n  /** create a visitor for this polyface */\r\n  public createVisitor(numWrap: number = 0): PolyfaceVisitor { return IndexedPolyfaceVisitor.create(this, numWrap); }\r\n  /** Return the range of (optionally transformed) points in this mesh. */\r\n  public override range(transform?: Transform, result?: Range3d): Range3d { return this.data.range(result, transform); }\r\n  /** Extend `range` with coordinates from this mesh */\r\n  public extendRange(range: Range3d, transform?: Transform): void { this.data.range(range, transform); }\r\n\r\n  /** Given the index of a facet, return the data pertaining to the face it is a part of. */\r\n  public getFaceDataByFacetIndex(facetIndex: number): FacetFaceData {\r\n    return this.data.face[this._facetToFaceData[facetIndex]];\r\n  }\r\n\r\n  /**\r\n   * All terminated facets since the last face declaration will be mapped to a single new FacetFaceData object\r\n   * using 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\r\n    if (0 === endFacetIndex)  // The default for endFacetIndex is really the last facet\r\n      endFacetIndex = this._facetStart.length; // Last facetStart index corresponds to the next facet if we were to create one\r\n\r\n    const faceData = FacetFaceData.createNull();\r\n    const visitor = IndexedPolyfaceVisitor.create(this, 0);\r\n\r\n    if (!visitor.moveToReadIndex(facetStart)) {  // Move visitor to first facet of new face\r\n      return false;\r\n    }\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\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\r\n    if (paramDefined && !(this.data.param!.length === 0) && faceData.paramDistanceRange.isNull)\r\n      faceData.setParamDistanceRangeFromNewFaceData(this, facetStart, endFacetIndex);\r\n\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\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}\r\n\r\n/**\r\n * A PolyfaceVisitor manages data while walking through facets.\r\n *\r\n * * The polyface visitor holds data for one facet at a time.\r\n * * The caller can request the position in the addressed facets as a \"readIndex.\"\r\n * * The readIndex value (as a number) is not promised to be sequential. (I.e. it might be a simple facet count or might be\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 readIndex of the currently loaded facet */\r\n  currentReadIndex(): number;\r\n  /** Load data for the next facet. */\r\n  moveToNextFacet(): boolean;\r\n  /** Reset to initial state for reading all facets sequentially with moveToNextFacet */\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  /** Set the number of vertices to replicate in visitor arrays. */\r\n  setNumWrap(numWrap: number): void;\r\n  /** clear the contents of all 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  /** 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\r\n"]}
+{"version":3,"file":"Polyface.js","sourceRoot":"","sources":["../../../src/polyface/Polyface.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,mEAAmE;AACnE,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;AAGzD,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;IAMlD,YAAsB,IAAkB;QACtC,KAAK,EAAE,CAAC;QANV,wCAAwC;QACxB,qBAAgB,GAAG,UAAU,CAAC;QAM5C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAGD,8EAA8E;IAC9E,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACpD,IAAW,QAAQ,CAAC,KAAc,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC;IACnE,qFAAqF;IACrF,IAAW,eAAe,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;IAC1E,IAAW,eAAe,CAAC,KAAa,IAAI,IAAI,CAAC,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC,CAAC,CAAC;IAChF;;;;;;;;;;SAUK;IACE,MAAM,CAAC,eAAe,CAAC,OAA6B,EAAE,cAAsB,EAAE,cAAsB,EAAE,IAAqB,EAAE,UAAkB;QACpJ,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAC7C,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI;YACnB,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,IAAI,OAAO,CAAC,MAAM;YACxD,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,GAAG,cAAc,IAAI,cAAc,GAAG,OAAO,CAAC,MAAM;YACpE,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;IAKD;;OAEG;IACH,IAAW,UAAU;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,eAAgB,SAAQ,QAAQ;IAC3C,wDAAwD;IACjD,mBAAmB,CAAC,KAAU,IAAa,OAAO,KAAK,YAAY,eAAe,CAAC,CAAC,CAAC;IAC5F,0DAA0D;IAC1C,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,eAAe,EAAE;YACpC,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC;gBACzG,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,gBAAgB,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;SAC3E;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;OAEG;IACH,IAAW,OAAO,KAAc,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;IACzG;;;;;;;OAOG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC3C,OAAO,KAAK,CAAC;QAEf,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;QACnD,IAAI,WAAW,GAAG,CAAC,EAAE;YACnB,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,IAAI,CAAC,cAAc,EAAE,CAAC;SACvB;QAED,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,MAAM,MAAM,GAAG,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;QAC/G,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,8DAA8D;IACvD,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,KAAK,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IACvE,mDAAmD;IAC5C,cAAc,KAAK,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAevD,qIAAqI;IAC9H,cAAc,CAAC,CAAS;QAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YACpC,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IACD;;;;;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;aACnC;YACH,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAC1B;QACD,IAAI,eAAe;YACjB,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC;;YAEhD,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;IAC/B,CAAC;IACD;;;;;OAKG;IACI,kBAAkB,CAAC,MAAuB,EAAE,QAAiB,EAAE,SAAgC;QACpG,MAAM,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC;QAE1C,mDAAmD;QACnD,uFAAuF;QACvF,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;YACjD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1D,IAAI,SAAS,EAAE;gBACb,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;aACpB;;gBACC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;SACtB;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE;YACxC,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;gBACZ,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,oEAAoE;oBAChG,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;iBACpH;aACF;iBAAM;gBACL,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;oBAC5B,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC9F;aACF;YACD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;SAC5B;QAED,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;YAC5G,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,EAAG,0DAA0D;gBACrG,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;oBACZ,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;iBACpE;qBAAM;oBACL,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;iBACpE;aACF;SACF;QAED,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;YAC/G,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;gBAClD,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;aAC9B;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,EAAG,0DAA0D;gBACrG,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;oBACZ,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;iBACvE;qBAAM;oBACL,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;iBACvE;aACF;SACF;QAED,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;YAC5G,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,EAAG,yDAAyD;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;oBACZ,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;iBACpE;qBAAM;oBACL,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;iBACpE;aACF;SACF;QAED,sCAAsC;QACtC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;YACjC,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YACjD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE;gBACnC,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;aACrC;YACD,KAAK,MAAM,cAAc,IAAI,MAAM,CAAC,gBAAgB,EAAE;gBACpD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,GAAG,cAAc,CAAC,CAAC;aACjE;SACF;IACH,CAAC;IAED;;;;;OAKG;IACH,IAAW,wBAAwB,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACnH;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,cAAuB,KAAK,EAAE,aAAsB,KAAK,EAAE,aAAsB,KAAK,EAAE,WAAoB,KAAK;QACpI,OAAO,IAAI,eAAe,CAAC,IAAI,YAAY,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD;;;;OAIG;IACI,QAAQ,CAAC,KAAc,EAAE,UAAmB;QACjD,IAAI,UAAU,KAAK,SAAS,EAAE;YAC5B,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;SACrB;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;IAED;;OAEG;IACI,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,IAAY,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACpI;;OAEG;IACI,QAAQ,CAAC,KAAc;QAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC9D,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;;;;OAIG;IACI,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,WAAoB,EAAE,WAAoB;QAChF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC9D,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;IAED;;;;OAIG;IACI,SAAS,CAAC,MAAgB,EAAE,WAAoB,EAAE,WAAoB;QAC3E,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;YAClC,IAAI,QAAQ,CAAC;YAEb,IAAI,WAAW,KAAK,SAAS,EAAE;gBAC7B,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBACtE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBACpE,OAAO,WAAW,CAAC;aACtB;YACD,IAAI,WAAW,KAAK,SAAS,EAAE;gBAC7B,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBACtE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBACpE,OAAO,WAAW,CAAC;aACtB;YACD,mEAAmE;YACnE,0CAA0C;YAC1C,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE;gBAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC9C,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;gBACpE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBACpE,OAAO,SAAS,CAAC;aACpB;SACF;QAED,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACjE,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;IAED;;OAEG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAC3C,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,IAAU,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC7I,yBAAyB;IAClB,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,wBAAwB;IACjB,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,wBAAwB;IACjB,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;IAED,iHAAiH;IAC1G,gBAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC;IACD;;;;;;;;OAQG;IACI,cAAc,CAAC,qBAA8B,IAAI;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAE,uCAAuC;QACrF,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,6CAA6C;QAC1F,IAAI,kBAAkB,EAAE;YACtB,MAAM,QAAQ,GAAU,EAAE,CAAC;YAE3B,IAAI,OAAO,GAAG,OAAO,GAAG,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,mCAAmC,CAAC,CAAC;YACrD,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,OAAO;gBACnE,QAAQ,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;YACjE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,OAAO;gBACjE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;YAChE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,OAAO;gBACjE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;YAChE,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,OAAO;gBAC1C,QAAQ,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;YAElE,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,OAAO,EAAE,OAAO,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;gBACtI,QAAQ,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC;YACxD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;gBACvB,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxB,OAAO,QAAQ,CAAC;aACjB;SACF;QACD,gDAAgD;QAChD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACH,4CAA4C;IAC5C,IAAoB,UAAU,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAChF,2CAA2C;IAC3C,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAC9D,4CAA4C;IAC5C,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAChE,4CAA4C;IAC5C,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAChE,gDAAgD;IAChD,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAChE,6CAA6C;IAC7C,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAClE,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,8CAA8C;IACvC,iBAAiB,CAAC,KAAa,IAAa,OAAO,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9G,4EAA4E;IACrE,WAAW,CAAC,KAAa,IAAY,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7E,0EAA0E;IACnE,WAAW,CAAC,KAAa,IAAY,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACjF,yCAAyC;IAClC,aAAa,CAAC,UAAkB,CAAC,IAAqB,OAAO,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IACnH,wEAAwE;IACxD,KAAK,CAAC,SAAqB,EAAE,MAAgB,IAAa,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IACtH,qDAAqD;IAC9C,WAAW,CAAC,KAAc,EAAE,SAAqB,IAAU,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;IAEtG,0FAA0F;IACnF,uBAAuB,CAAC,UAAkB;QAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;;OAGG;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;QAEf,IAAI,CAAC,KAAK,aAAa,EAAG,yDAAyD;YACjF,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,+EAA+E;QAE1H,MAAM,QAAQ,GAAG,aAAa,CAAC,UAAU,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAEvD,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,EAAG,0CAA0C;YACrF,OAAO,KAAK,CAAC;SACd;QAED,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;QAE1E,GAAG;YACD,IAAI,aAAa,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;gBAC9C,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;SAClD,QAAQ,OAAO,CAAC,eAAe,EAAE,IAAI,OAAO,CAAC,gBAAgB,EAAE,GAAG,aAAa,EAAE;QAElF,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;QAEjF,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;QAE5E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC7C,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/* eslint-disable @typescript-eslint/naming-convention, no-empty */\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 { 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\n  /** Underlying polyface data. */\n  public data: PolyfaceData;\n  protected constructor(data: PolyfaceData) {\n    super();\n    this.data = data;\n  }\n  /** create and return a visitor for this concrete polyface. */\n  public abstract createVisitor(numWrap: number): PolyfaceVisitor;\n  /** Flag indicating if the mesh display must assume both sides are visible. */\n  public get twoSided() { return this.data.twoSided; }\n  public set twoSided(value: boolean) { this.data.twoSided = value; }\n  /** Flag indicating if the mesh closure is unknown (0), open sheet (1), closed (2) */\n  public get expectedClosure(): number { return this.data.expectedClosure; }\n  public set expectedClosure(value: number) { this.data.expectedClosure = value; }\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(indices: number[] | undefined, indexPositionA: number, indexPositionB: number, data: any | undefined, dataLength: number): boolean {\n    if (indices === undefined && data === undefined)\n      return true;\n    if (!indices || !data)\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  /**\n   * Returns true if this polyface has no facets.\n   */\n  public abstract get isEmpty(): boolean;\n  /**\n   * Returns the number of facets of this polyface. Subclasses should override.\n   */\n  public get facetCount(): number | undefined {\n    return undefined;\n  }\n}\n/**\n * An `IndexedPolyface` is a set of facets which can have normal, param, and color arrays with independent point, normal, param, and color indices.\n * @public\n */\nexport class IndexedPolyface extends Polyface {\n  /** Test if other is an instance of `IndexedPolyface` */\n  public isSameGeometryClass(other: any): boolean { return other instanceof IndexedPolyface; }\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) && NumberArray.isExactEqual(this._facetStart, other._facetStart) &&\n        NumberArray.isExactEqual(this._facetToFaceData, other._facetToFaceData);\n    }\n    return false;\n  }\n  /**\n   * Returns true if either the point array or the point index array is empty.\n   */\n  public get isEmpty(): boolean { return this.data.pointCount === 0 || this.data.pointIndex.length === 0; }\n  /**\n   * * apply the transform to points\n   * * apply the (inverse transpose of) the matrix part to normals\n   * * If determinant is negative, also\n   *   * negate normals\n   *   * reverse index order around each facet.\n   * @param transform\n   */\n  public tryTransformInPlace(transform: Transform) {\n    if (!this.data.tryTransformInPlace(transform))\n      return false;\n\n    const determinant = transform.matrix.determinant();\n    if (determinant < 0) {\n      this.reverseIndices();\n      this.reverseNormals();\n    }\n\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    const result = new IndexedPolyface(this.data.clone(), this._facetStart.slice(), this._facetToFaceData.slice());\n    return result;\n  }\n  /** Return a deep clone with transformed points and normals */\n  public cloneTransformed(transform: Transform): IndexedPolyface {\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() { this.data.reverseIndices(this._facetStart); }\n  /** Reverse the direction of all normal vectors. */\n  public reverseNormals() { this.data.reverseNormals(); }\n  /**\n   * * index to the index array entries for a specific facet.\n   * * the facet count is facetStart.length - 1\n   * * facet [f] indices run from facetStart[f] to upper limit facetStart[f+1].\n   * * Note the array is initialized with one entry.\n   */\n  protected _facetStart: number[];\n\n  /**\n   * * For facet i, _facetToFaceData[i] is the index of the faceData entry for the facet.\n   * * _facetToFaceData has one entry per facet.\n   */\n  protected _facetToFaceData: number[];\n\n  /** return face data using a facet index. This is the REFERENCE to the FacetFaceData, not a copy. Returns undefined if none found. */\n  public tryGetFaceData(i: number): FacetFaceData | undefined {\n    const faceIndex = this._facetToFaceData[i];\n    if (faceIndex >= this.data.face.length)\n      return undefined;\n    return this.data.face[faceIndex];\n  }\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();\n    else {\n      this._facetStart = [];\n      this._facetStart.push(0);\n    }\n    if (facetToFaceData)\n      this._facetToFaceData = facetToFaceData.slice();\n    else\n      this._facetToFaceData = [];\n  }\n  /**\n   * * Add facets from source to this polyface.\n   * * Optionally reverse facet indices as per PolyfaceData.reverseIndicesSingleFacet() with preserveStart = false, and 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\n    // Add point, point index, and edge visibility data\n    // Note: 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(startOfNewPoints + source.data.pointIndex[j], source.data.edgeVisible[j > i0 ? j - 1 : i1 - 1]);\n        }\n      } else {\n        for (let j = i0; j < i1; j++) {\n          this.addPointIndex(startOfNewPoints + source.data.pointIndex[j], source.data.edgeVisible[j]);\n        }\n      }\n      this.terminateFacet(false);\n    }\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\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\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\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 param 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 (point, normal, param, color) have the same counts, so there\n   * is not a separate query for each of them.\n   */\n  public get zeroTerminatedIndexCount(): number { return this.data.pointIndex.length + this._facetStart.length - 1; }\n  /** Create an empty facet set, with coordinate and index data to be supplied later.\n   * @param needNormals true if normals will be constructed\n   * @param needParams true if uv parameters will be constructed\n   * @param needColors true if colors will e constructed.\n   */\n  public static create(needNormals: boolean = false, needParams: boolean = false, needColors: boolean = false, twoSided: boolean = false): IndexedPolyface {\n    return new IndexedPolyface(new PolyfaceData(needNormals, needParams, needColors, twoSided));\n  }\n  /** add (a clone of ) a point. return its 0 based index.\n   * @param point point coordinates\n   * @param priorIndex optional index of prior point to check for repeated coordinates\n   * @returns Returns the zero-based index of the added or reused 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.\n   * @returns Returns the zero-based index of the added point.\n   */\n  public addPointXYZ(x: number, y: number, z: number): number { this.data.point.pushXYZ(x, y, z); return this.data.point.length - 1; }\n  /** Add a uv param.\n   * @returns 0-based index of the added param.\n   */\n  public addParam(param: Point2d): number {\n    if (!this.data.param) this.data.param = new GrowableXYArray();\n    this.data.param.push(param);\n    return this.data.param.length - 1;\n  }\n  /** Add a uv parameter to the parameter array.\n   * @param priorIndexA first index to check for possible duplicate value.\n   * @param priorIndexB second index to check for possible duplicate value.\n   * @returns 0-based index of the added or reused param.\n   */\n  public addParamUV(u: number, v: number, priorIndexA?: number, priorIndexB?: number): number {\n    if (!this.data.param) 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 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 0-based index of the added or reused normal.\n   */\n  public addNormal(normal: Vector3d, priorIndexA?: number, priorIndexB?: number): number {\n    if (this.data.normal !== undefined) {\n      let distance;\n\n      if (priorIndexA !== undefined) {\n        distance = this.data.normal.distanceIndexToPoint(priorIndexA, normal);\n        if (distance !== undefined && Geometry.isSmallMetricDistance(distance))\n          return priorIndexA;\n      }\n      if (priorIndexB !== undefined) {\n        distance = this.data.normal.distanceIndexToPoint(priorIndexB, normal);\n        if (distance !== undefined && Geometry.isSmallMetricDistance(distance))\n          return priorIndexB;\n      }\n      // Note: Do NOT attempt to chain to tail if no prior indices given.\n      // But if they are, look also to the tail.\n      if (priorIndexA !== undefined || priorIndexB !== undefined) {\n        const tailIndex = this.data.normal.length - 1;\n        distance = this.data.normal.distanceIndexToPoint(tailIndex, normal);\n        if (distance !== undefined && Geometry.isSmallMetricDistance(distance))\n          return tailIndex;\n      }\n    }\n\n    return this.addNormalXYZ(normal.x, normal.y, normal.z);\n  }\n\n  /** Add a normal vector given by direct coordinates\n   * @returns 0-based index of the added or reused param.\n   */\n  public addNormalXYZ(x: number, y: number, z: number): number {\n    if (!this.data.normal) 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\n   * @returns 0-based index of the added or reused color.\n   */\n  public addColor(color: number): number {\n    if (!this.data.color) 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 { this.data.pointIndex.push(index); this.data.edgeVisible.push(visible); }\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.  return the returnValue (so caller can easily return cleanupOpenFacet(\"message\")) */\n  public cleanupOpenFacet(): void {\n    this.data.trimAllIndexArrays(this.data.pointIndex.length);\n  }\n  /** announce the end of construction of a facet.\n   *\n   * * The \"open\" facet is checked for:\n   *\n   * **  Same number of indices among all active index arrays --  point, normal, param, color\n   * **  All indices 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   * *  \"undefined\" return is normal.   Any other return is a description of an error.\n   */\n  public terminateFacet(validateAllIndices: boolean = true): any {\n    const numFacets = this._facetStart.length - 1;\n    const lengthA = this._facetStart[numFacets];  // number of indices in accepted facets\n    const lengthB = this.data.pointIndex.length; // number of indices including the open facet\n    if (validateAllIndices) {\n      const messages: any[] = [];\n\n      if (lengthB < lengthA + 2)\n        messages.push(\"Less than 3 indices in open facet\");\n      if (this.data.normalIndex && this.data.normalIndex.length !== lengthB)\n        messages.push(\"normalIndex count must match pointIndex count\");\n      if (this.data.paramIndex && this.data.paramIndex.length !== lengthB)\n        messages.push(\"paramIndex count must equal pointIndex count\");\n      if (this.data.colorIndex && this.data.colorIndex.length !== lengthB)\n        messages.push(\"colorIndex count must equal pointIndex count\");\n      if (this.data.edgeVisible.length !== lengthB)\n        messages.push(\"visibleIndex count must equal pointIndex count\");\n\n      if (!Polyface.areIndicesValid(this.data.normalIndex, lengthA, lengthB, this.data.normal, this.data.normal ? this.data.normal.length : 0))\n        messages.push(\"invalid normal indices in open facet\");\n      if (messages.length > 0) {\n        this.cleanupOpenFacet();\n        return messages;\n      }\n    }\n    // appending to facetStart accepts the facet !!!\n    this._facetStart.push(lengthB);\n    return undefined;\n  }\n  /**\n   * All terminated facets added since the declaration of the previous face\n   * will be grouped into a new face with their own 2D range.\n   */\n  /** (read-only property) number of facets */\n  public override get facetCount(): number { return this._facetStart.length - 1; }\n  /** (read-only property) number of faces */\n  public get faceCount(): number { return this.data.faceCount; }\n  /** (read-only property) number of points */\n  public get pointCount(): number { return this.data.pointCount; }\n  /** (read-only property) number of colors */\n  public get colorCount(): number { return this.data.colorCount; }\n  /** (read-only property) number of parameters */\n  public get paramCount(): number { return this.data.paramCount; }\n  /** (read-only property) number of normals */\n  public get normalCount(): number { return this.data.normalCount; }\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  /** test if `index` is a valid facet index. */\n  public isValidFacetIndex(index: number): boolean { return index >= 0 && index + 1 < this._facetStart.length; }\n  /** ASSUME valid facet index . .. return its start index in index arrays. */\n  public facetIndex0(index: number): number { return this._facetStart[index]; }\n  /** ASSUME valid facet index . .. return its end index in index arrays. */\n  public facetIndex1(index: number): number { return this._facetStart[index + 1]; }\n  /** create a visitor for this polyface */\n  public createVisitor(numWrap: number = 0): PolyfaceVisitor { return IndexedPolyfaceVisitor.create(this, numWrap); }\n  /** Return the range of (optionally transformed) points in this mesh. */\n  public override range(transform?: Transform, result?: Range3d): Range3d { return this.data.range(result, transform); }\n  /** Extend `range` with coordinates from this mesh */\n  public extendRange(range: Range3d, transform?: Transform): void { this.data.range(range, transform); }\n\n  /** Given the index of a facet, return the data pertaining to the face it is a part of. */\n  public getFaceDataByFacetIndex(facetIndex: number): FacetFaceData {\n    return this.data.face[this._facetToFaceData[facetIndex]];\n  }\n\n  /**\n   * All terminated facets since the last face declaration will be mapped to a single new FacetFaceData object\n   * using 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\n    if (0 === endFacetIndex)  // The default for endFacetIndex is really the last facet\n      endFacetIndex = this._facetStart.length; // Last facetStart index corresponds to the next facet if we were to create one\n\n    const faceData = FacetFaceData.createNull();\n    const visitor = IndexedPolyfaceVisitor.create(this, 0);\n\n    if (!visitor.moveToReadIndex(facetStart)) {  // Move visitor to first facet of new face\n      return false;\n    }\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\n    do {\n      if (setParamRange && visitor.param !== undefined)\n        visitor.param.extendRange(faceData.paramRange);\n    } while (visitor.moveToNextFacet() && visitor.currentReadIndex() < endFacetIndex);\n\n    if (paramDefined && !(this.data.param!.length === 0) && faceData.paramDistanceRange.isNull)\n      faceData.setParamDistanceRangeFromNewFaceData(this, facetStart, endFacetIndex);\n\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\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}\n\n/**\n * A PolyfaceVisitor manages data while walking through facets.\n *\n * * The polyface visitor holds data for one facet at a time.\n * * The caller can request the position in the addressed facets as a \"readIndex.\"\n * * The readIndex value (as a number) is not promised to be sequential. (I.e. it might be a simple facet count or might be\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 readIndex of the currently loaded facet */\n  currentReadIndex(): number;\n  /** Load data for the next facet. */\n  moveToNextFacet(): boolean;\n  /** Reset to initial state for reading all facets sequentially with moveToNextFacet */\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  /** Set the number of vertices to replicate in visitor arrays. */\n  setNumWrap(numWrap: number): void;\n  /** clear the contents of all 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  /** 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\n"]}