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

package/lib/esm/topology/HalfEdgeGraphSpineContext.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HalfEdgeGraphSpineContext.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphSpineContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAChF,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;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,OAAO,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,QAAQ,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,MAAM,OAAO,yBAAyB;IAOpC;;;OAGG;IACH;QACE,IAAI,CAAC,WAAW,GAAG,IAAI,aAAa,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,YAAY,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,OAAO,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,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAErD,MAAM,YAAY,GAAG,QAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,MAAM,YAAY,GAAG,QAAQ,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,OAAO,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,QAAQ,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,QAAQ,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,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,QAAQ,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,YAAY,CAAC,QAAQ,CAAC;mBACjC,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAG,4BAA4B;mBACtE,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAG,4BAA4B;mBACtE,EAAE,CAAC,OAAO,CAAC,YAAY,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,QAAQ,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,OAAO,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,YAAY,CAAC,aAAa,CAAC,CAAC;YACpE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,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,OAAO,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,YAAY,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,YAAY,CAAC,aAAa,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;YAC1C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC5B,OAAO,GAAG,KAAK,CAAC;aACjB;iBAAM;gBACL,QAAQ,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,QAAQ,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,kBAAkB,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtD,kBAAkB,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,QAAQ,CAAC,eAAe,CAAC,yBAAyB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;QACxE,MAAM,QAAQ,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,QAAQ,CAAC,eAAe,CAAC,KAAK,EAAE,yBAAyB,CAAC,YAAY,CAAC,CAAC;QACxE,IAAI,WAAW,EAAE;YACf,mBAAmB,CAAC,iDAAiD,CAAC,IAAI,CAAC,KAAK,EAC9E,IAAI,kBAAkB,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;YAC7E,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;SAC5C;QAED,YAAY,CAAC,+BAA+B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,YAAY,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,YAAY,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,YAAY,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,KAAK,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;;AAjFc,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/esm/topology/HalfEdgeGraphValidation.d.ts

@@ -0,0 +1,52 @@
+/** @packageDocumentation
+ * @module Topology
+ */
+import { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from "./Graph";
+/** HalfEdgePointerInspector has methods to check HalfEdge objects for pointer errors.
+ * * For a one-step test of the whole graph,
+ */
+export declare class HalfEdgePointerInspector {
+    numUndefinedEdgeMate: number;
+    numUndefinedFS: number;
+    numUndefinedFP: number;
+    numFSFPError: number;
+    numMatePairError: number;
+    numTested: number;
+    numWithMatchedEdgeMate: number;
+    /** Clear all counts */
+    clearCounts(): void;
+    /** Inspect a single half edge.   Increment counters according to the half edge's pointers. */
+    inspectHalfEdge(he: HalfEdge): void;
+    /** Return true if all pointer pairings are correct for a complete half edge graph:
+     * * For each he:  `he.edgeMate.edgeMate === he`
+     * * For each he:  `he.faceSuccessor.facePredecessor !== he`
+     * * For each he:  `he.facePredecessor.faceSuccessor !== he`
+     */
+    get isValidClosedHalfEdgeGraph(): boolean;
+    /** Return true if all counts are correct for a half edge graph that has complete pairings:
+     * * For each he:  `he.edgeMate.edgeMate === he`
+     * * For each he:  `he.faceSuccessor.facePredecessor !== he`
+     * * For each he:  `he.facePredecessor.faceSuccessor !== he`
+     */
+    get isValidHalfEdgeGraphAllowRaggedBoundary(): boolean;
+    /** inspect all half edges of graph.
+     * All pointer counts are left in member vars for later inspection.
+     */
+    inspectHalfEdges(graph: HalfEdgeGraph): void;
+    /** Inspect a graph's pointer properties.
+     * @param expectAllMates [in] true for "complete" graph with
+     * @returns true if all pointers are valid
+     */
+    static inspectGraph(graph: HalfEdgeGraph, expectAllMates: boolean): boolean;
+}
+/** static methods to inspect mask consistency properties in HalfEdgeGraph. */
+export declare class HalfEdgeMaskValidation {
+    /**
+     * Test if a mask is used consistently around faces.
+     * * 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.
+     * @returns Return true if mask is "all or nothing around all faces"
+     *
+     */
+    static isMaskConsistentAroundAllFaces(graph: HalfEdgeGraph, mask: HalfEdgeMask): boolean;
+}
+//# sourceMappingURL=HalfEdgeGraphValidation.d.ts.map

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

@@ -0,0 +1 @@
+{"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/esm/topology/HalfEdgeGraphValidation.js

@@ -0,0 +1,107 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+// Search services for HalfEdgeGraph
+/** HalfEdgePointerInspector has methods to check HalfEdge objects for pointer errors.
+ * * For a one-step test of the whole graph,
+ */
+export class HalfEdgePointerInspector {
+    constructor() {
+        this.numUndefinedEdgeMate = 0;
+        this.numUndefinedFS = 0;
+        this.numUndefinedFP = 0;
+        this.numFSFPError = 0;
+        this.numMatePairError = 0;
+        this.numTested = 0;
+        this.numWithMatchedEdgeMate = 0;
+    }
+    /** Clear all counts */
+    clearCounts() {
+        this.numUndefinedEdgeMate = 0;
+        this.numUndefinedFP = 0;
+        this.numUndefinedFS = 0;
+        this.numFSFPError = 0;
+        this.numMatePairError = 0;
+        this.numWithMatchedEdgeMate = 0;
+        this.numTested = 0;
+    }
+    /** Inspect a single half edge.   Increment counters according to the half edge's pointers. */
+    inspectHalfEdge(he) {
+        this.numTested++;
+        if (he.facePredecessor === undefined)
+            this.numUndefinedFP++;
+        else if (he.facePredecessor.faceSuccessor !== he)
+            this.numFSFPError++;
+        if (he.faceSuccessor === undefined)
+            this.numUndefinedFS++;
+        else if (he.faceSuccessor.facePredecessor !== he)
+            this.numFSFPError++;
+        if (he.edgeMate === undefined)
+            this.numUndefinedEdgeMate++;
+        else if (he.edgeMate.edgeMate === he)
+            this.numWithMatchedEdgeMate++;
+        else
+            this.numMatePairError++;
+    }
+    /** Return true if all pointer pairings are correct for a complete half edge graph:
+     * * For each he:  `he.edgeMate.edgeMate === he`
+     * * For each he:  `he.faceSuccessor.facePredecessor !== he`
+     * * For each he:  `he.facePredecessor.faceSuccessor !== he`
+     */
+    get isValidClosedHalfEdgeGraph() {
+        return this.numWithMatchedEdgeMate === this.numTested
+            && this.numUndefinedFS === 0
+            && this.numUndefinedFP === 0
+            && this.numFSFPError === 0
+            && this.numMatePairError === 0;
+    }
+    /** Return true if all counts are correct for a half edge graph that has complete pairings:
+     * * For each he:  `he.edgeMate.edgeMate === he`
+     * * For each he:  `he.faceSuccessor.facePredecessor !== he`
+     * * For each he:  `he.facePredecessor.faceSuccessor !== he`
+     */
+    get isValidHalfEdgeGraphAllowRaggedBoundary() {
+        return this.numWithMatchedEdgeMate + this.numUndefinedEdgeMate === this.numTested
+            && this.numUndefinedFS === 0
+            && this.numUndefinedFP === 0
+            && this.numFSFPError === 0
+            && this.numMatePairError === 0;
+    }
+    /** inspect all half edges of graph.
+     * All pointer counts are left in member vars for later inspection.
+     */
+    inspectHalfEdges(graph) {
+        this.clearCounts();
+        for (const he of graph.allHalfEdges)
+            this.inspectHalfEdge(he);
+    }
+    /** Inspect a graph's pointer properties.
+     * @param expectAllMates [in] true for "complete" graph with
+     * @returns true if all pointers are valid
+     */
+    static inspectGraph(graph, expectAllMates) {
+        const inspector = new HalfEdgePointerInspector();
+        inspector.inspectHalfEdges(graph);
+        if (expectAllMates)
+            return inspector.isValidClosedHalfEdgeGraph;
+        return inspector.isValidHalfEdgeGraphAllowRaggedBoundary;
+    }
+}
+/** static methods to inspect mask consistency properties in HalfEdgeGraph. */
+export class HalfEdgeMaskValidation {
+    /**
+     * Test if a mask is used consistently around faces.
+     * * 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.
+     * @returns Return true if mask is "all or nothing around all faces"
+     *
+     */
+    static isMaskConsistentAroundAllFaces(graph, mask) {
+        for (const he of graph.allHalfEdges) {
+            if (he.faceSuccessor.getMask(mask) !== he.getMask(mask))
+                return false;
+        }
+        return true;
+    }
+}
+//# sourceMappingURL=HalfEdgeGraphValidation.js.map

package/lib/esm/topology/HalfEdgeGraphValidation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HalfEdgeGraphValidation.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphValidation.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAQ/F,oCAAoC;AACpC;;GAEG;AACH,MAAM,OAAO,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;AACD,8EAA8E;AAC9E,MAAM,OAAO,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","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/esm/topology/HalfEdgeMarkSet.d.ts

@@ -0,0 +1,232 @@
+import { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from "./Graph";
+/** @packageDocumentation
+ * @module Topology
+ */
+/**
+ * A class to manage a set of edges as both (a) an array of possible members and (b) mask bits.
+ * * A half edge is "in the MarkSet" if its mask is set.
+ * * The MarkSet array is a superset of the half edges in the set.
+ * * Entry of a HalfEdge into the set is indicated by both
+ *    * adding the HalfEdge to the array
+ *    * setting the mask on the half edge, edge, face, or vertex
+ * * Half edges can "go out of the MarkSet" if the mask is cleared.
+ *   * This clearing can happen independently of the array management.
+ *   * Hence the array can contain half edges that are no longer in the MarkSet
+ *   * the "remove" methods monitor this.
+ * * Derived classes expand this concept for edge, vertex, or face MarkSets.
+ *   * a single representative of an edge, vertex, or face is entered to the array
+ *   * all edges around the edge, vertex, or face are marked with the mask
+ *   * Hence the array contains one or more representatives of the edge, face, or vertex
+ * * This allows quick query for both:
+ *   * Testing the mask gives constant time test of whether a HalfEdge is in the set
+ *   * access through the array gives direct access to the HalfEdge pointers
+ * @internal
+ */
+export declare abstract class AbstractHalfEdgeGraphMarkSet {
+    private _graph;
+    private _candidates;
+    protected _mask: HalfEdgeMask;
+    protected constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask);
+    /** remove all nodes from the set.
+     * * This pops from the array, clearing masks as the pop.
+     * * Note that it does NOT walk the entire graph to clear masks.
+     */
+    clear(): void;
+    /**
+     * count the number of active members.
+     * * This is the number of HalfEdges which are (a) in the array and (b) masked.
+     */
+    getLength(): number;
+    /**
+     * Return the number of candidates.
+     * * This may be more than `getLength ()`
+     * * This will typically only be called by the iterator.
+     */
+    getNumCandidates(): number;
+    /** Read property accessor: return the graph */
+    get graph(): HalfEdgeGraph;
+    /** return borrowed assets (the mask!) to the graph. */
+    teardown(): void;
+    /** (Read property) return the mask used to mark members of the set. */
+    get mask(): HalfEdgeMask;
+    /** pop and return the last node out of the array, without testing if it is still marked. */
+    protected popAndReturn(): HalfEdge | undefined;
+    /**
+     * * read at an index in the candidates array.
+     * * if that candidate has the mask, return it.
+     * * otherwise return undefined.
+     * * REMARK: This is only to be called by the iterator.
+     */
+    getAtIndex(index: number): HalfEdge | undefined;
+    /** Add a node to the set.  This means
+     * * Set the mask
+     * * push the node on the array
+     * * (BUT!) If the node already has the mask, do nothing.
+     * * This base class method affects only the single given HalfEdge.
+     * * Derived classes for edge, face, and vertex will override this method and also set the mask around the larger structures.
+     * @returns true if the HalfEdge is a new member of the set, false if it was already in the set.
+     */
+    addToSet(candidate: HalfEdge): boolean;
+    /** Test if `candidate` is already in the set.
+     * * This examines only the mask.
+     */
+    isCandidateInSet(candidate: HalfEdge): boolean;
+    /**
+     * * If the candidate is not marked as a member of the MarkSet, do nothing.
+     * * If the candidate is marked:
+     *   * clear the mask
+     *   * but do NOT search the array.
+     *   * As the array is searched, the candidate will appear and be ignored because the mask is not set.
+     * @param candidate
+     * @return true if the candidate was a member (an hence removed), false if the candidate was not masked.
+     */
+    removeFromSet(candidate: HalfEdge): boolean;
+    /**
+     *  * Search the array to find any current set member
+     *  * If found, clear its mask and return it.
+     *  * If unmasked HalfEdges are found in the array, they are removed from the array.
+     */
+    chooseAndRemoveAny(): HalfEdge | undefined;
+    /** Set mask on candidate -- i.e. edge, face, vertex, or single half edge as required.
+     * * Base class only changes the candidate mask.
+     * * Derived classes change more masks around edge, face, or vertex.
+     */
+    protected abstract setMaskInScope(candidate: HalfEdge | undefined): void;
+    /** Clear mask on candidate -- i.e. edge, face, vertex, or single half edge as required.
+     * * Base class only changes the candidate mask.
+     * * Derived classes change more masks around edge, face, or vertex.
+     */
+    protected abstract clearMaskInScope(candidate: HalfEdge | undefined): void;
+    /**
+     * Return the number of half edges that would be set/cleared when dealing with this candidate.
+     * * This is always 1 for HalfEdgeMarkSet
+     * @param candidate
+     */
+    abstract countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number;
+    /** Create an iterator over member HalfEdges */
+    [Symbol.iterator](): IterableIterator<HalfEdge>;
+    /**
+     * * visit all half edges around face.
+     * * Add each to mark set.
+     */
+    addAroundFace(seed: HalfEdge): void;
+    /**
+     * * visit all half edges around vertex.
+     * * Add each to mark set.
+     */
+    addAroundVertex(seed: HalfEdge): void;
+}
+/**
+ * AbstractHalfEdgeGraphMarkSet specialized to manage the masks on individual half edges
+ * @internal
+ */
+export declare class MarkedHalfEdgeSt extends AbstractHalfEdgeGraphMarkSet {
+    constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask);
+    /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.
+     * * Returns undefined if unable to get a mask for the graph.
+     * * Undefined return can only happen if the caller is failing to return grabbed masks.
+     */
+    static create(graph: HalfEdgeGraph): MarkedHalfEdgeSt | undefined;
+    /**
+     * * Set mask on candidate's edge.
+     * * This overrides the base class implementation.
+     */
+    protected setMaskInScope(candidate: HalfEdge): void;
+    /**
+     * * Clear mask on candidate's edge.
+     * * This overrides the base class implementation.
+     */
+    protected clearMaskInScope(candidate: HalfEdge): void;
+    /**
+     * Return the number of half edges that would be set/cleared when dealing with this candidate.
+     * * This is always 1 for EdgeMarkSet
+     * * return 0 for undefined candidate
+     * @param candidate
+     */
+    countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number;
+}
+/**
+ * AbstractHalfEdgeGraphMarkSet specialized to manage the mask on both sides of edges.
+ * @internal
+ */
+export declare class MarkedEdgeSet extends AbstractHalfEdgeGraphMarkSet {
+    constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask);
+    /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.
+     * * Returns undefined if unable to get a mask for the graph.
+     * * Undefined return can only happen if the caller is failing to return grabbed masks.
+     */
+    static create(graph: HalfEdgeGraph): MarkedEdgeSet | undefined;
+    /**
+     * * Set mask on candidate's edge.
+     * * This overrides the base class implementation.
+     */
+    protected setMaskInScope(candidate: HalfEdge): void;
+    /**
+     * * Clear mask on candidate's edge.
+     * * This overrides the base class implementation.
+     */
+    protected clearMaskInScope(candidate: HalfEdge): void;
+    /**
+     * Return the number of half edges that would be set/cleared when dealing with this candidate.
+     * * This is always 2 for EdgeMarkSet
+     * @param candidate
+     */
+    countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number;
+}
+/**
+ * AbstractHalfEdgeGraphMarkSet specialized to manage the mask around faces
+ * @internal
+ */
+export declare class MarkedFaceSet extends AbstractHalfEdgeGraphMarkSet {
+    constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask);
+    /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.
+     * * Returns undefined if unable to get a mask for the graph.
+     * * Undefined return can only happen if the caller is failing to return grabbed masks.
+     */
+    static create(graph: HalfEdgeGraph): MarkedFaceSet | undefined;
+    /**
+     * * Set mask on (all nodes around) candidate's face
+     * * This overrides the base class implementation.
+     */
+    protected setMaskInScope(candidate: HalfEdge): void;
+    /**
+     * * Clear mask on (all nodes around) candidate's face.
+     * * This overrides the base class implementation.
+     */
+    protected clearMaskInScope(candidate: HalfEdge): void;
+    /**
+     * Return the number of half edges that would be set/cleared when dealing with this candidate.
+     * * This is the "aroundFace" count.
+     * @param candidate
+     */
+    countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number;
+}
+/**
+ * AbstractHalfEdgeGraphMarkSet specialized to manage the mask around faces
+ * @internal
+ */
+export declare class MarkedVertexSet extends AbstractHalfEdgeGraphMarkSet {
+    constructor(graph: HalfEdgeGraph, mask: HalfEdgeMask);
+    /** Create a new 'HalfEdgeMarkSet', operating on half edges with only themselves as scope.
+     * * Returns undefined if unable to get a mask for the graph.
+     * * Undefined return can only happen if the caller is failing to return grabbed masks.
+     */
+    static create(graph: HalfEdgeGraph): MarkedVertexSet | undefined;
+    /**
+     * * Set mask on (all nodes around) candidate's face
+     * * This overrides the base class implementation.
+     */
+    protected setMaskInScope(candidate: HalfEdge): void;
+    /**
+     * * Clear mask on (all nodes around) candidate's face.
+     * * This overrides the base class implementation.
+     */
+    protected clearMaskInScope(candidate: HalfEdge): void;
+    /**
+     * Return the number of half edges that would be set/cleared when dealing with this candidate.
+     * * This is the "aroundVertex" count.
+     * @param candidate
+     */
+    countHalfEdgesAroundCandidate(candidate: HalfEdge | undefined): number;
+}
+//# sourceMappingURL=HalfEdgeMarkSet.d.ts.map

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

@@ -0,0 +1 @@
+{"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"}