npm - @itwin/core-geometry - Versions diffs - 5.2.0-dev.29 → 5.2.0-dev.30 - Mend

@itwin/core-geometry 5.2.0-dev.29 → 5.2.0-dev.30

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

Files changed (737) hide show

package/lib/cjs/polyface/RangeLengthData.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"RangeLengthData.js","sourceRoot":"","sources":["../../../src/polyface/RangeLengthData.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,+CAA8C;AAC9C,qDAAkD;AAElD;;;;;;;;;;;GAWG;AACH,MAAa,eAAe;IAC1B,kEAAkE;IAC3D,KAAK,CAAU;IACtB,MAAM;IACC,KAAK,CAAY;IACjB,KAAK,CAAY;IACjB,KAAK,CAAY;IACxB;QACE,IAAI,CAAC,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,qBAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,qBAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,qBAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;IACzC,CAAC;IACO,UAAU,CAAU;IAC5B,2EAA2E;IACpE,+BAA+B,CAAC,MAAwB;QAC7D,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;IACnD,CAAC;CACF;AAvBD,0CAuBC","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n/** @packageDocumentation\n * @module RangeSearch\n /\n\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { UsageSums } from \"../numerics/UsageSums\";\n\n/\n Accumulated data for x,y,z length statistics in ranges.\n * * Usage pattern:\n * * create a enw RangeLengthData:\n * * `myData = new RangeLengthData ();`\n * * announce ranges to be accumulated:\n * * (many times) `myData.accumulateRowableXYZArrayRange (points);\n * * access data in public members:\n * * `myData.range` -- the composite range.\n * * `myData.xLength`, `myData.yLength`, `myData.zLength` -- mean, minMax, count, and standardDeviation of range lengths in x,y,z directions.\n * @public\n /\nexport class RangeLengthData {\n /* Overall range of all data observed by `accumulate` methods. /\n public range: Range3d;\n /* /\n public xSums: UsageSums;\n public ySums: UsageSums;\n public zSums: UsageSums;\n public constructor() {\n this.range = Range3d.createNull();\n this.xSums = new UsageSums();\n this.ySums = new UsageSums();\n this.zSums = new UsageSums();\n this._workRange = Range3d.createNull();\n }\n private _workRange: Range3d;\n /* Extend the range and length sums by the range of points in an array. */\n public accumulateGrowableXYZArrayRange(points: GrowableXYZArray) {\n points.setRange(this._workRange);\n this.range.extendRange(this._workRange);\n this.xSums.accumulate(this._workRange.xLength());\n this.ySums.accumulate(this._workRange.yLength());\n this.zSums.accumulate(this._workRange.zLength());\n }\n}\n"]}
1	+ {"version":3,"file":"RangeLengthData.js","sourceRoot":"","sources":["../../../src/polyface/RangeLengthData.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,+CAA8C;AAC9C,qDAAkD;AAElD;;;;;;;;;;;GAWG;AACH,MAAa,eAAe;IAC1B,kEAAkE;IAC3D,KAAK,CAAU;IACtB,MAAM;IACC,KAAK,CAAY;IACjB,KAAK,CAAY;IACjB,KAAK,CAAY;IACxB;QACE,IAAI,CAAC,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,qBAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,qBAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,qBAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;IACzC,CAAC;IACO,UAAU,CAAU;IAC5B,2EAA2E;IACpE,+BAA+B,CAAC,MAAwB;QAC7D,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;IACnD,CAAC;CACF;AAvBD,0CAuBC","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 { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { UsageSums } from \"../numerics/UsageSums\";\r\n\r\n/\r\n Accumulated data for x,y,z length statistics in ranges.\r\n * * Usage pattern:\r\n * * create a enw RangeLengthData:\r\n * * `myData = new RangeLengthData ();`\r\n * * announce ranges to be accumulated:\r\n * * (many times) `myData.accumulateRowableXYZArrayRange (points);\r\n * * access data in public members:\r\n * * `myData.range` -- the composite range.\r\n * * `myData.xLength`, `myData.yLength`, `myData.zLength` -- mean, minMax, count, and standardDeviation of range lengths in x,y,z directions.\r\n * @public\r\n /\r\nexport class RangeLengthData {\r\n /* Overall range of all data observed by `accumulate` methods. /\r\n public range: Range3d;\r\n /* /\r\n public xSums: UsageSums;\r\n public ySums: UsageSums;\r\n public zSums: UsageSums;\r\n public constructor() {\r\n this.range = Range3d.createNull();\r\n this.xSums = new UsageSums();\r\n this.ySums = new UsageSums();\r\n this.zSums = new UsageSums();\r\n this._workRange = Range3d.createNull();\r\n }\r\n private _workRange: Range3d;\r\n /* Extend the range and length sums by the range of points in an array. */\r\n public accumulateGrowableXYZArrayRange(points: GrowableXYZArray) {\r\n points.setRange(this._workRange);\r\n this.range.extendRange(this._workRange);\r\n this.xSums.accumulate(this._workRange.xLength());\r\n this.ySums.accumulate(this._workRange.yLength());\r\n this.zSums.accumulate(this._workRange.zLength());\r\n }\r\n}\r\n"]}

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

	@@ -1 +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":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n/** @packageDocumentation\n * @module RangeSearch\n /\n\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../../curve/CurveLocationDetail\";\nimport { LineString3d } from \"../../curve/LineString3d\";\nimport { Geometry } from \"../../Geometry\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { RangeTreeNode, RangeTreeOps } from \"./RangeTreeNode\";\nimport {\n SingleTreeSearchHandlerForClosestPointOnLineString3d, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach,\n} from \"./RangeTreeSearchHandlers\";\n\n/\n Handler class for searching a range tree containing the segments of a linestring.\n * * Facilitates multiple searches for closest point and close approach calculations.\n * @public\n /\nexport class LineString3dRangeTreeContext {\n /* Polyline points being searched, indexed by the range tree /\n public lineString: LineString3d;\n\n /* Diagnostic: number of range tests that have returned true /\n public numRangeTestTrue: number;\n /* Diagnostic: number of range tests that have returned false /\n public numRangeTestFalse: number;\n /* Diagnostic: number of points tested /\n public numPointTest: number;\n /* Diagnostic: number of searches. /\n public numSearch: number;\n\n /* Range tree, whose appData are indices into the linestring points array /\n private _rangeTreeRoot: RangeTreeNode<number>;\n\n /* Constructor: capture inputs, initialize debug counters /\n private constructor(rangeTreeRoot: RangeTreeNode<number>, points: LineString3d) {\n this.lineString = points;\n this._rangeTreeRoot = rangeTreeRoot;\n this.numRangeTestTrue = 0;\n this.numRangeTestFalse = 0;\n this.numPointTest = 0;\n this.numSearch = 0;\n }\n /\n Create a range tree context for the polyline points:\n * * initialize with segment ranges\n * * appData are segment indices\n * @param linestring captured if LineString3d, otherwise copied\n * @param maxChildPerNode maximum children per range tree node (default 4)\n * @param maxAppDataPerLeaf maximum segment indices per leaf node (default 4)\n /\n public static createCapture(points: Point3d[] \| LineString3d, maxChildPerNode: number = 4, maxAppDataPerLeaf: number = 4): LineString3dRangeTreeContext \| undefined {\n const linestring = points instanceof LineString3d ? points : LineString3d.createPoints(points);\n const rangeTreeRoot = RangeTreeOps.createByIndexSplits<number>(\n ((index: number): Range3d => { return Range3d.create(linestring.pointAt(index)!, linestring.pointAt(index + 1)!); }),\n ((index: number): number => { return index; }),\n linestring.numPoints() - 1, // number of segments\n maxChildPerNode,\n maxAppDataPerLeaf,\n );\n return rangeTreeRoot ? new LineString3dRangeTreeContext(rangeTreeRoot, linestring) : undefined;\n }\n /\n Search the range tree for closest point(s) to spacePoint.\n * @param spacePoint point to test\n * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.\n * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point\n /\n public searchForClosestPoint(spacePoint: Point3d, maxDist?: number): CurveLocationDetail \| CurveLocationDetail[] \| undefined {\n const handler = new SingleTreeSearchHandlerForClosestPointOnLineString3d(spacePoint, this, maxDist);\n this.numSearch++;\n // seed the search with a few segments -- this reduces early trips deep into ranges that are far from spacePoint.\n const numTest = Geometry.clamp(Math.floor(this.lineString.numPoints() / 20), 2, 7);\n const testStep = Math.floor(this.lineString.numPoints() / numTest);\n handler.processAppData(0);\n handler.processAppData(this.lineString.numPoints() - 2);\n for (let i = testStep; i + 1 < this.lineString.numPoints(); i += testStep)\n handler.processAppData(i);\n this._rangeTreeRoot.searchTopDown(handler);\n return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n }\n /\n Search the range trees for closest approach(es) between the polylines.\n * @param contextA first polyline context\n * @param contextB second polyline context\n * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.\n * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance\n */\n public static searchForClosestApproach(contextA: LineString3dRangeTreeContext, contextB: LineString3dRangeTreeContext, maxDist?: number): CurveLocationDetailPair \| CurveLocationDetailPair[] \| undefined {\n const handler = new TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach(contextA, contextB, maxDist);\n RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);\n return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n }\n}\n"]}
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"]}

package/lib/cjs/polyface/RangeTree/MinimumValueTester.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"MinimumValueTester.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/MinimumValueTester.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;;;;;GAMG;AACH,MAAa,kBAAkB;IACtB,cAAc,CAAgB;IAC9B,QAAQ,CAAqB;IAC7B,uBAAuB,CAAqB;IAC5C,UAAU,GAAQ,EAAE,CAAC;IACrB,WAAW,GAAa,EAAE,CAAC;IAClC;;OAEG;IACH,YAAoB,wBAAiC;QACnD,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAChD,IAAI,CAAC,iCAAiC,CAAC,wBAAwB,EAAE,KAAK,CAAC,CAAC;IAC1E,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAI,wBAAiC;QACvD,OAAO,IAAI,kBAAkB,CAAI,wBAAwB,CAAC,CAAC;IAC7D,CAAC;IACD;;;;;OAKG;IACI,oBAAoB,CAAC,OAAsB,SAAS,EAAE,QAA4B,SAAS;QAChG,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACxB,CAAC;IACD;;;;OAIG;IACI,iCAAiC,CAAC,KAAyB,EAAE,qBAA8B,KAAK;QACrG,IAAI,CAAC,uBAAuB,GAAG,KAAK,CAAC;QACrC,IAAI,kBAAkB,EAAE,CAAC;YACvB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACxB,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,WAAW,CAAC,IAAO,EAAE,KAAa;QACvC,IAAI,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;YACtB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;YAC3B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,4EAA4E;IACrE,gBAAgB,CAAC,KAAa;QACnC,OAAO,IAAI,CAAC,uBAAuB,KAAK,SAAS,IAAI,KAAK,IAAI,IAAI,CAAC,uBAAuB,CAAC;IAC7F,CAAC;IACD,+EAA+E;IACxE,aAAa,CAAC,KAAa;QAChC,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC9D,CAAC;IACD,qGAAqG;IAC9F,iBAAiB,CAAC,KAAa;QACpC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC;CACF;AA/ED,gDA+EC","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n/** @packageDocumentation\n * @module CartesianGeometry\n /\n\n/\n Data carrier for use when repeatedly testing items (of parameterized type T) to determine the one with a minimum associated value.\n * * Optionally pushes to arrays of items and values when the value does not exceed a given trigger.\n * * * The item at minimum value is still recorded, even if the minimum value exceeds the trigger value.\n * * When comparing a potential minimum value to an undefined value, the number is always accepted as the new minimum.\n * @internal\n /\nexport class MinimumValueTester<T>{\n public itemAtMinValue: T \| undefined;\n public minValue: number \| undefined;\n public triggerForSavingToArray: number \| undefined;\n public savedItems: T[] = [];\n public savedValues: number[] = [];\n /\n Capture the given item with undefined item and value, and optional maxValueForSavingToArray.\n /\n private constructor(maxValueForSavingToArray?: number) {\n this.resetMinValueAndItem(undefined, undefined);\n this.resetTriggerValueForSavingToArray(maxValueForSavingToArray, false);\n }\n /\n Static method to create a tester.\n * @param maxValueForSavingToArray optional numeric value limiting items to save to the optional array.\n * @returns new tester.\n /\n public static create<T>(maxValueForSavingToArray?: number): MinimumValueTester<T> {\n return new MinimumValueTester<T>(maxValueForSavingToArray);\n }\n /\n Install new minimum value and associated item, both possibly undefined.\n * * The existing arrays of saved items and values, and the trigger value, are unaffected.\n * @param item object to associate with the new minimum value\n * @param value new minimum value\n /\n public resetMinValueAndItem(item: T \| undefined = undefined, value: number \| undefined = undefined) {\n this.itemAtMinValue = item;\n this.minValue = value;\n }\n /\n Set the trigger value.\n * @param value new trigger value\n * @param reinitializeArrays whether to clear the arrays of saved items and values\n /\n public resetTriggerValueForSavingToArray(value: number \| undefined, reinitializeArrays: boolean = false) {\n this.triggerForSavingToArray = value;\n if (reinitializeArrays) {\n this.savedItems = [];\n this.savedValues = [];\n }\n }\n /\n Test a new item with value.\n * * Push the new item and value to the saved arrays if both:\n * * `this.triggerForSavingToArray` is defined\n * * the new value is less than or equal to `this.triggerForSavingToArray`.\n * * Save the new item and value if either:\n * * `this.minValue` is undefined\n * * new value is less than `this.minValue`.\n * @param item item to be saved (captured!) if value conditions are met\n * @param value numeric value being minimized.\n * @returns true if and only if the input value is the new minimum value.\n /\n public testAndSave(item: T, value: number): boolean {\n if (this.doesValueTrigger(value)) {\n this.savedValues.push(value);\n this.savedItems.push(item);\n }\n if (this.isNewMinValue(value)) {\n this.minValue = value;\n this.itemAtMinValue = item;\n return true;\n }\n return false;\n }\n /* Whether the input value is small enough to be saved to this instance. /\n public doesValueTrigger(value: number): boolean {\n return this.triggerForSavingToArray !== undefined && value <= this.triggerForSavingToArray;\n }\n /* Whether the input value is smaller than the last recorded minimum value. /\n public isNewMinValue(value: number): boolean {\n return this.minValue === undefined \|\| value < this.minValue;\n }\n /* Whether the input value is small enough to be the new minimum or to be saved to this instance. */\n public isNewMinOrTrigger(value: number): boolean {\n return this.isNewMinValue(value) \|\| this.doesValueTrigger(value);\n }\n}\n"]}
1	+ {"version":3,"file":"MinimumValueTester.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/MinimumValueTester.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH;;;;;;GAMG;AACH,MAAa,kBAAkB;IACtB,cAAc,CAAgB;IAC9B,QAAQ,CAAqB;IAC7B,uBAAuB,CAAqB;IAC5C,UAAU,GAAQ,EAAE,CAAC;IACrB,WAAW,GAAa,EAAE,CAAC;IAClC;;OAEG;IACH,YAAoB,wBAAiC;QACnD,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAChD,IAAI,CAAC,iCAAiC,CAAC,wBAAwB,EAAE,KAAK,CAAC,CAAC;IAC1E,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAI,wBAAiC;QACvD,OAAO,IAAI,kBAAkB,CAAI,wBAAwB,CAAC,CAAC;IAC7D,CAAC;IACD;;;;;OAKG;IACI,oBAAoB,CAAC,OAAsB,SAAS,EAAE,QAA4B,SAAS;QAChG,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACxB,CAAC;IACD;;;;OAIG;IACI,iCAAiC,CAAC,KAAyB,EAAE,qBAA8B,KAAK;QACrG,IAAI,CAAC,uBAAuB,GAAG,KAAK,CAAC;QACrC,IAAI,kBAAkB,EAAE,CAAC;YACvB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACxB,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,WAAW,CAAC,IAAO,EAAE,KAAa;QACvC,IAAI,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;YACtB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;YAC3B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,4EAA4E;IACrE,gBAAgB,CAAC,KAAa;QACnC,OAAO,IAAI,CAAC,uBAAuB,KAAK,SAAS,IAAI,KAAK,IAAI,IAAI,CAAC,uBAAuB,CAAC;IAC7F,CAAC;IACD,+EAA+E;IACxE,aAAa,CAAC,KAAa;QAChC,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC9D,CAAC;IACD,qGAAqG;IAC9F,iBAAiB,CAAC,KAAa;QACpC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC;CACF;AA/ED,gDA+EC","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 CartesianGeometry\r\n /\r\n\r\n/\r\n Data carrier for use when repeatedly testing items (of parameterized type T) to determine the one with a minimum associated value.\r\n * * Optionally pushes to arrays of items and values when the value does not exceed a given trigger.\r\n * * * The item at minimum value is still recorded, even if the minimum value exceeds the trigger value.\r\n * * When comparing a potential minimum value to an undefined value, the number is always accepted as the new minimum.\r\n * @internal\r\n /\r\nexport class MinimumValueTester<T>{\r\n public itemAtMinValue: T \| undefined;\r\n public minValue: number \| undefined;\r\n public triggerForSavingToArray: number \| undefined;\r\n public savedItems: T[] = [];\r\n public savedValues: number[] = [];\r\n /\r\n Capture the given item with undefined item and value, and optional maxValueForSavingToArray.\r\n /\r\n private constructor(maxValueForSavingToArray?: number) {\r\n this.resetMinValueAndItem(undefined, undefined);\r\n this.resetTriggerValueForSavingToArray(maxValueForSavingToArray, false);\r\n }\r\n /\r\n Static method to create a tester.\r\n * @param maxValueForSavingToArray optional numeric value limiting items to save to the optional array.\r\n * @returns new tester.\r\n /\r\n public static create<T>(maxValueForSavingToArray?: number): MinimumValueTester<T> {\r\n return new MinimumValueTester<T>(maxValueForSavingToArray);\r\n }\r\n /\r\n Install new minimum value and associated item, both possibly undefined.\r\n * * The existing arrays of saved items and values, and the trigger value, are unaffected.\r\n * @param item object to associate with the new minimum value\r\n * @param value new minimum value\r\n /\r\n public resetMinValueAndItem(item: T \| undefined = undefined, value: number \| undefined = undefined) {\r\n this.itemAtMinValue = item;\r\n this.minValue = value;\r\n }\r\n /\r\n Set the trigger value.\r\n * @param value new trigger value\r\n * @param reinitializeArrays whether to clear the arrays of saved items and values\r\n /\r\n public resetTriggerValueForSavingToArray(value: number \| undefined, reinitializeArrays: boolean = false) {\r\n this.triggerForSavingToArray = value;\r\n if (reinitializeArrays) {\r\n this.savedItems = [];\r\n this.savedValues = [];\r\n }\r\n }\r\n /\r\n Test a new item with value.\r\n * * Push the new item and value to the saved arrays if both:\r\n * * `this.triggerForSavingToArray` is defined\r\n * * the new value is less than or equal to `this.triggerForSavingToArray`.\r\n * * Save the new item and value if either:\r\n * * `this.minValue` is undefined\r\n * * new value is less than `this.minValue`.\r\n * @param item item to be saved (captured!) if value conditions are met\r\n * @param value numeric value being minimized.\r\n * @returns true if and only if the input value is the new minimum value.\r\n /\r\n public testAndSave(item: T, value: number): boolean {\r\n if (this.doesValueTrigger(value)) {\r\n this.savedValues.push(value);\r\n this.savedItems.push(item);\r\n }\r\n if (this.isNewMinValue(value)) {\r\n this.minValue = value;\r\n this.itemAtMinValue = item;\r\n return true;\r\n }\r\n return false;\r\n }\r\n /* Whether the input value is small enough to be saved to this instance. /\r\n public doesValueTrigger(value: number): boolean {\r\n return this.triggerForSavingToArray !== undefined && value <= this.triggerForSavingToArray;\r\n }\r\n /* Whether the input value is smaller than the last recorded minimum value. /\r\n public isNewMinValue(value: number): boolean {\r\n return this.minValue === undefined \|\| value < this.minValue;\r\n }\r\n /* Whether the input value is small enough to be the new minimum or to be saved to this instance. */\r\n public isNewMinOrTrigger(value: number): boolean {\r\n return this.isNewMinValue(value) \|\| this.doesValueTrigger(value);\r\n }\r\n}\r\n"]}

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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