npm - @itwin/core-geometry - Versions diffs - 5.1.0-dev.52 → 5.1.0-dev.53 - Mend

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

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

Files changed (183) hide show

package/lib/cjs/Geometry.d.ts +1 -1
package/lib/cjs/Geometry.js.map +1 -1
package/lib/cjs/bspline/BSplineSurface.d.ts.map +1 -1
package/lib/cjs/bspline/BSplineSurface.js +0 -2
package/lib/cjs/bspline/BSplineSurface.js.map +1 -1
package/lib/cjs/curve/CurveCollection.d.ts +7 -0
package/lib/cjs/curve/CurveCollection.d.ts.map +1 -1
package/lib/cjs/curve/CurveCollection.js +11 -0
package/lib/cjs/curve/CurveCollection.js.map +1 -1
package/lib/cjs/curve/CurveFactory.d.ts +3 -2
package/lib/cjs/curve/CurveFactory.d.ts.map +1 -1
package/lib/cjs/curve/CurveFactory.js +6 -5
package/lib/cjs/curve/CurveFactory.js.map +1 -1
package/lib/cjs/curve/CurveLocationDetail.d.ts +3 -1
package/lib/cjs/curve/CurveLocationDetail.d.ts.map +1 -1
package/lib/cjs/curve/CurveLocationDetail.js +6 -1
package/lib/cjs/curve/CurveLocationDetail.js.map +1 -1
package/lib/cjs/curve/CurvePrimitive.d.ts +7 -0
package/lib/cjs/curve/CurvePrimitive.d.ts.map +1 -1
package/lib/cjs/curve/CurvePrimitive.js +11 -0
package/lib/cjs/curve/CurvePrimitive.js.map +1 -1
package/lib/cjs/curve/LineSegment3d.d.ts +2 -0
package/lib/cjs/curve/LineSegment3d.d.ts.map +1 -1
package/lib/cjs/curve/LineSegment3d.js +4 -0
package/lib/cjs/curve/LineSegment3d.js.map +1 -1
package/lib/cjs/curve/LineString3d.d.ts +7 -0
package/lib/cjs/curve/LineString3d.d.ts.map +1 -1
package/lib/cjs/curve/LineString3d.js +15 -3
package/lib/cjs/curve/LineString3d.js.map +1 -1
package/lib/cjs/curve/Query/ConsolidateAdjacentPrimitivesContext.d.ts.map +1 -1
package/lib/cjs/curve/Query/ConsolidateAdjacentPrimitivesContext.js +28 -4
package/lib/cjs/curve/Query/ConsolidateAdjacentPrimitivesContext.js.map +1 -1
package/lib/cjs/curve/Query/PlanarSubdivision.d.ts +25 -3
package/lib/cjs/curve/Query/PlanarSubdivision.d.ts.map +1 -1
package/lib/cjs/curve/Query/PlanarSubdivision.js +102 -22
package/lib/cjs/curve/Query/PlanarSubdivision.js.map +1 -1
package/lib/cjs/curve/Query/StrokeCountChain.d.ts +4 -3
package/lib/cjs/curve/Query/StrokeCountChain.d.ts.map +1 -1
package/lib/cjs/curve/Query/StrokeCountChain.js +20 -9
package/lib/cjs/curve/Query/StrokeCountChain.js.map +1 -1
package/lib/cjs/curve/RegionMomentsXY.d.ts +1 -1
package/lib/cjs/curve/RegionMomentsXY.d.ts.map +1 -1
package/lib/cjs/curve/RegionMomentsXY.js +6 -3
package/lib/cjs/curve/RegionMomentsXY.js.map +1 -1
package/lib/cjs/curve/RegionOps.d.ts +23 -14
package/lib/cjs/curve/RegionOps.d.ts.map +1 -1
package/lib/cjs/curve/RegionOps.js +60 -21
package/lib/cjs/curve/RegionOps.js.map +1 -1
package/lib/cjs/curve/RegionOpsClassificationSweeps.d.ts +9 -1
package/lib/cjs/curve/RegionOpsClassificationSweeps.d.ts.map +1 -1
package/lib/cjs/curve/RegionOpsClassificationSweeps.js +91 -1
package/lib/cjs/curve/RegionOpsClassificationSweeps.js.map +1 -1
package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.d.ts +2 -2
package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js +6 -6
package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -1
package/lib/cjs/geometry3d/AngleSweep.d.ts +1 -1
package/lib/cjs/geometry3d/AngleSweep.d.ts.map +1 -1
package/lib/cjs/geometry3d/AngleSweep.js +1 -1
package/lib/cjs/geometry3d/AngleSweep.js.map +1 -1
package/lib/cjs/geometry3d/Ellipsoid.js +1 -1
package/lib/cjs/geometry3d/Ellipsoid.js.map +1 -1
package/lib/cjs/geometry3d/IndexedXYZCollection.d.ts +9 -0
package/lib/cjs/geometry3d/IndexedXYZCollection.d.ts.map +1 -1
package/lib/cjs/geometry3d/IndexedXYZCollection.js +14 -0
package/lib/cjs/geometry3d/IndexedXYZCollection.js.map +1 -1
package/lib/cjs/geometry3d/Ray3d.d.ts +7 -9
package/lib/cjs/geometry3d/Ray3d.d.ts.map +1 -1
package/lib/cjs/geometry3d/Ray3d.js +12 -22
package/lib/cjs/geometry3d/Ray3d.js.map +1 -1
package/lib/cjs/geometry3d/SortablePolygon.d.ts +1 -4
package/lib/cjs/geometry3d/SortablePolygon.d.ts.map +1 -1
package/lib/cjs/geometry3d/SortablePolygon.js +48 -43
package/lib/cjs/geometry3d/SortablePolygon.js.map +1 -1
package/lib/cjs/polyface/PolyfaceBuilder.js +3 -3
package/lib/cjs/polyface/PolyfaceBuilder.js.map +1 -1
package/lib/cjs/solid/Sphere.js +1 -1
package/lib/cjs/solid/Sphere.js.map +1 -1
package/lib/cjs/solid/SweepContour.d.ts +1 -1
package/lib/cjs/solid/SweepContour.js +1 -1
package/lib/cjs/solid/SweepContour.js.map +1 -1
package/lib/cjs/topology/Graph.d.ts +64 -14
package/lib/cjs/topology/Graph.d.ts.map +1 -1
package/lib/cjs/topology/Graph.js +149 -32
package/lib/cjs/topology/Graph.js.map +1 -1
package/lib/cjs/topology/HalfEdgeGraphSearch.d.ts +2 -2
package/lib/cjs/topology/HalfEdgeGraphSearch.d.ts.map +1 -1
package/lib/cjs/topology/HalfEdgeGraphSearch.js +2 -2
package/lib/cjs/topology/HalfEdgeGraphSearch.js.map +1 -1
package/lib/cjs/topology/RegularizeFace.d.ts.map +1 -1
package/lib/cjs/topology/RegularizeFace.js +2 -1
package/lib/cjs/topology/RegularizeFace.js.map +1 -1
package/lib/esm/Geometry.d.ts +1 -1
package/lib/esm/Geometry.js.map +1 -1
package/lib/esm/bspline/BSplineSurface.d.ts.map +1 -1
package/lib/esm/bspline/BSplineSurface.js +0 -2
package/lib/esm/bspline/BSplineSurface.js.map +1 -1
package/lib/esm/curve/CurveCollection.d.ts +7 -0
package/lib/esm/curve/CurveCollection.d.ts.map +1 -1
package/lib/esm/curve/CurveCollection.js +11 -0
package/lib/esm/curve/CurveCollection.js.map +1 -1
package/lib/esm/curve/CurveFactory.d.ts +3 -2
package/lib/esm/curve/CurveFactory.d.ts.map +1 -1
package/lib/esm/curve/CurveFactory.js +6 -5
package/lib/esm/curve/CurveFactory.js.map +1 -1
package/lib/esm/curve/CurveLocationDetail.d.ts +3 -1
package/lib/esm/curve/CurveLocationDetail.d.ts.map +1 -1
package/lib/esm/curve/CurveLocationDetail.js +6 -1
package/lib/esm/curve/CurveLocationDetail.js.map +1 -1
package/lib/esm/curve/CurvePrimitive.d.ts +7 -0
package/lib/esm/curve/CurvePrimitive.d.ts.map +1 -1
package/lib/esm/curve/CurvePrimitive.js +11 -0
package/lib/esm/curve/CurvePrimitive.js.map +1 -1
package/lib/esm/curve/LineSegment3d.d.ts +2 -0
package/lib/esm/curve/LineSegment3d.d.ts.map +1 -1
package/lib/esm/curve/LineSegment3d.js +4 -0
package/lib/esm/curve/LineSegment3d.js.map +1 -1
package/lib/esm/curve/LineString3d.d.ts +7 -0
package/lib/esm/curve/LineString3d.d.ts.map +1 -1
package/lib/esm/curve/LineString3d.js +15 -3
package/lib/esm/curve/LineString3d.js.map +1 -1
package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.d.ts.map +1 -1
package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js +28 -4
package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js.map +1 -1
package/lib/esm/curve/Query/PlanarSubdivision.d.ts +25 -3
package/lib/esm/curve/Query/PlanarSubdivision.d.ts.map +1 -1
package/lib/esm/curve/Query/PlanarSubdivision.js +104 -24
package/lib/esm/curve/Query/PlanarSubdivision.js.map +1 -1
package/lib/esm/curve/Query/StrokeCountChain.d.ts +4 -3
package/lib/esm/curve/Query/StrokeCountChain.d.ts.map +1 -1
package/lib/esm/curve/Query/StrokeCountChain.js +20 -9
package/lib/esm/curve/Query/StrokeCountChain.js.map +1 -1
package/lib/esm/curve/RegionMomentsXY.d.ts +1 -1
package/lib/esm/curve/RegionMomentsXY.d.ts.map +1 -1
package/lib/esm/curve/RegionMomentsXY.js +6 -3
package/lib/esm/curve/RegionMomentsXY.js.map +1 -1
package/lib/esm/curve/RegionOps.d.ts +23 -14
package/lib/esm/curve/RegionOps.d.ts.map +1 -1
package/lib/esm/curve/RegionOps.js +60 -21
package/lib/esm/curve/RegionOps.js.map +1 -1
package/lib/esm/curve/RegionOpsClassificationSweeps.d.ts +9 -1
package/lib/esm/curve/RegionOpsClassificationSweeps.d.ts.map +1 -1
package/lib/esm/curve/RegionOpsClassificationSweeps.js +91 -2
package/lib/esm/curve/RegionOpsClassificationSweeps.js.map +1 -1
package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.d.ts +2 -2
package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.js +6 -6
package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -1
package/lib/esm/geometry3d/AngleSweep.d.ts +1 -1
package/lib/esm/geometry3d/AngleSweep.d.ts.map +1 -1
package/lib/esm/geometry3d/AngleSweep.js +1 -1
package/lib/esm/geometry3d/AngleSweep.js.map +1 -1
package/lib/esm/geometry3d/Ellipsoid.js +1 -1
package/lib/esm/geometry3d/Ellipsoid.js.map +1 -1
package/lib/esm/geometry3d/IndexedXYZCollection.d.ts +9 -0
package/lib/esm/geometry3d/IndexedXYZCollection.d.ts.map +1 -1
package/lib/esm/geometry3d/IndexedXYZCollection.js +14 -0
package/lib/esm/geometry3d/IndexedXYZCollection.js.map +1 -1
package/lib/esm/geometry3d/Ray3d.d.ts +7 -9
package/lib/esm/geometry3d/Ray3d.d.ts.map +1 -1
package/lib/esm/geometry3d/Ray3d.js +12 -22
package/lib/esm/geometry3d/Ray3d.js.map +1 -1
package/lib/esm/geometry3d/SortablePolygon.d.ts +1 -4
package/lib/esm/geometry3d/SortablePolygon.d.ts.map +1 -1
package/lib/esm/geometry3d/SortablePolygon.js +48 -43
package/lib/esm/geometry3d/SortablePolygon.js.map +1 -1
package/lib/esm/polyface/PolyfaceBuilder.js +3 -3
package/lib/esm/polyface/PolyfaceBuilder.js.map +1 -1
package/lib/esm/solid/Sphere.js +1 -1
package/lib/esm/solid/Sphere.js.map +1 -1
package/lib/esm/solid/SweepContour.d.ts +1 -1
package/lib/esm/solid/SweepContour.js +1 -1
package/lib/esm/solid/SweepContour.js.map +1 -1
package/lib/esm/topology/Graph.d.ts +64 -14
package/lib/esm/topology/Graph.d.ts.map +1 -1
package/lib/esm/topology/Graph.js +149 -32
package/lib/esm/topology/Graph.js.map +1 -1
package/lib/esm/topology/HalfEdgeGraphSearch.d.ts +2 -2
package/lib/esm/topology/HalfEdgeGraphSearch.d.ts.map +1 -1
package/lib/esm/topology/HalfEdgeGraphSearch.js +2 -2
package/lib/esm/topology/HalfEdgeGraphSearch.js.map +1 -1
package/lib/esm/topology/RegularizeFace.d.ts.map +1 -1
package/lib/esm/topology/RegularizeFace.js +2 -1
package/lib/esm/topology/RegularizeFace.js.map +1 -1
package/package.json +3 -3

package/lib/cjs/curve/Query/StrokeCountChain.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"StrokeCountChain.js","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountChain.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAA0C;AAC1C,sEAA2D;AAG3D,wDAAiE;AACjE,kDAA+C;AAC/C,kCAA+B;AAC/B,kDAA+C;AAE/C,qDAAkD;AAElD,qBAAqB;AACrB;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAsB,8BAA8B;IAClD;;;;;;OAMG;IACI,WAAW,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAepH;;;OAGG;IACI,SAAS,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CAEnH;AA7BD,wEA6BC;AACD;;;;GAIG;AACH,MAAa,kCAAmC,SAAQ,8BAA8B;IAC7E,KAAK,CAAiB;IAC7B;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,+BAAc,CAAC,wBAAwB,EAAE,CAAC;IACzD,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,oEAAoE;YACpE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS;gBACtC,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;YACvC,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,gCAAgC;YAChC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YACrC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AAlCD,gFAkCC;AACD;;;;GAIG;AACH,MAAa,wCAAyC,SAAQ,8BAA8B;IACnF,cAAc,CAAS;IAC9B;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC;IAC5B,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,oEAAoE;YACpE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,GAAG,mBAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3E,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,gCAAgC;YAChC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;YACb,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AAlCD,4FAkCC;AACD;;;;;;GAMG;AACH,MAAa,gBAAgB;IACpB,IAAI,CAAmB;IACvB,MAAM,CAAmB;IAChC;;;;OAIG;IACI,OAAO,CAAiB;IAE/B,YAAoB,MAAwB,EAAE,OAAuB;QACnE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IACM,MAAM,CAAC,mBAAmB,CAAC,KAAiB,EAAE,OAAuB;QAC1E,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACpD,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,2CAA2C;QAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC/B,CAAC,CAAC,qCAAqC,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,CAAC,CAAC,UAAU;gBACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,UAAU;QACf,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;gBACxD,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC1B,EAAE,CAAC,sBAAsB,EAAE,CAAC;gBAC5B,EAAE,CAAC,mBAAmB,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,CAAC,SAAS;gBACb,CAAC,CAAC,SAAS,CAAC,8BAA8B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,EAAE,CAAC;IAEZ,CAAC;IACD,wBAAwB;IAChB,MAAM,CAAC,8BAA8B,CAAC,IAAsB,EAAE,WAAmB;QACvF,IAAI,SAAS,GAAG,WAAW,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;YAClB,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;gBACpB,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,8BAA8B,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACpE,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;YACpB,CAAC;YACD,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;QACnB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,mBAAmB,CAAC,WAAmB;QAC5C,OAAO,gBAAgB,CAAC,8BAA8B,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACjF,CAAC;CACF;AAvED,4CAuEC;AAED;;;;;GAKG;AACH,MAAa,kBAAkB;IACtB,MAAM,CAAqB;IAC3B,MAAM,CAAmB;IAChC,YAAoB,MAAwB,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;IACzF;;;OAGG;IACI,MAAM,CAAC,4BAA4B,CAAC,MAAuB,EAAE,OAAuB;QACzF,MAAM,MAAM,GAAG,IAAI,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,MAAM,YAAY,2BAAY,EAAE,CAAC;YACnC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,gBAAgB,CAAC,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/D,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,4BAAU,EAAE,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oDAAoD;IAC7C,MAAM,CAAC,qBAAqB,CAAC,QAA8B,EAAE,aAAsB;QACxF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC,CAAE,gEAAgE;QAChF,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,mDAAmD;YACnD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS;gBACzC,OAAO,KAAK,CAAC;YACf,yEAAyE;YACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACvD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,YAAY;oBACpD,OAAO,KAAK,CAAC;gBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;wBAC7G,OAAO,KAAK,CAAC;gBACjB,CAAC;YACH,CAAC;QAEH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,wBAAwB,CAAC,QAA8B;QACnE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACnC,KAAK,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,yCAAyC,CAAC,QAA8B,EAAE,UAAkB,EAAE,cAAsB,EACjI,cAAkC,EAAE,QAAwC;QAC5E,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QACpF,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YACjC,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;wBACvF,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,qFAAqF;YACrF,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAc,CAAC,cAAc,CAAC,CAAC;wBACtH,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;YACjB,CAAC;QAEH,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QAClF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,4CAA4C,CAAC,QAA8B,EAAE,QAAwC;QACjI,MAAM,kBAAkB,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,kBAAkB,EAAE,UAAU,EAAE,EAAE,CAAC;YACvE,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAChE,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,YAAY,EAAE,cAAc,EAAE,EAAE,CAAC;gBAC7E,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAa,EAAE,CAAC;oBACtE,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAc,CAAC,MAAM,CAAC;oBAC/F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE;wBACnC,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,QAAQ,CAAC;4BACpG,OAAO,KAAK,CAAC;gBAEnB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,SAAS,EAAE,QAAQ,CAAC;wBAC5G,OAAO,KAAK,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,+BAA+B,CAAC,QAA8B;QAE1E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,kCAAkC,EAAE,CAAC;QACzD,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC;IAEd,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,6BAA6B,CAAC,QAA8B;QAExE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,wCAAwC,EAAE,CAAC;QAC/D,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IAEd,CAAC;IAED;;OAEG;IACI,UAAU;QACf,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC5B,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;gBAC/B,IAAI,OAAO,YAAY,2BAAY;oBACjC,MAAM,CAAC,WAAW,CAAC,WAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAC7C,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,iCAAiC,CAAC,OAAiB,EAAE,OAAiB,EAAE,aAAsB;QAC1G,IAAI,OAAO,YAAY,2BAAY,EAAE,CAAC;YACpC,IAAI,OAAO,YAAY,2BAAY,EAAE,CAAC;gBACpC,IAAI,OAAO,CAAC,SAAS,EAAE,KAAK,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;oBAChD,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;oBAC9B,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBACvC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;oBACjD,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,YAAY,2BAAY,EAAE,CAAC;YAC3C,IAAI,OAAO,YAAY,2BAAY,EAAE,CAAC;gBACpC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;oBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;oBACjB,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,YAAY,4BAAU,EAAE,CAAC;YACzC,IAAI,OAAO,YAAY,4BAAU,EAAE,CAAC;gBAClC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;oBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;oBACjB,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA/ND,gDA+NC","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/** @packageDocumentation\n * @module Curve\n /\n\nimport { Geometry } from \"../../Geometry\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range1d } from \"../../geometry3d/Range\";\nimport { AnyCurve } from \"../CurveTypes\";\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\nimport { LineString3d } from \"../LineString3d\";\nimport { Loop } from \"../Loop\";\nimport { ParityRegion } from \"../ParityRegion\";\nimport { StrokeOptions } from \"../StrokeOptions\";\nimport { StrokeCountMap } from \"./StrokeCountMap\";\n\n// cspell:word remapa\n/\n abstract methods for callbacks during sweeps of collections of StrokeCount Structures.\n * * A set of StrokeCountMaps are to be visited multiple times.\n * * The logic that controls the sweep is as below.\n * * The callback object controls the number of sweeps and can adapt its action to the respective sweeps.\n * * Note that a \"false\" from cb.startPass() terminates passes for this chainIndex and primitiveIndex, but all others exit the whole sequence.\n * * This logic occurs 2 or three levels deep\n * * outer level is \"chains\". Simple swept path or loops have only one outer; parity regions have one outer per loop of the parity region\n * * second level is primitive within chain.\n * * If the primitives in a set are \"single component\", second level is lowest.\n * * startSweep() and endSweep() calls are two parameters, with undefined componentIndex\n * * If the primitives in a set are multi-component, there is a third level looping through corresponding components.\n * `\n * if (!cb.startSweeps (chainIndex, primitiveIndex, componentIndex))\n * return false;\n * for (let pass = 0;cb.startPass (pass); pass++){\n * for (each map in working set)\n * if (!cb.visit (pass, map)) return false;\n * if (!cb.endPass ()) return false;\n * }\n * }\n * if (!cb.endSweeps (chainIndex, primitiveIndex, componentIndex)) return false;\n * return true;\n * `\n * @internal\n /\nexport abstract class StrokeCountMapMultipassVisitor {\n /\n called to announce the beginning of one or more sweeps through related StrokeCountMap's\n * @param chainIndex index of loop or path within the various contours.\n * @param primitiveIndex index of primitive within the loop or path.\n * @param componentIndex optional component index.\n * @returns the number of sweeps to perform.\n /\n public startSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\n /\n announce the beginning of a sweep pass.\n * @param pass the index (0,1...) for this sweep pass.\n * @return true to execute this pass. false to break from the pass loop (next method called is endSweeps)\n /\n public abstract startPass(pass: number): boolean;\n public abstract visit(pass: number, map: StrokeCountMap): boolean;\n /\n announce the end of a pass\n * @param pass the index (0,1...) for this sweep pass.\n * @return true to continue the sweeps.\n /\n\n public abstract endPass(pass: number): boolean;\n /\n announce the end of handling for particular chainIndex and primitiveIndex;\n * @return true to continue outer loops.\n /\n public endSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\n\n}\n/\n * pass 1: determine max numStroke\n * * pass 2: impose max numStroke\n * @internal\n /\nexport class StrokeCountMapVisitorApplyMaxCount extends StrokeCountMapMultipassVisitor {\n public myMap: StrokeCountMap;\n public constructor() {\n super();\n this.myMap = StrokeCountMap.createWithComponentIndex();\n }\n /* set up for a pass through corresponding maps. /\n public startPass(pass: number): boolean {\n if (pass === 0) {\n this.myMap.numStroke = 0;\n return true;\n } else if (pass === 1) {\n // nothing to change == numStroke will be applied to each primitive.\n return true;\n }\n // all other pass numbers are rejected ...\n return false;\n }\n /* visit one of the set of corresponding maps. /\n public visit(pass: number, map: StrokeCountMap): boolean {\n if (pass === 0) {\n if (map.numStroke > this.myMap.numStroke)\n this.myMap.numStroke = map.numStroke;\n return true;\n } else if (pass === 1) {\n // apply the max from prior pass\n map.numStroke = this.myMap.numStroke;\n return true;\n }\n // no other pass values should happen -- canceled by startPass.\n return false;\n }\n\n public endPass(_pass: number): boolean { return true; }\n}\n/\n * pass 1: determine max curveLength among maps presented.\n * * pass 2: set the a0 and a1 values to 0 and that max distance\n * @internal\n /\nexport class StrokeCountMapVisitorApplyMaxCurveLength extends StrokeCountMapMultipassVisitor {\n public maxCurveLength: number;\n public constructor() {\n super();\n this.maxCurveLength = 0.0;\n }\n /* set up for a pass through corresponding maps. /\n public startPass(pass: number): boolean {\n if (pass === 0) {\n this.maxCurveLength = 0;\n return true;\n } else if (pass === 1) {\n // nothing to change == numStroke will be applied to each primitive.\n return true;\n }\n // all other pass numbers are rejected ...\n return false;\n }\n /* visit one of the set of corresponding maps. /\n public visit(pass: number, map: StrokeCountMap): boolean {\n if (pass === 0) {\n this.maxCurveLength = Geometry.maxXY(map.curveLength, this.maxCurveLength);\n return true;\n } else if (pass === 1) {\n // apply the max from prior pass\n map.a0 = 0.0;\n map.a1 = this.maxCurveLength;\n return true;\n }\n // no other pass values should happen -- canceled by startPass.\n return false;\n }\n\n public endPass(_pass: number): boolean { return true; }\n}\n/\n class `StrokeCountChain` contains:\n * * `maps` = an array of `StrokeCountMap`\n * * `parent` = parent CurveCollection.\n \n An instance is normally created with either a `Path` or `Loop` as the parent.\n /\nexport class StrokeCountChain {\n public maps: StrokeCountMap[];\n public parent?: CurveCollection;\n /\n options are used (with different purposes) at two times:\n * * When the StrokeCountChain is created, the options affect the stroke counts. This is just creating markup, not actual strokes.\n * * When actual stroking happens, the options control creation of parameters and tangents.\n /\n public options?: StrokeOptions;\n\n private constructor(parent?: CurveCollection, options?: StrokeOptions) {\n this.parent = parent;\n this.maps = [];\n this.options = options;\n }\n public static createForCurveChain(chain: CurveChain, options?: StrokeOptions): StrokeCountChain {\n const result = new StrokeCountChain(chain, options);\n result.parent = chain;\n // A chain can only contain primitives !!!!\n for (const p of chain.children) {\n p.computeAndAttachRecursiveStrokeCounts(options);\n if (p.strokeData)\n result.maps.push(p.strokeData);\n }\n return result;\n }\n public getStrokes(): LineString3d {\n const ls = LineString3d.create();\n if (this.options) {\n if (this.options.needNormals \|\| this.options.needParams) {\n ls.ensureEmptyFractions();\n ls.ensureEmptyDerivatives();\n ls.ensureEmptyUVParams();\n }\n }\n for (const m of this.maps) {\n if (m.primitive)\n m.primitive.addMappedStrokesToLineString3D(m, ls);\n }\n return ls;\n\n }\n /* internal form of /\n private static applySummed01LimitsWithinArray(maps: StrokeCountMap[], incomingSum: number): number {\n let movingSum = incomingSum;\n for (const m of maps) {\n m.a0 += movingSum;\n if (m.componentData) {\n m.a1 = this.applySummed01LimitsWithinArray(m.componentData, m.a0);\n } else {\n m.a1 += movingSum;\n }\n movingSum = m.a1;\n }\n return movingSum;\n }\n /\n walk the maps in the array.\n * * in maps with no component data\n * * increment map.a0 and map.a1 by the incoming distance a0\n * * in maps with component data:\n * * recurse through the component array.\n * * increment map.a0 by the incoming a0.\n * * returned a1 from the componentData array becomes a1\n * @returns upper value of a1 in final map.\n * @param maps\n * @param incomingSum lower value to add to a0 for first map.\n /\n public applySummed01Limits(incomingSum: number): number {\n return StrokeCountChain.applySummed01LimitsWithinArray(this.maps, incomingSum);\n }\n}\n\n/\n class `StrokeCountSection`\\\n * * contains an array of `StrokeCountChain`.\n * * Hence it is the internal node level of a (1-level-deep) tree of `StrokeCountChain`\n * @internal\n /\nexport class StrokeCountSection {\n public chains: StrokeCountChain[];\n public parent?: CurveCollection;\n private constructor(parent?: CurveCollection) { this.parent = parent; this.chains = []; }\n /\n construct array of arrays of `StrokeCountMap`s\n * @param parent\n /\n public static createForParityRegionOrChain(parent: CurveCollection, options?: StrokeOptions): StrokeCountSection {\n const result = new StrokeCountSection(parent);\n if (parent instanceof ParityRegion) {\n for (const child of parent.children) {\n const p = StrokeCountChain.createForCurveChain(child, options);\n result.chains.push(p);\n }\n } else if (parent instanceof CurveChain) {\n result.chains.push(StrokeCountChain.createForCurveChain(parent, options));\n }\n return result;\n }\n /* test if all sections have the same structure. /\n public static areSectionsCompatible(sections: StrokeCountSection[], enforceCounts: boolean): boolean {\n if (sections.length < 2)\n return true; // hm.. don't know if that is useful, but nothing to check here.\n const numChains = sections[0].chains.length;\n for (let i = 1; i < sections.length; i++) {\n // first level: must match number of paths or loops\n if (sections[i].chains.length !== numChains)\n return false;\n // second level: must have same number of primitives in each path or loop\n for (let j = 0; j < sections[0].chains.length; j++) {\n const numPrimitive = sections[0].chains[j].maps.length;\n if (sections[i].chains[j].maps.length !== numPrimitive)\n return false;\n for (let k = 0; k < numPrimitive; k++) {\n if (!sections[0].chains[j].maps[k].isCompatibleComponentStructure(sections[i].chains[j].maps[k], enforceCounts))\n return false;\n }\n }\n\n }\n return true;\n }\n\n /* Within each section, sweep accumulate curveLength field, recording entry and exit sum in each map.\n * * In expected use, (a0,a1) are (0,a) where a is the (previously computed) max length among corresponding maps up and down the section arrays.\n /\n public static remapa0a1WithinEachChain(sections: StrokeCountSection[]) {\n for (const section of sections) {\n for (const chain of section.chains) {\n chain.applySummed01Limits(0.0);\n }\n }\n }\n\n private static applyMultipassVisitorCallbackNoComponents(sections: StrokeCountSection[], chainIndex: number, primitiveIndex: number,\n componentIndex: number \| undefined, callback: StrokeCountMapMultipassVisitor) {\n const numSection = sections.length;\n if (!callback.startSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\n if (componentIndex === undefined) {\n // there are corresponding primitives directly at the section, chain, primitive index:\n for (let pass = 0; ; pass++) {\n if (!callback.startPass(pass))\n break;\n for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\n if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex]))\n return false;\n if (!callback.endPass(pass))\n return false;\n }\n } else {\n // there are corresponding primitives at the section, chain, primitive,componentIndex\n // there are corresponding primitives directly at the section, chain, primitive index:\n for (let pass = 0; ; pass++) {\n if (!callback.startPass(pass))\n break;\n for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\n if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex].componentData![componentIndex]))\n return false;\n if (!callback.endPass(pass))\n return false;\n }\n\n }\n if (!callback.endSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\n return true;\n }\n\n /\n Walk through the sections, emitting callbacks delimiting groups of corresponding primitives.\n * @param sections array of sections (possibly a single path or loop at each section, or possibly a set of parity loops.)\n * @param callback object to be notified during the traversal\n /\n public static runMultiPassVisitorAtCorrespondingPrimitives(sections: StrokeCountSection[], callback: StrokeCountMapMultipassVisitor): boolean {\n const numChainPerSection = sections[0].chains.length;\n for (let chainIndex = 0; chainIndex < numChainPerSection; chainIndex++) {\n const numPrimitive = sections[0].chains[chainIndex].maps.length;\n for (let primitiveIndex = 0; primitiveIndex < numPrimitive; primitiveIndex++) {\n if (sections[0].chains[chainIndex].maps[primitiveIndex].componentData) {\n const numComponent = sections[0].chains[chainIndex].maps[primitiveIndex].componentData!.length;\n for (let i = 0; i < numComponent; i++)\n if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, i, callback))\n return false;\n\n } else {\n if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, undefined, callback))\n return false;\n }\n }\n }\n return true;\n }\n\n /\n * Confirm that all sections in the array have the same structure.\n * * Within each corresponding set of entries, apply the max count to all.\n * @param sections array of per-section stroke count entries\n /\n public static enforceStrokeCountCompatibility(sections: StrokeCountSection[]): boolean {\n\n if (sections.length < 2)\n return true;\n if (!StrokeCountSection.areSectionsCompatible(sections, false))\n return false;\n const visitor = new StrokeCountMapVisitorApplyMaxCount();\n this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\n return true;\n\n }\n /\n * Confirm that all sections in the array have the same structure.\n * * Within each corresponding set of entries up and down the sections, set curveLength as the maximum of the respective curve lengths.\n * * Along each section, sum curveLengths (which were just reset) to get consistent along-chain parameters\n * @param sections array of per-section stroke count entries\n /\n public static enforceCompatibleDistanceSums(sections: StrokeCountSection[]): boolean {\n\n if (sections.length < 2)\n return true;\n if (!StrokeCountSection.areSectionsCompatible(sections, false))\n return false;\n const visitor = new StrokeCountMapVisitorApplyMaxCurveLength();\n this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\n this.remapa0a1WithinEachChain(sections);\n return true;\n\n }\n\n /\n Return stroked form of the section.\n /\n public getStrokes(): AnyCurve {\n if (this.chains.length === 1) {\n return this.chains[0].getStrokes();\n } else {\n const region = ParityRegion.create();\n for (const c of this.chains) {\n const strokes = c.getStrokes();\n if (strokes instanceof LineString3d)\n region.tryAddChild(Loop.create(strokes));\n }\n return region;\n }\n }\n /\n Given two compatible stroke sets (as returned by getStrokes) extend a range\n * with the distances between corresponding points.\n * * Each set of strokes may be:\n * * linestring\n * * ParityRegion\n * * CurveChain (Loop or Path)\n * @param strokeA first set of strokes\n * @param strokeB second set of strokes\n * @param rangeToExtend caller-allocated range to be extended.\n * @returns true if structures are compatible.\n */\n public static extendDistanceRangeBetweenStrokes(strokeA: AnyCurve, strokeB: AnyCurve, rangeToExtend: Range1d): boolean {\n if (strokeA instanceof LineString3d) {\n if (strokeB instanceof LineString3d) {\n if (strokeA.numPoints() === strokeB.numPoints()) {\n const n = strokeA.numPoints();\n const pointA = Point3d.create();\n const pointB = Point3d.create();\n const allPointA = strokeA.packedPoints;\n const allPointB = strokeB.packedPoints;\n\n for (let i = 0; i < n; i++) {\n allPointA.getPoint3dAtCheckedPointIndex(i, pointA);\n allPointB.getPoint3dAtCheckedPointIndex(i, pointB);\n rangeToExtend.extendX(pointA.distance(pointB));\n }\n return true;\n }\n }\n } else if (strokeA instanceof ParityRegion) {\n if (strokeB instanceof ParityRegion) {\n const childrenA = strokeA.children;\n const childrenB = strokeB.children;\n const n = childrenA.length;\n if (n === childrenB.length) {\n for (let i = 0; i < n; i++) {\n if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\n return false;\n }\n return true;\n }\n }\n } else if (strokeA instanceof CurveChain) {\n if (strokeB instanceof CurveChain) {\n const childrenA = strokeA.children;\n const childrenB = strokeB.children;\n const n = childrenA.length;\n if (n === childrenB.length) {\n for (let i = 0; i < n; i++) {\n if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\n return false;\n }\n return true;\n }\n }\n }\n return false;\n }\n}\n"]}
1	+ {"version":3,"file":"StrokeCountChain.js","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountChain.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAA0C;AAC1C,sEAA2D;AAE3D,wDAAiE;AAEjE,kDAA+C;AAC/C,kCAA+B;AAC/B,kDAA+C;AAE/C,gDAA6C;AAC7C,qDAAkD;AAElD,qBAAqB;AACrB;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAsB,8BAA8B;IAClD;;;;;;OAMG;IACI,WAAW,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAepH;;;OAGG;IACI,SAAS,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CAEnH;AA7BD,wEA6BC;AACD;;;;GAIG;AACH,MAAa,kCAAmC,SAAQ,8BAA8B;IAC7E,KAAK,CAAiB;IAC7B;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,+BAAc,CAAC,wBAAwB,EAAE,CAAC;IACzD,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,oEAAoE;YACpE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS;gBACtC,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;YACvC,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,gCAAgC;YAChC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YACrC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AAlCD,gFAkCC;AACD;;;;GAIG;AACH,MAAa,wCAAyC,SAAQ,8BAA8B;IACnF,cAAc,CAAS;IAC9B;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC;IAC5B,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,oEAAoE;YACpE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,GAAG,mBAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3E,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,gCAAgC;YAChC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;YACb,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AAlCD,4FAkCC;AACD;;;;;;;GAOG;AACH,MAAa,gBAAgB;IACpB,IAAI,CAAmB;IACvB,MAAM,CAAmB;IAChC;;;;OAIG;IACI,OAAO,CAAiB;IAE/B,YAAoB,MAAwB,EAAE,OAAuB;QACnE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,KAAiB,EAAE,OAAuB;QAC7D,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACpD,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,2CAA2C;QAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC/B,CAAC,CAAC,qCAAqC,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,CAAC,CAAC,UAAU;gBACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,UAAU;QACf,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;gBACxD,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC1B,EAAE,CAAC,sBAAsB,EAAE,CAAC;gBAC5B,EAAE,CAAC,mBAAmB,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,CAAC,SAAS;gBACb,CAAC,CAAC,SAAS,CAAC,8BAA8B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,EAAE,CAAC;IAEZ,CAAC;IACD,wBAAwB;IAChB,MAAM,CAAC,8BAA8B,CAAC,IAAsB,EAAE,WAAmB;QACvF,IAAI,SAAS,GAAG,WAAW,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;YAClB,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;gBACpB,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,8BAA8B,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACpE,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;YACpB,CAAC;YACD,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;QACnB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,mBAAmB,CAAC,WAAmB;QAC5C,OAAO,gBAAgB,CAAC,8BAA8B,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACjF,CAAC;CACF;AAvED,4CAuEC;AAED;;;;;GAKG;AACH,MAAa,kBAAkB;IACtB,MAAM,CAAqB;IAC3B,MAAM,CAAmB;IAChC,YAAoB,MAAwB,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;IACzF;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,MAAuB,EAAE,OAAuB;QACnE,MAAM,MAAM,GAAG,IAAI,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC9C,MAAM,gBAAgB,GAAG,CAAC,KAAiB,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;QAC5G,MAAM,kBAAkB,GAAG,CAAC,MAAoB,EAAE,EAAE,GAAG,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ;YAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QACtH,IAAI,MAAM,YAAY,yBAAW,EAAE,CAAC;YAClC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,IAAI,KAAK,YAAY,2BAAY;oBAC/B,kBAAkB,CAAC,KAAK,CAAC,CAAC;;oBAE1B,gBAAgB,CAAC,KAAK,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,2BAAY,EAAE,CAAC;YAC1C,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC;aAAM,IAAI,MAAM,YAAY,4BAAU,EAAE,CAAC;YACxC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oDAAoD;IAC7C,MAAM,CAAC,qBAAqB,CAAC,QAA8B,EAAE,aAAsB;QACxF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC,CAAE,gEAAgE;QAChF,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,mDAAmD;YACnD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS;gBACzC,OAAO,KAAK,CAAC;YACf,yEAAyE;YACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACvD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,YAAY;oBACpD,OAAO,KAAK,CAAC;gBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;wBAC7G,OAAO,KAAK,CAAC;gBACjB,CAAC;YACH,CAAC;QAEH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,wBAAwB,CAAC,QAA8B;QACnE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACnC,KAAK,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,yCAAyC,CAAC,QAA8B,EAAE,UAAkB,EAAE,cAAsB,EACjI,cAAkC,EAAE,QAAwC;QAC5E,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QACpF,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YACjC,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;wBACvF,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,qFAAqF;YACrF,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAc,CAAC,cAAc,CAAC,CAAC;wBACtH,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;YACjB,CAAC;QAEH,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QAClF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,4CAA4C,CAAC,QAA8B,EAAE,QAAwC;QACjI,MAAM,kBAAkB,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,kBAAkB,EAAE,UAAU,EAAE,EAAE,CAAC;YACvE,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAChE,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,YAAY,EAAE,cAAc,EAAE,EAAE,CAAC;gBAC7E,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAa,EAAE,MAAM,IAAI,CAAC,CAAC;gBACpG,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;oBACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;wBACtC,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,QAAQ,CAAC;4BACpG,OAAO,KAAK,CAAC;oBACjB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,SAAS,EAAE,QAAQ,CAAC;wBAC5G,OAAO,KAAK,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,+BAA+B,CAAC,QAA8B;QAE1E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,kCAAkC,EAAE,CAAC;QACzD,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC;IAEd,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,6BAA6B,CAAC,QAA8B;QAExE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,wCAAwC,EAAE,CAAC;QAC/D,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IAEd,CAAC;IAED;;OAEG;IACI,UAAU;QACf,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC5B,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;gBAC/B,IAAI,OAAO,YAAY,2BAAY;oBACjC,MAAM,CAAC,WAAW,CAAC,WAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAC7C,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,iCAAiC,CAAC,OAAiB,EAAE,OAAiB,EAAE,aAAsB;QAC1G,IAAI,OAAO,YAAY,2BAAY,EAAE,CAAC;YACpC,IAAI,OAAO,YAAY,2BAAY,EAAE,CAAC;gBACpC,IAAI,OAAO,CAAC,SAAS,EAAE,KAAK,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;oBAChD,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;oBAC9B,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBACvC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;oBACjD,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,YAAY,2BAAY,EAAE,CAAC;YAC3C,IAAI,OAAO,YAAY,2BAAY,EAAE,CAAC;gBACpC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;oBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;oBACjB,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,YAAY,4BAAU,EAAE,CAAC;YACzC,IAAI,OAAO,YAAY,4BAAU,EAAE,CAAC;gBAClC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;oBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;oBACjB,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AArOD,gDAqOC","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/** @packageDocumentation\n * @module Curve\n /\n\nimport { Geometry } from \"../../Geometry\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range1d } from \"../../geometry3d/Range\";\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\nimport { AnyCurve } from \"../CurveTypes\";\nimport { LineString3d } from \"../LineString3d\";\nimport { Loop } from \"../Loop\";\nimport { ParityRegion } from \"../ParityRegion\";\nimport { StrokeOptions } from \"../StrokeOptions\";\nimport { UnionRegion } from \"../UnionRegion\";\nimport { StrokeCountMap } from \"./StrokeCountMap\";\n\n// cspell:word remapa\n/\n abstract methods for callbacks during sweeps of collections of StrokeCount Structures.\n * * A set of StrokeCountMaps are to be visited multiple times.\n * * The logic that controls the sweep is as below.\n * * The callback object controls the number of sweeps and can adapt its action to the respective sweeps.\n * * Note that a \"false\" from cb.startPass() terminates passes for this chainIndex and primitiveIndex, but all others exit the whole sequence.\n * * This logic occurs 2 or three levels deep\n * * outer level is \"chains\". Simple swept path or loops have only one outer; parity regions have one outer per loop of the parity region\n * * second level is primitive within chain.\n * * If the primitives in a set are \"single component\", second level is lowest.\n * * startSweep() and endSweep() calls are two parameters, with undefined componentIndex\n * * If the primitives in a set are multi-component, there is a third level looping through corresponding components.\n * `\n * if (!cb.startSweeps (chainIndex, primitiveIndex, componentIndex))\n * return false;\n * for (let pass = 0;cb.startPass (pass); pass++){\n * for (each map in working set)\n * if (!cb.visit (pass, map)) return false;\n * if (!cb.endPass ()) return false;\n * }\n * }\n * if (!cb.endSweeps (chainIndex, primitiveIndex, componentIndex)) return false;\n * return true;\n * `\n * @internal\n /\nexport abstract class StrokeCountMapMultipassVisitor {\n /\n called to announce the beginning of one or more sweeps through related StrokeCountMap's\n * @param chainIndex index of loop or path within the various contours.\n * @param primitiveIndex index of primitive within the loop or path.\n * @param componentIndex optional component index.\n * @returns the number of sweeps to perform.\n /\n public startSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\n /\n announce the beginning of a sweep pass.\n * @param pass the index (0,1...) for this sweep pass.\n * @return true to execute this pass. false to break from the pass loop (next method called is endSweeps)\n /\n public abstract startPass(pass: number): boolean;\n public abstract visit(pass: number, map: StrokeCountMap): boolean;\n /\n announce the end of a pass\n * @param pass the index (0,1...) for this sweep pass.\n * @return true to continue the sweeps.\n /\n\n public abstract endPass(pass: number): boolean;\n /\n announce the end of handling for particular chainIndex and primitiveIndex;\n * @return true to continue outer loops.\n /\n public endSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\n\n}\n/\n * pass 1: determine max numStroke\n * * pass 2: impose max numStroke\n * @internal\n /\nexport class StrokeCountMapVisitorApplyMaxCount extends StrokeCountMapMultipassVisitor {\n public myMap: StrokeCountMap;\n public constructor() {\n super();\n this.myMap = StrokeCountMap.createWithComponentIndex();\n }\n /* set up for a pass through corresponding maps. /\n public startPass(pass: number): boolean {\n if (pass === 0) {\n this.myMap.numStroke = 0;\n return true;\n } else if (pass === 1) {\n // nothing to change == numStroke will be applied to each primitive.\n return true;\n }\n // all other pass numbers are rejected ...\n return false;\n }\n /* visit one of the set of corresponding maps. /\n public visit(pass: number, map: StrokeCountMap): boolean {\n if (pass === 0) {\n if (map.numStroke > this.myMap.numStroke)\n this.myMap.numStroke = map.numStroke;\n return true;\n } else if (pass === 1) {\n // apply the max from prior pass\n map.numStroke = this.myMap.numStroke;\n return true;\n }\n // no other pass values should happen -- canceled by startPass.\n return false;\n }\n\n public endPass(_pass: number): boolean { return true; }\n}\n/\n * pass 1: determine max curveLength among maps presented.\n * * pass 2: set the a0 and a1 values to 0 and that max distance\n * @internal\n /\nexport class StrokeCountMapVisitorApplyMaxCurveLength extends StrokeCountMapMultipassVisitor {\n public maxCurveLength: number;\n public constructor() {\n super();\n this.maxCurveLength = 0.0;\n }\n /* set up for a pass through corresponding maps. /\n public startPass(pass: number): boolean {\n if (pass === 0) {\n this.maxCurveLength = 0;\n return true;\n } else if (pass === 1) {\n // nothing to change == numStroke will be applied to each primitive.\n return true;\n }\n // all other pass numbers are rejected ...\n return false;\n }\n /* visit one of the set of corresponding maps. /\n public visit(pass: number, map: StrokeCountMap): boolean {\n if (pass === 0) {\n this.maxCurveLength = Geometry.maxXY(map.curveLength, this.maxCurveLength);\n return true;\n } else if (pass === 1) {\n // apply the max from prior pass\n map.a0 = 0.0;\n map.a1 = this.maxCurveLength;\n return true;\n }\n // no other pass values should happen -- canceled by startPass.\n return false;\n }\n\n public endPass(_pass: number): boolean { return true; }\n}\n/\n class `StrokeCountChain` contains:\n * * `maps` = an array of `StrokeCountMap`\n * * `parent` = parent CurveCollection.\n \n An instance is normally created with either a `Path` or `Loop` as the parent.\n * @internal\n /\nexport class StrokeCountChain {\n public maps: StrokeCountMap[];\n public parent?: CurveCollection;\n /\n options are used (with different purposes) at two times:\n * * When the StrokeCountChain is created, the options affect the stroke counts. This is just creating markup, not actual strokes.\n * * When actual stroking happens, the options control creation of parameters and tangents.\n /\n public options?: StrokeOptions;\n\n private constructor(parent?: CurveCollection, options?: StrokeOptions) {\n this.parent = parent;\n this.maps = [];\n this.options = options;\n }\n public static create(chain: CurveChain, options?: StrokeOptions): StrokeCountChain {\n const result = new StrokeCountChain(chain, options);\n result.parent = chain;\n // A chain can only contain primitives !!!!\n for (const p of chain.children) {\n p.computeAndAttachRecursiveStrokeCounts(options);\n if (p.strokeData)\n result.maps.push(p.strokeData);\n }\n return result;\n }\n public getStrokes(): LineString3d {\n const ls = LineString3d.create();\n if (this.options) {\n if (this.options.needNormals \|\| this.options.needParams) {\n ls.ensureEmptyFractions();\n ls.ensureEmptyDerivatives();\n ls.ensureEmptyUVParams();\n }\n }\n for (const m of this.maps) {\n if (m.primitive)\n m.primitive.addMappedStrokesToLineString3D(m, ls);\n }\n return ls;\n\n }\n /* internal form of /\n private static applySummed01LimitsWithinArray(maps: StrokeCountMap[], incomingSum: number): number {\n let movingSum = incomingSum;\n for (const m of maps) {\n m.a0 += movingSum;\n if (m.componentData) {\n m.a1 = this.applySummed01LimitsWithinArray(m.componentData, m.a0);\n } else {\n m.a1 += movingSum;\n }\n movingSum = m.a1;\n }\n return movingSum;\n }\n /\n walk the maps in the array.\n * * in maps with no component data\n * * increment map.a0 and map.a1 by the incoming distance a0\n * * in maps with component data:\n * * recurse through the component array.\n * * increment map.a0 by the incoming a0.\n * * returned a1 from the componentData array becomes a1\n * @returns upper value of a1 in final map.\n * @param maps\n * @param incomingSum lower value to add to a0 for first map.\n /\n public applySummed01Limits(incomingSum: number): number {\n return StrokeCountChain.applySummed01LimitsWithinArray(this.maps, incomingSum);\n }\n}\n\n/\n class `StrokeCountSection`\\\n * * contains an array of `StrokeCountChain`.\n * * Hence it is the internal node level of a (1-level-deep) tree of `StrokeCountChain`\n * @internal\n /\nexport class StrokeCountSection {\n public chains: StrokeCountChain[];\n public parent?: CurveCollection;\n private constructor(parent?: CurveCollection) { this.parent = parent; this.chains = []; }\n /\n construct array of arrays of `StrokeCountMap`s\n * @param parent\n /\n public static create(parent: CurveCollection, options?: StrokeOptions): StrokeCountSection {\n const result = new StrokeCountSection(parent);\n const appendCurveChain = (chain: CurveChain) => result.chains.push(StrokeCountChain.create(chain, options));\n const appendParityRegion = (region: ParityRegion) => { for (const child of region.children) appendCurveChain(child); }\n if (parent instanceof UnionRegion) {\n for (const child of parent.children) {\n if (child instanceof ParityRegion)\n appendParityRegion(child);\n else\n appendCurveChain(child);\n }\n } else if (parent instanceof ParityRegion) {\n appendParityRegion(parent);\n } else if (parent instanceof CurveChain) {\n appendCurveChain(parent);\n }\n return result;\n }\n /* test if all sections have the same structure. /\n public static areSectionsCompatible(sections: StrokeCountSection[], enforceCounts: boolean): boolean {\n if (sections.length < 2)\n return true; // hm.. don't know if that is useful, but nothing to check here.\n const numChains = sections[0].chains.length;\n for (let i = 1; i < sections.length; i++) {\n // first level: must match number of paths or loops\n if (sections[i].chains.length !== numChains)\n return false;\n // second level: must have same number of primitives in each path or loop\n for (let j = 0; j < sections[0].chains.length; j++) {\n const numPrimitive = sections[0].chains[j].maps.length;\n if (sections[i].chains[j].maps.length !== numPrimitive)\n return false;\n for (let k = 0; k < numPrimitive; k++) {\n if (!sections[0].chains[j].maps[k].isCompatibleComponentStructure(sections[i].chains[j].maps[k], enforceCounts))\n return false;\n }\n }\n\n }\n return true;\n }\n\n /* Within each section, sweep accumulate curveLength field, recording entry and exit sum in each map.\n * * In expected use, (a0,a1) are (0,a) where a is the (previously computed) max length among corresponding maps up and down the section arrays.\n /\n public static remapa0a1WithinEachChain(sections: StrokeCountSection[]) {\n for (const section of sections) {\n for (const chain of section.chains) {\n chain.applySummed01Limits(0.0);\n }\n }\n }\n\n private static applyMultipassVisitorCallbackNoComponents(sections: StrokeCountSection[], chainIndex: number, primitiveIndex: number,\n componentIndex: number \| undefined, callback: StrokeCountMapMultipassVisitor) {\n const numSection = sections.length;\n if (!callback.startSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\n if (componentIndex === undefined) {\n // there are corresponding primitives directly at the section, chain, primitive index:\n for (let pass = 0; ; pass++) {\n if (!callback.startPass(pass))\n break;\n for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\n if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex]))\n return false;\n if (!callback.endPass(pass))\n return false;\n }\n } else {\n // there are corresponding primitives at the section, chain, primitive,componentIndex\n // there are corresponding primitives directly at the section, chain, primitive index:\n for (let pass = 0; ; pass++) {\n if (!callback.startPass(pass))\n break;\n for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\n if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex].componentData![componentIndex]))\n return false;\n if (!callback.endPass(pass))\n return false;\n }\n\n }\n if (!callback.endSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\n return true;\n }\n\n /\n Walk through the sections, emitting callbacks delimiting groups of corresponding primitives.\n * @param sections array of sections (possibly a single path or loop at each section, or possibly a set of parity loops.)\n * @param callback object to be notified during the traversal\n /\n public static runMultiPassVisitorAtCorrespondingPrimitives(sections: StrokeCountSection[], callback: StrokeCountMapMultipassVisitor): boolean {\n const numChainPerSection = sections[0].chains.length;\n for (let chainIndex = 0; chainIndex < numChainPerSection; chainIndex++) {\n const numPrimitive = sections[0].chains[chainIndex].maps.length;\n for (let primitiveIndex = 0; primitiveIndex < numPrimitive; primitiveIndex++) {\n const numComponent = sections[0].chains[chainIndex].maps[primitiveIndex].componentData?.length ?? 0;\n if (numComponent > 0) {\n for (let i = 0; i < numComponent; i++) {\n if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, i, callback))\n return false;\n }\n } else {\n if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, undefined, callback))\n return false;\n }\n }\n }\n return true;\n }\n\n /\n * Confirm that all sections in the array have the same structure.\n * * Within each corresponding set of entries, apply the max count to all.\n * @param sections array of per-section stroke count entries\n /\n public static enforceStrokeCountCompatibility(sections: StrokeCountSection[]): boolean {\n\n if (sections.length < 2)\n return true;\n if (!StrokeCountSection.areSectionsCompatible(sections, false))\n return false;\n const visitor = new StrokeCountMapVisitorApplyMaxCount();\n this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\n return true;\n\n }\n /\n * Confirm that all sections in the array have the same structure.\n * * Within each corresponding set of entries up and down the sections, set curveLength as the maximum of the respective curve lengths.\n * * Along each section, sum curveLengths (which were just reset) to get consistent along-chain parameters\n * @param sections array of per-section stroke count entries\n /\n public static enforceCompatibleDistanceSums(sections: StrokeCountSection[]): boolean {\n\n if (sections.length < 2)\n return true;\n if (!StrokeCountSection.areSectionsCompatible(sections, false))\n return false;\n const visitor = new StrokeCountMapVisitorApplyMaxCurveLength();\n this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\n this.remapa0a1WithinEachChain(sections);\n return true;\n\n }\n\n /\n Return stroked form of the section.\n /\n public getStrokes(): AnyCurve {\n if (this.chains.length === 1) {\n return this.chains[0].getStrokes();\n } else {\n const region = ParityRegion.create();\n for (const c of this.chains) {\n const strokes = c.getStrokes();\n if (strokes instanceof LineString3d)\n region.tryAddChild(Loop.create(strokes));\n }\n return region;\n }\n }\n /\n Given two compatible stroke sets (as returned by getStrokes) extend a range\n * with the distances between corresponding points.\n * * Each set of strokes may be:\n * * linestring\n * * ParityRegion\n * * CurveChain (Loop or Path)\n * @param strokeA first set of strokes\n * @param strokeB second set of strokes\n * @param rangeToExtend caller-allocated range to be extended.\n * @returns true if structures are compatible.\n */\n public static extendDistanceRangeBetweenStrokes(strokeA: AnyCurve, strokeB: AnyCurve, rangeToExtend: Range1d): boolean {\n if (strokeA instanceof LineString3d) {\n if (strokeB instanceof LineString3d) {\n if (strokeA.numPoints() === strokeB.numPoints()) {\n const n = strokeA.numPoints();\n const pointA = Point3d.create();\n const pointB = Point3d.create();\n const allPointA = strokeA.packedPoints;\n const allPointB = strokeB.packedPoints;\n\n for (let i = 0; i < n; i++) {\n allPointA.getPoint3dAtCheckedPointIndex(i, pointA);\n allPointB.getPoint3dAtCheckedPointIndex(i, pointB);\n rangeToExtend.extendX(pointA.distance(pointB));\n }\n return true;\n }\n }\n } else if (strokeA instanceof ParityRegion) {\n if (strokeB instanceof ParityRegion) {\n const childrenA = strokeA.children;\n const childrenB = strokeB.children;\n const n = childrenA.length;\n if (n === childrenB.length) {\n for (let i = 0; i < n; i++) {\n if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\n return false;\n }\n return true;\n }\n }\n } else if (strokeA instanceof CurveChain) {\n if (strokeB instanceof CurveChain) {\n const childrenA = strokeA.children;\n const childrenB = strokeB.children;\n const n = childrenA.length;\n if (n === childrenB.length) {\n for (let i = 0; i < n; i++) {\n if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\n return false;\n }\n return true;\n }\n }\n }\n return false;\n }\n}\n"]}

package/lib/cjs/curve/RegionMomentsXY.d.ts CHANGED Viewed

@@ -31,7 +31,7 @@ export declare class RegionMomentsXY extends NullGeometryHandler {
     handleLineString3d(ls: LineString3d): void;
     /** Accumulate integrals over the (triangular) area from the origin to this line segment. */
     handleLineSegment3d(segment: LineSegment3d): void;
-    /** Accumulate integrals from origin to all primitives in the chain. */
+    /** Accumulate integrals from origin to all primitives in the loop. */
     handleLoop(loop: Loop): MomentData | undefined;
     private handleAnyRegion;
     /** Accumulate integrals from origin to the components of the parity region. */

package/lib/cjs/curve/RegionMomentsXY.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"RegionMomentsXY.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionMomentsXY.ts"],"names":[],"mappings":"AAKA;;GAEG;AAIH,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAE7D,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AAEpE,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAEjE,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE5C;;;GAGG;AACH,qBAAa,eAAgB,SAAQ,mBAAmB;IACtD,OAAO,CAAC,iBAAiB,CAAC,CAAa;IACvC,OAAO,CAAC,OAAO,CAAoB;IACnC,OAAO,CAAC,OAAO,CAAoB;IACnC;;;;OAIG;IACa,WAAW,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI;IAgC7C,6FAA6F;IAC7E,kBAAkB,CAAC,EAAE,EAAE,YAAY,GAAG,IAAI;IAI1D,4FAA4F;IAC5E,mBAAmB,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI;IAMjE,~~uEAAuE~~;~~IACvD~~,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,UAAU,GAAG,SAAS;IAQ9D,OAAO,CAAC,eAAe;~~IAiBvB~~,+EAA+E;IAC/D,kBAAkB,CAAC,MAAM,EAAE,YAAY,GAAG,UAAU,GAAG,SAAS;IAGhF,8EAA8E;IAC9D,iBAAiB,CAAC,MAAM,EAAE,WAAW,GAAG,UAAU,GAAG,SAAS;IAI9E,OAAO,CAAC,cAAc,CAAC,CAAgB;IACvC,OAAO,CAAC,gBAAgB;IASxB;;;OAGG;IACI,oBAAoB,CAAC,EAAE,EAAE,cAAc,GAAG,IAAI;IAMrD,yEAAyE;IACzD,oBAAoB,CAAC,CAAC,EAAE,cAAc,GAAG,IAAI;IAG7D,0EAA0E;IAC1D,qBAAqB,CAAC,CAAC,EAAE,eAAe,GAAG,IAAI;IAG/D,0EAA0E;IAC1D,sBAAsB,CAAC,CAAC,EAAE,kBAAkB,GAAG,IAAI;CAGpE"}
1	+ {"version":3,"file":"RegionMomentsXY.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionMomentsXY.ts"],"names":[],"mappings":"AAKA;;GAEG;AAIH,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAE7D,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AAEpE,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAEjE,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE5C;;;GAGG;AACH,qBAAa,eAAgB,SAAQ,mBAAmB;IACtD,OAAO,CAAC,iBAAiB,CAAC,CAAa;IACvC,OAAO,CAAC,OAAO,CAAoB;IACnC,OAAO,CAAC,OAAO,CAAoB;IACnC;;;;OAIG;IACa,WAAW,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI;IAgC7C,6FAA6F;IAC7E,kBAAkB,CAAC,EAAE,EAAE,YAAY,GAAG,IAAI;IAI1D,4FAA4F;IAC5E,mBAAmB,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI;IAMjE,sEAAsE;IACtD,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,UAAU,GAAG,SAAS;IAQ9D,OAAO,CAAC,eAAe;IAmBvB,+EAA+E;IAC/D,kBAAkB,CAAC,MAAM,EAAE,YAAY,GAAG,UAAU,GAAG,SAAS;IAGhF,8EAA8E;IAC9D,iBAAiB,CAAC,MAAM,EAAE,WAAW,GAAG,UAAU,GAAG,SAAS;IAI9E,OAAO,CAAC,cAAc,CAAC,CAAgB;IACvC,OAAO,CAAC,gBAAgB;IASxB;;;OAGG;IACI,oBAAoB,CAAC,EAAE,EAAE,cAAc,GAAG,IAAI;IAMrD,yEAAyE;IACzD,oBAAoB,CAAC,CAAC,EAAE,cAAc,GAAG,IAAI;IAG7D,0EAA0E;IAC1D,qBAAqB,CAAC,CAAC,EAAE,eAAe,GAAG,IAAI;IAG/D,0EAA0E;IAC1D,sBAAsB,CAAC,CAAC,EAAE,kBAAkB,GAAG,IAAI;CAGpE"}

package/lib/cjs/curve/RegionMomentsXY.js CHANGED Viewed

@@ -11,6 +11,7 @@ const Point3dVector3d_1 = require("../geometry3d/Point3dVector3d");
 const MomentData_1 = require("../geometry4d/MomentData");
 const LineString3d_1 = require("./LineString3d");
 const Loop_1 = require("./Loop");
+const ParityRegion_1 = require("./ParityRegion");
 const RegionOps_1 = require("./RegionOps");
 const StrokeOptions_1 = require("./StrokeOptions");
 /**
@@ -68,7 +69,7 @@ class RegionMomentsXY extends GeometryHandler_1.NullGeometryHandler {
         segment.endPoint(this._point1);
         momentData.accumulateTriangleMomentsXY(undefined, this._point0, this._point1);
     }
-    /** Accumulate integrals from origin to all primitives in the chain. */
+    /** Accumulate integrals from origin to all primitives in the loop. */
     handleLoop(loop) {
         const momentData = this._activeMomentData = MomentData_1.MomentData.create();
         momentData.needOrigin = false;
@@ -78,7 +79,7 @@ class RegionMomentsXY extends GeometryHandler_1.NullGeometryHandler {
         return momentData;
     }
     handleAnyRegion(region) {
-        // guarantee there is no overlapping children
+        // guarantee there are no overlapping children and parity loops have been properly oriented
         const merged = RegionOps_1.RegionOps.regionBooleanXY(region, undefined, RegionOps_1.RegionBinaryOpType.Union);
         if (!merged)
             return undefined;
@@ -88,7 +89,9 @@ class RegionMomentsXY extends GeometryHandler_1.NullGeometryHandler {
         for (const child of merged.children) {
             const childMoments = child.dispatchToGeometryHandler(this);
             if (childMoments) {
-                const sign0 = childMoments.signFactor(1.0);
+                // parity region hole sums subtract; all other regions add
+                const scale = (merged instanceof ParityRegion_1.ParityRegion && childMoments.quantitySum < 0) ? -1.0 : 1.0;
+                const sign0 = childMoments.signFactor(scale);
                 summedMoments.accumulateProducts(childMoments, sign0);
             }
         }

package/lib/cjs/curve/RegionMomentsXY.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"RegionMomentsXY.js","sourceRoot":"","sources":["../../../src/curve/RegionMomentsXY.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAU/F,+CAA4C;AAC5C,mEAAoE;AACpE,mEAAwD;AACxD,yDAAsD;AAKtD,iDAA8C;AAC9C,iCAA8B;AAE9B,2CAA4D;AAE5D,mDAAgD;AAGhD;;;GAGG;AACH,MAAa,eAAgB,SAAQ,qCAAmB;IAC9C,iBAAiB,CAAc;IAC/B,OAAO,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IAC3B,OAAO,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IACnC;;;;OAIG;IACa,WAAW,CAAC,GAAU;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC;QAC5C,MAAM,YAAY,GAAG,YAAY,GAAG,GAAG,CAAC;QACxC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC/B,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAChC,IAAI,aAAK,CAAC,mBAAmB,CAAC,YAAY,CAAC,EAAE,CAAC;YAC5C,CAAC,GAAG,GAAG,CAAC;YACR,CAAC,GAAG,CAAC,GAAG,CAAC;YACT,EAAE,GAAG,GAAG,CAAC;QACX,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,UAAU,GAAG,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,gBAAgB,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACpD,MAAM,YAAY,GAAG,GAAG,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QACxF,UAAU,CAAC,qCAAqC,CAC9C,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,CACtF,CAAC;QACF,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACxC,UAAU,CAAC,2BAA2B,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD,6FAA6F;IAC7E,kBAAkB,CAAC,EAAgB;QACjD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,UAAU,CAAC,uCAAuC,CAAC,SAAS,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC;IACjF,CAAC;IACD,4FAA4F;IAC5E,mBAAmB,CAAC,OAAsB;QACxD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,UAAU,CAAC,2BAA2B,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAChF,CAAC;IACD,uEAAuE;IACvD,UAAU,CAAC,IAAU;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,GAAG,uBAAU,CAAC,MAAM,EAAE,CAAC;QAChE,UAAU,CAAC,UAAU,GAAG,KAAK,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,UAAU,CAAC;IACpB,CAAC;IACO,eAAe,CAAC,MAAiB;QACvC,6CAA6C;QAC7C,MAAM,MAAM,GAAG,qBAAS,CAAC,eAAe,CAAC,MAAM,EAAE,SAAS,EAAE,8BAAkB,CAAC,KAAK,CAAC,CAAC;QACtF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,WAAI;YACxB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,aAAa,GAAG,uBAAU,CAAC,MAAM,EAAE,CAAC;QAC1C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;YAC3D,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;gBAC3C,aAAa,CAAC,kBAAkB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,+EAA+E;IAC/D,kBAAkB,CAAC,MAAoB;QACrD,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,8EAA8E;IAC9D,iBAAiB,CAAC,MAAmB;QACnD,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAEO,cAAc,CAAiB,CAAC,uCAAuC;IACvE,gBAAgB;QACtB,IAAI,IAAI,CAAC,cAAc;YACrB,OAAO,IAAI,CAAC,cAAc,CAAC;QAC7B,MAAM,OAAO,GAAG,6BAAa,CAAC,eAAe,EAAE,CAAC;QAChD,gEAAgE;QAChE,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC;QAC9B,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;OAGG;IACI,oBAAoB,CAAC,EAAkB;QAC5C,MAAM,OAAO,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxC,EAAE,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IACD,yEAAyE;IACzD,oBAAoB,CAAC,CAAiB;QACpD,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,0EAA0E;IAC1D,qBAAqB,CAAC,CAAkB;QACtD,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,0EAA0E;IAC1D,sBAAsB,CAAC,CAAqB;QAC1D,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;CACF;AAxHD,0CAwHC","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 Curve\n /\n\n// import { Geometry, Angle, AngleSweep } from \"../Geometry\";\n\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\nimport { BSplineCurve3dH } from \"../bspline/BSplineCurve3dH\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { NullGeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\nimport { MomentData } from \"../geometry4d/MomentData\";\nimport { Arc3d } from \"./Arc3d\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyRegion } from \"./CurveTypes\";\nimport { LineSegment3d } from \"./LineSegment3d\";\nimport { LineString3d } from \"./LineString3d\";\nimport { Loop } from \"./Loop\";\nimport { ParityRegion } from \"./ParityRegion\";\nimport { RegionBinaryOpType, RegionOps } from \"./RegionOps\";\nimport { TransitionSpiral3d } from \"./spiral/TransitionSpiral3d\";\nimport { StrokeOptions } from \"./StrokeOptions\";\nimport { UnionRegion } from \"./UnionRegion\";\n\n/\n Implementation class for computing XY area moments.\n * @internal\n /\nexport class RegionMomentsXY extends NullGeometryHandler {\n private _activeMomentData?: MomentData;\n private _point0 = Point3d.create();\n private _point1 = Point3d.create();\n /\n Accumulate (independent) integrations over:\n * * The area between the arc and the chord connecting its endpoints.\n * * The triangle with vertices: origin, arc start, arc end.\n /\n public override handleArc3d(arc: Arc3d): void {\n const momentData = this._activeMomentData!;\n const sweepRadians = arc.sweep.sweepRadians;\n const alphaRadians = sweepRadians 0.5;\n let s = Math.sin(alphaRadians);\n let c = Math.cos(alphaRadians);\n let s1 = Math.sin(sweepRadians);\n if (Angle.isFullCircleRadians(sweepRadians)) {\n s = 0.0;\n c = -1.0;\n s1 = 0.0;\n }\n const q = 2 * s * s * s * c / (alphaRadians - s * c);\n const s3 = s * s * s;\n const s6 = s3 * s3;\n const area = 0.5 * (sweepRadians - s1);\n const inertiaXX = 0.25 * area * (1.0 - q / 3.0);\n const inertiaYY1 = 0.25 * area * (1.0 + q);\n const inertiaYY = inertiaYY1 - 4.0 * s6 / (9.0 * area);\n const productXX = inertiaYY;\n const productYY = inertiaXX;\n const centerToCentroid = 4.0 * s * s * s / (3.0 * (sweepRadians - s1));\n const midRadians = arc.sweep.fractionToRadians(0.5);\n const centralPlane = arc.radiansToRotatedBasis(midRadians);\n const centroid = centralPlane.origin.plusScaled(centralPlane.vectorU, centerToCentroid);\n momentData.accumulateXYProductsInCentroidalFrame(\n productXX, 0.0, productYY, area, centroid, centralPlane.vectorU, centralPlane.vectorV,\n );\n const pointB = arc.fractionToPoint(0.0);\n const pointC = arc.fractionToPoint(1.0);\n momentData.accumulateTriangleMomentsXY(undefined, pointB, pointC);\n }\n /** Accumulate integrals over the (triangular) areas from the origin to each line segment. /\n public override handleLineString3d(ls: LineString3d): void {\n const momentData = this._activeMomentData!;\n momentData.accumulateTriangleToLineStringMomentsXY(undefined, ls.packedPoints);\n }\n /* Accumulate integrals over the (triangular) area from the origin to this line segment. /\n public override handleLineSegment3d(segment: LineSegment3d): void {\n const momentData = this._activeMomentData!;\n segment.startPoint(this._point0);\n segment.endPoint(this._point1);\n momentData.accumulateTriangleMomentsXY(undefined, this._point0, this._point1);\n }\n /* Accumulate integrals from origin to all primitives in the chain. /\n public override handleLoop(loop: Loop): MomentData \| undefined {\n const momentData = this._activeMomentData = MomentData.create();\n momentData.needOrigin = false;\n for (const child of loop.children)\n child.dispatchToGeometryHandler(this);\n this._activeMomentData = undefined;\n return momentData;\n }\n private handleAnyRegion(region: AnyRegion): MomentData \| undefined {\n // guarantee there is no overlapping children\n const merged = RegionOps.regionBooleanXY(region, undefined, RegionBinaryOpType.Union);\n if (!merged)\n return undefined;\n if (merged instanceof Loop)\n return this.handleLoop(merged);\n const summedMoments = MomentData.create();\n for (const child of merged.children) {\n const childMoments = child.dispatchToGeometryHandler(this);\n if (childMoments) {\n const sign0 = childMoments.signFactor(1.0);\n summedMoments.accumulateProducts(childMoments, sign0);\n }\n }\n return summedMoments;\n }\n /* Accumulate integrals from origin to the components of the parity region. /\n public override handleParityRegion(region: ParityRegion): MomentData \| undefined {\n return this.handleAnyRegion(region);\n }\n /* Accumulate integrals from origin to the components of the union region. /\n public override handleUnionRegion(region: UnionRegion): MomentData \| undefined {\n return this.handleAnyRegion(region);\n }\n\n private _strokeOptions?: StrokeOptions; // TODO: expose to callers in RegionOps\n private getStrokeOptions(): StrokeOptions {\n if (this._strokeOptions)\n return this._strokeOptions;\n const options = StrokeOptions.createForCurves();\n // this is unusually fine for stroking, but appropriate for sum.\n options.angleTol = Angle.createDegrees(5.0);\n this._strokeOptions = options;\n return options;\n }\n /\n Handle a single curve primitive (not loop).\n * * Stroke the curve and accumulate stroke array.\n /\n public handleCurvePrimitive(cp: CurvePrimitive): void {\n const strokes = LineString3d.create();\n const options = this.getStrokeOptions();\n cp.emitStrokes(strokes, options);\n this.handleLineString3d(strokes);\n }\n /* Handle strongly typed BSplineCurve3d as generic curve primitive. /\n public override handleBSplineCurve3d(g: BSplineCurve3d): void {\n this.handleCurvePrimitive(g);\n }\n /* Handle strongly typed BSplineCurve3dH as generic curve primitive. /\n public override handleBSplineCurve3dH(g: BSplineCurve3dH): void {\n this.handleCurvePrimitive(g);\n }\n /* Handle strongly typed TransitionSpiral as generic curve primitive. */\n public override handleTransitionSpiral(g: TransitionSpiral3d): void {\n this.handleCurvePrimitive(g);\n }\n}\n"]}
1	+ {"version":3,"file":"RegionMomentsXY.js","sourceRoot":"","sources":["../../../src/curve/RegionMomentsXY.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAU/F,+CAA4C;AAC5C,mEAAoE;AACpE,mEAAwD;AACxD,yDAAsD;AAKtD,iDAA8C;AAC9C,iCAA8B;AAC9B,iDAA8C;AAC9C,2CAA4D;AAE5D,mDAAgD;AAGhD;;;GAGG;AACH,MAAa,eAAgB,SAAQ,qCAAmB;IAC9C,iBAAiB,CAAc;IAC/B,OAAO,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IAC3B,OAAO,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IACnC;;;;OAIG;IACa,WAAW,CAAC,GAAU;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC;QAC5C,MAAM,YAAY,GAAG,YAAY,GAAG,GAAG,CAAC;QACxC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC/B,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAChC,IAAI,aAAK,CAAC,mBAAmB,CAAC,YAAY,CAAC,EAAE,CAAC;YAC5C,CAAC,GAAG,GAAG,CAAC;YACR,CAAC,GAAG,CAAC,GAAG,CAAC;YACT,EAAE,GAAG,GAAG,CAAC;QACX,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,UAAU,GAAG,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,gBAAgB,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACpD,MAAM,YAAY,GAAG,GAAG,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QACxF,UAAU,CAAC,qCAAqC,CAC9C,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,CACtF,CAAC;QACF,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACxC,UAAU,CAAC,2BAA2B,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD,6FAA6F;IAC7E,kBAAkB,CAAC,EAAgB;QACjD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,UAAU,CAAC,uCAAuC,CAAC,SAAS,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC;IACjF,CAAC;IACD,4FAA4F;IAC5E,mBAAmB,CAAC,OAAsB;QACxD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,UAAU,CAAC,2BAA2B,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAChF,CAAC;IACD,sEAAsE;IACtD,UAAU,CAAC,IAAU;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,GAAG,uBAAU,CAAC,MAAM,EAAE,CAAC;QAChE,UAAU,CAAC,UAAU,GAAG,KAAK,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,UAAU,CAAC;IACpB,CAAC;IACO,eAAe,CAAC,MAAiB;QACvC,2FAA2F;QAC3F,MAAM,MAAM,GAAG,qBAAS,CAAC,eAAe,CAAC,MAAM,EAAE,SAAS,EAAE,8BAAkB,CAAC,KAAK,CAAC,CAAC;QACtF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,WAAI;YACxB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,aAAa,GAAG,uBAAU,CAAC,MAAM,EAAE,CAAC;QAC1C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAA2B,CAAC;YACrF,IAAI,YAAY,EAAE,CAAC;gBACjB,0DAA0D;gBAC1D,MAAM,KAAK,GAAG,CAAC,MAAM,YAAY,2BAAY,IAAI,YAAY,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC5F,MAAM,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;gBAC7C,aAAa,CAAC,kBAAkB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,+EAA+E;IAC/D,kBAAkB,CAAC,MAAoB;QACrD,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,8EAA8E;IAC9D,iBAAiB,CAAC,MAAmB;QACnD,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAEO,cAAc,CAAiB,CAAC,uCAAuC;IACvE,gBAAgB;QACtB,IAAI,IAAI,CAAC,cAAc;YACrB,OAAO,IAAI,CAAC,cAAc,CAAC;QAC7B,MAAM,OAAO,GAAG,6BAAa,CAAC,eAAe,EAAE,CAAC;QAChD,gEAAgE;QAChE,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC;QAC9B,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;OAGG;IACI,oBAAoB,CAAC,EAAkB;QAC5C,MAAM,OAAO,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxC,EAAE,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IACD,yEAAyE;IACzD,oBAAoB,CAAC,CAAiB;QACpD,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,0EAA0E;IAC1D,qBAAqB,CAAC,CAAkB;QACtD,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,0EAA0E;IAC1D,sBAAsB,CAAC,CAAqB;QAC1D,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;CACF;AA1HD,0CA0HC","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 Curve\n /\n\n// import { Geometry, Angle, AngleSweep } from \"../Geometry\";\n\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\nimport { BSplineCurve3dH } from \"../bspline/BSplineCurve3dH\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { NullGeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\nimport { MomentData } from \"../geometry4d/MomentData\";\nimport { Arc3d } from \"./Arc3d\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyRegion } from \"./CurveTypes\";\nimport { LineSegment3d } from \"./LineSegment3d\";\nimport { LineString3d } from \"./LineString3d\";\nimport { Loop } from \"./Loop\";\nimport { ParityRegion } from \"./ParityRegion\";\nimport { RegionBinaryOpType, RegionOps } from \"./RegionOps\";\nimport { TransitionSpiral3d } from \"./spiral/TransitionSpiral3d\";\nimport { StrokeOptions } from \"./StrokeOptions\";\nimport { UnionRegion } from \"./UnionRegion\";\n\n/\n Implementation class for computing XY area moments.\n * @internal\n /\nexport class RegionMomentsXY extends NullGeometryHandler {\n private _activeMomentData?: MomentData;\n private _point0 = Point3d.create();\n private _point1 = Point3d.create();\n /\n Accumulate (independent) integrations over:\n * * The area between the arc and the chord connecting its endpoints.\n * * The triangle with vertices: origin, arc start, arc end.\n /\n public override handleArc3d(arc: Arc3d): void {\n const momentData = this._activeMomentData!;\n const sweepRadians = arc.sweep.sweepRadians;\n const alphaRadians = sweepRadians 0.5;\n let s = Math.sin(alphaRadians);\n let c = Math.cos(alphaRadians);\n let s1 = Math.sin(sweepRadians);\n if (Angle.isFullCircleRadians(sweepRadians)) {\n s = 0.0;\n c = -1.0;\n s1 = 0.0;\n }\n const q = 2 * s * s * s * c / (alphaRadians - s * c);\n const s3 = s * s * s;\n const s6 = s3 * s3;\n const area = 0.5 * (sweepRadians - s1);\n const inertiaXX = 0.25 * area * (1.0 - q / 3.0);\n const inertiaYY1 = 0.25 * area * (1.0 + q);\n const inertiaYY = inertiaYY1 - 4.0 * s6 / (9.0 * area);\n const productXX = inertiaYY;\n const productYY = inertiaXX;\n const centerToCentroid = 4.0 * s * s * s / (3.0 * (sweepRadians - s1));\n const midRadians = arc.sweep.fractionToRadians(0.5);\n const centralPlane = arc.radiansToRotatedBasis(midRadians);\n const centroid = centralPlane.origin.plusScaled(centralPlane.vectorU, centerToCentroid);\n momentData.accumulateXYProductsInCentroidalFrame(\n productXX, 0.0, productYY, area, centroid, centralPlane.vectorU, centralPlane.vectorV,\n );\n const pointB = arc.fractionToPoint(0.0);\n const pointC = arc.fractionToPoint(1.0);\n momentData.accumulateTriangleMomentsXY(undefined, pointB, pointC);\n }\n /** Accumulate integrals over the (triangular) areas from the origin to each line segment. /\n public override handleLineString3d(ls: LineString3d): void {\n const momentData = this._activeMomentData!;\n momentData.accumulateTriangleToLineStringMomentsXY(undefined, ls.packedPoints);\n }\n /* Accumulate integrals over the (triangular) area from the origin to this line segment. /\n public override handleLineSegment3d(segment: LineSegment3d): void {\n const momentData = this._activeMomentData!;\n segment.startPoint(this._point0);\n segment.endPoint(this._point1);\n momentData.accumulateTriangleMomentsXY(undefined, this._point0, this._point1);\n }\n /* Accumulate integrals from origin to all primitives in the loop. /\n public override handleLoop(loop: Loop): MomentData \| undefined {\n const momentData = this._activeMomentData = MomentData.create();\n momentData.needOrigin = false;\n for (const child of loop.children)\n child.dispatchToGeometryHandler(this);\n this._activeMomentData = undefined;\n return momentData;\n }\n private handleAnyRegion(region: AnyRegion): MomentData \| undefined {\n // guarantee there are no overlapping children and parity loops have been properly oriented\n const merged = RegionOps.regionBooleanXY(region, undefined, RegionBinaryOpType.Union);\n if (!merged)\n return undefined;\n if (merged instanceof Loop)\n return this.handleLoop(merged);\n const summedMoments = MomentData.create();\n for (const child of merged.children) {\n const childMoments = child.dispatchToGeometryHandler(this) as MomentData \| undefined;\n if (childMoments) {\n // parity region hole sums subtract; all other regions add\n const scale = (merged instanceof ParityRegion && childMoments.quantitySum < 0) ? -1.0 : 1.0;\n const sign0 = childMoments.signFactor(scale);\n summedMoments.accumulateProducts(childMoments, sign0);\n }\n }\n return summedMoments;\n }\n /* Accumulate integrals from origin to the components of the parity region. /\n public override handleParityRegion(region: ParityRegion): MomentData \| undefined {\n return this.handleAnyRegion(region);\n }\n /* Accumulate integrals from origin to the components of the union region. /\n public override handleUnionRegion(region: UnionRegion): MomentData \| undefined {\n return this.handleAnyRegion(region);\n }\n\n private _strokeOptions?: StrokeOptions; // TODO: expose to callers in RegionOps\n private getStrokeOptions(): StrokeOptions {\n if (this._strokeOptions)\n return this._strokeOptions;\n const options = StrokeOptions.createForCurves();\n // this is unusually fine for stroking, but appropriate for sum.\n options.angleTol = Angle.createDegrees(5.0);\n this._strokeOptions = options;\n return options;\n }\n /\n Handle a single curve primitive (not loop).\n * * Stroke the curve and accumulate stroke array.\n /\n public handleCurvePrimitive(cp: CurvePrimitive): void {\n const strokes = LineString3d.create();\n const options = this.getStrokeOptions();\n cp.emitStrokes(strokes, options);\n this.handleLineString3d(strokes);\n }\n /* Handle strongly typed BSplineCurve3d as generic curve primitive. /\n public override handleBSplineCurve3d(g: BSplineCurve3d): void {\n this.handleCurvePrimitive(g);\n }\n /* Handle strongly typed BSplineCurve3dH as generic curve primitive. /\n public override handleBSplineCurve3dH(g: BSplineCurve3dH): void {\n this.handleCurvePrimitive(g);\n }\n /* Handle strongly typed TransitionSpiral as generic curve primitive. */\n public override handleTransitionSpiral(g: TransitionSpiral3d): void {\n this.handleCurvePrimitive(g);\n }\n}\n"]}

package/lib/cjs/curve/RegionOps.d.ts CHANGED Viewed

@@ -169,8 +169,7 @@ export declare class RegionOps {
      * @param loopsB second set of loops (treated as a union)
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
      * @param mergeTolerance absolute distance tolerance for merging loops
-     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added
-     * to connect interior loops to exterior loops.
+     * @returns a region resulting from merging input loops and the boolean operation.
      */
     static regionBooleanXY(loopsA: AnyRegion | AnyRegion[] | undefined, loopsB: AnyRegion | AnyRegion[] | undefined, operation: RegionBinaryOpType, mergeTolerance?: number): AnyRegion | undefined;
     /**
@@ -337,19 +336,27 @@ export declare class RegionOps {
      * @see [[PolygonOps.sortOuterAndHoleLoopsXY]]
      */
     static sortOuterAndHoleLoopsXY(loops: Array<Loop | IndexedXYZCollection>): AnyRegion;
+    /**
+     * Collect inputs that are nominally closed: regions, and physically closed curves.
+     * * Physically closed input curves are each returned wrapped in a Loop to facilitate xy-algorithms,
+     * but outside this limited context, these Loops only makes sense if they are planar.
+    */
+    private static collectRegionsAndClosedPrimitives;
     /**
      * Find all xy-areas bounded by the unstructured, possibly intersecting curves.
      * * For best results, input curves should be parallel to the xy-plane, as z-coordinates are ignored.
-     * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the
-     * input curves. Note that "holes" implied by inputs are _not_ preserved in output.
-     * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop,
-     * regardless of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]]
-     * to add bridge edges so that [[constructAllXYRegionLoops]] will return outer and inner loops in the same
-     * SignedLoops object.
-     * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve
-     * primitives, stripped of parity context. This means holes are _not_ preserved in output.
+     * * "Holes" implied/bounded by inputs are _not_ preserved/discovered in output; in particular [[ParityRegion]]
+     * hole loops are treated like any other positive area loops.
+     * * A common use case of this method is to assemble the bounding negative-area "exterior" loop for each connected
+     * component of input curves. Passing `addBridges = true` decreases the number of connected components for nested
+     * input [[Loop]]s, and thus increases the likelihood of returning exactly one exterior loop. (This is why the
+     * default value for `addBridges` is `true`.)
+     * @param curvesAndRegions Any collection of curves. Each [[AnyRegion]] contributes its children _stripped of
+     * parity context_.
      * @param tolerance optional distance tolerance for coincidence.
-     * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:
+     * @param addBridges whether to add line segments to connect nested input [[Loop]]s (default is `true`). When `false`,
+     * no line segments are added to the input curves, but the number of output components may be greater than expected.
+     * @returns array of [[SignedLoops]], each entry of which describes the areas bounded by a single connected component:
      *    * `positiveAreaLoops` contains "interior" loops, _including holes in ParityRegion input_. These loops have
      * positive area and counterclockwise orientation.
      *    * `negativeAreaLoops` contains (probably just one) "exterior" loop which is ordered clockwise.
@@ -357,7 +364,7 @@ export declare class RegionOps {
      *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent
      * to the edge and a constituent curve in each.
      */
-    static constructAllXYRegionLoops(curvesAndRegions: AnyCurve | AnyCurve[], tolerance?: number): SignedLoops[];
+    static constructAllXYRegionLoops(curvesAndRegions: AnyCurve | AnyCurve[], tolerance?: number, addBridges?: boolean): SignedLoops[];
     /**
      * Collect all `CurvePrimitives` in loosely typed input.
      * * Always recurses into primitives within explicit collections (Path, Loop, ParityRegion, UnionRegion).
@@ -426,9 +433,11 @@ export declare class ConsolidateAdjacentCurvePrimitivesOptions {
     consolidateLinearGeometry: boolean;
     /** True to consolidate contiguous compatible arcs into a single Arc3d. */
     consolidateCompatibleArcs: boolean;
+    /** True to consolidate the first and last primitives of a [[Loop]], allowing the start/end point to change. */
+    consolidateLoopSeam: boolean;
     /** Disable LineSegment3d and LineString3d point compression. */
-    disableLinearCompression?: boolean;
-    /** Tolerance for collapsing identical points (if `!disableLinearCompression`). */
+    disableLinearCompression: boolean;
+    /** Tolerance for detecting identical points. */
     duplicatePointTolerance: number;
     /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
     colinearPointTolerance: number;

package/lib/cjs/curve/RegionOps.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAC0B,oBAAoB,EAAyB,0BAA0B,EACvG,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAI1E,OAAO,EAAe,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAG7E,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;~~AAO7D~~,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAE9D,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAO9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;AAEvH;;;GAGG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,SAAS;IACpB;;;;;;;;OAQG;WACW,oBAAoB,CAAC,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS7E;;;;MAIE;WACY,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAKtH;;;;;;OAMG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQlE;;;;;;;;OAQG;WACW,wBAAwB,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAO/E;;;;;;;OAOG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;IA6BtF;;;OAGG;WACW,eAAe,CAC3B,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,0BAA0B,EAChC,oBAAoB,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,GACnE,IAAI;IAqCP;;;;OAIG;WACW,0BAA0B,CACtC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,GACvF,QAAQ,EAAE,GAAG,SAAS;IAYzB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAUpC;;;;;;;;OAQG;WACW,qCAAqC,CACjD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,iCAAiC,CAC7C,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,sCAAsC,CAClD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS;IAU9D;;;;;;;;OAQG;WACW,cAAc,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAqBtE~~;;;;;;;;;;;OAWG~~;WACW,eAAe,CAC3B,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,SAAS,EAAE,kBAAkB,EAC7B,cAAc,GAAE,MAAqC,GACpD,SAAS,GAAG,SAAS;IA2BxB;;;;;;;;;;;OAWG;WACW,0BAA0B,CACtC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,EACpC,WAAW,GAAE,OAAe,GAC3B,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,uBAAuB,CACnC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,GACnC,SAAS,GAAG,SAAS;IAwBxB;;;;;;;;;;;OAWG;WACW,4BAA4B,CACxC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAC/E,UAAU,GAAG,SAAS;IAIzB;;;;;;;OAOG;WACW,sBAAsB,CAClC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,GAClF,eAAe,GAAG,SAAS;IAI9B;;;;;;OAMG;WACW,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAGvF;;;;;;;;;OASG;WACW,2BAA2B,CACvC,MAAM,EAAE,cAAc,EAAE,EAAE,IAAI,GAAE,OAAc,EAAE,6BAA6B,GAAE,OAAe,GAC7F,eAAe,GAAG,SAAS;IAuB9B,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAA0B;IAClE;;;OAGG;WACW,qBAAqB,CAAC,CAAC,CAAC,EAAE,uBAAuB;IAG/D;;;;;;;;OAQG;WACW,uBAAuB,CACnC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAC/D,QAAQ,GAAG,SAAS;IAGvB;;;;;OAKG;WACW,yBAAyB,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,UAAU,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS;IAahH;;;;;;;;OAQG;WACW,8BAA8B,CAC1C,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAClE;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAE;IAG/E;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,QAAQ,GAAG,SAAS;IAG7H;;;;;OAKG;WACW,2BAA2B,CACvC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GACnD;QAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,QAAQ,EAAE,CAAC;QAAC,eAAe,EAAE,QAAQ,EAAE,CAAA;KAAE;IAqBrF;;;;;;;;;;;;;;OAcG;WACW,sBAAsB,CAClC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,oBAAoB,EAAE,mBAAmB,GAAE,OAAc,GACrF,SAAS,GAAG,SAAS;IA+CxB;;;;;;;;;;;OAWG;WACW,6BAA6B,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,yCAAyC,GAAG,IAAI;IAI/H;;;;;;;;;;;;OAYG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAY3F~~;;;;;;;;;;;;;;;;;;;OAmBG~~;WACW,yBAAyB,CACrC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,~~EAAE~~,SAAS,GAAE,MAAqC,~~GACxF~~,WAAW,EAAE;~~IAShB~~;;;;;;;;;;OAUG;WACW,sBAAsB,CAClC,UAAU,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACjC,cAAc,CAAC,EAAE,cAAc,EAAE,EACjC,0BAA0B,GAAE,OAAe,EAC3C,kBAAkB,GAAE,OAAe,GAClC,cAAc,EAAE;IAanB;;;;;OAKG;WACW,iBAAiB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAe/E;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;IAkB3E;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAqChD,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAepC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAIzC;;;;;;;;;OASG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe,GAAG,SAAS;IAyBpG;;;;;MAKE;WACY,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,QAAQ,GAAE,OAAc,GAAG,gBAAgB,EAAE,GAAG,SAAS;CActI;AAaD;;;GAGG;AACH,qBAAa,yCAAyC;IACpD,+EAA+E;IACxE,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0EAA0E;IACnE,yBAAyB,EAAE,OAAO,CAAQ;IACjD,gEAAgE;IACzD,wBAAwB,~~CAAC,~~EAAE,OAAO,CAAS;~~IAClD~~,~~kFAAkF~~;~~IAC3E~~,uBAAuB,EAAE,MAAM,CAAgC;IACtE,wFAAwF;IACjF,sBAAsB,EAAE,MAAM,CAAgC;CACtE"}
1	+ {"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAC0B,oBAAoB,EAAyB,0BAA0B,EACvG,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAI1E,OAAO,EAAe,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAG7E,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAQ7D,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAE9D,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAO9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;AAEvH;;;GAGG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,SAAS;IACpB;;;;;;;;OAQG;WACW,oBAAoB,CAAC,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS7E;;;;MAIE;WACY,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAKtH;;;;;;OAMG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQlE;;;;;;;;OAQG;WACW,wBAAwB,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAO/E;;;;;;;OAOG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;IA6BtF;;;OAGG;WACW,eAAe,CAC3B,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,0BAA0B,EAChC,oBAAoB,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,GACnE,IAAI;IAqCP;;;;OAIG;WACW,0BAA0B,CACtC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,GACvF,QAAQ,EAAE,GAAG,SAAS;IAYzB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAUpC;;;;;;;;OAQG;WACW,qCAAqC,CACjD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,iCAAiC,CAC7C,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,sCAAsC,CAClD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS;IAU9D;;;;;;;;OAQG;WACW,cAAc,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAqBtE;;;;;;;;;;OAUG;WACW,eAAe,CAC3B,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,SAAS,EAAE,kBAAkB,EAC7B,cAAc,GAAE,MAAqC,GACpD,SAAS,GAAG,SAAS;IA2BxB;;;;;;;;;;;OAWG;WACW,0BAA0B,CACtC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,EACpC,WAAW,GAAE,OAAe,GAC3B,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,uBAAuB,CACnC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,GACnC,SAAS,GAAG,SAAS;IAwBxB;;;;;;;;;;;OAWG;WACW,4BAA4B,CACxC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAC/E,UAAU,GAAG,SAAS;IAIzB;;;;;;;OAOG;WACW,sBAAsB,CAClC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,GAClF,eAAe,GAAG,SAAS;IAI9B;;;;;;OAMG;WACW,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAGvF;;;;;;;;;OASG;WACW,2BAA2B,CACvC,MAAM,EAAE,cAAc,EAAE,EAAE,IAAI,GAAE,OAAc,EAAE,6BAA6B,GAAE,OAAe,GAC7F,eAAe,GAAG,SAAS;IAuB9B,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAA0B;IAClE;;;OAGG;WACW,qBAAqB,CAAC,CAAC,CAAC,EAAE,uBAAuB;IAG/D;;;;;;;;OAQG;WACW,uBAAuB,CACnC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAC/D,QAAQ,GAAG,SAAS;IAGvB;;;;;OAKG;WACW,yBAAyB,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,UAAU,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS;IAahH;;;;;;;;OAQG;WACW,8BAA8B,CAC1C,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAClE;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAE;IAG/E;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,QAAQ,GAAG,SAAS;IAG7H;;;;;OAKG;WACW,2BAA2B,CACvC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GACnD;QAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,QAAQ,EAAE,CAAC;QAAC,eAAe,EAAE,QAAQ,EAAE,CAAA;KAAE;IAqBrF;;;;;;;;;;;;;;OAcG;WACW,sBAAsB,CAClC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,oBAAoB,EAAE,mBAAmB,GAAE,OAAc,GACrF,SAAS,GAAG,SAAS;IA+CxB;;;;;;;;;;;OAWG;WACW,6BAA6B,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,yCAAyC,GAAG,IAAI;IAI/H;;;;;;;;;;;;OAYG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAY3F;;;;MAIE;IACF,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAiBhD;;;;;;;;;;;;;;;;;;;;;OAqBG;WACW,yBAAyB,CACrC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACvC,SAAS,GAAE,MAAqC,EAChD,UAAU,GAAE,OAAc,GACzB,WAAW,EAAE;IAoBhB;;;;;;;;;;OAUG;WACW,sBAAsB,CAClC,UAAU,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACjC,cAAc,CAAC,EAAE,cAAc,EAAE,EACjC,0BAA0B,GAAE,OAAe,EAC3C,kBAAkB,GAAE,OAAe,GAClC,cAAc,EAAE;IAanB;;;;;OAKG;WACW,iBAAiB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAe/E;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;IAkB3E;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAqChD,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAepC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAIzC;;;;;;;;;OASG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe,GAAG,SAAS;IAyBpG;;;;;MAKE;WACY,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,QAAQ,GAAE,OAAc,GAAG,gBAAgB,EAAE,GAAG,SAAS;CActI;AAaD;;;GAGG;AACH,qBAAa,yCAAyC;IACpD,+EAA+E;IACxE,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0EAA0E;IACnE,yBAAyB,EAAE,OAAO,CAAQ;IACjD,+GAA+G;IACxG,mBAAmB,EAAE,OAAO,CAAS;IAC5C,gEAAgE;IACzD,wBAAwB,EAAE,OAAO,CAAS;IACjD,gDAAgD;IACzC,uBAAuB,EAAE,MAAM,CAAgC;IACtE,wFAAwF;IACjF,sBAAsB,EAAE,MAAM,CAAgC;CACtE"}

package/lib/cjs/curve/RegionOps.js CHANGED Viewed

@@ -36,6 +36,7 @@ const GeometryQuery_1 = require("./GeometryQuery");
 const ChainCollectorContext_1 = require("./internalContexts/ChainCollectorContext");
 const PolygonOffsetContext_1 = require("./internalContexts/PolygonOffsetContext");
 const TransferWithSplitArcs_1 = require("./internalContexts/TransferWithSplitArcs");
+const LineSegment3d_1 = require("./LineSegment3d");
 const LineString3d_1 = require("./LineString3d");
 const Loop_1 = require("./Loop");
 const OffsetOptions_1 = require("./OffsetOptions");
@@ -347,16 +348,17 @@ class RegionOps {
      * @param loopsB second set of loops (treated as a union)
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
      * @param mergeTolerance absolute distance tolerance for merging loops
-     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added
-     * to connect interior loops to exterior loops.
+     * @returns a region resulting from merging input loops and the boolean operation.
      */
     static regionBooleanXY(loopsA, loopsB, operation, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
-        let result;
+        const result = UnionRegion_1.UnionRegion.create();
         const context = RegionOpsClassificationSweeps_1.RegionBooleanContext.create(RegionOpsClassificationSweeps_1.RegionGroupOpType.Union, RegionOpsClassificationSweeps_1.RegionGroupOpType.Union);
         context.addMembers(loopsA, loopsB);
         context.annotateAndMergeCurvesInGraph(mergeTolerance);
+        const visitMask = context.graph.grabMask(false);
         const range = context.groupA.range().union(context.groupB.range());
         const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);
+        const bridgeMask = Graph_1.HalfEdgeMask.BRIDGE_EDGE;
         context.runClassificationSweep(operation, (_graph, face, faceType, area) => {
             // ignore danglers and null faces, but not 2-edge "banana" faces with nonzero area
             if (face.countEdgesAroundFace() < 2)
@@ -364,15 +366,13 @@ class RegionOps {
             if (Math.abs(area) < areaTol)
                 return;
             if (faceType === 1) {
-                const loop = PlanarSubdivision_1.PlanarSubdivision.createLoopInFace(face);
-                if (loop) {
-                    if (!result)
-                        result = UnionRegion_1.UnionRegion.create();
-                    result.tryAddChild(loop);
-                }
+                const loopOrParityRegion = PlanarSubdivision_1.PlanarSubdivision.createLoopOrParityRegionInFace(face, bridgeMask, visitMask);
+                if (loopOrParityRegion)
+                    result.tryAddChild(loopOrParityRegion);
             }
         });
-        return result ? this.simplifyRegion(result) : undefined;
+        context.graph.dropMask(visitMask);
+        return this.simplifyRegion(result);
     }
     /**
      * Return a polyface whose facets are a boolean operation between the input regions.
@@ -687,19 +687,45 @@ class RegionOps {
         }
         return SortablePolygon_1.SortablePolygon.sortAsAnyRegion(loopAndArea);
     }
+    /**
+     * Collect inputs that are nominally closed: regions, and physically closed curves.
+     * * Physically closed input curves are each returned wrapped in a Loop to facilitate xy-algorithms,
+     * but outside this limited context, these Loops only makes sense if they are planar.
+    */
+    static collectRegionsAndClosedPrimitives(curves, tolerance = Geometry_1.Geometry.smallMetricDistance) {
+        const regions = [];
+        if (!Array.isArray(curves))
+            curves = [curves];
+        for (const curve of curves) {
+            if (curve instanceof Loop_1.Loop || curve instanceof ParityRegion_1.ParityRegion || curve instanceof UnionRegion_1.UnionRegion) {
+                regions.push(curve);
+            }
+            else if (curve instanceof Path_1.Path) {
+                if (curve.isPhysicallyClosedCurve(tolerance))
+                    regions.push(Loop_1.Loop.create(...curve.children));
+            }
+            else if (curve instanceof CurvePrimitive_1.CurvePrimitive) {
+                if (curve.isPhysicallyClosedCurve(tolerance))
+                    regions.push(Loop_1.Loop.create(curve));
+            }
+        }
+        return regions;
+    }
     /**
      * Find all xy-areas bounded by the unstructured, possibly intersecting curves.
      * * For best results, input curves should be parallel to the xy-plane, as z-coordinates are ignored.
-     * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the
-     * input curves. Note that "holes" implied by inputs are _not_ preserved in output.
-     * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop,
-     * regardless of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]]
-     * to add bridge edges so that [[constructAllXYRegionLoops]] will return outer and inner loops in the same
-     * SignedLoops object.
-     * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve
-     * primitives, stripped of parity context. This means holes are _not_ preserved in output.
+     * * "Holes" implied/bounded by inputs are _not_ preserved/discovered in output; in particular [[ParityRegion]]
+     * hole loops are treated like any other positive area loops.
+     * * A common use case of this method is to assemble the bounding negative-area "exterior" loop for each connected
+     * component of input curves. Passing `addBridges = true` decreases the number of connected components for nested
+     * input [[Loop]]s, and thus increases the likelihood of returning exactly one exterior loop. (This is why the
+     * default value for `addBridges` is `true`.)
+     * @param curvesAndRegions Any collection of curves. Each [[AnyRegion]] contributes its children _stripped of
+     * parity context_.
      * @param tolerance optional distance tolerance for coincidence.
-     * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:
+     * @param addBridges whether to add line segments to connect nested input [[Loop]]s (default is `true`). When `false`,
+     * no line segments are added to the input curves, but the number of output components may be greater than expected.
+     * @returns array of [[SignedLoops]], each entry of which describes the areas bounded by a single connected component:
      *    * `positiveAreaLoops` contains "interior" loops, _including holes in ParityRegion input_. These loops have
      * positive area and counterclockwise orientation.
      *    * `negativeAreaLoops` contains (probably just one) "exterior" loop which is ordered clockwise.
@@ -707,11 +733,22 @@ class RegionOps {
      *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent
      * to the edge and a constituent curve in each.
      */
-    static constructAllXYRegionLoops(curvesAndRegions, tolerance = Geometry_1.Geometry.smallMetricDistance) {
+    static constructAllXYRegionLoops(curvesAndRegions, tolerance = Geometry_1.Geometry.smallMetricDistance, addBridges = true) {
         let primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);
         primitives = TransferWithSplitArcs_1.TransferWithSplitArcs.clone(CurveCollection_1.BagOfCurves.create(...primitives)).children;
         const range = this.curveArrayRange(primitives);
         const areaTol = this.computeXYAreaTolerance(range, tolerance);
+        if (addBridges) { // generate a temp graph to extract its bridge edges
+            const context = RegionOpsClassificationSweeps_1.RegionBooleanContext.create(RegionOpsClassificationSweeps_1.RegionGroupOpType.Union, RegionOpsClassificationSweeps_1.RegionGroupOpType.Union);
+            const regions = this.collectRegionsAndClosedPrimitives(curvesAndRegions, tolerance);
+            context.addMembers(regions, undefined);
+            context.annotateAndMergeCurvesInGraph(tolerance);
+            context.graph.announceEdges((_graph, edge) => {
+                if (edge.isMaskSet(Graph_1.HalfEdgeMask.BRIDGE_EDGE))
+                    primitives.push(LineSegment3d_1.LineSegment3d.create(edge.getPoint3d(), edge.faceSuccessor.getPoint3d()));
+                return true;
+            });
+        }
         const intersections = CurveCurve_1.CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);
         const graph = PlanarSubdivision_1.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);
         return PlanarSubdivision_1.PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);
@@ -937,9 +974,11 @@ class ConsolidateAdjacentCurvePrimitivesOptions {
     consolidateLinearGeometry = true;
     /** True to consolidate contiguous compatible arcs into a single Arc3d. */
     consolidateCompatibleArcs = true;
+    /** True to consolidate the first and last primitives of a [[Loop]], allowing the start/end point to change. */
+    consolidateLoopSeam = false;
     /** Disable LineSegment3d and LineString3d point compression. */
     disableLinearCompression = false;
-    /** Tolerance for collapsing identical points (if `!disableLinearCompression`). */
+    /** Tolerance for detecting identical points. */
     duplicatePointTolerance = Geometry_1.Geometry.smallMetricDistance;
     /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
     colinearPointTolerance = Geometry_1.Geometry.smallMetricDistance;