@itwin/core-geometry 3.4.0-dev.48 → 3.4.0-dev.55

package/lib/cjs/solid/Box.d.ts

@@ -46,7 +46,7 @@ export declare class Box extends SolidPrimitive {
     cloneTransformed(transform: Transform): Box | undefined;
     /**
      * Create a new box from vector and size daa.
-     * @param baseOrigin Origin of base rectangle
+     * @param origin Origin of base rectangle
      * @param vectorX  Direction for base rectangle
      * @param vectorY Direction for base rectangle
      * @param topOrigin origin of top rectangle
@@ -56,10 +56,10 @@ export declare class Box extends SolidPrimitive {
      * @param topY size factor for top rectangle (multiplies vectorY)
      * @param capped true to define top and bottom closure caps
      */
-    static createDgnBox(baseOrigin: Point3d, vectorX: Vector3d, vectorY: Vector3d, topOrigin: Point3d, baseX: number, baseY: number, topX: number, topY: number, capped: boolean): Box | undefined;
+    static createDgnBox(origin: Point3d, vectorX: Vector3d, vectorY: Vector3d, topOrigin: Point3d, baseX: number, baseY: number, topX: number, topY: number, capped: boolean): Box | undefined;
     /**
      * Create a new box with xy directions taken from columns of the `axes` matrix.
-     * @param baseOrigin Origin of base rectangle
+     * @param origin Origin of base rectangle
      * @param axes  Direction for base rectangle
      * @param topOrigin origin of top rectangle
      * @param baseX size factor for base rectangle (multiplies vectorX)
@@ -68,7 +68,7 @@ export declare class Box extends SolidPrimitive {
      * @param topY size factor for top rectangle (multiplies vectorY)
      * @param capped true to define top and bottom closure caps
      */
-    static createDgnBoxWithAxes(baseOrigin: Point3d, axes: Matrix3d, topOrigin: Point3d, baseX: number, baseY: number, topX: number, topY: number, capped: boolean): Box | undefined;
+    static createDgnBoxWithAxes(origin: Point3d, axes: Matrix3d, topOrigin: Point3d, baseX: number, baseY: number, topX: number, topY: number, capped: boolean): Box | undefined;
     /**
      * Create an axis-aligned `Box` primitive for a range.
      * @param range range corners Origin of base rectangle

package/lib/cjs/solid/Box.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Box.d.ts","sourceRoot":"","sources":["../../../src/solid/Box.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAGrD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD;;;;;;;;;GASG;AACH,qBAAa,GAAI,SAAQ,cAAc;IACrC,wCAAwC;IACxC,SAAgB,kBAAkB,SAAS;IAE3C,OAAO,CAAC,aAAa,CAAY;IACjC,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,KAAK,CAAS;IAEtB,SAAS,aAAa,GAAG,EAAE,SAAS,EAClC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IAQ3E,qBAAqB;IACd,KAAK,IAAI,GAAG;IAInB;;;;;OAKG;IACI,oBAAoB,IAAI,SAAS,GAAG,SAAS;IAGpD;;OAEG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAMzD,uFAAuF;IAChF,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,GAAG,GAAG,SAAS;IAM9D;;;;;;;;;;;OAWG;WACW,YAAY,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAClF,SAAS,EAAE,OAAO,EAClB,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EACxD,MAAM,EAAE,OAAO,GAAG,GAAG,GAAG,SAAS;IAMnC;;;;;;;;;;OAUG;WACW,oBAAoB,CAAC,UAAU,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EACpE,SAAS,EAAE,OAAO,EAClB,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EACxD,MAAM,EAAE,OAAO,GAAG,GAAG,GAAG,SAAS;IAKnC;;;;OAIG;WACW,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,GAAG,GAAG,SAAS;IAe3E,uDAAuD;IAChD,QAAQ,IAAI,MAAM;IACzB,uDAAuD;IAChD,QAAQ,IAAI,MAAM;IACzB,uDAAuD;IAChD,OAAO,IAAI,MAAM;IACxB,uDAAuD;IAChD,OAAO,IAAI,MAAM;IACxB,8EAA8E;IACvE,aAAa,IAAI,OAAO;IAC/B,8EAA8E;IACvE,YAAY,IAAI,OAAO;IAC9B,qEAAqE;IAC9D,UAAU,IAAI,QAAQ;IAC7B,qEAAqE;IAC9D,UAAU,IAAI,QAAQ;IAC7B,qEAAqE;IAC9D,UAAU,IAAI,QAAQ;IAC7B,6CAA6C;IACtC,mBAAmB,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAC/C,6BAA6B;IACb,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAW5D,sEAAsE;IAC/D,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;IAG/D,0EAA0E;IACnE,sBAAsB,CAAC,SAAS,EAAE,MAAM,GAAG,YAAY;IAkB9D;;OAEG;IACI,UAAU,IAAI,OAAO,EAAE;IAkB9B;;;;;OAKG;IACI,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,eAAe;IAI3D,uDAAuD;IAChD,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IA0BvE;;OAEG;IACH,IAAW,cAAc,IAAI,OAAO,CAEnC;CACF"}
+{"version":3,"file":"Box.d.ts","sourceRoot":"","sources":["../../../src/solid/Box.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAGrD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD;;;;;;;;;GASG;AACH,qBAAa,GAAI,SAAQ,cAAc;IACrC,wCAAwC;IACxC,SAAgB,kBAAkB,SAAS;IAE3C,OAAO,CAAC,aAAa,CAAY;IACjC,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,KAAK,CAAS;IAEtB,SAAS,aAAa,GAAG,EAAE,SAAS,EAClC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IAQ3E,qBAAqB;IACd,KAAK,IAAI,GAAG;IAInB;;;;;OAKG;IACI,oBAAoB,IAAI,SAAS,GAAG,SAAS;IAGpD;;OAEG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAMzD,uFAAuF;IAChF,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,GAAG,GAAG,SAAS;IAM9D;;;;;;;;;;;OAWG;WACW,YAAY,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAC9E,SAAS,EAAE,OAAO,EAClB,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EACxD,MAAM,EAAE,OAAO,GAAG,GAAG,GAAG,SAAS;IAMnC;;;;;;;;;;OAUG;WACW,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAChE,SAAS,EAAE,OAAO,EAClB,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EACxD,MAAM,EAAE,OAAO,GAAG,GAAG,GAAG,SAAS;IAKnC;;;;OAIG;WACW,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,GAAG,GAAG,SAAS;IAe3E,uDAAuD;IAChD,QAAQ,IAAI,MAAM;IACzB,uDAAuD;IAChD,QAAQ,IAAI,MAAM;IACzB,uDAAuD;IAChD,OAAO,IAAI,MAAM;IACxB,uDAAuD;IAChD,OAAO,IAAI,MAAM;IACxB,8EAA8E;IACvE,aAAa,IAAI,OAAO;IAC/B,8EAA8E;IACvE,YAAY,IAAI,OAAO;IAC9B,qEAAqE;IAC9D,UAAU,IAAI,QAAQ;IAC7B,qEAAqE;IAC9D,UAAU,IAAI,QAAQ;IAC7B,qEAAqE;IAC9D,UAAU,IAAI,QAAQ;IAC7B,6CAA6C;IACtC,mBAAmB,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAC/C,6BAA6B;IACb,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAW5D,sEAAsE;IAC/D,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;IAG/D,0EAA0E;IACnE,sBAAsB,CAAC,SAAS,EAAE,MAAM,GAAG,YAAY;IAkB9D;;OAEG;IACI,UAAU,IAAI,OAAO,EAAE;IAkB9B;;;;;OAKG;IACI,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,eAAe;IAI3D,uDAAuD;IAChD,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IA0BvE;;OAEG;IACH,IAAW,cAAc,IAAI,OAAO,CAEnC;CACF"}

package/lib/cjs/solid/Box.js

@@ -62,7 +62,7 @@ class Box extends SolidPrimitive_1.SolidPrimitive {
     }
     /**
      * Create a new box from vector and size daa.
-     * @param baseOrigin Origin of base rectangle
+     * @param origin Origin of base rectangle
      * @param vectorX  Direction for base rectangle
      * @param vectorY Direction for base rectangle
      * @param topOrigin origin of top rectangle
@@ -72,14 +72,14 @@ class Box extends SolidPrimitive_1.SolidPrimitive {
      * @param topY size factor for top rectangle (multiplies vectorY)
      * @param capped true to define top and bottom closure caps
      */
-    static createDgnBox(baseOrigin, vectorX, vectorY, topOrigin, baseX, baseY, topX, topY, capped) {
-        const vectorZ = baseOrigin.vectorTo(topOrigin);
-        const localToWorld = Transform_1.Transform.createOriginAndMatrixColumns(baseOrigin, vectorX, vectorY, vectorZ);
+    static createDgnBox(origin, vectorX, vectorY, topOrigin, baseX, baseY, topX, topY, capped) {
+        const vectorZ = origin.vectorTo(topOrigin);
+        const localToWorld = Transform_1.Transform.createOriginAndMatrixColumns(origin, vectorX, vectorY, vectorZ);
         return new Box(localToWorld, baseX, baseY, topX, topY, capped);
     }
     /**
      * Create a new box with xy directions taken from columns of the `axes` matrix.
-     * @param baseOrigin Origin of base rectangle
+     * @param origin Origin of base rectangle
      * @param axes  Direction for base rectangle
      * @param topOrigin origin of top rectangle
      * @param baseX size factor for base rectangle (multiplies vectorX)
@@ -88,8 +88,8 @@ class Box extends SolidPrimitive_1.SolidPrimitive {
      * @param topY size factor for top rectangle (multiplies vectorY)
      * @param capped true to define top and bottom closure caps
      */
-    static createDgnBoxWithAxes(baseOrigin, axes, topOrigin, baseX, baseY, topX, topY, capped) {
-        return Box.createDgnBox(baseOrigin, axes.columnX(), axes.columnY(), topOrigin, baseX, baseY, topX, topY, capped);
+    static createDgnBoxWithAxes(origin, axes, topOrigin, baseX, baseY, topX, topY, capped) {
+        return Box.createDgnBox(origin, axes.columnX(), axes.columnY(), topOrigin, baseX, baseY, topX, topY, capped);
     }
     /**
      * Create an axis-aligned `Box` primitive for a range.

package/lib/cjs/solid/Box.js.map

@@ -1 +1 @@
-{"version":3,"file":"Box.js","sourceRoot":"","sources":["../../../src/solid/Box.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,wDAAqD;AACrD,wCAAqC;AACrC,0CAAuC;AAGvC,mEAAkE;AAElE,uDAAoD;AACpD,qDAAkD;AAElD;;;;;;;;;GASG;AACH,MAAa,GAAI,SAAQ,+BAAc;IAUrC,YAAsB,GAAc,EAClC,KAAa,EAAE,KAAa,EAAE,IAAY,EAAE,IAAY,EAAE,MAAe;QACzE,KAAK,CAAC,MAAM,CAAC,CAAC;QAXhB,wCAAwC;QACxB,uBAAkB,GAAG,KAAK,CAAC;QAWzC,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IACD,qBAAqB;IACd,KAAK;QACV,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5G,CAAC;IAED;;;;;OAKG;IACI,oBAAoB;QACzB,OAAO,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;IACzC,CAAC;IACD;;OAEG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE;YAC/B,OAAO,KAAK,CAAC;QACf,SAAS,CAAC,0BAA0B,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,uFAAuF;IAChF,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,SAAS,CAAC,0BAA0B,CAAC,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;QACjF,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,YAAY,CAAC,UAAmB,EAAE,OAAiB,EAAE,OAAiB,EAClF,SAAkB,EAClB,KAAa,EAAE,KAAa,EAAE,IAAY,EAAE,IAAY,EACxD,MAAe;QACf,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC/C,MAAM,YAAY,GAAG,qBAAS,CAAC,4BAA4B,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACnG,OAAO,IAAI,GAAG,CAAC,YAAY,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IACjE,CAAC;IAED;;;;;;;;;;OAUG;IACI,MAAM,CAAC,oBAAoB,CAAC,UAAmB,EAAE,IAAc,EACpE,SAAkB,EAClB,KAAa,EAAE,KAAa,EAAE,IAAY,EAAE,IAAY,EACxD,MAAe;QACf,OAAO,GAAG,CAAC,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,OAAO,EAAE,EAAE,SAAS,EAC3E,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,WAAW,CAAC,KAAc,EAAE,MAAe;QACvD,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YACjB,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC;YAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;YACjC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YACtC,OAAO,GAAG,CAAC,YAAY,CACrB,QAAQ,EACR,0BAAQ,CAAC,KAAK,EAAE,EAAE,0BAAQ,CAAC,KAAK,EAAE,EAClC,MAAM,EACN,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;SACvC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,uDAAuD;IAChD,QAAQ,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACjD,uDAAuD;IAChD,QAAQ,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACjD,uDAAuD;IAChD,OAAO,KAAa,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/C,uDAAuD;IAChD,OAAO,KAAa,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/C,8EAA8E;IACvE,aAAa,KAAc,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnF,8EAA8E;IACvE,YAAY,KAAc,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClF,qEAAqE;IAC9D,UAAU,KAAe,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAC7E,qEAAqE;IAC9D,UAAU,KAAe,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAC7E,qEAAqE;IAC9D,UAAU,KAAe,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAC7E,6CAA6C;IACtC,mBAAmB,CAAC,KAAU,IAAa,OAAO,KAAK,YAAY,GAAG,CAAC,CAAC,CAAC;IAChF,6BAA6B;IACb,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,GAAG,EAAE;YACxB,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YAC/C,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC;gBAAE,OAAO,KAAK,CAAC;YACzE,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;mBACtD,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;mBACpD,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;mBAClD,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;SACzD;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,sEAAsE;IAC/D,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,0EAA0E;IACnE,sBAAsB,CAAC,SAAiB;QAC7C,MAAM,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,MAAM,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QACrC,MAAM,SAAS,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QACnC,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACpD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;OAEG;IACI,UAAU;QACf,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,OAAO;YACL,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/B,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAChC,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/B,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;SACjC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACI,gBAAgB,CAAC,SAAiB;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;QAClD,OAAO,WAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACzB,CAAC;IACD,uDAAuD;IAChD,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC;QACxC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,IAAI,SAAS,EAAE;YACb,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC/E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAChF,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC/E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SACjF;aAAM;YACL,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC5D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SAC7D;IACH,CAAC;IACD;;OAEG;IACH,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;CACF;AApOD,kBAoOC","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 Solid\n */\n\nimport { CurveCollection } from \"../curve/CurveCollection\";\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Loop } from \"../curve/Loop\";\nimport { Geometry } from \"../Geometry\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { SolidPrimitive } from \"./SolidPrimitive\";\n\n/**\n * A box-like solid defined by\n * * A local coordinate frame\n *   * (0,0,0) is left lower rear corner of box (considering \"left\" to reference x, \"lower\" to reference y, \"rear and front\" to reference z=0 and z=1)\n *   * (0,0,1) is left lower front corner.\n *   * (baseX,baseY,z) is right upper corner at z\n *   * note that the frame x and y columns are usually unit vectors in local space, but z is full rear to front vector\n * * The separate values for base and top x and y allow the box to be a \"view frustum\" with parallel back and front planes but independent x and y bellows effects.\n * @public\n */\nexport class Box extends SolidPrimitive {\n  /** String name for schema properties */\n  public readonly solidPrimitiveType = \"box\";\n\n  private _localToWorld: Transform;\n  private _baseX: number;\n  private _baseY: number;\n  private _topX: number;\n  private _topY: number;\n\n  protected constructor(map: Transform,\n    baseX: number, baseY: number, topX: number, topY: number, capped: boolean) {\n    super(capped);\n    this._localToWorld = map;\n    this._baseX = baseX;\n    this._baseY = baseY;\n    this._topX = topX;\n    this._topY = topY;\n  }\n  /** Return a clone */\n  public clone(): Box {\n    return new Box(this._localToWorld.clone(), this._baseX, this._baseY, this._topX, this._topY, this.capped);\n  }\n\n  /** Return a coordinate frame (right handed unit vectors)\n   * * origin lower left of box\n   * * x direction on base rectangle x edge\n   * * y direction in base rectangle\n   * * z direction perpendicular\n   */\n  public getConstructiveFrame(): Transform | undefined {\n    return this._localToWorld.cloneRigid();\n  }\n  /** Apply the transform to the box's `localToWorld` frame.\n   * * Note that this may make the frame nonrigid.\n   */\n  public tryTransformInPlace(transform: Transform): boolean {\n    if (transform.matrix.isSingular())\n      return false;\n    transform.multiplyTransformTransform(this._localToWorld, this._localToWorld);\n    return true;\n  }\n  /** Clone the box and immediately apply `transform` to the local frame of the clone. */\n  public cloneTransformed(transform: Transform): Box | undefined {\n    const result = this.clone();\n    transform.multiplyTransformTransform(result._localToWorld, result._localToWorld);\n    return result;\n  }\n\n  /**\n   * Create a new box from vector and size daa.\n   * @param baseOrigin Origin of base rectangle\n   * @param vectorX  Direction for base rectangle\n   * @param vectorY Direction for base rectangle\n   * @param topOrigin origin of top rectangle\n   * @param baseX size factor for base rectangle (multiplies vectorX)\n   * @param baseY size factor for base rectangle (multiplies vectorY)\n   * @param topX size factor for top rectangle (multiplies vectorX)\n   * @param topY size factor for top rectangle (multiplies vectorY)\n   * @param capped true to define top and bottom closure caps\n   */\n  public static createDgnBox(baseOrigin: Point3d, vectorX: Vector3d, vectorY: Vector3d,\n    topOrigin: Point3d,\n    baseX: number, baseY: number, topX: number, topY: number,\n    capped: boolean): Box | undefined {\n    const vectorZ = baseOrigin.vectorTo(topOrigin);\n    const localToWorld = Transform.createOriginAndMatrixColumns(baseOrigin, vectorX, vectorY, vectorZ);\n    return new Box(localToWorld, baseX, baseY, topX, topY, capped);\n  }\n\n  /**\n   * Create a new box with xy directions taken from columns of the `axes` matrix.\n   * @param baseOrigin Origin of base rectangle\n   * @param axes  Direction for base rectangle\n   * @param topOrigin origin of top rectangle\n   * @param baseX size factor for base rectangle (multiplies vectorX)\n   * @param baseY size factor for base rectangle (multiplies vectorY)\n   * @param topX size factor for top rectangle (multiplies vectorX)\n   * @param topY size factor for top rectangle (multiplies vectorY)\n   * @param capped true to define top and bottom closure caps\n   */\n  public static createDgnBoxWithAxes(baseOrigin: Point3d, axes: Matrix3d,\n    topOrigin: Point3d,\n    baseX: number, baseY: number, topX: number, topY: number,\n    capped: boolean): Box | undefined {\n    return Box.createDgnBox(baseOrigin, axes.columnX(), axes.columnY(), topOrigin,\n      baseX, baseY, topX, topY, capped);\n  }\n\n  /**\n   * Create an axis-aligned `Box` primitive for a range.\n   * @param range range corners Origin of base rectangle\n   * @param capped true to define top and bottom closure caps\n   */\n  public static createRange(range: Range3d, capped: boolean): Box | undefined {\n    if (!range.isNull) {\n      const lowPoint = range.low;\n      const xSize = range.xLength();\n      const ySize = range.yLength();\n      const zPoint = range.low.clone();\n      zPoint.z = zPoint.z + range.zLength();\n      return Box.createDgnBox(\n        lowPoint,\n        Vector3d.unitX(), Vector3d.unitY(),\n        zPoint,\n        xSize, ySize, xSize, ySize, capped);\n    }\n    return undefined;\n  }\n  /** (property accessor) return the x length at z = 0 */\n  public getBaseX(): number { return this._baseX; }\n  /** (property accessor) return the y length at z = 0 */\n  public getBaseY(): number { return this._baseY; }\n  /** (property accessor) return the x length at z = 1 */\n  public getTopX(): number { return this._topX; }\n  /** (property accessor) return the x length at z = 1 */\n  public getTopY(): number { return this._topY; }\n  /** (property accessor) return the local coordinates point (0,0,0) to world */\n  public getBaseOrigin(): Point3d { return this._localToWorld.multiplyXYZ(0, 0, 0); }\n  /** (property accessor) return the local coordinates point (0,0,1) to world */\n  public getTopOrigin(): Point3d { return this._localToWorld.multiplyXYZ(0, 0, 1); }\n  /** (property accessor) return the local coordinate frame x vector */\n  public getVectorX(): Vector3d { return this._localToWorld.matrix.columnX(); }\n  /** (property accessor) return the local coordinate frame y vector */\n  public getVectorY(): Vector3d { return this._localToWorld.matrix.columnY(); }\n  /** (property accessor) return the local coordinate frame z vector */\n  public getVectorZ(): Vector3d { return this._localToWorld.matrix.columnZ(); }\n  /** Test of `other` is also of class `Box` */\n  public isSameGeometryClass(other: any): boolean { return other instanceof Box; }\n  /** test for near equality */\n  public override isAlmostEqual(other: GeometryQuery): boolean {\n    if (other instanceof Box) {\n      if (this.capped !== other.capped) return false;\n      if (!this._localToWorld.isAlmostEqual(other._localToWorld)) return false;\n      return Geometry.isSameCoordinate(this._baseX, other._baseX)\n        && Geometry.isSameCoordinate(this._baseY, other._baseY)\n        && Geometry.isSameCoordinate(this._topX, other._topX)\n        && Geometry.isSameCoordinate(this._topY, other._topY);\n    }\n    return false;\n  }\n  /** Second step of double dispatch:  call `handler.handleBox(this)` */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleBox(this);\n  }\n  /** Return strokes of the cross-section rectangle at local z coordinate */\n  public strokeConstantVSection(zFraction: number): LineString3d {\n    const ax = Geometry.interpolate(this._baseX, zFraction, this._topX);\n    const ay = Geometry.interpolate(this._baseY, zFraction, this._topY);\n    const result = LineString3d.create();\n    const transform = this._localToWorld;\n    const workPoint = Point3d.create();\n    transform.multiplyXYZ(0, 0, zFraction, workPoint);\n    result.addPoint(workPoint);\n    transform.multiplyXYZ(ax, 0, zFraction, workPoint);\n    result.addPoint(workPoint);\n    transform.multiplyXYZ(ax, ay, zFraction, workPoint);\n    result.addPoint(workPoint);\n    transform.multiplyXYZ(0, ay, zFraction, workPoint);\n    result.addPoint(workPoint);\n    transform.multiplyXYZ(0, 0, zFraction, workPoint);\n    result.addPoint(workPoint);\n    return result;\n  }\n  /**\n   * Returns the 8 corners in x fastest, then y, finally z lexical order.\n   */\n  public getCorners(): Point3d[] {\n    const transform = this._localToWorld;\n    const ax = this._baseX;\n    const ay = this._baseY;\n    const bx = this._topX;\n    const by = this._topY;\n    return [\n      transform.multiplyXYZ(0, 0, 0),\n      transform.multiplyXYZ(ax, 0, 0),\n      transform.multiplyXYZ(0, ay, 0),\n      transform.multiplyXYZ(ax, ay, 0),\n      transform.multiplyXYZ(0, 0, 1),\n      transform.multiplyXYZ(bx, 0, 1),\n      transform.multiplyXYZ(0, by, 1),\n      transform.multiplyXYZ(bx, by, 1),\n    ];\n  }\n\n  /**\n   * Consider the box sides (not top and bottom) as a (u,v) surface with\n   * * v = 0 as the z=0 local plane\n   * * v = 1 as the z=1 local plane\n   * Return the (rectangular) section at fractional v\n   */\n  public constantVSection(zFraction: number): CurveCollection {\n    const ls = this.strokeConstantVSection(zFraction);\n    return Loop.create(ls);\n  }\n  /** Extend  `rangeToExtend` by each of the 8 corners */\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\n    const boxTransform = this._localToWorld;\n    const ax = this._baseX;\n    const ay = this._baseY;\n    const bx = this._topX;\n    const by = this._topY;\n    if (transform) {\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, 0, 0, 0);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, ax, 0, 0);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, 0, ay, 0);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, ax, ay, 0);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, 0, 0, 1);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, bx, 0, 1);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, 0, by, 1);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, bx, by, 1);\n    } else {\n      rangeToExtend.extendTransformedXYZ(boxTransform, 0, 0, 0);\n      rangeToExtend.extendTransformedXYZ(boxTransform, ax, 0, 0);\n      rangeToExtend.extendTransformedXYZ(boxTransform, 0, ay, 0);\n      rangeToExtend.extendTransformedXYZ(boxTransform, ax, ay, 0);\n      rangeToExtend.extendTransformedXYZ(boxTransform, 0, 0, 1);\n      rangeToExtend.extendTransformedXYZ(boxTransform, bx, 0, 1);\n      rangeToExtend.extendTransformedXYZ(boxTransform, 0, by, 1);\n      rangeToExtend.extendTransformedXYZ(boxTransform, bx, by, 1);\n    }\n  }\n  /**\n   * @return true if this is a closed volume.\n   */\n  public get isClosedVolume(): boolean {\n    return this.capped;\n  }\n}\n"]}
+{"version":3,"file":"Box.js","sourceRoot":"","sources":["../../../src/solid/Box.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,wDAAqD;AACrD,wCAAqC;AACrC,0CAAuC;AAGvC,mEAAkE;AAElE,uDAAoD;AACpD,qDAAkD;AAElD;;;;;;;;;GASG;AACH,MAAa,GAAI,SAAQ,+BAAc;IAUrC,YAAsB,GAAc,EAClC,KAAa,EAAE,KAAa,EAAE,IAAY,EAAE,IAAY,EAAE,MAAe;QACzE,KAAK,CAAC,MAAM,CAAC,CAAC;QAXhB,wCAAwC;QACxB,uBAAkB,GAAG,KAAK,CAAC;QAWzC,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IACD,qBAAqB;IACd,KAAK;QACV,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5G,CAAC;IAED;;;;;OAKG;IACI,oBAAoB;QACzB,OAAO,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;IACzC,CAAC;IACD;;OAEG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE;YAC/B,OAAO,KAAK,CAAC;QACf,SAAS,CAAC,0BAA0B,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,uFAAuF;IAChF,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,SAAS,CAAC,0BAA0B,CAAC,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;QACjF,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,YAAY,CAAC,MAAe,EAAE,OAAiB,EAAE,OAAiB,EAC9E,SAAkB,EAClB,KAAa,EAAE,KAAa,EAAE,IAAY,EAAE,IAAY,EACxD,MAAe;QACf,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3C,MAAM,YAAY,GAAG,qBAAS,CAAC,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QAC/F,OAAO,IAAI,GAAG,CAAC,YAAY,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IACjE,CAAC;IAED;;;;;;;;;;OAUG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAe,EAAE,IAAc,EAChE,SAAkB,EAClB,KAAa,EAAE,KAAa,EAAE,IAAY,EAAE,IAAY,EACxD,MAAe;QACf,OAAO,GAAG,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,OAAO,EAAE,EAAE,SAAS,EACvE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,WAAW,CAAC,KAAc,EAAE,MAAe;QACvD,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YACjB,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC;YAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;YACjC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YACtC,OAAO,GAAG,CAAC,YAAY,CACrB,QAAQ,EACR,0BAAQ,CAAC,KAAK,EAAE,EAAE,0BAAQ,CAAC,KAAK,EAAE,EAClC,MAAM,EACN,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;SACvC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,uDAAuD;IAChD,QAAQ,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACjD,uDAAuD;IAChD,QAAQ,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACjD,uDAAuD;IAChD,OAAO,KAAa,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/C,uDAAuD;IAChD,OAAO,KAAa,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/C,8EAA8E;IACvE,aAAa,KAAc,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnF,8EAA8E;IACvE,YAAY,KAAc,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClF,qEAAqE;IAC9D,UAAU,KAAe,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAC7E,qEAAqE;IAC9D,UAAU,KAAe,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAC7E,qEAAqE;IAC9D,UAAU,KAAe,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAC7E,6CAA6C;IACtC,mBAAmB,CAAC,KAAU,IAAa,OAAO,KAAK,YAAY,GAAG,CAAC,CAAC,CAAC;IAChF,6BAA6B;IACb,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,GAAG,EAAE;YACxB,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YAC/C,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC;gBAAE,OAAO,KAAK,CAAC;YACzE,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;mBACtD,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;mBACpD,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;mBAClD,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;SACzD;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,sEAAsE;IAC/D,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,0EAA0E;IACnE,sBAAsB,CAAC,SAAiB;QAC7C,MAAM,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,MAAM,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QACrC,MAAM,SAAS,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QACnC,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACpD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;OAEG;IACI,UAAU;QACf,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,OAAO;YACL,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/B,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAChC,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/B,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/B,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;SACjC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACI,gBAAgB,CAAC,SAAiB;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;QAClD,OAAO,WAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACzB,CAAC;IACD,uDAAuD;IAChD,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC;QACxC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,IAAI,SAAS,EAAE;YACb,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC/E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAChF,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC/E,aAAa,CAAC,6BAA6B,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SACjF;aAAM;YACL,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC5D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3D,aAAa,CAAC,oBAAoB,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SAC7D;IACH,CAAC;IACD;;OAEG;IACH,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;CACF;AApOD,kBAoOC","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 Solid\n */\n\nimport { CurveCollection } from \"../curve/CurveCollection\";\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Loop } from \"../curve/Loop\";\nimport { Geometry } from \"../Geometry\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { SolidPrimitive } from \"./SolidPrimitive\";\n\n/**\n * A box-like solid defined by\n * * A local coordinate frame\n *   * (0,0,0) is left lower rear corner of box (considering \"left\" to reference x, \"lower\" to reference y, \"rear and front\" to reference z=0 and z=1)\n *   * (0,0,1) is left lower front corner.\n *   * (baseX,baseY,z) is right upper corner at z\n *   * note that the frame x and y columns are usually unit vectors in local space, but z is full rear to front vector\n * * The separate values for base and top x and y allow the box to be a \"view frustum\" with parallel back and front planes but independent x and y bellows effects.\n * @public\n */\nexport class Box extends SolidPrimitive {\n  /** String name for schema properties */\n  public readonly solidPrimitiveType = \"box\";\n\n  private _localToWorld: Transform;\n  private _baseX: number;\n  private _baseY: number;\n  private _topX: number;\n  private _topY: number;\n\n  protected constructor(map: Transform,\n    baseX: number, baseY: number, topX: number, topY: number, capped: boolean) {\n    super(capped);\n    this._localToWorld = map;\n    this._baseX = baseX;\n    this._baseY = baseY;\n    this._topX = topX;\n    this._topY = topY;\n  }\n  /** Return a clone */\n  public clone(): Box {\n    return new Box(this._localToWorld.clone(), this._baseX, this._baseY, this._topX, this._topY, this.capped);\n  }\n\n  /** Return a coordinate frame (right handed unit vectors)\n   * * origin lower left of box\n   * * x direction on base rectangle x edge\n   * * y direction in base rectangle\n   * * z direction perpendicular\n   */\n  public getConstructiveFrame(): Transform | undefined {\n    return this._localToWorld.cloneRigid();\n  }\n  /** Apply the transform to the box's `localToWorld` frame.\n   * * Note that this may make the frame nonrigid.\n   */\n  public tryTransformInPlace(transform: Transform): boolean {\n    if (transform.matrix.isSingular())\n      return false;\n    transform.multiplyTransformTransform(this._localToWorld, this._localToWorld);\n    return true;\n  }\n  /** Clone the box and immediately apply `transform` to the local frame of the clone. */\n  public cloneTransformed(transform: Transform): Box | undefined {\n    const result = this.clone();\n    transform.multiplyTransformTransform(result._localToWorld, result._localToWorld);\n    return result;\n  }\n\n  /**\n   * Create a new box from vector and size daa.\n   * @param origin Origin of base rectangle\n   * @param vectorX  Direction for base rectangle\n   * @param vectorY Direction for base rectangle\n   * @param topOrigin origin of top rectangle\n   * @param baseX size factor for base rectangle (multiplies vectorX)\n   * @param baseY size factor for base rectangle (multiplies vectorY)\n   * @param topX size factor for top rectangle (multiplies vectorX)\n   * @param topY size factor for top rectangle (multiplies vectorY)\n   * @param capped true to define top and bottom closure caps\n   */\n  public static createDgnBox(origin: Point3d, vectorX: Vector3d, vectorY: Vector3d,\n    topOrigin: Point3d,\n    baseX: number, baseY: number, topX: number, topY: number,\n    capped: boolean): Box | undefined {\n    const vectorZ = origin.vectorTo(topOrigin);\n    const localToWorld = Transform.createOriginAndMatrixColumns(origin, vectorX, vectorY, vectorZ);\n    return new Box(localToWorld, baseX, baseY, topX, topY, capped);\n  }\n\n  /**\n   * Create a new box with xy directions taken from columns of the `axes` matrix.\n   * @param origin Origin of base rectangle\n   * @param axes  Direction for base rectangle\n   * @param topOrigin origin of top rectangle\n   * @param baseX size factor for base rectangle (multiplies vectorX)\n   * @param baseY size factor for base rectangle (multiplies vectorY)\n   * @param topX size factor for top rectangle (multiplies vectorX)\n   * @param topY size factor for top rectangle (multiplies vectorY)\n   * @param capped true to define top and bottom closure caps\n   */\n  public static createDgnBoxWithAxes(origin: Point3d, axes: Matrix3d,\n    topOrigin: Point3d,\n    baseX: number, baseY: number, topX: number, topY: number,\n    capped: boolean): Box | undefined {\n    return Box.createDgnBox(origin, axes.columnX(), axes.columnY(), topOrigin,\n      baseX, baseY, topX, topY, capped);\n  }\n\n  /**\n   * Create an axis-aligned `Box` primitive for a range.\n   * @param range range corners Origin of base rectangle\n   * @param capped true to define top and bottom closure caps\n   */\n  public static createRange(range: Range3d, capped: boolean): Box | undefined {\n    if (!range.isNull) {\n      const lowPoint = range.low;\n      const xSize = range.xLength();\n      const ySize = range.yLength();\n      const zPoint = range.low.clone();\n      zPoint.z = zPoint.z + range.zLength();\n      return Box.createDgnBox(\n        lowPoint,\n        Vector3d.unitX(), Vector3d.unitY(),\n        zPoint,\n        xSize, ySize, xSize, ySize, capped);\n    }\n    return undefined;\n  }\n  /** (property accessor) return the x length at z = 0 */\n  public getBaseX(): number { return this._baseX; }\n  /** (property accessor) return the y length at z = 0 */\n  public getBaseY(): number { return this._baseY; }\n  /** (property accessor) return the x length at z = 1 */\n  public getTopX(): number { return this._topX; }\n  /** (property accessor) return the x length at z = 1 */\n  public getTopY(): number { return this._topY; }\n  /** (property accessor) return the local coordinates point (0,0,0) to world */\n  public getBaseOrigin(): Point3d { return this._localToWorld.multiplyXYZ(0, 0, 0); }\n  /** (property accessor) return the local coordinates point (0,0,1) to world */\n  public getTopOrigin(): Point3d { return this._localToWorld.multiplyXYZ(0, 0, 1); }\n  /** (property accessor) return the local coordinate frame x vector */\n  public getVectorX(): Vector3d { return this._localToWorld.matrix.columnX(); }\n  /** (property accessor) return the local coordinate frame y vector */\n  public getVectorY(): Vector3d { return this._localToWorld.matrix.columnY(); }\n  /** (property accessor) return the local coordinate frame z vector */\n  public getVectorZ(): Vector3d { return this._localToWorld.matrix.columnZ(); }\n  /** Test of `other` is also of class `Box` */\n  public isSameGeometryClass(other: any): boolean { return other instanceof Box; }\n  /** test for near equality */\n  public override isAlmostEqual(other: GeometryQuery): boolean {\n    if (other instanceof Box) {\n      if (this.capped !== other.capped) return false;\n      if (!this._localToWorld.isAlmostEqual(other._localToWorld)) return false;\n      return Geometry.isSameCoordinate(this._baseX, other._baseX)\n        && Geometry.isSameCoordinate(this._baseY, other._baseY)\n        && Geometry.isSameCoordinate(this._topX, other._topX)\n        && Geometry.isSameCoordinate(this._topY, other._topY);\n    }\n    return false;\n  }\n  /** Second step of double dispatch:  call `handler.handleBox(this)` */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleBox(this);\n  }\n  /** Return strokes of the cross-section rectangle at local z coordinate */\n  public strokeConstantVSection(zFraction: number): LineString3d {\n    const ax = Geometry.interpolate(this._baseX, zFraction, this._topX);\n    const ay = Geometry.interpolate(this._baseY, zFraction, this._topY);\n    const result = LineString3d.create();\n    const transform = this._localToWorld;\n    const workPoint = Point3d.create();\n    transform.multiplyXYZ(0, 0, zFraction, workPoint);\n    result.addPoint(workPoint);\n    transform.multiplyXYZ(ax, 0, zFraction, workPoint);\n    result.addPoint(workPoint);\n    transform.multiplyXYZ(ax, ay, zFraction, workPoint);\n    result.addPoint(workPoint);\n    transform.multiplyXYZ(0, ay, zFraction, workPoint);\n    result.addPoint(workPoint);\n    transform.multiplyXYZ(0, 0, zFraction, workPoint);\n    result.addPoint(workPoint);\n    return result;\n  }\n  /**\n   * Returns the 8 corners in x fastest, then y, finally z lexical order.\n   */\n  public getCorners(): Point3d[] {\n    const transform = this._localToWorld;\n    const ax = this._baseX;\n    const ay = this._baseY;\n    const bx = this._topX;\n    const by = this._topY;\n    return [\n      transform.multiplyXYZ(0, 0, 0),\n      transform.multiplyXYZ(ax, 0, 0),\n      transform.multiplyXYZ(0, ay, 0),\n      transform.multiplyXYZ(ax, ay, 0),\n      transform.multiplyXYZ(0, 0, 1),\n      transform.multiplyXYZ(bx, 0, 1),\n      transform.multiplyXYZ(0, by, 1),\n      transform.multiplyXYZ(bx, by, 1),\n    ];\n  }\n\n  /**\n   * Consider the box sides (not top and bottom) as a (u,v) surface with\n   * * v = 0 as the z=0 local plane\n   * * v = 1 as the z=1 local plane\n   * Return the (rectangular) section at fractional v\n   */\n  public constantVSection(zFraction: number): CurveCollection {\n    const ls = this.strokeConstantVSection(zFraction);\n    return Loop.create(ls);\n  }\n  /** Extend  `rangeToExtend` by each of the 8 corners */\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\n    const boxTransform = this._localToWorld;\n    const ax = this._baseX;\n    const ay = this._baseY;\n    const bx = this._topX;\n    const by = this._topY;\n    if (transform) {\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, 0, 0, 0);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, ax, 0, 0);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, 0, ay, 0);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, ax, ay, 0);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, 0, 0, 1);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, bx, 0, 1);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, 0, by, 1);\n      rangeToExtend.extendTransformTransformedXYZ(transform, boxTransform, bx, by, 1);\n    } else {\n      rangeToExtend.extendTransformedXYZ(boxTransform, 0, 0, 0);\n      rangeToExtend.extendTransformedXYZ(boxTransform, ax, 0, 0);\n      rangeToExtend.extendTransformedXYZ(boxTransform, 0, ay, 0);\n      rangeToExtend.extendTransformedXYZ(boxTransform, ax, ay, 0);\n      rangeToExtend.extendTransformedXYZ(boxTransform, 0, 0, 1);\n      rangeToExtend.extendTransformedXYZ(boxTransform, bx, 0, 1);\n      rangeToExtend.extendTransformedXYZ(boxTransform, 0, by, 1);\n      rangeToExtend.extendTransformedXYZ(boxTransform, bx, by, 1);\n    }\n  }\n  /**\n   * @return true if this is a closed volume.\n   */\n  public get isClosedVolume(): boolean {\n    return this.capped;\n  }\n}\n"]}

package/lib/cjs/topology/HalfEdgeGraphSearch.d.ts

@@ -84,8 +84,8 @@ export declare class HalfEdgeGraphSearch {
     /**
      * Collect arrays gathering faces by connected component.
      * @param graph graph to inspect
-     * @param parityEdgeTester (optional) function to test of an edge is a parity change.
-     * @param parityMask (optional, along with boundaryTestFunction) mask to apply indicating parity.  If this is Mask.NULL_MASK, there is no record of parity.
+     * @param parityEdgeTester (optional) function to test if an edge is a parity change (e.g., a boundary edge).
+     * @param parityMask (optional, along with parityEdgeTester) mask to apply indicating parity.  If this is Mask.NULL_MASK, there is no record of parity.
      */
     static collectConnectedComponentsWithExteriorParityMasks(graph: HalfEdgeGraph, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask?: HalfEdgeMask): HalfEdge[][];
     /**

package/lib/cjs/topology/HalfEdgeGraphSearch.js

@@ -185,8 +185,8 @@ class HalfEdgeGraphSearch {
     /**
      * Collect arrays gathering faces by connected component.
      * @param graph graph to inspect
-     * @param parityEdgeTester (optional) function to test of an edge is a parity change.
-     * @param parityMask (optional, along with boundaryTestFunction) mask to apply indicating parity.  If this is Mask.NULL_MASK, there is no record of parity.
+     * @param parityEdgeTester (optional) function to test if an edge is a parity change (e.g., a boundary edge).
+     * @param parityMask (optional, along with parityEdgeTester) mask to apply indicating parity.  If this is Mask.NULL_MASK, there is no record of parity.
      */
     static collectConnectedComponentsWithExteriorParityMasks(graph, parityEdgeTester, parityMask = Graph_1.HalfEdgeMask.NULL_MASK) {
         const components = [];

package/lib/cjs/topology/HalfEdgeGraphSearch.js.map

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgeGraphSearch.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphSearch.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,mCAAiH;AACjH,2DAAwD;AACxD,mEAAgE;AAQhE;GACG;AACH,MAAa,kBAAkB;IAG7B;;;;OAIG;IACH,YAAmB,IAAkB,EAAE,cAAuB,IAAI;QAChE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IACD,yEAAyE;IAClE,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC,YAAY,CAAC;IAChE,CAAC;CAEF;AAjBD,gDAiBC;AACD,oCAAoC;AACpC,MAAa,mBAAmB;IAE9B;;;OAGG;IACK,MAAM,CAAC,yBAAyB,CAAC,QAAkB,EAAE,IAAY,EAAE,YAAwB,EAAE,eAA2B;QAC9H,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,QAAQ,CAAC,iBAAiB,CAAC,CAAC,IAAc,EAAE,EAAE;YAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,mBAAmB,CAAC,uBAAmD,EACnF,gBAAuC;QACvC,MAAM,OAAO,GAAG,mBAAmB,CAAC,sBAAsB,CAAC,uBAAuB,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;QAC7G,OAAO,OAAO,CAAC,mBAAoB,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,cAAc,CAAC,IAAc,IAAY,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IACtF;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAkC,EAAE,kBAA2B,KAAK,EACvG,eAAqC,mBAAmB,CAAC,cAAc;QACvE,MAAM,MAAM,GAAG,IAAI,qCAAiB,CAAW,eAAe,CAAC,CAAC;QAChE,IAAI,QAAoB,CAAC;QAEzB,IAAI,MAAM,YAAY,qBAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACjC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAAkC,EAAE,iCAA0C,IAAI,EAAE,4BAA4B,GAAG,CAAC;QAClJ,IAAI,QAAoB,CAAC;QAEzB,IAAI,MAAM,YAAY,qBAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC7C,IAAI,QAAQ,IAAI,CAAC,EAAE;gBACjB,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;gBACnC,IAAI,IAAI,GAAG,CAAC,EAAE;oBACZ,IAAI,QAAQ,GAAG,CAAC,EAAE;wBAChB,qBAAqB,EAAE,CAAC;wBACxB,IAAI,qBAAqB,GAAG,4BAA4B;4BACtD,OAAO,KAAK,CAAC;qBAChB;iBACF;qBAAM;oBACL,WAAW,EAAE,CAAC;oBACd,IAAI,WAAW,GAAG,CAAC,EAAE;wBACnB,IAAI,CAAC,8BAA8B;4BACjC,OAAO,KAAK,CAAC;qBAChB;iBACF;aACF;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;OAUG;IACK,MAAM,CAAC,mBAAmB,CAAC,QAAkB,EAAE,SAAuB,EAAE,gBAAgD,EAAE,UAAwB;QACxJ,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,QAAQ;QAEzD,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,gFAAgF;QAChF,mBAAmB,CAAC,yBAAyB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAE,8BAA8B;QAChH,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC;YACxB,IAAI,CAAC,IAAI;gBACP,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;gBAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;gBACvC,IAAI,CAAC,gBAAgB,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACnD,QAAQ,GAAG,CAAC,QAAQ,CAAC;gBACvB,mBAAmB,CAAC,yBAAyB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;aACpG;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,MAAqB,EAAE,IAAkB,EAAE,KAAiB;QACxG,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACxE,IAAI,CAAC,gBAAgB,EAAE;SACtB;aAAM,IAAI,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;YAC3C,uCAAuC;SACxC;aAAM;YACL,qEAAqE;YACrE,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE;gBAC5B,IAAI,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;oBAC5B,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;iBACpC;qBAAM;oBACL,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;iBAClC;aACF;SACF;IACH,CAAC;IACD,0GAA0G;IAClG,MAAM,CAAC,8BAA8B,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB;QAC9G,IAAI,IAAI,KAAK,oBAAY,CAAC,SAAS;YACjC,OAAO;QACT,KAAK,MAAM,gBAAgB,IAAI,UAAU;YACvC,mBAAmB,CAAC,8BAA8B,CAAC,KAAK,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;IACtF,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iDAAiD,CAAC,KAAoB,EAAE,gBAAgD,EAAE,aAA2B,oBAAY,CAAC,SAAS;QACvL,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,MAAM,SAAS,GAAG,oBAAY,CAAC,OAAO,CAAC;QACvC,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC1B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,YAAY,EAAE;YACzC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,oBAAY,CAAC,OAAO,CAAC,EAAE;gBAC7C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;gBAC5G,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aAC3B;SACF;QACD,mBAAmB,CAAC,8BAA8B,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClF,OAAO,UAAU,CAAC;IACpB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,QAAkB,EAAE,CAAS,EAAE,CAAS;QACtE,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,yFAAyF;QACzF,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,GAAG,QAAQ,CAAC,aAAa,CAAC;QACnC,QAAS,KAAK,GAAG,KAAK,EAAE;YACtB,IAAI,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC1D,MAAM;YACR,IAAI,KAAK,KAAK,QAAQ,EAAE;gBACtB,uCAAuC;gBACvC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;SAC7B;QAED,sFAAsF;QACtF,kDAAkD;QAClD,IAAI,IAAI,GAAG,KAAK,CAAC,aAAa,CAAC;QAC/B,SAAU;YACR,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE;gBACpC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,IAAI,IAAI,KAAK,KAAK;gBAChB,MAAM;YACR,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC;SAC3B;QACD,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IAClC,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,mCAAmC,CAAC,IAAc,EAAE,SAAuB,EAAE,cAAyC,EAClI,YAAuD;QACvD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;YACvD,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACxB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC;YACtC,IAAI,qBAAqB,GAAG,UAAU,CAAC;YACvC,SAAU;gBACR,IAAI,qBAAqB,CAAC,OAAO,CAAC,SAAS,CAAC;oBAC1C,OAAO;gBACT,IAAI,cAAc,CAAC,qBAAqB,CAAC,EAAE;oBACzC,IAAI,GAAG,qBAAqB,CAAC;oBAC7B,MAAM;iBACP;gBACD,qBAAqB,GAAG,qBAAqB,CAAC,iBAAiB,CAAC;gBAChE,IAAI,qBAAqB,KAAK,UAAU;oBACtC,MAAM;aACT;SACF;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,mCAAmC,CAAC,KAAoB,EAAE,YAA0B;QAChG,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,cAAc,GAAG,CAAC,IAAc,EAAW,EAAE;YACjD,OAAO,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACvF,CAAC,CAAC;QACF,MAAM,sBAAsB,GAAG,CAAC,IAAc,EAAE,OAAe,EAAE,EAAE;YACjE,IAAI,OAAO,KAAK,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,mCAAmC,CAAC,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,sBAAsB,CAAC,CAAC;SACnG;QACD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAjRD,kDAiRC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, HalfEdgeToBooleanFunction, NodeToNumberFunction } from \"./Graph\";\nimport { SignedDataSummary } from \"./SignedDataSummary\";\nimport { XYParitySearchContext } from \"./XYParitySearchContext\";\n\n/**\n * Interface for an object that executes boolean tests on edges.\n */\nexport interface HalfEdgeTestObject {\n  testEdge(h: HalfEdge): boolean;\n}\n/**\n */\nexport class HalfEdgeMaskTester {\n  private _targetMask: HalfEdgeMask;\n  private _targetValue: boolean;\n  /**\n   *\n   * @param mask mask to test in `testEdge` function\n   * @param targetValue value to match for true return\n   */\n  public constructor(mask: HalfEdgeMask, targetValue: boolean = true) {\n    this._targetMask = mask;\n    this._targetValue = targetValue;\n  }\n  /** Return true if the value of the targetMask matches the targetValue */\n  public testEdge(edge: HalfEdge): boolean {\n    return edge.isMaskSet(this._targetMask) === this._targetValue;\n  }\n\n}\n// Search services for HalfEdgeGraph\nexport class HalfEdgeGraphSearch {\n\n  /**\n   * * for each node of face, set the mask push to allNodesStack\n   * * push the faceSeed on onePerFaceStack[]\n   */\n  private static pushAndMaskAllNodesInFace(faceSeed: HalfEdge, mask: number, allNodeStack: HalfEdge[], onePerFaceStack: HalfEdge[]) {\n    onePerFaceStack.push(faceSeed);\n    faceSeed.collectAroundFace((node: HalfEdge) => {\n      node.setMask(mask);\n      allNodeStack.push(node);\n    });\n  }\n\n  /**\n   * Search an array of faceSeed nodes for the face with the most negative area.\n   * @param oneCandidateNodePerFace array containing one node from each face to be considered.\n   */\n  public static findMinimumAreaFace(oneCandidateNodePerFace: HalfEdgeGraph | HalfEdge[],\n    faceAreaFunction?: NodeToNumberFunction): HalfEdge {\n    const summary = HalfEdgeGraphSearch.collectFaceAreaSummary(oneCandidateNodePerFace, false, faceAreaFunction);\n    return summary.largestNegativeItem!;\n  }\n  /**\n   * static method for face area computation -- useful as function parameter in collect FaceAreaSummary.\n   * * This simply calls `node.signedFaceArea ()`\n   * @param node instance for signedFaceArea call.\n   */\n  public static signedFaceArea(node: HalfEdge): number { return node.signedFaceArea(); }\n  /**\n   *\n   * Return a summary structure data about face (or other numeric quantity if the caller's areaFunction returns other value)\n   * * The default areaFunction computes area of polygonal face.\n   * * Callers with curved edge graphs must supply their own area function.\n   * @param source graph or array of nodes to examine\n   * @param collectAllNodes flag to pass to the SignedDataSummary constructor to control collection of nodes.\n   * @param areaFunction function to all to obtain area (or other numeric value)\n   */\n  public static collectFaceAreaSummary(source: HalfEdgeGraph | HalfEdge[], collectAllNodes: boolean = false,\n    areaFunction: NodeToNumberFunction = HalfEdgeGraphSearch.signedFaceArea): SignedDataSummary<HalfEdge> {\n    const result = new SignedDataSummary<HalfEdge>(collectAllNodes);\n    let allFaces: HalfEdge[];\n\n    if (source instanceof HalfEdgeGraph)\n      allFaces = source.collectFaceLoops();\n    else\n      allFaces = source;\n\n    for (const node of allFaces) {\n      const area = areaFunction(node);\n      result.announceItem(node, area);\n    }\n    return result;\n  }\n\n  /**\n   * * Test if the graph is triangulated.\n   * * Return false if:\n   *   * Positive area face with more than 3 edges\n   *   * more than 1 negative area face with `allowMultipleNegativeAreaFaces` false\n   * * 2-edge faces are ignored.\n   */\n  public static isTriangulatedCCW(source: HalfEdgeGraph | HalfEdge[], allowMultipleNegativeAreaFaces: boolean = true, numPositiveExceptionsAllowed = 0): boolean {\n    let allFaces: HalfEdge[];\n\n    if (source instanceof HalfEdgeGraph)\n      allFaces = source.collectFaceLoops();\n    else\n      allFaces = source;\n    let numNegative = 0;\n    let numPositiveExceptions = 0;\n    for (const node of allFaces) {\n      const numEdges = node.countEdgesAroundFace();\n      if (numEdges >= 3) {\n        const area = node.signedFaceArea();\n        if (area > 0) {\n          if (numEdges > 3) {\n            numPositiveExceptions++;\n            if (numPositiveExceptions > numPositiveExceptionsAllowed)\n              return false;\n          }\n        } else {\n          numNegative++;\n          if (numNegative > 1) {\n            if (!allowMultipleNegativeAreaFaces)\n              return false;\n          }\n        }\n      }\n    }\n    return true;\n  }\n\n  /**\n   * Search to all accessible faces from given seed.\n   * * The returned array contains one representative node in each face of the connected component.\n   * * If (nonnull) parity mask is given, on return:\n   *    * It is entirely set or entirely clear around each face\n   *    * It is entirely set on all faces that are an even number of face-to-face steps away from the seed.\n   *    * It is entirely clear on all faces that are an odd number of face-to-face steps away from the seed.\n   * @param seedEdge first edge to search.\n   * @param visitMask mask applied to all faces as visited.\n   * @param parityMask mask to apply (a) to first face, (b) to faces with alternating parity during the search.\n   */\n  private static parityFloodFromSeed(seedEdge: HalfEdge, visitMask: HalfEdgeMask, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask: HalfEdgeMask): HalfEdge[] {\n    const faces: HalfEdge[] = [];\n    if (seedEdge.isMaskSet(visitMask)) return faces; // empty\n\n    const allMasks = parityMask | visitMask;\n    const stack: HalfEdge[] = [];\n    // arbitrarily call the seed face exterior ... others will alternate as visited.\n    HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(seedEdge, allMasks, stack, faces);  // Start with exterior as mask\n    while (stack.length > 0) {\n      const p = stack.pop()!;\n      const mate = p.edgeMate;\n      if (!mate)\n        continue;\n      if (!mate.isMaskSet(visitMask)) {\n        let newState = p.isMaskSet(parityMask);\n        if (!parityEdgeTester || parityEdgeTester.testEdge(p))\n          newState = !newState;\n        HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(mate, newState ? allMasks : visitMask, stack, faces);\n      }\n    }\n    return faces;\n  }\n  /**\n   * * Search the given faces for the one with the minimum area.\n   * * If the mask in that face is OFF, toggle it on (all half edges of) all the faces.\n   * * In a properly merged planar subdivision there should be only one true negative area face per component.\n   * @param graph parent graph\n   * @param parityMask mask which was previously set with alternating parity, but with an arbitrary start face.\n   * @param faces array of faces to search.\n   */\n  private static correctParityInSingleComponent(_graph: HalfEdgeGraph, mask: HalfEdgeMask, faces: HalfEdge[]) {\n    const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(faces);\n    if (!exteriorHalfEdge) {\n    } else if (exteriorHalfEdge.isMaskSet(mask)) {\n      // all should be well .. nothing to do.\n    } else {\n      // TOGGLE around the face (assuming all are consistent with the seed)\n      for (const faceSeed of faces) {\n        if (faceSeed.isMaskSet(mask)) {\n          faceSeed.clearMaskAroundFace(mask);\n        } else {\n          faceSeed.setMaskAroundFace(mask);\n        }\n      }\n    }\n  }\n  /** Apply correctParityInSingleComponent to each array in components. (Quick exit if mask in NULL_MASK) */\n  private static correctParityInComponentArrays(graph: HalfEdgeGraph, mask: HalfEdgeMask, components: HalfEdge[][]) {\n    if (mask === HalfEdgeMask.NULL_MASK)\n      return;\n    for (const facesInComponent of components)\n      HalfEdgeGraphSearch.correctParityInSingleComponent(graph, mask, facesInComponent);\n  }\n  /**\n   * Collect arrays gathering faces by connected component.\n   * @param graph graph to inspect\n   * @param parityEdgeTester (optional) function to test of an edge is a parity change.\n   * @param parityMask (optional, along with boundaryTestFunction) mask to apply indicating parity.  If this is Mask.NULL_MASK, there is no record of parity.\n   */\n  public static collectConnectedComponentsWithExteriorParityMasks(graph: HalfEdgeGraph, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask: HalfEdgeMask = HalfEdgeMask.NULL_MASK): HalfEdge[][] {\n    const components = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    const allMasks = parityMask | visitMask;\n    graph.clearMask(allMasks);\n    for (const faceSeed of graph.allHalfEdges) {\n      if (!faceSeed.isMaskSet(HalfEdgeMask.VISITED)) {\n        const newFaces = HalfEdgeGraphSearch.parityFloodFromSeed(faceSeed, visitMask, parityEdgeTester, parityMask);\n        components.push(newFaces);\n      }\n    }\n    HalfEdgeGraphSearch.correctParityInComponentArrays(graph, parityMask, components);\n    return components;\n  }\n  /**\n   * Test if (x,y) is inside (1), on an edge (0) or outside (-1) a face.\n   * @param seedNode any node on the face loop\n   * @param x x coordinate of test point.\n   * @param y y coordinate of test point.\n   */\n  public static pointInOrOnFaceXY(seedNode: HalfEdge, x: number, y: number): number | undefined {\n    const context = new XYParitySearchContext(x, y);\n    // walk around looking for an accepted node to start the search (seedNode is usually ok!)\n    let nodeA = seedNode;\n    let nodeB = seedNode.faceSuccessor;\n    for (; ; nodeA = nodeB) {\n      if (context.tryStartEdge(nodeA.x, nodeA.y, nodeB.x, nodeB.y))\n        break;\n      if (nodeB === seedNode) {\n        // umm.. the face is all on the x axis?\n        return context.classifyCounts();\n      }\n      nodeB = nodeA.faceSuccessor;\n    }\n\n    // nodeB is the real start node for search ... emit ends of each edge around the face,\n    //   stopping after emitting nodeB as an edge end.\n    let node = nodeB.faceSuccessor;\n    for (; ;) {\n      if (!context.advance(node.x, node.y)) {\n        return context.classifyCounts();\n      }\n      if (node === nodeB)\n        break;\n      node = node.faceSuccessor;\n    }\n    return context.classifyCounts();\n  }\n  /**\n   * Announce nodes that are \"extended face boundary\" by conditions (usually mask of node and mate) in test functions.\n   * * After each node, the next candidate in reached by looking \"around the head vertex loop\" for the next boundary.\n   *   * \"Around the vertex\" from nodeA means\n   *      * First look at nodeA.faceSuccessor;\n   *      * Then look at vertexPredecessor around that vertex loop.\n   * * Each accepted node is passed to announceNode, and marked with the visit mask.\n   * * The counter of the announceEdge function is zero for the first edge, then increases with each edge.\n   * @param seed start node.\n   * @param isBoundaryEdge\n   * @param announceEdge\n   */\n  public static collectExtendedBoundaryLoopFromSeed(seed: HalfEdge, visitMask: HalfEdgeMask, isBoundaryEdge: HalfEdgeToBooleanFunction,\n    announceEdge: (edge: HalfEdge, counter: number) => void) {\n    let counter = 0;\n    while (!seed.getMask(visitMask) && isBoundaryEdge(seed)) {\n      announceEdge(seed, counter++);\n      seed.setMask(visitMask);\n      const vertexBase = seed.faceSuccessor;\n      let candidateAroundVertex = vertexBase;\n      for (; ;) {\n        if (candidateAroundVertex.getMask(visitMask))\n          return;\n        if (isBoundaryEdge(candidateAroundVertex)) {\n          seed = candidateAroundVertex;\n          break;\n        }\n        candidateAroundVertex = candidateAroundVertex.vertexPredecessor;\n        if (candidateAroundVertex === vertexBase)\n          break;\n      }\n    }\n  }\n  /**\n   * Collect arrays of nodes \"around the boundary\" of a graph with extraneous (non-boundary) edges.\n   * * The \"boundary\" is nodes that do NOT have the exterior mask, but whose mates DO have the exterior mask.\n   * * After each node, the next candidate in reached by looking \"around the head vertex loop\" for the next boundary.\n   *   * \"Around the vertex\" from nodeA means\n   *      * First look at nodeA.faceSuccessor;\n   *      * Then look at vertexPredecessor around that vertex loop.\n   * * Each accepted node is passed to announceNode, and marked with the visit mask.\n   * @param seed start node.\n   * @param isBoundaryNode\n   * @param announceNode\n   */\n  public static collectExtendedBoundaryLoopsInGraph(graph: HalfEdgeGraph, exteriorMask: HalfEdgeMask): HalfEdge[][] {\n    const loops: HalfEdge[][] = [];\n    const visitMask = graph.grabMask(true);\n    const isBoundaryEdge = (edge: HalfEdge): boolean => {\n      return edge.getMask(exteriorMask) === 0 && edge.edgeMate.getMask(exteriorMask) !== 0;\n    };\n    const announceEdgeInBoundary = (edge: HalfEdge, counter: number) => {\n      if (counter === 0)\n        loops.push([]);\n      loops[loops.length - 1].push(edge);\n    };\n    for (const seed of graph.allHalfEdges) {\n      this.collectExtendedBoundaryLoopFromSeed(seed, visitMask, isBoundaryEdge, announceEdgeInBoundary);\n    }\n    graph.dropMask(visitMask);\n    return loops;\n  }\n}\n"]}
+{"version":3,"file":"HalfEdgeGraphSearch.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphSearch.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,mCAAiH;AACjH,2DAAwD;AACxD,mEAAgE;AAQhE;GACG;AACH,MAAa,kBAAkB;IAG7B;;;;OAIG;IACH,YAAmB,IAAkB,EAAE,cAAuB,IAAI;QAChE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IACD,yEAAyE;IAClE,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC,YAAY,CAAC;IAChE,CAAC;CAEF;AAjBD,gDAiBC;AACD,oCAAoC;AACpC,MAAa,mBAAmB;IAE9B;;;OAGG;IACK,MAAM,CAAC,yBAAyB,CAAC,QAAkB,EAAE,IAAY,EAAE,YAAwB,EAAE,eAA2B;QAC9H,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,QAAQ,CAAC,iBAAiB,CAAC,CAAC,IAAc,EAAE,EAAE;YAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,mBAAmB,CAAC,uBAAmD,EACnF,gBAAuC;QACvC,MAAM,OAAO,GAAG,mBAAmB,CAAC,sBAAsB,CAAC,uBAAuB,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;QAC7G,OAAO,OAAO,CAAC,mBAAoB,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,cAAc,CAAC,IAAc,IAAY,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IACtF;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAkC,EAAE,kBAA2B,KAAK,EACvG,eAAqC,mBAAmB,CAAC,cAAc;QACvE,MAAM,MAAM,GAAG,IAAI,qCAAiB,CAAW,eAAe,CAAC,CAAC;QAChE,IAAI,QAAoB,CAAC;QAEzB,IAAI,MAAM,YAAY,qBAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACjC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAAkC,EAAE,iCAA0C,IAAI,EAAE,4BAA4B,GAAG,CAAC;QAClJ,IAAI,QAAoB,CAAC;QAEzB,IAAI,MAAM,YAAY,qBAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC7C,IAAI,QAAQ,IAAI,CAAC,EAAE;gBACjB,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;gBACnC,IAAI,IAAI,GAAG,CAAC,EAAE;oBACZ,IAAI,QAAQ,GAAG,CAAC,EAAE;wBAChB,qBAAqB,EAAE,CAAC;wBACxB,IAAI,qBAAqB,GAAG,4BAA4B;4BACtD,OAAO,KAAK,CAAC;qBAChB;iBACF;qBAAM;oBACL,WAAW,EAAE,CAAC;oBACd,IAAI,WAAW,GAAG,CAAC,EAAE;wBACnB,IAAI,CAAC,8BAA8B;4BACjC,OAAO,KAAK,CAAC;qBAChB;iBACF;aACF;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;OAUG;IACK,MAAM,CAAC,mBAAmB,CAAC,QAAkB,EAAE,SAAuB,EAAE,gBAAgD,EAAE,UAAwB;QACxJ,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,QAAQ;QAEzD,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,gFAAgF;QAChF,mBAAmB,CAAC,yBAAyB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAE,8BAA8B;QAChH,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC;YACxB,IAAI,CAAC,IAAI;gBACP,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;gBAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;gBACvC,IAAI,CAAC,gBAAgB,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACnD,QAAQ,GAAG,CAAC,QAAQ,CAAC;gBACvB,mBAAmB,CAAC,yBAAyB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;aACpG;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,MAAqB,EAAE,IAAkB,EAAE,KAAiB;QACxG,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACxE,IAAI,CAAC,gBAAgB,EAAE;SACtB;aAAM,IAAI,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;YAC3C,uCAAuC;SACxC;aAAM;YACL,qEAAqE;YACrE,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE;gBAC5B,IAAI,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;oBAC5B,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;iBACpC;qBAAM;oBACL,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;iBAClC;aACF;SACF;IACH,CAAC;IACD,0GAA0G;IAClG,MAAM,CAAC,8BAA8B,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB;QAC9G,IAAI,IAAI,KAAK,oBAAY,CAAC,SAAS;YACjC,OAAO;QACT,KAAK,MAAM,gBAAgB,IAAI,UAAU;YACvC,mBAAmB,CAAC,8BAA8B,CAAC,KAAK,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;IACtF,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iDAAiD,CAAC,KAAoB,EAAE,gBAAgD,EAAE,aAA2B,oBAAY,CAAC,SAAS;QACvL,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,MAAM,SAAS,GAAG,oBAAY,CAAC,OAAO,CAAC;QACvC,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC1B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,YAAY,EAAE;YACzC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,oBAAY,CAAC,OAAO,CAAC,EAAE;gBAC7C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;gBAC5G,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aAC3B;SACF;QACD,mBAAmB,CAAC,8BAA8B,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClF,OAAO,UAAU,CAAC;IACpB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,QAAkB,EAAE,CAAS,EAAE,CAAS;QACtE,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,yFAAyF;QACzF,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,GAAG,QAAQ,CAAC,aAAa,CAAC;QACnC,QAAS,KAAK,GAAG,KAAK,EAAE;YACtB,IAAI,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC1D,MAAM;YACR,IAAI,KAAK,KAAK,QAAQ,EAAE;gBACtB,uCAAuC;gBACvC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;SAC7B;QAED,sFAAsF;QACtF,kDAAkD;QAClD,IAAI,IAAI,GAAG,KAAK,CAAC,aAAa,CAAC;QAC/B,SAAU;YACR,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE;gBACpC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,IAAI,IAAI,KAAK,KAAK;gBAChB,MAAM;YACR,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC;SAC3B;QACD,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IAClC,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,mCAAmC,CAAC,IAAc,EAAE,SAAuB,EAAE,cAAyC,EAClI,YAAuD;QACvD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;YACvD,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACxB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC;YACtC,IAAI,qBAAqB,GAAG,UAAU,CAAC;YACvC,SAAU;gBACR,IAAI,qBAAqB,CAAC,OAAO,CAAC,SAAS,CAAC;oBAC1C,OAAO;gBACT,IAAI,cAAc,CAAC,qBAAqB,CAAC,EAAE;oBACzC,IAAI,GAAG,qBAAqB,CAAC;oBAC7B,MAAM;iBACP;gBACD,qBAAqB,GAAG,qBAAqB,CAAC,iBAAiB,CAAC;gBAChE,IAAI,qBAAqB,KAAK,UAAU;oBACtC,MAAM;aACT;SACF;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,mCAAmC,CAAC,KAAoB,EAAE,YAA0B;QAChG,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,cAAc,GAAG,CAAC,IAAc,EAAW,EAAE;YACjD,OAAO,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACvF,CAAC,CAAC;QACF,MAAM,sBAAsB,GAAG,CAAC,IAAc,EAAE,OAAe,EAAE,EAAE;YACjE,IAAI,OAAO,KAAK,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,mCAAmC,CAAC,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,sBAAsB,CAAC,CAAC;SACnG;QACD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAjRD,kDAiRC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, HalfEdgeToBooleanFunction, NodeToNumberFunction } from \"./Graph\";\nimport { SignedDataSummary } from \"./SignedDataSummary\";\nimport { XYParitySearchContext } from \"./XYParitySearchContext\";\n\n/**\n * Interface for an object that executes boolean tests on edges.\n */\nexport interface HalfEdgeTestObject {\n  testEdge(h: HalfEdge): boolean;\n}\n/**\n */\nexport class HalfEdgeMaskTester {\n  private _targetMask: HalfEdgeMask;\n  private _targetValue: boolean;\n  /**\n   *\n   * @param mask mask to test in `testEdge` function\n   * @param targetValue value to match for true return\n   */\n  public constructor(mask: HalfEdgeMask, targetValue: boolean = true) {\n    this._targetMask = mask;\n    this._targetValue = targetValue;\n  }\n  /** Return true if the value of the targetMask matches the targetValue */\n  public testEdge(edge: HalfEdge): boolean {\n    return edge.isMaskSet(this._targetMask) === this._targetValue;\n  }\n\n}\n// Search services for HalfEdgeGraph\nexport class HalfEdgeGraphSearch {\n\n  /**\n   * * for each node of face, set the mask push to allNodesStack\n   * * push the faceSeed on onePerFaceStack[]\n   */\n  private static pushAndMaskAllNodesInFace(faceSeed: HalfEdge, mask: number, allNodeStack: HalfEdge[], onePerFaceStack: HalfEdge[]) {\n    onePerFaceStack.push(faceSeed);\n    faceSeed.collectAroundFace((node: HalfEdge) => {\n      node.setMask(mask);\n      allNodeStack.push(node);\n    });\n  }\n\n  /**\n   * Search an array of faceSeed nodes for the face with the most negative area.\n   * @param oneCandidateNodePerFace array containing one node from each face to be considered.\n   */\n  public static findMinimumAreaFace(oneCandidateNodePerFace: HalfEdgeGraph | HalfEdge[],\n    faceAreaFunction?: NodeToNumberFunction): HalfEdge {\n    const summary = HalfEdgeGraphSearch.collectFaceAreaSummary(oneCandidateNodePerFace, false, faceAreaFunction);\n    return summary.largestNegativeItem!;\n  }\n  /**\n   * static method for face area computation -- useful as function parameter in collect FaceAreaSummary.\n   * * This simply calls `node.signedFaceArea ()`\n   * @param node instance for signedFaceArea call.\n   */\n  public static signedFaceArea(node: HalfEdge): number { return node.signedFaceArea(); }\n  /**\n   *\n   * Return a summary structure data about face (or other numeric quantity if the caller's areaFunction returns other value)\n   * * The default areaFunction computes area of polygonal face.\n   * * Callers with curved edge graphs must supply their own area function.\n   * @param source graph or array of nodes to examine\n   * @param collectAllNodes flag to pass to the SignedDataSummary constructor to control collection of nodes.\n   * @param areaFunction function to all to obtain area (or other numeric value)\n   */\n  public static collectFaceAreaSummary(source: HalfEdgeGraph | HalfEdge[], collectAllNodes: boolean = false,\n    areaFunction: NodeToNumberFunction = HalfEdgeGraphSearch.signedFaceArea): SignedDataSummary<HalfEdge> {\n    const result = new SignedDataSummary<HalfEdge>(collectAllNodes);\n    let allFaces: HalfEdge[];\n\n    if (source instanceof HalfEdgeGraph)\n      allFaces = source.collectFaceLoops();\n    else\n      allFaces = source;\n\n    for (const node of allFaces) {\n      const area = areaFunction(node);\n      result.announceItem(node, area);\n    }\n    return result;\n  }\n\n  /**\n   * * Test if the graph is triangulated.\n   * * Return false if:\n   *   * Positive area face with more than 3 edges\n   *   * more than 1 negative area face with `allowMultipleNegativeAreaFaces` false\n   * * 2-edge faces are ignored.\n   */\n  public static isTriangulatedCCW(source: HalfEdgeGraph | HalfEdge[], allowMultipleNegativeAreaFaces: boolean = true, numPositiveExceptionsAllowed = 0): boolean {\n    let allFaces: HalfEdge[];\n\n    if (source instanceof HalfEdgeGraph)\n      allFaces = source.collectFaceLoops();\n    else\n      allFaces = source;\n    let numNegative = 0;\n    let numPositiveExceptions = 0;\n    for (const node of allFaces) {\n      const numEdges = node.countEdgesAroundFace();\n      if (numEdges >= 3) {\n        const area = node.signedFaceArea();\n        if (area > 0) {\n          if (numEdges > 3) {\n            numPositiveExceptions++;\n            if (numPositiveExceptions > numPositiveExceptionsAllowed)\n              return false;\n          }\n        } else {\n          numNegative++;\n          if (numNegative > 1) {\n            if (!allowMultipleNegativeAreaFaces)\n              return false;\n          }\n        }\n      }\n    }\n    return true;\n  }\n\n  /**\n   * Search to all accessible faces from given seed.\n   * * The returned array contains one representative node in each face of the connected component.\n   * * If (nonnull) parity mask is given, on return:\n   *    * It is entirely set or entirely clear around each face\n   *    * It is entirely set on all faces that are an even number of face-to-face steps away from the seed.\n   *    * It is entirely clear on all faces that are an odd number of face-to-face steps away from the seed.\n   * @param seedEdge first edge to search.\n   * @param visitMask mask applied to all faces as visited.\n   * @param parityMask mask to apply (a) to first face, (b) to faces with alternating parity during the search.\n   */\n  private static parityFloodFromSeed(seedEdge: HalfEdge, visitMask: HalfEdgeMask, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask: HalfEdgeMask): HalfEdge[] {\n    const faces: HalfEdge[] = [];\n    if (seedEdge.isMaskSet(visitMask)) return faces; // empty\n\n    const allMasks = parityMask | visitMask;\n    const stack: HalfEdge[] = [];\n    // arbitrarily call the seed face exterior ... others will alternate as visited.\n    HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(seedEdge, allMasks, stack, faces);  // Start with exterior as mask\n    while (stack.length > 0) {\n      const p = stack.pop()!;\n      const mate = p.edgeMate;\n      if (!mate)\n        continue;\n      if (!mate.isMaskSet(visitMask)) {\n        let newState = p.isMaskSet(parityMask);\n        if (!parityEdgeTester || parityEdgeTester.testEdge(p))\n          newState = !newState;\n        HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(mate, newState ? allMasks : visitMask, stack, faces);\n      }\n    }\n    return faces;\n  }\n  /**\n   * * Search the given faces for the one with the minimum area.\n   * * If the mask in that face is OFF, toggle it on (all half edges of) all the faces.\n   * * In a properly merged planar subdivision there should be only one true negative area face per component.\n   * @param graph parent graph\n   * @param parityMask mask which was previously set with alternating parity, but with an arbitrary start face.\n   * @param faces array of faces to search.\n   */\n  private static correctParityInSingleComponent(_graph: HalfEdgeGraph, mask: HalfEdgeMask, faces: HalfEdge[]) {\n    const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(faces);\n    if (!exteriorHalfEdge) {\n    } else if (exteriorHalfEdge.isMaskSet(mask)) {\n      // all should be well .. nothing to do.\n    } else {\n      // TOGGLE around the face (assuming all are consistent with the seed)\n      for (const faceSeed of faces) {\n        if (faceSeed.isMaskSet(mask)) {\n          faceSeed.clearMaskAroundFace(mask);\n        } else {\n          faceSeed.setMaskAroundFace(mask);\n        }\n      }\n    }\n  }\n  /** Apply correctParityInSingleComponent to each array in components. (Quick exit if mask in NULL_MASK) */\n  private static correctParityInComponentArrays(graph: HalfEdgeGraph, mask: HalfEdgeMask, components: HalfEdge[][]) {\n    if (mask === HalfEdgeMask.NULL_MASK)\n      return;\n    for (const facesInComponent of components)\n      HalfEdgeGraphSearch.correctParityInSingleComponent(graph, mask, facesInComponent);\n  }\n  /**\n   * Collect arrays gathering faces by connected component.\n   * @param graph graph to inspect\n   * @param parityEdgeTester (optional) function to test if an edge is a parity change (e.g., a boundary edge).\n   * @param parityMask (optional, along with parityEdgeTester) mask to apply indicating parity.  If this is Mask.NULL_MASK, there is no record of parity.\n   */\n  public static collectConnectedComponentsWithExteriorParityMasks(graph: HalfEdgeGraph, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask: HalfEdgeMask = HalfEdgeMask.NULL_MASK): HalfEdge[][] {\n    const components = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    const allMasks = parityMask | visitMask;\n    graph.clearMask(allMasks);\n    for (const faceSeed of graph.allHalfEdges) {\n      if (!faceSeed.isMaskSet(HalfEdgeMask.VISITED)) {\n        const newFaces = HalfEdgeGraphSearch.parityFloodFromSeed(faceSeed, visitMask, parityEdgeTester, parityMask);\n        components.push(newFaces);\n      }\n    }\n    HalfEdgeGraphSearch.correctParityInComponentArrays(graph, parityMask, components);\n    return components;\n  }\n  /**\n   * Test if (x,y) is inside (1), on an edge (0) or outside (-1) a face.\n   * @param seedNode any node on the face loop\n   * @param x x coordinate of test point.\n   * @param y y coordinate of test point.\n   */\n  public static pointInOrOnFaceXY(seedNode: HalfEdge, x: number, y: number): number | undefined {\n    const context = new XYParitySearchContext(x, y);\n    // walk around looking for an accepted node to start the search (seedNode is usually ok!)\n    let nodeA = seedNode;\n    let nodeB = seedNode.faceSuccessor;\n    for (; ; nodeA = nodeB) {\n      if (context.tryStartEdge(nodeA.x, nodeA.y, nodeB.x, nodeB.y))\n        break;\n      if (nodeB === seedNode) {\n        // umm.. the face is all on the x axis?\n        return context.classifyCounts();\n      }\n      nodeB = nodeA.faceSuccessor;\n    }\n\n    // nodeB is the real start node for search ... emit ends of each edge around the face,\n    //   stopping after emitting nodeB as an edge end.\n    let node = nodeB.faceSuccessor;\n    for (; ;) {\n      if (!context.advance(node.x, node.y)) {\n        return context.classifyCounts();\n      }\n      if (node === nodeB)\n        break;\n      node = node.faceSuccessor;\n    }\n    return context.classifyCounts();\n  }\n  /**\n   * Announce nodes that are \"extended face boundary\" by conditions (usually mask of node and mate) in test functions.\n   * * After each node, the next candidate in reached by looking \"around the head vertex loop\" for the next boundary.\n   *   * \"Around the vertex\" from nodeA means\n   *      * First look at nodeA.faceSuccessor;\n   *      * Then look at vertexPredecessor around that vertex loop.\n   * * Each accepted node is passed to announceNode, and marked with the visit mask.\n   * * The counter of the announceEdge function is zero for the first edge, then increases with each edge.\n   * @param seed start node.\n   * @param isBoundaryEdge\n   * @param announceEdge\n   */\n  public static collectExtendedBoundaryLoopFromSeed(seed: HalfEdge, visitMask: HalfEdgeMask, isBoundaryEdge: HalfEdgeToBooleanFunction,\n    announceEdge: (edge: HalfEdge, counter: number) => void) {\n    let counter = 0;\n    while (!seed.getMask(visitMask) && isBoundaryEdge(seed)) {\n      announceEdge(seed, counter++);\n      seed.setMask(visitMask);\n      const vertexBase = seed.faceSuccessor;\n      let candidateAroundVertex = vertexBase;\n      for (; ;) {\n        if (candidateAroundVertex.getMask(visitMask))\n          return;\n        if (isBoundaryEdge(candidateAroundVertex)) {\n          seed = candidateAroundVertex;\n          break;\n        }\n        candidateAroundVertex = candidateAroundVertex.vertexPredecessor;\n        if (candidateAroundVertex === vertexBase)\n          break;\n      }\n    }\n  }\n  /**\n   * Collect arrays of nodes \"around the boundary\" of a graph with extraneous (non-boundary) edges.\n   * * The \"boundary\" is nodes that do NOT have the exterior mask, but whose mates DO have the exterior mask.\n   * * After each node, the next candidate in reached by looking \"around the head vertex loop\" for the next boundary.\n   *   * \"Around the vertex\" from nodeA means\n   *      * First look at nodeA.faceSuccessor;\n   *      * Then look at vertexPredecessor around that vertex loop.\n   * * Each accepted node is passed to announceNode, and marked with the visit mask.\n   * @param seed start node.\n   * @param isBoundaryNode\n   * @param announceNode\n   */\n  public static collectExtendedBoundaryLoopsInGraph(graph: HalfEdgeGraph, exteriorMask: HalfEdgeMask): HalfEdge[][] {\n    const loops: HalfEdge[][] = [];\n    const visitMask = graph.grabMask(true);\n    const isBoundaryEdge = (edge: HalfEdge): boolean => {\n      return edge.getMask(exteriorMask) === 0 && edge.edgeMate.getMask(exteriorMask) !== 0;\n    };\n    const announceEdgeInBoundary = (edge: HalfEdge, counter: number) => {\n      if (counter === 0)\n        loops.push([]);\n      loops[loops.length - 1].push(edge);\n    };\n    for (const seed of graph.allHalfEdges) {\n      this.collectExtendedBoundaryLoopFromSeed(seed, visitMask, isBoundaryEdge, announceEdgeInBoundary);\n    }\n    graph.dropMask(visitMask);\n    return loops;\n  }\n}\n"]}

package/lib/esm/geometry3d/PolygonOps.d.ts

@@ -95,7 +95,7 @@ export declare class CutLoopMergeContext {
 export declare class PolygonOps {
     /** Sum areas of triangles from points[0] to each far edge.
      * * Consider triangles from points[0] to each edge.
-     * * Sum the areas(absolute, without regard to orientation) all these triangles.
+     * * Sum the absolute areas (without regard to orientation) all these triangles.
      * @returns sum of absolute triangle areas.
      */
     static sumTriangleAreas(points: Point3d[] | GrowableXYZArray): number;
@@ -108,8 +108,8 @@ export declare class PolygonOps {
     static sumTriangleAreasPerpendicularToUpVector(points: Point3d[] | GrowableXYZArray, upVector: Vector3d): number;
     /** Sum areas of triangles from points[0] to each far edge.
      * * Consider triangles from points[0] to each edge.
-     * * Sum the areas(absolute, without regard to orientation) all these triangles.
-     * @returns sum of absolute triangle areas.
+     * * Sum the signed areas of all these triangles. (An area can be negative at a concave corner.)
+     * @returns sum of signed triangle areas.
      */
     static sumTriangleAreasXY(points: Point3d[]): number;
     /** These values are the integrated area moment products [xx,xy,xz, x]

package/lib/esm/geometry3d/PolygonOps.js

@@ -201,7 +201,7 @@ export class CutLoopMergeContext {
 export class PolygonOps {
     /** Sum areas of triangles from points[0] to each far edge.
      * * Consider triangles from points[0] to each edge.
-     * * Sum the areas(absolute, without regard to orientation) all these triangles.
+     * * Sum the absolute areas (without regard to orientation) all these triangles.
      * @returns sum of absolute triangle areas.
      */
     static sumTriangleAreas(points) {
@@ -265,8 +265,8 @@ export class PolygonOps {
     }
     /** Sum areas of triangles from points[0] to each far edge.
      * * Consider triangles from points[0] to each edge.
-     * * Sum the areas(absolute, without regard to orientation) all these triangles.
-     * @returns sum of absolute triangle areas.
+     * * Sum the signed areas of all these triangles. (An area can be negative at a concave corner.)
+     * @returns sum of signed triangle areas.
      */
     static sumTriangleAreasXY(points) {
         let s = 0.0;