@itwin/core-geometry 5.1.0-dev.52 → 5.1.0-dev.53

package/lib/esm/geometry3d/SortablePolygon.js.map

@@ -1 +1 @@
-{"version":3,"file":"SortablePolygon.js","sourceRoot":"","sources":["../../../src/geometry3d/SortablePolygon.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAM/F,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,6BAA6B,EAAwB,MAAM,wBAAwB,CAAC;AAE7F,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAI1C;;;GAGG;AACH,MAAe,mBAAmB;CAuBjC;AACD;;GAEG;AACH,MAAM,cAAe,SAAQ,mBAAmB;IACvC,IAAI,CAAgC;IACnC,WAAW,CAAS;IAC5B,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC5D,YAAmB,IAAmC;QACpD,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,EAAS;QAC9B,OAAO,UAAU,CAAC,wBAAwB,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD;;OAEG;IACI,mBAAmB;QACxB,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC;YACrE,MAAM,CAAC,GAAG,IAAI,CAAC,8BAA8B,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YAClE,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,CAAC,CAAC;QACb,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACM,WAAW,KAAgD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9E,QAAQ;QACb,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACM,kBAAkB,CAAC,UAAkB;QAC1C,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,EAAE,CAAC;YACxC,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,IAAI,CAAC,GAAG,CAAC;QAC3B,CAAC;IACH,CAAC;IACM,8BAA8B,CAAC,SAAiB,EAAE,aAAqB;QAC5E,IAAI,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,+BAA+B,CAAC,SAAS,CAAC,CAAC;YACpE,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,+BAA+B,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YACxE,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACvC,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;YACxD,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7B,IAAI,MAAM,CAAC,gBAAgB,EAAE,EAAE,CAAC;gBAC9B,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC;oBACtB,MAAM,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC1D,KAAK,IAAI,QAAQ,GAAG,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,IAAI,GAAG,EAAE,CAAC;oBAC1D,MAAM,cAAc,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,QAAQ,GAAG,WAAW,CAAC,CAAC;oBACxE,IAAI,CAAC,KAAK,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC;wBAC5C,OAAO,cAAc,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CAEF;AACD;;GAEG;AACH,MAAM,WAAY,SAAQ,mBAAmB;IACpC,IAAI,CAAO;IACV,WAAW,CAAS;IAC5B,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC5D,YAAmB,IAAU;QAC3B,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,MAAM,WAAW,GAAG,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QACzD,IAAI,CAAC,WAAW,GAAG,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/E,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,EAAS;QAC9B,OAAO,SAAS,CAAC,wBAAwB,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IACM,+BAA+B,CAAC,UAAkB,EAAE,aAAqB;QAC9E,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YACjD,MAAM,GAAG,GAAG,SAAS,CAAC,6BAA6B,CAAC,aAAa,CAAC,CAAC;YACnE,GAAG,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,IAAI,IAAI,CAAC,WAAW,GAAG,GAAG;gBACxB,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YACnC,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAC1D,KAAK,IAAI,QAAQ,GAAG,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,IAAI,GAAG,EAAE,CAAC;gBAC1D,MAAM,cAAc,GAAG,GAAG,CAAC,eAAe,CAAC,QAAQ,GAAG,WAAW,CAAC,CAAC;gBACnE,IAAI,CAAC,KAAK,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC;oBAC5C,OAAO,cAAc,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;OAEG;IACI,mBAAmB;QACxB,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC;YAC9E,MAAM,CAAC,GAAG,IAAI,CAAC,+BAA+B,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YACnE,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,CAAC,CAAC;QACb,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACM,WAAW;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;QACzC,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YACzC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACrC,IAAI,KAAK,YAAY,cAAc,EAAE,CAAC;oBACpC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;YACD,OAAO,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACM,QAAQ;QACb,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IACM,kBAAkB,CAAC,UAAkB;QAC1C,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,EAAE,CAAC;YACxC,IAAI,CAAC,IAAI,CAAC,sBAAsB,EAAE,CAAC;YACnC,IAAI,CAAC,WAAW,IAAI,CAAC,GAAG,CAAC;QAC3B,CAAC;IACH,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,eAAe;IAClB,YAAY,CAAsB;IACnC,QAAQ,CAAW;IACnB,OAAO,CAAS;IAChB,KAAK,CAAU;IACf,WAAW,CAAU;IACrB,MAAM,CAAU;IAChB,cAAc,CAAU;IAC/B;;;OAGG;IACH,YAAmB,IAA0C,EAAE,KAAc;QAC3E,IAAI,IAAI,YAAY,6BAA6B;YAC/C,IAAI,CAAC,YAAY,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC;;YAE7C,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,WAAW,CAAC,KAAwB,EAAE,IAAmC;QACrF,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,IAAI,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,eAAe,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,QAAQ,CAAC,KAAwB,EAAE,IAAU;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3B,MAAM,eAAe,GAAG,IAAI,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,eAAe,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACK,MAAM,CAAC,qBAAqB,CAAC,KAAwB;QAC3D,+BAA+B;QAC/B,KAAK,CAAC,IAAI,CAAC,CAAC,KAAsB,EAAE,KAAsB,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAChG,8EAA8E;QAC9E,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;YACpC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,mBAAmB,EAAE,CAAC;YACvD,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,+DAA+D;gBAC/D,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC;gBACjC,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,SAAS,CAAC;gBACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;oBACzB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC3B,IAAI,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC3C,IAAI,CAAC,KAAK,SAAS,CAAC,YAAY,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,CAAC;4BACrD,QAAQ,CAAC,WAAW,GAAG,CAAC,CAAC;4BACzB,6HAA6H;4BAC7H,MAAM;wBACR,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,kBAAkB,CAAC,KAAwB;QACxD,MAAM,UAAU,GAAsC,EAAE,CAAC;QAEzD,2BAA2B;QAC3B,iEAAiE;QACjE,6EAA6E;QAC7E,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;YAC7B,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC;YACxB,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC;YACzC,IAAI,WAAW,KAAK,SAAS;gBAC3B,QAAQ,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC;YAC/C,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACrB,QAAQ,CAAC,YAAY,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;gBAC9C,QAAQ,CAAC,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC;gBAC5C,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpB,UAAU,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,WAAW,EAAG,CAAC,CAAC;YACjF,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC/C,MAAM,cAAc,GAAG,KAAK,CAAC,WAAY,CAAC,CAAC,cAAe,CAAC;gBAC3D,UAAU,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,WAAW,EAAG,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IACO,MAAM,CAAC,eAAe,CAAC,KAAwB;QACrD,MAAM,UAAU,GAAgB,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;QAC9B,2BAA2B;QAC3B,iEAAiE;QACjE,6EAA6E;QAC7E,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,QAAQ,EAAE,cAAc,EAAE,EAAE,CAAC;YACzE,MAAM,aAAa,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC;YAC9C,aAAa,CAAC,MAAM,GAAG,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;YAEtF,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;gBAC1B,aAAa,CAAC,YAAY,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;gBACnD,MAAM,aAAa,GAAG,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAG,CAAC;gBAC7D,IAAI,qBAA+C,CAAC;gBACpD,6CAA6C;gBAC7C,KAAK,IAAI,UAAU,GAAG,cAAc,GAAG,CAAC,EAAE,UAAU,GAAG,QAAQ,EAAE,UAAU,EAAE,EAAE,CAAC;oBAC9E,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;oBACpC,IAAI,SAAS,CAAC,WAAW,KAAK,cAAc,EAAE,CAAC;wBAC7C,IAAI,qBAAqB,KAAK,SAAS,EAAE,CAAC;4BACxC,qBAAqB,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;4BAC9C,qBAAqB,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;4BACjD,SAAS,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC;4BAChD,qBAAqB,CAAC,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC;wBACvE,CAAC;6BAAM,CAAC;4BACN,SAAS,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC;4BAChD,qBAAqB,CAAC,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC;wBACvE,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,IAAI,qBAAqB,KAAK,SAAS;oBACrC,UAAU,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;qBACpC,IAAI,aAAa,KAAK,SAAS;oBAClC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAEM,MAAM,CAAC,eAAe,CAAC,KAAwB;QACpD,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YACtB,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;aACf,CAAC;YACJ,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;YACzC,KAAK,MAAM,MAAM,IAAI,OAAO;gBAC1B,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClC,OAAO,WAAW,CAAC;QACrB,CAAC;IACH,CAAC;IACM,MAAM,CAAC,4BAA4B,CAAC,KAAwB;QACjE,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;IACM,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,CAAC;IACzC,CAAC;IACM,QAAQ;QACb,OAAO,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;IACtC,CAAC;IACM,kBAAkB,CAAC,UAAkB;QAC1C,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;IACnD,CAAC;IACM,mBAAmB;QACxB,OAAO,IAAI,CAAC,YAAY,CAAC,mBAAmB,EAAE,CAAC;IACjD,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 CartesianGeometry\n */\nimport { AnyRegion } from \"../curve/CurveTypes\";\nimport { CurveChain } from \"../curve/CurveCollection\";\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Loop } from \"../curve/Loop\";\nimport { ParityRegion } from \"../curve/ParityRegion\";\nimport { RegionOps } from \"../curve/RegionOps\";\nimport { UnionRegion } from \"../curve/UnionRegion\";\nimport { IndexedReadWriteXYZCollection, IndexedXYZCollection } from \"./IndexedXYZCollection\";\nimport { Point3d } from \"./Point3dVector3d\";\nimport { PolygonOps } from \"./PolygonOps\";\nimport { Range3d } from \"./Range\";\nimport { XAndY } from \"./XYZProps\";\n\n/** abstract base class for area-related queries of a loop.\n * * subclasses have particular logic for `Loop` and polygon data.\n * @internal\n */\nabstract class SimpleRegionCarrier {\n  public abstract classifyPointXY(xy: XAndY): number | undefined;\n  // Find any point on an edge.\n  // evaluate tangent.\n  // move to left or right according to signedArea, producing an interior point for the loop.\n  public abstract getAnyInteriorPoint(): Point3d | undefined;\n  /**\n   * * grab the loop formatted as a simple polygon.\n   * * stroke if necessary.\n   */\n  public abstract grabPolygon(): IndexedReadWriteXYZCollection | undefined;\n  /**\n   * * grab the loop formatted as a strongly typed loop object\n   */\n  public abstract grabLoop(): Loop | undefined;\n  /**\n   * (Property access) Return the signed area of the loop\n   */\n  public abstract get signedArea(): number;\n  /**\n   * If the current `signedArea` has different sign versus `targetSign`, reverse the loop in place.\n   */\n  public abstract reverseForAreaSign(targetSign: number): void;\n}\n/**\n * Implement `LoopCarrier` queries with the area as a polygon carried in an `IndexedReadWriteXYZCollection`\n */\nclass PolygonCarrier extends SimpleRegionCarrier {\n  public data: IndexedReadWriteXYZCollection;\n  private _signedArea: number;\n  public get signedArea(): number { return this._signedArea; }\n  public constructor(data: IndexedReadWriteXYZCollection) {\n    super();\n    this.data = data;\n    this._signedArea = PolygonOps.areaXY(data);\n  }\n  /**\n   * classify xy parts of point wrt this loop.\n   * @param xy\n   * @internal\n   */\n  public classifyPointXY(xy: XAndY): number | undefined {\n    return PolygonOps.classifyPointInPolygonXY(xy.x, xy.y, this.data);\n  }\n  /** Return some point \"inside\"\n   * NEEDS WORK: this returns a point ON --\n   */\n  public getAnyInteriorPoint(): Point3d | undefined {\n    for (let childIndex = 0; childIndex < this.data.length; childIndex++) {\n      const q = this.constructInteriorPointNearEdge(childIndex, 0.2349);\n      if (q !== undefined)\n        return q;\n    }\n    return undefined;\n  }\n  public grabPolygon(): IndexedReadWriteXYZCollection | undefined { return this.data; }\n  public grabLoop(): Loop | undefined {\n    return Loop.createPolygon(this.data);\n  }\n  public reverseForAreaSign(targetSign: number) {\n    if (targetSign * this._signedArea < 0.0) {\n      this.data.reverseInPlace();\n      this._signedArea *= -1.0;\n    }\n  }\n  public constructInteriorPointNearEdge(edgeIndex: number, fractionAlong: number): Point3d | undefined {\n    if (edgeIndex + 1 < this.data.length) {\n      const point0 = this.data.getPoint3dAtUncheckedPointIndex(edgeIndex);\n      const point1 = this.data.getPoint3dAtUncheckedPointIndex(edgeIndex + 1);\n      const vector = point0.vectorTo(point1);\n      const point = point0.interpolate(fractionAlong, point1);\n      vector.rotate90CCWXY(vector);\n      if (vector.normalizeInPlace()) {\n        if (this._signedArea < 0)\n          vector.scaleInPlace(-1.0);\n        const refDistance = Math.sqrt(Math.abs(this._signedArea));\n        for (let fraction = 1.0e-5; fraction < 3; fraction *= 5.0) {\n          const candidatePoint = point.plusScaled(vector, fraction * refDistance);\n          if (1 === this.classifyPointXY(candidatePoint))\n            return candidatePoint;\n        }\n      }\n    }\n    return undefined;\n  }\n\n}\n/**\n * Implement `LoopCarrier` queries with the area as a strongly typed `Loop`\n */\nclass LoopCarrier extends SimpleRegionCarrier {\n  public data: Loop;\n  private _signedArea: number;\n  public get signedArea(): number { return this._signedArea; }\n  public constructor(data: Loop) {\n    super();\n    this.data = data;\n    const areaMoments = RegionOps.computeXYAreaMoments(data);\n    this._signedArea = areaMoments !== undefined ? areaMoments.quantitySum : 0.0;\n  }\n  /**\n   * classify xy parts of point wrt this loop.\n   * @param xy\n   * @internal\n   */\n  public classifyPointXY(xy: XAndY): number | undefined {\n    return RegionOps.testPointInOnOutRegionXY(this.data, xy.x, xy.y);\n  }\n  public constructInteriorPointNearChild(childIndex: number, fractionAlong: number): Point3d | undefined {\n    if (childIndex < this.data.children.length) {\n      const primitive = this.data.children[childIndex];\n      const ray = primitive.fractionToPointAndUnitTangent(fractionAlong);\n      ray.direction.rotate90CCWXY(ray.direction);\n      if (this._signedArea < 0.0)\n        ray.direction.scaleInPlace(-1.0);\n      const refDistance = Math.sqrt(Math.abs(this._signedArea));\n      for (let fraction = 1.0e-5; fraction < 3; fraction *= 5.0) {\n        const candidatePoint = ray.fractionToPoint(fraction * refDistance);\n        if (1 === this.classifyPointXY(candidatePoint))\n          return candidatePoint;\n      }\n    }\n    return undefined;\n  }\n  /** Return some point \"inside\"\n   * NEEDS WORK: this returns a point ON --\n   */\n  public getAnyInteriorPoint(): Point3d | undefined {\n    for (let childIndex = 0; childIndex < this.data.children.length; childIndex++) {\n      const q = this.constructInteriorPointNearChild(childIndex, 0.2349);\n      if (q !== undefined)\n        return q;\n    }\n    return undefined;\n  }\n  public grabPolygon(): IndexedReadWriteXYZCollection | undefined {\n    const strokes = this.data.cloneStroked();\n    if (strokes instanceof CurveChain) {\n      const linestring = LineString3d.create();\n      for (const child of strokes.children) {\n        if (child instanceof CurvePrimitive) {\n          child.emitStrokes(linestring);\n        }\n      }\n      return linestring.numPoints() > 0 ? linestring.packedPoints : undefined;\n    }\n    return undefined;\n  }\n  public grabLoop(): Loop | undefined {\n    return this.data;\n  }\n  public reverseForAreaSign(targetSign: number) {\n    if (targetSign * this._signedArea < 0.0) {\n      this.data.reverseChildrenInPlace();\n      this._signedArea *= -1.0;\n    }\n  }\n}\n\n/**\n * A `SortablePolygon` carries a (single) loop with data useful for sorting for inner-outer structure.\n * @internal\n */\nexport class SortablePolygon {\n  private _loopCarrier: SimpleRegionCarrier;\n  public anyPoint?: Point3d;\n  public sortKey: number;\n  public range: Range3d;\n  public parentIndex?: number;\n  public isHole: boolean;\n  public outputSetIndex?: number;\n  /**\n   *\n   * @param loop Loop to capture.\n   */\n  public constructor(loop: IndexedReadWriteXYZCollection | Loop, range: Range3d) {\n    if (loop instanceof IndexedReadWriteXYZCollection)\n      this._loopCarrier = new PolygonCarrier(loop);\n    else\n      this._loopCarrier = new LoopCarrier(loop);\n    this.range = range;\n    this.sortKey = Math.abs(this._loopCarrier.signedArea);\n    this.isHole = false;\n  }\n  /** Push loop with sort data onto the array.\n   * * No action if no clear normal.\n   * * return true if pushed.\n   */\n  public static pushPolygon(loops: SortablePolygon[], loop: IndexedReadWriteXYZCollection): boolean {\n    const range = loop.getRange();\n    const sortablePolygon = new SortablePolygon(loop, range);\n    if (sortablePolygon.sortKey > 0.0) {\n      loops.push(sortablePolygon);\n      return true;\n    }\n    return false;\n  }\n  /** Push loop with sort data onto the array.\n   * * No action if no clear normal.\n   * * return true if pushed.\n   */\n  public static pushLoop(loops: SortablePolygon[], loop: Loop): boolean {\n    const range = loop.range();\n    const sortablePolygon = new SortablePolygon(loop, range);\n    if (sortablePolygon.sortKey > 0.0) {\n      loops.push(sortablePolygon);\n      return true;\n    }\n    return false;\n  }\n  /** Push loop with sort data onto the array.\n   * * No action if no clear normal.\n   * * return true if pushed.\n   */\n  private static assignParentsAndDepth(loops: SortablePolygon[]): void {\n    // Sort largest to smallest ...\n    loops.sort((loopA: SortablePolygon, loopB: SortablePolygon) => (loopB.sortKey - loopA.sortKey));\n    // starting with smallest loop, point each loop to smallest containing parent.\n    for (let i = loops.length; i-- > 0;) {\n      const thisLoop = loops[i];\n      const xy = thisLoop._loopCarrier.getAnyInteriorPoint();\n      if (xy !== undefined) {\n        // find smallest containing parent (search forward only to hit)\n        loops[i].parentIndex = undefined;\n        loops[i].outputSetIndex = undefined;\n        for (let j = i; j-- > 0;) {\n          const otherLoop = loops[j];\n          if (otherLoop.range.containsXY(xy.x, xy.y)) {\n            if (1 === otherLoop._loopCarrier.classifyPointXY(xy)) {\n              thisLoop.parentIndex = j;\n              // The loops are searched from small area to larger.  Any other containing loop is larger, so otherLoop must be the smallest.\n              break;\n            }\n          }\n        }\n      }\n    }\n  }\n\n  private static assemblePolygonSet(loops: SortablePolygon[]): IndexedReadWriteXYZCollection[][] {\n    const outputSets: IndexedReadWriteXYZCollection[][] = [];\n\n    // In large-to-small order:\n    // If a loop has no parent or has a \"hole\" as parent it is outer.\n    // otherwise (i.e. it has a non-hole parent) it becomes a hole in the parent.\n    for (const loopData of loops) {\n      loopData.isHole = false;\n      const parentIndex = loopData.parentIndex;\n      if (parentIndex !== undefined)\n        loopData.isHole = !loops[parentIndex].isHole;\n      if (!loopData.isHole) {\n        loopData._loopCarrier.reverseForAreaSign(1.0);\n        loopData.outputSetIndex = outputSets.length;\n        outputSets.push([]);\n        outputSets[loopData.outputSetIndex].push(loopData._loopCarrier.grabPolygon()!);\n      } else {\n        loopData._loopCarrier.reverseForAreaSign(-1.0);\n        const outputSetIndex = loops[parentIndex!].outputSetIndex!;\n        outputSets[outputSetIndex].push(loopData._loopCarrier.grabPolygon()!);\n      }\n    }\n    return outputSets;\n  }\n  private static assembleLoopSet(loops: SortablePolygon[]): AnyRegion[] {\n    const outputSets: AnyRegion[] = [];\n    const numLoops = loops.length;\n    // In large-to-small order:\n    // If a loop has no parent or has a \"hole\" as parent it is outer.\n    // otherwise (i.e. it has a non-hole parent) it becomes a hole in the parent.\n    for (let candidateIndex = 0; candidateIndex < numLoops; candidateIndex++) {\n      const candidateData = loops[candidateIndex];\n      const parentIndex = candidateData.parentIndex;\n      candidateData.isHole = parentIndex !== undefined ? !loops[parentIndex].isHole : false;\n\n      if (!candidateData.isHole) {\n        candidateData._loopCarrier.reverseForAreaSign(1.0);\n        const candidateLoop = candidateData._loopCarrier.grabLoop()!;\n        let candidateParityRegion: ParityRegion | undefined;\n        // find all directly contained children . . .\n        for (let childIndex = candidateIndex + 1; childIndex < numLoops; childIndex++) {\n          const childData = loops[childIndex];\n          if (childData.parentIndex === candidateIndex) {\n            if (candidateParityRegion === undefined) {\n              candidateParityRegion = ParityRegion.create();\n              candidateParityRegion.tryAddChild(candidateLoop);\n              childData._loopCarrier.reverseForAreaSign(-1.0);\n              candidateParityRegion.tryAddChild(childData._loopCarrier.grabLoop());\n            } else {\n              childData._loopCarrier.reverseForAreaSign(-1.0);\n              candidateParityRegion.tryAddChild(childData._loopCarrier.grabLoop());\n            }\n          }\n        }\n        if (candidateParityRegion !== undefined)\n          outputSets.push(candidateParityRegion);\n        else if (candidateLoop !== undefined)\n          outputSets.push(candidateLoop);\n      }\n    }\n    return outputSets;\n  }\n\n  public static sortAsAnyRegion(loops: SortablePolygon[]): AnyRegion {\n    this.assignParentsAndDepth(loops);\n    const regions = this.assembleLoopSet(loops);\n    if (regions.length === 1)\n      return regions[0];\n    else {\n      const unionRegion = UnionRegion.create();\n      for (const region of regions)\n        unionRegion.tryAddChild(region);\n      return unionRegion;\n    }\n  }\n  public static sortAsArrayOfArrayOfPolygons(loops: SortablePolygon[]): IndexedReadWriteXYZCollection[][] {\n    this.assignParentsAndDepth(loops);\n    return this.assemblePolygonSet(loops);\n  }\n  public grabPolygon(): IndexedXYZCollection | undefined {\n    return this._loopCarrier.grabPolygon();\n  }\n  public grabLoop(): Loop | undefined {\n    return this._loopCarrier.grabLoop();\n  }\n  public reverseForAreaSign(targetSign: number) {\n    this._loopCarrier.reverseForAreaSign(targetSign);\n  }\n  public getAnyInteriorPoint(): Point3d | undefined {\n    return this._loopCarrier.getAnyInteriorPoint();\n  }\n}\n"]}
+{"version":3,"file":"SortablePolygon.js","sourceRoot":"","sources":["../../../src/geometry3d/SortablePolygon.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAEzD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,6BAA6B,EAAwB,MAAM,wBAAwB,CAAC;AAC7F,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAGhC;;;GAGG;AACH,MAAe,mBAAmB;IAChC,2CAA2C;IACjC,eAAe,GAAa,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAwBvE;;;OAGG;IACO,sBAAsB,CAAC,GAAU;QACzC,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,gBAAgB,EAAE;YACnC,OAAO,SAAS,CAAC,CAAC,sDAAsD;QAC1E,GAAG,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,UAAU,GAAG,GAAG;YACvB,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,iCAAiC;QACrE,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QACzD,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACxC,KAAK,IAAI,QAAQ,GAAG,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,IAAI,GAAG,EAAE,CAAC;YAC1D,GAAG,CAAC,eAAe,CAAC,QAAQ,GAAG,WAAW,EAAE,cAAc,CAAC,CAAC;YAC5D,IAAI,CAAC,KAAK,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC;gBAC5C,OAAO,cAAc,CAAC;QAC1B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,cAAe,SAAQ,mBAAmB;IACvC,IAAI,CAAgC;IACnC,WAAW,CAAS;IAC5B,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC5D,YAAmB,IAAmC;QACpD,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,EAAS;QAC9B,OAAO,UAAU,CAAC,wBAAwB,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD,kCAAkC;IAC3B,mBAAmB;QACxB,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC;YACrE,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,8BAA8B,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;gBACpE,IAAI,CAAC,KAAK,SAAS;oBACjB,OAAO,CAAC,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACM,WAAW,KAAgD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9E,QAAQ;QACb,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACM,kBAAkB,CAAC,UAAkB;QAC1C,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,EAAE,CAAC;YACxC,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,IAAI,CAAC,GAAG,CAAC;QAC3B,CAAC;IACH,CAAC;IACM,8BAA8B,CAAC,SAAiB,EAAE,aAAqB;QAC5E,IAAI,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACrC,MAAM,GAAG,GAAG,KAAK,CAAC,aAAa,CAC7B,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,SAAS,EAAE,aAAa,EAAE,SAAS,GAAG,CAAC,CAAE,EACzE,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,CAAC,CAAE,CACtD,CAAC;YACF,OAAO,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,WAAY,SAAQ,mBAAmB;IACpC,IAAI,CAAO;IACV,WAAW,CAAS;IAC5B,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC5D,YAAmB,IAAU;QAC3B,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,MAAM,WAAW,GAAG,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QACzD,IAAI,CAAC,WAAW,GAAG,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/E,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,EAAS;QAC9B,OAAO,SAAS,CAAC,wBAAwB,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IACM,+BAA+B,CAAC,UAAkB,EAAE,aAAqB;QAC9E,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvF,OAAO,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,kCAAkC;IAC3B,mBAAmB;QACxB,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC;YAC9E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,+BAA+B,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;gBACrE,IAAI,CAAC,KAAK,SAAS;oBACjB,OAAO,CAAC,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACM,WAAW;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;QACzC,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;YAClC,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YACzC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACrC,IAAI,KAAK,YAAY,cAAc,EAAE,CAAC;oBACpC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;YACD,OAAO,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACM,QAAQ;QACb,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IACM,kBAAkB,CAAC,UAAkB;QAC1C,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,EAAE,CAAC;YACxC,IAAI,CAAC,IAAI,CAAC,sBAAsB,EAAE,CAAC;YACnC,IAAI,CAAC,WAAW,IAAI,CAAC,GAAG,CAAC;QAC3B,CAAC;IACH,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,eAAe;IAClB,YAAY,CAAsB;IACnC,QAAQ,CAAW;IACnB,OAAO,CAAS;IAChB,KAAK,CAAU;IACf,WAAW,CAAU;IACrB,MAAM,CAAU;IAChB,cAAc,CAAU;IAC/B;;;OAGG;IACH,YAAmB,IAA0C,EAAE,KAAc;QAC3E,IAAI,IAAI,YAAY,6BAA6B;YAC/C,IAAI,CAAC,YAAY,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC;;YAE7C,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,WAAW,CAAC,KAAwB,EAAE,IAAmC;QACrF,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,IAAI,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,eAAe,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,QAAQ,CAAC,KAAwB,EAAE,IAAU;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3B,MAAM,eAAe,GAAG,IAAI,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,eAAe,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACK,MAAM,CAAC,qBAAqB,CAAC,KAAwB;QAC3D,+BAA+B;QAC/B,KAAK,CAAC,IAAI,CAAC,CAAC,KAAsB,EAAE,KAAsB,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAChG,8EAA8E;QAC9E,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;YACpC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,mBAAmB,EAAE,CAAC;YACvD,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,+DAA+D;gBAC/D,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC;gBACjC,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,SAAS,CAAC;gBACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;oBACzB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC3B,IAAI,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC3C,IAAI,CAAC,KAAK,SAAS,CAAC,YAAY,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,CAAC;4BACrD,QAAQ,CAAC,WAAW,GAAG,CAAC,CAAC;4BACzB,6HAA6H;4BAC7H,MAAM;wBACR,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,kBAAkB,CAAC,KAAwB;QACxD,MAAM,UAAU,GAAsC,EAAE,CAAC;QAEzD,2BAA2B;QAC3B,iEAAiE;QACjE,6EAA6E;QAC7E,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;YAC7B,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC;YACxB,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC;YACzC,IAAI,WAAW,KAAK,SAAS;gBAC3B,QAAQ,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC;YAC/C,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACrB,QAAQ,CAAC,YAAY,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;gBAC9C,QAAQ,CAAC,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC;gBAC5C,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpB,UAAU,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,WAAW,EAAG,CAAC,CAAC;YACjF,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC/C,MAAM,cAAc,GAAG,KAAK,CAAC,WAAY,CAAC,CAAC,cAAe,CAAC;gBAC3D,UAAU,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,WAAW,EAAG,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IACO,MAAM,CAAC,eAAe,CAAC,KAAwB;QACrD,MAAM,UAAU,GAAgB,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;QAC9B,2BAA2B;QAC3B,iEAAiE;QACjE,6EAA6E;QAC7E,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,QAAQ,EAAE,cAAc,EAAE,EAAE,CAAC;YACzE,MAAM,aAAa,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC;YAC9C,aAAa,CAAC,MAAM,GAAG,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;YAEtF,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;gBAC1B,aAAa,CAAC,YAAY,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;gBACnD,MAAM,aAAa,GAAG,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAG,CAAC;gBAC7D,IAAI,qBAA+C,CAAC;gBACpD,6CAA6C;gBAC7C,KAAK,IAAI,UAAU,GAAG,cAAc,GAAG,CAAC,EAAE,UAAU,GAAG,QAAQ,EAAE,UAAU,EAAE,EAAE,CAAC;oBAC9E,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;oBACpC,IAAI,SAAS,CAAC,WAAW,KAAK,cAAc,EAAE,CAAC;wBAC7C,IAAI,qBAAqB,KAAK,SAAS,EAAE,CAAC;4BACxC,qBAAqB,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;4BAC9C,qBAAqB,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;4BACjD,SAAS,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC;4BAChD,qBAAqB,CAAC,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC;wBACvE,CAAC;6BAAM,CAAC;4BACN,SAAS,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC;4BAChD,qBAAqB,CAAC,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC;wBACvE,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,IAAI,qBAAqB,KAAK,SAAS;oBACrC,UAAU,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;qBACpC,IAAI,aAAa,KAAK,SAAS;oBAClC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAEM,MAAM,CAAC,eAAe,CAAC,KAAwB;QACpD,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YACtB,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;aACf,CAAC;YACJ,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;YACzC,KAAK,MAAM,MAAM,IAAI,OAAO;gBAC1B,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClC,OAAO,WAAW,CAAC;QACrB,CAAC;IACH,CAAC;IACM,MAAM,CAAC,4BAA4B,CAAC,KAAwB;QACjE,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;IACM,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,CAAC;IACzC,CAAC;IACM,QAAQ;QACb,OAAO,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;IACtC,CAAC;IACM,kBAAkB,CAAC,UAAkB;QAC1C,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;IACnD,CAAC;IACM,mBAAmB;QACxB,OAAO,IAAI,CAAC,YAAY,CAAC,mBAAmB,EAAE,CAAC;IACjD,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 CartesianGeometry\n */\n\nimport { CurveChain } from \"../curve/CurveCollection\";\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { AnyRegion } from \"../curve/CurveTypes\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Loop } from \"../curve/Loop\";\nimport { ParityRegion } from \"../curve/ParityRegion\";\nimport { RegionOps } from \"../curve/RegionOps\";\nimport { UnionRegion } from \"../curve/UnionRegion\";\nimport { IndexedReadWriteXYZCollection, IndexedXYZCollection } from \"./IndexedXYZCollection\";\nimport { Point3d } from \"./Point3dVector3d\";\nimport { PolygonOps } from \"./PolygonOps\";\nimport { Range3d } from \"./Range\";\nimport { Ray3d } from \"./Ray3d\";\nimport { XAndY } from \"./XYZProps\";\n\n/** Abstract base class for area-related queries of an xy-loop.\n * * Subclasses have particular logic for `Loop` and polygon data.\n * @internal\n */\nabstract class SimpleRegionCarrier {\n  /** Fractions for interior point search. */\n  protected searchFractions: number[] = [0.2349, 0.4142, 0.6587, 0.8193];\n\n  public abstract classifyPointXY(xy: XAndY): number | undefined;\n  // Find any point on an edge.\n  // evaluate tangent.\n  // move to left or right according to signedArea, producing an interior point for the loop.\n  public abstract getAnyInteriorPoint(): Point3d | undefined;\n  /**\n   * * grab the loop formatted as a simple polygon.\n   * * stroke if necessary.\n   */\n  public abstract grabPolygon(): IndexedReadWriteXYZCollection | undefined;\n  /**\n   * * grab the loop formatted as a strongly typed loop object\n   */\n  public abstract grabLoop(): Loop | undefined;\n  /**\n   * (Property access) Return the signed area of the loop\n   */\n  public abstract get signedArea(): number;\n  /**\n   * If the current `signedArea` has different sign versus `targetSign`, reverse the loop in place.\n   */\n  public abstract reverseForAreaSign(targetSign: number): void;\n  /**\n   * Given a region boundary tangent, construct a point interior to the region.\n   * @param ray point and tangent on an edge of the region (modified on return)\n   */\n  protected constructInteriorPoint(ray: Ray3d): Point3d | undefined {\n    ray.direction.z = 0.0;\n    if (!ray.direction.normalizeInPlace())\n      return undefined; // loop has zero length edge, or a vertical (gap) edge\n    ray.direction.rotate90CCWXY(ray.direction);\n    if (this.signedArea < 0.0)\n      ray.direction.scaleInPlace(-1.0); // aim toward the region interior\n    const refDistance = Math.sqrt(Math.abs(this.signedArea));\n    const candidatePoint = Point3d.create();\n    for (let fraction = 1.0e-5; fraction < 3; fraction *= 5.0) {\n      ray.fractionToPoint(fraction * refDistance, candidatePoint);\n      if (1 === this.classifyPointXY(candidatePoint))\n        return candidatePoint;\n    }\n    return undefined;\n  }\n}\n\n/**\n * Implement `SimpleRegionCarrier` queries with the area as a polygon carried in an `IndexedReadWriteXYZCollection`.\n */\nclass PolygonCarrier extends SimpleRegionCarrier {\n  public data: IndexedReadWriteXYZCollection;\n  private _signedArea: number;\n  public get signedArea(): number { return this._signedArea; }\n  public constructor(data: IndexedReadWriteXYZCollection) {\n    super();\n    this.data = data;\n    this._signedArea = PolygonOps.areaXY(data);\n  }\n  /**\n   * classify xy parts of point wrt this loop.\n   * @param xy\n   * @internal\n   */\n  public classifyPointXY(xy: XAndY): number | undefined {\n    return PolygonOps.classifyPointInPolygonXY(xy.x, xy.y, this.data);\n  }\n  /** Return some point \"inside\". */\n  public getAnyInteriorPoint(): Point3d | undefined {\n    for (let childIndex = 0; childIndex < this.data.length; childIndex++) {\n      for (const fraction of this.searchFractions) {\n        const q = this.constructInteriorPointNearEdge(childIndex, fraction);\n        if (q !== undefined)\n          return q;\n      }\n    }\n    return undefined;\n  }\n  public grabPolygon(): IndexedReadWriteXYZCollection | undefined { return this.data; }\n  public grabLoop(): Loop | undefined {\n    return Loop.createPolygon(this.data);\n  }\n  public reverseForAreaSign(targetSign: number) {\n    if (targetSign * this._signedArea < 0.0) {\n      this.data.reverseInPlace();\n      this._signedArea *= -1.0;\n    }\n  }\n  public constructInteriorPointNearEdge(edgeIndex: number, fractionAlong: number): Point3d | undefined {\n    if (edgeIndex + 1 < this.data.length) {\n      const ray = Ray3d.createCapture(\n        this.data.interpolateIndexIndex(edgeIndex, fractionAlong, edgeIndex + 1)!,\n        this.data.vectorIndexIndex(edgeIndex, edgeIndex + 1)!\n      );\n      return this.constructInteriorPoint(ray);\n    }\n    return undefined;\n  }\n}\n\n/**\n * Implement `SimpleRegionCarrier` queries with the area as a strongly typed `Loop`.\n */\nclass LoopCarrier extends SimpleRegionCarrier {\n  public data: Loop;\n  private _signedArea: number;\n  public get signedArea(): number { return this._signedArea; }\n  public constructor(data: Loop) {\n    super();\n    this.data = data;\n    const areaMoments = RegionOps.computeXYAreaMoments(data);\n    this._signedArea = areaMoments !== undefined ? areaMoments.quantitySum : 0.0;\n  }\n  /**\n   * classify xy parts of point wrt this loop.\n   * @param xy\n   * @internal\n   */\n  public classifyPointXY(xy: XAndY): number | undefined {\n    return RegionOps.testPointInOnOutRegionXY(this.data, xy.x, xy.y);\n  }\n  public constructInteriorPointNearChild(childIndex: number, fractionAlong: number): Point3d | undefined {\n    if (childIndex < this.data.children.length) {\n      const ray = this.data.children[childIndex].fractionToPointAndDerivative(fractionAlong);\n      return this.constructInteriorPoint(ray);\n    }\n    return undefined;\n  }\n  /** Return some point \"inside\". */\n  public getAnyInteriorPoint(): Point3d | undefined {\n    for (let childIndex = 0; childIndex < this.data.children.length; childIndex++) {\n      for (const fraction of this.searchFractions) {\n        const q = this.constructInteriorPointNearChild(childIndex, fraction);\n        if (q !== undefined)\n          return q;\n      }\n    }\n    return undefined;\n  }\n  public grabPolygon(): IndexedReadWriteXYZCollection | undefined {\n    const strokes = this.data.cloneStroked();\n    if (strokes instanceof CurveChain) {\n      const linestring = LineString3d.create();\n      for (const child of strokes.children) {\n        if (child instanceof CurvePrimitive) {\n          child.emitStrokes(linestring);\n        }\n      }\n      return linestring.numPoints() > 0 ? linestring.packedPoints : undefined;\n    }\n    return undefined;\n  }\n  public grabLoop(): Loop | undefined {\n    return this.data;\n  }\n  public reverseForAreaSign(targetSign: number) {\n    if (targetSign * this._signedArea < 0.0) {\n      this.data.reverseChildrenInPlace();\n      this._signedArea *= -1.0;\n    }\n  }\n}\n\n/**\n * A `SortablePolygon` carries a (single) xy-loop with data useful for sorting for inner-outer structure.\n * @internal\n */\nexport class SortablePolygon {\n  private _loopCarrier: SimpleRegionCarrier;\n  public anyPoint?: Point3d;\n  public sortKey: number;\n  public range: Range3d;\n  public parentIndex?: number;\n  public isHole: boolean;\n  public outputSetIndex?: number;\n  /**\n   *\n   * @param loop Loop to capture.\n   */\n  public constructor(loop: IndexedReadWriteXYZCollection | Loop, range: Range3d) {\n    if (loop instanceof IndexedReadWriteXYZCollection)\n      this._loopCarrier = new PolygonCarrier(loop);\n    else\n      this._loopCarrier = new LoopCarrier(loop);\n    this.range = range;\n    this.sortKey = Math.abs(this._loopCarrier.signedArea);\n    this.isHole = false;\n  }\n  /** Push loop with sort data onto the array.\n   * * No action if no clear normal.\n   * * return true if pushed.\n   */\n  public static pushPolygon(loops: SortablePolygon[], loop: IndexedReadWriteXYZCollection): boolean {\n    const range = loop.getRange();\n    const sortablePolygon = new SortablePolygon(loop, range);\n    if (sortablePolygon.sortKey > 0.0) {\n      loops.push(sortablePolygon);\n      return true;\n    }\n    return false;\n  }\n  /** Push loop with sort data onto the array.\n   * * No action if no clear normal.\n   * * return true if pushed.\n   */\n  public static pushLoop(loops: SortablePolygon[], loop: Loop): boolean {\n    const range = loop.range();\n    const sortablePolygon = new SortablePolygon(loop, range);\n    if (sortablePolygon.sortKey > 0.0) {\n      loops.push(sortablePolygon);\n      return true;\n    }\n    return false;\n  }\n  /** Push loop with sort data onto the array.\n   * * No action if no clear normal.\n   * * return true if pushed.\n   */\n  private static assignParentsAndDepth(loops: SortablePolygon[]): void {\n    // Sort largest to smallest ...\n    loops.sort((loopA: SortablePolygon, loopB: SortablePolygon) => (loopB.sortKey - loopA.sortKey));\n    // starting with smallest loop, point each loop to smallest containing parent.\n    for (let i = loops.length; i-- > 0;) {\n      const thisLoop = loops[i];\n      const xy = thisLoop._loopCarrier.getAnyInteriorPoint();\n      if (xy !== undefined) {\n        // find smallest containing parent (search forward only to hit)\n        loops[i].parentIndex = undefined;\n        loops[i].outputSetIndex = undefined;\n        for (let j = i; j-- > 0;) {\n          const otherLoop = loops[j];\n          if (otherLoop.range.containsXY(xy.x, xy.y)) {\n            if (1 === otherLoop._loopCarrier.classifyPointXY(xy)) {\n              thisLoop.parentIndex = j;\n              // The loops are searched from small area to larger.  Any other containing loop is larger, so otherLoop must be the smallest.\n              break;\n            }\n          }\n        }\n      }\n    }\n  }\n\n  private static assemblePolygonSet(loops: SortablePolygon[]): IndexedReadWriteXYZCollection[][] {\n    const outputSets: IndexedReadWriteXYZCollection[][] = [];\n\n    // In large-to-small order:\n    // If a loop has no parent or has a \"hole\" as parent it is outer.\n    // otherwise (i.e. it has a non-hole parent) it becomes a hole in the parent.\n    for (const loopData of loops) {\n      loopData.isHole = false;\n      const parentIndex = loopData.parentIndex;\n      if (parentIndex !== undefined)\n        loopData.isHole = !loops[parentIndex].isHole;\n      if (!loopData.isHole) {\n        loopData._loopCarrier.reverseForAreaSign(1.0);\n        loopData.outputSetIndex = outputSets.length;\n        outputSets.push([]);\n        outputSets[loopData.outputSetIndex].push(loopData._loopCarrier.grabPolygon()!);\n      } else {\n        loopData._loopCarrier.reverseForAreaSign(-1.0);\n        const outputSetIndex = loops[parentIndex!].outputSetIndex!;\n        outputSets[outputSetIndex].push(loopData._loopCarrier.grabPolygon()!);\n      }\n    }\n    return outputSets;\n  }\n  private static assembleLoopSet(loops: SortablePolygon[]): AnyRegion[] {\n    const outputSets: AnyRegion[] = [];\n    const numLoops = loops.length;\n    // In large-to-small order:\n    // If a loop has no parent or has a \"hole\" as parent it is outer.\n    // otherwise (i.e. it has a non-hole parent) it becomes a hole in the parent.\n    for (let candidateIndex = 0; candidateIndex < numLoops; candidateIndex++) {\n      const candidateData = loops[candidateIndex];\n      const parentIndex = candidateData.parentIndex;\n      candidateData.isHole = parentIndex !== undefined ? !loops[parentIndex].isHole : false;\n\n      if (!candidateData.isHole) {\n        candidateData._loopCarrier.reverseForAreaSign(1.0);\n        const candidateLoop = candidateData._loopCarrier.grabLoop()!;\n        let candidateParityRegion: ParityRegion | undefined;\n        // find all directly contained children . . .\n        for (let childIndex = candidateIndex + 1; childIndex < numLoops; childIndex++) {\n          const childData = loops[childIndex];\n          if (childData.parentIndex === candidateIndex) {\n            if (candidateParityRegion === undefined) {\n              candidateParityRegion = ParityRegion.create();\n              candidateParityRegion.tryAddChild(candidateLoop);\n              childData._loopCarrier.reverseForAreaSign(-1.0);\n              candidateParityRegion.tryAddChild(childData._loopCarrier.grabLoop());\n            } else {\n              childData._loopCarrier.reverseForAreaSign(-1.0);\n              candidateParityRegion.tryAddChild(childData._loopCarrier.grabLoop());\n            }\n          }\n        }\n        if (candidateParityRegion !== undefined)\n          outputSets.push(candidateParityRegion);\n        else if (candidateLoop !== undefined)\n          outputSets.push(candidateLoop);\n      }\n    }\n    return outputSets;\n  }\n\n  public static sortAsAnyRegion(loops: SortablePolygon[]): AnyRegion {\n    this.assignParentsAndDepth(loops);\n    const regions = this.assembleLoopSet(loops);\n    if (regions.length === 1)\n      return regions[0];\n    else {\n      const unionRegion = UnionRegion.create();\n      for (const region of regions)\n        unionRegion.tryAddChild(region);\n      return unionRegion;\n    }\n  }\n  public static sortAsArrayOfArrayOfPolygons(loops: SortablePolygon[]): IndexedReadWriteXYZCollection[][] {\n    this.assignParentsAndDepth(loops);\n    return this.assemblePolygonSet(loops);\n  }\n  public grabPolygon(): IndexedXYZCollection | undefined {\n    return this._loopCarrier.grabPolygon();\n  }\n  public grabLoop(): Loop | undefined {\n    return this._loopCarrier.grabLoop();\n  }\n  public reverseForAreaSign(targetSign: number) {\n    this._loopCarrier.reverseForAreaSign(targetSign);\n  }\n  public getAnyInteriorPoint(): Point3d | undefined {\n    return this._loopCarrier.getAnyInteriorPoint();\n  }\n}\n"]}

package/lib/esm/polyface/PolyfaceBuilder.js

@@ -1066,7 +1066,7 @@ export class PolyfaceBuilder extends NullGeometryHandler {
     /** Construct facets for a rotational sweep. */
     addRotationalSweep(surface) {
         const contour = surface.getSweepContourRef();
-        const section0 = StrokeCountSection.createForParityRegionOrChain(contour.getCurves(), this._options);
+        const section0 = StrokeCountSection.create(contour.getCurves(), this._options);
         const baseStrokes = section0.getStrokes();
         // ensure sweep is positive for buildRotationalNormalsInLineStrings
         const axis = surface.cloneAxisRay();
@@ -1216,7 +1216,7 @@ export class PolyfaceBuilder extends NullGeometryHandler {
     /** Add facets from the linear sweep. */
     addLinearSweep(surface) {
         const contour = surface.getCurvesRef();
-        const section0 = StrokeCountSection.createForParityRegionOrChain(contour, this._options);
+        const section0 = StrokeCountSection.create(contour, this._options);
         const stroke0 = section0.getStrokes();
         const sweepVector = surface.cloneSweepVector();
         const sweepTransform = Transform.createTranslation(sweepVector);
@@ -1238,7 +1238,7 @@ export class PolyfaceBuilder extends NullGeometryHandler {
         let stroke1;
         const sectionMaps = [];
         for (const contour of contours)
-            sectionMaps.push(StrokeCountSection.createForParityRegionOrChain(contour.curves, this._options));
+            sectionMaps.push(StrokeCountSection.create(contour.curves, this._options));
         if (StrokeCountSection.enforceStrokeCountCompatibility(sectionMaps)) {
             StrokeCountSection.enforceCompatibleDistanceSums(sectionMaps);
             for (let i = 0; i < contours.length; i++) {