@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

package/lib/topology/HalfEdgeGraphSpineContext.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgeGraphSpineContext.js","sourceRoot":"","sources":["../../src/topology/HalfEdgeGraphSpineContext.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,0CAAuC;AACvC,mCAAgE;AAChE,mEAAkE;AAClE,uCAA+C;AAC/C,mDAA+C;AAC/C,qDAAyD;AACzD,+DAAgF;AAChF,+CAA4C;AAC5C,iBAAiB;AACjB,+BAA+B;AAC/B,iCAAiC;AACjC,qCAAqC;AAErC,SAAS,aAAa,CAAC,CAAS;IAC9B,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACxB,MAAM,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvC,OAAO,MAAM,CAAC;AAChB,CAAC;AACD,SAAS,cAAc,CAAC,CAAS;IAC/B,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACxB,MAAM,CAAC,IAAI,CAAC,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxC,OAAO,MAAM,CAAC;AAChB,CAAC;AACD,8EAA8E;AAC9E,MAAM,WAAW;IAKf,YAAmB,IAAc,EAAE,CAAS;QAC1C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;IACd,CAAC;IALD,IAAW,IAAI,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAMjC,MAAM,CAAC,cAAc,CAAC,KAAkB,EAAE,KAAkB,IAAY,OAAO,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;CAC7G;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAa,yBAAyB;IAOpC;;;OAGG;IACH;QACE,IAAI,CAAC,WAAW,GAAG,IAAI,qBAAa,EAAE,CAAC;QACvC,iEAAiE;QACjE,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;QACjD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;IAC9C,CAAC;IAVD,IAAW,KAAK,KAAK,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAY/C;;OAEG;IACI,QAAQ;QACb,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC9C,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,CAAC;IAClC,CAAC;IAED,kEAAkE;IAC1D,OAAO,CAAC,MAAmB,EAAE,IAAa,EAAE,IAAa;QAC/D,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxB,CAAC;IAEO,aAAa,CAAC,YAAsB,EAC1C,KAAiB,EACjB,MAAiB;QACjB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;QAC3C,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACjB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,oBAAY,CAAC,aAAa,CAAC;eAChD,YAAY,CAAC,oBAAoB,EAAE,KAAK,CAAC;eACzC,YAAY,CAAC,oBAAoB,EAAE,KAAK,CAAC,EAAE;YAC9C,MAAM,KAAK,GAAG,YAAY,CAAC,aAAa,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,YAAY,CAAC,aAAa,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBACxB,MAAM,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,iCAAiC;IACjC,oEAAoE;IACpE,gCAAgC;IACxB,eAAe,CAAC,aAAuB;QAE7C,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE;YACpD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAE1C,MAAM,QAAQ,GAAG,0BAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,0BAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,0BAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,0BAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAErD,MAAM,YAAY,GAAG,0BAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,MAAM,YAAY,GAAG,0BAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,YAAY,CAAC,CAAC,GAAG,GAAG,CAAC;YACrB,YAAY,CAAC,CAAC,GAAG,GAAG,CAAC;YACrB,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YACxE,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YACxE,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YACxE,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YAExE,MAAM,KAAK,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YACpD,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YACnD,OAAO,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;SACpC;QAED,OAAO,MAAM,CAAC,iBAAiB,CAAC;IAClC,CAAC;IAED,uCAAuC;IACvC,4FAA4F;IACpF,2BAA2B,CAAC,IAAe;QAEjD,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAK,0BAA0B;QAC/D,MAAM,iBAAiB,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAG,sEAAsE;QACpH,mBAAmB;QACnB,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7B;QACD,QAAQ,CAAC,YAAY,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAEjC,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,UAAU,CAAC,CAAC,CAAC,GAAG,0BAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAI,iBAAiB;YACjF,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;SACnC;QAED,mDAAmD;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;SAChE;QAED,iBAAiB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;QAEhC,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACzC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,MAAM,KAAK,GAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,IAAI,QAAQ,CAAC;QACb,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,iEAAiE;YACjE,QAAQ,GAAG,MAAM,CAAC,iBAAiB,CAAC;YACpC,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAClC,MAAM,cAAc,GAAG,0BAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChF,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,wBAAwB,CAAC,cAAc,CAAC,CAAC,OAAO,CAAC;gBAC1E,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ;oBACrB,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;aACvB;YACD,IAAI,QAAQ,GAAG,SAAS,EAAE;gBACxB,SAAS,GAAG,QAAQ,CAAC;gBACrB,SAAS,GAAG,CAAC,CAAC;aACf;SACF;QACD,OAAO,iBAAiB,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC;IAEO,OAAO,CAAC,EAAY;QAE1B,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC;QACvB,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC/B,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC/B,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC;IAEO,sBAAsB,CAAC,IAAY;QAEzC,MAAM,UAAU,GAAkB,EAAE,CAAC;QACrC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE;YAChD,MAAM,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,CAAC,GAAG,IAAI;gBACV,UAAU,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;SAC7C;QAED,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;QAE5C,IAAI,GAAG,CAAC;QACR,OAAO,SAAS,KAAK,CAAC,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE;YAC7C,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC;YACpB,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC;YACvB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;mBACzB,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;gBAC/B,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACjB,WAAW,EAAE,CAAC;aACf;SACF;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,gEAAgE;IACxD,OAAO,CAAC,IAAa,EAAE,IAAa,EAAE,IAAa,EAAE,IAAa,EAAE,QAAgB;QAE1F,MAAM,QAAQ,GAAG,0BAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,0BAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,0BAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;QACtD,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;QACtD,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC;IACxE,CAAC;IAED,iDAAiD;IACjD,gDAAgD;IAChD,uCAAuC;IACvC,0DAA0D;IAC1D,0CAA0C;IAC1C,oCAAoC;IAC5B,6BAA6B,CAAC,eAAuB,EAAE,mBAA2B;QAExF,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE;YAC9C,MAAM,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;YAC5B,MAAM,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;YAC5B,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,oBAAY,CAAC,QAAQ,CAAC;mBACjC,CAAC,EAAE,CAAC,OAAO,CAAC,oBAAY,CAAC,aAAa,CAAC,CAAG,4BAA4B;mBACtE,CAAC,EAAE,CAAC,OAAO,CAAC,oBAAY,CAAC,aAAa,CAAC,CAAG,4BAA4B;mBACtE,EAAE,CAAC,OAAO,CAAC,oBAAY,CAAC,aAAa,CAAC;mBACtC,EAAE,CAAC,aAAa,KAAK,EAAE,EAC1B;gBACA,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC3C,MAAM,gBAAgB,GAAG,IAAI,CAAC,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;gBACtE,uDAAuD;gBACvD,IAAI,gBAAgB,GAAG,mBAAmB,EAAE,EAAE,wCAAwC;oBACpF,MAAM,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;oBACzC,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;oBAC1C,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;oBACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG,EAAE;wBACzC,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;wBAC7B,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;wBAC7B,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;wBAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;wBACvC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,eAAe,CAAC,EAAE;4BACzD,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;4BACvD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,0BAA0B,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;4BACtE,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;4BACnB,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;4BAC9C,MAAM,EAAE,CAAC;yBACV;qBACF;iBACF;aACF;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,mBAAmB,CACzB,KAAe,EACf,MAAmB,EACnB,gBAAyB;IACzB,oEAAoE;IACpE,aAAsB;IACtB,iFAAiF;IACjF,oBAA6B;QAE7B,IAAI,KAAK,CAAC,oBAAoB,EAAE,KAAK,CAAC;YACpC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAClC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAC5B,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAC7C,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAC7C,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAC7C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,WAAW,GAAc,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAY,CAAC,aAAa,CAAC,CAAC;YACpE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAY,CAAC,aAAa,CAAC;gBAC9C,SAAS,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;;gBAE7B,SAAS,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;YAC/B,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;YAC/B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7B;QACD,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;SAC/B;QAED,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,WAAW,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,EAAE;YAC1C,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;gBAC1C,IAAI,gBAAgB;oBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;SAC5D;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;gBAC1C,IAAI,aAAa;oBACf,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;SACjD;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;gBACrC,2CAA2C;gBAC3C,IAAI,gBAAgB;oBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACxE;iBAAM;gBACL,yFAAyF;gBACzF,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAChC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,oBAAoB,CAAC;2BACvC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC;wBACxC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;aACjD;SACF;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,gBAAgB;gBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YACzD,IAAI,aAAa;gBACf,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC9D;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,uBAAuB,CAC7B,KAAe,EAAE,MAAmB,EACpC,gBAAyB,EACzB,aAAsB;QAEtB,IAAI,KAAK,CAAC,oBAAoB,EAAE,KAAK,CAAC;YACpC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,WAAW,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,WAAW,GAAG,yBAAO,CAAC,UAAU,EAAE,CAAC;QACzC,MAAM,UAAU,GAAc,EAAE,CAAC;QACjC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;QACtB,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;QACtB,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,GAAG;YACD,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,UAAU,EAAE,CAAC;YAClC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACtB,IAAI,WAAW,CAAC,OAAO,CAAC,oBAAY,CAAC,aAAa,CAAC,EAAE;gBACnD,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACrB,WAAW,EAAE,CAAC;gBACd,YAAY,GAAG,CAAC,CAAC;aAClB;iBAAM;gBACL,YAAY,GAAG,CAAC,CAAC;aAClB;YACD,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC,EAAE,CAAC;SACL,QAAQ,CAAC,WAAW,GAAG,WAAW,CAAC,aAAa,CAAC,KAAK,KAAK,EAAE;QAE9D,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrD,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;SACrC;QAED,WAAW,CAAC,YAAY,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAEpC,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,kBAAkB;YAClB,MAAM,WAAW,GAAG,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,CAAC;YAC1D,IAAI,gBAAgB,EAAE;gBACpB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;aACnD;SACF;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,gBAAgB;gBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;SACtF;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,aAAa,IAAI,YAAY,IAAI,CAAC;gBACpC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;SAC1E;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,CAAC;YAC1D,IAAI,aAAa,EAAE;gBACjB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;aACnD;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,KAAgB,EAAE,OAAgB;QACnD,IAAI,UAAU,EAAE,OAAO,CAAC;QACxB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,gBAAgB,CAC7C,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACpC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,KAAK,CAAC,OAAO,CAAC,oBAAY,CAAC,aAAa,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,oBAAY,CAAC,aAAa,CAAC,CAAC;YAC1C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC5B,OAAO,GAAG,KAAK,CAAC;aACjB;iBAAM;gBACL,gBAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;aACnC;YACD,UAAU,GAAG,KAAK,CAAC;SACpB;QACD,IAAI,OAAO,IAAI,OAAO,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS;YAC9D,gBAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACxC,CAAC;IACD;;;;OAIG;IACK,cAAc,CAAC,YAA0B;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE;YACjD,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE;gBACtC,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;oBAC9D,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;oBAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;oBAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;wBAChE,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;wBAC9B,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;qBAC/B;iBACF;aACF;SACF;IACH,CAAC;IAGD;;;;OAIG;IACI,mBAAmB,CAAC,cAAuB,IAAI,EAAE,kBAA0B,GAAG;QAEnF,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,MAAM,oBAAoB,GAAG,GAAG,CAAC;QACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,4BAAkB,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtD,4BAAkB,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,IAAI,sCAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,QAAQ,CAAC,eAAe,CAAC,yBAAyB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;QACxE,MAAM,QAAQ,GAAG,IAAI,sCAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,QAAQ,CAAC,eAAe,CAAC,KAAK,EAAE,yBAAyB,CAAC,YAAY,CAAC,CAAC;QACxE,IAAI,WAAW,EAAE;YACf,yCAAmB,CAAC,iDAAiD,CAAC,IAAI,CAAC,KAAK,EAC9E,IAAI,wCAAkB,CAAC,oBAAY,CAAC,aAAa,CAAC,EAAE,oBAAY,CAAC,QAAQ,CAAC,CAAC;YAC7E,IAAI,CAAC,cAAc,CAAC,oBAAY,CAAC,QAAQ,CAAC,CAAC;SAC5C;QAED,4BAAY,CAAC,+BAA+B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,4BAAY,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEvC,OAAO,QAAQ,EAAE,GAAG,SAAS,EAAE;YAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,6BAA6B,CAAC,eAAe,EAAE,oBAAoB,CAAC,CAAC;YAC1F,IAAI,OAAO,IAAI,CAAC;gBACd,MAAM;YACR,4BAAY,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACxC;IACH,CAAC;IAED,0BAA0B;IAC1B,qDAAqD;IACrD,sDAAsD;IACtD,gDAAgD;IAChD;;;;;;OAMG;IACI,aAAa,CAAC,mBAA4B,IAAI,EAAE,gBAAyB,IAAI,EAAE,uBAAgC,IAAI;QACxH,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAChC,CAAC,MAAqB,EAAE,QAAkB,EAAE,EAAE;YAC5C,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,oBAAY,CAAC,QAAQ,CAAC,EAAE;gBAC5C,IAAI,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,gBAAgB,EAAE,aAAa,CAAC,EAAE;iBACpF;qBAAM,IAAI,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,oBAAoB,CAAC,EAAE;iBAC7G;aACF;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACL,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;OAWG;IACI,2BAA2B,CAAC,gBAAyB,EAAE,WAAkB,aAAK,CAAC,aAAa,CAAC,EAAE,CAAC;QAErG,MAAM,WAAW,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAClE,IAAI,gBAAgB,IAAI,WAAW,GAAG,CAAC,EAAE;YACvC,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAC3B,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;SACzD;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;;AAlfH,8DAmfC;AAlFgB,sCAAY,GAAG,IAAI,CAAC;AACpB,sCAAY,GAAG,KAAK,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\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\nimport { Geometry } from \"../Geometry\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { HalfEdgeGraphMerge } from \"./Merging\";\r\nimport { Triangulator } from \"./Triangulation\";\r\nimport { RegularizationContext } from \"./RegularizeFace\";\r\nimport { HalfEdgeGraphSearch, HalfEdgeMaskTester } from \"./HalfEdgeGraphSearch\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\n// cSpell:disable\r\n// const sSpineRelTol = 1.0e-8;\r\n// const sSpineGraphAbsTol = 0.0;\r\n// const sSpineGraphRelTol = 1.0e-10;\r\n\r\nfunction createNPoints(n: number): Point3d[] {\r\n  const points = [];\r\n  for (let i = 0; i < n; i++)\r\n    points.push(Point3d.create(0, 0, 0));\r\n  return points;\r\n}\r\nfunction createNVectors(n: number): Vector3d[] {\r\n  const points = [];\r\n  for (let i = 0; i < n; i++)\r\n    points.push(Vector3d.create(0, 0, 0));\r\n  return points;\r\n}\r\n// Local struct to pair a graph node with a double as a sort key for std::sort\r\nclass NodeSortKey {\r\n  private _a: number;\r\n  private _node: HalfEdge;\r\n  public get node() { return this._node; }\r\n\r\n  public constructor(node: HalfEdge, b: number) {\r\n    this._node = node;\r\n    this._a = b;\r\n  }\r\n  public static compareForSort(dataA: NodeSortKey, dataB: NodeSortKey): number { return dataA._a - dataB._a; }\r\n}\r\n\r\n/**\r\n * Context manager to hold a vu graph and do spine operations\r\n *\r\n * Spine calculations determine both (a) a \"skeletal\" network of linework that follows the interior\r\n *      path through within the boundaries, and (b) a block decomposition into quads and triangles.\r\n *\r\n * Usage pattern:\r\n * ```\r\n *    const sc = new HalfEdgeGraphSpineContext();\r\n *   // Data setup ....\r\n *    foreach polygon or polyline\r\n *        {\r\n *        sc.InsertEdges (edgePoints, bClosed)\r\n *        }\r\n *   // Analysis steps ...\r\n *     * bParity = true to treat the data as a \"polygon\".  The interior is determined by parity rules\r\n *                   and the triangulation and spine are only constructed \"inside\"\r\n *     * bParity = false if \"all\" spaces are to be triangulated and spined.\r\n *     * minSplitRadians -- suggested value 0.3.  If this value is large, it will encourage add internal\r\n *     *     edges from a vertex to an edge 'across' the polygon even if it creates small angles.\r\n *     * minDiagonalAngle -- suggested value 1.0.  If this value is large (up to about 1.5 as max) it favors\r\n *     *     using triangles to navigate turns.  If it is small, it favors using skewed quadrilaterals.\r\n *    sc.TriangulateForSpine (bParity, minSplitRadians)\r\n *    sc.MarkBoxes (true, minDiagonalAngle);\r\n *    edges = sc.GetSpineEdges ();\r\n * ```\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphSpineContext {\r\n  /** The Evolving graph */\r\n  private _spineGraph: HalfEdgeGraph;\r\n  /** mask marking edges that have been paired into quads */\r\n  private _diagonalMask: HalfEdgeMask;\r\n  private _boxMask: HalfEdgeMask;\r\n  public get graph() { return this._spineGraph; }\r\n  /**\r\n   * Create a context with an empty graph.\r\n   * * Reserve masks for specialized markup.\r\n   */\r\n  public constructor() {\r\n    this._spineGraph = new HalfEdgeGraph();\r\n    // vu_setTol (_spineGraph, sSpineGraphAbsTol, sSpineGraphRelTol);\r\n    this._diagonalMask = this._spineGraph.grabMask();\r\n    this._boxMask = this._spineGraph.grabMask();\r\n  }\r\n\r\n  /**\r\n   * Release resources to the graph.\r\n   */\r\n  public teardown() {\r\n    this._spineGraph.dropMask(this._diagonalMask);\r\n    this._spineGraph.dropMask(this._boxMask);\r\n    this._spineGraph.decommission();\r\n  }\r\n\r\n  //  an edge (as new bvector<DPoint3d> at back, with cloned points>\r\n  private addEdge(xyzOut: Point3d[][], xyzA: Point3d, xyzB: Point3d) {\r\n    const newArray = [];\r\n    newArray.push(xyzA.clone());\r\n    newArray.push(xyzB.clone());\r\n    xyzOut.push(newArray);\r\n  }\r\n\r\n  private getBoxCorners(diagonalNode: HalfEdge,\r\n    nodes: HalfEdge[],\r\n    points: Point3d[]): boolean {\r\n    const diagonalMate = diagonalNode.edgeMate;\r\n    nodes.length = 0;\r\n    points.length = 0;\r\n    if (!diagonalNode.getMask(HalfEdgeMask.BOUNDARY_EDGE)\r\n      && diagonalNode.countEdgesAroundFace() === 3\r\n      && diagonalMate.countEdgesAroundFace() === 3) {\r\n      const nodeA = diagonalMate.faceSuccessor;\r\n      nodes.push(nodeA);\r\n      nodes.push(nodeA.faceSuccessor);\r\n      const nodeB = diagonalNode.faceSuccessor;\r\n      nodes.push(nodeB);\r\n      nodes.push(nodeB.faceSuccessor);\r\n      for (let i = 0; i < 4; i++)\r\n        points.push(Point3d.create(nodes[i].x, nodes[i].y));\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n\r\n  // Compute bisectors of the quad.\r\n  // function key is the smaller absolute angle between the bisectors.\r\n  // (pi/2 is max possible value).\r\n  private diagonalKeyFunc(pDiagonalNode: HalfEdge): number {\r\n\r\n    const nodes: HalfEdge[] = [];\r\n    const points: Point3d[] = [];\r\n    if (this.getBoxCorners(pDiagonalNode, nodes, points)) {\r\n      const xyzA = points[0];\r\n      const xyzB = points[1];\r\n      const xyzC = points[2];\r\n      const xyzD = points[3];\r\n      const xyzAB = xyzA.interpolate(0.5, xyzB);\r\n      const xyzBC = xyzB.interpolate(0.5, xyzC);\r\n      const xyzCD = xyzC.interpolate(0.5, xyzD);\r\n      const xyzDA = xyzD.interpolate(0.5, xyzA);\r\n\r\n      const vectorAB = Vector3d.createStartEnd(xyzA, xyzB);\r\n      const vectorBC = Vector3d.createStartEnd(xyzB, xyzC);\r\n      const vectorCD = Vector3d.createStartEnd(xyzC, xyzD);\r\n      const vectorDA = Vector3d.createStartEnd(xyzD, xyzA);\r\n\r\n      const vectorABToCD = Vector3d.createStartEnd(xyzCD, xyzAB);\r\n      const vectorBCToDA = Vector3d.createStartEnd(xyzDA, xyzBC);\r\n      vectorABToCD.z = 0.0;\r\n      vectorBCToDA.z = 0.0;\r\n      const thetaAB = vectorABToCD.smallerUnorientedAngleTo(vectorAB).radians;\r\n      const thetaBC = vectorBCToDA.smallerUnorientedAngleTo(vectorBC).radians;\r\n      const thetaCD = vectorABToCD.smallerUnorientedAngleTo(vectorCD).radians;\r\n      const thetaDA = vectorBCToDA.smallerUnorientedAngleTo(vectorDA).radians;\r\n\r\n      const alpha = thetaAB < thetaCD ? thetaAB : thetaCD;\r\n      const beta = thetaBC < thetaDA ? thetaBC : thetaDA;\r\n      return alpha < beta ? alpha : beta;\r\n    }\r\n\r\n    return Number.NEGATIVE_INFINITY;\r\n  }\r\n\r\n  // Select a branch point in a triangle.\r\n  // This may be the centroid or the midpoint of an edge joining midpoints of a pair of edges.\r\n  private selectTriangleInteriorPoint(pXYZ: Point3d[]): Point3d {\r\n\r\n    const xyz = createNPoints(6);\r\n    const xyzMid = createNPoints(6);     // Midpoints of each edge.\r\n    const interiorCandidate = createNPoints(4);   // for i in {012}, [i] is midpoint of midpoint[i+1] and midpoint[i+2].\r\n    // [3] is centroid.\r\n    const edgeVector = createNVectors(6);\r\n    const centroid = Point3d.create();\r\n    for (let i = 0; i < 3; i++) {\r\n      xyz[i] = xyz[i + 3] = pXYZ[i];\r\n      centroid.addInPlace(xyz[i]);\r\n    }\r\n    centroid.scaleInPlace(1.0 / 3.0);\r\n\r\n    // Edge midpoints ...\r\n    for (let i = 0; i < 3; i++) {\r\n      xyzMid[i] = xyz[i].interpolate(0.5, xyz[i + 1]);\r\n      xyzMid[i + 3] = xyzMid[i];\r\n      edgeVector[i] = Vector3d.createStartEnd(xyz[i], xyz[i + 1]);    // use wraparound\r\n      edgeVector[i + 3] = edgeVector[i];\r\n    }\r\n\r\n    // Midpoints of midpoint-to-midpoint connections ..\r\n    for (let i = 0; i < 3; i++) {\r\n      const i1 = i + 1;\r\n      const i2 = i + 2;\r\n      interiorCandidate[i] = xyzMid[i1].interpolate(0.5, xyzMid[i2]);\r\n    }\r\n\r\n    interiorCandidate[3] = centroid;\r\n\r\n    let bestAngle = Number.NEGATIVE_INFINITY;\r\n    let bestIndex = -1;\r\n    const theta: number[] = [0, 0, 0];\r\n    let thetaMin;\r\n    for (let k: number = 0; k < 4; k++) {\r\n      // Measure angles from edge midpoints towards interior candidate.\r\n      thetaMin = Number.POSITIVE_INFINITY;\r\n      for (let i: number = 0; i < 3; i++) {\r\n        const edgeToInterior = Vector3d.createStartEnd(xyzMid[i], interiorCandidate[k]);\r\n        theta[i] = edgeVector[i].smallerUnorientedAngleTo(edgeToInterior).radians;\r\n        if (theta[i] < thetaMin)\r\n          thetaMin = theta[i];\r\n      }\r\n      if (thetaMin > bestAngle) {\r\n        bestAngle = thetaMin;\r\n        bestIndex = k;\r\n      }\r\n    }\r\n    return interiorCandidate[bestIndex];\r\n  }\r\n\r\n  private markBox(pA: HalfEdge): void {\r\n\r\n    const pB = pA.edgeMate;\r\n    pA.setMask(this._diagonalMask);\r\n    pB.setMask(this._diagonalMask);\r\n    pA.setMaskAroundFace(this._boxMask);\r\n    pB.setMaskAroundFace(this._boxMask);\r\n  }\r\n\r\n  private setSortedDiagonalMasks(minA: number): number {\r\n\r\n    const candidates: NodeSortKey[] = [];\r\n    let numDiagonal = 0;\r\n    for (const node of this._spineGraph.allHalfEdges) {\r\n      const b = this.diagonalKeyFunc(node);\r\n      if (b > minA)\r\n        candidates.push(new NodeSortKey(node, b));\r\n    }\r\n\r\n    candidates.sort(NodeSortKey.compareForSort);\r\n\r\n    let key;\r\n    while (undefined !== (key = candidates.pop())) {\r\n      const pA = key.node;\r\n      const pB = pA.edgeMate;\r\n      if (!pA.getMask(this._boxMask)\r\n        && !pB.getMask(this._boxMask)) {\r\n        this.markBox(pA);\r\n        numDiagonal++;\r\n      }\r\n    }\r\n    return numDiagonal;\r\n  }\r\n\r\n  /// <param name=\"xyzA\">Vertex whose angle is being split</param>\r\n  private splitOK(xyzA: Point3d, xyzB: Point3d, xyzQ: Point3d, xyzC: Point3d, minAngle: number): boolean {\r\n\r\n    const vectorAB = Vector3d.createStartEnd(xyzA, xyzB);\r\n    const vectorAQ = Vector3d.createStartEnd(xyzA, xyzQ);\r\n    const vectorAC = Vector3d.createStartEnd(xyzA, xyzC);\r\n    const angleBAQ = vectorAB.angleToXY(vectorAQ).radians;\r\n    const angleQAC = vectorAQ.angleToXY(vectorAC).radians;\r\n    return Math.abs(angleBAQ) > minAngle && Math.abs(angleQAC) > minAngle;\r\n  }\r\n\r\n  // Search a triangulation for vertices which have\r\n  //   (a) pre-split angle greater than 90 degrees\r\n  // (b) the opposite edge is a boundary.\r\n  //  (c) each post split angle is less than minSplitRadians\r\n  // Drop a perpenedicular to that boundary.\r\n  // return the number of edges added.\r\n  private addPerpendicularsToBoundaries(minSplitRadians: number, minCandidateRadians: number): number {\r\n\r\n    let numAdd = 0;\r\n    for (const pA of this._spineGraph.allHalfEdges) {\r\n      const pB = pA.faceSuccessor;\r\n      const pC = pB.faceSuccessor;\r\n      if (!pA.getMask(HalfEdgeMask.EXTERIOR)\r\n        && !pA.getMask(HalfEdgeMask.BOUNDARY_EDGE)   // ?? prevent deep recursion\r\n        && !pC.getMask(HalfEdgeMask.BOUNDARY_EDGE)   // ?? prevent deep recursion\r\n        && pB.getMask(HalfEdgeMask.BOUNDARY_EDGE)\r\n        && pC.faceSuccessor === pA\r\n      ) {\r\n        const vectorAB = pA.getVector2dAlongEdge();\r\n        const vectorBC = pB.getVector2dAlongEdge();\r\n        const vectorCA = pC.getVector2dAlongEdge();\r\n        const candidateRadians = Math.PI - vectorCA.angleTo(vectorAB).radians;\r\n        // const candidateDot = vectorCA.DotProduct (vectorAB);\r\n        if (candidateRadians > minCandidateRadians) { // vectorCA.DotProduct (vectorAB) > 0.0)\r\n          const bb = vectorBC.dotProduct(vectorBC);\r\n          const ba = -vectorBC.dotProduct(vectorAB);\r\n          const s = Geometry.conditionalDivideFraction(ba, bb);\r\n          if (s !== undefined && s > 0.0 && s < 1.0) {\r\n            const xyzA = pA.getPoint3d();\r\n            const xyzB = pB.getPoint3d();\r\n            const xyzC = pC.getPoint3d();\r\n            const xyzE = xyzB.interpolate(s, xyzC);\r\n            if (this.splitOK(xyzA, xyzB, xyzE, xyzC, minSplitRadians)) {\r\n              const pE = this._spineGraph.splitEdgeAtFraction(pB, s);\r\n              const pA1 = this._spineGraph.createEdgeHalfEdgeHalfEdge(pA, 0, pE, 0);\r\n              pA1.setXYZFrom(pA);\r\n              pE.setXYZAroundVertex(xyzE.x, xyzE.y, xyzE.z);\r\n              numAdd++;\r\n            }\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return numAdd;\r\n  }\r\n\r\n  private getSpineEdgesInQuad(\r\n    pFace: HalfEdge,\r\n    xyzOut: Point3d[][],\r\n    bIncludeInterior: boolean,\r\n    // true to include the edge to boundary when the qued is a dead end.\r\n    bIncludeFinal: boolean,\r\n    // true to include the two adjacent edges to boundary if the quad is at a corner.\r\n    bIncludeCornerSpokes: boolean): boolean {\r\n\r\n    if (pFace.countEdgesAroundFace() !== 4)\r\n      return false;\r\n    const pNode: HalfEdge[] = [];\r\n    const xyz = createNPoints(8);\r\n    const midpoint = createNPoints(8);\r\n    pNode[0] = pNode[4] = pFace;\r\n    pNode[1] = pNode[5] = pNode[0].faceSuccessor;\r\n    pNode[2] = pNode[6] = pNode[1].faceSuccessor;\r\n    pNode[3] = pNode[7] = pNode[2].faceSuccessor;\r\n    let numBoundary = 0;\r\n    let numInterior = 0;\r\n    const iBoundary: number[] = [];\r\n    const iInterior: number[] = [];\r\n    const bIsBoundary: boolean[] = [];\r\n    const centroid = Point3d.create();\r\n    for (let i: number = 0; i < 4; i++) {\r\n      bIsBoundary[i] = 0 !== pNode[i].getMask(HalfEdgeMask.BOUNDARY_EDGE);\r\n      if (pNode[i].getMask(HalfEdgeMask.BOUNDARY_EDGE))\r\n        iBoundary[numBoundary++] = i;\r\n      else\r\n        iInterior[numInterior++] = i;\r\n      xyz[i] = pNode[i].getPoint3d();\r\n      xyz[i + 4] = xyz[i];\r\n      centroid.addInPlace(xyz[i]);\r\n    }\r\n    for (let i: number = 0; i < 4; i++) {\r\n      midpoint[i] = xyz[i].interpolate(0.5, xyz[i + 1]);\r\n      midpoint[i + 4] = midpoint[i];\r\n    }\r\n\r\n    centroid.scaleInPlace(0.25);\r\n    if (numBoundary === 0 || numBoundary === 1) {\r\n      for (let i: number = 0; i < numInterior; i++)\r\n        if (bIncludeInterior)\r\n          this.addEdge(xyzOut, midpoint[iInterior[i]], centroid);\r\n    } else if (numBoundary === 4) {\r\n      for (let i: number = 0; i < numBoundary; i++)\r\n        if (bIncludeFinal)\r\n          this.addEdge(xyzOut, midpoint[i], centroid);\r\n    } else if (numBoundary === 2) {\r\n      if (iInterior[1] === iInterior[0] + 2) {\r\n        // Spine enters one end, exits the other ..\r\n        if (bIncludeInterior)\r\n          this.addEdge(xyzOut, midpoint[iInterior[0]], midpoint[iInterior[1]]);\r\n      } else {\r\n        // Block sits as exterior corner.  Let the two spines continue to their opposite faces ..\r\n        for (let i: number = 0; i < 4; i++)\r\n          if ((bIsBoundary[i] && bIncludeCornerSpokes)\r\n            || (!bIsBoundary[i] && bIncludeInterior))\r\n            this.addEdge(xyzOut, midpoint[i], centroid);\r\n      }\r\n    } else if (numBoundary === 3) {\r\n      if (bIncludeInterior)\r\n        this.addEdge(xyzOut, midpoint[iInterior[0]], centroid);\r\n      if (bIncludeFinal)\r\n        this.addEdge(xyzOut, centroid, midpoint[iInterior[0] + 2]);\r\n    }\r\n    return true;\r\n  }\r\n\r\n  private getSpineEdgesInTriangle(\r\n    pFace: HalfEdge, xyzOut: Point3d[][],\r\n    bIncludeInterior: boolean,\r\n    bIncludeFinal: boolean): boolean {\r\n\r\n    if (pFace.countEdgesAroundFace() !== 3)\r\n      return false;\r\n    let n = 0;\r\n    const xyzMidpoint = createNPoints(6);\r\n    const xyz = createNPoints(6);\r\n    const xyzCentroid = Point3d.createZero();\r\n    const isBoundary: boolean[] = [];\r\n    let numBoundary = 0;\r\n    let lastBoundary = -1;\r\n    let lastInterior = -1;\r\n    let currentEdge = pFace;\r\n    do {\r\n      xyz[n] = currentEdge.getPoint3d();\r\n      xyzCentroid.addInPlace(xyz[n]);\r\n      isBoundary[n] = false;\r\n      if (currentEdge.getMask(HalfEdgeMask.BOUNDARY_EDGE)) {\r\n        isBoundary[n] = true;\r\n        numBoundary++;\r\n        lastBoundary = n;\r\n      } else {\r\n        lastInterior = n;\r\n      }\r\n      xyz[n + 3] = xyz[n];\r\n      isBoundary[n + 3] = isBoundary[n];\r\n      n++;\r\n    } while ((currentEdge = currentEdge.faceSuccessor) !== pFace);\r\n\r\n    for (let i: number = 0; i < 3; i++) {\r\n      xyzMidpoint[i] = xyz[i].interpolate(0.5, xyz[i + 1]);\r\n      xyzMidpoint[i + 3] = xyzMidpoint[i];\r\n    }\r\n\r\n    xyzCentroid.scaleInPlace(1.0 / 3.0);\r\n\r\n    if (numBoundary === 0) {\r\n      // Interior branch\r\n      const xyzInterior = this.selectTriangleInteriorPoint(xyz);\r\n      if (bIncludeInterior) {\r\n        this.addEdge(xyzOut, xyzMidpoint[0], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[1], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[2], xyzInterior);\r\n      }\r\n    } else if (numBoundary === 1) {\r\n      if (bIncludeInterior)\r\n        this.addEdge(xyzOut, xyzMidpoint[lastBoundary + 1], xyzMidpoint[lastBoundary + 2]);\r\n    } else if (numBoundary === 2) {\r\n      if (bIncludeFinal && lastInterior >= 0)\r\n        this.addEdge(xyzOut, xyzMidpoint[lastInterior], xyz[lastInterior + 2]);\r\n    } else if (numBoundary === 3) {\r\n      const xyzInterior = this.selectTriangleInteriorPoint(xyz);\r\n      if (bIncludeFinal) {\r\n        this.addEdge(xyzOut, xyzMidpoint[0], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[1], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[2], xyzInterior);\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /** Add a polyline to the graph.\r\n   * * This may be called multiple times\r\n   */\r\n  public insertEdges(xyzIn: Point3d[], bClosed: boolean): void {\r\n    let pPreviousB, pFirstA;\r\n    for (let i: number = 1; i < xyzIn.length; i++) {\r\n      const nodeA = this._spineGraph.createEdgeXYZXYZ(\r\n        xyzIn[i - 1].x, xyzIn[i - 1].y, 0, 0,\r\n        xyzIn[i].x, xyzIn[i].y, 0, 0);\r\n      const nodeB = nodeA.faceSuccessor;\r\n      nodeA.setMask(HalfEdgeMask.BOUNDARY_EDGE);\r\n      nodeB.setMask(HalfEdgeMask.BOUNDARY_EDGE);\r\n      if (pPreviousB === undefined) {\r\n        pFirstA = nodeA;\r\n      } else {\r\n        HalfEdge.pinch(pPreviousB, nodeA);\r\n      }\r\n      pPreviousB = nodeB;\r\n    }\r\n    if (bClosed && pFirstA !== undefined && pPreviousB !== undefined)\r\n      HalfEdge.pinch(pPreviousB, pFirstA);\r\n  }\r\n  /**\r\n   * Look for trivial (2 edge) faces that have exteriorMask and non-masked on both sides.\r\n   * * clear the mask\r\n   * @param exteriorMask\r\n   */\r\n  private purgeNullFaces(exteriorMask: HalfEdgeMask) {\r\n    for (const nodeA of this._spineGraph.allHalfEdges) {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      const nodeC = nodeB.faceSuccessor;\r\n      if (nodeB !== nodeA && nodeC === nodeA) {\r\n        if (nodeA.getMask(exteriorMask) && nodeB.getMask(exteriorMask)) {\r\n          const mateA = nodeA.edgeMate;\r\n          const mateB = nodeB.edgeMate;\r\n          if (!mateA.getMask(exteriorMask) && !mateB.getMask(exteriorMask)) {\r\n            nodeA.clearMask(exteriorMask);\r\n            nodeB.clearMask(exteriorMask);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  private static _regularize1 = true;\r\n  private static _regularize2 = false;\r\n  /**\r\n   * Triangulate the graph for the edges that have been inserted.\r\n   * @param applyParity if true ()\r\n   * @param minSplitRadians smallest allowed angle in the split sector that is split.\r\n   */\r\n  public triangulateForSpine(applyParity: boolean = true, minSplitRadians: number = 0.3): void {\r\n\r\n    const sMaxSplit = 20;\r\n    const sMinCandidateRadians = 1.0;\r\n    let numSplit = 0;\r\n    HalfEdgeGraphMerge.splitIntersectingEdges(this.graph);\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(this.graph);\r\n\r\n    const context1 = new RegularizationContext(this.graph);\r\n    context1.regularizeGraph(HalfEdgeGraphSpineContext._regularize1, false);\r\n    const context2 = new RegularizationContext(this.graph);\r\n    context2.regularizeGraph(false, HalfEdgeGraphSpineContext._regularize2);\r\n    if (applyParity) {\r\n      HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(this.graph,\r\n        new HalfEdgeMaskTester(HalfEdgeMask.BOUNDARY_EDGE), HalfEdgeMask.EXTERIOR);\r\n      this.purgeNullFaces(HalfEdgeMask.EXTERIOR);\r\n    }\r\n\r\n    Triangulator.triangulateAllPositiveAreaFaces(this.graph);\r\n    Triangulator.flipTriangles(this.graph);\r\n\r\n    while (numSplit++ < sMaxSplit) {\r\n      const numPerp = this.addPerpendicularsToBoundaries(minSplitRadians, sMinCandidateRadians);\r\n      if (numPerp <= 0)\r\n        break;\r\n      Triangulator.flipTriangles(this.graph);\r\n    }\r\n  }\r\n\r\n  // Find pseudo spine edges\r\n  // Optionally include pure internal midline segments.\r\n  // Optionally include midline segments into \"dead end\"\r\n  // Optionally include adjacent spokes to corner.\r\n  /**\r\n   * Retrieve edges of the spine as arrays of points.\r\n   * @param bIncludeInterior true to include fully internal segments\r\n   * @param bIncludeFinal true to include segments that terminate at a boundary\r\n   * @param bIncludeCornerSpokes\r\n   * @return array of line data.\r\n   */\r\n  public getSpineEdges(bIncludeInterior: boolean = true, bIncludeFinal: boolean = true, bIncludeCornerSpokes: boolean = true): Point3d[][] {\r\n    const xyzOut: Point3d[][] = [];\r\n    this._spineGraph.announceFaceLoops(\r\n      (_graph: HalfEdgeGraph, faceSeed: HalfEdge) => {\r\n        if (!faceSeed.getMask(HalfEdgeMask.EXTERIOR)) {\r\n          if (this.getSpineEdgesInTriangle(faceSeed, xyzOut, bIncludeInterior, bIncludeFinal)) {\r\n          } else if (this.getSpineEdgesInQuad(faceSeed, xyzOut, bIncludeInterior, bIncludeFinal, bIncludeCornerSpokes)) {\r\n          }\r\n        }\r\n        return true;\r\n      });\r\n    return xyzOut;\r\n  }\r\n\r\n  /**\r\n   * Intermediate markup step to identify quads between corresponding boundary edges.\r\n   * * search for and mark triangle edges that should be treated as diagonal of a quad\r\n   * * Angle logic is:\r\n   *   * In a candidate quad (formed by joining triangles that share an edge)\r\n   *   * form segments between opposite edges of the quad.\r\n   *   * compute angles between these segments and the edges of their quads.\r\n   *   * if this angle is larger than minAngleRadians, accept this as a quad.\r\n   *   * recommended angle is between 15 and 5 degrees; 50 degrees is typical\r\n   * @param bDeleteDiagonals if true, eliminate the diagonals.\r\n   * @param minAngleRadians angle tolerance, as described above.\r\n   */\r\n  public consolidateTrianglesToQuads(bDeleteDiagonals: boolean, minAngle: Angle = Angle.createDegrees(50)): number {\r\n\r\n    const numDiagonal = this.setSortedDiagonalMasks(minAngle.radians);\r\n    if (bDeleteDiagonals && numDiagonal > 0) {\r\n      this.graph.yankAndDeleteEdges(\r\n        (node: HalfEdge) => node.getMask(this._diagonalMask));\r\n    }\r\n    return numDiagonal;\r\n  }\r\n}\r\n"]}

package/lib/topology/HalfEdgeGraphValidation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgeGraphValidation.d.ts","sourceRoot":"","sources":["../../src/topology/HalfEdgeGraphValidation.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAGhE;;GAEG;AACH,qBAAa,wBAAwB;IAC5B,oBAAoB,EAAE,MAAM,CAAK;IACjC,cAAc,EAAE,MAAM,CAAK;IAC3B,cAAc,EAAE,MAAM,CAAK;IAC3B,YAAY,EAAE,MAAM,CAAK;IACzB,gBAAgB,EAAE,MAAM,CAAK;IAC7B,SAAS,EAAE,MAAM,CAAK;IACtB,sBAAsB,EAAE,MAAM,CAAK;IAC1C,uBAAuB;IAChB,WAAW;IASlB,8FAA8F;IACvF,eAAe,CAAC,EAAE,EAAE,QAAQ;IAYnC;;;;OAIG;IACH,IAAW,0BAA0B,IAAI,OAAO,CAM/C;IACD;;;;OAIG;IACH,IAAW,uCAAuC,IAAI,OAAO,CAM5D;IACD;;OAEG;IACI,gBAAgB,CAAC,KAAK,EAAE,aAAa;IAK5C;;;OAGG;WACW,YAAY,CAAC,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,OAAO,GAAG,OAAO;CAMnF;AACD,8EAA8E;AAC9E,qBAAa,sBAAsB;IACjC;;;;;OAKG;WACW,8BAA8B,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,OAAO;CAOhG"}

package/lib/topology/HalfEdgeGraphValidation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgeGraphValidation.js","sourceRoot":"","sources":["../../src/topology/HalfEdgeGraphValidation.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,oCAAoC;AACpC;;GAEG;AACH,MAAa,wBAAwB;IAArC;QACS,yBAAoB,GAAW,CAAC,CAAC;QACjC,mBAAc,GAAW,CAAC,CAAC;QAC3B,mBAAc,GAAW,CAAC,CAAC;QAC3B,iBAAY,GAAW,CAAC,CAAC;QACzB,qBAAgB,GAAW,CAAC,CAAC;QAC7B,cAAS,GAAW,CAAC,CAAC;QACtB,2BAAsB,GAAW,CAAC,CAAC;IAkE5C,CAAC;IAjEC,uBAAuB;IAChB,WAAW;QAChB,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,sBAAsB,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IACD,8FAA8F;IACvF,eAAe,CAAC,EAAY;QACjC,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,EAAE,CAAC,eAAe,KAAK,SAAS;YAAE,IAAI,CAAC,cAAc,EAAE,CAAC;aACvD,IAAI,EAAE,CAAC,eAAe,CAAC,aAAa,KAAK,EAAE;YAAE,IAAI,CAAC,YAAY,EAAE,CAAC;QAEtE,IAAI,EAAE,CAAC,aAAa,KAAK,SAAS;YAAE,IAAI,CAAC,cAAc,EAAE,CAAC;aACrD,IAAI,EAAE,CAAC,aAAa,CAAC,eAAe,KAAK,EAAE;YAAE,IAAI,CAAC,YAAY,EAAE,CAAC;QAEtE,IAAI,EAAE,CAAC,QAAQ,KAAK,SAAS;YAAE,IAAI,CAAC,oBAAoB,EAAE,CAAC;aACtD,IAAI,EAAE,CAAC,QAAQ,CAAC,QAAQ,KAAK,EAAE;YAAE,IAAI,CAAC,sBAAsB,EAAE,CAAC;;YAC/D,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC/B,CAAC;IACD;;;;OAIG;IACH,IAAW,0BAA0B;QACnC,OAAO,IAAI,CAAC,sBAAsB,KAAK,IAAI,CAAC,SAAS;eAChD,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,YAAY,KAAK,CAAC;eACvB,IAAI,CAAC,gBAAgB,KAAK,CAAC,CAAC;IACnC,CAAC;IACD;;;;OAIG;IACH,IAAW,uCAAuC;QAChD,OAAO,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC,oBAAoB,KAAK,IAAI,CAAC,SAAS;eAC5E,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,cAAc,KAAK,CAAC;eACzB,IAAI,CAAC,YAAY,KAAK,CAAC;eACvB,IAAI,CAAC,gBAAgB,KAAK,CAAC,CAAC;IACnC,CAAC;IACD;;OAEG;IACI,gBAAgB,CAAC,KAAoB;QAC1C,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,YAAY;YAAE,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IAEhE,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,YAAY,CAAC,KAAoB,EAAE,cAAuB;QACtE,MAAM,SAAS,GAAG,IAAI,wBAAwB,EAAE,CAAC;QACjD,SAAS,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,cAAc;YAAE,OAAO,SAAS,CAAC,0BAA0B,CAAC;QAChE,OAAO,SAAS,CAAC,uCAAuC,CAAC;IAC3D,CAAC;CACF;AAzED,4DAyEC;AACD,8EAA8E;AAC9E,MAAa,sBAAsB;IACjC;;;;;OAKG;IACI,MAAM,CAAC,8BAA8B,CAAC,KAAoB,EAAE,IAAkB;QACnF,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,YAAY,EAAE;YACnC,IAAI,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;gBACrD,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAdD,wDAcC","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 Topology\n */\n// cspell:word FSFP\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\n\n// Search services for HalfEdgeGraph\n/** HalfEdgePointerInspector has methods to check HalfEdge objects for pointer errors.\n * * For a one-step test of the whole graph,\n */\nexport class HalfEdgePointerInspector {\n  public numUndefinedEdgeMate: number = 0;\n  public numUndefinedFS: number = 0;\n  public numUndefinedFP: number = 0;\n  public numFSFPError: number = 0;\n  public numMatePairError: number = 0;\n  public numTested: number = 0;\n  public numWithMatchedEdgeMate: number = 0;\n  /** Clear all counts */\n  public clearCounts() {\n    this.numUndefinedEdgeMate = 0;\n    this.numUndefinedFP = 0;\n    this.numUndefinedFS = 0;\n    this.numFSFPError = 0;\n    this.numMatePairError = 0;\n    this.numWithMatchedEdgeMate = 0;\n    this.numTested = 0;\n  }\n  /** Inspect a single half edge.   Increment counters according to the half edge's pointers. */\n  public inspectHalfEdge(he: HalfEdge) {\n    this.numTested++;\n    if (he.facePredecessor === undefined) this.numUndefinedFP++;\n    else if (he.facePredecessor.faceSuccessor !== he) this.numFSFPError++;\n\n    if (he.faceSuccessor === undefined) this.numUndefinedFS++;\n    else if (he.faceSuccessor.facePredecessor !== he) this.numFSFPError++;\n\n    if (he.edgeMate === undefined) this.numUndefinedEdgeMate++;\n    else if (he.edgeMate.edgeMate === he) this.numWithMatchedEdgeMate++;\n    else this.numMatePairError++;\n  }\n  /** Return true if all pointer pairings are correct for a complete half edge graph:\n   * * For each he:  `he.edgeMate.edgeMate === he`\n   * * For each he:  `he.faceSuccessor.facePredecessor !== he`\n   * * For each he:  `he.facePredecessor.faceSuccessor !== he`\n   */\n  public get isValidClosedHalfEdgeGraph(): boolean {\n    return this.numWithMatchedEdgeMate === this.numTested\n      && this.numUndefinedFS === 0\n      && this.numUndefinedFP === 0\n      && this.numFSFPError === 0\n      && this.numMatePairError === 0;\n  }\n  /** Return true if all counts are correct for a half edge graph that has complete pairings:\n   * * For each he:  `he.edgeMate.edgeMate === he`\n   * * For each he:  `he.faceSuccessor.facePredecessor !== he`\n   * * For each he:  `he.facePredecessor.faceSuccessor !== he`\n   */\n  public get isValidHalfEdgeGraphAllowRaggedBoundary(): boolean {\n    return this.numWithMatchedEdgeMate + this.numUndefinedEdgeMate === this.numTested\n      && this.numUndefinedFS === 0\n      && this.numUndefinedFP === 0\n      && this.numFSFPError === 0\n      && this.numMatePairError === 0;\n  }\n  /** inspect all half edges of graph.\n   * All pointer counts are left in member vars for later inspection.\n   */\n  public inspectHalfEdges(graph: HalfEdgeGraph) {\n    this.clearCounts();\n    for (const he of graph.allHalfEdges) this.inspectHalfEdge(he);\n\n  }\n  /** Inspect a graph's pointer properties.\n   * @param expectAllMates [in] true for \"complete\" graph with\n   * @returns true if all pointers are valid\n   */\n  public static inspectGraph(graph: HalfEdgeGraph, expectAllMates: boolean): boolean {\n    const inspector = new HalfEdgePointerInspector();\n    inspector.inspectHalfEdges(graph);\n    if (expectAllMates) return inspector.isValidClosedHalfEdgeGraph;\n    return inspector.isValidHalfEdgeGraphAllowRaggedBoundary;\n  }\n}\n/** static methods to inspect mask consistency properties in HalfEdgeGraph. */\nexport class HalfEdgeMaskValidation {\n  /**\n   * Test if a mask is used consistently around faces.\n   * * At the low level, there is no actual traversal around faces.  It is only necessary to verify that the mask matches for each HalfEdge and its faceSuccessor.\n   * @returns Return true if mask is \"all or nothing around all faces\"\n   *\n   */\n  public static isMaskConsistentAroundAllFaces(graph: HalfEdgeGraph, mask: HalfEdgeMask): boolean {\n    for (const he of graph.allHalfEdges) {\n      if (he.faceSuccessor.getMask(mask) !== he.getMask(mask))\n        return false;\n    }\n    return true;\n  }\n}\n"]}

package/lib/topology/HalfEdgeMarkSet.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgeMarkSet.d.ts","sourceRoot":"","sources":["../../src/topology/HalfEdgeMarkSet.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAEhE;;GAEG;AACH;;;;;;;;;;;;;;;;;;;GAmBG;AACH,8BAAsB,4BAA4B;IAChD,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,WAAW,CAAa;IAChC,SAAS,CAAC,KAAK,EAAE,YAAY,CAAC;IAE9B,SAAS,aAAa,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY;IAM9D;;;OAGG;IACI,KAAK;IAKZ;;;OAGG;IACI,SAAS,IAAI,MAAM;IAO1B;;;;OAIG;IACI,gBAAgB,IAAI,MAAM;IAGjC,+CAA+C;IAC/C,IAAW,KAAK,IAAI,aAAa,CAAwB;IAEzD,uDAAuD;IAChD,QAAQ;IAKf,uEAAuE;IACvE,IAAW,IAAI,IAAI,YAAY,CAAuB;IAEtD,4FAA4F;IAC5F,SAAS,CAAC,YAAY,IAAI,QAAQ,GAAG,SAAS;IAS9C;;;;;OAKG;IACI,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAStD;;;;;;;OAOG;IACI,QAAQ,CAAC,SAAS,EAAE,QAAQ;IAOnC;;OAEG;IACI,gBAAgB,CAAC,SAAS,EAAE,QAAQ,GAAG,OAAO;IAGrD;;;;;;;;OAQG;IACI,aAAa,CAAC,SAAS,EAAE,QAAQ,GAAG,OAAO;IAMlD;;;;OAIG;IACI,kBAAkB,IAAI,QAAQ,GAAG,SAAS;IASjD;;;OAGG;IACH,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC,SAAS,EAAE,QAAQ,GAAG,SAAS,GAAG,IAAI;IAExE;;;OAGG;IACH,SAAS,CAAC,QAAQ,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,GAAG,SAAS,GAAG,IAAI;IAC1E;;;;OAIG;aACa,6BAA6B,CAAC,SAAS,EAAE,QAAQ,GAAG,SAAS,GAAG,MAAM;IACtF,+CAA+C;IACxC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,QAAQ,CAAC;IACtD;;;OAGG;IACI,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI;IAQ1C;;;OAGG;IACI,eAAe,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI;CAO7C;AAED;;;GAGG;AACH,qBAAa,gBAAiB,SAAQ,4BAA4B;gBACpD,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY;IAGpD;;;OAGG;WACW,MAAM,CAAC,KAAK,EAAE,aAAa,GAAG,gBAAgB,GAAG,SAAS;IAOxE;;;OAGG;IACH,SAAS,CAAC,cAAc,CAAC,SAAS,EAAE,QAAQ;IAI5C;;;OAGG;IACH,SAAS,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ;IAG9C;;;;;OAKG;IACI,6BAA6B,CAAC,SAAS,EAAE,QAAQ,GAAG,SAAS,GAAG,MAAM;CAK9E;AAED;;;GAGG;AACH,qBAAa,aAAc,SAAQ,4BAA4B;gBACjD,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY;IAGpD;;;OAGG;WACW,MAAM,CAAC,KAAK,EAAE,aAAa,GAAG,aAAa,GAAG,SAAS;IAOrE;;;OAGG;IACH,SAAS,CAAC,cAAc,CAAC,SAAS,EAAE,QAAQ;IAI5C;;;OAGG;IACH,SAAS,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ;IAG9C;;;;OAIG;IACI,6BAA6B,CAAC,SAAS,EAAE,QAAQ,GAAG,SAAS,GAAG,MAAM;CAK9E;AAED;;;GAGG;AACH,qBAAa,aAAc,SAAQ,4BAA4B;gBACjD,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY;IAGpD;;;OAGG;WACW,MAAM,CAAC,KAAK,EAAE,aAAa,GAAG,aAAa,GAAG,SAAS;IAOrE;;;OAGG;IACH,SAAS,CAAC,cAAc,CAAC,SAAS,EAAE,QAAQ;IAI5C;;;OAGG;IACH,SAAS,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ;IAG9C;;;;OAIG;IACI,6BAA6B,CAAC,SAAS,EAAE,QAAQ,GAAG,SAAS,GAAG,MAAM;CAK9E;AACD;;;GAGG;AACH,qBAAa,eAAgB,SAAQ,4BAA4B;gBACnD,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY;IAGpD;;;OAGG;WACW,MAAM,CAAC,KAAK,EAAE,aAAa,GAAG,eAAe,GAAG,SAAS;IAOvE;;;OAGG;IACH,SAAS,CAAC,cAAc,CAAC,SAAS,EAAE,QAAQ;IAI5C;;;OAGG;IACH,SAAS,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ;IAG9C;;;;OAIG;IACI,6BAA6B,CAAC,SAAS,EAAE,QAAQ,GAAG,SAAS,GAAG,MAAM;CAK9E"}

package/lib/topology/HalfEdgeMarkSet.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgeMarkSet.js","sourceRoot":"","sources":["../../src/topology/HalfEdgeMarkSet.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F,mCAAgE;AAEhE;;GAEG;AACH;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAsB,4BAA4B;IAKhD,YAAsB,KAAoB,EAAE,IAAkB;QAC5D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IACD;;;OAGG;IACI,KAAK;QACV,OAAO,SAAS,KAAK,IAAI,CAAC,kBAAkB,EAAE,GAAG;SAChD;IACH,CAAC;IAED;;;OAGG;IACI,SAAS;QACd,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,WAAW,EAAE;YACxC,IAAI,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,CAAC,EAAE,CAAC;SAC1C;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;OAIG;IACI,gBAAgB;QACrB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;IACjC,CAAC;IACD,+CAA+C;IAC/C,IAAW,KAAK,KAAoB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAEzD,uDAAuD;IAChD,QAAQ;QACb,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,2BAA2B;IAC7B,CAAC;IACD,uEAAuE;IACvE,IAAW,IAAI,KAAmB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEtD,4FAA4F;IAClF,YAAY;QACpB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACI,UAAU,CAAC,KAAa;QAC7B,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;YACjD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAC1C,IAAI,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;gBACjC,OAAO,SAAS,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,QAAQ,CAAC,SAAmB;QACjC,IAAI,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;YACjC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACjC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACI,gBAAgB,CAAC,SAAmB;QACzC,OAAO,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IACD;;;;;;;;OAQG;IACI,aAAa,CAAC,SAAmB;QACtC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC;YAClC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,kBAAkB;QACvB,SAAU;YACR,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,SAAS;gBACZ,OAAO,SAAS,CAAC;YACnB,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC;gBAC/B,OAAO,SAAS,CAAC;SACpB;IACH,CAAC;IAkBD,+CAA+C;IACxC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAiC,OAAO,IAAI,+BAA+B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5G;;;OAGG;IACI,aAAa,CAAC,IAAc;QACjC,IAAI,CAAC,GAAG,IAAI,CAAC;QACb,GAAG;YACD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC;SACrB,QAAQ,CAAC,KAAK,IAAI,EAAE;IACvB,CAAC;IAED;;;OAGG;IACI,eAAe,CAAC,IAAc;QACnC,IAAI,CAAC,GAAG,IAAI,CAAC;QACb,GAAG;YACD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC;SACvB,QAAQ,CAAC,KAAK,IAAI,EAAE;IACvB,CAAC;CACF;AAxKD,oEAwKC;AAED;;;GAGG;AACH,MAAa,gBAAiB,SAAQ,4BAA4B;IAChE,YAAY,KAAoB,EAAE,IAAkB;QAClD,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,KAAoB;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,oBAAY,CAAC,SAAS;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACO,cAAc,CAAC,SAAmB;QAC1C,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACO,gBAAgB,CAAC,SAAmB;QAC5C,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IACD;;;;;OAKG;IACI,6BAA6B,CAAC,SAA+B;QAClE,IAAI,CAAC,SAAS;YACZ,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAzCD,4CAyCC;AAED;;;GAGG;AACH,MAAa,aAAc,SAAQ,4BAA4B;IAC7D,YAAY,KAAoB,EAAE,IAAkB;QAClD,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,KAAoB;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,oBAAY,CAAC,SAAS;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACO,cAAc,CAAC,SAAmB;QAC1C,SAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACO,gBAAgB,CAAC,SAAmB;QAC5C,SAAS,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;IACD;;;;OAIG;IACI,6BAA6B,CAAC,SAA+B;QAClE,IAAI,CAAC,SAAS;YACZ,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAxCD,sCAwCC;AAED;;;GAGG;AACH,MAAa,aAAc,SAAQ,4BAA4B;IAC7D,YAAY,KAAoB,EAAE,IAAkB;QAClD,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,KAAoB;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,oBAAY,CAAC,SAAS;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACO,cAAc,CAAC,SAAmB;QAC1C,SAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACO,gBAAgB,CAAC,SAAmB;QAC5C,SAAS,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;IACD;;;;OAIG;IACI,6BAA6B,CAAC,SAA+B;QAClE,IAAI,CAAC,SAAS;YACZ,OAAO,CAAC,CAAC;QACX,OAAO,SAAS,CAAC,oBAAoB,EAAE,CAAC;IAC1C,CAAC;CACF;AAxCD,sCAwCC;AACD;;;GAGG;AACH,MAAa,eAAgB,SAAQ,4BAA4B;IAC/D,YAAY,KAAoB,EAAE,IAAkB;QAClD,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,KAAoB;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,IAAI,KAAK,oBAAY,CAAC,SAAS;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACO,cAAc,CAAC,SAAmB;QAC1C,SAAS,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACO,gBAAgB,CAAC,SAAmB;QAC5C,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC;IACD;;;;OAIG;IACI,6BAA6B,CAAC,SAA+B;QAClE,IAAI,CAAC,SAAS;YACZ,OAAO,CAAC,CAAC;QACX,OAAO,SAAS,CAAC,sBAAsB,EAAE,CAAC;IAC5C,CAAC;CACF;AAxCD,0CAwCC;AAED;;;;;;GAMG;AACH,MAAM,+BAA+B;IAGnC,YAAmB,OAAqC;QACtD,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IAC1B,CAAC;IACM,IAAI;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;QAC3C,wDAAwD;QACxD,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,EAAE;YAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;YAC1D,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;SACpC;QACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAqC,CAAC;IAC7E,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAiC,OAAO,IAAI,CAAC,CAAC,CAAC;CACxE","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 { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n/**\r\n * A class to manage a set of edges as both (a) an array of possible members and (b) mask bits.\r\n * * A half edge is \"in the MarkSet\" if its mask is set.\r\n * * The MarkSet array is a superset of the half edges in the set.\r\n * * Entry of a HalfEdge into the set is indicated by both\r\n *    * adding the HalfEdge to the array\r\n *    * setting the mask on the half edge, edge, face, or vertex\r\n * * Half edges can \"go out of the MarkSet\" if the mask is cleared.\r\n *   * This clearing can happen independently of the array management.\r\n *   * Hence the array can contain half edges that are no longer in the MarkSet\r\n *   * the \"remove\" methods monitor this.\r\n * * Derived classes expand this concept for edge, vertex, or face MarkSets.\r\n *   * a single representative of an edge, vertex, or face is entered to the array\r\n *   * all edges around the edge, vertex, or face are marked with the mask\r\n *   * Hence the array contains one or more representatives of the edge, face, or vertex\r\n * * This allows quick query for both:\r\n *   * Testing the mask gives constant time test of whether a HalfEdge is in the set\r\n *   * access through the array gives direct access to the HalfEdge pointers\r\n * @internal\r\n */\r\nexport abstract class AbstractHalfEdgeGraphMarkSet {\r\n  private _graph: HalfEdgeGraph;\r\n  private _candidates: HalfEdge[];\r\n  protected _mask: HalfEdgeMask;\r\n\r\n  protected constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask) {\r\n    this._graph = graph;\r\n    this._candidates = [];\r\n    this._mask = mask;\r\n    this._graph.clearMask(mask);\r\n  }\r\n  /** remove all nodes from the set.\r\n   * * This pops from the array, clearing masks as the pop.\r\n   * * Note that it does NOT walk the entire graph to clear masks.\r\n   */\r\n  public clear() {\r\n    for (; undefined !== this.chooseAndRemoveAny();) {\r\n    }\r\n  }\r\n\r\n  /**\r\n   * count the number of active members.\r\n   * * This is the number of HalfEdges which are (a) in the array and (b) masked.\r\n   */\r\n  public getLength(): number {\r\n    let n = 0;\r\n    for (const candidate of this._candidates) {\r\n      if (candidate.isMaskSet(this._mask)) n++;\r\n    }\r\n    return n;\r\n  }\r\n  /**\r\n   * Return the number of candidates.\r\n   * * This may be more than `getLength ()`\r\n   * * This will typically only be called by the iterator.\r\n   */\r\n  public getNumCandidates(): number {\r\n    return this._candidates.length;\r\n  }\r\n  /** Read property accessor: return the graph */\r\n  public get graph(): HalfEdgeGraph { return this._graph; }\r\n\r\n  /** return borrowed assets (the mask!) to the graph. */\r\n  public teardown() {\r\n    this._graph.dropMask(this._mask);\r\n    this._candidates.length = 0;\r\n    // this._graph = undefined;\r\n  }\r\n  /** (Read property) return the mask used to mark members of the set. */\r\n  public get mask(): HalfEdgeMask { return this._mask; }\r\n\r\n  /** pop and return the last node out of the array, without testing if it is still marked. */\r\n  protected popAndReturn(): HalfEdge | undefined {\r\n    const n = this._candidates.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    const node = this._candidates[n - 1];\r\n    this._candidates.pop();\r\n    return node;\r\n  }\r\n\r\n  /**\r\n   * * read at an index in the candidates array.\r\n   * * if that candidate has the mask, return it.\r\n   * * otherwise return undefined.\r\n   * * REMARK: This is only to be called by the iterator.\r\n   */\r\n  public getAtIndex(index: number): HalfEdge | undefined {\r\n    if (index >= 0 && index < this._candidates.length) {\r\n      const candidate = this._candidates[index];\r\n      if (candidate.isMaskSet(this._mask))\r\n        return candidate;\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /** Add a node to the set.  This means\r\n   * * Set the mask\r\n   * * push the node on the array\r\n   * * (BUT!) If the node already has the mask, do nothing.\r\n   * * This base class method affects only the single given HalfEdge.\r\n   * * Derived classes for edge, face, and vertex will override this method and also set the mask around the larger structures.\r\n   * @returns true if the HalfEdge is a new member of the set, false if it was already in the set.\r\n   */\r\n  public addToSet(candidate: HalfEdge) {\r\n    if (candidate.isMaskSet(this._mask))\r\n      return false;\r\n    this._candidates.push(candidate);\r\n    this.setMaskInScope(candidate);\r\n    return true;\r\n  }\r\n  /** Test if `candidate` is already in the set.\r\n   * * This examines only the mask.\r\n   */\r\n  public isCandidateInSet(candidate: HalfEdge): boolean {\r\n    return candidate.isMaskSet(this._mask);\r\n  }\r\n  /**\r\n   * * If the candidate is not marked as a member of the MarkSet, do nothing.\r\n   * * If the candidate is marked:\r\n   *   * clear the mask\r\n   *   * but do NOT search the array.\r\n   *   * As the array is searched, the candidate will appear and be ignored because the mask is not set.\r\n   * @param candidate\r\n   * @return true if the candidate was a member (an hence removed), false if the candidate was not masked.\r\n   */\r\n  public removeFromSet(candidate: HalfEdge): boolean {\r\n    if (!candidate.isMaskSet(this._mask))\r\n      return false;\r\n    this.clearMaskInScope(candidate);\r\n    return true;\r\n  }\r\n  /**\r\n   *  * Search the array to find any current set member\r\n   *  * If found, clear its mask and return it.\r\n   *  * If unmasked HalfEdges are found in the array, they are removed from the array.\r\n   */\r\n  public chooseAndRemoveAny(): HalfEdge | undefined {\r\n    for (; ;) {\r\n      const candidate = this.popAndReturn();\r\n      if (!candidate)\r\n        return undefined;\r\n      if (this.removeFromSet(candidate))\r\n        return candidate;\r\n    }\r\n  }\r\n  /** Set mask on candidate -- i.e. edge, face, vertex, or single half edge as required.\r\n   * * Base class only changes the candidate mask.\r\n   * * Derived classes change more masks around edge, face, or vertex.\r\n   */\r\n  protected abstract setMaskInScope(candidate: HalfEdge | undefined): void;\r\n\r\n  /** Clear mask on candidate -- i.e. edge, face, vertex, or single half edge as required.\r\n   * * Base class only changes the candidate mask.\r\n   * * Derived classes change more masks around edge, face, or vertex.\r\n   */\r\n  protected abstract clearMaskInScope(candidate: HalfEdge | undefined): void;\r\n  /**\r\n   * Return the number of half edges that would be set/cleared when dealing with this candidate.\r\n   * * This is always 1 for HalfEdgeMarkSet\r\n   * @param candidate\r\n   */\r\n  public abstract countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number;\r\n  /** Create an iterator over member HalfEdges */\r\n  public [Symbol.iterator](): IterableIterator<HalfEdge> { return new IterableHalfEdgeMarkSetIterator(this); }\r\n  /**\r\n   * * visit all half edges around face.\r\n   * * Add each to mark set.\r\n   */\r\n  public addAroundFace(seed: HalfEdge): void {\r\n    let p = seed;\r\n    do {\r\n      this.addToSet(p);\r\n      p = p.faceSuccessor;\r\n    } while (p !== seed);\r\n  }\r\n\r\n  /**\r\n   * * visit all half edges around vertex.\r\n   * * Add each to mark set.\r\n   */\r\n  public addAroundVertex(seed: HalfEdge): void {\r\n    let p = seed;\r\n    do {\r\n      this.addToSet(p);\r\n      p = p.vertexSuccessor;\r\n    } while (p !== seed);\r\n  }\r\n}\r\n\r\n/**\r\n * AbstractHalfEdgeGraphMarkSet specialized to manage the masks on individual half edges\r\n * @internal\r\n */\r\nexport class MarkedHalfEdgeSt extends AbstractHalfEdgeGraphMarkSet {\r\n  constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask) {\r\n    super(graph, mask);\r\n  }\r\n  /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.\r\n   * * Returns undefined if unable to get a mask for the graph.\r\n   * * Undefined return can only happen if the caller is failing to return grabbed masks.\r\n   */\r\n  public static create(graph: HalfEdgeGraph): MarkedHalfEdgeSt | undefined {\r\n    const mask = graph.grabMask();\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return undefined;\r\n    return new MarkedHalfEdgeSt(graph, mask);\r\n  }\r\n\r\n  /**\r\n   * * Set mask on candidate's edge.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected setMaskInScope(candidate: HalfEdge) {\r\n    candidate.setMask(this._mask);\r\n  }\r\n\r\n  /**\r\n   * * Clear mask on candidate's edge.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected clearMaskInScope(candidate: HalfEdge) {\r\n    candidate.clearMask(this._mask);\r\n  }\r\n  /**\r\n   * Return the number of half edges that would be set/cleared when dealing with this candidate.\r\n   * * This is always 1 for EdgeMarkSet\r\n   * * return 0 for undefined candidate\r\n   * @param candidate\r\n   */\r\n  public countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number {\r\n    if (!candidate)\r\n      return 0;\r\n    return 1;\r\n  }\r\n}\r\n\r\n/**\r\n * AbstractHalfEdgeGraphMarkSet specialized to manage the mask on both sides of edges.\r\n * @internal\r\n */\r\nexport class MarkedEdgeSet extends AbstractHalfEdgeGraphMarkSet {\r\n  constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask) {\r\n    super(graph, mask);\r\n  }\r\n  /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.\r\n   * * Returns undefined if unable to get a mask for the graph.\r\n   * * Undefined return can only happen if the caller is failing to return grabbed masks.\r\n   */\r\n  public static create(graph: HalfEdgeGraph): MarkedEdgeSet | undefined {\r\n    const mask = graph.grabMask();\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return undefined;\r\n    return new MarkedEdgeSet(graph, mask);\r\n  }\r\n\r\n  /**\r\n   * * Set mask on candidate's edge.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected setMaskInScope(candidate: HalfEdge) {\r\n    candidate.setMaskAroundEdge(this._mask);\r\n  }\r\n\r\n  /**\r\n   * * Clear mask on candidate's edge.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected clearMaskInScope(candidate: HalfEdge) {\r\n    candidate.clearMaskAroundEdge(this._mask);\r\n  }\r\n  /**\r\n   * Return the number of half edges that would be set/cleared when dealing with this candidate.\r\n   * * This is always 2 for EdgeMarkSet\r\n   * @param candidate\r\n   */\r\n  public countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number {\r\n    if (!candidate)\r\n      return 0;\r\n    return 2;\r\n  }\r\n}\r\n\r\n/**\r\n * AbstractHalfEdgeGraphMarkSet specialized to manage the mask around faces\r\n * @internal\r\n */\r\nexport class MarkedFaceSet extends AbstractHalfEdgeGraphMarkSet {\r\n  constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask) {\r\n    super(graph, mask);\r\n  }\r\n  /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.\r\n   * * Returns undefined if unable to get a mask for the graph.\r\n   * * Undefined return can only happen if the caller is failing to return grabbed masks.\r\n   */\r\n  public static create(graph: HalfEdgeGraph): MarkedFaceSet | undefined {\r\n    const mask = graph.grabMask();\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return undefined;\r\n    return new MarkedFaceSet(graph, mask);\r\n  }\r\n\r\n  /**\r\n   * * Set mask on (all nodes around) candidate's face\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected setMaskInScope(candidate: HalfEdge) {\r\n    candidate.setMaskAroundFace(this._mask);\r\n  }\r\n\r\n  /**\r\n   * * Clear mask on (all nodes around) candidate's face.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected clearMaskInScope(candidate: HalfEdge) {\r\n    candidate.clearMaskAroundFace(this._mask);\r\n  }\r\n  /**\r\n   * Return the number of half edges that would be set/cleared when dealing with this candidate.\r\n   * * This is the \"aroundFace\" count.\r\n   * @param candidate\r\n   */\r\n  public countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number {\r\n    if (!candidate)\r\n      return 0;\r\n    return candidate.countEdgesAroundFace();\r\n  }\r\n}\r\n/**\r\n * AbstractHalfEdgeGraphMarkSet specialized to manage the mask around faces\r\n * @internal\r\n */\r\nexport class MarkedVertexSet extends AbstractHalfEdgeGraphMarkSet {\r\n  constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask) {\r\n    super(graph, mask);\r\n  }\r\n  /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.\r\n   * * Returns undefined if unable to get a mask for the graph.\r\n   * * Undefined return can only happen if the caller is failing to return grabbed masks.\r\n   */\r\n  public static create(graph: HalfEdgeGraph): MarkedVertexSet | undefined {\r\n    const mask = graph.grabMask();\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return undefined;\r\n    return new MarkedVertexSet(graph, mask);\r\n  }\r\n\r\n  /**\r\n   * * Set mask on (all nodes around) candidate's face\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected setMaskInScope(candidate: HalfEdge) {\r\n    candidate.setMaskAroundVertex(this._mask);\r\n  }\r\n\r\n  /**\r\n   * * Clear mask on (all nodes around) candidate's face.\r\n   * * This overrides the base class implementation.\r\n   */\r\n  protected clearMaskInScope(candidate: HalfEdge) {\r\n    candidate.clearMaskAroundVertex(this._mask);\r\n  }\r\n  /**\r\n   * Return the number of half edges that would be set/cleared when dealing with this candidate.\r\n   * * This is the \"aroundVertex\" count.\r\n   * @param candidate\r\n   */\r\n  public countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number {\r\n    if (!candidate)\r\n      return 0;\r\n    return candidate.countEdgesAroundVertex();\r\n  }\r\n}\r\n\r\n/**\r\n * Class to act as an iterator over points in a markSet.\r\n * * Internal data is:\r\n *   * pointer to the parent markSet\r\n *   * index of index of the next point to read.\r\n * * the parent markSet class\r\n */\r\nclass IterableHalfEdgeMarkSetIterator implements Iterator<HalfEdge> {\r\n  private _markSet: AbstractHalfEdgeGraphMarkSet;\r\n  private _nextReadIndex: number;\r\n  public constructor(markSet: AbstractHalfEdgeGraphMarkSet) {\r\n    this._markSet = markSet;\r\n    this._nextReadIndex = 0;\r\n  }\r\n  public next(): IteratorResult<HalfEdge> {\r\n    const n = this._markSet.getNumCandidates();\r\n    // Walk over candidates that have been quietly de-masked\r\n    while (this._nextReadIndex < n) {\r\n      const p = this._markSet.getAtIndex(this._nextReadIndex++);\r\n      if (p !== undefined)\r\n        return { done: false, value: p };\r\n    }\r\n    return { done: true, value: undefined } as any as IteratorResult<HalfEdge>;\r\n  }\r\n\r\n  public [Symbol.iterator](): IterableIterator<HalfEdge> { return this; }\r\n}\r\n"]}

package/lib/topology/HalfEdgeNodeXYZUV.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgeNodeXYZUV.d.ts","sourceRoot":"","sources":["../../src/topology/HalfEdgeNodeXYZUV.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEnC;;GAEG;AACH;;;GAGG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,KAAK,CAAW;IACxB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IAEnB,OAAO;IAKP;;OAEG;IACI,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,SAAS;IAOrF,OAAO,CAAC,KAAK,EAAE,SAAS;IAM/B;;;OAGG;WACW,sBAAsB,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS;IAa/F,uBAAuB;IACvB,IAAW,IAAI,IAAI,QAAQ,CAAuB;IAClD,8BAA8B;IAC9B,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,oFAAoF;IAC7E,eAAe,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAGjD,iFAAiF;IAC1E,cAAc,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAEhD,sDAAsD;IAC/C,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAOrD,sDAAsD;IAC/C,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;CAOtD"}

package/lib/topology/HalfEdgeNodeXYZUV.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgeNodeXYZUV.js","sourceRoot":"","sources":["../../src/topology/HalfEdgeNodeXYZUV.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F,0CAAuC;AACvC,mEAAwD;AACxD,mEAAwD;AAIxD;;GAEG;AACH;;;GAGG;AACH,MAAa,SAAS;IAQpB,YAAoB,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS;QACvF,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IACD;;OAEG;IACI,GAAG,CAAC,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS;QAC9E,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,OAAO,CAAC,KAAgB;QAC7B,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;IAE1B,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAc,EAAE,GAAU,EAAE,MAAkB;QACjF,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,mBAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9E,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,uBAAuB;IACvB,IAAW,IAAI,KAAe,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAClD,8BAA8B;IAC9B,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,8BAA8B;IAC9B,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,oFAAoF;IAC7E,eAAe,CAAC,MAAgB;QACrC,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC;IACD,iFAAiF;IAC1E,cAAc,CAAC,MAAgB,IAAa,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAErG,sDAAsD;IAC/C,SAAS,CAAC,MAAc,EAAE,GAAW;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;QAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG;YACxB,OAAO,CAAC,CAAC;QACX,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,sDAAsD;IAC/C,SAAS,CAAC,MAAc,EAAE,GAAW;QAC1C,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG;YACxB,OAAO,CAAC,CAAC;QACX,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;CAEF;AAjFD,8BAiFC","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 { Point2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { HalfEdge } from \"./Graph\";\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n/**\r\n * Reference to a HalfEdge node with extra XYZ and UV data.\r\n * @internal\r\n */\r\nexport class NodeXYZUV {\r\n  private _node: HalfEdge;\r\n  private _x: number;\r\n  private _y: number;\r\n  private _z: number;\r\n  private _u: number;\r\n  private _v: number;\r\n\r\n  private constructor(node: HalfEdge, x: number, y: number, z: number, u: number, v: number) {\r\n    this._x = x; this._y = y; this._z = z;\r\n    this._u = u; this._v = v;\r\n    this._node = node;\r\n  }\r\n  /** Set all content directly from args.\r\n   * @returns `this` reference\r\n   */\r\n  public set(node: HalfEdge, x: number, y: number, z: number, u: number, v: number): NodeXYZUV {\r\n    this._x = x; this._y = y; this._z = z;\r\n    this._u = u; this._v = v;\r\n    this._node = node;\r\n    return this;\r\n  }\r\n\r\n  public setFrom(other: NodeXYZUV) {\r\n    this._x = other.x; this._y = other.y; this._z = other.z;\r\n    this._u = other.u; this._v = other.v;\r\n    this._node = other.node;\r\n\r\n  }\r\n  /** Create a `NodeXYZUV` with\r\n   * * x,y,z at ray origin\r\n   * * u,v as dotXY and crossXY for the ray direction with x,y distances from the ray origin.\r\n   */\r\n  public static createNodeAndRayOrigin(node: HalfEdge, ray: Ray3d, result?: NodeXYZUV): NodeXYZUV {\r\n    const x = node.x;\r\n    const y = node.y;\r\n    const z = node.z;\r\n    const dx = x - ray.origin.x;\r\n    const dy = y - ray.origin.y;\r\n    const u = Geometry.dotProductXYXY(dx, dy, ray.direction.x, ray.direction.y);\r\n    const v = Geometry.crossProductXYXY(ray.direction.x, ray.direction.y, dx, dy);\r\n    if (result)\r\n      return result.set(node, x, y, z, u, v);\r\n    return new NodeXYZUV(node, x, y, z, u, v);\r\n  }\r\n\r\n  /** Access the node. */\r\n  public get node(): HalfEdge { return this._node; }\r\n  /** Access the x coordinate */\r\n  public get x(): number { return this._x; }\r\n  /** Access the y coordinate */\r\n  public get y(): number { return this._y; }\r\n  /** Access the z coordinate */\r\n  public get z(): number { return this._z; }\r\n  /** Access the u coordinate */\r\n  public get u(): number { return this._u; }\r\n  /** Access the v coordinate */\r\n  public get v(): number { return this._v; }\r\n  /** Access the x,y,z coordinates as Point3d with optional caller-supplied result. */\r\n  public getXYZAsPoint3d(result?: Point3d): Point3d {\r\n    return Point3d.create(this._x, this._y, this._z, result);\r\n  }\r\n  /** Access the uv coordinates as Point2d with optional caller-supplied result. */\r\n  public getUVAsPoint2d(result?: Point2d): Point2d { return Point2d.create(this._u, this._v, result); }\r\n\r\n  /** Toleranced comparison function for u coordinate */\r\n  public classifyU(target: number, tol: number): number {\r\n    const delta = this.u - target;\r\n    if (Math.abs(delta) <= tol)\r\n      return 0;\r\n    return delta >= 0 ? 1 : -1;\r\n  }\r\n\r\n  /** Toleranced comparison function for v coordinate */\r\n  public classifyV(target: number, tol: number): number {\r\n    const delta = target - this._v;\r\n    if (Math.abs(delta) <= tol)\r\n      return 0;\r\n    return delta >= 0 ? 1 : -1;\r\n  }\r\n\r\n}\r\n"]}

package/lib/topology/HalfEdgePointInGraphSearch.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgePointInGraphSearch.d.ts","sourceRoot":"","sources":["../../src/topology/HalfEdgePointInGraphSearch.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEnC,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAGlE,oBAAY,iBAAiB;IAC3B,SAAS,IAAA;IACT,iBAAiB,IAAA;IACjB,eAAe,IAAA;IACf,UAAU,IAAA;IACV,eAAe,IAAA;IACf,cAAc,IAAA;CACf;AAGD,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO;WAGO,MAAM,CAAC,GAAG,GAAE,MAAqC;IAG/D,OAAO,CAAC,KAAK;IAKN,aAAa,CAClB,OAAO,EAAE,sBAAsB,EAC/B,GAAG,EAAE,KAAK,EACV,cAAc,EAAE,MAAM,GAAG,sBAAsB;IAgE1C,eAAe,CACpB,UAAU,EAAE,sBAAsB,EAClC,GAAG,EAAE,KAAK,EACV,cAAc,EAAE,MAAM,GAAG,sBAAsB;IAyD1C,eAAe,CACpB,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,KAAK,EACV,cAAc,EAAE,MAAM,EAAG,8BAA8B;IACvD,UAAU,EAAE,sBAAsB,EAAI,gEAAgE;IACtG,UAAU,EAAE,sBAAsB,GAAG,iBAAiB;IAoExD;;;;;;;;OAQG;IACI,YAAY,CAAC,KAAK,EAAE,sBAAsB,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,GAAG,OAAO;CASzF"}

package/lib/topology/HalfEdgePointInGraphSearch.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgePointInGraphSearch.js","sourceRoot":"","sources":["../../src/topology/HalfEdgePointInGraphSearch.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,mEAAkE;AAGlE,2DAAgD;AAChD,qEAAkE;AAElE,yDAAyD;AACzD,IAAY,iBAOX;AAPD,WAAY,iBAAiB;IAC3B,mEAAS,CAAA;IACT,mFAAiB,CAAA;IACjB,+EAAe,CAAA;IACf,qEAAU,CAAA;IACV,+EAAe,CAAA;IACf,6EAAc,CAAA;AAChB,CAAC,EAPW,iBAAiB,GAAjB,yBAAiB,KAAjB,yBAAiB,QAO5B;AACD,wDAAwD;AAExD,MAAa,kBAAkB;IAE7B,YAAoB,GAAW;QAC7B,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,MAAc,mBAAQ,CAAC,mBAAmB;QAC7D,OAAO,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IACO,KAAK;QACX,OAAO,+CAAsB,CAAC,MAAM,EAAE,CAAC;IACzC,CAAC;IACD,8BAA8B;IAC9B,uCAAuC;IAChC,aAAa,CAClB,OAA+B,EAC/B,GAAU,EACV,cAAsB;QACtB,MAAM,KAAK,GAAG,OAAO,CAAC,IAAK,CAAC;QAC5B,MAAM,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC3D,MAAM,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACpE,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,MAAM,CAAC;QACX,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,EAAE;YACrB,0CAA0C;YAC1C,IAAI,KAAK,GAAG,CAAC,EAAE;gBACb,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;aAC1C;iBAAM;gBACL,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;aAC1C;SACF;aAAM,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;YACrC,+DAA+D;YAE/D,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1D,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1D,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;gBAC/B,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aACnB;iBAAM,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;gBACtC,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aACnB;iBAAM,IAAI,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE;gBAC9B,wBAAwB;gBACxB,wEAAwE;gBACxE,0GAA0G;gBAE1G,MAAM,YAAY,GAAG,CAAC,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtE,MAAM,GAAG,OAAO,CAAC,sBAAsB,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBAClE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aACnB;iBAAM,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE;gBACnC,gDAAgD;gBAChD,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;oBACnB,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;;oBAE3C,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;aAC9C;iBAAM;gBACL,yFAAyF;gBACzF,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI;uBAC5B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAChC;oBACA,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY;iBACzD;qBAAM,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI;uBACnC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAChC;oBACA,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;iBAC5C;qBAAM;oBACL,OAAO,CAAC,cAAc,EAAE,CAAC;oBACzB,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;iBACvB;aACF;SACF;aAAM;YACL,gGAAgG;YAChG,OAAO,CAAC,cAAc,EAAE,CAAC;YACzB,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;SACvB;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,kFAAkF;IAClF,uDAAuD;IAChD,eAAe,CACpB,UAAkC,EAClC,GAAU,EACV,cAAsB;QACtB,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC;QACnC,IAAI,MAAM,CAAC;QACX,IAAI,YAAY,GAAG,UAAW,CAAC;QAC/B,GAAG;YACD,oBAAoB;YACpB,2CAA2C;YAC3C,MAAM,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,YAAY,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;YAChF,MAAM,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,YAAY,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;YAClF,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,6BAA6B;YAC7B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE;gBAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,cAAc,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE;oBAC7C,wBAAwB;oBACxB,MAAM,GAAG,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAC9C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAClB,OAAO,MAAM,CAAC;iBACf;qBAAM,IAAI,EAAE,GAAG,cAAc,EAAE;oBAC9B,yBAAyB;oBACzB,MAAM,YAAY,GAAG,cAAc,GAAG,EAAE,CAAC;oBACzC,MAAM,GAAG,UAAU,CAAC,sBAAsB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;oBACvE,OAAO,MAAM,CAAC;iBACf;qBAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;oBACpC,yEAAyE;oBACzE,MAAM,GAAG,UAAU,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;oBAChD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAClB,OAAO,MAAM,CAAC;iBACf;qBAAM,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE;oBACzB,yBAAyB;oBACzB,6CAA6C;oBAC7C,MAAM,GAAG,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAC9C,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,kDAAkD;oBAClD,qEAAqE;oBACrE,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE;wBAClB,MAAM,GAAG,UAAU,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;wBAC5D,OAAO,MAAM,CAAC;qBACf;iBACF;aACF;iBAAM,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;gBAC1B,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE;oBAClB,6CAA6C;oBAC7C,MAAM,GAAG,UAAU,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;oBAC5D,OAAO,MAAM,CAAC;iBACf;aACF;YACD,sCAAsC;YACtC,YAAY,GAAG,YAAY,CAAC,eAAe,CAAC;SAC7C,QAAQ,YAAY,KAAK,UAAU,EAAE;QACtC,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,+BAA+B;IAC/B,sFAAsF;IAC/E,eAAe,CACpB,QAAkB,EAClB,GAAU,EACV,cAAsB,EAAG,8BAA8B;IACvD,UAAkC,EAAI,gEAAgE;IACtG,UAAkC;QAElC,UAAU,CAAC,uBAAuB,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtD,UAAU,CAAC,uBAAuB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC9D,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,GAAG;YACD,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YAC5D,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE;gBAC5B,iBAAiB;gBACjB,MAAM,SAAS,GAAG,+CAAsB,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBAC7D,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACtB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,cAAc,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE;oBAC7C,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,OAAO,iBAAiB,CAAC,iBAAiB,CAAC;iBAC5C;gBACD,IAAI,EAAE,GAAG,cAAc,IAAI,EAAE,GAAG,UAAU,CAAC,OAAO,EAAG;oBACnD,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAChC,IAAI,EAAE,GAAG,cAAc,IAAI,EAAE,GAAG,UAAU,CAAC,OAAO,EAAG;oBACnD,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;aACjC;iBAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;gBACxB,oBAAoB;gBACpB,MAAM,YAAY,GAAG,CAAE,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACtC,MAAM,KAAK,GAAG,mBAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC;gBACzD,MAAM,OAAO,GAAG,+CAAsB,CAAC,oBAAoB,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBACtF,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBACvB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,cAAc,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;oBACjD,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,OAAO,iBAAiB,CAAC,eAAe,CAAC;iBAC1C;gBACD,IAAI,KAAK,GAAG,cAAc,IAAI,KAAK,GAAG,UAAU,CAAC,OAAO,EAAG,EAAE;oBAC3D,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,UAAU,CAAC,OAAO,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBACvC;gBACD,IAAI,KAAK,GAAG,cAAc,IAAI,KAAK,GAAG,UAAU,CAAC,OAAO,EAAG,EAAE;oBAC3D,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;iBAC3B;aACF;YACD,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACrB,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;SAC7B,QAAQ,KAAK,KAAK,QAAQ,EAAE;QAE7B,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC;QACtC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,UAAU,CAAC,cAAc,EAAE;YAC7B,IAAI,UAAU,CAAC,cAAc;gBAC3B,OAAO,iBAAiB,CAAC,SAAS,CAAC;YACrC,OAAO,iBAAiB,CAAC,eAAe,CAAC;SAC1C;QACD,IAAI,UAAU,CAAC,cAAc;eACxB,CAAC,UAAU,CAAC,MAAM,IAAI,QAAQ,IAAI,QAAQ,GAAG,CAAC,CAAC,EAAE;YACpD,OAAO,iBAAiB,CAAC,cAAc,CAAC;SACzC;aAAM;YACL,OAAO,iBAAiB,CAAC,UAAU,CAAC;SACrC;IACH,CAAC;IAED,yCAAyC;IACzC;;;;;;;;OAQG;IACI,YAAY,CAAC,KAA6B,EAAE,MAAe,EAAE,GAAU;QAC5E,GAAG,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACjC,0BAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3D,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,MAAM,gBAAgB,GAAG,GAAG,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;QACrD,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAClC,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACtC,OAAO,gBAAgB,IAAI,IAAI,CAAC,IAAI,CAAC;IACvC,CAAC;CACF;AAvOD,gDAuOC","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 Topology\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { HalfEdge } from \"./Graph\";\nimport { NodeXYZUV } from \"./HalfEdgeNodeXYZUV\";\nimport { HalfEdgePositionDetail } from \"./HalfEdgePositionDetail\";\n\n/* eslint-disable @typescript-eslint/naming-convention */\nexport enum RayClassification {\n  RC_NoHits,\n  RC_TargetOnVertex,\n  RC_TargetOnEdge,\n  RC_Bracket,\n  RC_TargetBefore,\n  RC_TargetAfter,\n}\n/* eslint-enable @typescript-eslint/naming-convention */\n\nexport class PointSearchContext {\n  private _tol: number;\n  private constructor(tol: number) {\n    this._tol = tol;\n  }\n  public static create(tol: number = Geometry.smallMetricDistance) {\n    return new PointSearchContext(tol);\n  }\n  private panic(): HalfEdgePositionDetail {\n    return HalfEdgePositionDetail.create();\n  }\n  // From given edge start point\n  // The edgeHit is reused as the result.\n  public reAimFromEdge(\n    edgeHit: HalfEdgePositionDetail,\n    ray: Ray3d,\n    targetDistance: number): HalfEdgePositionDetail {\n    const nodeA = edgeHit.node!;\n    const dataA = NodeXYZUV.createNodeAndRayOrigin(nodeA, ray);\n    const dataB = NodeXYZUV.createNodeAndRayOrigin(nodeA.edgeMate, ray);\n    const sideA = -dataA.classifyV(0.0, this._tol);\n    const sideB = -dataB.classifyV(0.0, this._tol);\n    let result;\n    if (sideA * sideB < 0) {\n      // Simple crossing -- just aim into a face\n      if (sideA > 0) {\n        result = edgeHit.resetAsFace(dataA.node);\n      } else {\n        result = edgeHit.resetAsFace(dataB.node);\n      }\n    } else if (sideA === 0 || sideB === 0) {\n      // The usual case is both 0 i.e. ray is clearly along the edge.\n\n      const alongA = dataA.classifyU(targetDistance, this._tol);\n      const alongB = dataB.classifyU(targetDistance, this._tol);\n      if (alongA === 0 && sideA === 0) {\n        result = edgeHit.resetAsVertex(dataA.node);\n        result.setITag(1);\n      } else if (alongB === 0 && sideB === 0) {\n        result = edgeHit.resetAsVertex(dataB.node);\n        result.setITag(1);\n      } else if (alongA * alongB < 0) {\n        // target is within edge\n        // (.. This is written for the case where both sideA and sideB are zero.\n        //    If only one is zero, this computes a close edge point but the strong \"on\" conclusion might be wrong)\n\n        const edgeFraction = (targetDistance - dataA.u) / (dataB.u - dataA.u);\n        result = edgeHit.resetAtEdgeAndFraction(dataA.node, edgeFraction);\n        result.setITag(1);\n      } else if (alongA < 0 && alongB < 0) {\n        // target is beyond the edge -- move towards it.\n        if (dataA.u > dataB.u)\n          result = edgeHit.resetAsVertex(dataA.node);\n        else\n          result = edgeHit.resetAsVertex(dataB.node);\n      } else {\n        // This shouldn't happen -- maybe as if the initial edge point was not within the edge???\n        if (Math.abs(dataA.u) < this._tol\n          && Math.abs(dataA.v) < this._tol\n        ) {\n          result = edgeHit.resetAsVertex(dataA.node); // , dataA);\n        } else if (Math.abs(dataB.u) < this._tol\n          && Math.abs(dataB.v) < this._tol\n        ) {\n          result = edgeHit.resetAsVertex(dataB.node);\n        } else {\n          edgeHit.resetAsUnknown();\n          result = this.panic();\n        }\n      }\n    } else {\n      // Both vertices are to same side of the line.   This can't happen for edge point between nodes.\n      edgeHit.resetAsUnknown();\n      result = this.panic();\n    }\n    return result;\n  }\n\n  // From given edge start point, pick vertex or edge side for proceeding along ray.\n  // RAY IS ASSUMED TO START AT THE VERTEX PRECISELY !!!!\n  public reAimFromVertex(\n    searchBase: HalfEdgePositionDetail,\n    ray: Ray3d,\n    targetDistance: number): HalfEdgePositionDetail {\n    const vertexNode = searchBase.node;\n    let result;\n    let outboundEdge = vertexNode!;\n    do {\n      // DPoint3d xyzBase;\n      // vu_getDPoint3d(& xyzBase, outboundEdge);\n      const data0 = NodeXYZUV.createNodeAndRayOrigin(outboundEdge.faceSuccessor, ray);\n      const data1 = NodeXYZUV.createNodeAndRayOrigin(outboundEdge.facePredecessor, ray);\n      const u0 = data0.u;\n      // double u1 = data1.GetU ();\n      const v0 = data0.v;\n      const v1 = data1.v;\n      if (Math.abs(v0) < this._tol) {\n        if (Math.abs(u0 - targetDistance) < this._tol) {\n          // Direct hit at far end\n          result = searchBase.resetAsVertex(data0.node);\n          result.setITag(1);\n          return result;\n        } else if (u0 > targetDistance) {\n          // Direct hig within edge\n          const edgeFraction = targetDistance / u0;\n          result = searchBase.resetAtEdgeAndFraction(outboundEdge, edgeFraction);\n          return result;\n        } else if (Math.abs(u0) <= this._tol) {\n          // Unexpected direct hit on the base of the search, but call it a hit....\n          result = searchBase.resetAsVertex(outboundEdge);\n          result.setITag(1);\n          return result;\n        } else if (u0 > this._tol) {\n          // Advance to vertex  ...\n          // double edgeFraction = targetDistance / u0;\n          result = searchBase.resetAsVertex(data0.node);\n          return result;\n        } else {\n          // Search direction is exactly opposite this edge.\n          // See if the other side of the sector is turned even beyond that ...\n          if (v1 > this._tol) {\n            result = searchBase.resetAsFace(outboundEdge, outboundEdge);\n            return result;\n          }\n        }\n      } else if (v0 < -this._tol) {\n        if (v1 > this._tol) {\n          // The usual simple entry into an angle < 180\n          result = searchBase.resetAsFace(outboundEdge, outboundEdge);\n          return result;\n        }\n      }\n      // NEEDS WORK: angle >= 180 cases !!!!\n      outboundEdge = outboundEdge.vertexSuccessor;\n    } while (outboundEdge !== vertexNode);\n    return this.panic();\n  }\n\n  // Visit all edges around face.\n  // reset lastBefore and firstAfter describing progress towards target distance on ray.\n  public reAimAroundFace(\n    faceNode: HalfEdge,\n    ray: Ray3d,\n    targetDistance: number,  // !< distance to target point\n    lastBefore: HalfEdgePositionDetail,   // CALLER CREATED -- reset as first hit on negative side of ray.\n    firstAfter: HalfEdgePositionDetail): RayClassification {  // ! CALLER CREATED -- reset as first hit on positive side of ray.\n\n    lastBefore.resetAsUndefinedWithTag(-Number.MAX_VALUE);\n    firstAfter.resetAsUndefinedWithTag(Number.MAX_VALUE);\n    const data0 = NodeXYZUV.createNodeAndRayOrigin(faceNode, ray);\n    let data1;\n    let node0 = faceNode;\n    do {\n      const node1 = node0.faceSuccessor;\n      data1 = NodeXYZUV.createNodeAndRayOrigin(node1, ray, data1);\n      const u0 = data0.u;\n      const u1 = data1.u;\n      const v0 = data0.v;\n      const v1 = data1.v;\n      if (Math.abs(v1) < this._tol) {\n        // Vertex hit ...\n        const vertexHit = HalfEdgePositionDetail.createVertex(node1);\n        vertexHit.setDTag(u1);\n        if (Math.abs(u1 - targetDistance) < this._tol) {\n          firstAfter.setFrom(vertexHit);\n          lastBefore.setFrom(vertexHit);\n          return RayClassification.RC_TargetOnVertex;\n        }\n        if (u1 > targetDistance && u1 < firstAfter.getDTag()!)\n          firstAfter.setFrom(vertexHit);\n        if (u1 < targetDistance && u1 > lastBefore.getDTag()!)\n          lastBefore.setFrom(vertexHit);\n      } else if (v0 * v1 < 0.0) {\n        // Edge Crossing ...\n        const edgeFraction = - v0 / (v1 - v0);\n        const uEdge = Geometry.interpolate(u0, edgeFraction, u1);\n        const edgeHit = HalfEdgePositionDetail.createEdgeAtFraction(data0.node, edgeFraction);\n        edgeHit.setDTag(uEdge);\n        if (Math.abs(uEdge - targetDistance) <= this._tol) {\n          firstAfter.setFrom(edgeHit);\n          lastBefore.setFrom(edgeHit);\n          return RayClassification.RC_TargetOnEdge;\n        }\n        if (uEdge > targetDistance && uEdge < firstAfter.getDTag()!) {\n          firstAfter.setFrom(edgeHit);\n          firstAfter.setITag(v0 > 0.0 ? -1 : 1);\n        }\n        if (uEdge < targetDistance && uEdge > lastBefore.getDTag()!) {\n          lastBefore.setFrom(edgeHit);\n          lastBefore.setDTag(uEdge);\n        }\n      }\n      data0.setFrom(data1);\n      node0 = node0.faceSuccessor;\n    } while (node0 !== faceNode);\n\n    const afterTag = firstAfter.getITag();\n    firstAfter.setITag(0);\n    lastBefore.setITag(0);\n    if (lastBefore.isUnclassified) {\n      if (firstAfter.isUnclassified)\n        return RayClassification.RC_NoHits;\n      return RayClassification.RC_TargetBefore;\n    }\n    if (firstAfter.isUnclassified\n      || (firstAfter.isEdge && afterTag && afterTag < 0)) {\n      return RayClassification.RC_TargetAfter;\n    } else {\n      return RayClassification.RC_Bracket;\n    }\n  }\n\n  // Return false if target is reached !!!!\n  /**\n   * Set (replace contents) ray with\n   * * `origin` at start\n   * * `direction` is unit vector from start towards target\n   * * `a` is distance from start to target.\n   * @param start existing position\n   * @param target target xy coordinates\n   * @param ray ray to update\n   */\n  public setSearchRay(start: HalfEdgePositionDetail, target: Point3d, ray: Ray3d): boolean {\n    ray.origin.setFromPoint3d(start);\n    Vector3d.createStartEnd(ray.origin, target, ray.direction);\n    ray.direction.z = 0.0;\n    const distanceToTarget = ray.direction.magnitudeXY();\n    ray.a = ray.direction.magnitude();\n    ray.direction.scaleInPlace(1 / ray.a);\n    return distanceToTarget >= this._tol;\n  }\n}\n"]}

package/lib/topology/HalfEdgePositionDetail.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgePositionDetail.d.ts","sourceRoot":"","sources":["../../src/topology/HalfEdgePositionDetail.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEnC;;GAEG;AACH,oBAAY,YAAY;IACtB,wBAAwB;IACxB,IAAI,IAAI;IACR,OAAO;IACP,MAAM,IAAI;IACV,IAAI,IAAI;IACR,IAAI,IAAI;CACT;AACD;;;;;GAKG;AACH,qBAAa,sBAAsB;IACjC,wBAAwB;IACxB,OAAO,CAAC,KAAK,CAAC,CAAW;IACzB,8BAA8B;IACvB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACjB,4FAA4F;IAC5F,OAAO,CAAC,aAAa,CAAC,CAAS;IAC/B,0DAA0D;IAC1D,OAAO,CAAC,KAAK,CAAe;IAC5B,qBAAqB;IACrB,OAAO,CAAC,KAAK,CAAC,CAAS;IACvB,sBAAsB;IACtB,OAAO,CAAC,KAAK,CAAC,CAAS;IACvB;;OAEG;IACH,OAAO;IASP,2CAA2C;IACpC,OAAO,CAAC,KAAK,EAAE,sBAAsB;IAU5C,gCAAgC;IACzB,cAAc;IAIrB,8BAA8B;WAChB,MAAM,IAAI,sBAAsB;IAIvC,OAAO,IAAI,MAAM,GAAG,SAAS;IAC7B,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAE5B,OAAO,IAAI,MAAM,GAAG,SAAS;IAC7B,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAC5B,OAAO,IAAI,YAAY;IAE9B,kHAAkH;WACpG,oBAAoB,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,GAAG,sBAAsB;IAQhG;;;OAGG;IACI,WAAW,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,sBAAsB;IAYzE;OACG;IACI,uBAAuB,CAAC,IAAI,EAAE,MAAM,GAAG,sBAAsB;IASpE;;;OAGG;IACI,sBAAsB,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,GAAG,sBAAsB;IAW3F;;OAEG;WACW,YAAY,CAAC,IAAI,EAAE,QAAQ,GAAG,sBAAsB;IAIlE;;OAEG;IACI,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,sBAAsB;IAM5D,8DAA8D;IACvD,cAAc,CAAC,IAAI,EAAE,QAAQ;IAKpC;;OAEG;IACH,IAAW,YAAY,IAAI,MAAM,GAAG,SAAS,CAE5C;IAED,mEAAmE;IACnE,IAAW,MAAM,IAAI,OAAO,CAA6C;IACzE,oEAAoE;IACpE,IAAW,MAAM,IAAI,OAAO,CAA6C;IACzE,iEAAiE;IACjE,IAAW,QAAQ,IAAI,OAAO,CAA+C;IAC7E,yEAAyE;IACzE,IAAW,cAAc,IAAI,OAAO,CAA6C;IAEjF,iDAAiD;IACjD,IAAW,IAAI,IAAI,QAAQ,GAAG,SAAS,CAAuB;IAC9D,wFAAwF;IACjF,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAkBrC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;CAI7C"}

package/lib/topology/HalfEdgePositionDetail.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgePositionDetail.js","sourceRoot":"","sources":["../../src/topology/HalfEdgePositionDetail.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AACvC,mEAAwD;AAIxD;;GAEG;AACH,IAAY,YAOX;AAPD,WAAY,YAAY;IACtB,wBAAwB;IACxB,+CAAQ,CAAA;IACR,OAAO;IACP,mDAAU,CAAA;IACV,+CAAQ,CAAA;IACR,+CAAQ,CAAA;AACV,CAAC,EAPW,YAAY,GAAZ,oBAAY,KAAZ,oBAAY,QAOvB;AACD;;;;;GAKG;AACH,MAAa,sBAAsB;IAejC;;OAEG;IACH,YAAoB,IAA0B,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,IAAkB,EAAE,YAAqB,EAAE,IAAa,EAAE,KAAc;QACvJ,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,2CAA2C;IACpC,OAAO,CAAC,KAA6B;QAC1C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC;QACzC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC3B,CAAC;IACD,gCAAgC;IACzB,cAAc;QACnB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;IACjC,CAAC;IACD,8BAA8B;IACvB,MAAM,CAAC,MAAM;QAClB,MAAM,MAAM,GAAG,IAAI,sBAAsB,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;QACjF,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,OAAO,KAAyB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,KAAa,IAAU,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;IAEpD,OAAO,KAAyB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,KAAa,IAAU,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;IACpD,OAAO,KAAmB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAErD,kHAAkH;IAC3G,MAAM,CAAC,oBAAoB,CAAC,IAAc,EAAE,YAAoB;QACrE,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC;QACjC,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,OAAO,IAAI,sBAAsB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IACpF,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,IAAe,EAAE,GAAY;QAC9C,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,IAAI;YACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,IAAI,GAAG,EAAE;YACP,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACf,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACf,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;OACG;IACI,uBAAuB,CAAC,IAAY;QACzC,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,sBAAsB,CAAC,IAAc,EAAE,YAAoB;QAChE,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC;QACjC,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,YAAY,CAAC,IAAc;QACvC,OAAO,IAAI,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;IACvF,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,IAAc;QACjC,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,cAAc,CAAC,IAAc;QAClC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAClB,CAAC;IACD;;OAEG;IACH,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IAED,mEAAmE;IACnE,IAAW,MAAM,KAAc,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IACzE,oEAAoE;IACpE,IAAW,MAAM,KAAc,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IACzE,iEAAiE;IACjE,IAAW,QAAQ,KAAc,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7E,yEAAyE;IACzE,IAAW,cAAc,KAAc,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IAEjF,iDAAiD;IACjD,IAAW,IAAI,KAA2B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9D,wFAAwF;IACjF,UAAU,CAAC,MAAgB,IAAa,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAEvG;;;;;;;;;;;;;;MAcE;IAEK,MAAM,CAAC,CAAS,EAAE,CAAS;QAChC,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE1H,CAAC;CACF;AAzKD,wDAyKC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { XYAndZ } from \"../geometry3d/XYZProps\";\r\nimport { HalfEdge } from \"./Graph\";\r\n\r\n/**\r\n * Enumeration of categorization of \"where\" a HalfEdgePositionDetail is sitting in the graph.\r\n */\r\nexport enum HalfEdgeTopo {\r\n  /** No known position */\r\n  None = 0,\r\n  /**  */\r\n  Vertex = 1,\r\n  Edge = 2,\r\n  Face = 3,\r\n}\r\n/**\r\n * Description of a generalized position within a graph, categorized as:\r\n * * \"at a certain node around a vertex\"\r\n * * \"at a fractional position along an edge\r\n * * \"within a face\"\r\n */\r\nexport class HalfEdgePositionDetail {\r\n  /** the relevant node */\r\n  private _node?: HalfEdge;\r\n  /** The current coordinates */\r\n  public x: number;\r\n  public y: number;\r\n  public z: number;\r\n  /** fractional position along edge.   Only defined if the topo tag is `HalfEdgeTopo.Edge` */\r\n  private _edgeFraction?: number;\r\n  /** Enumeration of status vertex, edge, or face status. */\r\n  private _topo: HalfEdgeTopo;\r\n  /** first data tag */\r\n  private _iTag?: number;\r\n  /** second data tag */\r\n  private _dTag?: number;\r\n  /** Constructor.\r\n   * * The point is CAPTURED.  (static `create` methods normally clone their inputs.)\r\n   */\r\n  private constructor(node: HalfEdge | undefined, x: number, y: number, z: number, topo: HalfEdgeTopo, edgeFraction?: number, iTag?: number, _dTag?: number) {\r\n    this._node = node;\r\n    this.x = x; this.y = y; this.z = z;\r\n    this._topo = topo;\r\n    this._edgeFraction = edgeFraction;\r\n    this._iTag = iTag;\r\n    this._dTag = _dTag;\r\n  }\r\n\r\n  /** Copy (clones of) all data from other */\r\n  public setFrom(other: HalfEdgePositionDetail) {\r\n    this._node = other._node;\r\n    this.x = other.x;\r\n    this.y = other.y;\r\n    this.z = other.z;\r\n    this._topo = other._topo;\r\n    this._edgeFraction = other._edgeFraction;\r\n    this._iTag = other._iTag;\r\n    this._dTag = other._dTag;\r\n  }\r\n  /** reset to null topo state. */\r\n  public resetAsUnknown() {\r\n    this._node = undefined;\r\n    this._topo = HalfEdgeTopo.None;\r\n  }\r\n  /**  Create with null data. */\r\n  public static create(): HalfEdgePositionDetail {\r\n    const detail = new HalfEdgePositionDetail(undefined, 0, 0, 0, HalfEdgeTopo.None);\r\n    return detail;\r\n  }\r\n  public getITag(): number | undefined { return this._iTag; }\r\n  public setITag(value: number): void { this._iTag = value; }\r\n\r\n  public getDTag(): number | undefined { return this._dTag; }\r\n  public setDTag(value: number): void { this._dTag = value; }\r\n  public getTopo(): HalfEdgeTopo { return this._topo; }\r\n\r\n  /** Create with node, fraction along edge, marked as \"HalfEdgeTopo.Edge\".  Compute interpolated xyz on the edge */\r\n  public static createEdgeAtFraction(node: HalfEdge, edgeFraction: number): HalfEdgePositionDetail {\r\n    const node1 = node.faceSuccessor;\r\n    const x = Geometry.interpolate(node.x, edgeFraction, node1.x);\r\n    const y = Geometry.interpolate(node.y, edgeFraction, node1.y);\r\n    const z = Geometry.interpolate(node.z, edgeFraction, node1.z);\r\n    return new HalfEdgePositionDetail(node, x, y, z, HalfEdgeTopo.Edge, edgeFraction);\r\n  }\r\n\r\n  /** reassign contents so this instance becomes a face hit.\r\n   * @param node new node value. If missing, current node is left unchanged.\r\n   * @param xyz new coordinates. if missing, current coordinates are left unchanged.\r\n   */\r\n  public resetAsFace(node?: HalfEdge, xyz?: XYAndZ): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Face;\r\n    if (node)\r\n      this._node = node;\r\n    if (xyz) {\r\n      this.x = xyz.x;\r\n      this.y = xyz.y;\r\n      this.z = xyz.z;\r\n    }\r\n    return this;\r\n  }\r\n\r\n  /** reassign contents so this instance has dTag but no node or HalfEdgeTopo\r\n   */\r\n  public resetAsUndefinedWithTag(dTag: number): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.None;\r\n    this._dTag = 0;\r\n    this._iTag = 0;\r\n    this._dTag = dTag;\r\n    this._node = undefined;\r\n    return this;\r\n  }\r\n\r\n  /** reassign contents so this instance becomes an edge hit\r\n   * @param node new node value.\r\n   * @param edgeFraction new edge fraction.   xyz is recomputed from this edge and its face successor.\r\n   */\r\n  public resetAtEdgeAndFraction(node: HalfEdge, edgeFraction: number): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Edge;\r\n    this._node = node;\r\n    const nodeB = node.faceSuccessor;\r\n    this._edgeFraction = edgeFraction;\r\n    this.x = Geometry.interpolate(node.x, edgeFraction, nodeB.x);\r\n    this.y = Geometry.interpolate(node.y, edgeFraction, nodeB.y);\r\n    this.z = Geometry.interpolate(node.z, edgeFraction, nodeB.z);\r\n    return this;\r\n  }\r\n\r\n  /** Create at a node.\r\n   * * Take xyz from the node.\r\n   */\r\n  public static createVertex(node: HalfEdge): HalfEdgePositionDetail {\r\n    return new HalfEdgePositionDetail(node, node.x, node.y, node.z, HalfEdgeTopo.Vertex);\r\n  }\r\n\r\n  /** Create with node and (optional) xyz, marked as \"HalfEdgeTopo.Vertex\"\r\n   * * if the xyz is omitted, take from the node.\r\n   */\r\n  public resetAsVertex(node: HalfEdge): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Vertex;\r\n    this._node = node;\r\n    this.setXYZFromNode(node);\r\n    return this;\r\n  }\r\n  /** Copy x,y,z from the node to this instance local values. */\r\n  public setXYZFromNode(node: HalfEdge) {\r\n    this.x = node.x;\r\n    this.y = node.y;\r\n    this.z = node.z;\r\n  }\r\n  /**\r\n   * Return the (possibly undefined) edge fraction.\r\n   */\r\n  public get edgeFraction(): number | undefined {\r\n    return this._edgeFraction;\r\n  }\r\n\r\n  /** Return true if this detail is marked as being within a face. */\r\n  public get isFace(): boolean { return this._topo === HalfEdgeTopo.Face; }\r\n  /** Return true if this detail is marked as being within an edge. */\r\n  public get isEdge(): boolean { return this._topo === HalfEdgeTopo.Edge; }\r\n  /** Return true if this detail is marked as being at a vertex. */\r\n  public get isVertex(): boolean { return this._topo === HalfEdgeTopo.Vertex; }\r\n  /** Return true if this detail has no vertex, edge, or face qualifier. */\r\n  public get isUnclassified(): boolean { return this._topo === HalfEdgeTopo.None; }\r\n\r\n  /** Return the node reference from this detail */\r\n  public get node(): HalfEdge | undefined { return this._node; }\r\n  /** Return the (clone of, or optional filled in result) coordinates from this detail. */\r\n  public clonePoint(result?: Point3d): Point3d { return Point3d.create(this.x, this.y, this.z, result); }\r\n\r\n  /*\r\n    // If candidateKey is less than resultKey, replace resultPos and resultKey\r\n    // by the candidate data.\r\n    public updateMinimizer(\r\n      HalfEdgePositionDetail & resultPos, number & resultKey,\r\n  : HalfEdgePositionDetail & candidatePos, candidateKey: number\r\n    ): boolean {\r\n      if (candidateKey < resultKey) {\r\n        resultKey = candidateKey;\r\n        resultPos = candidatePos;\r\n        return true;\r\n      }\r\n      return false;\r\n    }\r\n  */\r\n\r\n  public isAtXY(x: number, y: number): boolean {\r\n    return this._topo !== HalfEdgeTopo.None && Geometry.isSameCoordinate(this.x, x) && Geometry.isSameCoordinate(this.y, y);\r\n\r\n  }\r\n}\r\n"]}

package/lib/topology/HalfEdgePriorityQueue.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgePriorityQueue.d.ts","sourceRoot":"","sources":["../../src/topology/HalfEdgePriorityQueue.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGnC;;;;;;;;GAQG;AACH,qBAAa,qCAAqC;IACzC,aAAa,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IACvC,WAAW,EAAE,QAAQ,EAAE,CAAC;gBAE7B,OAAO,GAAE,iBAAiB,CAAC,QAAQ,CAAqC;IAI1E,qEAAqE;IAC9D,eAAe,IAAI,QAAQ,GAAG,SAAS;IAO9C;;;;OAIG;IACI,oBAAoB,CAAC,CAAC,EAAE,MAAM;IAOrC;;;;OAIG;IACI,6BAA6B,CAAC,CAAC,EAAE,MAAM;CAiB/C"}

package/lib/topology/HalfEdgePriorityQueue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HalfEdgePriorityQueue.js","sourceRoot":"","sources":["../../src/topology/HalfEdgePriorityQueue.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,sDAAuE;AAEvE,uCAA6C;AAE7C;;;;;;;;GAQG;AACH,MAAa,qCAAqC;IAGhD,YACE,UAAuC,0BAAgB,CAAC,gBAAgB;QACxE,IAAI,CAAC,aAAa,GAAG,IAAI,4BAAa,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;IACxB,CAAC;IACD,qEAAqE;IAC9D,eAAe;QACpB,IAAI,IAAI,CAAC,aAAa,CAAC,OAAO;YAC5B,OAAO,SAAS,CAAC;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAG,CAAC;QACpC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;OAIG;IACI,oBAAoB,CAAC,CAAS;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,EAAE;YACT,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAG,CAAC;YAClC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACzB;IACH,CAAC;IACD;;;;OAIG;IACI,6BAA6B,CAAC,CAAS;QAC5C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;YAC7B,IAAI,EAAE,IAAI,CAAC,EAAE;gBACX,+BAA+B;gBAC/B,IAAI,OAAO,GAAG,CAAC;oBACb,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBAChC,OAAO,EAAE,CAAC;aACX;iBAAM;gBACL,mBAAmB;aACpB;SACF;QACD,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,OAAO,CAAC;IACpC,CAAC;CACF;AAlDD,sFAkDC","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 Topology\n */\nimport { OrderedComparator, PriorityQueue } from \"@itwin/core-bentley\";\nimport { HalfEdge } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n/**\n * * Combination of a priority queue of HalfEdges with\n * * Additional \"active\" array to carry edges that have been removed from the queue but are still to be\n *    inspected (possibly many times)\n * * The priority queue default sort is Y-then-X lexical sort.\n * * Caller has direct access to the queue and array.\n * * Methods are added here only to do things that involve both the queue and the array.\n * @internal\n */\nexport class HalfEdgePriorityQueueWithPartnerArray {\n  public priorityQueue: PriorityQueue<HalfEdge>;\n  public activeEdges: HalfEdge[];\n  public constructor(\n    compare: OrderedComparator<HalfEdge> = HalfEdgeGraphOps.compareNodesYXUp) {\n    this.priorityQueue = new PriorityQueue(compare);\n    this.activeEdges = [];\n  }\n  /** Read a member from the queue and transfer to the active array. */\n  public popQueueToArray(): HalfEdge | undefined {\n    if (this.priorityQueue.isEmpty)\n      return undefined;\n    const x = this.priorityQueue.pop()!;\n    this.activeEdges.push(x);\n    return x;\n  }\n  /** Pop the last entry and put it back as replacement for current entry at index i.\n   * * Effectively remove active member at index i\n   * * The array order is changed.\n   * * constant time.\n   */\n  public popArrayToArrayIndex(i: number) {\n    const n = this.activeEdges.length;\n    if (i < n) {\n      const x = this.activeEdges.pop()!;\n      this.activeEdges[i] = x;\n    }\n  }\n  /**\n   * * Scan the active array.\n   * * remove edges whose top y is below y\n   * * (pack all remaining ones back towards the beginning)\n   */\n  public removeArrayMembersWithY1Below(y: number) {\n    let numKeep = 0;\n    const n = this.activeEdges.length;\n    for (let i = 0; i < n; i++) {\n      const q = this.activeEdges[i];\n      const yB = q.faceSuccessor.y;\n      if (yB >= y) {\n        // copy [i] forward to [target]\n        if (numKeep < i)\n          this.activeEdges[numKeep] = q;\n        numKeep++;\n      } else {\n        // let it go by !!!\n      }\n    }\n    this.activeEdges.length = numKeep;\n  }\n}\n"]}

package/lib/topology/InsertAndRetriangulateContext.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"InsertAndRetriangulateContext.d.ts","sourceRoot":"","sources":["../../src/topology/InsertAndRetriangulateContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAGxD,OAAO,EAAY,aAAa,EAAgB,MAAM,SAAS,CAAC;AAGhE,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAGlE;;;;;GAKG;AACH,qBAAa,6BAA6B;IACxC,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,QAAQ,CAAgB;IAChC,OAAO,CAAC,SAAS,CAAyB;IAK1C,OAAO;IAOP,kDAAkD;WACpC,MAAM,CAAC,KAAK,EAAE,aAAa;IAGzC,uDAAuD;IACvD,IAAW,KAAK,IAAI,aAAa,CAAwB;IAIzD,OAAO,CAAC,2BAA2B;IAenC,qDAAqD;IAC9C,KAAK;IAIZ,iEAAiE;IACjE,IAAW,eAAe,2BAA6B;IACvD;;;;OAIG;IACI,4BAA4B,CAAC,GAAG,EAAE,OAAO,GAAG,sBAAsB;IAkClE,sBAAsB,CAAC,GAAG,EAAE,OAAO,GAAG,sBAAsB;IAc5D,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM;IAMxC,sBAAsB,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAAG,OAAO;IAmChE,WAAW,CAAC,cAAc,EAAE,sBAAsB,EAAE,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC,QAAQ,EAAE,sBAAsB,KAAK,OAAO,GAAG,OAAO;CAmE7I"}

package/lib/topology/InsertAndRetriangulateContext.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"InsertAndRetriangulateContext.js","sourceRoot":"","sources":["../../src/topology/InsertAndRetriangulateContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,mEAAwD;AACxD,+CAA4C;AAC5C,yDAAsD;AACtD,mCAAgE;AAChE,uDAAkD;AAClD,6EAAqF;AACrF,qEAAkE;AAClE,mDAA+C;AAE/C;;;;;GAKG;AACH,MAAa,6BAA6B;IAIxC,oCAAoC;IACpC,+CAA+C;IAC/C,+CAA+C;IAE/C,YAAoB,KAAoB;QACtC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,+BAAa,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC;QAC7C,IAAI,CAAC,SAAS,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,sDAAsD;QACtD,sDAAsD;IACxD,CAAC;IACD,kDAAkD;IAC3C,MAAM,CAAC,MAAM,CAAC,KAAoB;QACvC,OAAO,IAAI,6BAA6B,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC;IACD,uDAAuD;IACvD,IAAW,KAAK,KAAoB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACzD,gFAAgF;IAChF,yCAAyC;IACzC,oEAAoE;IAC5D,2BAA2B,CAAC,WAAqB;QACvD,MAAM,OAAO,GAAG,WAAW,CAAC,oBAAoB,EAAE,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QACzC,IAAI,OAAO,GAAG,CAAC,IAAI,WAAW,CAAC,cAAc,EAAE,IAAI,GAAG;YACpD,OAAO;QACT,MAAM,OAAO,GAAG,OAAO,GAAG,CAAC,CAAC;QAC5B,IAAI,OAAO,GAAG,WAAW,CAAC,aAAa,CAAC;QACxC,IAAI,QAAQ,GAAG,WAAW,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;YAChC,OAAO,GAAG,OAAO,CAAC,aAAa,CAAC;YAChC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,0BAA0B,CAAC,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YAC3E,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC;YACjC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;SAClC;IACH,CAAC;IACD,qDAAqD;IAC9C,KAAK;QACV,IAAI,CAAC,SAAS,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;IACnD,CAAC;IAED,iEAAiE;IACjE,IAAW,eAAe,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACvD;;;;OAIG;IACI,4BAA4B,CAAC,GAAY;QAC9C,MAAM,QAAQ,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,SAAS,CAAC;QACd,IAAI,SAAS,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;YAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,SAAS,GAAG,yBAAW,CAAC,oCAAoC,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAChF,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC3B,IAAI,SAAS,GAAG,GAAG,EAAE;oBACnB,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE;wBACnC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;qBAC7B;iBACF;qBAAM,IAAI,SAAS,GAAG,GAAG,EAAE;oBAC1B,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE;wBACnC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;qBAC7B;iBACF;qBAAM;oBACL,KAAK,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;oBAEzC,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBACjC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE;wBACnC,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;qBACnD;iBACF;aACF;SACF;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACM,sBAAsB,CAAC,GAAY;QACxC,MAAM,QAAQ,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,SAAS,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;YAC5C,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE;gBACnC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;aAC7B;SACF;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEM,WAAW,CAAC,GAAY,EAAE,MAAc;QAC7C,IAAI,MAAM,GAAG,CAAC;YACZ,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC;;YAExD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC;IACM,sBAAsB,CAAC,GAAY,EAAE,QAAiB;QAC3D,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,IAAI,QAAQ,KAAK,SAAS,EAAE;SAC3B;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YAChC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,oBAAY,CAAC,QAAQ,CAAC,EAAE;gBAC9C,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;gBAC/F,IAAI,CAAC,2BAA2B,CAAC,eAAe,CAAC,CAAC;gBAClD,4BAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC;aAC/C;YACD,IAAI,GAAG,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YAChC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,YAAa,CAAC,CAAC;YACrF,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC;YACpC,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC;YACvC,4BAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChE,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,GAAG,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE;YAClC,6DAA6D;YAC7D,IAAI,QAAQ;gBACV,QAAQ,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACnD,IAAI,GAAG,IAAI,CAAC;SACb;aAAM;YACL,IAAI,GAAG,KAAK,CAAC;SACd;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uFAAuF;IACvF,mDAAmD;IACnD,6BAA6B;IACtB,WAAW,CAAC,cAAsC,EAAE,GAAY,EAAE,SAAyD;QAChI,MAAM,GAAG,GAAG,+CAAkB,CAAC,MAAM,EAAE,CAAC;QACxC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,cAAc,CAAC,cAAc,EAAE;YACjC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC1D,IAAI,cAAc,CAAC,cAAc;gBAC/B,OAAO,KAAK,CAAC;SAChB;QAED,wCAAwC;QACxC,MAAM,GAAG,GAAG,aAAK,CAAC,WAAW,EAAE,CAAC;QAChC,OAAO,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG;YACtC,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC3B,MAAM,cAAc,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC;gBACjD,IAAI,CAAC,cAAc;oBACjB,MAAM;aACT;YACD,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;gBAC/C,OAAO,KAAK,CAAC;aACd;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE;gBAChC,MAAM,UAAU,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,UAAU,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,EAAE,GAAG,GAAG,CAAC,eAAe,CAAC,cAAc,CAAC,IAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;gBAC1F,2DAA2D;gBAC3D,QAAQ,EAAE,EAAE;oBACV,KAAK,8CAAiB,CAAC,SAAS,CAAC,CAAC;wBAChC,cAAc,CAAC,cAAc,EAAE,CAAC;wBAChC,MAAM;qBACP;oBACD,KAAK,8CAAiB,CAAC,iBAAiB,CAAC,CAAC;wBACxC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;qBACP;oBACD,KAAK,8CAAiB,CAAC,eAAe,CAAC,CAAC;wBACtC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;qBACP;oBACD,KAAK,8CAAiB,CAAC,UAAU,CAAC,CAAC;wBACjC,cAAc,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;wBACjD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;qBACP;oBACD,KAAK,8CAAiB,CAAC,eAAe,CAAC,CAAC;wBACtC,cAAc,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;wBACrD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;qBACP;oBACD,KAAK,8CAAiB,CAAC,cAAc,CAAC,CAAC;wBACrC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,MAAM;qBACP;iBACF;aACF;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE;gBAChC,GAAG,CAAC,aAAa,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,CAAC,CAAC;gBAC/C,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;aACT;iBAAM,IAAI,cAAc,CAAC,QAAQ,EAAE;gBAClC,GAAG,CAAC,eAAe,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,CAAC,CAAC;gBACjD,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;aACT;SACF;QAED,OAAO,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;CACF;AA/MD,sEA+MC;AACD,4EAA4E;AAC5E,SAAS,qBAAqB,CAAC,KAAoB,EAAE,QAAgC,EAAE,YAAoB,EAAE,QAAsB;IACjI,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,YAAY,EAAE;QAC1C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE;YAClC,QAAQ,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC;SACb;KACF;IACD,OAAO,KAAK,CAAC;AACf,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\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { SmallSystem } from \"../numerics/Polynomials\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { MarkedEdgeSet } from \"./HalfEdgeMarkSet\";\r\nimport { PointSearchContext, RayClassification } from \"./HalfEdgePointInGraphSearch\";\r\nimport { HalfEdgePositionDetail } from \"./HalfEdgePositionDetail\";\r\nimport { Triangulator } from \"./Triangulation\";\r\n\r\n/**\r\n * Context for repeated insertion of new points in a graph.\r\n * * Initial graph should have clean outer boundary. (e.g. as typically marked with HalfEdgeMask.EXTERIOR)\r\n * * After each insertion, the current \"position\" within the graph is remembered so that each subsequent insertion\r\n *     can reuse that position as start for walking to the new point.\r\n */\r\nexport class InsertAndRetriangulateContext {\r\n  private _graph: HalfEdgeGraph;\r\n  private _edgeSet: MarkedEdgeSet;\r\n  private _searcher: HalfEdgePositionDetail;\r\n  // Temporaries used in reAimFromFace\r\n  // private _lastBefore: HalfEdgePositionDetail;\r\n  // private _firstAfter: HalfEdgePositionDetail;\r\n\r\n  private constructor(graph: HalfEdgeGraph) {\r\n    this._graph = graph;\r\n    this._edgeSet = MarkedEdgeSet.create(graph)!;\r\n    this._searcher = HalfEdgePositionDetail.create();\r\n    // this._lastBefore = HalfEdgePositionDetail.create();\r\n    // this._firstAfter = HalfEdgePositionDetail.create();\r\n  }\r\n  /** Create a new context referencing the graph. */\r\n  public static create(graph: HalfEdgeGraph) {\r\n    return new InsertAndRetriangulateContext(graph);\r\n  }\r\n  /** Query the (pointer to) the graph in the context. */\r\n  public get graph(): HalfEdgeGraph { return this._graph; }\r\n  // Walk face from edgeNode;  insert new edges back to start node from all except\r\n  //   immediate successor and predecessor.\r\n  // insert all new nodes, and nodes of the existing face, in edgeSet.\r\n  private retriangulateFromBaseVertex(centralNode: HalfEdge) {\r\n    const numNode = centralNode.countEdgesAroundFace();\r\n    this._edgeSet.addAroundFace(centralNode);\r\n    if (numNode < 4 || centralNode.signedFaceArea() <= 0.0)\r\n      return;\r\n    const numEdge = numNode - 3;\r\n    let farNode = centralNode.faceSuccessor;\r\n    let nearNode = centralNode;\r\n    for (let i = 0; i < numEdge; i++) {\r\n      farNode = farNode.faceSuccessor;\r\n      nearNode = this._graph.createEdgeHalfEdgeHalfEdge(nearNode, 0, farNode, 0);\r\n      farNode = nearNode.faceSuccessor;\r\n      this._edgeSet.addToSet(nearNode);\r\n    }\r\n  }\r\n  /** Reset the \"current\" position to unknown state. */\r\n  public reset() {\r\n    this._searcher = HalfEdgePositionDetail.create();\r\n  }\r\n\r\n  /** Return a (reference to!) the current position in the graph */\r\n  public get currentPosition() { return this._searcher; }\r\n  /**\r\n   * Linear search through the graph\r\n   * * Returns a HalfEdgePositionDetail for the nearest edge or vertex.\r\n   * @param xyz\r\n   */\r\n  public searchForNearestEdgeOrVertex(xyz: Point3d): HalfEdgePositionDetail {\r\n    const position = HalfEdgePositionDetail.create();\r\n    position.setDTag(Number.MAX_VALUE);\r\n    const xyzC = Point3d.create();\r\n    let fractionC;\r\n    let distanceC;\r\n    for (const nodeA of this._graph.allHalfEdges) {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      fractionC = SmallSystem.lineSegment3dXYClosestPointUnbounded(nodeA, nodeB, xyz);\r\n      if (fractionC !== undefined) {\r\n        if (fractionC > 1.0) {\r\n          distanceC = xyz.distanceXY(nodeB);\r\n          if (distanceC < position.getDTag()!) {\r\n            position.resetAsVertex(nodeB);\r\n            position.setDTag(distanceC);\r\n          }\r\n        } else if (fractionC < 0.0) {\r\n          distanceC = xyz.distanceXY(nodeA);\r\n          if (distanceC < position.getDTag()!) {\r\n            position.resetAsVertex(nodeA);\r\n            position.setDTag(distanceC);\r\n          }\r\n        } else {\r\n          nodeA.fractionToPoint3d(fractionC, xyzC);\r\n\r\n          distanceC = xyz.distanceXY(xyzC);\r\n          if (distanceC < position.getDTag()!) {\r\n            position.resetAtEdgeAndFraction(nodeA, fractionC);\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return position;\r\n  }\r\n  public searchForNearestVertex(xyz: Point3d): HalfEdgePositionDetail {\r\n    const position = HalfEdgePositionDetail.create();\r\n    position.setDTag(Number.MAX_VALUE);\r\n    let distanceA;\r\n    for (const nodeA of this._graph.allHalfEdges) {\r\n      distanceA = xyz.distanceXY(nodeA);\r\n      if (distanceA < position.getDTag()!) {\r\n        position.resetAsVertex(nodeA);\r\n        position.setDTag(distanceA);\r\n      }\r\n    }\r\n    return position;\r\n  }\r\n\r\n  public resetSearch(xyz: Point3d, maxDim: number) {\r\n    if (maxDim > 0)\r\n      this._searcher = this.searchForNearestEdgeOrVertex(xyz);\r\n    else\r\n      this._searcher = this.searchForNearestVertex(xyz);\r\n  }\r\n  public insertAndRetriangulate(xyz: Point3d, newZWins: boolean): boolean {\r\n    this.moveToPoint(this._searcher, xyz);\r\n    const seedNode = this._searcher.node;\r\n    let stat = false;\r\n    if (seedNode === undefined) {\r\n    } else if (this._searcher.isFace) {\r\n      if (!seedNode.isMaskSet(HalfEdgeMask.EXTERIOR)) {\r\n        const newInteriorNode = this._graph.createEdgeXYZHalfEdge(xyz.x, xyz.y, xyz.z, 0, seedNode, 0);\r\n        this.retriangulateFromBaseVertex(newInteriorNode);\r\n        Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\r\n        this._searcher.resetAsVertex(newInteriorNode);\r\n      }\r\n      stat = true;\r\n    } else if (this._searcher.isEdge) {\r\n      const newA = this._graph.splitEdgeAtFraction(seedNode, this._searcher.edgeFraction!);\r\n      const newB = newA.vertexPredecessor;\r\n      this.retriangulateFromBaseVertex(newA);\r\n      this.retriangulateFromBaseVertex(newB);\r\n      Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\r\n      this._searcher.resetAsVertex(newA);\r\n      stat = true;\r\n    } else if (this._searcher.isVertex) {\r\n      // There's already a vertex there.  Maybe the z is different.\r\n      if (newZWins)\r\n        seedNode.setXYZAroundVertex(xyz.x, xyz.y, xyz.z);\r\n      stat = true;\r\n    } else {\r\n      stat = false;\r\n    }\r\n    return stat;\r\n  }\r\n\r\n  // Advance movingPosition to a face, edge, or vertex position detail that contains xyz.\r\n  // Prior content in movingPosition is used as seed.\r\n  // Return true if successful.\r\n  public moveToPoint(movingPosition: HalfEdgePositionDetail, xyz: Point3d, announcer?: (position: HalfEdgePositionDetail) => boolean): boolean {\r\n    const psc = PointSearchContext.create();\r\n    movingPosition.setITag(0);\r\n    if (movingPosition.isUnclassified) {\r\n      moveToAnyUnmaskedEdge(this.graph, movingPosition, 0.5, 0);\r\n      if (movingPosition.isUnclassified)\r\n        return false;\r\n    }\r\n\r\n    // double tol = vu_getMergeTol (pGraph);\r\n    const ray = Ray3d.createXAxis();\r\n    for (; movingPosition.getITag() === 0;) {\r\n      if (announcer !== undefined) {\r\n        const continueSearch = announcer(movingPosition);\r\n        if (!continueSearch)\r\n          break;\r\n      }\r\n      if (!psc.setSearchRay(movingPosition, xyz, ray)) {\r\n        return false;\r\n      } else if (movingPosition.isFace) {\r\n        const lastBefore = HalfEdgePositionDetail.create();\r\n        const firstAfter = HalfEdgePositionDetail.create();\r\n        const rc = psc.reAimAroundFace(movingPosition.node!, ray, ray.a!, lastBefore, firstAfter);\r\n        // reAimAroundFace returns lots of cases in `lastBefore` !!\r\n        switch (rc) {\r\n          case RayClassification.RC_NoHits: {\r\n            movingPosition.resetAsUnknown();\r\n            break;\r\n          }\r\n          case RayClassification.RC_TargetOnVertex: {\r\n            movingPosition.setFrom(lastBefore);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.RC_TargetOnEdge: {\r\n            movingPosition.setFrom(lastBefore);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.RC_Bracket: {\r\n            movingPosition.resetAsFace(lastBefore.node, xyz);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.RC_TargetBefore: {\r\n            movingPosition.resetAsFace(movingPosition.node, xyz);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.RC_TargetAfter: {\r\n            movingPosition.setFrom(lastBefore);\r\n            break;\r\n          }\r\n        }\r\n      } else if (movingPosition.isEdge) {\r\n        psc.reAimFromEdge(movingPosition, ray, ray.a!);\r\n        if (movingPosition.isUnclassified)\r\n          break;\r\n      } else if (movingPosition.isVertex) {\r\n        psc.reAimFromVertex(movingPosition, ray, ray.a!);\r\n        if (movingPosition.isUnclassified)\r\n          break;\r\n      }\r\n    }\r\n\r\n    return movingPosition.isAtXY(xyz.x, xyz.y);\r\n  }\r\n}\r\n// Create a VuPositionDetail for specified fraction along any unmasked edge.\r\nfunction moveToAnyUnmaskedEdge(graph: HalfEdgeGraph, position: HalfEdgePositionDetail, edgeFraction: number, skipMask: HalfEdgeMask): boolean {\r\n  for (const candidate of graph.allHalfEdges) {\r\n    if (!candidate.isMaskSet(skipMask)) {\r\n      position.resetAtEdgeAndFraction(candidate, edgeFraction);\r\n      return true;\r\n    }\r\n  }\r\n  return false;\r\n}\r\n"]}

package/lib/topology/MaskManager.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"MaskManager.d.ts","sourceRoot":"","sources":["../../src/topology/MaskManager.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH;;;;;;GAMG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,kBAAkB,CAAS;IACnC,OAAO,CAAC,cAAc,CAAS;IAC/B;;OAEG;IACH,OAAO;IAKP;;;OAGG;WACW,MAAM,CAAC,SAAS,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAehE;;OAEG;IACI,QAAQ,IAAI,MAAM;IAUzB;;OAEG;IACI,QAAQ,CAAC,IAAI,EAAE,MAAM;CAK7B"}

package/lib/topology/MaskManager.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"MaskManager.js","sourceRoot":"","sources":["../../src/topology/MaskManager.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH;;;;;;GAMG;AACH,MAAa,WAAW;IAItB;;OAEG;IACH,YAAoB,SAAiB,EAAE,aAAqB;QAC1D,IAAI,CAAC,kBAAkB,GAAG,SAAS,CAAC;QACpC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;IACtC,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,SAAiB;QACpC,kCAAkC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YAC3B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE;gBAC/B,SAAS,GAAG,OAAO,CAAC;gBACpB,MAAM;aACP;YACD,OAAO,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;SAC1B;QACD,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAC/C,CAAC;IACD;;OAEG;IACI,QAAQ;QACb,IAAI,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;YAC9B,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC;QAEnB,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACI,QAAQ,CAAC,IAAY;QAC1B,IAAI,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAI,0CAA0C;QAC9E,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC1B,CAAC;CAEF;AApDD,kCAoDC","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 Topology\n */\n/**\n * Methods to \"grab and drop\" mask bits.\n * * Caller code (e.g. HalfEdgeGraph) initializes with a block of bits to be managed.\n * * Callers borrow and return masks with \"grabMask\" and \"dropMask\"\n * * Callers must exercise grab/drop balance discipline.\n * @internal\n */\nexport class MaskManager {\n  private _freeMasks: number;\n  private _originalFreeMasks: number;\n  private _firstFreeMask: number;\n  /**\n   * @param freeMasks caller-defined block of bits that are to be managed.\n   */\n  private constructor(freeMasks: number, firstFreeMask: number) {\n    this._originalFreeMasks = freeMasks;\n    this._freeMasks = freeMasks;\n    this._firstFreeMask = firstFreeMask;\n  }\n  /** Create a MaskManager.\n   * Typical use:   MaskManager.create (0xFFFF0000)\n   * * This makes bits 16 through 31 available to be borrowed, with lower bits available for fixed usage.\n   */\n  public static create(freeMasks: number): MaskManager | undefined {\n    // look for first bit up to bit 31\n    let firstFree = 0;\n    let testBit = 0x01;\n    for (let i = 0; i < 32; i++) {\n      if ((testBit & freeMasks) !== 0) {\n        firstFree = testBit;\n        break;\n      }\n      testBit = (testBit << 1);\n    }\n    if (firstFree === 0)\n      return undefined;\n    return new MaskManager(freeMasks, firstFree);\n  }\n  /**\n   * Find a mask bit that is not \"in use\".\n   */\n  public grabMask(): number {\n    let mask = this._firstFreeMask;\n    if (this._freeMasks === 0)\n      return 0;\n    while (!(mask & this._freeMasks))\n      mask = mask << 1;\n\n    this._freeMasks &= ~mask;\n    return mask;\n  }\n  /**\n   * Find a mask bit that is not \"in use\".\n   */\n  public dropMask(mask: number) {\n    mask &= this._originalFreeMasks;    // prevent \"drop\" of mask not in the pool.\n    this._freeMasks |= mask;\n  }\n\n}\n"]}

package/lib/topology/Merging.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Merging.d.ts","sourceRoot":"","sources":["../../src/topology/Merging.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAIvD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAG9C,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAGhE,OAAO,EAAE,0BAA0B,EAAgB,MAAM,iBAAiB,CAAC;AAE3E,qBAAa,cAAc;IAClB,SAAS,SAAK;IACd,mBAAmB,SAAK;IACxB,QAAQ,SAAK;IACb,SAAS,SAAK;IACd,OAAO,SAAK;IACZ,OAAO,SAAK;;CAGpB;AAED;;;GAGG;AACH,qBAAa,gBAAgB;IAE3B,iFAAiF;WACnE,gBAAgB,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ;IAgBvD,mIAAmI;WACrH,UAAU,CAAC,KAAK,EAAE,QAAQ;IAQxC;;;;OAIG;WACW,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,MAAM;WAOnF,UAAU,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAOvD,kFAAkF;WACpE,wBAAwB,CAAC,QAAQ,EAAE,aAAa,EAAE,EAAE,WAAW,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,QAAQ,EAAE;IAwB7H;;;;;;OAMG;WACW,iBAAiB,CAAC,KAAK,EAAE,aAAa;IAiBpD;;;;;OAKG;WACW,eAAe,CAAC,KAAK,EAAE,aAAa;CAOnD;AACD;;GAEG;AACH,qBAAa,kBAAkB;IAC7B;;;;;;;OAOG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,EAAE,uBAAuB,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,KAAK,MAAM;IAqG7G,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAU9C,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAKjC,OAAO,CAAC,MAAM,CAAC,mCAAmC;IAyBlD;;;;OAIG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,GAAG,cAAc;IA+C1E;;;;;;;;OAQG;WACW,qBAAqB,CAAC,YAAY,EAAE,aAAa,EAAE,GAAG,aAAa;IAUjF;;;;OAIG;WACW,mBAAmB,CAAC,MAAM,EAAE,0BAA0B,EAAE,UAAU,GAAE,OAAc,EAAE,IAAI,GAAE,YAAwC,GAAG,aAAa,GAAG,SAAS;CAiB7K"}

package/lib/topology/Merging.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Merging.js","sourceRoot":"","sources":["../../src/topology/Merging.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAO/F,0CAAuC;AACvC,+CAA4C;AAC5C,mEAAkE;AAClE,+CAA8C;AAC9C,mEAAgE;AAChE,yDAAsD;AACtD,mCAAgE;AAChE,mEAAgF;AAChF,qDAAyD;AACzD,mDAA2E;AAE3E,MAAa,cAAc;IAOzB;QANO,cAAS,GAAG,CAAC,CAAC;QACd,wBAAmB,GAAG,CAAC,CAAC;QACxB,aAAQ,GAAG,CAAC,CAAC;QACb,cAAS,GAAG,CAAC,CAAC;QACd,YAAO,GAAG,CAAC,CAAC;QACZ,YAAO,GAAG,CAAC,CAAC;IAEnB,CAAC;CACF;AATD,wCASC;AAED;;;GAGG;AACH,MAAa,gBAAgB;IAE3B,iFAAiF;IAC1E,MAAM,CAAC,gBAAgB,CAAC,CAAW,EAAE,CAAW;QACrD,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IAED,mIAAmI;IAC5H,MAAM,CAAC,UAAU,CAAC,KAAe;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACzC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACvC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,IAAc,EAAE,OAAiB,EAAE,OAAiB;QACtF,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,wHAAwH;IACxH,yHAAyH;IAElH,MAAM,CAAC,UAAU,CAAC,KAAoB;QAC3C,MAAM,KAAK,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;SACzC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kFAAkF;IAC3E,MAAM,CAAC,wBAAwB,CAAC,QAAyB,EAAE,WAA0B,EAAE,IAAkB;QAC9G,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,kFAAkF;QAClF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAE9B,MAAM,KAAK,GAAG,WAAW,CAAC,gBAAgB,CACxC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,EACV,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,GAAG,CAAC,CAAC,CAAC;YAElB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC7B,UAAU,IAAI,CAAC,CAAC;YAEhB,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAG,sDAAsD;YACvF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACpB;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB;QAElD,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC1C,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,OAAO,CAAC,CAAC;QACtC,6DAA6D;QAC7D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,IAAI,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,OAAO,CAAC;gBACtC,SAAS;YACX,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YACnC,IAAI,IAAI,IAAI,GAAG,EAAE;gBACf,IAAI,CAAC,iBAAiB,CAAC,oBAAY,CAAC,OAAO,CAAC,CAAC;gBAC7C,SAAS;aACV;SAEF;IACH,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE;YACtC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC;YACtC,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SAC9B;IACH,CAAC;CAEF;AA7GD,4CA6GC;AACD;;GAEG;AACH,MAAa,kBAAkB;IAC7B;;;;;;;OAOG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB,EAAE,uBAAkD;QAC3G,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;QACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,mCAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,0EAA0E;QAClI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YACjC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAE,0CAA0C;YACzF,QAAQ,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;SACpC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,qBAAqB,EAAE,CAAC;QAC/C,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE;YAChC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE;gBACpD,gFAAgF;gBAChF,IAAI,EAAE,GAAG,EAAE,EAAE;oBACX,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;wBAChC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBACnB,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;qBACpB;iBACF;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aACb;SACF;QACD,MAAM;QACN,4EAA4E;QAC5E,qDAAqD;QAErD,qDAAqD;QACrD,KAAK,MAAM,iBAAiB,IAAI,KAAK,EAAE;YACrC,IAAI,iBAAiB,KAAK,mCAAgB,CAAC,iBAAiB,EAAE;gBAC5D,MAAM,KAAK,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAClC,IAAI,OAAO,GAAG,uBAAuB,CAAC,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1H,IAAI,aAAK,CAAC,oCAAoC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/D,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;gBACpB,QAAQ,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;aACtD;SACF;QACD,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,sBAAsB,GAAe,EAAE,CAAC;QAC9C,EAAE,GAAG,CAAC,CAAC;QACP,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,2CAA2C;QAC3C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE;YAChC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE;gBACpD,gFAAgF;gBAChF,IAAI,EAAE,GAAG,EAAE,EAAE;oBACX,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,KAAK,GAAG,MAAM,CAAC;oBACnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;wBAChC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE;4BAC3C,8DAA8D;4BAC9D,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE;gCACV,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;6BAC9B;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;yBACjB;6BAAM,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE;4BAClD,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE;gCACV,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;6BAC9B;4BACD,6FAA6F;yBAC9F;6BAAM;4BACL,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAC7B,IAAI,aAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;gCAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC;gCACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;gCAC9B,yDAAyD;gCACzD,wDAAwD;gCACxD,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gCAC/B,KAAK,CAAC,OAAO,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;gCACtC,MAAM,CAAC,OAAO,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;gCACvC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;6BACrC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;yBACjB;qBACF;iBACF;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aACb;SACF;IACH,CAAC;IAEO,MAAM,CAAC,+BAA+B,CAAC,KAAoB;QACjE,MAAM,SAAS,GAAG,IAAI,6DAAqC,EAAE,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE;YAElC,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE;gBAC7D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACjC;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACO,MAAM,CAAC,kBAAkB,CAAC,EAAW,EAAE,QAAgB,EAAE,IAAc,EAAE,YAAoB;QACnG,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YACpF,OAAO,YAAY,CAAC;QACtB,OAAO,QAAQ,CAAC;IACpB,CAAC;IACS,MAAM,CAAC,mCAAmC,CAAC,MAAgB,EAAE,MAAgB,EAAE,SAAmB,EAAE,MAAe,EAAE,MAAe;QAC1I,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,IAAI,yBAAW,CAAC,8CAA8C,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAC7E,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE;YAC9B,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,OAAO,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;SACrE;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB;QACvD,MAAM,IAAI,GAAG,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,MAAM,aAAa,GAAG,MAAM,CAAC;QAC7B,MAAM,aAAa,GAAG,GAAG,GAAG,aAAa,CAAC;QAC1C,IAAI,CAAC,CAAC;QACN,MAAM,SAAS,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC;QACX,MAAM,YAAY,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QAClD,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE;YAC7D,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACxC,SAAS,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;YACjE,IAAI,CAAC,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACpD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjD,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;gBAC9B,uCAAuC;gBACvC,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;oBACvE,IAAI,CAAC,OAAO,EAAE,CAAC;iBAChB;qBAAM,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;oBAC9E,IAAI,CAAC,OAAO,EAAE,CAAC;iBAChB;qBAAM;oBACL,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC3B,IAAI,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE;wBACvF,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE;4BAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,mBAAmB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;4BAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,2DAA2D;4BAClG,IAAI,CAAC,QAAQ,EAAE,CAAC;yBACjB;wBACD,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE;4BAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,mBAAmB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;4BAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,2DAA2D;4BAClG,IAAI,CAAC,QAAQ,EAAE,CAAC;yBACjB;wBACD,0EAA0E;qBAC3E;iBACF;aACF;YACD,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SACpC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qBAAqB,CAAC,YAA6B;QAC/D,uEAAuE;QACvE,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,gBAAgB,CAAC,wBAAwB,CAAC,YAAY,EAAE,KAAK,EAAE,oBAAY,CAAC,aAAa,CAAC,CAAC;QAC3F,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAEnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,MAAkC,EAAE,aAAsB,IAAI,EAAE,OAAqB,oBAAY,CAAC,YAAY;QAC9I,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,4BAAY,CAAC,iCAAiC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjF,KAAK,MAAM,IAAI,IAAI,UAAU;YAC3B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,EAAE;YACd,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACrC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAEF;AAnPD,gDAmPC","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 Topology\n */\n\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { Geometry } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { Point2d, Vector2d } from \"../geometry3d/Point2dVector2d\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { ClusterableArray } from \"../numerics/ClusterableArray\";\nimport { SmallSystem } from \"../numerics/Polynomials\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgePriorityQueueWithPartnerArray } from \"./HalfEdgePriorityQueue\";\nimport { RegularizationContext } from \"./RegularizeFace\";\nimport { MultiLineStringDataVariant, Triangulator } from \"./Triangulation\";\n\nexport class GraphSplitData {\n  public numUpEdge = 0;\n  public numIntersectionTest = 0;\n  public numSplit = 0;\n  public numPopOut = 0;\n  public numA0B0 = 0;\n  public numA0B1 = 0;\n  public constructor() {\n  }\n}\n\n/**\n * * Assorted methods used in algorithms on HalfEdgeGraph.\n * @internal\n */\nexport class HalfEdgeGraphOps {\n\n  /** Compare function for sorting with primary y compare, secondary  x compare. */\n  public static compareNodesYXUp(a: HalfEdge, b: HalfEdge) {\n    // Check y's\n    // if (!Geometry.isSameCoordinate(a.y, b.y))\n    if (a.y < b.y)\n      return -1;\n    else if (a.y > b.y)\n      return 1;\n    // Check x's\n    // if (!Geometry.isSameCoordinate(a.x, b.x))\n    if (a.x < b.x)\n      return -1;\n    else if (a.x > b.x)\n      return 1;\n    return 0;\n  }\n\n  /** Return true if nodeB (a) is lower than both its neighbors and (b) inflects as a downward peak (rather than an upward trough) */\n  public static isDownPeak(nodeB: HalfEdge) {\n    const nodeA = nodeB.facePredecessor;\n    const nodeC = nodeB.faceSuccessor;\n    return this.compareNodesYXUp(nodeB, nodeA) < 0\n      && this.compareNodesYXUp(nodeB, nodeC) < 0\n      && this.crossProductToTargets(nodeB, nodeA, nodeC) > 0;\n  }\n\n  /** return the cross product of vectors from base to targetA and base to targetB\n   * @param base base vertex of both vectors.\n   * @param targetA target vertex of first vector\n   * @param targetB target vertex of second vector\n   */\n  public static crossProductToTargets(base: HalfEdge, targetA: HalfEdge, targetB: HalfEdge): number {\n    return Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);\n  }\n\n  // ---------------------------------------------------------------------------------------------------------------------\n  // ----------------------------------------------------------------------------------------------------------------------\n\n  public static graphRange(graph: HalfEdgeGraph): Range3d {\n    const range = Range3d.create();\n    for (const node of graph.allHalfEdges) {\n      range.extendXYZ(node.x, node.y, node.z);\n    }\n    return range;\n  }\n  /** Returns an array of a all nodes (both ends) of edges created from segments. */\n  public static segmentArrayToGraphEdges(segments: LineSegment3d[], returnGraph: HalfEdgeGraph, mask: HalfEdgeMask): HalfEdge[] {\n    const result = [];\n    let idxCounter = 0;\n\n    // Push the endpoints of each segment onto arr[] in the form {(x, y, theta), Node}\n    for (const segment of segments) {\n\n      const node0 = returnGraph.createEdgeXYZXYZ(\n        segment.point0Ref.x, segment.point0Ref.y, segment.point0Ref.z,\n        idxCounter,\n        segment.point1Ref.x, segment.point1Ref.y, segment.point1Ref.z,\n        idxCounter + 1);\n\n      const node1 = node0.edgeMate;\n      idxCounter += 2;\n\n      node0.setMaskAroundFace(mask);   // Original given coordinates must be part of boundary\n      result.push(node0);\n      result.push(node1);\n    }\n\n    return result;\n  }\n\n  /**\n   * * For each face with positive area . . . add edges as needed so that each face has one definitely lower node and one definite upper node.\n   * * Hence tracing edges from the low node, there is a sequence of upward edges, reaching the upper,  then a sequence of downward edges reaching the low node.\n   * * This is an essential step for subsequent triangulation.\n   *\n   * @param graph\n   */\n  public static formMonotoneFaces(graph: HalfEdgeGraph) {\n\n    const allFaces = graph.collectFaceLoops();\n    graph.clearMask(HalfEdgeMask.VISITED);\n    // For every face, break the face down into monotone sections\n    for (const node of allFaces) {\n      if (node.isMaskSet(HalfEdgeMask.VISITED))\n        continue;\n      const area = node.signedFaceArea();\n      if (area <= 0.0) {\n        node.setMaskAroundFace(HalfEdgeMask.VISITED);\n        continue;\n      }\n\n    }\n  }\n\n  /**\n   * * Visit all nodes in `graph`.\n   * * invoke `pinch(node, vertexPredecessor)`\n   * * this leaves the graph as isolated edges.\n   * @param graph graph to modify\n   */\n  public static isolateAllEdges(graph: HalfEdgeGraph) {\n    for (const nodeA of graph.allHalfEdges) {\n      const nodeB = nodeA.vertexPredecessor;\n      HalfEdge.pinch(nodeA, nodeB);\n    }\n  }\n\n}\n/**\n * @internal\n */\nexport class HalfEdgeGraphMerge {\n  /** Simplest merge algorithm:\n   * * collect array of (x,y,theta) at all nodes\n   * * lexical sort of the array.\n   * * twist all vertices together.\n   * * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.\n   * * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.\n   * * Mask.NULL_FACE is cleared throughout and applied within null faces.\n   */\n  public static clusterAndMergeXYTheta(graph: HalfEdgeGraph, outboundRadiansFunction?: (he: HalfEdge) => number) {\n    const allNodes = graph.allHalfEdges;\n    const numNodes = allNodes.length;\n    graph.clearMask(HalfEdgeMask.NULL_FACE);\n    const clusters = new ClusterableArray(2, 2, numNodes);  // data order: x,y,theta, nodeIndex.  But theta is not set in first round.\n    for (let i = 0; i < numNodes; i++) {\n      const nodeA = allNodes[i];\n      const xA = nodeA.x;\n      const yA = nodeA.y;\n      HalfEdge.pinch(nodeA, nodeA.vertexSuccessor);  // pull it out of its current vertex loop.\n      clusters.addDirect(xA, yA, 0.0, i);\n    }\n    const order = clusters.clusterIndicesLexical();\n    let k0 = 0;\n    const numK = order.length;\n    for (let k1 = 0; k1 < numK; k1++) {\n      if (order[k1] === ClusterableArray.clusterTerminator) {\n        // nodes identified in order[k0]..order[k1] are properly sorted around a vertex.\n        if (k1 > k0) {\n          const iA = clusters.getExtraData(order[k0], 1);\n          const nodeA0 = allNodes[iA];\n          for (let k = k0 + 1; k < k1; k++) {\n            const iB = clusters.getExtraData(order[k], 1);\n            const nodeB = allNodes[iB];\n            nodeB.x = nodeA0.x;\n            nodeB.y = nodeA0.y;\n          }\n        }\n        k0 = k1 + 1;\n      }\n    }\n    // NOW\n    //  1) There are identical coordinates at all nodes around each vertex loop.\n    //  2) Hence ready do sort (at each vertex) by theta.\n\n    // insert theta as extra data in the sort table . . .\n    for (const clusterTableIndex of order) {\n      if (clusterTableIndex !== ClusterableArray.clusterTerminator) {\n        const nodeA = allNodes[clusterTableIndex];\n        const nodeB = nodeA.faceSuccessor;\n        let radians = outboundRadiansFunction ? outboundRadiansFunction(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);\n        if (Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI))\n          radians = Math.PI;\n        clusters.setExtraData(clusterTableIndex, 0, radians);\n      }\n    }\n    clusters.sortSubsetsBySingleKey(order, 2);\n    const unmatchedNullFaceNodes: HalfEdge[] = [];\n    k0 = 0;\n    let thetaA, thetaB;\n    // now pinch each neighboring pair together\n    for (let k1 = 0; k1 < numK; k1++) {\n      if (order[k1] === ClusterableArray.clusterTerminator) {\n        // nodes identified in order[k0]..order[k1] are properly sorted around a vertex.\n        if (k1 > k0) {\n          const iA = clusters.getExtraData(order[k0], 1);\n          thetaA = clusters.getExtraData(order[k0], 0);\n          const nodeA0 = allNodes[iA];\n          let nodeA = nodeA0;\n          for (let k = k0 + 1; k < k1; k++) {\n            const iB = clusters.getExtraData(order[k], 1);\n            thetaB = clusters.getExtraData(order[k], 0);\n            const nodeB = allNodes[iB];\n            if (nodeA.isMaskSet(HalfEdgeMask.NULL_FACE)) {\n              // nope, this edge was flagged and pinched from the other end.\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeA === node);\n              if (j >= 0) {\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\n                unmatchedNullFaceNodes.pop();\n              }\n              nodeA = nodeB;\n              thetaA = thetaB;\n            } else if (nodeB.isMaskSet(HalfEdgeMask.NULL_FACE)) {\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeA === node);\n              if (j >= 0) {\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\n                unmatchedNullFaceNodes.pop();\n              }\n              // NO leave nodeA and thetaA   ignore nodeB -- later step will get the outside of its banana.\n            } else {\n              HalfEdge.pinch(nodeA, nodeB);\n              if (Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\n                const nodeA1 = nodeA.faceSuccessor;\n                const nodeB1 = nodeB.edgeMate;\n                // WE TRUST -- nodeA1 and node B1 must have identical xy.\n                // pinch them together and mark the face loop as null ..\n                HalfEdge.pinch(nodeA1, nodeB1);\n                nodeA.setMask(HalfEdgeMask.NULL_FACE);\n                nodeB1.setMask(HalfEdgeMask.NULL_FACE);\n                unmatchedNullFaceNodes.push(nodeB1);\n              }\n              nodeA = nodeB;\n              thetaA = thetaB;\n            }\n          }\n        }\n        k0 = k1 + 1;\n      }\n    }\n  }\n\n  private static buildVerticalSweepPriorityQueue(graph: HalfEdgeGraph): HalfEdgePriorityQueueWithPartnerArray {\n    const sweepHeap = new HalfEdgePriorityQueueWithPartnerArray();\n    for (const p of graph.allHalfEdges) {\n\n      if (HalfEdgeGraphOps.compareNodesYXUp(p, p.faceSuccessor) < 0) {\n        sweepHeap.priorityQueue.push(p);\n      }\n    }\n    return sweepHeap;\n  }\n  private static snapFractionToNode(xy: Point2d, fraction: number, node: HalfEdge, nodeFraction: number): number{\n    if (Geometry.isSameCoordinate(xy.x, node.x) && Geometry.isSameCoordinate(xy.y, node.y))\n      return nodeFraction;\n    return fraction;\n}\n  private static computeIntersectionFractionsOnEdges(nodeA0: HalfEdge, nodeB0: HalfEdge, fractions: Vector2d, pointA: Point2d, pointB: Point2d): boolean {\n    const nodeA1 = nodeA0.faceSuccessor;\n    const ax0 = nodeA0.x;\n    const ay0 = nodeA0.y;\n    const ux = nodeA1.x - ax0;\n    const uy = nodeA1.y - ay0;\n    const nodeB1 = nodeB0.faceSuccessor;\n    const bx0 = nodeB0.x;\n    const by0 = nodeB0.y;\n    const vx = nodeB1.x - bx0;\n    const vy = nodeB1.y - by0;\n    if (SmallSystem.lineSegmentXYUVTransverseIntersectionUnbounded(ax0, ay0, ux, uy,\n      bx0, by0, vx, vy, fractions)) {\n      pointA.x = ax0 + fractions.x * ux;\n      pointA.y = ay0 + fractions.x * uy;\n      pointB.x = bx0 + fractions.y * vx;\n      pointB.y = by0 + fractions.y * vy;\n      fractions.x = this.snapFractionToNode(pointA, fractions.x, nodeA0, 0.0);\n      fractions.x = this.snapFractionToNode(pointA, fractions.x, nodeA1, 1.0);\n      fractions.y = this.snapFractionToNode(pointB, fractions.y, nodeB0, 0.0);\n      fractions.y = this.snapFractionToNode(pointB, fractions.y, nodeB1, 1.0);\n      return Geometry.isIn01(fractions.x) && Geometry.isIn01(fractions.y);\n    }\n    return false;\n  }\n  /**\n   * Split edges at intersections.\n   * * This is a large operation.\n   * @param graph\n   */\n  public static splitIntersectingEdges(graph: HalfEdgeGraph): GraphSplitData {\n    const data = new GraphSplitData();\n    const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);\n    let nodeA0, nodeB1;\n    const smallFraction = 1.0e-8;\n    const largeFraction = 1.0 - smallFraction;\n    let i;\n    const fractions = Vector2d.create();\n    const pointA = Point2d.create();\n    const pointB = Point2d.create();\n    let nodeB0;\n    const popTolerance = Geometry.smallMetricDistance;\n    while (undefined !== (nodeA0 = sweepHeap.priorityQueue.pop())) {\n      data.numUpEdge++;\n      const n0 = sweepHeap.activeEdges.length;\n      sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - popTolerance);\n      data.numPopOut += n0 - sweepHeap.activeEdges.length;\n      for (i = 0; i < sweepHeap.activeEdges.length; i++) {\n        nodeB0 = sweepHeap.activeEdges[i];\n        nodeB1 = nodeB0.faceSuccessor;\n        // const nodeB1 = nodeB0.faceSuccessor;\n        if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y)) {\n          data.numA0B0++;\n        } else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y)) {\n          data.numA0B1++;\n        } else {\n          data.numIntersectionTest++;\n          if (this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, fractions, pointA, pointB)) {\n            if (fractions.x > smallFraction && fractions.x < largeFraction) {\n              const nodeC0 = graph.splitEdgeAtFraction(nodeA0, fractions.x);\n              sweepHeap.priorityQueue.push(nodeC0);  // The upper portion will be reviewed as a nodeA0 later !!!\n              data.numSplit++;\n            }\n            if (fractions.y > smallFraction && fractions.y < largeFraction) {\n              const nodeD0 = graph.splitEdgeAtFraction(nodeB0, fractions.y);\n              sweepHeap.priorityQueue.push(nodeD0);  // The upper portion will be reviewed as a nodeA0 later !!!\n              data.numSplit++;\n            }\n            // existing nodeA0 and its shortened edge remain for further intersections\n          }\n        }\n      }\n      sweepHeap.activeEdges.push(nodeA0);\n    }\n    return data;\n  }\n\n  /**\n   * Returns a graph structure formed from the given LineSegment array\n   *\n   * *  Find all intersections among segments, and split them if necessary\n   * *  Record endpoints of every segment in the form X, Y, Theta; This information is stored as a new node and sorted to match up\n   *      vertices.\n   * *  For vertices that match up, pinch the nodes to create vertex loops, which in closed objects, will also eventually form face\n   *      loops\n   */\n  public static formGraphFromSegments(lineSegments: LineSegment3d[]): HalfEdgeGraph {\n    // Structure of an index of the array: { xyTheta: Point3d, node: Node }\n    const graph = new HalfEdgeGraph();\n    HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, HalfEdgeMask.BOUNDARY_EDGE);\n    this.splitIntersectingEdges(graph);\n    this.clusterAndMergeXYTheta(graph);\n\n    return graph;\n  }\n\n  /**\n   * * Input is random linestrings, not necessarily loops\n   * * Graph gets full splitEdges, regularize, and triangulate.\n   * @returns triangulated graph, or undefined if bad data.\n   */\n  public static formGraphFromChains(chains: MultiLineStringDataVariant, regularize: boolean = true, mask: HalfEdgeMask = HalfEdgeMask.PRIMARY_EDGE): HalfEdgeGraph | undefined {\n    if (chains.length < 1)\n      return undefined;\n    const graph = new HalfEdgeGraph();\n    const chainSeeds = Triangulator.directCreateChainsFromCoordinates(graph, chains);\n    for (const seed of chainSeeds)\n      seed.setMaskAroundFace(mask);\n\n    this.splitIntersectingEdges(graph);\n    this.clusterAndMergeXYTheta(graph);\n    if (regularize) {\n      const context = new RegularizationContext(graph);\n      context.regularizeGraph(true, true);\n    }\n    return graph;\n  }\n\n}\n"]}

package/lib/topology/RegularizeFace.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"RegularizeFace.d.ts","sourceRoot":"","sources":["../../src/topology/RegularizeFace.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAgB,MAAM,SAAS,CAAC;AAIhE;;;GAGG;AACH,qBAAa,qBAAqB;IAMhC,OAAc,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;gBAC1F,KAAK,EAAE,aAAa;IAUvC;;OAEG;IACI,KAAK,EAAE,aAAa,CAAC;IAC5B,6GAA6G;IACtG,OAAO,EAAE,QAAQ,EAAE,CAAC;IAC3B,8GAA8G;IACvG,SAAS,EAAE,QAAQ,EAAE,CAAC;IAC7B,2FAA2F;IACpF,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAC5B,6FAA6F;IACtF,WAAW,EAAE,QAAQ,EAAE,CAAC;IAE/B,kGAAkG;IAC3F,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAC5B,oGAAoG;IAC7F,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAC5B;;;;OAIG;IACI,+BAA+B,CAAC,QAAQ,EAAE,QAAQ;IAuCzD;;;;OAIG;IACI,uCAAuC,CAAC,cAAc,EAAE,QAAQ,EAAE;IAsCzE,OAAO,CAAC,UAAU;IAMlB;;;;;;;;OAQG;IACH,OAAO,CAAC,kBAAkB;IA4B1B;;;;;OAKG;IACH,OAAO,CAAC,uBAAuB;IA+B/B,OAAO,CAAC,aAAa;IAUrB,OAAO,CAAC,QAAQ;IAMhB,OAAO,CAAC,gCAAgC;IAaxC,wGAAwG;IACxG,OAAO,CAAC,iBAAiB;IASzB;;;;;OAKG;IACH,OAAO,CAAC,SAAS;IAajB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,iBAAiB;IAiCzB;;;;;;;;;;OAUG;IACI,cAAc,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc;IAKrF,eAAe,CAAC,OAAO,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc;IAKzE,yEAAyE;WAC3D,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAsBlE;;;;;;OAMG;WACW,gCAAgC,CAC5C,KAAK,EAAE,aAAa,EACpB,gBAAgB,EAAE,OAAO,EACzB,MAAM,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,QAAQ,GAAG,SAAS,EAChD,WAAW,EAAE,QAAQ,EAAE,GAAG,SAAS,EACnC,aAAa,EAAE,QAAQ,EAAE,GAAG,SAAS;CAwBxC"}

package/lib/topology/RegularizeFace.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"RegularizeFace.js","sourceRoot":"","sources":["../../src/topology/RegularizeFace.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,mCAAgE;AAChE,uCAA6C;AAE7C,oCAAoC;AACpC;;;GAGG;AACH,MAAa,qBAAqB;IAOhC,YAAmB,KAAoB;QACrC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IACrB,CAAC;IAmBD;;;;OAIG;IACI,+BAA+B,CAAC,QAAkB;QACvD,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,GAAG;YACD,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aAEF;iBAAM,EAAE,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE;oBACR,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aACF;YACD,KAAK,GAAG,KAAK,CAAC;SACf,QAAQ,KAAK,KAAK,QAAQ,EAAE;IAC/B,CAAC;IAED;;;;OAIG;IACI,uCAAuC,CAAC,cAA0B;QACvE,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,KAAK,KAAK,IAAI,cAAc,EAAE;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aAEF;iBAAM,EAAE,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE;oBACR,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aACF;SACF;IACH,CAAC;IAEO,UAAU;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC;QAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QAC9E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QAC1E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC;QAAC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAClF,CAAC;IAED;;;;;;;;OAQG;IACK,kBAAkB,CAAC,IAAc,EAAE,UAAsB,EAC/D,aAAqB;QACrB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,CAAC;QACP,IAAI,aAAa,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAC5C,IAAI,MAA4B,CAAC;QACjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;YAClC,MAAM,QAAQ,GAAG,SAAS,CAAC,aAAa,CAAC;YACzC,IAAI,SAAS,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI;gBACzC,SAAS;YACX,0FAA0F;YAC1F,MAAM,MAAM,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAClE,MAAM,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC/D,iEAAiE;YACjE,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC;gBACpB,SAAS;YACX,MAAM,QAAQ,GAAG,gBAAQ,CAAC,wBAAwB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAClE,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,EAAE,GAAG,aAAa,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC5D,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,aAAa,EAAE;oBAChC,MAAM,GAAG,SAAS,CAAC;oBACnB,aAAa,GAAG,EAAE,CAAC;iBACpB;aACF;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACK,uBAAuB,CAAC,QAAkB,EAAE,aAAmC,EAAE,WAAiC;QACxH,IAAI,WAAW,CAAC;QAEhB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,sCAAsC;YACtC,IAAI,WAAW,KAAK,SAAS,IAAI,0BAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC;gBACzF,SAAS;YACX,iGAAiG;YACjG,IAAI,0BAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE;gBAC3D,IAAI,aAAa,EAAE;oBACjB,MAAM,QAAQ,GAAG,gBAAQ,CAAC,wBAAwB,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;oBACtE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,EAAE,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,CAAC;wBAC3C,SAAS;iBACZ;gBACD,IAAI,WAAW,EAAE;oBACf,MAAM,QAAQ,GAAG,gBAAQ,CAAC,wBAAwB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE;wBACzC,SAAS;iBACZ;gBACD,WAAW,GAAG,MAAM,CAAC;aACtB;SACF;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAEO,aAAa,CAAC,OAA6B,EAAE,SAA+B,EAAE,OAA6C;QACjI,IAAI,CAAC,OAAO;YACV,OAAO,SAAS,CAAC;QACnB,IAAI,CAAC,SAAS;YACZ,OAAO,OAAO,CAAC;QACjB,oDAAoD;QACpD,IAAI,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,GAAG,CAAC;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,OAAO,CAAC;IACjB,CAAC;IACO,QAAQ;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE;YAC1C,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;SACd;IACH,CAAC;IACO,gCAAgC,CAAC,IAAc;QACrD,IAAI,SAAS,CAAC;QACd,MAAM,UAAU,GAAG,0BAAgB,CAAC,gBAAgB,CAAC;QACrD,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,CAAE,CAAC;QACrE,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAE,CAAC;QAC1E,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClE,IAAI,YAAY;YACd,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;QACpF,MAAM,gBAAgB,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QACtF,IAAI,gBAAgB,KAAK,SAAS;YAChC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;QAC1E,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,wGAAwG;IAChG,iBAAiB,CAAC,KAAe,EAAE,KAAe;QACxD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,GAAG;YACD,IAAI,gBAAQ,CAAC,qBAAqB,CAAC,KAAK,EAAE,MAAM,CAAC;gBAC/C,OAAO,MAAM,CAAC;YAChB,MAAM,GAAG,MAAM,CAAC,eAAe,CAAC;SACjC,QAAQ,MAAM,KAAK,KAAK,EAAE;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACK,SAAS,CAAC,KAAe,EAAE,KAAe,EAAE,SAAiB;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtG,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE;YAChD,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC9B,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,qBAAqB,CAAC,YAAY;gBACpC,qBAAqB,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC1E,OAAO,KAAK,CAAC;SACd;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACK,iBAAiB,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1E,IAAI,OAAO,EAAE;YACX,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,0BAAgB,CAAC,gBAAgB,CAAC,CAAC;YACzD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE;gBACzC,sEAAsE;gBACtE,IAAI,CAAC,0BAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,qGAAqG;oBACrG,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;iBACvC;aACF;SACF;QACD,IAAI,SAAS,EAAE;YACb,8BAA8B;YAC9B,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,yCAAyC;YACzC,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,0BAAgB,CAAC,gBAAgB,CAAC,CAAC;YACzD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE;gBACzC,IAAI,CAAC,0BAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;iBACxC;aACF;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,IAAI,CAAC,UAAU,EAAE,CAAC;SACnB;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACI,cAAc,CAAC,QAAkB,EAAE,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1F,IAAI,CAAC,+BAA+B,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAEM,eAAe,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QACvE,IAAI,CAAC,uCAAuC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACtE,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,cAAc,CAAC,IAAc;QACzC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,OAA6B,CAAC;QAClC,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,GAAG;YACD,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,EAAE,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,MAAM,EAAE,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE;gBAChB,IAAI,EAAE,GAAG,CAAC,EAAE;oBACV,MAAM,EAAE,CAAC;oBACT,OAAO,GAAG,KAAK,CAAC;iBACjB;gBACD,IAAI,EAAE,GAAG,CAAC,EAAE;oBACV,MAAM,EAAE,CAAC;iBACV;aACF;SACF,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,IAAI,EAAE;QACjD,OAAO,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,gCAAgC,CAC5C,KAAoB,EACpB,gBAAyB,EACzB,MAAgD,EAChD,WAAmC,EACnC,aAAqC;QACrC,IAAI,WAAW;YACb,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,aAAa;YACf,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,oBAAY,CAAC,OAAO,CAAC;QAClC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACvB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBAC7B,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,EAAE;oBAClD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC1B,IAAI,IAAI,EAAE;wBACR,IAAI,WAAW;4BACb,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;qBAC1B;yBAAM;wBACL,IAAI,aAAa;4BACf,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;qBAC5B;iBACF;aACF;SACF;IACH,CAAC;CAEF;AA/XD,sDA+XC","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 Topology\n */\n\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n//   /* eslint-disable no-console */\n/**\n * * Context for regularizing single faces.\n * @internal\n */\nexport class RegularizationContext {\n  // For debugging use ... \"almost always\" undefined.\n  // If defined, it is called with each inserted node pair.\n  // scale will be either plus or minus one.\n  // when it is negative, the node coordinates (both x and y) have been negated.\n  // The call is made after full insertion into vertex loop.\n  public static announceEdge?: (graph: HalfEdgeGraph, nodeA: HalfEdge, nodeB: HalfEdge, scale: number) => void;\n  public constructor(graph: HalfEdgeGraph) {\n    this.graph = graph;\n    this.upEdges = [];\n    this.downEdges = [];\n    this.bottomPeaks = [];\n    this.topPeaks = [];\n    this.localMin = [];\n    this.localMax = [];\n  }\n\n  /**\n   * These are public only for testing.\n   */\n  public graph: HalfEdgeGraph;\n  /** array of edges directed upward.  Turn can be left or right, but is not large enough to be a min or max */\n  public upEdges: HalfEdge[];\n  /** array of edges directed downward, Turn can be left or right, but is not large enough to be a min or max */\n  public downEdges: HalfEdge[];\n  /** Array of edges whose start is an upward peak (right turn, inbound up, outbound down) */\n  public topPeaks: HalfEdge[];\n  /** Array of edges whose start is an downward peak (right turn, inbound down, outbound up) */\n  public bottomPeaks: HalfEdge[];\n\n  /** Array of edges at local minima (left turn, inbound down, outbound up).  Ensuing chain is up */\n  public localMin: HalfEdge[];\n  /** Array of edges at local maxima (left turn, inbound up, outbound down).  Ensuing chain is down */\n  public localMax: HalfEdge[];\n  /**\n   * Collect (and classify) all the edges around a single face.\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\n   * @param faceSeed face to examine\n   */\n  public collectVerticalEventsAroundFace(faceSeed: HalfEdge) {\n    let nodeA = faceSeed;\n    let nodeB;\n    let nodeC;\n    let abUp;\n    let bcUp;\n    this.upEdges.length = 0;\n    this.downEdges.length = 0;\n    this.topPeaks.length = 0;\n    this.bottomPeaks.length = 0;\n    this.localMin.length = 0;\n    this.localMax.length = 0;\n    do {\n      nodeB = nodeA.faceSuccessor;\n      nodeC = nodeB.faceSuccessor;\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\n      if (abUp) {\n        this.upEdges.push(nodeA);\n        if (!bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\n            this.localMax.push(nodeB);\n          else\n            this.topPeaks.push(nodeB);\n        }\n\n      } else { // ab is DOWN\n        this.downEdges.push(nodeA);\n        if (bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\n            this.bottomPeaks.push(nodeB);\n          else\n            this.localMin.push(nodeB);\n        }\n      }\n      nodeA = nodeB;\n    } while (nodeA !== faceSeed);\n  }\n\n  /**\n   * Collect (and classify) all the edges in an array.\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\n   * @param candidateEdges array of edges.\n   */\n  public collectVerticalEventFromEdgesInAndArray(candidateEdges: HalfEdge[]) {\n    let nodeA;\n    let nodeB;\n    let nodeC;\n    let abUp;\n    let bcUp;\n    this.upEdges.length = 0;\n    this.downEdges.length = 0;\n    this.topPeaks.length = 0;\n    this.bottomPeaks.length = 0;\n    this.localMin.length = 0;\n    this.localMax.length = 0;\n    for (nodeA of candidateEdges) {\n      nodeB = nodeA.faceSuccessor;\n      nodeC = nodeB.faceSuccessor;\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\n      if (abUp) {\n        this.upEdges.push(nodeA);\n        if (!bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\n            this.localMax.push(nodeB);\n          else\n            this.topPeaks.push(nodeB);\n        }\n\n      } else { // ab is DOWN\n        this.downEdges.push(nodeA);\n        if (bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\n            this.bottomPeaks.push(nodeB);\n          else\n            this.localMin.push(nodeB);\n        }\n      }\n    }\n  }\n\n  private swapArrays() {\n    let save = this.downEdges; this.downEdges = this.upEdges; this.upEdges = save;\n    save = this.localMax; this.localMax = this.localMin; this.localMin = save;\n    save = this.topPeaks; this.topPeaks = this.bottomPeaks; this.bottomPeaks = save;\n  }\n\n  /**\n   * Find the edge (among candidates) which is first struck by a \"rightward\" scan from node\n   * * comparisonFunction determines scan sense\n   *   * HalfEdge.compareNodeYXTheta is an upward scan.\n   *   * HalfEdge.compareNodeYXThetaDownward is a downward scan.\n   * @param node\n   * @param candidates Array of nodes to search\n   * @param nodeComparisonFunction function for lexical comparison.\n   */\n  private findTopVisibleEdge(node: HalfEdge, candidates: HalfEdge[],\n    directionSign: number) {\n    const y0 = node.y;\n    const x0 = node.x;\n    let dx;\n    let distanceRight = Number.MAX_SAFE_INTEGER;\n    let result: HalfEdge | undefined;\n    for (const rightBase of candidates) {\n      const rightTop = rightBase.faceSuccessor;\n      if (rightBase === node || rightTop === node)\n        continue;\n      // for horizontal edge cases -- require edges ends to have strict sign change (no zeros!!)\n      const cRight = HalfEdgeGraphOps.compareNodesYXUp(node, rightBase);\n      const cTop = HalfEdgeGraphOps.compareNodesYXUp(node, rightTop);\n      // console.log(node.id, rightBase.id, rightTop.id, cRight, cTop);\n      if (cRight * cTop >= 0)\n        continue;\n      const fraction = HalfEdge.horizontalScanFraction01(rightBase, y0);\n      if (fraction !== undefined) {\n        dx = directionSign * (rightBase.fractionToX(fraction) - x0);\n        if (dx > 0 && dx < distanceRight) {\n          result = rightBase;\n          distanceRight = dx;\n        }\n      }\n    }\n    return result;\n  }\n  /**\n   *\n   * @param downPeak a \"bottom\" node where the interior CCW loop has a local min\n   * @param downEdgeStart (optional) node at the start (heading downwards!) of an edge that brackets downPeak on the left.\n   * @param upEdgeStart  (optional) node at the start (heading up!) of the edge that brackets downPeak on the right.\n   */\n  private highestUpPeakConnection(downPeak: HalfEdge, downEdgeStart: HalfEdge | undefined, upEdgeStart: HalfEdge | undefined): HalfEdge | undefined {\n    let highestPeak;\n\n    for (const upPeak of this.topPeaks) {\n      const y0 = upPeak.y;\n      const x0 = upPeak.x;\n      // is upPeak higher than prior upPeak?\n      if (highestPeak !== undefined && HalfEdgeGraphOps.compareNodesYXUp(upPeak, highestPeak) < 0)\n        continue;\n      // is upPeak BELOW downPeak, ABOVE both limit edges lower node, and between limit edge interiors.\n      if (HalfEdgeGraphOps.compareNodesYXUp(upPeak, downPeak) < 0) {\n        if (downEdgeStart) {\n          const fraction = HalfEdge.horizontalScanFraction01(downEdgeStart, y0);\n          if (fraction === undefined)\n            continue;\n          if (x0 <= downEdgeStart.fractionToX(fraction))\n            continue;\n        }\n        if (upEdgeStart) {\n          const fraction = HalfEdge.horizontalScanFraction01(upEdgeStart, y0);\n          if (fraction === undefined)\n            continue;\n          if (upEdgeStart.fractionToX(fraction) <= x0)\n            continue;\n        }\n        highestPeak = upPeak;\n      }\n    }\n    return highestPeak;\n  }\n\n  private updateMaxNode(maxNode: HalfEdge | undefined, candidate: HalfEdge | undefined, compare: (a: HalfEdge, b: HalfEdge) => number): HalfEdge | undefined {\n    if (!maxNode)\n      return candidate;\n    if (!candidate)\n      return maxNode;\n    // both are defined .. look for positive compare ...\n    if (compare(maxNode, candidate) < 0)\n      return candidate;\n    return maxNode;\n  }\n  private negateXY() {\n    for (const node of this.graph.allHalfEdges) {\n      node.x *= -1;\n      node.y *= -1;\n    }\n  }\n  private downwardConnectionFromBottomPeak(node: HalfEdge): HalfEdge | undefined {\n    let connectTo;\n    const upFunction = HalfEdgeGraphOps.compareNodesYXUp;\n    const upEdgeBase = this.findTopVisibleEdge(node, this.upEdges, 1.0)!;\n    const downEdgeBase = this.findTopVisibleEdge(node, this.downEdges, -1.0)!;\n    connectTo = this.updateMaxNode(connectTo, upEdgeBase, upFunction);\n    if (downEdgeBase)\n      connectTo = this.updateMaxNode(connectTo, downEdgeBase.faceSuccessor, upFunction);\n    const upPeakConnection = this.highestUpPeakConnection(node, downEdgeBase, upEdgeBase);\n    if (upPeakConnection !== undefined)\n      connectTo = this.updateMaxNode(connectTo, upPeakConnection, upFunction);\n    return connectTo;\n  }\n  /** Search around the vertex of nodeA for a nodeA1 such that nodeB is visible in the sector at nodeA1 */\n  private findVisibleSector(nodeA: HalfEdge, nodeB: HalfEdge): HalfEdge | undefined {\n    let nodeA1 = nodeA;\n    do {\n      if (HalfEdge.isNodeVisibleInSector(nodeB, nodeA1))\n        return nodeA1;\n      nodeA1 = nodeA1.vertexSuccessor;\n    } while (nodeA1 !== nodeA);\n    return undefined;\n  }\n  /**\n   * Create an edge from (some node around the vertex of) nodeA to (some node around the vertex of) nodeB.\n   * * looking around the vertex for alternate insertion corrects cusp insertion errors.\n   * @param nodeA\n   * @param nodeB\n   */\n  private joinNodes(nodeA: HalfEdge, nodeB: HalfEdge, direction: number): HalfEdge | undefined {\n    const nodeC = this.graph.createEdgeXYZXYZ(nodeA.x, nodeA.y, nodeA.z, 0, nodeB.x, nodeB.y, nodeB.z, 0);\n    const nodeA1 = this.findVisibleSector(nodeA, nodeB);\n    const nodeB1 = this.findVisibleSector(nodeB, nodeA);\n    if (nodeA1 !== undefined && nodeB1 !== undefined) {\n      HalfEdge.pinch(nodeA1, nodeC);\n      HalfEdge.pinch(nodeB1, nodeC.edgeMate);\n      if (RegularizationContext.announceEdge)\n        RegularizationContext.announceEdge(this.graph, nodeA, nodeB, direction);\n      return nodeC;\n    }\n    return undefined;\n  }\n  /**\n   * Regularize a single face.\n   * * Insert edge from any downward interior vertex to something lower\n   * * Insert an edge from each upward interior vertex to something higher.\n   * * The face is split into smaller faces\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\n   * @param faceSeed any representative half edge on the face\n   * @param upSweep true to do the upward sweep.\n   * @param downSweep true to do the downward sweep.\n   */\n  private runRegularization(upSweep: boolean = true, downSweep: boolean = true) {\n    if (upSweep) {\n      this.bottomPeaks.sort(HalfEdgeGraphOps.compareNodesYXUp);\n      for (const bottomPeak of this.bottomPeaks) {\n        // console.log(\"SEARCH\", bottomPeak.id, [bottomPeak.x, bottomPeak.y]);\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\n          continue;\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\n        if (target !== undefined) {\n          // console.log(\"join\", bottomPeak.id, [bottomPeak.x, bottomPeak.y], target.id, [target.x, target.y]);\n          this.joinNodes(bottomPeak, target, 1);\n        }\n      }\n    }\n    if (downSweep) {\n      // flip the whole graph (ouch)\n      this.negateXY();\n      // swap the various p and down seeds ....\n      this.swapArrays();\n      this.bottomPeaks.sort(HalfEdgeGraphOps.compareNodesYXUp);\n      for (const bottomPeak of this.bottomPeaks) {\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\n          continue;\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\n        if (target !== undefined) {\n          this.joinNodes(bottomPeak, target, -1);\n        }\n      }\n      this.negateXY();\n      this.swapArrays();\n    }\n  }\n\n  /**\n   * Regularize a single face.\n   * * Insert edge from any downward interior vertex to something lower\n   * * Insert an edge from each upward interior vertex to something higher.\n   * * The face is split into smaller faces\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\n   * @param faceSeed any representative half edge on the face\n   * @param upSweep true to do the upward sweep.\n   * @param downSweep true to do the downward sweep.\n   */\n  public regularizeFace(faceSeed: HalfEdge, upSweep: boolean = true, downSweep: boolean = true) {\n    this.collectVerticalEventsAroundFace(faceSeed);\n    this.runRegularization(upSweep, downSweep);\n  }\n\n  public regularizeGraph(upSweep: boolean = true, downSweep: boolean = true) {\n    this.collectVerticalEventFromEdgesInAndArray(this.graph.allHalfEdges);\n    this.runRegularization(upSweep, downSweep);\n  }\n\n  /** test if a single face is monotone;  if so, return its (single) min */\n  public static isMonotoneFace(seed: HalfEdge): HalfEdge | undefined {\n    let numMin = 0;\n    let numMax = 0;\n    let nodeMin: HalfEdge | undefined;\n    let nodeA = seed;\n    do {\n      const nodeB = nodeA.faceSuccessor;\n      const nodeC = nodeB.faceSuccessor;\n      const ab = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB);\n      const bc = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC);\n      if (ab * bc <= 0) {\n        if (ab > 0) {\n          numMin++;\n          nodeMin = nodeB;\n        }\n        if (bc > 0) {\n          numMax++;\n        }\n      }\n    } while ((nodeA = nodeA.faceSuccessor) !== seed);\n    return numMin === 1 && numMax === 1 ? nodeMin : undefined;\n  }\n  /** Return faces filtered by area and test function.\n   * * find one arbitrary representative of each face\n   * * offer the candidate to the mutate function.\n   * * collect results\n   * @param mappedSeeds when filter returns a HalfEdge, collect it here\n   * @param unmappedSeeds when filter does not return a half edge, collect the candidate.\n   */\n  public static collectMappedFaceRepresentatives(\n    graph: HalfEdgeGraph,\n    positiveAreaOnly: boolean,\n    mutate: (seed: HalfEdge) => HalfEdge | undefined,\n    mappedEdges: HalfEdge[] | undefined,\n    unMappedSeeds: HalfEdge[] | undefined) {\n    if (mappedEdges)\n      mappedEdges.length = 0;\n    if (unMappedSeeds)\n      unMappedSeeds.length = 0;\n    const mask = HalfEdgeMask.VISITED;\n    graph.clearMask(mask);\n    for (const seed of graph.allHalfEdges) {\n      if (!seed.getMask(mask)) {\n        seed.setMaskAroundFace(mask);\n        if (!positiveAreaOnly || seed.signedFaceArea() > 0) {\n          const edge = mutate(seed);\n          if (edge) {\n            if (mappedEdges)\n              mappedEdges.push(edge);\n          } else {\n            if (unMappedSeeds)\n              unMappedSeeds.push(seed);\n          }\n        }\n      }\n    }\n  }\n\n}\n"]}

package/lib/topology/SignedDataSummary.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SignedDataSummary.d.ts","sourceRoot":"","sources":["../../src/topology/SignedDataSummary.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH;;;;GAIG;AACH,qBAAa,iBAAiB,CAAC,CAAC;IAC9B,qCAAqC;IAC9B,WAAW,EAAE,MAAM,CAAC;IAC3B,oCAAoC;IAC7B,WAAW,EAAE,MAAM,CAAC;IAC3B,iCAAiC;IAC1B,WAAW,EAAE,MAAM,CAAC;IAC3B,oCAAoC;IAC7B,WAAW,EAAE,MAAM,CAAC;IAC3B,gCAAgC;IACzB,OAAO,EAAE,MAAM,CAAC;IACvB,uDAAuD;IAChD,mBAAmB,CAAC,EAAE,CAAC,CAAC;IAC/B,oDAAoD;IAC7C,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACxB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,oBAAoB,EAAE,MAAM,CAAC;IACpC,uCAAuC;IAChC,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,+BAA+B;IACxB,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;IAC3B,mCAAmC;IAC5B,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,+CAA+C;gBAC5B,YAAY,EAAE,OAAO;IAUxC,8CAA8C;IACvC,YAAY,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM;CAyB1C"}

package/lib/topology/SignedDataSummary.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SignedDataSummary.js","sourceRoot":"","sources":["../../src/topology/SignedDataSummary.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH;;;;GAIG;AACH,MAAa,iBAAiB;IAuB5B,+CAA+C;IAC/C,YAAmB,YAAqB;QACtC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;QAC1C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;QACzD,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,GAAG,GAAG,CAAC;QAC5D,IAAI,YAAY,EAAE;YAChB,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;SACzB;IACH,CAAC;IACD,8CAA8C;IACvC,YAAY,CAAC,IAAO,EAAE,IAAY;QACvC,IAAI,IAAI,GAAG,CAAC,EAAE;YACZ,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC;YACzB,IAAI,IAAI,CAAC,iBAAiB;gBACxB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,GAAG,IAAI,CAAC,oBAAoB,EAAE;gBACpC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC;gBACjC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC;aACjC;SACF;aAAM,IAAI,IAAI,GAAG,CAAC,EAAE;YACnB,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC;YACzB,IAAI,IAAI,CAAC,iBAAiB;gBACxB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,GAAG,IAAI,CAAC,oBAAoB,EAAE;gBACpC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC;gBACjC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC;aACjC;SACF;aAAM;YACL,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,aAAa;gBACpB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACjC;IACH,CAAC;CACF;AA5DD,8CA4DC","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 Topology\r\n */\r\n/**\r\n * Class to accumulate statistics about a stream of signed numbers with tag items.\r\n * * All sums, counts, extrema, and item values are initialized to zero in the constructor.\r\n * * Each call to `announceItem (item, value)` updates the various sums, counts, and extrema.\r\n */\r\nexport class SignedDataSummary<T> {\r\n  /** sum of all positive area items */\r\n  public positiveSum: number;\r\n  /** number of positive area items */\r\n  public numPositive: number;\r\n  /** sum of negative area items */\r\n  public negativeSum: number;\r\n  /** number of negative area items */\r\n  public numNegative: number;\r\n  /** number of zero area items */\r\n  public numZero: number;\r\n  /** the tag item item with the largest positive data */\r\n  public largestPositiveItem?: T;\r\n  /** the tag item item with the most negative data */\r\n  public largestNegativeItem?: T;\r\n  public largestPositiveValue: number;\r\n  public largestNegativeValue: number;\r\n  /** array of all negative area items */\r\n  public negativeItemArray?: T[];\r\n  /** array of zero area items */\r\n  public zeroItemArray?: T[];\r\n  /** array of positive area items */\r\n  public positiveItemArray?: T[];\r\n  /** setup with zero sums and optional arrays */\r\n  public constructor(createArrays: boolean) {\r\n    this.positiveSum = this.negativeSum = 0.0;\r\n    this.numPositive = this.numNegative = this.numZero = 0.0;\r\n    this.largestPositiveValue = this.largestNegativeValue = 0.0;\r\n    if (createArrays) {\r\n      this.negativeItemArray = [];\r\n      this.positiveItemArray = [];\r\n      this.zeroItemArray = [];\r\n    }\r\n  }\r\n  /** update with an item and its data value. */\r\n  public announceItem(item: T, data: number) {\r\n    if (data < 0) {\r\n      this.numNegative++;\r\n      this.negativeSum += data;\r\n      if (this.negativeItemArray)\r\n        this.negativeItemArray.push(item);\r\n      if (data < this.largestNegativeValue) {\r\n        this.largestNegativeValue = data;\r\n        this.largestNegativeItem = item;\r\n      }\r\n    } else if (data > 0) {\r\n      this.numPositive++;\r\n      this.positiveSum += data;\r\n      if (this.positiveItemArray)\r\n        this.positiveItemArray.push(item);\r\n      if (data > this.largestPositiveValue) {\r\n        this.largestPositiveValue = data;\r\n        this.largestPositiveItem = item;\r\n      }\r\n    } else {\r\n      this.numZero++;\r\n      if (this.zeroItemArray)\r\n        this.zeroItemArray.push(item);\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/topology/Triangulation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Triangulation.d.ts","sourceRoot":"","sources":["../../src/topology/Triangulation.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAIxD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAGlD;;;GAGG;AACH,oBAAY,qBAAqB,GAAG,oBAAoB,GAAG,MAAM,EAAE,GAAG,KAAK,EAAE,GAAG,MAAM,EAAE,EAAE,CAAC;AAE3F;;;GAGG;AACH,oBAAY,0BAA0B,GAAG,qBAAqB,GAAG,qBAAqB,EAAE,CAAC;AAEzF;;;GAGG;AACH,qBAAa,YAAY;IAEvB;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAiBvC;;;;;;;;;;;;;;;;;OAiBG;WACW,0CAA0C,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAiClF;;;;OAIG;WACW,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM;IASzD;;;;OAIG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,EAAE,aAAa,GAAG,MAAM;IA6B1F;;;OAGG;WACW,iCAAiC,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,aAAa,GAAG,SAAS;IAiC7F;;;;;OAKG;WACW,gCAAgC,CAAC,KAAK,EAAE,gBAAgB,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,aAAa,GAAG,SAAS;IA+ChH;;OAEG;WACW,+BAA+B,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAc5E;;;;OAIG;WACW,qCAAqC,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,gBAAgB,GAAG,aAAa,GAAG,SAAS;IAahH;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAoBhC;;;OAGG;WACW,mCAAmC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,qBAAqB,GAAG,QAAQ,GAAG,SAAS;IAiB1H;;;;;;OAMG;WACW,iCAAiC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,EAAE,GAAE,MAAU,GAAG,QAAQ,EAAE;IAOnI;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAwBvC;;;;;;OAMG;WACW,6BAA6B,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS;IAO5K;;;;;;;;OAQG;WACW,qCAAqC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,OAAO,EACpI,gBAAgB,EAAE,YAAY,EAC9B,gBAAgB,EAAE,YAAY,GAAG,QAAQ,GAAG,SAAS;IAKvD;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAWjC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAYjC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAwC7B;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAyDpC,iBAAiB;IACjB,OAAO,CAAC,MAAM,CAAC,WAAW,CAA4B;IACtD,gBAAgB;IAChB,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAS;IAEhD;;;;mBAIe;WACD,eAAe,IAAI,aAAa,GAAG,SAAS;IAM1D;;;;mBAIe;WACD,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,SAAS;IAC5D;;;;;;;;;mBASe;WACD,+BAA+B,CAAC,KAAK,EAAE,OAAO;IAM5D,OAAO,CAAC,MAAM,CAAC,aAAa,CAAwB;IACpD,OAAO,CAAC,MAAM,CAAC,SAAS,CAAwB;IAChD,OAAO,CAAC,MAAM,CAAC,UAAU,CAAwB;IACjD,OAAO,CAAC,MAAM,CAAC,OAAO,CAIpB;IACF,yEAAyE;IACzE,OAAO,CAAC,MAAM,CAAC,KAAK;IA0DpB;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAYzC,mEAAmE;IACnE,OAAO,CAAC,MAAM,CAAC,QAAQ;IAIvB,2FAA2F;IAC3F,OAAO,CAAC,MAAM,CAAC,aAAa;IAQ5B;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IA+D7B,OAAO,CAAC,MAAM,CAAC,WAAW;IAW1B;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,eAAe;IAK9B,OAAO,CAAC,MAAM,CAAC,cAAc;IAK7B;;;MAGE;IACF,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAInC;MACE;IACF,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAe9C,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAInC,iDAAiD;IACjD,OAAO,CAAC,MAAM,CAAC,aAAa;IAM5B;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,SAAS;IAWxB;;;OAGG;WACW,6BAA6B,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,GAAG,OAAO;CAuI5F"}