@itwin/core-geometry 5.5.0-dev.4 → 5.5.0-dev.6

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

@@ -1 +1 @@
-{"version":3,"file":"LineString3dRangeTreeContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/LineString3dRangeTreeContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAC/F,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAExD,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAO3D;;;;GAIG;AACH,qBAAa,4BAA4B;IACvC,gEAAgE;IACzD,UAAU,EAAE,YAAY,CAAC;IAEhC,gEAAgE;IACzD,gBAAgB,EAAE,MAAM,CAAC;IAChC,iEAAiE;IAC1D,iBAAiB,EAAE,MAAM,CAAC;IACjC,0CAA0C;IACnC,YAAY,EAAE,MAAM,CAAC;IAC5B,sCAAsC;IAC/B,SAAS,EAAE,MAAM,CAAC;IAEzB,6EAA6E;IAC7E,OAAO,CAAC,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,OAAO;IAQP;;;;;;;OAOG;WACW,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,YAAY,EAAE,eAAe,GAAE,MAAU,EAAE,iBAAiB,GAAE,MAAU,GAAG,4BAA4B,GAAG,SAAS;IAWnK;;;;;OAKG;IACI,qBAAqB,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,mBAAmB,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAa5H;;;;;;MAME;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":"LineString3dRangeTreeContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/LineString3dRangeTreeContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAC/F,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAExD,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAO3D;;;;GAIG;AACH,qBAAa,4BAA4B;IACvC,gEAAgE;IACzD,UAAU,EAAE,YAAY,CAAC;IAEhC,gEAAgE;IACzD,gBAAgB,EAAE,MAAM,CAAC;IAChC,iEAAiE;IAC1D,iBAAiB,EAAE,MAAM,CAAC;IACjC,0CAA0C;IACnC,YAAY,EAAE,MAAM,CAAC;IAC5B,sCAAsC;IAC/B,SAAS,EAAE,MAAM,CAAC;IAEzB,6EAA6E;IAC7E,OAAO,CAAC,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,OAAO;IAQP;;;;;;;OAOG;WACW,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,YAAY,EAAE,eAAe,GAAE,MAAU,EAAE,iBAAiB,GAAE,MAAU,GAAG,4BAA4B,GAAG,SAAS;IAYnK;;;;;OAKG;IACI,qBAAqB,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,mBAAmB,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAa5H;;;;;;MAME;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/LineString3dRangeTreeContext.js

@@ -50,8 +50,9 @@ class LineString3dRangeTreeContext {
      */
     static createCapture(points, maxChildPerNode = 4, maxAppDataPerLeaf = 4) {
         const linestring = points instanceof LineString3d_1.LineString3d ? points : LineString3d_1.LineString3d.createPoints(points);
-        const rangeTreeRoot = RangeTreeNode_1.RangeTreeOps.createByIndexSplits(((index) => { return Range_1.Range3d.create(linestring.pointAt(index), linestring.pointAt(index + 1)); }), ((index) => { return index; }), linestring.numPoints() - 1, // number of segments
-        maxChildPerNode, maxAppDataPerLeaf);
+        const rangeTreeRoot = RangeTreeNode_1.RangeTreeOps.createByIndexSplits(
+        // callbacks are invoked with 0 <= iSegment < numEdges, thus iSegment and iSegment+1 are valid linestring indices
+        (iSegment) => Range_1.Range3d.create(linestring.pointAtUnchecked(iSegment), linestring.pointAtUnchecked(iSegment + 1)), (iSegment) => iSegment, linestring.numEdges(), maxChildPerNode, maxAppDataPerLeaf);
         return rangeTreeRoot ? new LineString3dRangeTreeContext(rangeTreeRoot, linestring) : undefined;
     }
     /**

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

@@ -1 +1 @@
-{"version":3,"file":"LineString3dRangeTreeContext.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/LineString3dRangeTreeContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,2DAAwD;AACxD,6CAA0C;AAE1C,kDAAiD;AACjD,mDAA8D;AAC9D,uEAEmC;AAEnC;;;;GAIG;AACH,MAAa,4BAA4B;IACvC,gEAAgE;IACzD,UAAU,CAAe;IAEhC,gEAAgE;IACzD,gBAAgB,CAAS;IAChC,iEAAiE;IAC1D,iBAAiB,CAAS;IACjC,0CAA0C;IACnC,YAAY,CAAS;IAC5B,sCAAsC;IAC/B,SAAS,CAAS;IAEzB,6EAA6E;IACrE,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,YAAoB,aAAoC,EAAE,MAAoB;QAC5E,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;QACzB,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,MAAgC,EAAE,kBAA0B,CAAC,EAAE,oBAA4B,CAAC;QACtH,MAAM,UAAU,GAAG,MAAM,YAAY,2BAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,2BAAY,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAC/F,MAAM,aAAa,GAAG,4BAAY,CAAC,mBAAmB,CACpD,CAAC,CAAC,KAAa,EAAW,EAAE,GAAG,OAAO,eAAO,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAE,EAAE,UAAU,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EACpH,CAAC,CAAC,KAAa,EAAU,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAC9C,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,EAAI,qBAAqB;QACnD,eAAe,EACf,iBAAiB,CAClB,CAAC;QACF,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,4BAA4B,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACjG,CAAC;IACD;;;;;OAKG;IACI,qBAAqB,CAAC,UAAmB,EAAE,OAAgB;QAChE,MAAM,OAAO,GAAG,IAAI,8EAAoD,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACpG,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,iHAAiH;QACjH,MAAM,OAAO,GAAG,mBAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,OAAO,CAAC,CAAC;QACnE,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC1B,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,QAAQ;YACvE,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;;;;;;MAME;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;AA3ED,oEA2EC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module RangeSearch\r\n */\r\n\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../../curve/CurveLocationDetail\";\r\nimport { LineString3d } from \"../../curve/LineString3d\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../../geometry3d/Range\";\r\nimport { RangeTreeNode, RangeTreeOps } from \"./RangeTreeNode\";\r\nimport {\r\n  SingleTreeSearchHandlerForClosestPointOnLineString3d, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach,\r\n} from \"./RangeTreeSearchHandlers\";\r\n\r\n/**\r\n * Handler class for searching a range tree containing the segments of a linestring.\r\n * * Facilitates multiple searches for closest point and close approach calculations.\r\n * @public\r\n */\r\nexport class LineString3dRangeTreeContext {\r\n  /** Polyline points being searched, indexed by the range tree */\r\n  public lineString: LineString3d;\r\n\r\n  /** Diagnostic: number of range tests that have returned true */\r\n  public numRangeTestTrue: number;\r\n  /** Diagnostic: number of range tests that have returned false */\r\n  public numRangeTestFalse: number;\r\n  /** Diagnostic: number of points tested */\r\n  public numPointTest: number;\r\n  /** Diagnostic: number of searches. */\r\n  public numSearch: number;\r\n\r\n  /** Range tree, whose appData are indices into the linestring points array */\r\n  private _rangeTreeRoot: RangeTreeNode<number>;\r\n\r\n  /** Constructor: capture inputs, initialize debug counters */\r\n  private constructor(rangeTreeRoot: RangeTreeNode<number>, points: LineString3d) {\r\n    this.lineString = points;\r\n    this._rangeTreeRoot = rangeTreeRoot;\r\n    this.numRangeTestTrue = 0;\r\n    this.numRangeTestFalse = 0;\r\n    this.numPointTest = 0;\r\n    this.numSearch = 0;\r\n  }\r\n  /**\r\n   * Create a range tree context for the polyline points:\r\n   * * initialize with segment ranges\r\n   * * appData are segment indices\r\n   * @param linestring captured if LineString3d, otherwise copied\r\n   * @param maxChildPerNode maximum children per range tree node (default 4)\r\n   * @param maxAppDataPerLeaf maximum segment indices per leaf node (default 4)\r\n   */\r\n  public static createCapture(points: Point3d[] | LineString3d, maxChildPerNode: number = 4, maxAppDataPerLeaf: number = 4): LineString3dRangeTreeContext | undefined {\r\n    const linestring = points instanceof LineString3d ? points : LineString3d.createPoints(points);\r\n    const rangeTreeRoot = RangeTreeOps.createByIndexSplits<number>(\r\n      ((index: number): Range3d => { return Range3d.create(linestring.pointAt(index)!, linestring.pointAt(index + 1)!); }),\r\n      ((index: number): number => { return index; }),\r\n      linestring.numPoints() - 1,   // number of segments\r\n      maxChildPerNode,\r\n      maxAppDataPerLeaf,\r\n    );\r\n    return rangeTreeRoot ? new LineString3dRangeTreeContext(rangeTreeRoot, linestring) : undefined;\r\n  }\r\n  /**\r\n   * Search the range tree for closest point(s) to spacePoint.\r\n   * @param spacePoint point to test\r\n   * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.\r\n   * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point\r\n   */\r\n  public searchForClosestPoint(spacePoint: Point3d, maxDist?: number): CurveLocationDetail | CurveLocationDetail[] | undefined {\r\n    const handler = new SingleTreeSearchHandlerForClosestPointOnLineString3d(spacePoint, this, maxDist);\r\n    this.numSearch++;\r\n    // seed the search with a few segments -- this reduces early trips deep into ranges that are far from spacePoint.\r\n    const numTest = Geometry.clamp(Math.floor(this.lineString.numPoints() / 20), 2, 7);\r\n    const testStep = Math.floor(this.lineString.numPoints() / numTest);\r\n    handler.processAppData(0);\r\n    handler.processAppData(this.lineString.numPoints() - 2);\r\n    for (let i = testStep; i + 1 < this.lineString.numPoints(); i += testStep)\r\n      handler.processAppData(i);\r\n    this._rangeTreeRoot.searchTopDown(handler);\r\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\r\n  }\r\n  /**\r\n   * Search the range trees for closest approach(es) between the polylines.\r\n   * @param contextA first polyline context\r\n   * @param contextB second polyline context\r\n   * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.\r\n   * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance\r\n  */\r\n  public static searchForClosestApproach(contextA: LineString3dRangeTreeContext, contextB: LineString3dRangeTreeContext, maxDist?: number): CurveLocationDetailPair | CurveLocationDetailPair[] | undefined {\r\n    const handler = new TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach(contextA, contextB, maxDist);\r\n    RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);\r\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"LineString3dRangeTreeContext.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/LineString3dRangeTreeContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,2DAAwD;AACxD,6CAA0C;AAE1C,kDAAiD;AACjD,mDAA8D;AAC9D,uEAEmC;AAEnC;;;;GAIG;AACH,MAAa,4BAA4B;IACvC,gEAAgE;IACzD,UAAU,CAAe;IAEhC,gEAAgE;IACzD,gBAAgB,CAAS;IAChC,iEAAiE;IAC1D,iBAAiB,CAAS;IACjC,0CAA0C;IACnC,YAAY,CAAS;IAC5B,sCAAsC;IAC/B,SAAS,CAAS;IAEzB,6EAA6E;IACrE,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,YAAoB,aAAoC,EAAE,MAAoB;QAC5E,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;QACzB,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,MAAgC,EAAE,kBAA0B,CAAC,EAAE,oBAA4B,CAAC;QACtH,MAAM,UAAU,GAAG,MAAM,YAAY,2BAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,2BAAY,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAC/F,MAAM,aAAa,GAAG,4BAAY,CAAC,mBAAmB;QACpD,iHAAiH;QACjH,CAAC,QAAgB,EAAE,EAAE,CAAC,eAAO,CAAC,MAAM,CAAC,UAAU,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,UAAU,CAAC,gBAAgB,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EACtH,CAAC,QAAgB,EAAE,EAAE,CAAC,QAAQ,EAC9B,UAAU,CAAC,QAAQ,EAAE,EACrB,eAAe,EACf,iBAAiB,CAClB,CAAC;QACF,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,4BAA4B,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACjG,CAAC;IACD;;;;;OAKG;IACI,qBAAqB,CAAC,UAAmB,EAAE,OAAgB;QAChE,MAAM,OAAO,GAAG,IAAI,8EAAoD,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACpG,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,iHAAiH;QACjH,MAAM,OAAO,GAAG,mBAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,OAAO,CAAC,CAAC;QACnE,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC1B,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,QAAQ;YACvE,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;;;;;;MAME;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;AA5ED,oEA4EC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module RangeSearch\r\n */\r\n\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../../curve/CurveLocationDetail\";\r\nimport { LineString3d } from \"../../curve/LineString3d\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../../geometry3d/Range\";\r\nimport { RangeTreeNode, RangeTreeOps } from \"./RangeTreeNode\";\r\nimport {\r\n  SingleTreeSearchHandlerForClosestPointOnLineString3d, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach,\r\n} from \"./RangeTreeSearchHandlers\";\r\n\r\n/**\r\n * Handler class for searching a range tree containing the segments of a linestring.\r\n * * Facilitates multiple searches for closest point and close approach calculations.\r\n * @public\r\n */\r\nexport class LineString3dRangeTreeContext {\r\n  /** Polyline points being searched, indexed by the range tree */\r\n  public lineString: LineString3d;\r\n\r\n  /** Diagnostic: number of range tests that have returned true */\r\n  public numRangeTestTrue: number;\r\n  /** Diagnostic: number of range tests that have returned false */\r\n  public numRangeTestFalse: number;\r\n  /** Diagnostic: number of points tested */\r\n  public numPointTest: number;\r\n  /** Diagnostic: number of searches. */\r\n  public numSearch: number;\r\n\r\n  /** Range tree, whose appData are indices into the linestring points array */\r\n  private _rangeTreeRoot: RangeTreeNode<number>;\r\n\r\n  /** Constructor: capture inputs, initialize debug counters */\r\n  private constructor(rangeTreeRoot: RangeTreeNode<number>, points: LineString3d) {\r\n    this.lineString = points;\r\n    this._rangeTreeRoot = rangeTreeRoot;\r\n    this.numRangeTestTrue = 0;\r\n    this.numRangeTestFalse = 0;\r\n    this.numPointTest = 0;\r\n    this.numSearch = 0;\r\n  }\r\n  /**\r\n   * Create a range tree context for the polyline points:\r\n   * * initialize with segment ranges\r\n   * * appData are segment indices\r\n   * @param linestring captured if LineString3d, otherwise copied\r\n   * @param maxChildPerNode maximum children per range tree node (default 4)\r\n   * @param maxAppDataPerLeaf maximum segment indices per leaf node (default 4)\r\n   */\r\n  public static createCapture(points: Point3d[] | LineString3d, maxChildPerNode: number = 4, maxAppDataPerLeaf: number = 4): LineString3dRangeTreeContext | undefined {\r\n    const linestring = points instanceof LineString3d ? points : LineString3d.createPoints(points);\r\n    const rangeTreeRoot = RangeTreeOps.createByIndexSplits<number>(\r\n      // callbacks are invoked with 0 <= iSegment < numEdges, thus iSegment and iSegment+1 are valid linestring indices\r\n      (iSegment: number) => Range3d.create(linestring.pointAtUnchecked(iSegment), linestring.pointAtUnchecked(iSegment + 1)),\r\n      (iSegment: number) => iSegment,\r\n      linestring.numEdges(),\r\n      maxChildPerNode,\r\n      maxAppDataPerLeaf,\r\n    );\r\n    return rangeTreeRoot ? new LineString3dRangeTreeContext(rangeTreeRoot, linestring) : undefined;\r\n  }\r\n  /**\r\n   * Search the range tree for closest point(s) to spacePoint.\r\n   * @param spacePoint point to test\r\n   * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.\r\n   * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point\r\n   */\r\n  public searchForClosestPoint(spacePoint: Point3d, maxDist?: number): CurveLocationDetail | CurveLocationDetail[] | undefined {\r\n    const handler = new SingleTreeSearchHandlerForClosestPointOnLineString3d(spacePoint, this, maxDist);\r\n    this.numSearch++;\r\n    // seed the search with a few segments -- this reduces early trips deep into ranges that are far from spacePoint.\r\n    const numTest = Geometry.clamp(Math.floor(this.lineString.numPoints() / 20), 2, 7);\r\n    const testStep = Math.floor(this.lineString.numPoints() / numTest);\r\n    handler.processAppData(0);\r\n    handler.processAppData(this.lineString.numPoints() - 2);\r\n    for (let i = testStep; i + 1 < this.lineString.numPoints(); i += testStep)\r\n      handler.processAppData(i);\r\n    this._rangeTreeRoot.searchTopDown(handler);\r\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\r\n  }\r\n  /**\r\n   * Search the range trees for closest approach(es) between the polylines.\r\n   * @param contextA first polyline context\r\n   * @param contextB second polyline context\r\n   * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.\r\n   * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance\r\n  */\r\n  public static searchForClosestApproach(contextA: LineString3dRangeTreeContext, contextB: LineString3dRangeTreeContext, maxDist?: number): CurveLocationDetailPair | CurveLocationDetailPair[] | undefined {\r\n    const handler = new TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach(contextA, contextB, maxDist);\r\n    RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);\r\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\r\n  }\r\n}\r\n"]}

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

@@ -11,7 +11,7 @@ type FlexData<T> = undefined | T[] | T;
 /**
  * Type name IndexToType is shorthand for a member or parameter which can be:
  * * an array of values of type T
- * * a function from integers to type T.
+ * * a function from a valid index to type T.
  */
 type IndexToType<T> = T[] | ((index: number) => T);
 /**

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

@@ -11,9 +11,9 @@ exports.RangeTreeOps = exports.RangeTreeNode = exports.TwoTreeDistanceMinimizati
 const core_bentley_1 = require("@itwin/core-bentley");
 const Range_1 = require("../../geometry3d/Range");
 /**
- * Map an (unchecked) integer to a parameterized type T, where the data argument can be either:
+ * Map a valid index to a parameterized type T, where the data argument can be either:
  * * an array of type T
- * * a function which takes an index and returns type T
+ * * a function which takes a valid index and returns type T
  * @internal
  */
 function evaluateIndexToType(data, index) {

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;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":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module RangeSearch\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Range3d } from \"../../geometry3d/Range\";\r\n\r\n/** Type name FlexData is shorthand for a member or parameter which can be:\r\n * * undefined\r\n * * an array of values of type T\r\n * * a singleton of type T\r\n */\r\ntype FlexData<T> = undefined | T[] | T;\r\n/**\r\n * Type name IndexToType is shorthand for a member or parameter which can be:\r\n * * an array of values of type T\r\n * * a function from integers to type T.\r\n */\r\ntype IndexToType<T> = T[] | ((index: number) => T);\r\n\r\n/**\r\n * Map an (unchecked) integer to a parameterized type T, where the data argument can be either:\r\n * * an array of type T\r\n * * a function which takes an index and returns type T\r\n * @internal\r\n */\r\nfunction evaluateIndexToType<T>(data: IndexToType<T>, index: number): T {\r\n  if (Array.isArray(data))\r\n    return data[index];\r\n  return data(index);\r\n}\r\n/**\r\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.\r\n * @internal\r\n */\r\nfunction getByIndex<T>(index: number, data: FlexData<T>): T | undefined {\r\n  if (data !== undefined) {\r\n    if (Array.isArray(data)) {\r\n      if (index < data.length)\r\n        return data[index];\r\n    } else {\r\n      return data;\r\n    }\r\n  }\r\n  return undefined;\r\n}\r\n/**\r\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.\r\n * @internal\r\n */\r\nfunction getFlexDataCount<T>(data: FlexData<T>): number {\r\n  if (data !== undefined) {\r\n    if (Array.isArray(data)) {\r\n      return data.length;\r\n    } else {\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n/**\r\n * Abstract class for handler objects called during traversal of a single range tree.\r\n * @internal\r\n */\r\nexport abstract class SingleTreeSearchHandler<AppDataType> {\r\n  /** Return true if appData within the range should be offered to `processAppData`. */\r\n  public abstract isRangeActive(range: Range3d): boolean;\r\n  /**\r\n   * Called for a (single) child referenced by a tree.\r\n   * * This is only called when range checks on the path from root have been passed.\r\n   * @param item child (of type AppDataType) in the tree.\r\n   */\r\n  public abstract processAppData(item: AppDataType): void;\r\n  /**\r\n   * Query to see if the active search has been aborted.\r\n   * * Default implementation returns false so query runs to completion.\r\n   * * Search processes check this after range tests and child processing.\r\n   */\r\n  public getIsAborted(): boolean { return false; }\r\n}\r\n/**\r\n * Abstract class for handler objects called during traversal of two range trees.\r\n * @internal\r\n */\r\nexport abstract class TwoTreeSearchHandler<AppDataType> {\r\n  /** Return true if appData within the ranges should be offered to `processAppDataPair`. */\r\n  public abstract isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean;\r\n  /**\r\n   * Called with AppDataType items from left tree and right tree.\r\n   * * This is only called when range tests have been passed.\r\n   * @param leftItem\r\n   * @param rightItem\r\n   */\r\n  public abstract processAppDataPair(leftItem: AppDataType, rightItem: AppDataType): void;\r\n  /**\r\n   * Query to see if the active search has been aborted.\r\n   * * Default implementation returns false so query runs to completion.\r\n   * * Search processes check this after range tests and child processing.\r\n   */\r\n  public getIsAborted(): boolean { return false; }\r\n  /** Whether to ignore z-coordinates in distance computations. */\r\n  public getXYOnly(): boolean { return false; }\r\n}\r\n/**\r\n * This class refines the TwoTreeSearchHandler with an implementation of `isRangePairActive` appropriate for computing the minimum distance between trees.\r\n * * The concrete class must implement `getCurrentDistance()` method to provide the best-so-far distance.\r\n * * The implementation of `isRangePairActive` returns true if the distance between ranges is less than or equal to the `getCurrentDistance()` value.\r\n * @internal\r\n */\r\nexport abstract class TwoTreeDistanceMinimizationSearchHandler<AppDataType> extends TwoTreeSearchHandler<AppDataType>{\r\n  /**\r\n   * Provides the allowable distance between ranges.\r\n   * * Range pairs with more than this distance separation are rejected.\r\n   * * The implementation may alter (probably reduce) the getCurrentDistance() value as the search progresses.\r\n   */\r\n  public abstract getCurrentDistance(): number;\r\n  /**\r\n   * Method called to decide whether to process subtrees and immediate child appData items from a left tree node and right tree node.\r\n   * @param leftRange range from a node in the left tree\r\n   * @param rightRange range from a node in the right tree.\r\n   * @returns true if the smallest distance from leftRange to rightRange is less than or equal to getCurrentDistance()\r\n   */\r\n  public override isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean {\r\n    const currentDistance = this.getCurrentDistance();\r\n    const distanceBetweenRanges = this.getXYOnly() ? leftRange.distanceToRangeXY(rightRange) : leftRange.distanceToRange(rightRange);\r\n    return distanceBetweenRanges <= currentDistance;\r\n  }\r\n}\r\n\r\nlet numNodeCreated = 0;\r\n\r\n/**\r\n * * TREE STRUCTURE\r\n *   * A RangeTreeNode is part of a range tree.\r\n *   * TREE is used here in a strictly _structural_ sense, which has no broad promises about data members.\r\n *   * Each RangeNode points to 0, 1 or many children.\r\n *   * Each child has (but does not point back to) a single parent.\r\n *   * The overall tree has a single root.\r\n *   * Each node is effectively the root of the tree of its children.\r\n * * NON-TREE DATA MEMBERS\r\n *   * Data members in each node (in addition to children) are\r\n *     * _range = the union of ranges below in the heap\r\n *     * _appData = application data associated with the node.\r\n *       * Construction methods may place multiple _appData items in each node.\r\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.\r\n * * CONSTRUCTION\r\n *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.\r\n *     * The appData is placed entirely in the leaves.\r\n *     * The caller can specify:\r\n *       * the number of _appData items per leaf\r\n *       * the number of children per node within the tree.\r\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:\r\n *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.\r\n *       * larger memory use because of more nodes\r\n *   * For future construction methods:\r\n *      * _appData \"above the leaves\" may allow nodes below to have smaller ranges, but add complexity to search.\r\n * @internal\r\n */\r\nexport class RangeTreeNode<AppDataType> {\r\n  private _range: Range3d;\r\n  private _appData: FlexData<AppDataType>;\r\n  private _children: FlexData<RangeTreeNode<AppDataType>>;\r\n  /** an id assigned sequentially as nodes are created.  For debugging use only. */\r\n  private _id: number;\r\n  /**\r\n   * CONSTRUCTOR\r\n   * CAPTURE (not copy)\r\n   * * range = range for search algorithms\r\n   * * appData = application data relevant to this node.\r\n   * * children = child node reference(s).\r\n   */\r\n  private constructor(range: Range3d, appData: FlexData<AppDataType>, children: FlexData<RangeTreeNode<AppDataType>>) {\r\n    this._range = range;\r\n    this._appData = appData;\r\n    this._children = children;\r\n    this._id = numNodeCreated++;\r\n    // const childIds: number[] = [];\r\n    // if (Array.isArray(this._children))\r\n    //   for (const c of this._children) childIds.push(c._id);\r\n    // else if (this._children instanceof RangeTreeNode)\r\n    //   childIds.push(this._children._id);\r\n    // const numAppData = getFlexDataCount(appData);\r\n    // console.log({ id: this._id, childIds, numAppData });\r\n  }\r\n  /** Simplest public create: capture the range, appData, and children. */\r\n  public static createCapture<AppDataType>(\r\n    range: Range3d,\r\n    appData: FlexData<AppDataType>,\r\n    children: FlexData<RangeTreeNode<AppDataType>>): RangeTreeNode<AppDataType> {\r\n    return new RangeTreeNode<AppDataType>(range, appData, children);\r\n  }\r\n  /** copy (not capture) from given data into the range in this RangeEntry */\r\n  public setRange(data: Range3d) {\r\n    this._range.setFrom(data);\r\n  }\r\n  /** return (a copy of) the range in this RangeEntry */\r\n  public getRange(data?: Range3d): Range3d {\r\n    return this._range.clone(data);\r\n  }\r\n  /** return (a reference to) the range in this RangeEntry */\r\n  public getRangeRef(): Range3d {\r\n    return this._range;\r\n  }\r\n  /**\r\n   * Access a child by index.\r\n   * * If the child data is an array, this dereferences the array.\r\n   * * If the child data is a singleton, treat it as index 0.\r\n   * * return undefined if there are no children.\r\n   * @param index index of item to access.\r\n   */\r\n  public getChildByIndex(index: number): RangeTreeNode<AppDataType> | undefined {\r\n    return getByIndex<RangeTreeNode<AppDataType>>(index, this._children);\r\n  }\r\n  /**\r\n   * * Access an appData by index.\r\n   * * If the appData data is an array, this dereferences the array.\r\n   * * If the appData data is a singleton, treat it as if it is at index 0 in an array\r\n   * * return undefined if there are no appData or for any index out of range.\r\n   * @param index index of item to access.\r\n   */\r\n  public getAppDataByIndex(index: number): AppDataType | undefined {\r\n    return getByIndex<AppDataType>(index, this._appData);\r\n  }\r\n  /** Access the children or child (does not clone). */\r\n  public getAllChildren(): FlexData<RangeTreeNode<AppDataType>> {\r\n    return this._children;\r\n  }\r\n  /** Access the appData array or singleton (does not clone). */\r\n  public getAllAppData(): FlexData<AppDataType> {\r\n    return this._appData;\r\n  }\r\n  /**\r\n   * Count the direct children in this node of the tree.\r\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveNodeCount`.\r\n   */\r\n  public getNumChildren(): number {\r\n    return getFlexDataCount(this._children);\r\n  }\r\n  /**\r\n   * Count the appData items in this node of the tree.\r\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveAppDataCount`.\r\n   */\r\n  public getNumAppData(): number {\r\n    return getFlexDataCount(this._appData);\r\n  }\r\n  /**\r\n   * Depth-first tree iteration, calling `announceNode` on each node.\r\n   * @param announceNode callback that returns true to recurse into children\r\n   */\r\n  public recurseIntoTree(announceNode: (node: RangeTreeNode<AppDataType>) => boolean) {\r\n    const doChildren = announceNode(this);\r\n    if (doChildren) {\r\n      if (Array.isArray(this._children)) {\r\n        for (const child of this._children)\r\n          child.recurseIntoTree(announceNode);\r\n      } else if (this._children !== undefined) {\r\n        this._children.recurseIntoTree(announceNode);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Depth-first tree iteration via handler.\r\n   * * if handler decides the instance range is active, process appData, then recurse on children\r\n   * * if handler decides to abort after processing an appData, skip processing rest of appData and children\r\n   */\r\n  public searchTopDown(handler: SingleTreeSearchHandler<AppDataType>) {\r\n    if (handler.isRangeActive(this._range)) {\r\n      let itemToProcess: AppDataType | undefined;\r\n      for (let i = 0; undefined !== (itemToProcess = this.getAppDataByIndex(i)); i++) {\r\n        // console.log(itemToProcess);\r\n        handler.processAppData(itemToProcess);\r\n        if (handler.getIsAborted())\r\n          return;\r\n      }\r\n      let child: RangeTreeNode<AppDataType> | undefined;\r\n      for (let i = 0; undefined !== (child = this.getChildByIndex(i)); i++) {\r\n        child.searchTopDown(handler);\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightStack.\r\n   * @param leftAppData singleton or array with data \"from left\"\r\n   * @param rightStack stack of nodes to process from right path.\r\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.\r\n   * @param handler search handler\r\n   */\r\n  private static processAppDataAndAppDataStack<AppDataType>(\r\n    leftAppData: FlexData<AppDataType>,\r\n    rightStack: RangeTreeNode<AppDataType>[],\r\n    reverseArgs: boolean,\r\n    handler: TwoTreeSearchHandler<AppDataType>,\r\n  ) {\r\n    if (leftAppData !== undefined) {\r\n      let leftItem: AppDataType | undefined;\r\n      let rightItem: AppDataType | undefined;\r\n      // hmm.. we ASSUME that if the tip ranges passed, then all parent ranges would pass without further test.\r\n      for (let rangeIndex = rightStack.length; rangeIndex-- > 0;) {\r\n        const rightAppData = rightStack[rangeIndex]._appData;\r\n        for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\r\n          for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\r\n            if (!reverseArgs)\r\n              handler.processAppDataPair(leftItem, rightItem);\r\n            else\r\n              handler.processAppDataPair(rightItem, leftItem);\r\n            if (handler.getIsAborted())\r\n              return;\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightAppData.\r\n   * @param leftAppData singleton or array with data \"from left\"\r\n   * @param rightAppData singleton or array with data \"from right\"\r\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.\r\n   * @param handler search handler\r\n   */\r\n  private static processAppDataAndAppData<AppDataType>(\r\n    leftAppData: FlexData<AppDataType>,\r\n    rightAppData: FlexData<AppDataType>,\r\n    reverseArgs: boolean,\r\n    handler: TwoTreeSearchHandler<AppDataType>,\r\n  ) {\r\n    if (leftAppData !== undefined && rightAppData !== undefined) {\r\n      let leftItem: AppDataType | undefined;\r\n      let rightItem: AppDataType | undefined;\r\n      for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\r\n        for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\r\n          if (!reverseArgs)\r\n            handler.processAppDataPair(leftItem, rightItem);\r\n          else\r\n            handler.processAppDataPair(rightItem, leftItem);\r\n          if (handler.getIsAborted())\r\n            return;\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Push the tip node to stack(s).\r\n   * @param tip new node (to be pushed)\r\n   * @param fullPath complete path, which is always extended\r\n   * @param partialPath partial path, which is only extended if the tip has _appData.\r\n   */\r\n  private static pushPaths<AppDataType>(\r\n    tip: RangeTreeNode<AppDataType>,\r\n    fullPath: RangeTreeNode<AppDataType>[],\r\n    partialPath: RangeTreeNode<AppDataType>[],\r\n  ) {\r\n    fullPath.push(tip);\r\n    if (tip._appData !== undefined) {\r\n      partialPath.push(tip);\r\n    }\r\n  }\r\n  /**\r\n   * Pop the tip node from stack(s).\r\n   * @param tip should match the fullPath tip.\r\n   * @param fullPath complete path, which is always popped\r\n   * @param partialPath partial path, which is only popped if the tip has _appData.\r\n   */\r\n  private static popPaths<AppDataType>(\r\n    tip: RangeTreeNode<AppDataType>,\r\n    fullPath: RangeTreeNode<AppDataType>[],\r\n    partialPath: RangeTreeNode<AppDataType>[],\r\n  ) {\r\n    assert(fullPath[fullPath.length - 1] === tip);\r\n    fullPath.pop();\r\n    if (tip._appData !== undefined) {\r\n      partialPath.pop();\r\n    }\r\n  }\r\n  /**\r\n   * Process nodes from left and right trees of dual search.\r\n   * * The separate stacks for nodes that have appData is for efficiency.\r\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.\r\n   * @param leftTip tip node being explored on left\r\n   * @param leftStack stack of prior left nodes\r\n   * @param leftStackWithAppData stack of prior left nodes which have appData.\r\n   * @param rightTip tip node being explored on right.\r\n   * @param rightStack stack of prior right nodes.\r\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\r\n   * @param handler search handler\r\n   */\r\n  private static recursivePairSearch<AppDataType>(\r\n    leftTip: RangeTreeNode<AppDataType>,\r\n    leftStack: RangeTreeNode<AppDataType>[],\r\n    leftStackWithAppData: RangeTreeNode<AppDataType>[],\r\n    rightTip: RangeTreeNode<AppDataType>,\r\n    rightStack: RangeTreeNode<AppDataType>[],\r\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\r\n    handler: TwoTreeSearchHandler<AppDataType>,\r\n  ) {\r\n    // console.log({ leftId: leftTip._id, rightId: rightTip._id });\r\n    const leftTipHasAppData = leftTip._appData !== undefined;\r\n    const rightTipHasAppData = rightTip._appData !== undefined;\r\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\r\n    let rightChild: RangeTreeNode<AppDataType> | undefined;\r\n\r\n    // process immediate appData from each tip node with the entire prior path of the other side (each stack currently lacks the tip).\r\n    if (leftTipHasAppData && rightStackWithAppData.length > 0) {\r\n      this.processAppDataAndAppDataStack<AppDataType>(leftTip._appData, rightStackWithAppData, false, handler);\r\n    }\r\n    if (leftStackWithAppData.length > 0 && rightTipHasAppData) {\r\n      this.processAppDataAndAppDataStack<AppDataType>(rightTip._appData, leftStackWithAppData, true, handler);\r\n    }\r\n\r\n    if (handler.isRangePairActive(leftTip._range, rightTip._range)) {\r\n      this.processAppDataAndAppData<AppDataType>(leftTip._appData, rightTip._appData, false, handler);\r\n\r\n      if (leftTip._children !== undefined && rightTip._children !== undefined) {\r\n        this.pushPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\r\n        this.pushPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\r\n        for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\r\n          for (let rightIndex = 0; undefined !== (rightChild = getByIndex<RangeTreeNode<AppDataType>>(rightIndex, rightTip._children)); rightIndex++) {\r\n            this.recursivePairSearch(\r\n              leftChild, leftStack, leftStackWithAppData,\r\n              rightChild, rightStack, rightStackWithAppData,\r\n              handler);\r\n          }\r\n        }\r\n        this.popPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\r\n        this.popPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\r\n      } else if (leftTip._children !== undefined) {\r\n        this.leftRecursivePairSearch<AppDataType>(leftTip, rightTip, rightStackWithAppData, false, handler);\r\n      } else if (rightTip._children !== undefined) {\r\n        this.leftRecursivePairSearch<AppDataType>(rightTip, leftTip, leftStackWithAppData, true, handler);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Recurse below the tip of leftTip, offering each level's appData to the appData of rightTip and rightStackWithAppData.\r\n   * @param leftTip tip node being explored on left. Its appData is not processed.\r\n   * @param rightTip tip node being explored on right. It has no children.\r\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\r\n   * @param reverseArgs true if the caller is exchanging the sense of left and right\r\n   * @param handler search handler\r\n   */\r\n  private static leftRecursivePairSearch<AppDataType>(\r\n    leftTip: RangeTreeNode<AppDataType>,\r\n    rightTip: RangeTreeNode<AppDataType>,\r\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\r\n    reverseArgs: boolean,\r\n    handler: TwoTreeSearchHandler<AppDataType>,\r\n  ) {\r\n    assert(rightTip._children === undefined);\r\n    // The (possibly deep) left children appData needs to be offered to the right path (including tip)\r\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.\r\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\r\n    for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\r\n      if (handler.isRangePairActive(leftChild._range, rightTip._range)) {\r\n        this.processAppDataAndAppData<AppDataType>(leftChild._appData, rightTip._appData, reverseArgs, handler);\r\n        this.processAppDataAndAppDataStack<AppDataType>(leftChild._appData, rightStackWithAppData, reverseArgs, handler);\r\n        this.leftRecursivePairSearch<AppDataType>(leftChild, rightTip, rightStackWithAppData, reverseArgs, handler);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Recursive search down two trees, with range tests and child processing under control of a handler.\r\n   * @param leftRoot root of left tree\r\n   * @param rightRoot root of right tree\r\n   * @param handler handler for range tests and child process\r\n   */\r\n  public static searchTwoTreesTopDown<AppDataType>(\r\n    leftRoot: RangeTreeNode<AppDataType>,\r\n    rightRoot: RangeTreeNode<AppDataType>,\r\n    handler: TwoTreeSearchHandler<AppDataType>,\r\n  ) {\r\n    this.recursivePairSearch(leftRoot, [], [], rightRoot, [], [], handler);\r\n  }\r\n}\r\n/**\r\n * Utilities for various operations on RangeTree\r\n * @internal\r\n */\r\nexport class RangeTreeOps {\r\n  /** Count nodes in this tree. */\r\n  public static getRecursiveNodeCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\r\n    let count = 0;\r\n    root.recurseIntoTree((_node: RangeTreeNode<AppDataType>): boolean => { count++; return true; });\r\n    return count;\r\n  }\r\n  /** Count appData in this tree. */\r\n  public static getRecursiveAppDataCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\r\n    let count = 0;\r\n    root.recurseIntoTree(\r\n      (node: RangeTreeNode<AppDataType>): boolean => { count += node.getNumAppData(); return true; });\r\n    return count;\r\n  }\r\n  /**\r\n   * Create a leaf referencing appData items indexed index0<=index<index1 and with combined range of the same indices\r\n   * @param ranges access to ranges\r\n   * @param appData access to AppDataType items\r\n   * @param index0 first index for block of items\r\n   * @param index1 upper limit index for block of items.\r\n   * @param arrayLength one more than the largest range/appData index\r\n   * @returns newly created node.\r\n   */\r\n  private static createLeafInIndexRange<AppDataType>(\r\n    ranges: IndexToType<Range3d>,\r\n    appData: IndexToType<AppDataType>,\r\n    index0: number,\r\n    index1: number,\r\n    arrayLength: number): RangeTreeNode<AppDataType> {\r\n    const appDataBlock: AppDataType[] = [];\r\n    const range = Range3d.createNull();\r\n    index1 = Math.min(index1, arrayLength);\r\n    // console.log({ case: \"LEAF\", index0, index1 });\r\n    for (let i = index0; i < index1; i++) {\r\n      appDataBlock.push(evaluateIndexToType(appData, i));\r\n      range.extendRange(evaluateIndexToType(ranges, i));\r\n    }\r\n    return RangeTreeNode.createCapture(range, appDataBlock, undefined);\r\n  }\r\n  /**\r\n   * Split the array entries appData[index0 <= i < index1] into blocks of at most maxChildPerNode * maxAppDataPerLeaf and assemble into a tree structure.\r\n   * @param ranges access to ranges\r\n   * @param appData access to AppDataType items\r\n   * @param index0 start index of the block to access\r\n   * @param index1 terminal index for the block (one after final)\r\n   * @param arrayLength one more than the largest range/appData index\r\n   * @param maxChildPerNode max number of child nodes in each interior node\r\n   * @param maxAppDataPerLeaf max number of appData items in each leaf.\r\n   * @returns\r\n   */\r\n  private static createRecursiveByIndexSplits<AppDataType>(\r\n    ranges: IndexToType<Range3d>,\r\n    appData: IndexToType<AppDataType>,\r\n    index0: number,\r\n    index1: number,\r\n    arrayLength: number,\r\n    maxChildPerNode: number,\r\n    maxAppDataPerLeaf: number,\r\n  ): RangeTreeNode<AppDataType> | undefined {\r\n    if (index1 > arrayLength)\r\n      index1 = arrayLength;\r\n\r\n    const range = Range3d.createNull();\r\n    const children: RangeTreeNode<AppDataType>[] = [];\r\n    const maxChildrenAppData = maxChildPerNode * maxAppDataPerLeaf;\r\n    // console.log({ name: \"createRecursive\", index0, index1, maxChildrenAppData });\r\n\r\n    if (index1 <= index0 + maxChildrenAppData) {  // index range is small enough to hold the appData in leaf children\r\n      // console.log({ case: \"LEAF GROUP\", index0, index1 });\r\n      for (let indexA = index0 + maxAppDataPerLeaf; index0 < index1; index0 = indexA, indexA = Math.min(indexA + maxAppDataPerLeaf, index1)) {\r\n        const leaf = RangeTreeOps.createLeafInIndexRange(ranges, appData, index0, indexA, arrayLength);\r\n        if (leaf !== undefined) {\r\n          range.extendRange(leaf.getRangeRef());\r\n          children.push(leaf);\r\n        }\r\n      }\r\n    } else {  // split the appData among interior and leaf children\r\n      // console.log({ case: \"INTERIOR\", index0, index1 });\r\n      const numPerGulp = Math.ceil((index1 - index0) / maxChildPerNode);\r\n      for (let indexA = index0 + numPerGulp; index0 < index1; index0 = indexA, indexA = Math.min(indexA + numPerGulp, index1)) {\r\n        const child = this.createRecursiveByIndexSplits(ranges, appData, index0, indexA, arrayLength, maxChildPerNode, maxAppDataPerLeaf);\r\n        if (child !== undefined) {\r\n          range.extendRange(child.getRangeRef());\r\n          children.push(child);\r\n        }\r\n      }\r\n    }\r\n    return (children.length > 0) ? RangeTreeNode.createCapture(range, undefined, children) : undefined;\r\n  }\r\n  /**\r\n   * Create a range tree by simple left-right split of given ranges.\r\n   * * Leaves carry the inputs in left-to-right order.\r\n   * * Each leaf range is labeled by its corresponding object(s) in the appData array.\r\n   * @param ranges access to ranges.\r\n   * @param appData access to AppDataType items (for leaves).\r\n   * @param arrayLength one more than the largest range/appData index\r\n   * @param maxChildrenPerNode max number of child nodes allowed for each interior node.\r\n   * @param maxAppDataPerLeaf max number of appData items allowed in each leaf.\r\n   * @returns the root of the new tree, or undefined if array lengths differ or are zero.\r\n   */\r\n  public static createByIndexSplits<AppDataType>(\r\n    ranges: IndexToType<Range3d>,\r\n    appData: IndexToType<AppDataType>,\r\n    arrayLength: number,\r\n    maxChildrenPerNode: number = 2,\r\n    maxAppDataPerLeaf: number = 2,\r\n  ): RangeTreeNode<AppDataType> | undefined {\r\n    // console.log();\r\n    // const numData = getFlexDataCount(appData);\r\n    // console.log({ numData });\r\n    if (arrayLength <= 0\r\n      || (Array.isArray(ranges) && ranges.length !== arrayLength)\r\n      || (Array.isArray(appData) && appData.length !== arrayLength))\r\n      return undefined;\r\n    if (maxChildrenPerNode < 2)\r\n      maxChildrenPerNode = 2;\r\n    return RangeTreeOps.createRecursiveByIndexSplits<AppDataType>(ranges, appData, 0, arrayLength, arrayLength, maxChildrenPerNode, maxAppDataPerLeaf);\r\n  }\r\n}\r\n\r\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":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module RangeSearch\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Range3d } from \"../../geometry3d/Range\";\r\n\r\n/** Type name FlexData is shorthand for a member or parameter which can be:\r\n * * undefined\r\n * * an array of values of type T\r\n * * a singleton of type T\r\n */\r\ntype FlexData<T> = undefined | T[] | T;\r\n/**\r\n * Type name IndexToType is shorthand for a member or parameter which can be:\r\n * * an array of values of type T\r\n * * a function from a valid index to type T.\r\n */\r\ntype IndexToType<T> = T[] | ((index: number) => T);\r\n\r\n/**\r\n * Map a valid index to a parameterized type T, where the data argument can be either:\r\n * * an array of type T\r\n * * a function which takes a valid index and returns type T\r\n * @internal\r\n */\r\nfunction evaluateIndexToType<T>(data: IndexToType<T>, index: number): T {\r\n  if (Array.isArray(data))\r\n    return data[index];\r\n  return data(index);\r\n}\r\n/**\r\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.\r\n * @internal\r\n */\r\nfunction getByIndex<T>(index: number, data: FlexData<T>): T | undefined {\r\n  if (data !== undefined) {\r\n    if (Array.isArray(data)) {\r\n      if (index < data.length)\r\n        return data[index];\r\n    } else {\r\n      return data;\r\n    }\r\n  }\r\n  return undefined;\r\n}\r\n/**\r\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.\r\n * @internal\r\n */\r\nfunction getFlexDataCount<T>(data: FlexData<T>): number {\r\n  if (data !== undefined) {\r\n    if (Array.isArray(data)) {\r\n      return data.length;\r\n    } else {\r\n      return 1;\r\n    }\r\n  }\r\n  return 0;\r\n}\r\n/**\r\n * Abstract class for handler objects called during traversal of a single range tree.\r\n * @internal\r\n */\r\nexport abstract class SingleTreeSearchHandler<AppDataType> {\r\n  /** Return true if appData within the range should be offered to `processAppData`. */\r\n  public abstract isRangeActive(range: Range3d): boolean;\r\n  /**\r\n   * Called for a (single) child referenced by a tree.\r\n   * * This is only called when range checks on the path from root have been passed.\r\n   * @param item child (of type AppDataType) in the tree.\r\n   */\r\n  public abstract processAppData(item: AppDataType): void;\r\n  /**\r\n   * Query to see if the active search has been aborted.\r\n   * * Default implementation returns false so query runs to completion.\r\n   * * Search processes check this after range tests and child processing.\r\n   */\r\n  public getIsAborted(): boolean { return false; }\r\n}\r\n/**\r\n * Abstract class for handler objects called during traversal of two range trees.\r\n * @internal\r\n */\r\nexport abstract class TwoTreeSearchHandler<AppDataType> {\r\n  /** Return true if appData within the ranges should be offered to `processAppDataPair`. */\r\n  public abstract isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean;\r\n  /**\r\n   * Called with AppDataType items from left tree and right tree.\r\n   * * This is only called when range tests have been passed.\r\n   * @param leftItem\r\n   * @param rightItem\r\n   */\r\n  public abstract processAppDataPair(leftItem: AppDataType, rightItem: AppDataType): void;\r\n  /**\r\n   * Query to see if the active search has been aborted.\r\n   * * Default implementation returns false so query runs to completion.\r\n   * * Search processes check this after range tests and child processing.\r\n   */\r\n  public getIsAborted(): boolean { return false; }\r\n  /** Whether to ignore z-coordinates in distance computations. */\r\n  public getXYOnly(): boolean { return false; }\r\n}\r\n/**\r\n * This class refines the TwoTreeSearchHandler with an implementation of `isRangePairActive` appropriate for computing the minimum distance between trees.\r\n * * The concrete class must implement `getCurrentDistance()` method to provide the best-so-far distance.\r\n * * The implementation of `isRangePairActive` returns true if the distance between ranges is less than or equal to the `getCurrentDistance()` value.\r\n * @internal\r\n */\r\nexport abstract class TwoTreeDistanceMinimizationSearchHandler<AppDataType> extends TwoTreeSearchHandler<AppDataType>{\r\n  /**\r\n   * Provides the allowable distance between ranges.\r\n   * * Range pairs with more than this distance separation are rejected.\r\n   * * The implementation may alter (probably reduce) the getCurrentDistance() value as the search progresses.\r\n   */\r\n  public abstract getCurrentDistance(): number;\r\n  /**\r\n   * Method called to decide whether to process subtrees and immediate child appData items from a left tree node and right tree node.\r\n   * @param leftRange range from a node in the left tree\r\n   * @param rightRange range from a node in the right tree.\r\n   * @returns true if the smallest distance from leftRange to rightRange is less than or equal to getCurrentDistance()\r\n   */\r\n  public override isRangePairActive(leftRange: Range3d, rightRange: Range3d): boolean {\r\n    const currentDistance = this.getCurrentDistance();\r\n    const distanceBetweenRanges = this.getXYOnly() ? leftRange.distanceToRangeXY(rightRange) : leftRange.distanceToRange(rightRange);\r\n    return distanceBetweenRanges <= currentDistance;\r\n  }\r\n}\r\n\r\nlet numNodeCreated = 0;\r\n\r\n/**\r\n * * TREE STRUCTURE\r\n *   * A RangeTreeNode is part of a range tree.\r\n *   * TREE is used here in a strictly _structural_ sense, which has no broad promises about data members.\r\n *   * Each RangeNode points to 0, 1 or many children.\r\n *   * Each child has (but does not point back to) a single parent.\r\n *   * The overall tree has a single root.\r\n *   * Each node is effectively the root of the tree of its children.\r\n * * NON-TREE DATA MEMBERS\r\n *   * Data members in each node (in addition to children) are\r\n *     * _range = the union of ranges below in the heap\r\n *     * _appData = application data associated with the node.\r\n *       * Construction methods may place multiple _appData items in each node.\r\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.\r\n * * CONSTRUCTION\r\n *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.\r\n *     * The appData is placed entirely in the leaves.\r\n *     * The caller can specify:\r\n *       * the number of _appData items per leaf\r\n *       * the number of children per node within the tree.\r\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:\r\n *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.\r\n *       * larger memory use because of more nodes\r\n *   * For future construction methods:\r\n *      * _appData \"above the leaves\" may allow nodes below to have smaller ranges, but add complexity to search.\r\n * @internal\r\n */\r\nexport class RangeTreeNode<AppDataType> {\r\n  private _range: Range3d;\r\n  private _appData: FlexData<AppDataType>;\r\n  private _children: FlexData<RangeTreeNode<AppDataType>>;\r\n  /** an id assigned sequentially as nodes are created.  For debugging use only. */\r\n  private _id: number;\r\n  /**\r\n   * CONSTRUCTOR\r\n   * CAPTURE (not copy)\r\n   * * range = range for search algorithms\r\n   * * appData = application data relevant to this node.\r\n   * * children = child node reference(s).\r\n   */\r\n  private constructor(range: Range3d, appData: FlexData<AppDataType>, children: FlexData<RangeTreeNode<AppDataType>>) {\r\n    this._range = range;\r\n    this._appData = appData;\r\n    this._children = children;\r\n    this._id = numNodeCreated++;\r\n    // const childIds: number[] = [];\r\n    // if (Array.isArray(this._children))\r\n    //   for (const c of this._children) childIds.push(c._id);\r\n    // else if (this._children instanceof RangeTreeNode)\r\n    //   childIds.push(this._children._id);\r\n    // const numAppData = getFlexDataCount(appData);\r\n    // console.log({ id: this._id, childIds, numAppData });\r\n  }\r\n  /** Simplest public create: capture the range, appData, and children. */\r\n  public static createCapture<AppDataType>(\r\n    range: Range3d,\r\n    appData: FlexData<AppDataType>,\r\n    children: FlexData<RangeTreeNode<AppDataType>>): RangeTreeNode<AppDataType> {\r\n    return new RangeTreeNode<AppDataType>(range, appData, children);\r\n  }\r\n  /** copy (not capture) from given data into the range in this RangeEntry */\r\n  public setRange(data: Range3d) {\r\n    this._range.setFrom(data);\r\n  }\r\n  /** return (a copy of) the range in this RangeEntry */\r\n  public getRange(data?: Range3d): Range3d {\r\n    return this._range.clone(data);\r\n  }\r\n  /** return (a reference to) the range in this RangeEntry */\r\n  public getRangeRef(): Range3d {\r\n    return this._range;\r\n  }\r\n  /**\r\n   * Access a child by index.\r\n   * * If the child data is an array, this dereferences the array.\r\n   * * If the child data is a singleton, treat it as index 0.\r\n   * * return undefined if there are no children.\r\n   * @param index index of item to access.\r\n   */\r\n  public getChildByIndex(index: number): RangeTreeNode<AppDataType> | undefined {\r\n    return getByIndex<RangeTreeNode<AppDataType>>(index, this._children);\r\n  }\r\n  /**\r\n   * * Access an appData by index.\r\n   * * If the appData data is an array, this dereferences the array.\r\n   * * If the appData data is a singleton, treat it as if it is at index 0 in an array\r\n   * * return undefined if there are no appData or for any index out of range.\r\n   * @param index index of item to access.\r\n   */\r\n  public getAppDataByIndex(index: number): AppDataType | undefined {\r\n    return getByIndex<AppDataType>(index, this._appData);\r\n  }\r\n  /** Access the children or child (does not clone). */\r\n  public getAllChildren(): FlexData<RangeTreeNode<AppDataType>> {\r\n    return this._children;\r\n  }\r\n  /** Access the appData array or singleton (does not clone). */\r\n  public getAllAppData(): FlexData<AppDataType> {\r\n    return this._appData;\r\n  }\r\n  /**\r\n   * Count the direct children in this node of the tree.\r\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveNodeCount`.\r\n   */\r\n  public getNumChildren(): number {\r\n    return getFlexDataCount(this._children);\r\n  }\r\n  /**\r\n   * Count the appData items in this node of the tree.\r\n   * * This is not recursive. For a recursive count, use `RangeTreeOps.getRecursiveAppDataCount`.\r\n   */\r\n  public getNumAppData(): number {\r\n    return getFlexDataCount(this._appData);\r\n  }\r\n  /**\r\n   * Depth-first tree iteration, calling `announceNode` on each node.\r\n   * @param announceNode callback that returns true to recurse into children\r\n   */\r\n  public recurseIntoTree(announceNode: (node: RangeTreeNode<AppDataType>) => boolean) {\r\n    const doChildren = announceNode(this);\r\n    if (doChildren) {\r\n      if (Array.isArray(this._children)) {\r\n        for (const child of this._children)\r\n          child.recurseIntoTree(announceNode);\r\n      } else if (this._children !== undefined) {\r\n        this._children.recurseIntoTree(announceNode);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Depth-first tree iteration via handler.\r\n   * * if handler decides the instance range is active, process appData, then recurse on children\r\n   * * if handler decides to abort after processing an appData, skip processing rest of appData and children\r\n   */\r\n  public searchTopDown(handler: SingleTreeSearchHandler<AppDataType>) {\r\n    if (handler.isRangeActive(this._range)) {\r\n      let itemToProcess: AppDataType | undefined;\r\n      for (let i = 0; undefined !== (itemToProcess = this.getAppDataByIndex(i)); i++) {\r\n        // console.log(itemToProcess);\r\n        handler.processAppData(itemToProcess);\r\n        if (handler.getIsAborted())\r\n          return;\r\n      }\r\n      let child: RangeTreeNode<AppDataType> | undefined;\r\n      for (let i = 0; undefined !== (child = this.getChildByIndex(i)); i++) {\r\n        child.searchTopDown(handler);\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightStack.\r\n   * @param leftAppData singleton or array with data \"from left\"\r\n   * @param rightStack stack of nodes to process from right path.\r\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.\r\n   * @param handler search handler\r\n   */\r\n  private static processAppDataAndAppDataStack<AppDataType>(\r\n    leftAppData: FlexData<AppDataType>,\r\n    rightStack: RangeTreeNode<AppDataType>[],\r\n    reverseArgs: boolean,\r\n    handler: TwoTreeSearchHandler<AppDataType>,\r\n  ) {\r\n    if (leftAppData !== undefined) {\r\n      let leftItem: AppDataType | undefined;\r\n      let rightItem: AppDataType | undefined;\r\n      // hmm.. we ASSUME that if the tip ranges passed, then all parent ranges would pass without further test.\r\n      for (let rangeIndex = rightStack.length; rangeIndex-- > 0;) {\r\n        const rightAppData = rightStack[rangeIndex]._appData;\r\n        for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\r\n          for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\r\n            if (!reverseArgs)\r\n              handler.processAppDataPair(leftItem, rightItem);\r\n            else\r\n              handler.processAppDataPair(rightItem, leftItem);\r\n            if (handler.getIsAborted())\r\n              return;\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Apply the handler.processAppDataPair method to each pair of appData items from leftAppData and rightAppData.\r\n   * @param leftAppData singleton or array with data \"from left\"\r\n   * @param rightAppData singleton or array with data \"from right\"\r\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.\r\n   * @param handler search handler\r\n   */\r\n  private static processAppDataAndAppData<AppDataType>(\r\n    leftAppData: FlexData<AppDataType>,\r\n    rightAppData: FlexData<AppDataType>,\r\n    reverseArgs: boolean,\r\n    handler: TwoTreeSearchHandler<AppDataType>,\r\n  ) {\r\n    if (leftAppData !== undefined && rightAppData !== undefined) {\r\n      let leftItem: AppDataType | undefined;\r\n      let rightItem: AppDataType | undefined;\r\n      for (let rightIndex = 0; undefined !== (rightItem = getByIndex<AppDataType>(rightIndex, rightAppData)); rightIndex++) {\r\n        for (let leftIndex = 0; undefined !== (leftItem = getByIndex<AppDataType>(leftIndex, leftAppData)); leftIndex++) {\r\n          if (!reverseArgs)\r\n            handler.processAppDataPair(leftItem, rightItem);\r\n          else\r\n            handler.processAppDataPair(rightItem, leftItem);\r\n          if (handler.getIsAborted())\r\n            return;\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Push the tip node to stack(s).\r\n   * @param tip new node (to be pushed)\r\n   * @param fullPath complete path, which is always extended\r\n   * @param partialPath partial path, which is only extended if the tip has _appData.\r\n   */\r\n  private static pushPaths<AppDataType>(\r\n    tip: RangeTreeNode<AppDataType>,\r\n    fullPath: RangeTreeNode<AppDataType>[],\r\n    partialPath: RangeTreeNode<AppDataType>[],\r\n  ) {\r\n    fullPath.push(tip);\r\n    if (tip._appData !== undefined) {\r\n      partialPath.push(tip);\r\n    }\r\n  }\r\n  /**\r\n   * Pop the tip node from stack(s).\r\n   * @param tip should match the fullPath tip.\r\n   * @param fullPath complete path, which is always popped\r\n   * @param partialPath partial path, which is only popped if the tip has _appData.\r\n   */\r\n  private static popPaths<AppDataType>(\r\n    tip: RangeTreeNode<AppDataType>,\r\n    fullPath: RangeTreeNode<AppDataType>[],\r\n    partialPath: RangeTreeNode<AppDataType>[],\r\n  ) {\r\n    assert(fullPath[fullPath.length - 1] === tip);\r\n    fullPath.pop();\r\n    if (tip._appData !== undefined) {\r\n      partialPath.pop();\r\n    }\r\n  }\r\n  /**\r\n   * Process nodes from left and right trees of dual search.\r\n   * * The separate stacks for nodes that have appData is for efficiency.\r\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.\r\n   * @param leftTip tip node being explored on left\r\n   * @param leftStack stack of prior left nodes\r\n   * @param leftStackWithAppData stack of prior left nodes which have appData.\r\n   * @param rightTip tip node being explored on right.\r\n   * @param rightStack stack of prior right nodes.\r\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\r\n   * @param handler search handler\r\n   */\r\n  private static recursivePairSearch<AppDataType>(\r\n    leftTip: RangeTreeNode<AppDataType>,\r\n    leftStack: RangeTreeNode<AppDataType>[],\r\n    leftStackWithAppData: RangeTreeNode<AppDataType>[],\r\n    rightTip: RangeTreeNode<AppDataType>,\r\n    rightStack: RangeTreeNode<AppDataType>[],\r\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\r\n    handler: TwoTreeSearchHandler<AppDataType>,\r\n  ) {\r\n    // console.log({ leftId: leftTip._id, rightId: rightTip._id });\r\n    const leftTipHasAppData = leftTip._appData !== undefined;\r\n    const rightTipHasAppData = rightTip._appData !== undefined;\r\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\r\n    let rightChild: RangeTreeNode<AppDataType> | undefined;\r\n\r\n    // process immediate appData from each tip node with the entire prior path of the other side (each stack currently lacks the tip).\r\n    if (leftTipHasAppData && rightStackWithAppData.length > 0) {\r\n      this.processAppDataAndAppDataStack<AppDataType>(leftTip._appData, rightStackWithAppData, false, handler);\r\n    }\r\n    if (leftStackWithAppData.length > 0 && rightTipHasAppData) {\r\n      this.processAppDataAndAppDataStack<AppDataType>(rightTip._appData, leftStackWithAppData, true, handler);\r\n    }\r\n\r\n    if (handler.isRangePairActive(leftTip._range, rightTip._range)) {\r\n      this.processAppDataAndAppData<AppDataType>(leftTip._appData, rightTip._appData, false, handler);\r\n\r\n      if (leftTip._children !== undefined && rightTip._children !== undefined) {\r\n        this.pushPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\r\n        this.pushPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\r\n        for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\r\n          for (let rightIndex = 0; undefined !== (rightChild = getByIndex<RangeTreeNode<AppDataType>>(rightIndex, rightTip._children)); rightIndex++) {\r\n            this.recursivePairSearch(\r\n              leftChild, leftStack, leftStackWithAppData,\r\n              rightChild, rightStack, rightStackWithAppData,\r\n              handler);\r\n          }\r\n        }\r\n        this.popPaths<AppDataType>(leftTip, leftStack, leftStackWithAppData);\r\n        this.popPaths<AppDataType>(rightTip, rightStack, rightStackWithAppData);\r\n      } else if (leftTip._children !== undefined) {\r\n        this.leftRecursivePairSearch<AppDataType>(leftTip, rightTip, rightStackWithAppData, false, handler);\r\n      } else if (rightTip._children !== undefined) {\r\n        this.leftRecursivePairSearch<AppDataType>(rightTip, leftTip, leftStackWithAppData, true, handler);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Recurse below the tip of leftTip, offering each level's appData to the appData of rightTip and rightStackWithAppData.\r\n   * @param leftTip tip node being explored on left. Its appData is not processed.\r\n   * @param rightTip tip node being explored on right. It has no children.\r\n   * @param rightStackWithAppData stack of prior right nodes which have appData.\r\n   * @param reverseArgs true if the caller is exchanging the sense of left and right\r\n   * @param handler search handler\r\n   */\r\n  private static leftRecursivePairSearch<AppDataType>(\r\n    leftTip: RangeTreeNode<AppDataType>,\r\n    rightTip: RangeTreeNode<AppDataType>,\r\n    rightStackWithAppData: RangeTreeNode<AppDataType>[],\r\n    reverseArgs: boolean,\r\n    handler: TwoTreeSearchHandler<AppDataType>,\r\n  ) {\r\n    assert(rightTip._children === undefined);\r\n    // The (possibly deep) left children appData needs to be offered to the right path (including tip)\r\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.\r\n    let leftChild: RangeTreeNode<AppDataType> | undefined;\r\n    for (let leftIndex = 0; undefined !== (leftChild = getByIndex<RangeTreeNode<AppDataType>>(leftIndex, leftTip._children)); leftIndex++) {\r\n      if (handler.isRangePairActive(leftChild._range, rightTip._range)) {\r\n        this.processAppDataAndAppData<AppDataType>(leftChild._appData, rightTip._appData, reverseArgs, handler);\r\n        this.processAppDataAndAppDataStack<AppDataType>(leftChild._appData, rightStackWithAppData, reverseArgs, handler);\r\n        this.leftRecursivePairSearch<AppDataType>(leftChild, rightTip, rightStackWithAppData, reverseArgs, handler);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Recursive search down two trees, with range tests and child processing under control of a handler.\r\n   * @param leftRoot root of left tree\r\n   * @param rightRoot root of right tree\r\n   * @param handler handler for range tests and child process\r\n   */\r\n  public static searchTwoTreesTopDown<AppDataType>(\r\n    leftRoot: RangeTreeNode<AppDataType>,\r\n    rightRoot: RangeTreeNode<AppDataType>,\r\n    handler: TwoTreeSearchHandler<AppDataType>,\r\n  ) {\r\n    this.recursivePairSearch(leftRoot, [], [], rightRoot, [], [], handler);\r\n  }\r\n}\r\n/**\r\n * Utilities for various operations on RangeTree\r\n * @internal\r\n */\r\nexport class RangeTreeOps {\r\n  /** Count nodes in this tree. */\r\n  public static getRecursiveNodeCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\r\n    let count = 0;\r\n    root.recurseIntoTree((_node: RangeTreeNode<AppDataType>): boolean => { count++; return true; });\r\n    return count;\r\n  }\r\n  /** Count appData in this tree. */\r\n  public static getRecursiveAppDataCount<AppDataType>(root: RangeTreeNode<AppDataType>): number {\r\n    let count = 0;\r\n    root.recurseIntoTree(\r\n      (node: RangeTreeNode<AppDataType>): boolean => { count += node.getNumAppData(); return true; });\r\n    return count;\r\n  }\r\n  /**\r\n   * Create a leaf referencing appData items indexed index0<=index<index1 and with combined range of the same indices\r\n   * @param ranges access to ranges\r\n   * @param appData access to AppDataType items\r\n   * @param index0 first index for block of items\r\n   * @param index1 upper limit index for block of items.\r\n   * @param arrayLength one more than the largest range/appData index\r\n   * @returns newly created node.\r\n   */\r\n  private static createLeafInIndexRange<AppDataType>(\r\n    ranges: IndexToType<Range3d>,\r\n    appData: IndexToType<AppDataType>,\r\n    index0: number,\r\n    index1: number,\r\n    arrayLength: number): RangeTreeNode<AppDataType> {\r\n    const appDataBlock: AppDataType[] = [];\r\n    const range = Range3d.createNull();\r\n    index1 = Math.min(index1, arrayLength);\r\n    // console.log({ case: \"LEAF\", index0, index1 });\r\n    for (let i = index0; i < index1; i++) {\r\n      appDataBlock.push(evaluateIndexToType(appData, i));\r\n      range.extendRange(evaluateIndexToType(ranges, i));\r\n    }\r\n    return RangeTreeNode.createCapture(range, appDataBlock, undefined);\r\n  }\r\n  /**\r\n   * Split the array entries appData[index0 <= i < index1] into blocks of at most maxChildPerNode * maxAppDataPerLeaf and assemble into a tree structure.\r\n   * @param ranges access to ranges\r\n   * @param appData access to AppDataType items\r\n   * @param index0 start index of the block to access\r\n   * @param index1 terminal index for the block (one after final)\r\n   * @param arrayLength one more than the largest range/appData index\r\n   * @param maxChildPerNode max number of child nodes in each interior node\r\n   * @param maxAppDataPerLeaf max number of appData items in each leaf.\r\n   * @returns\r\n   */\r\n  private static createRecursiveByIndexSplits<AppDataType>(\r\n    ranges: IndexToType<Range3d>,\r\n    appData: IndexToType<AppDataType>,\r\n    index0: number,\r\n    index1: number,\r\n    arrayLength: number,\r\n    maxChildPerNode: number,\r\n    maxAppDataPerLeaf: number,\r\n  ): RangeTreeNode<AppDataType> | undefined {\r\n    if (index1 > arrayLength)\r\n      index1 = arrayLength;\r\n\r\n    const range = Range3d.createNull();\r\n    const children: RangeTreeNode<AppDataType>[] = [];\r\n    const maxChildrenAppData = maxChildPerNode * maxAppDataPerLeaf;\r\n    // console.log({ name: \"createRecursive\", index0, index1, maxChildrenAppData });\r\n\r\n    if (index1 <= index0 + maxChildrenAppData) {  // index range is small enough to hold the appData in leaf children\r\n      // console.log({ case: \"LEAF GROUP\", index0, index1 });\r\n      for (let indexA = index0 + maxAppDataPerLeaf; index0 < index1; index0 = indexA, indexA = Math.min(indexA + maxAppDataPerLeaf, index1)) {\r\n        const leaf = RangeTreeOps.createLeafInIndexRange(ranges, appData, index0, indexA, arrayLength);\r\n        if (leaf !== undefined) {\r\n          range.extendRange(leaf.getRangeRef());\r\n          children.push(leaf);\r\n        }\r\n      }\r\n    } else {  // split the appData among interior and leaf children\r\n      // console.log({ case: \"INTERIOR\", index0, index1 });\r\n      const numPerGulp = Math.ceil((index1 - index0) / maxChildPerNode);\r\n      for (let indexA = index0 + numPerGulp; index0 < index1; index0 = indexA, indexA = Math.min(indexA + numPerGulp, index1)) {\r\n        const child = this.createRecursiveByIndexSplits(ranges, appData, index0, indexA, arrayLength, maxChildPerNode, maxAppDataPerLeaf);\r\n        if (child !== undefined) {\r\n          range.extendRange(child.getRangeRef());\r\n          children.push(child);\r\n        }\r\n      }\r\n    }\r\n    return (children.length > 0) ? RangeTreeNode.createCapture(range, undefined, children) : undefined;\r\n  }\r\n  /**\r\n   * Create a range tree by simple left-right split of given ranges.\r\n   * * Leaves carry the inputs in left-to-right order.\r\n   * * Each leaf range is labeled by its corresponding object(s) in the appData array.\r\n   * @param ranges access to ranges.\r\n   * @param appData access to AppDataType items (for leaves).\r\n   * @param arrayLength one more than the largest range/appData index\r\n   * @param maxChildrenPerNode max number of child nodes allowed for each interior node.\r\n   * @param maxAppDataPerLeaf max number of appData items allowed in each leaf.\r\n   * @returns the root of the new tree, or undefined if array lengths differ or are zero.\r\n   */\r\n  public static createByIndexSplits<AppDataType>(\r\n    ranges: IndexToType<Range3d>,\r\n    appData: IndexToType<AppDataType>,\r\n    arrayLength: number,\r\n    maxChildrenPerNode: number = 2,\r\n    maxAppDataPerLeaf: number = 2,\r\n  ): RangeTreeNode<AppDataType> | undefined {\r\n    // console.log();\r\n    // const numData = getFlexDataCount(appData);\r\n    // console.log({ numData });\r\n    if (arrayLength <= 0\r\n      || (Array.isArray(ranges) && ranges.length !== arrayLength)\r\n      || (Array.isArray(appData) && appData.length !== arrayLength))\r\n      return undefined;\r\n    if (maxChildrenPerNode < 2)\r\n      maxChildrenPerNode = 2;\r\n    return RangeTreeOps.createRecursiveByIndexSplits<AppDataType>(ranges, appData, 0, arrayLength, arrayLength, maxChildrenPerNode, maxAppDataPerLeaf);\r\n  }\r\n}\r\n\r\n"]}

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;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"}
+{"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;CAezE;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"}

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

@@ -209,8 +209,8 @@ class SingleTreeSearchHandlerForClosestPointOnLineString3d extends RangeTreeNode
     _workSegment;
     /** Test a segment indexed in the range tree as candidate for "closest" */
     processAppData(candidateIndex) {
-        const segment = this._workSegment = this.context.lineString.getIndexedSegment(candidateIndex, this._workSegment);
-        if (segment) {
+        if (0 <= candidateIndex && candidateIndex < this.context.lineString.numEdges()) {
+            const segment = this._workSegment = this.context.lineString.getUncheckedIndexedSegment(candidateIndex, this._workSegment);
             const cld = segment.closestPoint(this.spacePoint, false);
             LineString3d_1.LineString3d.convertLocalToGlobalDetail(cld, candidateIndex, this.context.lineString.numEdges(), this.context.lineString);
             this.context.numPointTest++;
@@ -271,16 +271,18 @@ class TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach extends Range
     static _workSegmentB;
     /** Compute and test the closest approach between two segments, given their indices. */
     processAppDataPair(indexA, indexB) {
-        this.contextA.numPointTest++;
-        const segA = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA =
-            this.contextA.lineString.getIndexedSegment(indexA, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA);
-        const segB = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB =
-            this.contextB.lineString.getIndexedSegment(indexB, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB);
-        const cldPair = LineSegment3d_1.LineSegment3d.closestApproach(segA, false, segB, false);
-        if (cldPair && this.searchState.isNewMinOrTrigger(cldPair.detailA.a)) {
-            LineString3d_1.LineString3d.convertLocalToGlobalDetail(cldPair.detailA, indexA, this.contextA.lineString.numEdges(), this.contextA.lineString);
-            LineString3d_1.LineString3d.convertLocalToGlobalDetail(cldPair.detailB, indexB, this.contextB.lineString.numEdges(), this.contextB.lineString);
-            this.searchState.testAndSave(cldPair, cldPair.detailA.a);
+        if (0 <= indexA && indexA < this.contextA.lineString.numEdges() && 0 <= indexB && indexB < this.contextB.lineString.numEdges()) {
+            this.contextA.numPointTest++;
+            const segA = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA =
+                this.contextA.lineString.getUncheckedIndexedSegment(indexA, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA);
+            const segB = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB =
+                this.contextB.lineString.getUncheckedIndexedSegment(indexB, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB);
+            const cldPair = LineSegment3d_1.LineSegment3d.closestApproach(segA, false, segB, false);
+            if (cldPair && this.searchState.isNewMinOrTrigger(cldPair.detailA.a)) {
+                LineString3d_1.LineString3d.convertLocalToGlobalDetail(cldPair.detailA, indexA, this.contextA.lineString.numEdges(), this.contextA.lineString);
+                LineString3d_1.LineString3d.convertLocalToGlobalDetail(cldPair.detailB, indexB, this.contextB.lineString.numEdges(), this.contextB.lineString);
+                this.searchState.testAndSave(cldPair, cldPair.detailA.a);
+            }
         }
     }
 }

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

@@ -1 +1 @@
-{"version":3,"file":"RangeTreeSearchHandlers.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeSearchHandlers.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,yEAA+F;AAC/F,6DAA0D;AAC1D,2DAAwD;AACxD,6CAA0C;AAC1C,sEAA2D;AAC3D,4DAAgF;AAGhF,gEAA+I;AAE/I,6DAA0D;AAG1D,mDAAoG;AAEpG;;;;GAIG;AACH,MAAa,6CAA8C,SAAQ,uCAA+B;IAChG,0BAA0B;IACnB,OAAO,CAA+B;IAC7C,4BAA4B;IACrB,WAAW,CAA6B;IAC/C,kCAAkC;IAC3B,UAAU,CAAU;IAE3B;;;;;OAKG;IACH,YAAmB,UAA0B,EAAE,OAAqC,EAAE,OAAgB;QACpG,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAAS,OAAO,CAAC,CAAC;QAC9D,IAAI,CAAC,UAAU,GAAG,yBAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IACnD,CAAC;IACD,uCAAuC;IAChC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;YAC7F,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;YAC/C,MAAM,GAAG,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACzG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;YAClC,OAAO,GAAG,CAAC;QACb,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAC1C,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAA0B,EAAE,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAC5D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACzG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACxC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAc;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrH,IAAI,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wEAAwE;IACxD,cAAc,CAAC,cAAsB;QACnD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC;QAChK,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;QAC5B,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC;CACF;AAjED,sGAiEC;AAED;;;;GAIG;AACH,MAAa,4DAA6D,SAAQ,wDAAgD;IAChI,sCAAsC;IAC/B,QAAQ,CAA+B;IAC9C,uCAAuC;IAChC,QAAQ,CAA+B;IAC9C,wDAAwD;IACjD,WAAW,CAA8C;IAEhE,yDAAyD;IACjD,OAAO,CAAW;IAE1B;;;;;OAKG;IACH,YAAmB,QAAsC,EAAE,QAAsC,EAAE,OAAgB;QACjH,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAA0B,OAAO,CAAC,CAAC;QAC/E,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC;IACpD,CAAC;IACD,0CAA0C;IACnC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,4DAA4D;IACrD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,kBAAkB;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;QACpC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,gEAAgE;IAChD,SAAS,KAAc,OAAO,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC;IAEtE,6EAA6E;IAC7D,kBAAkB,CAAC,MAAc,EAAE,MAAc;QAC/D,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,mBAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7K,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,MAAM,OAAO,GAAG,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EACvE,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CACxE,CAAC;YACF,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1C,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;CACF;AA/DD,oIA+DC;AAED;;;;GAIG;AACH,MAAa,oDAAqD,SAAQ,uCAA+B;IACvG,0BAA0B;IACnB,OAAO,CAA+B;IAC7C,4BAA4B;IACrB,WAAW,CAA0C;IAC5D,iCAAiC;IAC1B,UAAU,CAAU;IAE3B;;;;;OAKG;IACH,YAAmB,UAAmB,EAAE,OAAqC,EAAE,OAAgB;QAC7F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAAsB,OAAO,CAAC,CAAC;QAC3E,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;IACvC,CAAC;IACD,uCAAuC;IAChC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;YAC7F,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAc;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IACO,YAAY,CAAiB;IACrC,0EAA0E;IAC1D,cAAc,CAAC,cAAsB;QACnD,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,IAAI,CAAC,YAAY,CAAE,CAAC;QAClH,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACzD,2BAAY,CAAC,0BAA0B,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAC1H,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;CACF;AA7DD,oHA6DC;AAED;;;;GAIG;AACH,MAAa,4DAA6D,SAAQ,wDAAgD;IAChI,iCAAiC;IAC1B,QAAQ,CAA+B;IAC9C,kCAAkC;IAC3B,QAAQ,CAA+B;IAC9C,wDAAwD;IACjD,WAAW,CAA8C;IAEhE;;;;;OAKG;IACH,YAAmB,QAAsC,EAAE,QAAsC,EAAE,OAAgB;QACjH,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAA0B,OAAO,CAAC,CAAC;IACjF,CAAC;IACD;;;OAGG;IACI,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,4DAA4D;IACrD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,kBAAkB;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;QACpC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACO,MAAM,CAAC,aAAa,CAAiB;IACrC,MAAM,CAAC,aAAa,CAAiB;IAC7C,uFAAuF;IACvE,kBAAkB,CAAC,MAAc,EAAE,MAAc;QAC/D,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,4DAA4D,CAAC,aAAa;YACrF,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,iBAAiB,CAAC,MAAM,EAAE,4DAA4D,CAAC,aAAa,CAAE,CAAC;QAClI,MAAM,IAAI,GAAG,4DAA4D,CAAC,aAAa;YACrF,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,iBAAiB,CAAC,MAAM,EAAE,4DAA4D,CAAC,aAAa,CAAE,CAAC;QAClI,MAAM,OAAO,GAAG,6BAAa,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACxE,IAAI,OAAO,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACrE,2BAAY,CAAC,0BAA0B,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAChI,2BAAY,CAAC,0BAA0B,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAChI,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;CACF;AA5DD,oIA4DC;AAED;;;;GAIG;AACH,MAAa,gDAAiD,SAAQ,uCAA+B;IACnG,0BAA0B;IACnB,OAAO,CAA2B;IACzC,4BAA4B;IACrB,WAAW,CAA0C;IAC5D,iCAAiC;IAC1B,UAAU,CAAU;IAC3B,kDAAkD;IAC3C,mBAAmB,CAAU;IAEpC;;;;;;OAMG;IACH,YAAmB,UAA0B,EAAE,OAAiC,EAAE,OAAgB,EAAE,sBAA+B,KAAK;QACtI,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAAsB,OAAO,CAAC,CAAC;QAC3E,IAAI,CAAC,UAAU,GAAG,yBAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QACjD,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,CAAC;IACjD,CAAC;IACD,uCAAuC;IAChC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;YAC7F,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAc;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wEAAwE;IACxD,cAAc,CAAC,cAAsB;QACnD,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,sFAAsF;QAC1H,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,eAAe,CAAC,cAAc,CAAC,EAAE,CAAC;YACzD,IAAI,GAAsC,CAAC;YAC3C,IAAI,IAAI,CAAC,mBAAmB;gBAC1B,GAAG,GAAG,uBAAU,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;;gBAE3E,GAAG,GAAG,uBAAU,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACvF,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;YAC5B,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrD,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC;gBAClD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY;oBACnC,CAAC,CAAC,+CAAyB,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC;oBAClG,CAAC,CAAC,kDAA4B,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;gBACxG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAzED,4GAyEC;AACD;;;;GAIG;AACH,MAAa,8CAA+C,SAAQ,wDAAgD;IAClH,iCAAiC;IAC1B,QAAQ,CAA2B;IAC1C,kCAAkC;IAC3B,QAAQ,CAA2B;IAC1C,4DAA4D;IACrD,WAAW,CAA8C;IAChE,kDAAkD;IAC3C,mBAAmB,CAAU;IAEpC;;;;;MAKE;IACF,YAAmB,QAAkC,EAAE,QAAkC,EAAE,OAAgB,EAAE,sBAA+B,KAAK;QAC/I,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAA0B,OAAO,CAAC,CAAC;QAC/E,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,IAAI,QAAQ,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,CAAC;IACnG,CAAC;IACD,8CAA8C;IACvC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,4DAA4D;IACrD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,kBAAkB;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;QACpC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,qFAAqF;IACrE,kBAAkB,CAAC,MAAc,EAAE,MAAc;QAC/D,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAE,oEAAoE;QAC1G,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC;YACnG,+CAA+C;YAC/C,MAAM,OAAO,GAAG,uBAAU,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;YAC1I,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC7B,IAAI,OAAO,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrE,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC;gBACxD,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC;gBACxD,MAAM,OAAO,GAAG,6CAAuB,CAAC,MAAM,CAC5C,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,+CAAyB,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kDAA4B,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,EAC3L,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,+CAAyB,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kDAA4B,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAC5L,CAAC;gBACF,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;CACF;AA/DD,wGA+DC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module RangeSearch\r\n */\r\n\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../../curve/CurveLocationDetail\";\r\nimport { LineSegment3d } from \"../../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../../curve/LineString3d\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { PolygonLocationDetail, PolygonOps } from \"../../geometry3d/PolygonOps\";\r\nimport { Range3d } from \"../../geometry3d/Range\";\r\nimport { XAndY, XYAndZ } from \"../../geometry3d/XYZProps\";\r\nimport { ConvexFacetLocationDetail, FacetLocationDetail, FacetLocationDetailPair, NonConvexFacetLocationDetail } from \"../FacetLocationDetail\";\r\nimport { LineString3dRangeTreeContext } from \"./LineString3dRangeTreeContext\";\r\nimport { MinimumValueTester } from \"./MinimumValueTester\";\r\nimport { Point3dArrayRangeTreeContext } from \"./Point3dArrayRangeTreeContext\";\r\nimport { PolyfaceRangeTreeContext } from \"./PolyfaceRangeTreeContext\";\r\nimport { SingleTreeSearchHandler, TwoTreeDistanceMinimizationSearchHandler } from \"./RangeTreeNode\";\r\n\r\n/**\r\n * Helper class for searching for the closest point in a set of points.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\r\n * @internal\r\n */\r\nexport class SingleTreeSearchHandlerForClosestPointInArray extends SingleTreeSearchHandler<number> {\r\n  /** The calling context */\r\n  public context: Point3dArrayRangeTreeContext;\r\n  /** Evolving search state */\r\n  public searchState: MinimumValueTester<number>;\r\n  /** Space point for the search  */\r\n  public spacePoint: Point3d;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param spacePoint cloned\r\n   * @param context captured\r\n   * @param maxDist collect points at no more than this distance from spacePoint\r\n   */\r\n  public constructor(spacePoint: XAndY | XYAndZ, context: Point3dArrayRangeTreeContext, maxDist?: number) {\r\n    super();\r\n    this.context = context;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<number>(maxDist);\r\n    this.spacePoint = Point3d.createFrom(spacePoint);\r\n  }\r\n  /** Return the current closest point */\r\n  public getResult(): CurveLocationDetail | undefined {\r\n    if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {\r\n      const iPoint = this.searchState.itemAtMinValue;\r\n      const cld = CurveLocationDetail.createCurveFractionPoint(undefined, iPoint, this.context.points[iPoint]);\r\n      cld.a = this.searchState.minValue;\r\n      return cld;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected closest points (if collecting) */\r\n  public getSavedItems(): CurveLocationDetail[] | undefined {\r\n    if (this.searchState.savedItems.length === 0)\r\n      return undefined;\r\n    const cldArray: CurveLocationDetail[] = [];\r\n    for (let i = 0; i < this.searchState.savedItems.length; ++i) {\r\n      const iPoint = this.searchState.savedItems[i];\r\n      const cld = CurveLocationDetail.createCurveFractionPoint(undefined, iPoint, this.context.points[iPoint]);\r\n      cld.a = this.searchState.savedValues[i];\r\n      cldArray.push(cld);\r\n    }\r\n    return cldArray;\r\n  }\r\n  /**\r\n   * Return true if appData within the range should be offered to `processAppData`.\r\n   * @param range range containing items to be tested.\r\n   * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.\r\n   */\r\n  public override isRangeActive(range: Range3d): boolean {\r\n    const dMin = this.context.xyOnly ? range.distanceToPointXY(this.spacePoint) : range.distanceToPoint(this.spacePoint);\r\n    if (this.searchState.isNewMinValue(dMin)) {\r\n      this.context.numRangeTestTrue++;\r\n      return true;\r\n    }\r\n    this.context.numRangeTestFalse++;\r\n    return false;\r\n  }\r\n  /** Test a point indexed in the range tree as candidate for \"closest\" */\r\n  public override processAppData(candidateIndex: number): void {\r\n    const d = this.context.xyOnly ? this.spacePoint.distanceXY(this.context.points[candidateIndex]) : this.spacePoint.distance(this.context.points[candidateIndex]);\r\n    this.context.numPointTest++;\r\n    this.searchState.testAndSave(candidateIndex, d);\r\n  }\r\n}\r\n\r\n/**\r\n * Helper class for searching for the closest approach between sets of points.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\r\n * @internal\r\n */\r\nexport class TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {\r\n  /** Context for first set of points */\r\n  public contextA: Point3dArrayRangeTreeContext;\r\n  /** Context for second set of points */\r\n  public contextB: Point3dArrayRangeTreeContext;\r\n  /** Search state with current min distance point pair */\r\n  public searchState: MinimumValueTester<CurveLocationDetailPair>;\r\n\r\n  /** True if and only if both contexts specify xy-only. */\r\n  private _xyOnly?: boolean;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param contextA captured\r\n   * @param contextB captured\r\n   * @param maxDist collect points at no more than this separation distance\r\n   */\r\n  public constructor(contextA: Point3dArrayRangeTreeContext, contextB: Point3dArrayRangeTreeContext, maxDist?: number) {\r\n    super();\r\n    this.contextA = contextA;\r\n    this.contextB = contextB;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<CurveLocationDetailPair>(maxDist);\r\n    this._xyOnly = contextA.xyOnly && contextB.xyOnly;\r\n  }\r\n  /** Return the current closest approach */\r\n  public getResult(): CurveLocationDetailPair | undefined {\r\n    if (this.searchState.minValue !== undefined) {\r\n      return this.searchState.itemAtMinValue;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected close approaches (if collecting) */\r\n  public getSavedItems(): CurveLocationDetailPair[] | undefined {\r\n    if (this.searchState.savedItems.length > 0) {\r\n      return this.searchState.savedItems;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Get current min distance */\r\n  public override getCurrentDistance(): number {\r\n    const d = this.searchState.minValue;\r\n    return d === undefined ? Number.MAX_VALUE : d;\r\n  }\r\n  /** Whether to ignore z-coordinates in distance computations. */\r\n  public override getXYOnly(): boolean { return this._xyOnly ?? false; }\r\n\r\n  /** Compute and test the distance between two points, given their indices. */\r\n  public override processAppDataPair(indexA: number, indexB: number): void {\r\n    this.contextA.numPointTest++;\r\n    const pointA = this.contextA.points[indexA];\r\n    const pointB = this.contextB.points[indexB];\r\n    const d = this._xyOnly ? Geometry.distanceXYXY(pointA.x, pointA.y, pointB.x, pointB.y) : Geometry.distanceXYZXYZ(pointA.x, pointA.y, pointA.z, pointB.x, pointB.y, pointB.z);\r\n    if (this.searchState.isNewMinOrTrigger(d)) {\r\n      const cldPair = CurveLocationDetailPair.createCapture(\r\n        CurveLocationDetail.createCurveFractionPoint(undefined, indexA, pointA),\r\n        CurveLocationDetail.createCurveFractionPoint(undefined, indexB, pointB),\r\n      );\r\n      cldPair.detailA.a = cldPair.detailB.a = d;\r\n      this.searchState.testAndSave(cldPair, d);\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * Helper class for searching for the closest point in a linestring.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\r\n * @internal\r\n */\r\nexport class SingleTreeSearchHandlerForClosestPointOnLineString3d extends SingleTreeSearchHandler<number> {\r\n  /** The calling context */\r\n  public context: LineString3dRangeTreeContext;\r\n  /** Evolving search state */\r\n  public searchState: MinimumValueTester<CurveLocationDetail>;\r\n  /** Space point for the search */\r\n  public spacePoint: Point3d;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param spacePoint cloned\r\n   * @param context captured\r\n   * @param maxDist collect points at no more than this distance from spacePoint\r\n   */\r\n  public constructor(spacePoint: Point3d, context: LineString3dRangeTreeContext, maxDist?: number) {\r\n    super();\r\n    this.context = context;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<CurveLocationDetail>(maxDist);\r\n    this.spacePoint = spacePoint.clone();\r\n  }\r\n  /** Return the current closest point */\r\n  public getResult(): CurveLocationDetail | undefined {\r\n    if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {\r\n      return this.searchState.itemAtMinValue;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected closest points (if collecting) */\r\n  public getSavedItems(): CurveLocationDetail[] | undefined {\r\n    if (this.searchState.savedItems.length > 0) {\r\n      return this.searchState.savedItems;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return true if appData within the range should be offered to `processAppData`.\r\n   * @param range range containing items to be tested.\r\n   * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.\r\n   */\r\n  public override isRangeActive(range: Range3d): boolean {\r\n    const dMin = range.distanceToPoint(this.spacePoint);\r\n    if (this.searchState.isNewMinValue(dMin)) {\r\n      this.context.numRangeTestTrue++;\r\n      return true;\r\n    }\r\n    this.context.numRangeTestFalse++;\r\n    return false;\r\n  }\r\n  private _workSegment?: LineSegment3d;\r\n  /** Test a segment indexed in the range tree as candidate for \"closest\" */\r\n  public override processAppData(candidateIndex: number): void {\r\n    const segment = this._workSegment = this.context.lineString.getIndexedSegment(candidateIndex, this._workSegment)!;\r\n    if (segment) {\r\n      const cld = segment.closestPoint(this.spacePoint, false);\r\n      LineString3d.convertLocalToGlobalDetail(cld, candidateIndex, this.context.lineString.numEdges(), this.context.lineString);\r\n      this.context.numPointTest++;\r\n      this.searchState.testAndSave(cld, cld.a);\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * Helper class for searching for the closest approach between linestrings.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\r\n * @internal\r\n */\r\nexport class TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {\r\n  /** Context for first polyline */\r\n  public contextA: LineString3dRangeTreeContext;\r\n  /** Context for second polyline */\r\n  public contextB: LineString3dRangeTreeContext;\r\n  /** Search state with current min distance point pair */\r\n  public searchState: MinimumValueTester<CurveLocationDetailPair>;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param contextA captured\r\n   * @param contextB captured\r\n   * @param maxDist collect points at no more than this separation distance\r\n   */\r\n  public constructor(contextA: LineString3dRangeTreeContext, contextB: LineString3dRangeTreeContext, maxDist?: number) {\r\n    super();\r\n    this.contextA = contextA;\r\n    this.contextB = contextB;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<CurveLocationDetailPair>(maxDist);\r\n  }\r\n  /**\r\n   * Return the current closest approach.\r\n   * * Details contain linestring *and* segment data, cf. [[LineString3d.convertLocalToGlobalDetail]]\r\n   */\r\n  public getResult(): CurveLocationDetailPair | undefined {\r\n    if (this.searchState.minValue !== undefined) {\r\n      return this.searchState.itemAtMinValue;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected close approaches (if collecting) */\r\n  public getSavedItems(): CurveLocationDetailPair[] | undefined {\r\n    if (this.searchState.savedItems.length > 0) {\r\n      return this.searchState.savedItems;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Get current min distance */\r\n  public override getCurrentDistance(): number {\r\n    const d = this.searchState.minValue;\r\n    return d === undefined ? Number.MAX_VALUE : d;\r\n  }\r\n  private static _workSegmentA?: LineSegment3d;\r\n  private static _workSegmentB?: LineSegment3d;\r\n  /** Compute and test the closest approach between two segments, given their indices. */\r\n  public override processAppDataPair(indexA: number, indexB: number): void {\r\n    this.contextA.numPointTest++;\r\n    const segA = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA =\r\n      this.contextA.lineString.getIndexedSegment(indexA, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA)!;\r\n    const segB = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB =\r\n      this.contextB.lineString.getIndexedSegment(indexB, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB)!;\r\n    const cldPair = LineSegment3d.closestApproach(segA, false, segB, false);\r\n    if (cldPair && this.searchState.isNewMinOrTrigger(cldPair.detailA.a)) {\r\n      LineString3d.convertLocalToGlobalDetail(cldPair.detailA, indexA, this.contextA.lineString.numEdges(), this.contextA.lineString);\r\n      LineString3d.convertLocalToGlobalDetail(cldPair.detailB, indexB, this.contextB.lineString.numEdges(), this.contextB.lineString);\r\n      this.searchState.testAndSave(cldPair, cldPair.detailA.a);\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * Helper class for searching for the closest point in a polyface.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).\r\n * @internal\r\n */\r\nexport class SingleTreeSearchHandlerForClosestPointOnPolyface extends SingleTreeSearchHandler<number> {\r\n  /** The calling context */\r\n  public context: PolyfaceRangeTreeContext;\r\n  /** Evolving search state */\r\n  public searchState: MinimumValueTester<FacetLocationDetail>;\r\n  /** Space point for the search */\r\n  public spacePoint: Point3d;\r\n  /** Whether to include facet interior in search */\r\n  public searchFacetInterior: boolean;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param spacePoint point to test\r\n   * @param context captured\r\n   * @param maxDist collect points at no more than this distance from spacePoint\r\n   * @param searchFacetInterior true: search facet interior + boundary; false: just boundary\r\n   */\r\n  public constructor(spacePoint: XYAndZ | XAndY, context: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior: boolean = false) {\r\n    super();\r\n    this.context = context;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<FacetLocationDetail>(maxDist);\r\n    this.spacePoint = Point3d.createFrom(spacePoint);\r\n    this.searchFacetInterior = searchFacetInterior;\r\n  }\r\n  /** Return the current closest point */\r\n  public getResult(): FacetLocationDetail | undefined {\r\n    if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {\r\n      return this.searchState.itemAtMinValue;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected closest points (if collecting) */\r\n  public getSavedItems(): FacetLocationDetail[] | undefined {\r\n    if (this.searchState.savedItems.length > 0) {\r\n      return this.searchState.savedItems;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return true if appData within the range should be offered to `processAppData`.\r\n   * @param range range containing items to be tested.\r\n   * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.\r\n   */\r\n  public override isRangeActive(range: Range3d): boolean {\r\n    const dMin = range.distanceToPoint(this.spacePoint);\r\n    if (this.searchState.isNewMinValue(dMin)) {\r\n      this.context.numRangeTestTrue++;\r\n      return true;\r\n    }\r\n    this.context.numRangeTestFalse++;\r\n    return false;\r\n  }\r\n  /** Test a facet indexed in the range tree as candidate for \"closest\" */\r\n  public override processAppData(candidateIndex: number): void {\r\n    this.context.visitor.setNumWrap(0); // so edgeCount === pointCount; closure point unnecessary for closestPoint[OnBoundary]\r\n    if (this.context.visitor.moveToReadIndex(candidateIndex)) {\r\n      let pld: PolygonLocationDetail | undefined;\r\n      if (this.searchFacetInterior)\r\n        pld = PolygonOps.closestPoint(this.context.visitor.point, this.spacePoint);\r\n      else\r\n        pld = PolygonOps.closestPointOnBoundary(this.context.visitor.point, this.spacePoint);\r\n      this.context.numFacetTest++;\r\n      if (pld && this.searchState.isNewMinOrTrigger(pld.a)) {\r\n        const edgeCount = this.context.visitor.pointCount;\r\n        const fld = this.context.convexFacets\r\n          ? ConvexFacetLocationDetail.createCapture(this.context.visitor.currentReadIndex(), edgeCount, pld)\r\n          : NonConvexFacetLocationDetail.createCapture(this.context.visitor.currentReadIndex(), edgeCount, pld);\r\n        this.searchState.testAndSave(fld, pld.a);\r\n      }\r\n    }\r\n  }\r\n}\r\n/**\r\n * Helper class for searching for the closest approach between polyfaces.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).\r\n * @internal\r\n */\r\nexport class TwoTreeSearchHandlerForFacetFacetCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {\r\n  /** Context for first polyface */\r\n  public contextA: PolyfaceRangeTreeContext;\r\n  /** Context for second polyface */\r\n  public contextB: PolyfaceRangeTreeContext;\r\n  /** Search state with current min distance and facet pair */\r\n  public searchState: MinimumValueTester<FacetLocationDetailPair>;\r\n  /** Whether to include facet interior in search */\r\n  public searchFacetInterior: boolean;\r\n\r\n  /** Constructor\r\n   * @param contextA captured\r\n   * @param contextB captured\r\n   * @param maxDist collect points at no more than this separation distance\r\n   * @param searchFacetInterior true: search facet interior + boundary; false: just boundary\r\n  */\r\n  public constructor(contextA: PolyfaceRangeTreeContext, contextB: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior: boolean = false) {\r\n    super();\r\n    this.contextA = contextA;\r\n    this.contextB = contextB;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<FacetLocationDetailPair>(maxDist);\r\n    this.searchFacetInterior = searchFacetInterior && contextA.convexFacets && contextB.convexFacets;\r\n  }\r\n  /** Return the facets with closest approach */\r\n  public getResult(): FacetLocationDetailPair | undefined {\r\n    if (this.searchState.minValue !== undefined) {\r\n      return this.searchState.itemAtMinValue;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected close approaches (if collecting) */\r\n  public getSavedItems(): FacetLocationDetailPair[] | undefined {\r\n    if (this.searchState.savedItems.length > 0) {\r\n      return this.searchState.savedItems;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Get current min distance */\r\n  public override getCurrentDistance(): number {\r\n    const d = this.searchState.minValue;\r\n    return d === undefined ? Number.MAX_VALUE : d;\r\n  }\r\n  /** Compute and test the closest approach between two facets, given their indices. */\r\n  public override processAppDataPair(indexA: number, indexB: number): void {\r\n    this.contextA.visitor.setNumWrap(1);  // closed polygons are more efficient for PolygonOps.closestApproach\r\n    this.contextB.visitor.setNumWrap(1);\r\n    if (this.contextA.visitor.moveToReadIndex(indexA) && this.contextB.visitor.moveToReadIndex(indexB)) {\r\n      // ASSUME: not worth sending in maxDist here...\r\n      const pldPair = PolygonOps.closestApproach(this.contextA.visitor.point, this.contextB.visitor.point, undefined, this.searchFacetInterior);\r\n      this.contextA.numFacetTest++;\r\n      if (pldPair && this.searchState.isNewMinOrTrigger(pldPair.detailA.a)) {\r\n        const edgeCountA = this.contextA.visitor.pointCount - 1;\r\n        const edgeCountB = this.contextB.visitor.pointCount - 1;\r\n        const fldPair = FacetLocationDetailPair.create(\r\n          this.contextA.convexFacets ? ConvexFacetLocationDetail.createCapture(indexA, edgeCountA, pldPair.detailA) : NonConvexFacetLocationDetail.createCapture(indexA, edgeCountA, pldPair.detailA),\r\n          this.contextB.convexFacets ? ConvexFacetLocationDetail.createCapture(indexB, edgeCountB, pldPair.detailB) : NonConvexFacetLocationDetail.createCapture(indexB, edgeCountB, pldPair.detailB),\r\n        );\r\n        this.searchState.testAndSave(fldPair, fldPair.detailA.a);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n"]}
+{"version":3,"file":"RangeTreeSearchHandlers.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeSearchHandlers.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,yEAA+F;AAC/F,6DAA0D;AAC1D,2DAAwD;AACxD,6CAA0C;AAC1C,sEAA2D;AAC3D,4DAAgF;AAGhF,gEAA+I;AAE/I,6DAA0D;AAG1D,mDAAoG;AAEpG;;;;GAIG;AACH,MAAa,6CAA8C,SAAQ,uCAA+B;IAChG,0BAA0B;IACnB,OAAO,CAA+B;IAC7C,4BAA4B;IACrB,WAAW,CAA6B;IAC/C,kCAAkC;IAC3B,UAAU,CAAU;IAE3B;;;;;OAKG;IACH,YAAmB,UAA0B,EAAE,OAAqC,EAAE,OAAgB;QACpG,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAAS,OAAO,CAAC,CAAC;QAC9D,IAAI,CAAC,UAAU,GAAG,yBAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IACnD,CAAC;IACD,uCAAuC;IAChC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;YAC7F,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;YAC/C,MAAM,GAAG,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACzG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;YAClC,OAAO,GAAG,CAAC;QACb,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAC1C,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAA0B,EAAE,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAC5D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACzG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACxC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAc;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrH,IAAI,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wEAAwE;IACxD,cAAc,CAAC,cAAsB;QACnD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC;QAChK,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;QAC5B,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC;CACF;AAjED,sGAiEC;AAED;;;;GAIG;AACH,MAAa,4DAA6D,SAAQ,wDAAgD;IAChI,sCAAsC;IAC/B,QAAQ,CAA+B;IAC9C,uCAAuC;IAChC,QAAQ,CAA+B;IAC9C,wDAAwD;IACjD,WAAW,CAA8C;IAEhE,yDAAyD;IACjD,OAAO,CAAW;IAE1B;;;;;OAKG;IACH,YAAmB,QAAsC,EAAE,QAAsC,EAAE,OAAgB;QACjH,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAA0B,OAAO,CAAC,CAAC;QAC/E,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC;IACpD,CAAC;IACD,0CAA0C;IACnC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,4DAA4D;IACrD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,kBAAkB;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;QACpC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,gEAAgE;IAChD,SAAS,KAAc,OAAO,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC;IAEtE,6EAA6E;IAC7D,kBAAkB,CAAC,MAAc,EAAE,MAAc;QAC/D,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,mBAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QAC7K,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1C,MAAM,OAAO,GAAG,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EACvE,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CACxE,CAAC;YACF,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1C,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;CACF;AA/DD,oIA+DC;AAED;;;;GAIG;AACH,MAAa,oDAAqD,SAAQ,uCAA+B;IACvG,0BAA0B;IACnB,OAAO,CAA+B;IAC7C,4BAA4B;IACrB,WAAW,CAA0C;IAC5D,iCAAiC;IAC1B,UAAU,CAAU;IAE3B;;;;;OAKG;IACH,YAAmB,UAAmB,EAAE,OAAqC,EAAE,OAAgB;QAC7F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAAsB,OAAO,CAAC,CAAC;QAC3E,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;IACvC,CAAC;IACD,uCAAuC;IAChC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;YAC7F,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAc;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IACO,YAAY,CAAiB;IACrC,0EAA0E;IAC1D,cAAc,CAAC,cAAsB;QACnD,IAAI,CAAC,IAAI,cAAc,IAAI,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC;YAC/E,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,0BAA0B,CAAC,cAAc,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC1H,MAAM,GAAG,GAAG,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACzD,2BAAY,CAAC,0BAA0B,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAC1H,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;CACF;AA7DD,oHA6DC;AAED;;;;GAIG;AACH,MAAa,4DAA6D,SAAQ,wDAAgD;IAChI,iCAAiC;IAC1B,QAAQ,CAA+B;IAC9C,kCAAkC;IAC3B,QAAQ,CAA+B;IAC9C,wDAAwD;IACjD,WAAW,CAA8C;IAEhE;;;;;OAKG;IACH,YAAmB,QAAsC,EAAE,QAAsC,EAAE,OAAgB;QACjH,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAA0B,OAAO,CAAC,CAAC;IACjF,CAAC;IACD;;;OAGG;IACI,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,4DAA4D;IACrD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,kBAAkB;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;QACpC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACO,MAAM,CAAC,aAAa,CAAiB;IACrC,MAAM,CAAC,aAAa,CAAiB;IAC7C,uFAAuF;IACvE,kBAAkB,CAAC,MAAc,EAAE,MAAc;QAC/D,IAAI,CAAC,IAAI,MAAM,IAAI,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,MAAM,IAAI,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC;YAC/H,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,4DAA4D,CAAC,aAAa;gBACrF,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,4DAA4D,CAAC,aAAa,CAAC,CAAC;YAC1I,MAAM,IAAI,GAAG,4DAA4D,CAAC,aAAa;gBACrF,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,4DAA4D,CAAC,aAAa,CAAC,CAAC;YAC1I,MAAM,OAAO,GAAG,6BAAa,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YACxE,IAAI,OAAO,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrE,2BAAY,CAAC,0BAA0B,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;gBAChI,2BAAY,CAAC,0BAA0B,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;gBAChI,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;CACF;AA9DD,oIA8DC;AAED;;;;GAIG;AACH,MAAa,gDAAiD,SAAQ,uCAA+B;IACnG,0BAA0B;IACnB,OAAO,CAA2B;IACzC,4BAA4B;IACrB,WAAW,CAA0C;IAC5D,iCAAiC;IAC1B,UAAU,CAAU;IAC3B,kDAAkD;IAC3C,mBAAmB,CAAU;IAEpC;;;;;;OAMG;IACH,YAAmB,UAA0B,EAAE,OAAiC,EAAE,OAAgB,EAAE,sBAA+B,KAAK;QACtI,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAAsB,OAAO,CAAC,CAAC;QAC3E,IAAI,CAAC,UAAU,GAAG,yBAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QACjD,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,CAAC;IACjD,CAAC;IACD,uCAAuC;IAChC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,cAAc,KAAK,SAAS,EAAE,CAAC;YAC7F,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAc;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wEAAwE;IACxD,cAAc,CAAC,cAAsB;QACnD,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,sFAAsF;QAC1H,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,eAAe,CAAC,cAAc,CAAC,EAAE,CAAC;YACzD,IAAI,GAAsC,CAAC;YAC3C,IAAI,IAAI,CAAC,mBAAmB;gBAC1B,GAAG,GAAG,uBAAU,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;;gBAE3E,GAAG,GAAG,uBAAU,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACvF,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;YAC5B,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrD,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC;gBAClD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY;oBACnC,CAAC,CAAC,+CAAyB,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC;oBAClG,CAAC,CAAC,kDAA4B,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;gBACxG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAzED,4GAyEC;AACD;;;;GAIG;AACH,MAAa,8CAA+C,SAAQ,wDAAgD;IAClH,iCAAiC;IAC1B,QAAQ,CAA2B;IAC1C,kCAAkC;IAC3B,QAAQ,CAA2B;IAC1C,4DAA4D;IACrD,WAAW,CAA8C;IAChE,kDAAkD;IAC3C,mBAAmB,CAAU;IAEpC;;;;;MAKE;IACF,YAAmB,QAAkC,EAAE,QAAkC,EAAE,OAAgB,EAAE,sBAA+B,KAAK;QAC/I,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,uCAAkB,CAAC,MAAM,CAA0B,OAAO,CAAC,CAAC;QAC/E,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,IAAI,QAAQ,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,CAAC;IACnG,CAAC;IACD,8CAA8C;IACvC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;QACzC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,4DAA4D;IACrD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,kBAAkB;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;QACpC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,qFAAqF;IACrE,kBAAkB,CAAC,MAAc,EAAE,MAAc;QAC/D,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAE,oEAAoE;QAC1G,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC;YACnG,+CAA+C;YAC/C,MAAM,OAAO,GAAG,uBAAU,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;YAC1I,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC7B,IAAI,OAAO,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrE,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC;gBACxD,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC;gBACxD,MAAM,OAAO,GAAG,6CAAuB,CAAC,MAAM,CAC5C,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,+CAAyB,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kDAA4B,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,EAC3L,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,+CAAyB,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,kDAA4B,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAC5L,CAAC;gBACF,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;CACF;AA/DD,wGA+DC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module RangeSearch\r\n */\r\n\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../../curve/CurveLocationDetail\";\r\nimport { LineSegment3d } from \"../../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../../curve/LineString3d\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { PolygonLocationDetail, PolygonOps } from \"../../geometry3d/PolygonOps\";\r\nimport { Range3d } from \"../../geometry3d/Range\";\r\nimport { XAndY, XYAndZ } from \"../../geometry3d/XYZProps\";\r\nimport { ConvexFacetLocationDetail, FacetLocationDetail, FacetLocationDetailPair, NonConvexFacetLocationDetail } from \"../FacetLocationDetail\";\r\nimport { LineString3dRangeTreeContext } from \"./LineString3dRangeTreeContext\";\r\nimport { MinimumValueTester } from \"./MinimumValueTester\";\r\nimport { Point3dArrayRangeTreeContext } from \"./Point3dArrayRangeTreeContext\";\r\nimport { PolyfaceRangeTreeContext } from \"./PolyfaceRangeTreeContext\";\r\nimport { SingleTreeSearchHandler, TwoTreeDistanceMinimizationSearchHandler } from \"./RangeTreeNode\";\r\n\r\n/**\r\n * Helper class for searching for the closest point in a set of points.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\r\n * @internal\r\n */\r\nexport class SingleTreeSearchHandlerForClosestPointInArray extends SingleTreeSearchHandler<number> {\r\n  /** The calling context */\r\n  public context: Point3dArrayRangeTreeContext;\r\n  /** Evolving search state */\r\n  public searchState: MinimumValueTester<number>;\r\n  /** Space point for the search  */\r\n  public spacePoint: Point3d;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param spacePoint cloned\r\n   * @param context captured\r\n   * @param maxDist collect points at no more than this distance from spacePoint\r\n   */\r\n  public constructor(spacePoint: XAndY | XYAndZ, context: Point3dArrayRangeTreeContext, maxDist?: number) {\r\n    super();\r\n    this.context = context;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<number>(maxDist);\r\n    this.spacePoint = Point3d.createFrom(spacePoint);\r\n  }\r\n  /** Return the current closest point */\r\n  public getResult(): CurveLocationDetail | undefined {\r\n    if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {\r\n      const iPoint = this.searchState.itemAtMinValue;\r\n      const cld = CurveLocationDetail.createCurveFractionPoint(undefined, iPoint, this.context.points[iPoint]);\r\n      cld.a = this.searchState.minValue;\r\n      return cld;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected closest points (if collecting) */\r\n  public getSavedItems(): CurveLocationDetail[] | undefined {\r\n    if (this.searchState.savedItems.length === 0)\r\n      return undefined;\r\n    const cldArray: CurveLocationDetail[] = [];\r\n    for (let i = 0; i < this.searchState.savedItems.length; ++i) {\r\n      const iPoint = this.searchState.savedItems[i];\r\n      const cld = CurveLocationDetail.createCurveFractionPoint(undefined, iPoint, this.context.points[iPoint]);\r\n      cld.a = this.searchState.savedValues[i];\r\n      cldArray.push(cld);\r\n    }\r\n    return cldArray;\r\n  }\r\n  /**\r\n   * Return true if appData within the range should be offered to `processAppData`.\r\n   * @param range range containing items to be tested.\r\n   * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.\r\n   */\r\n  public override isRangeActive(range: Range3d): boolean {\r\n    const dMin = this.context.xyOnly ? range.distanceToPointXY(this.spacePoint) : range.distanceToPoint(this.spacePoint);\r\n    if (this.searchState.isNewMinValue(dMin)) {\r\n      this.context.numRangeTestTrue++;\r\n      return true;\r\n    }\r\n    this.context.numRangeTestFalse++;\r\n    return false;\r\n  }\r\n  /** Test a point indexed in the range tree as candidate for \"closest\" */\r\n  public override processAppData(candidateIndex: number): void {\r\n    const d = this.context.xyOnly ? this.spacePoint.distanceXY(this.context.points[candidateIndex]) : this.spacePoint.distance(this.context.points[candidateIndex]);\r\n    this.context.numPointTest++;\r\n    this.searchState.testAndSave(candidateIndex, d);\r\n  }\r\n}\r\n\r\n/**\r\n * Helper class for searching for the closest approach between sets of points.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\r\n * @internal\r\n */\r\nexport class TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {\r\n  /** Context for first set of points */\r\n  public contextA: Point3dArrayRangeTreeContext;\r\n  /** Context for second set of points */\r\n  public contextB: Point3dArrayRangeTreeContext;\r\n  /** Search state with current min distance point pair */\r\n  public searchState: MinimumValueTester<CurveLocationDetailPair>;\r\n\r\n  /** True if and only if both contexts specify xy-only. */\r\n  private _xyOnly?: boolean;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param contextA captured\r\n   * @param contextB captured\r\n   * @param maxDist collect points at no more than this separation distance\r\n   */\r\n  public constructor(contextA: Point3dArrayRangeTreeContext, contextB: Point3dArrayRangeTreeContext, maxDist?: number) {\r\n    super();\r\n    this.contextA = contextA;\r\n    this.contextB = contextB;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<CurveLocationDetailPair>(maxDist);\r\n    this._xyOnly = contextA.xyOnly && contextB.xyOnly;\r\n  }\r\n  /** Return the current closest approach */\r\n  public getResult(): CurveLocationDetailPair | undefined {\r\n    if (this.searchState.minValue !== undefined) {\r\n      return this.searchState.itemAtMinValue;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected close approaches (if collecting) */\r\n  public getSavedItems(): CurveLocationDetailPair[] | undefined {\r\n    if (this.searchState.savedItems.length > 0) {\r\n      return this.searchState.savedItems;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Get current min distance */\r\n  public override getCurrentDistance(): number {\r\n    const d = this.searchState.minValue;\r\n    return d === undefined ? Number.MAX_VALUE : d;\r\n  }\r\n  /** Whether to ignore z-coordinates in distance computations. */\r\n  public override getXYOnly(): boolean { return this._xyOnly ?? false; }\r\n\r\n  /** Compute and test the distance between two points, given their indices. */\r\n  public override processAppDataPair(indexA: number, indexB: number): void {\r\n    this.contextA.numPointTest++;\r\n    const pointA = this.contextA.points[indexA];\r\n    const pointB = this.contextB.points[indexB];\r\n    const d = this._xyOnly ? Geometry.distanceXYXY(pointA.x, pointA.y, pointB.x, pointB.y) : Geometry.distanceXYZXYZ(pointA.x, pointA.y, pointA.z, pointB.x, pointB.y, pointB.z);\r\n    if (this.searchState.isNewMinOrTrigger(d)) {\r\n      const cldPair = CurveLocationDetailPair.createCapture(\r\n        CurveLocationDetail.createCurveFractionPoint(undefined, indexA, pointA),\r\n        CurveLocationDetail.createCurveFractionPoint(undefined, indexB, pointB),\r\n      );\r\n      cldPair.detailA.a = cldPair.detailB.a = d;\r\n      this.searchState.testAndSave(cldPair, d);\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * Helper class for searching for the closest point in a linestring.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\r\n * @internal\r\n */\r\nexport class SingleTreeSearchHandlerForClosestPointOnLineString3d extends SingleTreeSearchHandler<number> {\r\n  /** The calling context */\r\n  public context: LineString3dRangeTreeContext;\r\n  /** Evolving search state */\r\n  public searchState: MinimumValueTester<CurveLocationDetail>;\r\n  /** Space point for the search */\r\n  public spacePoint: Point3d;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param spacePoint cloned\r\n   * @param context captured\r\n   * @param maxDist collect points at no more than this distance from spacePoint\r\n   */\r\n  public constructor(spacePoint: Point3d, context: LineString3dRangeTreeContext, maxDist?: number) {\r\n    super();\r\n    this.context = context;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<CurveLocationDetail>(maxDist);\r\n    this.spacePoint = spacePoint.clone();\r\n  }\r\n  /** Return the current closest point */\r\n  public getResult(): CurveLocationDetail | undefined {\r\n    if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {\r\n      return this.searchState.itemAtMinValue;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected closest points (if collecting) */\r\n  public getSavedItems(): CurveLocationDetail[] | undefined {\r\n    if (this.searchState.savedItems.length > 0) {\r\n      return this.searchState.savedItems;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return true if appData within the range should be offered to `processAppData`.\r\n   * @param range range containing items to be tested.\r\n   * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.\r\n   */\r\n  public override isRangeActive(range: Range3d): boolean {\r\n    const dMin = range.distanceToPoint(this.spacePoint);\r\n    if (this.searchState.isNewMinValue(dMin)) {\r\n      this.context.numRangeTestTrue++;\r\n      return true;\r\n    }\r\n    this.context.numRangeTestFalse++;\r\n    return false;\r\n  }\r\n  private _workSegment?: LineSegment3d;\r\n  /** Test a segment indexed in the range tree as candidate for \"closest\" */\r\n  public override processAppData(candidateIndex: number): void {\r\n    if (0 <= candidateIndex && candidateIndex < this.context.lineString.numEdges()) {\r\n      const segment = this._workSegment = this.context.lineString.getUncheckedIndexedSegment(candidateIndex, this._workSegment);\r\n      const cld = segment.closestPoint(this.spacePoint, false);\r\n      LineString3d.convertLocalToGlobalDetail(cld, candidateIndex, this.context.lineString.numEdges(), this.context.lineString);\r\n      this.context.numPointTest++;\r\n      this.searchState.testAndSave(cld, cld.a);\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * Helper class for searching for the closest approach between linestrings.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\r\n * @internal\r\n */\r\nexport class TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {\r\n  /** Context for first polyline */\r\n  public contextA: LineString3dRangeTreeContext;\r\n  /** Context for second polyline */\r\n  public contextB: LineString3dRangeTreeContext;\r\n  /** Search state with current min distance point pair */\r\n  public searchState: MinimumValueTester<CurveLocationDetailPair>;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param contextA captured\r\n   * @param contextB captured\r\n   * @param maxDist collect points at no more than this separation distance\r\n   */\r\n  public constructor(contextA: LineString3dRangeTreeContext, contextB: LineString3dRangeTreeContext, maxDist?: number) {\r\n    super();\r\n    this.contextA = contextA;\r\n    this.contextB = contextB;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<CurveLocationDetailPair>(maxDist);\r\n  }\r\n  /**\r\n   * Return the current closest approach.\r\n   * * Details contain linestring *and* segment data, cf. [[LineString3d.convertLocalToGlobalDetail]]\r\n   */\r\n  public getResult(): CurveLocationDetailPair | undefined {\r\n    if (this.searchState.minValue !== undefined) {\r\n      return this.searchState.itemAtMinValue;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected close approaches (if collecting) */\r\n  public getSavedItems(): CurveLocationDetailPair[] | undefined {\r\n    if (this.searchState.savedItems.length > 0) {\r\n      return this.searchState.savedItems;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Get current min distance */\r\n  public override getCurrentDistance(): number {\r\n    const d = this.searchState.minValue;\r\n    return d === undefined ? Number.MAX_VALUE : d;\r\n  }\r\n  private static _workSegmentA?: LineSegment3d;\r\n  private static _workSegmentB?: LineSegment3d;\r\n  /** Compute and test the closest approach between two segments, given their indices. */\r\n  public override processAppDataPair(indexA: number, indexB: number): void {\r\n    if (0 <= indexA && indexA < this.contextA.lineString.numEdges() && 0 <= indexB && indexB < this.contextB.lineString.numEdges()) {\r\n      this.contextA.numPointTest++;\r\n      const segA = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA =\r\n        this.contextA.lineString.getUncheckedIndexedSegment(indexA, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA);\r\n      const segB = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB =\r\n        this.contextB.lineString.getUncheckedIndexedSegment(indexB, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB);\r\n      const cldPair = LineSegment3d.closestApproach(segA, false, segB, false);\r\n      if (cldPair && this.searchState.isNewMinOrTrigger(cldPair.detailA.a)) {\r\n        LineString3d.convertLocalToGlobalDetail(cldPair.detailA, indexA, this.contextA.lineString.numEdges(), this.contextA.lineString);\r\n        LineString3d.convertLocalToGlobalDetail(cldPair.detailB, indexB, this.contextB.lineString.numEdges(), this.contextB.lineString);\r\n        this.searchState.testAndSave(cldPair, cldPair.detailA.a);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * Helper class for searching for the closest point in a polyface.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).\r\n * @internal\r\n */\r\nexport class SingleTreeSearchHandlerForClosestPointOnPolyface extends SingleTreeSearchHandler<number> {\r\n  /** The calling context */\r\n  public context: PolyfaceRangeTreeContext;\r\n  /** Evolving search state */\r\n  public searchState: MinimumValueTester<FacetLocationDetail>;\r\n  /** Space point for the search */\r\n  public spacePoint: Point3d;\r\n  /** Whether to include facet interior in search */\r\n  public searchFacetInterior: boolean;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param spacePoint point to test\r\n   * @param context captured\r\n   * @param maxDist collect points at no more than this distance from spacePoint\r\n   * @param searchFacetInterior true: search facet interior + boundary; false: just boundary\r\n   */\r\n  public constructor(spacePoint: XYAndZ | XAndY, context: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior: boolean = false) {\r\n    super();\r\n    this.context = context;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<FacetLocationDetail>(maxDist);\r\n    this.spacePoint = Point3d.createFrom(spacePoint);\r\n    this.searchFacetInterior = searchFacetInterior;\r\n  }\r\n  /** Return the current closest point */\r\n  public getResult(): FacetLocationDetail | undefined {\r\n    if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {\r\n      return this.searchState.itemAtMinValue;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected closest points (if collecting) */\r\n  public getSavedItems(): FacetLocationDetail[] | undefined {\r\n    if (this.searchState.savedItems.length > 0) {\r\n      return this.searchState.savedItems;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return true if appData within the range should be offered to `processAppData`.\r\n   * @param range range containing items to be tested.\r\n   * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.\r\n   */\r\n  public override isRangeActive(range: Range3d): boolean {\r\n    const dMin = range.distanceToPoint(this.spacePoint);\r\n    if (this.searchState.isNewMinValue(dMin)) {\r\n      this.context.numRangeTestTrue++;\r\n      return true;\r\n    }\r\n    this.context.numRangeTestFalse++;\r\n    return false;\r\n  }\r\n  /** Test a facet indexed in the range tree as candidate for \"closest\" */\r\n  public override processAppData(candidateIndex: number): void {\r\n    this.context.visitor.setNumWrap(0); // so edgeCount === pointCount; closure point unnecessary for closestPoint[OnBoundary]\r\n    if (this.context.visitor.moveToReadIndex(candidateIndex)) {\r\n      let pld: PolygonLocationDetail | undefined;\r\n      if (this.searchFacetInterior)\r\n        pld = PolygonOps.closestPoint(this.context.visitor.point, this.spacePoint);\r\n      else\r\n        pld = PolygonOps.closestPointOnBoundary(this.context.visitor.point, this.spacePoint);\r\n      this.context.numFacetTest++;\r\n      if (pld && this.searchState.isNewMinOrTrigger(pld.a)) {\r\n        const edgeCount = this.context.visitor.pointCount;\r\n        const fld = this.context.convexFacets\r\n          ? ConvexFacetLocationDetail.createCapture(this.context.visitor.currentReadIndex(), edgeCount, pld)\r\n          : NonConvexFacetLocationDetail.createCapture(this.context.visitor.currentReadIndex(), edgeCount, pld);\r\n        this.searchState.testAndSave(fld, pld.a);\r\n      }\r\n    }\r\n  }\r\n}\r\n/**\r\n * Helper class for searching for the closest approach between polyfaces.\r\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).\r\n * @internal\r\n */\r\nexport class TwoTreeSearchHandlerForFacetFacetCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {\r\n  /** Context for first polyface */\r\n  public contextA: PolyfaceRangeTreeContext;\r\n  /** Context for second polyface */\r\n  public contextB: PolyfaceRangeTreeContext;\r\n  /** Search state with current min distance and facet pair */\r\n  public searchState: MinimumValueTester<FacetLocationDetailPair>;\r\n  /** Whether to include facet interior in search */\r\n  public searchFacetInterior: boolean;\r\n\r\n  /** Constructor\r\n   * @param contextA captured\r\n   * @param contextB captured\r\n   * @param maxDist collect points at no more than this separation distance\r\n   * @param searchFacetInterior true: search facet interior + boundary; false: just boundary\r\n  */\r\n  public constructor(contextA: PolyfaceRangeTreeContext, contextB: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior: boolean = false) {\r\n    super();\r\n    this.contextA = contextA;\r\n    this.contextB = contextB;\r\n    if (maxDist !== undefined && maxDist < 0)\r\n      maxDist = undefined;\r\n    this.searchState = MinimumValueTester.create<FacetLocationDetailPair>(maxDist);\r\n    this.searchFacetInterior = searchFacetInterior && contextA.convexFacets && contextB.convexFacets;\r\n  }\r\n  /** Return the facets with closest approach */\r\n  public getResult(): FacetLocationDetailPair | undefined {\r\n    if (this.searchState.minValue !== undefined) {\r\n      return this.searchState.itemAtMinValue;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return the collected close approaches (if collecting) */\r\n  public getSavedItems(): FacetLocationDetailPair[] | undefined {\r\n    if (this.searchState.savedItems.length > 0) {\r\n      return this.searchState.savedItems;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Get current min distance */\r\n  public override getCurrentDistance(): number {\r\n    const d = this.searchState.minValue;\r\n    return d === undefined ? Number.MAX_VALUE : d;\r\n  }\r\n  /** Compute and test the closest approach between two facets, given their indices. */\r\n  public override processAppDataPair(indexA: number, indexB: number): void {\r\n    this.contextA.visitor.setNumWrap(1);  // closed polygons are more efficient for PolygonOps.closestApproach\r\n    this.contextB.visitor.setNumWrap(1);\r\n    if (this.contextA.visitor.moveToReadIndex(indexA) && this.contextB.visitor.moveToReadIndex(indexB)) {\r\n      // ASSUME: not worth sending in maxDist here...\r\n      const pldPair = PolygonOps.closestApproach(this.contextA.visitor.point, this.contextB.visitor.point, undefined, this.searchFacetInterior);\r\n      this.contextA.numFacetTest++;\r\n      if (pldPair && this.searchState.isNewMinOrTrigger(pldPair.detailA.a)) {\r\n        const edgeCountA = this.contextA.visitor.pointCount - 1;\r\n        const edgeCountB = this.contextB.visitor.pointCount - 1;\r\n        const fldPair = FacetLocationDetailPair.create(\r\n          this.contextA.convexFacets ? ConvexFacetLocationDetail.createCapture(indexA, edgeCountA, pldPair.detailA) : NonConvexFacetLocationDetail.createCapture(indexA, edgeCountA, pldPair.detailA),\r\n          this.contextB.convexFacets ? ConvexFacetLocationDetail.createCapture(indexB, edgeCountB, pldPair.detailB) : NonConvexFacetLocationDetail.createCapture(indexB, edgeCountB, pldPair.detailB),\r\n        );\r\n        this.searchState.testAndSave(fldPair, fldPair.detailA.a);\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n"]}

package/lib/cjs/polyface/multiclip/BuildAverageNormalsContext.d.ts

@@ -1,8 +1,8 @@
 /** @packageDocumentation
  * @module Polyface
  */
-import { IndexedPolyface } from "../Polyface";
 import { Angle } from "../../geometry3d/Angle";
+import { IndexedPolyface } from "../Polyface";
 /**
  * Helper context for normal averaging.
  * All methods are static.

package/lib/cjs/polyface/multiclip/BuildAverageNormalsContext.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BuildAverageNormalsContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/BuildAverageNormalsContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAG9C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AA8C/C;;;;GAIG;AAEH,qBAAa,0BAA0B;IACrC;;;;;;;;;OASG;WACW,uBAAuB,CAAC,QAAQ,EAAE,eAAe,EAAE,cAAc,EAAE,KAAK;IAkFtF;;;OAGG;WACW,mBAAmB,CAAC,QAAQ,EAAE,eAAe;CAmB5D"}
+{"version":3,"file":"BuildAverageNormalsContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/BuildAverageNormalsContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAI/C,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAgD9C;;;;GAIG;AAEH,qBAAa,0BAA0B;IACrC;;;;;;;;;OASG;WACW,uBAAuB,CAAC,QAAQ,EAAE,eAAe,EAAE,cAAc,EAAE,KAAK;IAiFtF;;;OAGG;WACW,mBAAmB,CAAC,QAAQ,EAAE,eAAe;CAmB5D"}

package/lib/cjs/polyface/multiclip/BuildAverageNormalsContext.js

@@ -8,10 +8,11 @@
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.BuildAverageNormalsContext = void 0;
-const Point3dVector3d_1 = require("../../geometry3d/Point3dVector3d");
-const PolygonOps_1 = require("../../geometry3d/PolygonOps");
+const core_bentley_1 = require("@itwin/core-bentley");
 const Geometry_1 = require("../../Geometry");
 const GrowableXYZArray_1 = require("../../geometry3d/GrowableXYZArray");
+const Point3dVector3d_1 = require("../../geometry3d/Point3dVector3d");
+const PolygonOps_1 = require("../../geometry3d/PolygonOps");
 /**
  * Normal vector with area (or other numeric) and source index
  * @internal
@@ -30,7 +31,9 @@ class IndexedAreaAndNormal {
         this.normal.addScaledInPlace(normal, weight);
     }
     divideNormalByArea() {
-        this.normal.scaleInPlace(1.0 / this.area);
+        (0, core_bentley_1.assert)(this.area > 0);
+        if (this.area > 0)
+            this.normal.scaleInPlace(1.0 / this.area);
     }
 }
 /**
@@ -121,7 +124,6 @@ class BuildAverageNormalsContext {
                 const clusterNormal = new IndexedAreaAndNormal(clusterIndex++, 0.0, Point3dVector3d_1.Vector3d.createZero());
                 clusters.push(clusterNormal);
                 // Accumulate with equal weights . . .
-                clusterNormal.addWeightedNormal(1.0, baseData.facetData.normal);
                 for (let candidateSectorIndex = baseSectorIndex; candidateSectorIndex < sectors.length; candidateSectorIndex++) {
                     const candidateSector = sectors[candidateSectorIndex];
                     if (candidateSector.vertexIndex !== vertexIndex)
@@ -129,7 +131,7 @@ class BuildAverageNormalsContext {
                     if (candidateSector.facetData.normal.angleTo(baseFacetData.normal).radians > toleranceRadians)
                         continue;
                     if (candidateSector.sectorClusterData === undefined) {
-                        clusterNormal.addWeightedNormal(1.0, candidateSector.facetData.normal);
+                        clusterNormal.addWeightedNormal(1.0, candidateSector.facetData.normal); // first time thru this is base sector normal
                         candidateSector.sectorClusterData = clusterNormal;
                     }
                 }
@@ -147,7 +149,9 @@ class BuildAverageNormalsContext {
         }
         // emplace the indices
         for (const sector of sectors) {
-            polyface.data.normalIndex.push(sector.sectorClusterData.index);
+            (0, core_bentley_1.assert)(sector.sectorClusterData !== undefined, "previous sectors loop should have pointed each sector to a cluster");
+            if (sector.sectorClusterData)
+                polyface.data.normalIndex.push(sector.sectorClusterData.index);
         }
     }
     /**