@itwin/core-geometry 5.2.0-dev.7 → 5.3.0-dev.1

package/lib/cjs/polyface/RangeTree/Point3dArrayRangeTreeContext.d.ts

@@ -2,7 +2,7 @@
  * @module RangeSearch
  */
 import { CurveLocationDetail, CurveLocationDetailPair } from "../../curve/CurveLocationDetail";
-import { Point3d } from "../../geometry3d/Point3dVector3d";
+import { XAndY, XYAndZ } from "../../geometry3d/XYZProps";
 /**
  * Handler class for searching a range tree containing unordered Point3d data.
  * * Facilitates multiple searches for closest point and close approach calculations.
@@ -10,7 +10,7 @@ import { Point3d } from "../../geometry3d/Point3dVector3d";
  */
 export declare class Point3dArrayRangeTreeContext {
     /** Array of points being searched, indexed by the range tree */
-    points: Point3d[];
+    points: XYAndZ[];
     /** Diagnostic: number of range tests returned true */
     numRangeTestTrue: number;
     /** Diagnostic: number of range tests returned false */
@@ -19,6 +19,8 @@ export declare class Point3dArrayRangeTreeContext {
     numPointTest: number;
     /** Diagnostic: number of searches */
     numSearch: number;
+    /** Whether to compute xy-distances, ignoring z-coordinates of points. */
+    xyOnly?: boolean;
     /** range tree, whose appData are indices into the points array */
     private _rangeTreeRoot;
     /** Constructor: capture inputs, initialize debug counters */
@@ -27,11 +29,12 @@ export declare class Point3dArrayRangeTreeContext {
      * Create a range tree context with given points:
      * * initialize with single-point ranges
      * * appData are point indices
-     * @param points captured
+     * @param points reference captured
      * @param maxChildPerNode maximum children per range tree node (default 4)
      * @param maxAppDataPerLeaf maximum point indices per leaf node (default 4)
+     * @param xyOnly whether to compute xy-distances, ignoring z-coordinates of points
      */
-    static createCapture(points: Point3d[], maxChildPerNode?: number, maxAppDataPerLeaf?: number): Point3dArrayRangeTreeContext | undefined;
+    static createCapture(points: XYAndZ[], maxChildPerNode?: number, maxAppDataPerLeaf?: number, xyOnly?: boolean): Point3dArrayRangeTreeContext | undefined;
     /**
      * Search the range tree for closest point(s) to spacePoint.
      * @param spacePoint point to test
@@ -41,7 +44,7 @@ export declare class Point3dArrayRangeTreeContext {
      * * detail.fraction = the index of the closest point in the points array
      * * detail.a = distance from spacePoint to closest point
      */
-    searchForClosestPoint(spacePoint: Point3d, maxDist?: number): CurveLocationDetail | CurveLocationDetail[] | undefined;
+    searchForClosestPoint(spacePoint: XAndY | XYAndZ, maxDist?: number): CurveLocationDetail | CurveLocationDetail[] | undefined;
     /**
      * Search the range trees for closest approach(es) between the point arrays.
      * @param contextA first point array context

package/lib/cjs/polyface/RangeTree/Point3dArrayRangeTreeContext.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Point3dArrayRangeTreeContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/Point3dArrayRangeTreeContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAC/F,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAO3D;;;;GAIG;AACH,qBAAa,4BAA4B;IACvC,gEAAgE;IACzD,MAAM,EAAE,OAAO,EAAE,CAAC;IAEzB,sDAAsD;IAC/C,gBAAgB,EAAE,MAAM,CAAC;IAChC,uDAAuD;IAChD,iBAAiB,EAAE,MAAM,CAAC;IACjC,iDAAiD;IAC1C,YAAY,EAAE,MAAM,CAAC;IAC5B,qCAAqC;IAC9B,SAAS,EAAE,MAAM,CAAC;IAEzB,kEAAkE;IAClE,OAAO,CAAC,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,OAAO;IAQP;;;;;;;OAOG;WACW,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,eAAe,GAAE,MAAU,EAAE,iBAAiB,GAAE,MAAU,GAAG,4BAA4B,GAAG,SAAS;IAUpJ;;;;;;;;OAQG;IACI,qBAAqB,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,mBAAmB,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAM5H;;;;;;;;;MASE;WACY,wBAAwB,CAAC,QAAQ,EAAE,4BAA4B,EAAE,QAAQ,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,uBAAuB,GAAG,uBAAuB,EAAE,GAAG,SAAS;CAK1M"}
+{"version":3,"file":"Point3dArrayRangeTreeContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/Point3dArrayRangeTreeContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAE/F,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAM1D;;;;GAIG;AACH,qBAAa,4BAA4B;IACvC,gEAAgE;IACzD,MAAM,EAAE,MAAM,EAAE,CAAC;IAExB,sDAAsD;IAC/C,gBAAgB,EAAE,MAAM,CAAC;IAChC,uDAAuD;IAChD,iBAAiB,EAAE,MAAM,CAAC;IACjC,iDAAiD;IAC1C,YAAY,EAAE,MAAM,CAAC;IAC5B,qCAAqC;IAC9B,SAAS,EAAE,MAAM,CAAC;IACzB,yEAAyE;IAClE,MAAM,CAAC,EAAE,OAAO,CAAC;IAExB,kEAAkE;IAClE,OAAO,CAAC,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,OAAO;IASP;;;;;;;;OAQG;WACW,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,eAAe,GAAE,MAAU,EAAE,iBAAiB,GAAE,MAAU,EAAE,MAAM,GAAE,OAAe,GAAG,4BAA4B,GAAG,SAAS;IAU5K;;;;;;;;OAQG;IACI,qBAAqB,CAAC,UAAU,EAAE,KAAK,GAAG,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,mBAAmB,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAMnI;;;;;;;;;MASE;WACY,wBAAwB,CAAC,QAAQ,EAAE,4BAA4B,EAAE,QAAQ,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,uBAAuB,GAAG,uBAAuB,EAAE,GAAG,SAAS;CAK1M"}

package/lib/cjs/polyface/RangeTree/Point3dArrayRangeTreeContext.js

@@ -27,28 +27,32 @@ class Point3dArrayRangeTreeContext {
     numPointTest;
     /** Diagnostic: number of searches */
     numSearch;
+    /** Whether to compute xy-distances, ignoring z-coordinates of points. */
+    xyOnly;
     /** range tree, whose appData are indices into the points array */
     _rangeTreeRoot;
     /** Constructor: capture inputs, initialize debug counters */
-    constructor(rangeTreeRoot, points) {
+    constructor(rangeTreeRoot, points, xyOnly) {
         this.points = points;
         this._rangeTreeRoot = rangeTreeRoot;
         this.numRangeTestTrue = 0;
         this.numRangeTestFalse = 0;
         this.numPointTest = 0;
         this.numSearch = 0;
+        this.xyOnly = xyOnly;
     }
     /**
      * Create a range tree context with given points:
      * * initialize with single-point ranges
      * * appData are point indices
-     * @param points captured
+     * @param points reference captured
      * @param maxChildPerNode maximum children per range tree node (default 4)
      * @param maxAppDataPerLeaf maximum point indices per leaf node (default 4)
+     * @param xyOnly whether to compute xy-distances, ignoring z-coordinates of points
      */
-    static createCapture(points, maxChildPerNode = 4, maxAppDataPerLeaf = 4) {
+    static createCapture(points, maxChildPerNode = 4, maxAppDataPerLeaf = 4, xyOnly = false) {
         const rangeTreeRoot = RangeTreeNode_1.RangeTreeOps.createByIndexSplits(((index) => { return Range_1.Range3d.create(points[index]); }), ((index) => { return index; }), points.length, maxChildPerNode, maxAppDataPerLeaf);
-        return rangeTreeRoot ? new Point3dArrayRangeTreeContext(rangeTreeRoot, points) : undefined;
+        return rangeTreeRoot ? new Point3dArrayRangeTreeContext(rangeTreeRoot, points, xyOnly) : undefined;
     }
     /**
      * Search the range tree for closest point(s) to spacePoint.

package/lib/cjs/polyface/RangeTree/Point3dArrayRangeTreeContext.js.map

@@ -1 +1 @@
-{"version":3,"file":"Point3dArrayRangeTreeContext.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/Point3dArrayRangeTreeContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAIH,kDAAiD;AACjD,mDAA8D;AAC9D,uEAEmC;AAEnC;;;;GAIG;AACH,MAAa,4BAA4B;IACvC,gEAAgE;IACzD,MAAM,CAAY;IAEzB,sDAAsD;IAC/C,gBAAgB,CAAS;IAChC,uDAAuD;IAChD,iBAAiB,CAAS;IACjC,iDAAiD;IAC1C,YAAY,CAAS;IAC5B,qCAAqC;IAC9B,SAAS,CAAS;IAEzB,kEAAkE;IAC1D,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,YAAoB,aAAoC,EAAE,MAAiB;QACzE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,aAAa,CAAC,MAAiB,EAAE,kBAA0B,CAAC,EAAE,oBAA4B,CAAC;QACvG,MAAM,aAAa,GAAG,4BAAY,CAAC,mBAAmB,CACpD,CAAC,CAAC,KAAa,EAAW,EAAE,GAAG,OAAO,eAAO,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACvE,CAAC,CAAC,KAAa,EAAU,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAC9C,MAAM,CAAC,MAAM,EACb,eAAe,EACf,iBAAiB,CAClB,CAAC;QACF,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7F,CAAC;IACD;;;;;;;;OAQG;IACI,qBAAqB,CAAC,UAAmB,EAAE,OAAgB;QAChE,MAAM,OAAO,GAAG,IAAI,uEAA6C,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC7F,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC3C,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,CAAC;IACD;;;;;;;;;MASE;IACK,MAAM,CAAC,wBAAwB,CAAC,QAAsC,EAAE,QAAsC,EAAE,OAAgB;QACrI,MAAM,OAAO,GAAG,IAAI,sFAA4D,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9G,6BAAa,CAAC,qBAAqB,CAAC,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAC/F,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,CAAC;CACF;AAzED,oEAyEC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module RangeSearch\n */\n\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../../curve/CurveLocationDetail\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { RangeTreeNode, RangeTreeOps } from \"./RangeTreeNode\";\nimport {\n  SingleTreeSearchHandlerForClosestPointInArray, TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach,\n} from \"./RangeTreeSearchHandlers\";\n\n/**\n * Handler class for searching a range tree containing unordered Point3d data.\n * * Facilitates multiple searches for closest point and close approach calculations.\n * @public\n */\nexport class Point3dArrayRangeTreeContext {\n  /** Array of points being searched, indexed by the range tree */\n  public points: Point3d[];\n\n  /** Diagnostic: number of range tests returned true */\n  public numRangeTestTrue: number;\n  /** Diagnostic: number of range tests returned false */\n  public numRangeTestFalse: number;\n  /** Diagnostic: number of point distance tests */\n  public numPointTest: number;\n  /** Diagnostic: number of searches */\n  public numSearch: number;\n\n  /** range tree, whose appData are indices into the points array */\n  private _rangeTreeRoot: RangeTreeNode<number>;\n\n  /** Constructor: capture inputs, initialize debug counters */\n  private constructor(rangeTreeRoot: RangeTreeNode<number>, points: Point3d[]) {\n    this.points = points;\n    this._rangeTreeRoot = rangeTreeRoot;\n    this.numRangeTestTrue = 0;\n    this.numRangeTestFalse = 0;\n    this.numPointTest = 0;\n    this.numSearch = 0;\n  }\n  /**\n   * Create a range tree context with given points:\n   * * initialize with single-point ranges\n   * * appData are point indices\n   * @param points captured\n   * @param maxChildPerNode maximum children per range tree node (default 4)\n   * @param maxAppDataPerLeaf maximum point indices per leaf node (default 4)\n   */\n  public static createCapture(points: Point3d[], maxChildPerNode: number = 4, maxAppDataPerLeaf: number = 4): Point3dArrayRangeTreeContext | undefined {\n    const rangeTreeRoot = RangeTreeOps.createByIndexSplits<number>(\n      ((index: number): Range3d => { return Range3d.create(points[index]); }),\n      ((index: number): number => { return index; }),\n      points.length,\n      maxChildPerNode,\n      maxAppDataPerLeaf,\n    );\n    return rangeTreeRoot ? new Point3dArrayRangeTreeContext(rangeTreeRoot, points) : undefined;\n  }\n  /**\n   * Search the range tree for closest point(s) to spacePoint.\n   * @param spacePoint point to test\n   * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.\n   * @return closest point detail(s) with following fields set:\n   * * detail.point = the closest point\n   * * detail.fraction = the index of the closest point in the points array\n   * * detail.a = distance from spacePoint to closest point\n   */\n  public searchForClosestPoint(spacePoint: Point3d, maxDist?: number): CurveLocationDetail | CurveLocationDetail[] | undefined {\n    const handler = new SingleTreeSearchHandlerForClosestPointInArray(spacePoint, this, maxDist);\n    this.numSearch++;\n    this._rangeTreeRoot.searchTopDown(handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n  /**\n   * Search the range trees for closest approach(es) between the point arrays.\n   * @param contextA first point array context\n   * @param contextB second point array context\n   * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.\n   * @return closest approach detail pair(s), one per context, each with the following fields set:\n   * * detail.point = the point at closest approach\n   * * detail.fraction = the index of detail.point in the points array\n   * * detail.a = the closest approach distance\n  */\n  public static searchForClosestApproach(contextA: Point3dArrayRangeTreeContext, contextB: Point3dArrayRangeTreeContext, maxDist?: number): CurveLocationDetailPair | CurveLocationDetailPair[] | undefined {\n    const handler = new TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach(contextA, contextB, maxDist);\n    RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n}\n\n"]}
+{"version":3,"file":"Point3dArrayRangeTreeContext.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/Point3dArrayRangeTreeContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,kDAAiD;AAEjD,mDAA8D;AAC9D,uEAEmC;AAEnC;;;;GAIG;AACH,MAAa,4BAA4B;IACvC,gEAAgE;IACzD,MAAM,CAAW;IAExB,sDAAsD;IAC/C,gBAAgB,CAAS;IAChC,uDAAuD;IAChD,iBAAiB,CAAS;IACjC,iDAAiD;IAC1C,YAAY,CAAS;IAC5B,qCAAqC;IAC9B,SAAS,CAAS;IACzB,yEAAyE;IAClE,MAAM,CAAW;IAExB,kEAAkE;IAC1D,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,YAAoB,aAAoC,EAAE,MAAgB,EAAE,MAAe;QACzF,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,aAAa,CAAC,MAAgB,EAAE,kBAA0B,CAAC,EAAE,oBAA4B,CAAC,EAAE,SAAkB,KAAK;QAC/H,MAAM,aAAa,GAAG,4BAAY,CAAC,mBAAmB,CACpD,CAAC,CAAC,KAAa,EAAW,EAAE,GAAG,OAAO,eAAO,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACvE,CAAC,CAAC,KAAa,EAAU,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAC9C,MAAM,CAAC,MAAM,EACb,eAAe,EACf,iBAAiB,CAClB,CAAC;QACF,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,4BAA4B,CAAC,aAAa,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD;;;;;;;;OAQG;IACI,qBAAqB,CAAC,UAA0B,EAAE,OAAgB;QACvE,MAAM,OAAO,GAAG,IAAI,uEAA6C,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC7F,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC3C,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,CAAC;IACD;;;;;;;;;MASE;IACK,MAAM,CAAC,wBAAwB,CAAC,QAAsC,EAAE,QAAsC,EAAE,OAAgB;QACrI,MAAM,OAAO,GAAG,IAAI,sFAA4D,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9G,6BAAa,CAAC,qBAAqB,CAAC,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAC/F,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,CAAC;CACF;AA7ED,oEA6EC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module RangeSearch\n */\n\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../../curve/CurveLocationDetail\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { XAndY, XYAndZ } from \"../../geometry3d/XYZProps\";\nimport { RangeTreeNode, RangeTreeOps } from \"./RangeTreeNode\";\nimport {\n  SingleTreeSearchHandlerForClosestPointInArray, TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach,\n} from \"./RangeTreeSearchHandlers\";\n\n/**\n * Handler class for searching a range tree containing unordered Point3d data.\n * * Facilitates multiple searches for closest point and close approach calculations.\n * @public\n */\nexport class Point3dArrayRangeTreeContext {\n  /** Array of points being searched, indexed by the range tree */\n  public points: XYAndZ[];\n\n  /** Diagnostic: number of range tests returned true */\n  public numRangeTestTrue: number;\n  /** Diagnostic: number of range tests returned false */\n  public numRangeTestFalse: number;\n  /** Diagnostic: number of point distance tests */\n  public numPointTest: number;\n  /** Diagnostic: number of searches */\n  public numSearch: number;\n  /** Whether to compute xy-distances, ignoring z-coordinates of points. */\n  public xyOnly?: boolean;\n\n  /** range tree, whose appData are indices into the points array */\n  private _rangeTreeRoot: RangeTreeNode<number>;\n\n  /** Constructor: capture inputs, initialize debug counters */\n  private constructor(rangeTreeRoot: RangeTreeNode<number>, points: XYAndZ[], xyOnly: boolean) {\n    this.points = points;\n    this._rangeTreeRoot = rangeTreeRoot;\n    this.numRangeTestTrue = 0;\n    this.numRangeTestFalse = 0;\n    this.numPointTest = 0;\n    this.numSearch = 0;\n    this.xyOnly = xyOnly;\n  }\n  /**\n   * Create a range tree context with given points:\n   * * initialize with single-point ranges\n   * * appData are point indices\n   * @param points reference captured\n   * @param maxChildPerNode maximum children per range tree node (default 4)\n   * @param maxAppDataPerLeaf maximum point indices per leaf node (default 4)\n   * @param xyOnly whether to compute xy-distances, ignoring z-coordinates of points\n   */\n  public static createCapture(points: XYAndZ[], maxChildPerNode: number = 4, maxAppDataPerLeaf: number = 4, xyOnly: boolean = false): Point3dArrayRangeTreeContext | undefined {\n    const rangeTreeRoot = RangeTreeOps.createByIndexSplits<number>(\n      ((index: number): Range3d => { return Range3d.create(points[index]); }),\n      ((index: number): number => { return index; }),\n      points.length,\n      maxChildPerNode,\n      maxAppDataPerLeaf,\n    );\n    return rangeTreeRoot ? new Point3dArrayRangeTreeContext(rangeTreeRoot, points, xyOnly) : undefined;\n  }\n  /**\n   * Search the range tree for closest point(s) to spacePoint.\n   * @param spacePoint point to test\n   * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.\n   * @return closest point detail(s) with following fields set:\n   * * detail.point = the closest point\n   * * detail.fraction = the index of the closest point in the points array\n   * * detail.a = distance from spacePoint to closest point\n   */\n  public searchForClosestPoint(spacePoint: XAndY | XYAndZ, maxDist?: number): CurveLocationDetail | CurveLocationDetail[] | undefined {\n    const handler = new SingleTreeSearchHandlerForClosestPointInArray(spacePoint, this, maxDist);\n    this.numSearch++;\n    this._rangeTreeRoot.searchTopDown(handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n  /**\n   * Search the range trees for closest approach(es) between the point arrays.\n   * @param contextA first point array context\n   * @param contextB second point array context\n   * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.\n   * @return closest approach detail pair(s), one per context, each with the following fields set:\n   * * detail.point = the point at closest approach\n   * * detail.fraction = the index of detail.point in the points array\n   * * detail.a = the closest approach distance\n  */\n  public static searchForClosestApproach(contextA: Point3dArrayRangeTreeContext, contextB: Point3dArrayRangeTreeContext, maxDist?: number): CurveLocationDetailPair | CurveLocationDetailPair[] | undefined {\n    const handler = new TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach(contextA, contextB, maxDist);\n    RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n}\n\n"]}

package/lib/cjs/polyface/RangeTree/PolyfaceRangeTreeContext.d.ts

@@ -1,7 +1,7 @@
 /** @packageDocumentation
  * @module RangeSearch
  */
-import { Point3d } from "../../geometry3d/Point3dVector3d";
+import { XAndY, XYAndZ } from "../../geometry3d/XYZProps";
 import { FacetLocationDetail, FacetLocationDetailPair } from "../FacetLocationDetail";
 import { Polyface, PolyfaceVisitor } from "../Polyface";
 /**
@@ -39,11 +39,11 @@ export declare class PolyfaceRangeTreeContext {
     /**
      * Search the range tree for closest facet(s) to spacePoint.
      * @param spacePoint point to test
-     * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.
+     * @param maxDist collect facet locations at no more than this distance from spacePoint. If undefined, return only the closest facet location.
      * @param searchFacetInterior whether to include facet interiors in search. Default is false: just consider facet boundaries.
      * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point
      */
-    searchForClosestPoint(spacePoint: Point3d, maxDist?: number, searchFacetInterior?: boolean): FacetLocationDetail | FacetLocationDetail[] | undefined;
+    searchForClosestPoint(spacePoint: XYAndZ | XAndY, maxDist?: number, searchFacetInterior?: boolean): FacetLocationDetail | FacetLocationDetail[] | undefined;
     /**
      * Search the range trees for closest approach(es) between the polyfaces.
      * @param contextA first polyface context

package/lib/cjs/polyface/RangeTree/PolyfaceRangeTreeContext.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PolyfaceRangeTreeContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/PolyfaceRangeTreeContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAE3D,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAKxD;;;;GAIG;AACH,qBAAa,wBAAwB;IACnC,8CAA8C;IACvC,OAAO,EAAE,eAAe,CAAC;IAChC,0DAA0D;IACnD,YAAY,EAAE,OAAO,CAAC;IAE7B,iEAAiE;IAC1D,gBAAgB,EAAE,MAAM,CAAC;IAChC,sEAAsE;IAC/D,iBAAiB,EAAE,MAAM,CAAC;IACjC,yCAAyC;IAClC,YAAY,EAAE,MAAM,CAAC;IAC5B,gDAAgD;IACzC,SAAS,EAAE,MAAM,CAAC;IAEzB,yDAAyD;IACzD,OAAO,CAAC,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,OAAO;IASP;;;;;;;;OAQG;WACW,aAAa,CAAC,OAAO,EAAE,QAAQ,GAAG,eAAe,EAAE,eAAe,GAAE,MAAU,EAAE,iBAAiB,GAAE,MAAU,EAAE,YAAY,GAAE,OAAe,GAAG,wBAAwB,GAAG,SAAS;IAajM;;;;;;OAMG;IACI,qBAAqB,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe,GAAG,mBAAmB,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAclK;;;;;;;MAOE;WACY,wBAAwB,CAAC,QAAQ,EAAE,wBAAwB,EAAE,QAAQ,EAAE,wBAAwB,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe,GAAG,uBAAuB,GAAG,uBAAuB,EAAE,GAAG,SAAS;CAKxO"}
+{"version":3,"file":"PolyfaceRangeTreeContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/PolyfaceRangeTreeContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAKxD;;;;GAIG;AACH,qBAAa,wBAAwB;IACnC,8CAA8C;IACvC,OAAO,EAAE,eAAe,CAAC;IAChC,0DAA0D;IACnD,YAAY,EAAE,OAAO,CAAC;IAE7B,iEAAiE;IAC1D,gBAAgB,EAAE,MAAM,CAAC;IAChC,sEAAsE;IAC/D,iBAAiB,EAAE,MAAM,CAAC;IACjC,yCAAyC;IAClC,YAAY,EAAE,MAAM,CAAC;IAC5B,gDAAgD;IACzC,SAAS,EAAE,MAAM,CAAC;IAEzB,yDAAyD;IACzD,OAAO,CAAC,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,OAAO;IASP;;;;;;;;OAQG;WACW,aAAa,CAAC,OAAO,EAAE,QAAQ,GAAG,eAAe,EAAE,eAAe,GAAE,MAAU,EAAE,iBAAiB,GAAE,MAAU,EAAE,YAAY,GAAE,OAAe,GAAG,wBAAwB,GAAG,SAAS;IAajM;;;;;;OAMG;IACI,qBAAqB,CAAC,UAAU,EAAE,MAAM,GAAG,KAAK,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe,GAAG,mBAAmB,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAczK;;;;;;;MAOE;WACY,wBAAwB,CAAC,QAAQ,EAAE,wBAAwB,EAAE,QAAQ,EAAE,wBAAwB,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe,GAAG,uBAAuB,GAAG,uBAAuB,EAAE,GAAG,SAAS;CAKxO"}

package/lib/cjs/polyface/RangeTree/PolyfaceRangeTreeContext.js

@@ -62,7 +62,7 @@ class PolyfaceRangeTreeContext {
     /**
      * Search the range tree for closest facet(s) to spacePoint.
      * @param spacePoint point to test
-     * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.
+     * @param maxDist collect facet locations at no more than this distance from spacePoint. If undefined, return only the closest facet location.
      * @param searchFacetInterior whether to include facet interiors in search. Default is false: just consider facet boundaries.
      * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point
      */

package/lib/cjs/polyface/RangeTree/PolyfaceRangeTreeContext.js.map

@@ -1 +1 @@
-{"version":3,"file":"PolyfaceRangeTreeContext.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/PolyfaceRangeTreeContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAA0C;AAI1C,0CAAwD;AACxD,oDAAiD;AACjD,mDAA8D;AAC9D,uEAA6I;AAE7I;;;;GAIG;AACH,MAAa,wBAAwB;IACnC,8CAA8C;IACvC,OAAO,CAAkB;IAChC,0DAA0D;IACnD,YAAY,CAAU;IAE7B,iEAAiE;IAC1D,gBAAgB,CAAS;IAChC,sEAAsE;IAC/D,iBAAiB,CAAS;IACjC,yCAAyC;IAClC,YAAY,CAAS;IAC5B,gDAAgD;IACzC,SAAS,CAAS;IAEzB,yDAAyD;IACjD,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,YAAoB,aAAoC,EAAE,OAAwB,EAAE,eAAwB,KAAK;QAC/G,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,aAAa,CAAC,OAAmC,EAAE,kBAA0B,CAAC,EAAE,oBAA4B,CAAC,EAAE,eAAwB,KAAK;QACxJ,IAAI,OAAO,YAAY,mBAAQ;YAC7B,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,iBAAiB,EAAE,YAAY,CAAC,CAAC;QACxG,MAAM,QAAQ,GAAG,6BAAa,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,aAAa,GAAG,4BAAY,CAAC,mBAAmB,CACpD,CAAC,KAAa,EAAW,EAAE,GAAG,OAAO,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EACvF,CAAC,KAAa,EAAU,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,EAC5C,QAAQ,EACR,eAAe,EACf,iBAAiB,CAClB,CAAC;QACF,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,wBAAwB,CAAC,aAAa,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACxG,CAAC;IACD;;;;;;OAMG;IACI,qBAAqB,CAAC,UAAmB,EAAE,OAAgB,EAAE,sBAA+B,KAAK;QACtG,MAAM,OAAO,GAAG,IAAI,0EAAgD,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,mBAAmB,CAAC,CAAC;QACrH,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,MAAM,QAAQ,GAAG,6BAAa,CAAC,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrE,qHAAqH;QACrH,MAAM,OAAO,GAAG,mBAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC;QAChD,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC1B,OAAO,CAAC,cAAc,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,QAAQ;YACpD,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC3C,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,CAAC;IACD;;;;;;;MAOE;IACK,MAAM,CAAC,wBAAwB,CAAC,QAAkC,EAAE,QAAkC,EAAE,OAAgB,EAAE,sBAA+B,KAAK;QACnK,MAAM,OAAO,GAAG,IAAI,wEAA8C,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,mBAAmB,CAAC,CAAC;QACrH,6BAAa,CAAC,qBAAqB,CAAC,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAC/F,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,CAAC;CACF;AApFD,4DAoFC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module RangeSearch\n */\n\nimport { Geometry } from \"../../Geometry\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { FacetLocationDetail, FacetLocationDetailPair } from \"../FacetLocationDetail\";\nimport { Polyface, PolyfaceVisitor } from \"../Polyface\";\nimport { PolyfaceQuery } from \"../PolyfaceQuery\";\nimport { RangeTreeNode, RangeTreeOps } from \"./RangeTreeNode\";\nimport { SingleTreeSearchHandlerForClosestPointOnPolyface, TwoTreeSearchHandlerForFacetFacetCloseApproach } from \"./RangeTreeSearchHandlers\";\n\n/**\n * Handler class for searching a range tree containing the facets of a polyface.\n * * Facilitates multiple searches for closest point and close approach calculations.\n * @public\n */\nexport class PolyfaceRangeTreeContext {\n  /** Visitor for the polyface being searched */\n  public visitor: PolyfaceVisitor;\n  /** Whether all facets to visit are known to be convex. */\n  public convexFacets: boolean;\n\n  /** Diagnostic: number of range tests that have returned true. */\n  public numRangeTestTrue: number;\n  /** Diagnostic: number of range tests that have been returned false */\n  public numRangeTestFalse: number;\n  /** Diagnostic: number of facet tests. */\n  public numFacetTest: number;\n  /** Diagnostic: number of searches performed. */\n  public numSearch: number;\n\n  /** Range tree, whose appData are facet (read) indices */\n  private _rangeTreeRoot: RangeTreeNode<number>;\n\n  /** Constructor: capture inputs, initialize debug counters */\n  private constructor(rangeTreeRoot: RangeTreeNode<number>, visitor: PolyfaceVisitor, convexFacets: boolean = false) {\n    this.visitor = visitor;\n    this.convexFacets = convexFacets;\n    this._rangeTreeRoot = rangeTreeRoot;\n    this.numRangeTestTrue = 0;\n    this.numRangeTestFalse = 0;\n    this.numFacetTest = 0;\n    this.numSearch = 0;\n  }\n  /**\n   * Create a range tree context for the Polyface facets.\n   * * This is a very simple construction that splits \"right and left parts\" of the facet sequence.\n   * * Facets with any recognizable \"left to right\" or \"top to bottom\" sequencing will have very effective search structures.\n   * @param visitor access to facets, captured if PolyfaceVisitor\n   * @param maxChildPerNode maximum children per range tree node (default 4)\n   * @param maxAppDataPerLeaf maximum facet indices per leaf node (default 4)\n   * @param convexFacets whether all facets are known to be convex (cf. [[PolyfaceQuery.areFacetsConvex]]) (default false)\n   */\n  public static createCapture(visitor: Polyface | PolyfaceVisitor, maxChildPerNode: number = 4, maxAppDataPerLeaf: number = 4, convexFacets: boolean = false): PolyfaceRangeTreeContext | undefined {\n    if (visitor instanceof Polyface)\n      return this.createCapture(visitor.createVisitor(0), maxChildPerNode, maxAppDataPerLeaf, convexFacets);\n    const numFacet = PolyfaceQuery.visitorClientFacetCount(visitor);\n    const rangeTreeRoot = RangeTreeOps.createByIndexSplits<number>(\n      (index: number): Range3d => { visitor.moveToReadIndex(index); return visitor.range(); },\n      (index: number): number => { return index; },\n      numFacet,\n      maxChildPerNode,\n      maxAppDataPerLeaf,\n    );\n    return rangeTreeRoot ? new PolyfaceRangeTreeContext(rangeTreeRoot, visitor, convexFacets) : undefined;\n  }\n  /**\n   * Search the range tree for closest facet(s) to spacePoint.\n   * @param spacePoint point to test\n   * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.\n   * @param searchFacetInterior whether to include facet interiors in search. Default is false: just consider facet boundaries.\n   * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point\n   */\n  public searchForClosestPoint(spacePoint: Point3d, maxDist?: number, searchFacetInterior: boolean = false): FacetLocationDetail | FacetLocationDetail[] | undefined {\n    const handler = new SingleTreeSearchHandlerForClosestPointOnPolyface(spacePoint, this, maxDist, searchFacetInterior);\n    this.numSearch++;\n    const numFacet = PolyfaceQuery.visitorClientFacetCount(this.visitor);\n    // seed the search with a few points -- this reduces early trips deep into early ranges that are far from spacePoint.\n    const numTest = Geometry.clamp(Math.floor(numFacet / 20), 2, 7);\n    const testStep = Math.floor(numFacet / numTest);\n    handler.processAppData(0);\n    handler.processAppData(numFacet - 1);\n    for (let i = testStep; i + 1 < numFacet; i += testStep)\n      handler.processAppData(i);\n    this._rangeTreeRoot.searchTopDown(handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n  /**\n   * Search the range trees for closest approach(es) between the polyfaces.\n   * @param contextA first polyface context\n   * @param contextB second polyface context\n   * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.\n   * @param searchFacetInterior whether to include facet interiors in search (`context.convexFacets` must be true for both contexts). Default is false: just consider facet boundaries.\n   * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance\n  */\n  public static searchForClosestApproach(contextA: PolyfaceRangeTreeContext, contextB: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior: boolean = false): FacetLocationDetailPair | FacetLocationDetailPair[] | undefined {\n    const handler = new TwoTreeSearchHandlerForFacetFacetCloseApproach(contextA, contextB, maxDist, searchFacetInterior);\n    RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n}\n"]}
+{"version":3,"file":"PolyfaceRangeTreeContext.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/PolyfaceRangeTreeContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAA0C;AAI1C,0CAAwD;AACxD,oDAAiD;AACjD,mDAA8D;AAC9D,uEAA6I;AAE7I;;;;GAIG;AACH,MAAa,wBAAwB;IACnC,8CAA8C;IACvC,OAAO,CAAkB;IAChC,0DAA0D;IACnD,YAAY,CAAU;IAE7B,iEAAiE;IAC1D,gBAAgB,CAAS;IAChC,sEAAsE;IAC/D,iBAAiB,CAAS;IACjC,yCAAyC;IAClC,YAAY,CAAS;IAC5B,gDAAgD;IACzC,SAAS,CAAS;IAEzB,yDAAyD;IACjD,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,YAAoB,aAAoC,EAAE,OAAwB,EAAE,eAAwB,KAAK;QAC/G,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,aAAa,CAAC,OAAmC,EAAE,kBAA0B,CAAC,EAAE,oBAA4B,CAAC,EAAE,eAAwB,KAAK;QACxJ,IAAI,OAAO,YAAY,mBAAQ;YAC7B,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,iBAAiB,EAAE,YAAY,CAAC,CAAC;QACxG,MAAM,QAAQ,GAAG,6BAAa,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,aAAa,GAAG,4BAAY,CAAC,mBAAmB,CACpD,CAAC,KAAa,EAAW,EAAE,GAAG,OAAO,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EACvF,CAAC,KAAa,EAAU,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,EAC5C,QAAQ,EACR,eAAe,EACf,iBAAiB,CAClB,CAAC;QACF,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,wBAAwB,CAAC,aAAa,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACxG,CAAC;IACD;;;;;;OAMG;IACI,qBAAqB,CAAC,UAA0B,EAAE,OAAgB,EAAE,sBAA+B,KAAK;QAC7G,MAAM,OAAO,GAAG,IAAI,0EAAgD,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,mBAAmB,CAAC,CAAC;QACrH,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,MAAM,QAAQ,GAAG,6BAAa,CAAC,uBAAuB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrE,qHAAqH;QACrH,MAAM,OAAO,GAAG,mBAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAChE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC;QAChD,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC1B,OAAO,CAAC,cAAc,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,QAAQ;YACpD,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC3C,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,CAAC;IACD;;;;;;;MAOE;IACK,MAAM,CAAC,wBAAwB,CAAC,QAAkC,EAAE,QAAkC,EAAE,OAAgB,EAAE,sBAA+B,KAAK;QACnK,MAAM,OAAO,GAAG,IAAI,wEAA8C,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,mBAAmB,CAAC,CAAC;QACrH,6BAAa,CAAC,qBAAqB,CAAC,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAC/F,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,CAAC;CACF;AApFD,4DAoFC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module RangeSearch\n */\n\nimport { Geometry } from \"../../Geometry\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { XAndY, XYAndZ } from \"../../geometry3d/XYZProps\";\nimport { FacetLocationDetail, FacetLocationDetailPair } from \"../FacetLocationDetail\";\nimport { Polyface, PolyfaceVisitor } from \"../Polyface\";\nimport { PolyfaceQuery } from \"../PolyfaceQuery\";\nimport { RangeTreeNode, RangeTreeOps } from \"./RangeTreeNode\";\nimport { SingleTreeSearchHandlerForClosestPointOnPolyface, TwoTreeSearchHandlerForFacetFacetCloseApproach } from \"./RangeTreeSearchHandlers\";\n\n/**\n * Handler class for searching a range tree containing the facets of a polyface.\n * * Facilitates multiple searches for closest point and close approach calculations.\n * @public\n */\nexport class PolyfaceRangeTreeContext {\n  /** Visitor for the polyface being searched */\n  public visitor: PolyfaceVisitor;\n  /** Whether all facets to visit are known to be convex. */\n  public convexFacets: boolean;\n\n  /** Diagnostic: number of range tests that have returned true. */\n  public numRangeTestTrue: number;\n  /** Diagnostic: number of range tests that have been returned false */\n  public numRangeTestFalse: number;\n  /** Diagnostic: number of facet tests. */\n  public numFacetTest: number;\n  /** Diagnostic: number of searches performed. */\n  public numSearch: number;\n\n  /** Range tree, whose appData are facet (read) indices */\n  private _rangeTreeRoot: RangeTreeNode<number>;\n\n  /** Constructor: capture inputs, initialize debug counters */\n  private constructor(rangeTreeRoot: RangeTreeNode<number>, visitor: PolyfaceVisitor, convexFacets: boolean = false) {\n    this.visitor = visitor;\n    this.convexFacets = convexFacets;\n    this._rangeTreeRoot = rangeTreeRoot;\n    this.numRangeTestTrue = 0;\n    this.numRangeTestFalse = 0;\n    this.numFacetTest = 0;\n    this.numSearch = 0;\n  }\n  /**\n   * Create a range tree context for the Polyface facets.\n   * * This is a very simple construction that splits \"right and left parts\" of the facet sequence.\n   * * Facets with any recognizable \"left to right\" or \"top to bottom\" sequencing will have very effective search structures.\n   * @param visitor access to facets, captured if PolyfaceVisitor\n   * @param maxChildPerNode maximum children per range tree node (default 4)\n   * @param maxAppDataPerLeaf maximum facet indices per leaf node (default 4)\n   * @param convexFacets whether all facets are known to be convex (cf. [[PolyfaceQuery.areFacetsConvex]]) (default false)\n   */\n  public static createCapture(visitor: Polyface | PolyfaceVisitor, maxChildPerNode: number = 4, maxAppDataPerLeaf: number = 4, convexFacets: boolean = false): PolyfaceRangeTreeContext | undefined {\n    if (visitor instanceof Polyface)\n      return this.createCapture(visitor.createVisitor(0), maxChildPerNode, maxAppDataPerLeaf, convexFacets);\n    const numFacet = PolyfaceQuery.visitorClientFacetCount(visitor);\n    const rangeTreeRoot = RangeTreeOps.createByIndexSplits<number>(\n      (index: number): Range3d => { visitor.moveToReadIndex(index); return visitor.range(); },\n      (index: number): number => { return index; },\n      numFacet,\n      maxChildPerNode,\n      maxAppDataPerLeaf,\n    );\n    return rangeTreeRoot ? new PolyfaceRangeTreeContext(rangeTreeRoot, visitor, convexFacets) : undefined;\n  }\n  /**\n   * Search the range tree for closest facet(s) to spacePoint.\n   * @param spacePoint point to test\n   * @param maxDist collect facet locations at no more than this distance from spacePoint. If undefined, return only the closest facet location.\n   * @param searchFacetInterior whether to include facet interiors in search. Default is false: just consider facet boundaries.\n   * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point\n   */\n  public searchForClosestPoint(spacePoint: XYAndZ | XAndY, maxDist?: number, searchFacetInterior: boolean = false): FacetLocationDetail | FacetLocationDetail[] | undefined {\n    const handler = new SingleTreeSearchHandlerForClosestPointOnPolyface(spacePoint, this, maxDist, searchFacetInterior);\n    this.numSearch++;\n    const numFacet = PolyfaceQuery.visitorClientFacetCount(this.visitor);\n    // seed the search with a few points -- this reduces early trips deep into early ranges that are far from spacePoint.\n    const numTest = Geometry.clamp(Math.floor(numFacet / 20), 2, 7);\n    const testStep = Math.floor(numFacet / numTest);\n    handler.processAppData(0);\n    handler.processAppData(numFacet - 1);\n    for (let i = testStep; i + 1 < numFacet; i += testStep)\n      handler.processAppData(i);\n    this._rangeTreeRoot.searchTopDown(handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n  /**\n   * Search the range trees for closest approach(es) between the polyfaces.\n   * @param contextA first polyface context\n   * @param contextB second polyface context\n   * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.\n   * @param searchFacetInterior whether to include facet interiors in search (`context.convexFacets` must be true for both contexts). Default is false: just consider facet boundaries.\n   * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance\n  */\n  public static searchForClosestApproach(contextA: PolyfaceRangeTreeContext, contextB: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior: boolean = false): FacetLocationDetailPair | FacetLocationDetailPair[] | undefined {\n    const handler = new TwoTreeSearchHandlerForFacetFacetCloseApproach(contextA, contextB, maxDist, searchFacetInterior);\n    RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n}\n"]}

package/lib/cjs/polyface/RangeTree/RangeTreeNode.d.ts

@@ -32,7 +32,7 @@ export declare abstract class SingleTreeSearchHandler<AppDataType> {
      * * Default implementation returns false so query runs to completion.
      * * Search processes check this after range tests and child processing.
      */
-    isAborted(): boolean;
+    getIsAborted(): boolean;
 }
 /**
  * Abstract class for handler objects called during traversal of two range trees.
@@ -53,7 +53,9 @@ export declare abstract class TwoTreeSearchHandler<AppDataType> {
      * * Default implementation returns false so query runs to completion.
      * * Search processes check this after range tests and child processing.
      */
-    isAborted(): boolean;
+    getIsAborted(): boolean;
+    /** Whether to ignore z-coordinates in distance computations. */
+    getXYOnly(): boolean;
 }
 /**
  * This class refines the TwoTreeSearchHandler with an implementation of `isRangePairActive` appropriate for computing the minimum distance between trees.

package/lib/cjs/polyface/RangeTree/RangeTreeNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RangeTreeNode.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeNode.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAEjD;;;;GAIG;AACH,KAAK,QAAQ,CAAC,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AACvC;;;;GAIG;AACH,KAAK,WAAW,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC;AA0CnD;;;GAGG;AACH,8BAAsB,uBAAuB,CAAC,WAAW;IACvD,qFAAqF;aACrE,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IACtD;;;;OAIG;aACa,cAAc,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IACvD;;;;OAIG;IAEI,SAAS,IAAI,OAAO;CAC5B;AACD;;;GAGG;AACH,8BAAsB,oBAAoB,CAAC,WAAW;IACpD,0FAA0F;aAC1E,iBAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IACnF;;;;;OAKG;aACa,kBAAkB,CAAC,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,GAAG,IAAI;IACvF;;;;OAIG;IAEI,SAAS,IAAI,OAAO;CAC5B;AACD;;;;;GAKG;AACH,8BAAsB,wCAAwC,CAAC,WAAW,CAAE,SAAQ,oBAAoB,CAAC,WAAW,CAAC;IACnH;;;;OAIG;aACa,kBAAkB,IAAI,MAAM;IAC5C;;;;;OAKG;IACa,iBAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;CAQpF;AAID;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,qBAAa,aAAa,CAAC,WAAW;IACpC,OAAO,CAAC,MAAM,CAAU;IACxB,OAAO,CAAC,QAAQ,CAAwB;IACxC,OAAO,CAAC,SAAS,CAAuC;IACxD,iFAAiF;IACjF,OAAO,CAAC,GAAG,CAAS;IACpB;;;;;;OAMG;IACH,OAAO;IAaP,wEAAwE;WAC1D,aAAa,CAAC,WAAW,EACrC,KAAK,EAAE,OAAO,EACd,OAAO,EAAE,QAAQ,CAAC,WAAW,CAAC,EAC9B,QAAQ,EAAE,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,GAAG,aAAa,CAAC,WAAW,CAAC;IAG7E,2EAA2E;IACpE,QAAQ,CAAC,IAAI,EAAE,OAAO;IAG7B,sDAAsD;IAC/C,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO;IAGxC,2DAA2D;IACpD,WAAW,IAAI,OAAO;IAG7B;;;;;;OAMG;IACI,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa,CAAC,WAAW,CAAC,GAAG,SAAS;IAG7E;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAGhE,qDAAqD;IAC9C,cAAc,IAAI,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;IAG7D,8DAA8D;IACvD,aAAa,IAAI,QAAQ,CAAC,WAAW,CAAC;IAG7C;;;OAGG;IACI,cAAc,IAAI,MAAM;IAG/B;;;OAGG;IACI,aAAa,IAAI,MAAM;IAG9B;;;OAGG;IACI,eAAe,CAAC,YAAY,EAAE,CAAC,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,KAAK,OAAO;IAWlF;;;;OAIG;IACI,aAAa,CAAC,OAAO,EAAE,uBAAuB,CAAC,WAAW,CAAC;IAgBlE;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IA0B5C;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAqBvC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,SAAS;IAUxB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ;IAWvB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,MAAM,CAAC,mBAAmB;IA8ClC;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAmBtC;;;;;OAKG;WACW,qBAAqB,CAAC,WAAW,EAC7C,QAAQ,EAAE,aAAa,CAAC,WAAW,CAAC,EACpC,SAAS,EAAE,aAAa,CAAC,WAAW,CAAC,EACrC,OAAO,EAAE,oBAAoB,CAAC,WAAW,CAAC;CAI7C;AACD;;;GAGG;AACH,qBAAa,YAAY;IACvB,gCAAgC;WAClB,qBAAqB,CAAC,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,GAAG,MAAM;IAK1F,kCAAkC;WACpB,wBAAwB,CAAC,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,GAAG,MAAM;IAM7F;;;;;;;;OAQG;IACH,OAAO,CAAC,MAAM,CAAC,sBAAsB;IAgBrC;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAuC3C;;;;;;;;;;OAUG;WACW,mBAAmB,CAAC,WAAW,EAC3C,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,EAC5B,OAAO,EAAE,WAAW,CAAC,WAAW,CAAC,EACjC,WAAW,EAAE,MAAM,EACnB,kBAAkB,GAAE,MAAU,EAC9B,iBAAiB,GAAE,MAAU,GAC5B,aAAa,CAAC,WAAW,CAAC,GAAG,SAAS;CAY1C"}
+{"version":3,"file":"RangeTreeNode.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeNode.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAEjD;;;;GAIG;AACH,KAAK,QAAQ,CAAC,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AACvC;;;;GAIG;AACH,KAAK,WAAW,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC;AA0CnD;;;GAGG;AACH,8BAAsB,uBAAuB,CAAC,WAAW;IACvD,qFAAqF;aACrE,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IACtD;;;;OAIG;aACa,cAAc,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IACvD;;;;OAIG;IACI,YAAY,IAAI,OAAO;CAC/B;AACD;;;GAGG;AACH,8BAAsB,oBAAoB,CAAC,WAAW;IACpD,0FAA0F;aAC1E,iBAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IACnF;;;;;OAKG;aACa,kBAAkB,CAAC,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE,WAAW,GAAG,IAAI;IACvF;;;;OAIG;IACI,YAAY,IAAI,OAAO;IAC9B,gEAAgE;IACzD,SAAS,IAAI,OAAO;CAC5B;AACD;;;;;GAKG;AACH,8BAAsB,wCAAwC,CAAC,WAAW,CAAE,SAAQ,oBAAoB,CAAC,WAAW,CAAC;IACnH;;;;OAIG;aACa,kBAAkB,IAAI,MAAM;IAC5C;;;;;OAKG;IACa,iBAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;CAKpF;AAID;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,qBAAa,aAAa,CAAC,WAAW;IACpC,OAAO,CAAC,MAAM,CAAU;IACxB,OAAO,CAAC,QAAQ,CAAwB;IACxC,OAAO,CAAC,SAAS,CAAuC;IACxD,iFAAiF;IACjF,OAAO,CAAC,GAAG,CAAS;IACpB;;;;;;OAMG;IACH,OAAO;IAaP,wEAAwE;WAC1D,aAAa,CAAC,WAAW,EACrC,KAAK,EAAE,OAAO,EACd,OAAO,EAAE,QAAQ,CAAC,WAAW,CAAC,EAC9B,QAAQ,EAAE,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,GAAG,aAAa,CAAC,WAAW,CAAC;IAG7E,2EAA2E;IACpE,QAAQ,CAAC,IAAI,EAAE,OAAO;IAG7B,sDAAsD;IAC/C,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO;IAGxC,2DAA2D;IACpD,WAAW,IAAI,OAAO;IAG7B;;;;;;OAMG;IACI,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,aAAa,CAAC,WAAW,CAAC,GAAG,SAAS;IAG7E;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAGhE,qDAAqD;IAC9C,cAAc,IAAI,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;IAG7D,8DAA8D;IACvD,aAAa,IAAI,QAAQ,CAAC,WAAW,CAAC;IAG7C;;;OAGG;IACI,cAAc,IAAI,MAAM;IAG/B;;;OAGG;IACI,aAAa,IAAI,MAAM;IAG9B;;;OAGG;IACI,eAAe,CAAC,YAAY,EAAE,CAAC,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,KAAK,OAAO;IAWlF;;;;OAIG;IACI,aAAa,CAAC,OAAO,EAAE,uBAAuB,CAAC,WAAW,CAAC;IAgBlE;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IA0B5C;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAqBvC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,SAAS;IAUxB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ;IAWvB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,MAAM,CAAC,mBAAmB;IA8ClC;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAmBtC;;;;;OAKG;WACW,qBAAqB,CAAC,WAAW,EAC7C,QAAQ,EAAE,aAAa,CAAC,WAAW,CAAC,EACpC,SAAS,EAAE,aAAa,CAAC,WAAW,CAAC,EACrC,OAAO,EAAE,oBAAoB,CAAC,WAAW,CAAC;CAI7C;AACD;;;GAGG;AACH,qBAAa,YAAY;IACvB,gCAAgC;WAClB,qBAAqB,CAAC,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,GAAG,MAAM;IAK1F,kCAAkC;WACpB,wBAAwB,CAAC,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,WAAW,CAAC,GAAG,MAAM;IAM7F;;;;;;;;OAQG;IACH,OAAO,CAAC,MAAM,CAAC,sBAAsB;IAgBrC;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAuC3C;;;;;;;;;;OAUG;WACW,mBAAmB,CAAC,WAAW,EAC3C,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,EAC5B,OAAO,EAAE,WAAW,CAAC,WAAW,CAAC,EACjC,WAAW,EAAE,MAAM,EACnB,kBAAkB,GAAE,MAAU,EAC9B,iBAAiB,GAAE,MAAU,GAC5B,aAAa,CAAC,WAAW,CAAC,GAAG,SAAS;CAY1C"}

package/lib/cjs/polyface/RangeTree/RangeTreeNode.js

@@ -62,8 +62,7 @@ class SingleTreeSearchHandler {
      * * Default implementation returns false so query runs to completion.
      * * Search processes check this after range tests and child processing.
      */
-    // eslint-disable-next-line @itwin/prefer-get
-    isAborted() { return false; }
+    getIsAborted() { return false; }
 }
 exports.SingleTreeSearchHandler = SingleTreeSearchHandler;
 /**
@@ -76,8 +75,9 @@ class TwoTreeSearchHandler {
      * * Default implementation returns false so query runs to completion.
      * * Search processes check this after range tests and child processing.
      */
-    // eslint-disable-next-line @itwin/prefer-get
-    isAborted() { return false; }
+    getIsAborted() { return false; }
+    /** Whether to ignore z-coordinates in distance computations. */
+    getXYOnly() { return false; }
 }
 exports.TwoTreeSearchHandler = TwoTreeSearchHandler;
 /**
@@ -95,11 +95,8 @@ class TwoTreeDistanceMinimizationSearchHandler extends TwoTreeSearchHandler {
      */
     isRangePairActive(leftRange, rightRange) {
         const currentDistance = this.getCurrentDistance();
-        const distanceBetweenRanges = leftRange.distanceToRange(rightRange);
-        if (distanceBetweenRanges <= currentDistance) {
-            return true;
-        }
-        return false;
+        const distanceBetweenRanges = this.getXYOnly() ? leftRange.distanceToRangeXY(rightRange) : leftRange.distanceToRange(rightRange);
+        return distanceBetweenRanges <= currentDistance;
     }
 }
 exports.TwoTreeDistanceMinimizationSearchHandler = TwoTreeDistanceMinimizationSearchHandler;
@@ -242,7 +239,7 @@ class RangeTreeNode {
             for (let i = 0; undefined !== (itemToProcess = this.getAppDataByIndex(i)); i++) {
                 // console.log(itemToProcess);
                 handler.processAppData(itemToProcess);
-                if (handler.isAborted())
+                if (handler.getIsAborted())
                     return;
             }
             let child;
@@ -271,7 +268,7 @@ class RangeTreeNode {
                             handler.processAppDataPair(leftItem, rightItem);
                         else
                             handler.processAppDataPair(rightItem, leftItem);
-                        if (handler.isAborted())
+                        if (handler.getIsAborted())
                             return;
                     }
                 }
@@ -295,7 +292,7 @@ class RangeTreeNode {
                         handler.processAppDataPair(leftItem, rightItem);
                     else
                         handler.processAppDataPair(rightItem, leftItem);
-                    if (handler.isAborted())
+                    if (handler.getIsAborted())
                         return;
                 }
             }

package/lib/cjs/polyface/RangeTree/RangeTreeNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"RangeTreeNode.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeNode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAC7C,kDAAiD;AAejD;;;;;GAKG;AACH,SAAS,mBAAmB,CAAI,IAAoB,EAAE,KAAa;IACjE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;AACrB,CAAC;AACD;;;GAGG;AACH,SAAS,UAAU,CAAI,KAAa,EAAE,IAAiB;IACrD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM;gBACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AACD;;;GAGG;AACH,SAAS,gBAAgB,CAAI,IAAiB;IAC5C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AACD;;;GAGG;AACH,MAAsB,uBAAuB;IAS3C;;;;OAIG;IACH,6CAA6C;IACtC,SAAS,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;CAC9C;AAhBD,0DAgBC;AACD;;;GAGG;AACH,MAAsB,oBAAoB;IAUxC;;;;OAIG;IACH,6CAA6C;IACtC,SAAS,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;CAC9C;AAjBD,oDAiBC;AACD;;;;;GAKG;AACH,MAAsB,wCAAsD,SAAQ,oBAAiC;IAOnH;;;;;OAKG;IACa,iBAAiB,CAAC,SAAkB,EAAE,UAAmB;QACvE,MAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAClD,MAAM,qBAAqB,GAAG,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QACpE,IAAI,qBAAqB,IAAI,eAAe,EAAE,CAAC;YAC7C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AArBD,4FAqBC;AAED,IAAI,cAAc,GAAG,CAAC,CAAC;AAEvB;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAa,aAAa;IAChB,MAAM,CAAU;IAChB,QAAQ,CAAwB;IAChC,SAAS,CAAuC;IACxD,iFAAiF;IACzE,GAAG,CAAS;IACpB;;;;;;OAMG;IACH,YAAoB,KAAc,EAAE,OAA8B,EAAE,QAA8C;QAChH,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,GAAG,GAAG,cAAc,EAAE,CAAC;QAC5B,iCAAiC;QACjC,qCAAqC;QACrC,0DAA0D;QAC1D,oDAAoD;QACpD,uCAAuC;QACvC,gDAAgD;QAChD,uDAAuD;IACzD,CAAC;IACD,wEAAwE;IACjE,MAAM,CAAC,aAAa,CACzB,KAAc,EACd,OAA8B,EAC9B,QAA8C;QAC9C,OAAO,IAAI,aAAa,CAAc,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAClE,CAAC;IACD,2EAA2E;IACpE,QAAQ,CAAC,IAAa;QAC3B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,sDAAsD;IAC/C,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,2DAA2D;IACpD,WAAW;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;;;;OAMG;IACI,eAAe,CAAC,KAAa;QAClC,OAAO,UAAU,CAA6B,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACvE,CAAC;IACD;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAa;QACpC,OAAO,UAAU,CAAc,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IACD,qDAAqD;IAC9C,cAAc;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,8DAA8D;IACvD,aAAa;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IACD;;;OAGG;IACI,cAAc;QACnB,OAAO,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IACD;;;OAGG;IACI,aAAa;QAClB,OAAO,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IACD;;;OAGG;IACI,eAAe,CAAC,YAA2D;QAChF,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS;oBAChC,KAAK,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YACxC,CAAC;iBAAM,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACxC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,OAA6C;QAChE,IAAI,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,IAAI,aAAsC,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/E,8BAA8B;gBAC9B,OAAO,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;gBACtC,IAAI,OAAO,CAAC,SAAS,EAAE;oBACrB,OAAO;YACX,CAAC;YACD,IAAI,KAA6C,CAAC;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrE,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,6BAA6B,CAC1C,WAAkC,EAClC,UAAwC,EACxC,WAAoB,EACpB,OAA0C;QAE1C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,QAAiC,CAAC;YACtC,IAAI,SAAkC,CAAC;YACvC,yGAAyG;YACzG,KAAK,IAAI,UAAU,GAAG,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,CAAC,GAAG,CAAC;gBAC3D,MAAM,YAAY,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC;gBACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAAc,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;oBACrH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAc,SAAS,EAAE,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;wBAChH,IAAI,CAAC,WAAW;4BACd,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;;4BAEhD,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;wBAClD,IAAI,OAAO,CAAC,SAAS,EAAE;4BACrB,OAAO;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,wBAAwB,CACrC,WAAkC,EAClC,YAAmC,EACnC,WAAoB,EACpB,OAA0C;QAE1C,IAAI,WAAW,KAAK,SAAS,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC5D,IAAI,QAAiC,CAAC;YACtC,IAAI,SAAkC,CAAC;YACvC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAAc,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;gBACrH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAc,SAAS,EAAE,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;oBAChH,IAAI,CAAC,WAAW;wBACd,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;;wBAEhD,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAClD,IAAI,OAAO,CAAC,SAAS,EAAE;wBACrB,OAAO;gBACX,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,SAAS,CACtB,GAA+B,EAC/B,QAAsC,EACtC,WAAyC;QAEzC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,QAAQ,CACrB,GAA+B,EAC/B,QAAsC,EACtC,WAAyC;QAEzC,IAAA,qBAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QAC9C,QAAQ,CAAC,GAAG,EAAE,CAAC;QACf,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACK,MAAM,CAAC,mBAAmB,CAChC,OAAmC,EACnC,SAAuC,EACvC,oBAAkD,EAClD,QAAoC,EACpC,UAAwC,EACxC,qBAAmD,EACnD,OAA0C;QAE1C,+DAA+D;QAC/D,MAAM,iBAAiB,GAAG,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC;QACzD,MAAM,kBAAkB,GAAG,QAAQ,CAAC,QAAQ,KAAK,SAAS,CAAC;QAC3D,IAAI,SAAiD,CAAC;QACtD,IAAI,UAAkD,CAAC;QAEvD,kIAAkI;QAClI,IAAI,iBAAiB,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1D,IAAI,CAAC,6BAA6B,CAAc,OAAO,CAAC,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAC3G,CAAC;QACD,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,IAAI,kBAAkB,EAAE,CAAC;YAC1D,IAAI,CAAC,6BAA6B,CAAc,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1G,CAAC;QAED,IAAI,OAAO,CAAC,iBAAiB,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/D,IAAI,CAAC,wBAAwB,CAAc,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAEhG,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACxE,IAAI,CAAC,SAAS,CAAc,OAAO,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;gBACtE,IAAI,CAAC,SAAS,CAAc,QAAQ,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;gBACzE,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAA6B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;oBACtI,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,UAAU,GAAG,UAAU,CAA6B,UAAU,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;wBAC3I,IAAI,CAAC,mBAAmB,CACtB,SAAS,EAAE,SAAS,EAAE,oBAAoB,EAC1C,UAAU,EAAE,UAAU,EAAE,qBAAqB,EAC7C,OAAO,CAAC,CAAC;oBACb,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,QAAQ,CAAc,OAAO,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;gBACrE,IAAI,CAAC,QAAQ,CAAc,QAAQ,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;YAC1E,CAAC;iBAAM,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC3C,IAAI,CAAC,uBAAuB,CAAc,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YACtG,CAAC;iBAAM,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5C,IAAI,CAAC,uBAAuB,CAAc,QAAQ,EAAE,OAAO,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YACpG,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,uBAAuB,CACpC,OAAmC,EACnC,QAAoC,EACpC,qBAAmD,EACnD,WAAoB,EACpB,OAA0C;QAE1C,IAAA,qBAAM,EAAC,QAAQ,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;QACzC,kGAAkG;QAClG,wJAAwJ;QACxJ,IAAI,SAAiD,CAAC;QACtD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAA6B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;YACtI,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjE,IAAI,CAAC,wBAAwB,CAAc,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;gBACxG,IAAI,CAAC,6BAA6B,CAAc,SAAS,CAAC,QAAQ,EAAE,qBAAqB,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;gBACjH,IAAI,CAAC,uBAAuB,CAAc,SAAS,EAAE,QAAQ,EAAE,qBAAqB,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;YAC9G,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,qBAAqB,CACjC,QAAoC,EACpC,SAAqC,EACrC,OAA0C;QAE1C,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IACzE,CAAC;CACF;AA3TD,sCA2TC;AACD;;;GAGG;AACH,MAAa,YAAY;IACvB,gCAAgC;IACzB,MAAM,CAAC,qBAAqB,CAAc,IAAgC;QAC/E,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,CAAC,CAAC,KAAiC,EAAW,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kCAAkC;IAC3B,MAAM,CAAC,wBAAwB,CAAc,IAAgC;QAClF,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,CAClB,CAAC,IAAgC,EAAW,EAAE,GAAG,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAClG,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;OAQG;IACK,MAAM,CAAC,sBAAsB,CACnC,MAA4B,EAC5B,OAAiC,EACjC,MAAc,EACd,MAAc,EACd,WAAmB;QACnB,MAAM,YAAY,GAAkB,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACvC,iDAAiD;QACjD,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,YAAY,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,KAAK,CAAC,WAAW,CAAC,mBAAmB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IACrE,CAAC;IACD;;;;;;;;;;OAUG;IACK,MAAM,CAAC,4BAA4B,CACzC,MAA4B,EAC5B,OAAiC,EACjC,MAAc,EACd,MAAc,EACd,WAAmB,EACnB,eAAuB,EACvB,iBAAyB;QAEzB,IAAI,MAAM,GAAG,WAAW;YACtB,MAAM,GAAG,WAAW,CAAC;QAEvB,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAClD,MAAM,kBAAkB,GAAG,eAAe,GAAG,iBAAiB,CAAC;QAC/D,gFAAgF;QAEhF,IAAI,MAAM,IAAI,MAAM,GAAG,kBAAkB,EAAE,CAAC,CAAE,mEAAmE;YAC/G,uDAAuD;YACvD,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,iBAAiB,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,iBAAiB,EAAE,MAAM,CAAC,EAAE,CAAC;gBACtI,MAAM,IAAI,GAAG,YAAY,CAAC,sBAAsB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC/F,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;oBACtC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC,CAAE,qDAAqD;YAC7D,qDAAqD;YACrD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC;YAClE,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC;gBACxH,MAAM,KAAK,GAAG,IAAI,CAAC,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,iBAAiB,CAAC,CAAC;gBAClI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;oBACvC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAA4B,EAC5B,OAAiC,EACjC,WAAmB,EACnB,qBAA6B,CAAC,EAC9B,oBAA4B,CAAC;QAE7B,iBAAiB;QACjB,6CAA6C;QAC7C,4BAA4B;QAC5B,IAAI,WAAW,IAAI,CAAC;eACf,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC;eACxD,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,CAAC;YAC7D,OAAO,SAAS,CAAC;QACnB,IAAI,kBAAkB,GAAG,CAAC;YACxB,kBAAkB,GAAG,CAAC,CAAC;QACzB,OAAO,YAAY,CAAC,4BAA4B,CAAc,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE,kBAAkB,EAAE,iBAAiB,CAAC,CAAC;IACrJ,CAAC;CACF;AAtHD,oCAsHC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module RangeSearch\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Range3d } from \"../../geometry3d/Range\";\n\n/** Type name FlexData is shorthand for a member or parameter which can be:\n * * undefined\n * * an array of values of type T\n * * a singleton of type T\n */\ntype FlexData<T> = undefined | T[] | T;\n/**\n * Type name IndexToType is shorthand for a member or parameter which can be:\n * * an array of values of type T\n * * a function from integers to type T.\n */\ntype IndexToType<T> = T[] | ((index: number) => T);\n\n/**\n * Map an (unchecked) integer to a parameterized type T, where the data argument can be either:\n * * an array of type T\n * * a function which takes an index and returns type T\n * @internal\n */\nfunction evaluateIndexToType<T>(data: IndexToType<T>, index: number): T {\n  if (Array.isArray(data))\n    return data[index];\n  return data(index);\n}\n/**\n * Get data by index from a source that may be undefined, an array of item of type T, or a singleton of the item type.\n * @internal\n */\nfunction getByIndex<T>(index: number, data: FlexData<T>): T | undefined {\n  if (data !== undefined) {\n    if (Array.isArray(data)) {\n      if (index < data.length)\n        return data[index];\n    } else {\n      return data;\n    }\n  }\n  return undefined;\n}\n/**\n * Return the number of items in an object that can be undefined, an array of item of type T, or a singleton of the item type.\n * @internal\n */\nfunction getFlexDataCount<T>(data: FlexData<T>): number {\n  if (data !== undefined) {\n    if (Array.isArray(data)) {\n      return data.length;\n    } else {\n      return 1;\n    }\n  }\n  return 0;\n}\n/**\n * Abstract class for handler objects called during traversal of a single range tree.\n * @internal\n */\nexport abstract class SingleTreeSearchHandler<AppDataType> {\n  /** Return true if appData within the range should be offered to `processAppData`. */\n  public abstract isRangeActive(range: Range3d): boolean;\n  /**\n   * Called for a (single) child referenced by a tree.\n   * * This is only called when range checks on the path from root have been passed.\n   * @param item child (of type AppDataType) in the tree.\n   */\n  public abstract processAppData(item: AppDataType): void;\n  /**\n   * Query to see if the active search has been aborted.\n   * * Default implementation returns false so query runs to completion.\n   * * Search processes check this after range tests and child processing.\n   */\n  // eslint-disable-next-line @itwin/prefer-get\n  public isAborted(): boolean { return false; }\n}\n/**\n * Abstract class for handler objects called during traversal of two range trees.\n * @internal\n */\nexport abstract class TwoTreeSearchHandler<AppDataType> {\n  /** Return true if appData within the ranges should be offered to `processAppDataPair`. */\n  public abstract isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean;\n  /**\n   * Called with AppDataType items from left tree and right tree.\n   * * This is only called when range tests have been passed.\n   * @param leftItem\n   * @param rightItem\n   */\n  public abstract processAppDataPair(leftItem: AppDataType, rightItem: AppDataType): void;\n  /**\n   * Query to see if the active search has been aborted.\n   * * Default implementation returns false so query runs to completion.\n   * * Search processes check this after range tests and child processing.\n   */\n  // eslint-disable-next-line @itwin/prefer-get\n  public isAborted(): boolean { return false; }\n}\n/**\n * This class refines the TwoTreeSearchHandler with an implementation of `isRangePairActive` appropriate for computing the minimum distance between trees.\n * * The concrete class must implement `getCurrentDistance()` method to provide the best-so-far distance.\n * * The implementation of `isRangePairActive` returns true if the distance between ranges is less than or equal to the `getCurrentDistance()` value.\n * @internal\n */\nexport abstract class TwoTreeDistanceMinimizationSearchHandler<AppDataType> extends TwoTreeSearchHandler<AppDataType>{\n  /**\n   * Provides the allowable distance between ranges.\n   * * Range pairs with more than this distance separation are rejected.\n   * * The implementation may alter (probably reduce) the getCurrentDistance() value as the search progresses.\n   */\n  public abstract getCurrentDistance(): number;\n  /**\n   * Method called to decide whether to process subtrees and immediate child appData items from a left tree node and right tree node.\n   * @param leftRange range from a node in the left tree\n   * @param rightRange range from a node in the right tree.\n   * @returns true if the smallest distance from leftRange to rightRange is less than or equal to getCurrentDistance()\n   */\n  public override isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean {\n    const currentDistance = this.getCurrentDistance();\n    const distanceBetweenRanges = leftRange.distanceToRange(rightRange);\n    if (distanceBetweenRanges <= currentDistance) {\n      return true;\n    }\n    return false;\n  }\n}\n\nlet numNodeCreated = 0;\n\n/**\n * * TREE STRUCTURE\n *   * A RangeTreeNode is part of a range tree.\n *   * TREE is used here in a strictly _structural_ sense, which has no broad promises about data members.\n *   * Each RangeNode points to 0, 1 or many children.\n *   * Each child has (but does not point back to) a single parent.\n *   * The overall tree has a single root.\n *   * Each node is effectively the root of the tree of its children.\n * * NON-TREE DATA MEMBERS\n *   * Data members in each node (in addition to children) are\n *     * _range = the union of ranges below in the heap\n *     * _appData = application data associated with the node.\n *       * Construction methods may place multiple _appData items in each node.\n *       * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.\n * * CONSTRUCTION\n *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.\n *     * The appData is placed entirely in the leaves.\n *     * The caller can specify:\n *       * the number of _appData items per leaf\n *       * the number of children per node within the tree.\n *     * Compared to \"shallow\" trees with many children per node and many appData per leaf, \"deep\" trees with 2 children per node and 1 appData per leaf may have:\n *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.\n *       * larger memory use because of more nodes\n *   * For future construction methods:\n *      * _appData \"above the leaves\" may allow nodes below to have smaller ranges, but add complexity to search.\n * @internal\n */\nexport class RangeTreeNode<AppDataType> {\n  private _range: Range3d;\n  private _appData: FlexData<AppDataType>;\n  private _children: FlexData<RangeTreeNode<AppDataType>>;\n  /** an id assigned sequentially as nodes are created.  For debugging use only. */\n  private _id: number;\n  /**\n   * CONSTRUCTOR\n   * CAPTURE (not copy)\n   * * range = range for search algorithms\n   * * appData = application data relevant to this node.\n   * * children = child node reference(s).\n   */\n  private constructor(range: Range3d, appData: FlexData<AppDataType>, children: FlexData<RangeTreeNode<AppDataType>>) {\n    this._range = range;\n    this._appData = appData;\n    this._children = children;\n    this._id = numNodeCreated++;\n    // const childIds: number[] = [];\n    // if (Array.isArray(this._children))\n    //   for (const c of this._children) childIds.push(c._id);\n    // else if (this._children instanceof RangeTreeNode)\n    //   childIds.push(this._children._id);\n    // const numAppData = getFlexDataCount(appData);\n    // console.log({ id: this._id, childIds, numAppData });\n  }\n  /** Simplest public create: capture the range, appData, and children. */\n  public static createCapture<AppDataType>(\n    range: Range3d,\n    appData: FlexData<AppDataType>,\n    children: FlexData<RangeTreeNode<AppDataType>>): RangeTreeNode<AppDataType> {\n    return new RangeTreeNode<AppDataType>(range, appData, children);\n  }\n  /** copy (not capture) from given data into the range in this RangeEntry */\n  public setRange(data: Range3d) {\n    this._range.setFrom(data);\n  }\n  /** return (a copy of) the range in this RangeEntry */\n  public getRange(data?: Range3d): Range3d {\n    return this._range.clone(data);\n  }\n  /** return (a reference to) the range in this RangeEntry */\n  public getRangeRef(): Range3d {\n    return this._range;\n  }\n  /**\n   * Access a child by index.\n   * * If the child data is an array, this dereferences the array.\n   * * If the child data is a singleton, treat it as index 0.\n   * * return undefined if there are no children.\n   * @param index index of item to access.\n   */\n  public getChildByIndex(index: number): RangeTreeNode<AppDataType> | undefined {\n    return getByIndex<RangeTreeNode<AppDataType>>(index, this._children);\n  }\n  /**\n   * * Access an appData by index.\n   * * If the appData data is an array, this dereferences the array.\n   * * If the appData data is a singleton, treat it as if it is at index 0 in an array\n   * * return undefined if there are no appData or for any index out of range.\n   * @param index index of item to access.\n   */\n  public getAppDataByIndex(index: number): AppDataType | undefined {\n    return getByIndex<AppDataType>(index, this._appData);\n  }\n  /** Access the children or child (does not clone). */\n  public getAllChildren(): FlexData<RangeTreeNode<AppDataType>> {\n    return this._children;\n  }\n  /** Access the appData array or singleton (does not clone). */\n  public getAllAppData(): FlexData<AppDataType> {\n    return this._appData;\n  }\n  /**\n   * Count the direct children in this node of the tree.\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveNodeCount`.\n   */\n  public getNumChildren(): number {\n    return getFlexDataCount(this._children);\n  }\n  /**\n   * Count the appData items in this node of the tree.\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveAppDataCount`.\n   */\n  public getNumAppData(): number {\n    return getFlexDataCount(this._appData);\n  }\n  /**\n   * Depth-first tree iteration, calling `announceNode` on each node.\n   * @param announceNode callback that returns true to recurse into children\n   */\n  public recurseIntoTree(announceNode: (node: RangeTreeNode<AppDataType>) => boolean) {\n    const doChildren = announceNode(this);\n    if (doChildren) {\n      if (Array.isArray(this._children)) {\n        for (const child of this._children)\n          child.recurseIntoTree(announceNode);\n      } else if (this._children !== undefined) {\n        this._children.recurseIntoTree(announceNode);\n      }\n    }\n  }\n  /**\n   * Depth-first tree iteration via handler.\n   * * if handler decides the instance range is active, process appData, then recurse on children\n   * * if handler decides to abort after processing an appData, skip processing rest of appData and children\n   */\n  public searchTopDown(handler: SingleTreeSearchHandler<AppDataType>) {\n    if (handler.isRangeActive(this._range)) {\n      let itemToProcess: AppDataType | undefined;\n      for (let i = 0; undefined !== (itemToProcess = this.getAppDataByIndex(i)); i++) {\n        // console.log(itemToProcess);\n        handler.processAppData(itemToProcess);\n        if (handler.isAborted())\n          return;\n      }\n      let child: RangeTreeNode<AppDataType> | undefined;\n      for (let i = 0; undefined !== (child = this.getChildByIndex(i)); i++) {\n        child.searchTopDown(handler);\n      }\n    }\n  }\n\n  /**\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightStack.\n   * @param leftAppData singleton or array with data \"from left\"\n   * @param rightStack stack of nodes to process from right path.\n   * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.\n   * @param handler search handler\n   */\n  private static processAppDataAndAppDataStack<AppDataType>(\n    leftAppData: FlexData<AppDataType>,\n    rightStack: RangeTreeNode<AppDataType>[],\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    if (leftAppData !== undefined) {\n      let leftItem: AppDataType | undefined;\n      let rightItem: AppDataType | undefined;\n      // hmm.. we ASSUME that if the tip ranges passed, then all parent ranges would pass without further test.\n      for (let rangeIndex = rightStack.length; rangeIndex-- > 0;) {\n        const rightAppData = rightStack[rangeIndex]._appData;\n        for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\n          for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\n            if (!reverseArgs)\n              handler.processAppDataPair(leftItem, rightItem);\n            else\n              handler.processAppDataPair(rightItem, leftItem);\n            if (handler.isAborted())\n              return;\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightAppData.\n   * @param leftAppData singleton or array with data \"from left\"\n   * @param rightAppData singleton or array with data \"from right\"\n   * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.\n   * @param handler search handler\n   */\n  private static processAppDataAndAppData<AppDataType>(\n    leftAppData: FlexData<AppDataType>,\n    rightAppData: FlexData<AppDataType>,\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    if (leftAppData !== undefined && rightAppData !== undefined) {\n      let leftItem: AppDataType | undefined;\n      let rightItem: AppDataType | undefined;\n      for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\n        for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\n          if (!reverseArgs)\n            handler.processAppDataPair(leftItem, rightItem);\n          else\n            handler.processAppDataPair(rightItem, leftItem);\n          if (handler.isAborted())\n            return;\n        }\n      }\n    }\n  }\n  /**\n   * Push the tip node to stack(s).\n   * @param tip new node (to be pushed)\n   * @param fullPath complete path, which is always extended\n   * @param partialPath partial path, which is only extended if the tip has _appData.\n   */\n  private static pushPaths<AppDataType>(\n    tip: RangeTreeNode<AppDataType>,\n    fullPath: RangeTreeNode<AppDataType>[],\n    partialPath: RangeTreeNode<AppDataType>[],\n  ) {\n    fullPath.push(tip);\n    if (tip._appData !== undefined) {\n      partialPath.push(tip);\n    }\n  }\n  /**\n   * Pop the tip node from stack(s).\n   * @param tip should match the fullPath tip.\n   * @param fullPath complete path, which is always popped\n   * @param partialPath partial path, which is only popped if the tip has _appData.\n   */\n  private static popPaths<AppDataType>(\n    tip: RangeTreeNode<AppDataType>,\n    fullPath: RangeTreeNode<AppDataType>[],\n    partialPath: RangeTreeNode<AppDataType>[],\n  ) {\n    assert(fullPath[fullPath.length - 1] === tip);\n    fullPath.pop();\n    if (tip._appData !== undefined) {\n      partialPath.pop();\n    }\n  }\n  /**\n   * Process nodes from left and right trees of dual search.\n   * * The separate stacks for nodes that have appData is for efficiency.\n   * * If data is entirely in the leaves (or just in a few nodes), the stacks will all be empty (or very small) and no time will be wasted looking up the stacks for appData to process with the other tip.\n   * @param leftTip tip node being explored on left\n   * @param leftStack stack of prior left nodes\n   * @param leftStackWithAppData stack of prior left nodes which have appData.\n   * @param rightTip tip node being explored on right.\n   * @param rightStack stack of prior right nodes.\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\n   * @param handler search handler\n   */\n  private static recursivePairSearch<AppDataType>(\n    leftTip: RangeTreeNode<AppDataType>,\n    leftStack: RangeTreeNode<AppDataType>[],\n    leftStackWithAppData: RangeTreeNode<AppDataType>[],\n    rightTip: RangeTreeNode<AppDataType>,\n    rightStack: RangeTreeNode<AppDataType>[],\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    // console.log({ leftId: leftTip._id, rightId: rightTip._id });\n    const leftTipHasAppData = leftTip._appData !== undefined;\n    const rightTipHasAppData = rightTip._appData !== undefined;\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\n    let rightChild: RangeTreeNode<AppDataType> | undefined;\n\n    // process immediate appData from each tip node with the entire prior path of the other side (each stack currently lacks the tip).\n    if (leftTipHasAppData && rightStackWithAppData.length > 0) {\n      this.processAppDataAndAppDataStack<AppDataType>(leftTip._appData, rightStackWithAppData, false, handler);\n    }\n    if (leftStackWithAppData.length > 0 && rightTipHasAppData) {\n      this.processAppDataAndAppDataStack<AppDataType>(rightTip._appData, leftStackWithAppData, true, handler);\n    }\n\n    if (handler.isRangePairActive(leftTip._range, rightTip._range)) {\n      this.processAppDataAndAppData<AppDataType>(leftTip._appData, rightTip._appData, false, handler);\n\n      if (leftTip._children !== undefined && rightTip._children !== undefined) {\n        this.pushPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\n        this.pushPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\n        for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\n          for (let rightIndex = 0; undefined !== (rightChild = getByIndex<RangeTreeNode<AppDataType>>(rightIndex, rightTip._children)); rightIndex++) {\n            this.recursivePairSearch(\n              leftChild, leftStack, leftStackWithAppData,\n              rightChild, rightStack, rightStackWithAppData,\n              handler);\n          }\n        }\n        this.popPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\n        this.popPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\n      } else if (leftTip._children !== undefined) {\n        this.leftRecursivePairSearch<AppDataType>(leftTip, rightTip, rightStackWithAppData, false, handler);\n      } else if (rightTip._children !== undefined) {\n        this.leftRecursivePairSearch<AppDataType>(rightTip, leftTip, leftStackWithAppData, true, handler);\n      }\n    }\n  }\n  /**\n   * Recurse below the tip of leftTip, offering each level's appData to the appData of rightTip and rightStackWithAppData.\n   * @param leftTip tip node being explored on left. Its appData is not processed.\n   * @param rightTip tip node being explored on right. It has no children.\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\n   * @param reverseArgs true if the caller is exchanging the sense of left and right\n   * @param handler search handler\n   */\n  private static leftRecursivePairSearch<AppDataType>(\n    leftTip: RangeTreeNode<AppDataType>,\n    rightTip: RangeTreeNode<AppDataType>,\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    assert(rightTip._children === undefined);\n    // The (possibly deep) left children appData needs to be offered to the right path (including tip)\n    // Note that there are no stack push/pop operations -- the right stack is already reaching to leaf level, so there are no range or appData nodes to add.\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\n    for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\n      if (handler.isRangePairActive(leftChild._range, rightTip._range)) {\n        this.processAppDataAndAppData<AppDataType>(leftChild._appData, rightTip._appData, reverseArgs, handler);\n        this.processAppDataAndAppDataStack<AppDataType>(leftChild._appData, rightStackWithAppData, reverseArgs, handler);\n        this.leftRecursivePairSearch<AppDataType>(leftChild, rightTip, rightStackWithAppData, reverseArgs, handler);\n      }\n    }\n  }\n  /**\n   * Recursive search down two trees, with range tests and child processing under control of a handler.\n   * @param leftRoot root of left tree\n   * @param rightRoot root of right tree\n   * @param handler handler for range tests and child process\n   */\n  public static searchTwoTreesTopDown<AppDataType>(\n    leftRoot: RangeTreeNode<AppDataType>,\n    rightRoot: RangeTreeNode<AppDataType>,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    this.recursivePairSearch(leftRoot, [], [], rightRoot, [], [], handler);\n  }\n}\n/**\n * Utilities for various operations on RangeTree\n * @internal\n */\nexport class RangeTreeOps {\n  /** Count nodes in this tree. */\n  public static getRecursiveNodeCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\n    let count = 0;\n    root.recurseIntoTree((_node: RangeTreeNode<AppDataType>): boolean => { count++; return true; });\n    return count;\n  }\n  /** Count appData in this tree. */\n  public static getRecursiveAppDataCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\n    let count = 0;\n    root.recurseIntoTree(\n      (node: RangeTreeNode<AppDataType>): boolean => { count += node.getNumAppData(); return true; });\n    return count;\n  }\n  /**\n   * Create a leaf referencing appData items indexed index0<=index<index1 and with combined range of the same indices\n   * @param ranges access to ranges\n   * @param appData access to AppDataType items\n   * @param index0 first index for block of items\n   * @param index1 upper limit index for block of items.\n   * @param arrayLength one more than the largest range/appData index\n   * @returns newly created node.\n   */\n  private static createLeafInIndexRange<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    index0: number,\n    index1: number,\n    arrayLength: number): RangeTreeNode<AppDataType> {\n    const appDataBlock: AppDataType[] = [];\n    const range = Range3d.createNull();\n    index1 = Math.min(index1, arrayLength);\n    // console.log({ case: \"LEAF\", index0, index1 });\n    for (let i = index0; i < index1; i++) {\n      appDataBlock.push(evaluateIndexToType(appData, i));\n      range.extendRange(evaluateIndexToType(ranges, i));\n    }\n    return RangeTreeNode.createCapture(range, appDataBlock, undefined);\n  }\n  /**\n   * Split the array entries appData[index0 <= i < index1] into blocks of at most maxChildPerNode * maxAppDataPerLeaf and assemble into a tree structure.\n   * @param ranges access to ranges\n   * @param appData access to AppDataType items\n   * @param index0 start index of the block to access\n   * @param index1 terminal index for the block (one after final)\n   * @param arrayLength one more than the largest range/appData index\n   * @param maxChildPerNode max number of child nodes in each interior node\n   * @param maxAppDataPerLeaf max number of appData items in each leaf.\n   * @returns\n   */\n  private static createRecursiveByIndexSplits<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    index0: number,\n    index1: number,\n    arrayLength: number,\n    maxChildPerNode: number,\n    maxAppDataPerLeaf: number,\n  ): RangeTreeNode<AppDataType> | undefined {\n    if (index1 > arrayLength)\n      index1 = arrayLength;\n\n    const range = Range3d.createNull();\n    const children: RangeTreeNode<AppDataType>[] = [];\n    const maxChildrenAppData = maxChildPerNode * maxAppDataPerLeaf;\n    // console.log({ name: \"createRecursive\", index0, index1, maxChildrenAppData });\n\n    if (index1 <= index0 + maxChildrenAppData) {  // index range is small enough to hold the appData in leaf children\n      // console.log({ case: \"LEAF GROUP\", index0, index1 });\n      for (let indexA = index0 + maxAppDataPerLeaf; index0 < index1; index0 = indexA, indexA = Math.min(indexA + maxAppDataPerLeaf, index1)) {\n        const leaf = RangeTreeOps.createLeafInIndexRange(ranges, appData, index0, indexA, arrayLength);\n        if (leaf !== undefined) {\n          range.extendRange(leaf.getRangeRef());\n          children.push(leaf);\n        }\n      }\n    } else {  // split the appData among interior and leaf children\n      // console.log({ case: \"INTERIOR\", index0, index1 });\n      const numPerGulp = Math.ceil((index1 - index0) / maxChildPerNode);\n      for (let indexA = index0 + numPerGulp; index0 < index1; index0 = indexA, indexA = Math.min(indexA + numPerGulp, index1)) {\n        const child = this.createRecursiveByIndexSplits(ranges, appData, index0, indexA, arrayLength, maxChildPerNode, maxAppDataPerLeaf);\n        if (child !== undefined) {\n          range.extendRange(child.getRangeRef());\n          children.push(child);\n        }\n      }\n    }\n    return (children.length > 0) ? RangeTreeNode.createCapture(range, undefined, children) : undefined;\n  }\n  /**\n   * Create a range tree by simple left-right split of given ranges.\n   * * Leaves carry the inputs in left-to-right order.\n   * * Each leaf range is labeled by its corresponding object(s) in the appData array.\n   * @param ranges access to ranges.\n   * @param appData access to AppDataType items (for leaves).\n   * @param arrayLength one more than the largest range/appData index\n   * @param maxChildrenPerNode max number of child nodes allowed for each interior node.\n   * @param maxAppDataPerLeaf max number of appData items allowed in each leaf.\n   * @returns the root of the new tree, or undefined if array lengths differ or are zero.\n   */\n  public static createByIndexSplits<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    arrayLength: number,\n    maxChildrenPerNode: number = 2,\n    maxAppDataPerLeaf: number = 2,\n  ): RangeTreeNode<AppDataType> | undefined {\n    // console.log();\n    // const numData = getFlexDataCount(appData);\n    // console.log({ numData });\n    if (arrayLength <= 0\n      || (Array.isArray(ranges) && ranges.length !== arrayLength)\n      || (Array.isArray(appData) && appData.length !== arrayLength))\n      return undefined;\n    if (maxChildrenPerNode < 2)\n      maxChildrenPerNode = 2;\n    return RangeTreeOps.createRecursiveByIndexSplits<AppDataType>(ranges, appData, 0, arrayLength, arrayLength, maxChildrenPerNode, maxAppDataPerLeaf);\n  }\n}\n\n"]}
+{"version":3,"file":"RangeTreeNode.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeNode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAC7C,kDAAiD;AAejD;;;;;GAKG;AACH,SAAS,mBAAmB,CAAI,IAAoB,EAAE,KAAa;IACjE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;AACrB,CAAC;AACD;;;GAGG;AACH,SAAS,UAAU,CAAI,KAAa,EAAE,IAAiB;IACrD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM;gBACrB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AACD;;;GAGG;AACH,SAAS,gBAAgB,CAAI,IAAiB;IAC5C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AACD;;;GAGG;AACH,MAAsB,uBAAuB;IAS3C;;;;OAIG;IACI,YAAY,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;CACjD;AAfD,0DAeC;AACD;;;GAGG;AACH,MAAsB,oBAAoB;IAUxC;;;;OAIG;IACI,YAAY,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;IAChD,gEAAgE;IACzD,SAAS,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;CAC9C;AAlBD,oDAkBC;AACD;;;;;GAKG;AACH,MAAsB,wCAAsD,SAAQ,oBAAiC;IAOnH;;;;;OAKG;IACa,iBAAiB,CAAC,SAAkB,EAAE,UAAmB;QACvE,MAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAClD,MAAM,qBAAqB,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QACjI,OAAO,qBAAqB,IAAI,eAAe,CAAC;IAClD,CAAC;CACF;AAlBD,4FAkBC;AAED,IAAI,cAAc,GAAG,CAAC,CAAC;AAEvB;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAa,aAAa;IAChB,MAAM,CAAU;IAChB,QAAQ,CAAwB;IAChC,SAAS,CAAuC;IACxD,iFAAiF;IACzE,GAAG,CAAS;IACpB;;;;;;OAMG;IACH,YAAoB,KAAc,EAAE,OAA8B,EAAE,QAA8C;QAChH,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,GAAG,GAAG,cAAc,EAAE,CAAC;QAC5B,iCAAiC;QACjC,qCAAqC;QACrC,0DAA0D;QAC1D,oDAAoD;QACpD,uCAAuC;QACvC,gDAAgD;QAChD,uDAAuD;IACzD,CAAC;IACD,wEAAwE;IACjE,MAAM,CAAC,aAAa,CACzB,KAAc,EACd,OAA8B,EAC9B,QAA8C;QAC9C,OAAO,IAAI,aAAa,CAAc,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAClE,CAAC;IACD,2EAA2E;IACpE,QAAQ,CAAC,IAAa;QAC3B,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,sDAAsD;IAC/C,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,2DAA2D;IACpD,WAAW;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;;;;OAMG;IACI,eAAe,CAAC,KAAa;QAClC,OAAO,UAAU,CAA6B,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACvE,CAAC;IACD;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAa;QACpC,OAAO,UAAU,CAAc,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IACD,qDAAqD;IAC9C,cAAc;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,8DAA8D;IACvD,aAAa;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IACD;;;OAGG;IACI,cAAc;QACnB,OAAO,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IACD;;;OAGG;IACI,aAAa;QAClB,OAAO,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IACD;;;OAGG;IACI,eAAe,CAAC,YAA2D;QAChF,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS;oBAChC,KAAK,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YACxC,CAAC;iBAAM,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACxC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,OAA6C;QAChE,IAAI,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,IAAI,aAAsC,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,aAAa,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/E,8BAA8B;gBAC9B,OAAO,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;gBACtC,IAAI,OAAO,CAAC,YAAY,EAAE;oBACxB,OAAO;YACX,CAAC;YACD,IAAI,KAA6C,CAAC;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrE,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,6BAA6B,CAC1C,WAAkC,EAClC,UAAwC,EACxC,WAAoB,EACpB,OAA0C;QAE1C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,QAAiC,CAAC;YACtC,IAAI,SAAkC,CAAC;YACvC,yGAAyG;YACzG,KAAK,IAAI,UAAU,GAAG,UAAU,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,CAAC,GAAG,CAAC;gBAC3D,MAAM,YAAY,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC;gBACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAAc,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;oBACrH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAc,SAAS,EAAE,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;wBAChH,IAAI,CAAC,WAAW;4BACd,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;;4BAEhD,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;wBAClD,IAAI,OAAO,CAAC,YAAY,EAAE;4BACxB,OAAO;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,wBAAwB,CACrC,WAAkC,EAClC,YAAmC,EACnC,WAAoB,EACpB,OAA0C;QAE1C,IAAI,WAAW,KAAK,SAAS,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC5D,IAAI,QAAiC,CAAC;YACtC,IAAI,SAAkC,CAAC;YACvC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAAc,UAAU,EAAE,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;gBACrH,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAc,SAAS,EAAE,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;oBAChH,IAAI,CAAC,WAAW;wBACd,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;;wBAEhD,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAClD,IAAI,OAAO,CAAC,YAAY,EAAE;wBACxB,OAAO;gBACX,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,SAAS,CACtB,GAA+B,EAC/B,QAAsC,EACtC,WAAyC;QAEzC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,QAAQ,CACrB,GAA+B,EAC/B,QAAsC,EACtC,WAAyC;QAEzC,IAAA,qBAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QAC9C,QAAQ,CAAC,GAAG,EAAE,CAAC;QACf,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/B,WAAW,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACK,MAAM,CAAC,mBAAmB,CAChC,OAAmC,EACnC,SAAuC,EACvC,oBAAkD,EAClD,QAAoC,EACpC,UAAwC,EACxC,qBAAmD,EACnD,OAA0C;QAE1C,+DAA+D;QAC/D,MAAM,iBAAiB,GAAG,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC;QACzD,MAAM,kBAAkB,GAAG,QAAQ,CAAC,QAAQ,KAAK,SAAS,CAAC;QAC3D,IAAI,SAAiD,CAAC;QACtD,IAAI,UAAkD,CAAC;QAEvD,kIAAkI;QAClI,IAAI,iBAAiB,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1D,IAAI,CAAC,6BAA6B,CAAc,OAAO,CAAC,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAC3G,CAAC;QACD,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,IAAI,kBAAkB,EAAE,CAAC;YAC1D,IAAI,CAAC,6BAA6B,CAAc,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1G,CAAC;QAED,IAAI,OAAO,CAAC,iBAAiB,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/D,IAAI,CAAC,wBAAwB,CAAc,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAEhG,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACxE,IAAI,CAAC,SAAS,CAAc,OAAO,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;gBACtE,IAAI,CAAC,SAAS,CAAc,QAAQ,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;gBACzE,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAA6B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;oBACtI,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,UAAU,GAAG,UAAU,CAA6B,UAAU,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC;wBAC3I,IAAI,CAAC,mBAAmB,CACtB,SAAS,EAAE,SAAS,EAAE,oBAAoB,EAC1C,UAAU,EAAE,UAAU,EAAE,qBAAqB,EAC7C,OAAO,CAAC,CAAC;oBACb,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,QAAQ,CAAc,OAAO,EAAE,SAAS,EAAE,oBAAoB,CAAC,CAAC;gBACrE,IAAI,CAAC,QAAQ,CAAc,QAAQ,EAAE,UAAU,EAAE,qBAAqB,CAAC,CAAC;YAC1E,CAAC;iBAAM,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC3C,IAAI,CAAC,uBAAuB,CAAc,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YACtG,CAAC;iBAAM,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5C,IAAI,CAAC,uBAAuB,CAAc,QAAQ,EAAE,OAAO,EAAE,oBAAoB,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;YACpG,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,uBAAuB,CACpC,OAAmC,EACnC,QAAoC,EACpC,qBAAmD,EACnD,WAAoB,EACpB,OAA0C;QAE1C,IAAA,qBAAM,EAAC,QAAQ,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;QACzC,kGAAkG;QAClG,wJAAwJ;QACxJ,IAAI,SAAiD,CAAC;QACtD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,SAAS,GAAG,UAAU,CAA6B,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;YACtI,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjE,IAAI,CAAC,wBAAwB,CAAc,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,QAAQ,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;gBACxG,IAAI,CAAC,6BAA6B,CAAc,SAAS,CAAC,QAAQ,EAAE,qBAAqB,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;gBACjH,IAAI,CAAC,uBAAuB,CAAc,SAAS,EAAE,QAAQ,EAAE,qBAAqB,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;YAC9G,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,qBAAqB,CACjC,QAAoC,EACpC,SAAqC,EACrC,OAA0C;QAE1C,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IACzE,CAAC;CACF;AA3TD,sCA2TC;AACD;;;GAGG;AACH,MAAa,YAAY;IACvB,gCAAgC;IACzB,MAAM,CAAC,qBAAqB,CAAc,IAAgC;QAC/E,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,CAAC,CAAC,KAAiC,EAAW,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kCAAkC;IAC3B,MAAM,CAAC,wBAAwB,CAAc,IAAgC;QAClF,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,CAClB,CAAC,IAAgC,EAAW,EAAE,GAAG,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAClG,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;OAQG;IACK,MAAM,CAAC,sBAAsB,CACnC,MAA4B,EAC5B,OAAiC,EACjC,MAAc,EACd,MAAc,EACd,WAAmB;QACnB,MAAM,YAAY,GAAkB,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACvC,iDAAiD;QACjD,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,YAAY,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,KAAK,CAAC,WAAW,CAAC,mBAAmB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IACrE,CAAC;IACD;;;;;;;;;;OAUG;IACK,MAAM,CAAC,4BAA4B,CACzC,MAA4B,EAC5B,OAAiC,EACjC,MAAc,EACd,MAAc,EACd,WAAmB,EACnB,eAAuB,EACvB,iBAAyB;QAEzB,IAAI,MAAM,GAAG,WAAW;YACtB,MAAM,GAAG,WAAW,CAAC;QAEvB,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAClD,MAAM,kBAAkB,GAAG,eAAe,GAAG,iBAAiB,CAAC;QAC/D,gFAAgF;QAEhF,IAAI,MAAM,IAAI,MAAM,GAAG,kBAAkB,EAAE,CAAC,CAAE,mEAAmE;YAC/G,uDAAuD;YACvD,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,iBAAiB,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,iBAAiB,EAAE,MAAM,CAAC,EAAE,CAAC;gBACtI,MAAM,IAAI,GAAG,YAAY,CAAC,sBAAsB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC/F,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;oBACtC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC,CAAE,qDAAqD;YAC7D,qDAAqD;YACrD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC;YAClE,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC;gBACxH,MAAM,KAAK,GAAG,IAAI,CAAC,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,iBAAiB,CAAC,CAAC;gBAClI,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;oBACvC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAA4B,EAC5B,OAAiC,EACjC,WAAmB,EACnB,qBAA6B,CAAC,EAC9B,oBAA4B,CAAC;QAE7B,iBAAiB;QACjB,6CAA6C;QAC7C,4BAA4B;QAC5B,IAAI,WAAW,IAAI,CAAC;eACf,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC;eACxD,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,CAAC;YAC7D,OAAO,SAAS,CAAC;QACnB,IAAI,kBAAkB,GAAG,CAAC;YACxB,kBAAkB,GAAG,CAAC,CAAC;QACzB,OAAO,YAAY,CAAC,4BAA4B,CAAc,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE,kBAAkB,EAAE,iBAAiB,CAAC,CAAC;IACrJ,CAAC;CACF;AAtHD,oCAsHC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module RangeSearch\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Range3d } from \"../../geometry3d/Range\";\n\n/** Type name FlexData is shorthand for a member or parameter which can be:\n * * undefined\n * * an array of values of type T\n * * a singleton of type T\n */\ntype FlexData<T> = undefined | T[] | T;\n/**\n * Type name IndexToType is shorthand for a member or parameter which can be:\n * * an array of values of type T\n * * a function from integers to type T.\n */\ntype IndexToType<T> = T[] | ((index: number) => T);\n\n/**\n * Map an (unchecked) integer to a parameterized type T, where the data argument can be either:\n * * an array of type T\n * * a function which takes an index and returns type T\n * @internal\n */\nfunction evaluateIndexToType<T>(data: IndexToType<T>, index: number): T {\n  if (Array.isArray(data))\n    return data[index];\n  return data(index);\n}\n/**\n * Get data by index from a source that may be undefined, an array of item of type T, or a singleton of the item type.\n * @internal\n */\nfunction getByIndex<T>(index: number, data: FlexData<T>): T | undefined {\n  if (data !== undefined) {\n    if (Array.isArray(data)) {\n      if (index < data.length)\n        return data[index];\n    } else {\n      return data;\n    }\n  }\n  return undefined;\n}\n/**\n * Return the number of items in an object that can be undefined, an array of item of type T, or a singleton of the item type.\n * @internal\n */\nfunction getFlexDataCount<T>(data: FlexData<T>): number {\n  if (data !== undefined) {\n    if (Array.isArray(data)) {\n      return data.length;\n    } else {\n      return 1;\n    }\n  }\n  return 0;\n}\n/**\n * Abstract class for handler objects called during traversal of a single range tree.\n * @internal\n */\nexport abstract class SingleTreeSearchHandler<AppDataType> {\n  /** Return true if appData within the range should be offered to `processAppData`. */\n  public abstract isRangeActive(range: Range3d): boolean;\n  /**\n   * Called for a (single) child referenced by a tree.\n   * * This is only called when range checks on the path from root have been passed.\n   * @param item child (of type AppDataType) in the tree.\n   */\n  public abstract processAppData(item: AppDataType): void;\n  /**\n   * Query to see if the active search has been aborted.\n   * * Default implementation returns false so query runs to completion.\n   * * Search processes check this after range tests and child processing.\n   */\n  public getIsAborted(): boolean { return false; }\n}\n/**\n * Abstract class for handler objects called during traversal of two range trees.\n * @internal\n */\nexport abstract class TwoTreeSearchHandler<AppDataType> {\n  /** Return true if appData within the ranges should be offered to `processAppDataPair`. */\n  public abstract isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean;\n  /**\n   * Called with AppDataType items from left tree and right tree.\n   * * This is only called when range tests have been passed.\n   * @param leftItem\n   * @param rightItem\n   */\n  public abstract processAppDataPair(leftItem: AppDataType, rightItem: AppDataType): void;\n  /**\n   * Query to see if the active search has been aborted.\n   * * Default implementation returns false so query runs to completion.\n   * * Search processes check this after range tests and child processing.\n   */\n  public getIsAborted(): boolean { return false; }\n  /** Whether to ignore z-coordinates in distance computations. */\n  public getXYOnly(): boolean { return false; }\n}\n/**\n * This class refines the TwoTreeSearchHandler with an implementation of `isRangePairActive` appropriate for computing the minimum distance between trees.\n * * The concrete class must implement `getCurrentDistance()` method to provide the best-so-far distance.\n * * The implementation of `isRangePairActive` returns true if the distance between ranges is less than or equal to the `getCurrentDistance()` value.\n * @internal\n */\nexport abstract class TwoTreeDistanceMinimizationSearchHandler<AppDataType> extends TwoTreeSearchHandler<AppDataType>{\n  /**\n   * Provides the allowable distance between ranges.\n   * * Range pairs with more than this distance separation are rejected.\n   * * The implementation may alter (probably reduce) the getCurrentDistance() value as the search progresses.\n   */\n  public abstract getCurrentDistance(): number;\n  /**\n   * Method called to decide whether to process subtrees and immediate child appData items from a left tree node and right tree node.\n   * @param leftRange range from a node in the left tree\n   * @param rightRange range from a node in the right tree.\n   * @returns true if the smallest distance from leftRange to rightRange is less than or equal to getCurrentDistance()\n   */\n  public override isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean {\n    const currentDistance = this.getCurrentDistance();\n    const distanceBetweenRanges = this.getXYOnly() ? leftRange.distanceToRangeXY(rightRange) : leftRange.distanceToRange(rightRange);\n    return distanceBetweenRanges <= currentDistance;\n  }\n}\n\nlet numNodeCreated = 0;\n\n/**\n * * TREE STRUCTURE\n *   * A RangeTreeNode is part of a range tree.\n *   * TREE is used here in a strictly _structural_ sense, which has no broad promises about data members.\n *   * Each RangeNode points to 0, 1 or many children.\n *   * Each child has (but does not point back to) a single parent.\n *   * The overall tree has a single root.\n *   * Each node is effectively the root of the tree of its children.\n * * NON-TREE DATA MEMBERS\n *   * Data members in each node (in addition to children) are\n *     * _range = the union of ranges below in the heap\n *     * _appData = application data associated with the node.\n *       * Construction methods may place multiple _appData items in each node.\n *       * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.\n * * CONSTRUCTION\n *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.\n *     * The appData is placed entirely in the leaves.\n *     * The caller can specify:\n *       * the number of _appData items per leaf\n *       * the number of children per node within the tree.\n *     * Compared to \"shallow\" trees with many children per node and many appData per leaf, \"deep\" trees with 2 children per node and 1 appData per leaf may have:\n *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.\n *       * larger memory use because of more nodes\n *   * For future construction methods:\n *      * _appData \"above the leaves\" may allow nodes below to have smaller ranges, but add complexity to search.\n * @internal\n */\nexport class RangeTreeNode<AppDataType> {\n  private _range: Range3d;\n  private _appData: FlexData<AppDataType>;\n  private _children: FlexData<RangeTreeNode<AppDataType>>;\n  /** an id assigned sequentially as nodes are created.  For debugging use only. */\n  private _id: number;\n  /**\n   * CONSTRUCTOR\n   * CAPTURE (not copy)\n   * * range = range for search algorithms\n   * * appData = application data relevant to this node.\n   * * children = child node reference(s).\n   */\n  private constructor(range: Range3d, appData: FlexData<AppDataType>, children: FlexData<RangeTreeNode<AppDataType>>) {\n    this._range = range;\n    this._appData = appData;\n    this._children = children;\n    this._id = numNodeCreated++;\n    // const childIds: number[] = [];\n    // if (Array.isArray(this._children))\n    //   for (const c of this._children) childIds.push(c._id);\n    // else if (this._children instanceof RangeTreeNode)\n    //   childIds.push(this._children._id);\n    // const numAppData = getFlexDataCount(appData);\n    // console.log({ id: this._id, childIds, numAppData });\n  }\n  /** Simplest public create: capture the range, appData, and children. */\n  public static createCapture<AppDataType>(\n    range: Range3d,\n    appData: FlexData<AppDataType>,\n    children: FlexData<RangeTreeNode<AppDataType>>): RangeTreeNode<AppDataType> {\n    return new RangeTreeNode<AppDataType>(range, appData, children);\n  }\n  /** copy (not capture) from given data into the range in this RangeEntry */\n  public setRange(data: Range3d) {\n    this._range.setFrom(data);\n  }\n  /** return (a copy of) the range in this RangeEntry */\n  public getRange(data?: Range3d): Range3d {\n    return this._range.clone(data);\n  }\n  /** return (a reference to) the range in this RangeEntry */\n  public getRangeRef(): Range3d {\n    return this._range;\n  }\n  /**\n   * Access a child by index.\n   * * If the child data is an array, this dereferences the array.\n   * * If the child data is a singleton, treat it as index 0.\n   * * return undefined if there are no children.\n   * @param index index of item to access.\n   */\n  public getChildByIndex(index: number): RangeTreeNode<AppDataType> | undefined {\n    return getByIndex<RangeTreeNode<AppDataType>>(index, this._children);\n  }\n  /**\n   * * Access an appData by index.\n   * * If the appData data is an array, this dereferences the array.\n   * * If the appData data is a singleton, treat it as if it is at index 0 in an array\n   * * return undefined if there are no appData or for any index out of range.\n   * @param index index of item to access.\n   */\n  public getAppDataByIndex(index: number): AppDataType | undefined {\n    return getByIndex<AppDataType>(index, this._appData);\n  }\n  /** Access the children or child (does not clone). */\n  public getAllChildren(): FlexData<RangeTreeNode<AppDataType>> {\n    return this._children;\n  }\n  /** Access the appData array or singleton (does not clone). */\n  public getAllAppData(): FlexData<AppDataType> {\n    return this._appData;\n  }\n  /**\n   * Count the direct children in this node of the tree.\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveNodeCount`.\n   */\n  public getNumChildren(): number {\n    return getFlexDataCount(this._children);\n  }\n  /**\n   * Count the appData items in this node of the tree.\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveAppDataCount`.\n   */\n  public getNumAppData(): number {\n    return getFlexDataCount(this._appData);\n  }\n  /**\n   * Depth-first tree iteration, calling `announceNode` on each node.\n   * @param announceNode callback that returns true to recurse into children\n   */\n  public recurseIntoTree(announceNode: (node: RangeTreeNode<AppDataType>) => boolean) {\n    const doChildren = announceNode(this);\n    if (doChildren) {\n      if (Array.isArray(this._children)) {\n        for (const child of this._children)\n          child.recurseIntoTree(announceNode);\n      } else if (this._children !== undefined) {\n        this._children.recurseIntoTree(announceNode);\n      }\n    }\n  }\n  /**\n   * Depth-first tree iteration via handler.\n   * * if handler decides the instance range is active, process appData, then recurse on children\n   * * if handler decides to abort after processing an appData, skip processing rest of appData and children\n   */\n  public searchTopDown(handler: SingleTreeSearchHandler<AppDataType>) {\n    if (handler.isRangeActive(this._range)) {\n      let itemToProcess: AppDataType | undefined;\n      for (let i = 0; undefined !== (itemToProcess = this.getAppDataByIndex(i)); i++) {\n        // console.log(itemToProcess);\n        handler.processAppData(itemToProcess);\n        if (handler.getIsAborted())\n          return;\n      }\n      let child: RangeTreeNode<AppDataType> | undefined;\n      for (let i = 0; undefined !== (child = this.getChildByIndex(i)); i++) {\n        child.searchTopDown(handler);\n      }\n    }\n  }\n\n  /**\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightStack.\n   * @param leftAppData singleton or array with data \"from left\"\n   * @param rightStack stack of nodes to process from right path.\n   * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.\n   * @param handler search handler\n   */\n  private static processAppDataAndAppDataStack<AppDataType>(\n    leftAppData: FlexData<AppDataType>,\n    rightStack: RangeTreeNode<AppDataType>[],\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    if (leftAppData !== undefined) {\n      let leftItem: AppDataType | undefined;\n      let rightItem: AppDataType | undefined;\n      // hmm.. we ASSUME that if the tip ranges passed, then all parent ranges would pass without further test.\n      for (let rangeIndex = rightStack.length; rangeIndex-- > 0;) {\n        const rightAppData = rightStack[rangeIndex]._appData;\n        for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\n          for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\n            if (!reverseArgs)\n              handler.processAppDataPair(leftItem, rightItem);\n            else\n              handler.processAppDataPair(rightItem, leftItem);\n            if (handler.getIsAborted())\n              return;\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightAppData.\n   * @param leftAppData singleton or array with data \"from left\"\n   * @param rightAppData singleton or array with data \"from right\"\n   * @param reverseArgs true if the caller is exchanging the sense of left and right and this should be undone in the actual call to handler.processAppDataPair.\n   * @param handler search handler\n   */\n  private static processAppDataAndAppData<AppDataType>(\n    leftAppData: FlexData<AppDataType>,\n    rightAppData: FlexData<AppDataType>,\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    if (leftAppData !== undefined && rightAppData !== undefined) {\n      let leftItem: AppDataType | undefined;\n      let rightItem: AppDataType | undefined;\n      for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\n        for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\n          if (!reverseArgs)\n            handler.processAppDataPair(leftItem, rightItem);\n          else\n            handler.processAppDataPair(rightItem, leftItem);\n          if (handler.getIsAborted())\n            return;\n        }\n      }\n    }\n  }\n  /**\n   * Push the tip node to stack(s).\n   * @param tip new node (to be pushed)\n   * @param fullPath complete path, which is always extended\n   * @param partialPath partial path, which is only extended if the tip has _appData.\n   */\n  private static pushPaths<AppDataType>(\n    tip: RangeTreeNode<AppDataType>,\n    fullPath: RangeTreeNode<AppDataType>[],\n    partialPath: RangeTreeNode<AppDataType>[],\n  ) {\n    fullPath.push(tip);\n    if (tip._appData !== undefined) {\n      partialPath.push(tip);\n    }\n  }\n  /**\n   * Pop the tip node from stack(s).\n   * @param tip should match the fullPath tip.\n   * @param fullPath complete path, which is always popped\n   * @param partialPath partial path, which is only popped if the tip has _appData.\n   */\n  private static popPaths<AppDataType>(\n    tip: RangeTreeNode<AppDataType>,\n    fullPath: RangeTreeNode<AppDataType>[],\n    partialPath: RangeTreeNode<AppDataType>[],\n  ) {\n    assert(fullPath[fullPath.length - 1] === tip);\n    fullPath.pop();\n    if (tip._appData !== undefined) {\n      partialPath.pop();\n    }\n  }\n  /**\n   * Process nodes from left and right trees of dual search.\n   * * The separate stacks for nodes that have appData is for efficiency.\n   * * If data is entirely in the leaves (or just in a few nodes), the stacks will all be empty (or very small) and no time will be wasted looking up the stacks for appData to process with the other tip.\n   * @param leftTip tip node being explored on left\n   * @param leftStack stack of prior left nodes\n   * @param leftStackWithAppData stack of prior left nodes which have appData.\n   * @param rightTip tip node being explored on right.\n   * @param rightStack stack of prior right nodes.\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\n   * @param handler search handler\n   */\n  private static recursivePairSearch<AppDataType>(\n    leftTip: RangeTreeNode<AppDataType>,\n    leftStack: RangeTreeNode<AppDataType>[],\n    leftStackWithAppData: RangeTreeNode<AppDataType>[],\n    rightTip: RangeTreeNode<AppDataType>,\n    rightStack: RangeTreeNode<AppDataType>[],\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    // console.log({ leftId: leftTip._id, rightId: rightTip._id });\n    const leftTipHasAppData = leftTip._appData !== undefined;\n    const rightTipHasAppData = rightTip._appData !== undefined;\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\n    let rightChild: RangeTreeNode<AppDataType> | undefined;\n\n    // process immediate appData from each tip node with the entire prior path of the other side (each stack currently lacks the tip).\n    if (leftTipHasAppData && rightStackWithAppData.length > 0) {\n      this.processAppDataAndAppDataStack<AppDataType>(leftTip._appData, rightStackWithAppData, false, handler);\n    }\n    if (leftStackWithAppData.length > 0 && rightTipHasAppData) {\n      this.processAppDataAndAppDataStack<AppDataType>(rightTip._appData, leftStackWithAppData, true, handler);\n    }\n\n    if (handler.isRangePairActive(leftTip._range, rightTip._range)) {\n      this.processAppDataAndAppData<AppDataType>(leftTip._appData, rightTip._appData, false, handler);\n\n      if (leftTip._children !== undefined && rightTip._children !== undefined) {\n        this.pushPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\n        this.pushPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\n        for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\n          for (let rightIndex = 0; undefined !== (rightChild = getByIndex<RangeTreeNode<AppDataType>>(rightIndex, rightTip._children)); rightIndex++) {\n            this.recursivePairSearch(\n              leftChild, leftStack, leftStackWithAppData,\n              rightChild, rightStack, rightStackWithAppData,\n              handler);\n          }\n        }\n        this.popPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\n        this.popPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\n      } else if (leftTip._children !== undefined) {\n        this.leftRecursivePairSearch<AppDataType>(leftTip, rightTip, rightStackWithAppData, false, handler);\n      } else if (rightTip._children !== undefined) {\n        this.leftRecursivePairSearch<AppDataType>(rightTip, leftTip, leftStackWithAppData, true, handler);\n      }\n    }\n  }\n  /**\n   * Recurse below the tip of leftTip, offering each level's appData to the appData of rightTip and rightStackWithAppData.\n   * @param leftTip tip node being explored on left. Its appData is not processed.\n   * @param rightTip tip node being explored on right. It has no children.\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\n   * @param reverseArgs true if the caller is exchanging the sense of left and right\n   * @param handler search handler\n   */\n  private static leftRecursivePairSearch<AppDataType>(\n    leftTip: RangeTreeNode<AppDataType>,\n    rightTip: RangeTreeNode<AppDataType>,\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\n    reverseArgs: boolean,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    assert(rightTip._children === undefined);\n    // The (possibly deep) left children appData needs to be offered to the right path (including tip)\n    // Note that there are no stack push/pop operations -- the right stack is already reaching to leaf level, so there are no range or appData nodes to add.\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\n    for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\n      if (handler.isRangePairActive(leftChild._range, rightTip._range)) {\n        this.processAppDataAndAppData<AppDataType>(leftChild._appData, rightTip._appData, reverseArgs, handler);\n        this.processAppDataAndAppDataStack<AppDataType>(leftChild._appData, rightStackWithAppData, reverseArgs, handler);\n        this.leftRecursivePairSearch<AppDataType>(leftChild, rightTip, rightStackWithAppData, reverseArgs, handler);\n      }\n    }\n  }\n  /**\n   * Recursive search down two trees, with range tests and child processing under control of a handler.\n   * @param leftRoot root of left tree\n   * @param rightRoot root of right tree\n   * @param handler handler for range tests and child process\n   */\n  public static searchTwoTreesTopDown<AppDataType>(\n    leftRoot: RangeTreeNode<AppDataType>,\n    rightRoot: RangeTreeNode<AppDataType>,\n    handler: TwoTreeSearchHandler<AppDataType>,\n  ) {\n    this.recursivePairSearch(leftRoot, [], [], rightRoot, [], [], handler);\n  }\n}\n/**\n * Utilities for various operations on RangeTree\n * @internal\n */\nexport class RangeTreeOps {\n  /** Count nodes in this tree. */\n  public static getRecursiveNodeCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\n    let count = 0;\n    root.recurseIntoTree((_node: RangeTreeNode<AppDataType>): boolean => { count++; return true; });\n    return count;\n  }\n  /** Count appData in this tree. */\n  public static getRecursiveAppDataCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\n    let count = 0;\n    root.recurseIntoTree(\n      (node: RangeTreeNode<AppDataType>): boolean => { count += node.getNumAppData(); return true; });\n    return count;\n  }\n  /**\n   * Create a leaf referencing appData items indexed index0<=index<index1 and with combined range of the same indices\n   * @param ranges access to ranges\n   * @param appData access to AppDataType items\n   * @param index0 first index for block of items\n   * @param index1 upper limit index for block of items.\n   * @param arrayLength one more than the largest range/appData index\n   * @returns newly created node.\n   */\n  private static createLeafInIndexRange<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    index0: number,\n    index1: number,\n    arrayLength: number): RangeTreeNode<AppDataType> {\n    const appDataBlock: AppDataType[] = [];\n    const range = Range3d.createNull();\n    index1 = Math.min(index1, arrayLength);\n    // console.log({ case: \"LEAF\", index0, index1 });\n    for (let i = index0; i < index1; i++) {\n      appDataBlock.push(evaluateIndexToType(appData, i));\n      range.extendRange(evaluateIndexToType(ranges, i));\n    }\n    return RangeTreeNode.createCapture(range, appDataBlock, undefined);\n  }\n  /**\n   * Split the array entries appData[index0 <= i < index1] into blocks of at most maxChildPerNode * maxAppDataPerLeaf and assemble into a tree structure.\n   * @param ranges access to ranges\n   * @param appData access to AppDataType items\n   * @param index0 start index of the block to access\n   * @param index1 terminal index for the block (one after final)\n   * @param arrayLength one more than the largest range/appData index\n   * @param maxChildPerNode max number of child nodes in each interior node\n   * @param maxAppDataPerLeaf max number of appData items in each leaf.\n   * @returns\n   */\n  private static createRecursiveByIndexSplits<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    index0: number,\n    index1: number,\n    arrayLength: number,\n    maxChildPerNode: number,\n    maxAppDataPerLeaf: number,\n  ): RangeTreeNode<AppDataType> | undefined {\n    if (index1 > arrayLength)\n      index1 = arrayLength;\n\n    const range = Range3d.createNull();\n    const children: RangeTreeNode<AppDataType>[] = [];\n    const maxChildrenAppData = maxChildPerNode * maxAppDataPerLeaf;\n    // console.log({ name: \"createRecursive\", index0, index1, maxChildrenAppData });\n\n    if (index1 <= index0 + maxChildrenAppData) {  // index range is small enough to hold the appData in leaf children\n      // console.log({ case: \"LEAF GROUP\", index0, index1 });\n      for (let indexA = index0 + maxAppDataPerLeaf; index0 < index1; index0 = indexA, indexA = Math.min(indexA + maxAppDataPerLeaf, index1)) {\n        const leaf = RangeTreeOps.createLeafInIndexRange(ranges, appData, index0, indexA, arrayLength);\n        if (leaf !== undefined) {\n          range.extendRange(leaf.getRangeRef());\n          children.push(leaf);\n        }\n      }\n    } else {  // split the appData among interior and leaf children\n      // console.log({ case: \"INTERIOR\", index0, index1 });\n      const numPerGulp = Math.ceil((index1 - index0) / maxChildPerNode);\n      for (let indexA = index0 + numPerGulp; index0 < index1; index0 = indexA, indexA = Math.min(indexA + numPerGulp, index1)) {\n        const child = this.createRecursiveByIndexSplits(ranges, appData, index0, indexA, arrayLength, maxChildPerNode, maxAppDataPerLeaf);\n        if (child !== undefined) {\n          range.extendRange(child.getRangeRef());\n          children.push(child);\n        }\n      }\n    }\n    return (children.length > 0) ? RangeTreeNode.createCapture(range, undefined, children) : undefined;\n  }\n  /**\n   * Create a range tree by simple left-right split of given ranges.\n   * * Leaves carry the inputs in left-to-right order.\n   * * Each leaf range is labeled by its corresponding object(s) in the appData array.\n   * @param ranges access to ranges.\n   * @param appData access to AppDataType items (for leaves).\n   * @param arrayLength one more than the largest range/appData index\n   * @param maxChildrenPerNode max number of child nodes allowed for each interior node.\n   * @param maxAppDataPerLeaf max number of appData items allowed in each leaf.\n   * @returns the root of the new tree, or undefined if array lengths differ or are zero.\n   */\n  public static createByIndexSplits<AppDataType>(\n    ranges: IndexToType<Range3d>,\n    appData: IndexToType<AppDataType>,\n    arrayLength: number,\n    maxChildrenPerNode: number = 2,\n    maxAppDataPerLeaf: number = 2,\n  ): RangeTreeNode<AppDataType> | undefined {\n    // console.log();\n    // const numData = getFlexDataCount(appData);\n    // console.log({ numData });\n    if (arrayLength <= 0\n      || (Array.isArray(ranges) && ranges.length !== arrayLength)\n      || (Array.isArray(appData) && appData.length !== arrayLength))\n      return undefined;\n    if (maxChildrenPerNode < 2)\n      maxChildrenPerNode = 2;\n    return RangeTreeOps.createRecursiveByIndexSplits<AppDataType>(ranges, appData, 0, arrayLength, arrayLength, maxChildrenPerNode, maxAppDataPerLeaf);\n  }\n}\n\n"]}

package/lib/cjs/polyface/RangeTree/RangeTreeSearchHandlers.d.ts

@@ -4,6 +4,7 @@
 import { CurveLocationDetail, CurveLocationDetailPair } from "../../curve/CurveLocationDetail";
 import { Point3d } from "../../geometry3d/Point3dVector3d";
 import { Range3d } from "../../geometry3d/Range";
+import { XAndY, XYAndZ } from "../../geometry3d/XYZProps";
 import { FacetLocationDetail, FacetLocationDetailPair } from "../FacetLocationDetail";
 import { LineString3dRangeTreeContext } from "./LineString3dRangeTreeContext";
 import { MinimumValueTester } from "./MinimumValueTester";
@@ -28,7 +29,7 @@ export declare class SingleTreeSearchHandlerForClosestPointInArray extends Singl
      * @param context captured
      * @param maxDist collect points at no more than this distance from spacePoint
      */
-    constructor(spacePoint: Point3d, context: Point3dArrayRangeTreeContext, maxDist?: number);
+    constructor(spacePoint: XAndY | XYAndZ, context: Point3dArrayRangeTreeContext, maxDist?: number);
     /** Return the current closest point */
     getResult(): CurveLocationDetail | undefined;
     /** Return the collected closest points (if collecting) */
@@ -54,6 +55,8 @@ export declare class TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproac
     contextB: Point3dArrayRangeTreeContext;
     /** Search state with current min distance point pair */
     searchState: MinimumValueTester<CurveLocationDetailPair>;
+    /** True if and only if both contexts specify xy-only. */
+    private _xyOnly?;
     /**
      * Constructor
      * @param contextA captured
@@ -67,6 +70,8 @@ export declare class TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproac
     getSavedItems(): CurveLocationDetailPair[] | undefined;
     /** Get current min distance */
     getCurrentDistance(): number;
+    /** Whether to ignore z-coordinates in distance computations. */
+    getXYOnly(): boolean;
     /** Compute and test the distance between two points, given their indices. */
     processAppDataPair(indexA: number, indexB: number): void;
 }
@@ -152,12 +157,12 @@ export declare class SingleTreeSearchHandlerForClosestPointOnPolyface extends Si
     searchFacetInterior: boolean;
     /**
      * Constructor
-     * @param spacePoint cloned
+     * @param spacePoint point to test
      * @param context captured
      * @param maxDist collect points at no more than this distance from spacePoint
      * @param searchFacetInterior true: search facet interior + boundary; false: just boundary
      */
-    constructor(spacePoint: Point3d, context: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior?: boolean);
+    constructor(spacePoint: XYAndZ | XAndY, context: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior?: boolean);
     /** Return the current closest point */
     getResult(): FacetLocationDetail | undefined;
     /** Return the collected closest points (if collecting) */

package/lib/cjs/polyface/RangeTree/RangeTreeSearchHandlers.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RangeTreeSearchHandlers.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeSearchHandlers.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAG/F,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAA6B,mBAAmB,EAAE,uBAAuB,EAAgC,MAAM,wBAAwB,CAAC;AAC/I,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AACtE,OAAO,EAAE,uBAAuB,EAAE,wCAAwC,EAAE,MAAM,iBAAiB,CAAC;AAEpG;;;;GAIG;AACH,qBAAa,6CAA8C,SAAQ,uBAAuB,CAAC,MAAM,CAAC;IAChG,0BAA0B;IACnB,OAAO,EAAE,4BAA4B,CAAC;IAC7C,4BAA4B;IACrB,WAAW,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAC/C,kCAAkC;IAC3B,UAAU,EAAE,OAAO,CAAC;IAE3B;;;;;OAKG;gBACgB,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQ/F,uCAAuC;IAChC,SAAS,IAAI,mBAAmB,GAAG,SAAS;IASnD,0DAA0D;IACnD,aAAa,IAAI,mBAAmB,EAAE,GAAG,SAAS;IAYzD;;;;OAIG;IACa,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAStD,wEAAwE;IACxD,cAAc,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;CAK7D;AAED;;;;GAIG;AACH,qBAAa,4DAA6D,SAAQ,wCAAwC,CAAC,MAAM,CAAC;IAChI,sCAAsC;IAC/B,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,uCAAuC;IAChC,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,wDAAwD;IACjD,WAAW,EAAE,kBAAkB,CAAC,uBAAuB,CAAC,CAAC;IAEhE;;;;;OAKG;gBACgB,QAAQ,EAAE,4BAA4B,EAAE,QAAQ,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQnH,0CAA0C;IACnC,SAAS,IAAI,uBAAuB,GAAG,SAAS;IAMvD,4DAA4D;IACrD,aAAa,IAAI,uBAAuB,EAAE,GAAG,SAAS;IAM7D,+BAA+B;IACf,kBAAkB,IAAI,MAAM;IAI5C,6EAA6E;IAC7D,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAczE;AAED;;;;GAIG;AACH,qBAAa,oDAAqD,SAAQ,uBAAuB,CAAC,MAAM,CAAC;IACvG,0BAA0B;IACnB,OAAO,EAAE,4BAA4B,CAAC;IAC7C,4BAA4B;IACrB,WAAW,EAAE,kBAAkB,CAAC,mBAAmB,CAAC,CAAC;IAC5D,iCAAiC;IAC1B,UAAU,EAAE,OAAO,CAAC;IAE3B;;;;;OAKG;gBACgB,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQ/F,uCAAuC;IAChC,SAAS,IAAI,mBAAmB,GAAG,SAAS;IAMnD,0DAA0D;IACnD,aAAa,IAAI,mBAAmB,EAAE,GAAG,SAAS;IAMzD;;;;OAIG;IACa,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAStD,OAAO,CAAC,YAAY,CAAC,CAAgB;IACrC,0EAA0E;IAC1D,cAAc,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;CAS7D;AAED;;;;GAIG;AACH,qBAAa,4DAA6D,SAAQ,wCAAwC,CAAC,MAAM,CAAC;IAChI,iCAAiC;IAC1B,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,kCAAkC;IAC3B,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,wDAAwD;IACjD,WAAW,EAAE,kBAAkB,CAAC,uBAAuB,CAAC,CAAC;IAEhE;;;;;OAKG;gBACgB,QAAQ,EAAE,4BAA4B,EAAE,QAAQ,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQnH;;;OAGG;IACI,SAAS,IAAI,uBAAuB,GAAG,SAAS;IAMvD,4DAA4D;IACrD,aAAa,IAAI,uBAAuB,EAAE,GAAG,SAAS;IAM7D,+BAA+B;IACf,kBAAkB,IAAI,MAAM;IAI5C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgB;IAC7C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgB;IAC7C,uFAAuF;IACvE,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAazE;AAED;;;;GAIG;AACH,qBAAa,gDAAiD,SAAQ,uBAAuB,CAAC,MAAM,CAAC;IACnG,0BAA0B;IACnB,OAAO,EAAE,wBAAwB,CAAC;IACzC,4BAA4B;IACrB,WAAW,EAAE,kBAAkB,CAAC,mBAAmB,CAAC,CAAC;IAC5D,iCAAiC;IAC1B,UAAU,EAAE,OAAO,CAAC;IAC3B,kDAAkD;IAC3C,mBAAmB,EAAE,OAAO,CAAC;IAEpC;;;;;;OAMG;gBACgB,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,wBAAwB,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe;IASjI,uCAAuC;IAChC,SAAS,IAAI,mBAAmB,GAAG,SAAS;IAMnD,0DAA0D;IACnD,aAAa,IAAI,mBAAmB,EAAE,GAAG,SAAS;IAMzD;;;;OAIG;IACa,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAStD,wEAAwE;IACxD,cAAc,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;CAkB7D;AACD;;;;GAIG;AACH,qBAAa,8CAA+C,SAAQ,wCAAwC,CAAC,MAAM,CAAC;IAClH,iCAAiC;IAC1B,QAAQ,EAAE,wBAAwB,CAAC;IAC1C,kCAAkC;IAC3B,QAAQ,EAAE,wBAAwB,CAAC;IAC1C,4DAA4D;IACrD,WAAW,EAAE,kBAAkB,CAAC,uBAAuB,CAAC,CAAC;IAChE,kDAAkD;IAC3C,mBAAmB,EAAE,OAAO,CAAC;IAEpC;;;;;MAKE;gBACiB,QAAQ,EAAE,wBAAwB,EAAE,QAAQ,EAAE,wBAAwB,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe;IASjJ,8CAA8C;IACvC,SAAS,IAAI,uBAAuB,GAAG,SAAS;IAMvD,4DAA4D;IACrD,aAAa,IAAI,uBAAuB,EAAE,GAAG,SAAS;IAM7D,+BAA+B;IACf,kBAAkB,IAAI,MAAM;IAI5C,qFAAqF;IACrE,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAkBzE"}
+{"version":3,"file":"RangeTreeSearchHandlers.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeSearchHandlers.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAI/F,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAA6B,mBAAmB,EAAE,uBAAuB,EAAgC,MAAM,wBAAwB,CAAC;AAC/I,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AACtE,OAAO,EAAE,uBAAuB,EAAE,wCAAwC,EAAE,MAAM,iBAAiB,CAAC;AAEpG;;;;GAIG;AACH,qBAAa,6CAA8C,SAAQ,uBAAuB,CAAC,MAAM,CAAC;IAChG,0BAA0B;IACnB,OAAO,EAAE,4BAA4B,CAAC;IAC7C,4BAA4B;IACrB,WAAW,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAC/C,kCAAkC;IAC3B,UAAU,EAAE,OAAO,CAAC;IAE3B;;;;;OAKG;gBACgB,UAAU,EAAE,KAAK,GAAG,MAAM,EAAE,OAAO,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQtG,uCAAuC;IAChC,SAAS,IAAI,mBAAmB,GAAG,SAAS;IASnD,0DAA0D;IACnD,aAAa,IAAI,mBAAmB,EAAE,GAAG,SAAS;IAYzD;;;;OAIG;IACa,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAStD,wEAAwE;IACxD,cAAc,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;CAK7D;AAED;;;;GAIG;AACH,qBAAa,4DAA6D,SAAQ,wCAAwC,CAAC,MAAM,CAAC;IAChI,sCAAsC;IAC/B,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,uCAAuC;IAChC,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,wDAAwD;IACjD,WAAW,EAAE,kBAAkB,CAAC,uBAAuB,CAAC,CAAC;IAEhE,yDAAyD;IACzD,OAAO,CAAC,OAAO,CAAC,CAAU;IAE1B;;;;;OAKG;gBACgB,QAAQ,EAAE,4BAA4B,EAAE,QAAQ,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IASnH,0CAA0C;IACnC,SAAS,IAAI,uBAAuB,GAAG,SAAS;IAMvD,4DAA4D;IACrD,aAAa,IAAI,uBAAuB,EAAE,GAAG,SAAS;IAM7D,+BAA+B;IACf,kBAAkB,IAAI,MAAM;IAI5C,gEAAgE;IAChD,SAAS,IAAI,OAAO;IAEpC,6EAA6E;IAC7D,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAczE;AAED;;;;GAIG;AACH,qBAAa,oDAAqD,SAAQ,uBAAuB,CAAC,MAAM,CAAC;IACvG,0BAA0B;IACnB,OAAO,EAAE,4BAA4B,CAAC;IAC7C,4BAA4B;IACrB,WAAW,EAAE,kBAAkB,CAAC,mBAAmB,CAAC,CAAC;IAC5D,iCAAiC;IAC1B,UAAU,EAAE,OAAO,CAAC;IAE3B;;;;;OAKG;gBACgB,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQ/F,uCAAuC;IAChC,SAAS,IAAI,mBAAmB,GAAG,SAAS;IAMnD,0DAA0D;IACnD,aAAa,IAAI,mBAAmB,EAAE,GAAG,SAAS;IAMzD;;;;OAIG;IACa,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAStD,OAAO,CAAC,YAAY,CAAC,CAAgB;IACrC,0EAA0E;IAC1D,cAAc,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;CAS7D;AAED;;;;GAIG;AACH,qBAAa,4DAA6D,SAAQ,wCAAwC,CAAC,MAAM,CAAC;IAChI,iCAAiC;IAC1B,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,kCAAkC;IAC3B,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,wDAAwD;IACjD,WAAW,EAAE,kBAAkB,CAAC,uBAAuB,CAAC,CAAC;IAEhE;;;;;OAKG;gBACgB,QAAQ,EAAE,4BAA4B,EAAE,QAAQ,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQnH;;;OAGG;IACI,SAAS,IAAI,uBAAuB,GAAG,SAAS;IAMvD,4DAA4D;IACrD,aAAa,IAAI,uBAAuB,EAAE,GAAG,SAAS;IAM7D,+BAA+B;IACf,kBAAkB,IAAI,MAAM;IAI5C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgB;IAC7C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgB;IAC7C,uFAAuF;IACvE,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAazE;AAED;;;;GAIG;AACH,qBAAa,gDAAiD,SAAQ,uBAAuB,CAAC,MAAM,CAAC;IACnG,0BAA0B;IACnB,OAAO,EAAE,wBAAwB,CAAC;IACzC,4BAA4B;IACrB,WAAW,EAAE,kBAAkB,CAAC,mBAAmB,CAAC,CAAC;IAC5D,iCAAiC;IAC1B,UAAU,EAAE,OAAO,CAAC;IAC3B,kDAAkD;IAC3C,mBAAmB,EAAE,OAAO,CAAC;IAEpC;;;;;;OAMG;gBACgB,UAAU,EAAE,MAAM,GAAG,KAAK,EAAE,OAAO,EAAE,wBAAwB,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe;IASxI,uCAAuC;IAChC,SAAS,IAAI,mBAAmB,GAAG,SAAS;IAMnD,0DAA0D;IACnD,aAAa,IAAI,mBAAmB,EAAE,GAAG,SAAS;IAMzD;;;;OAIG;IACa,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAStD,wEAAwE;IACxD,cAAc,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;CAkB7D;AACD;;;;GAIG;AACH,qBAAa,8CAA+C,SAAQ,wCAAwC,CAAC,MAAM,CAAC;IAClH,iCAAiC;IAC1B,QAAQ,EAAE,wBAAwB,CAAC;IAC1C,kCAAkC;IAC3B,QAAQ,EAAE,wBAAwB,CAAC;IAC1C,4DAA4D;IACrD,WAAW,EAAE,kBAAkB,CAAC,uBAAuB,CAAC,CAAC;IAChE,kDAAkD;IAC3C,mBAAmB,EAAE,OAAO,CAAC;IAEpC;;;;;MAKE;gBACiB,QAAQ,EAAE,wBAAwB,EAAE,QAAQ,EAAE,wBAAwB,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe;IASjJ,8CAA8C;IACvC,SAAS,IAAI,uBAAuB,GAAG,SAAS;IAMvD,4DAA4D;IACrD,aAAa,IAAI,uBAAuB,EAAE,GAAG,SAAS;IAM7D,+BAA+B;IACf,kBAAkB,IAAI,MAAM;IAI5C,qFAAqF;IACrE,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAkBzE"}