@itwin/core-geometry 4.6.0-dev.21 → 4.6.0-dev.23

package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSet.js.map

@@ -1 +1 @@
-{"version":3,"file":"GriddedRaggedRange2dSet.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSet.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAW,MAAM,wBAAwB,CAAC;AAE1D,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAStE;;;;;;;;GAQG;AACH,MAAM,OAAO,uBAAuB;IAOlC,YAAoB,KAAc,EAAE,QAAgB,EAAE,QAAgB;QACpE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,OAAO,GAA6C,EAAE,CAAC;YAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;gBACvC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;aACzB;YACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SACnC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAI,KAAc,EAAE,QAAgB,EAAE,QAAgB;QACxE,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,aAAa;YACrE,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,uBAAuB,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACxE,CAAC;IACO,MAAM,CAAC,CAAS;QACtB,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpF,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/C,CAAC;IACO,MAAM,CAAC,CAAS;QACtB,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpF,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/C,CAAC;IACO,QAAQ,CAAC,CAAS,EAAE,CAAS;QACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE;YAChE,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,wBAAwB,EAAE,CAAC;YAC7D,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,iBAAiB,CAAC,KAAuC,EAAE,GAAM;QACtE,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,IAAI,OAAO,GAAG,CAAC,KAAK,OAAO,CAAC;YACnD,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,IAAI,OAAO,GAAG,CAAC,KAAK,OAAO,CAAC;YACnD,OAAO,KAAK,CAAC;QACf,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtD,IAAI,aAAa,EAAE;YACjB,aAAa,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACnC,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qCAAqC;IAC9B,QAAQ,CAAC,KAAmB,EAAE,GAAM;QACzC,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACrC,CAAC;IACD;;;;;;;OAOG;IACK,sBAAsB,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,OAA4C;QACrH,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,aAAa;YAChB,OAAO,IAAI,CAAC;QACd,OAAO,aAAa,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC/C,CAAC;IACD;;;;;;;OAOG;IACK,2BAA2B,CAAC,CAAS,EAAE,CAAS,EAAE,SAAuB,EAAE,OAA4C;QAC7H,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,aAAa;YAChB,OAAO,IAAI,CAAC;QACd,OAAO,aAAa,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,OAA4C;QAChF,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;eAClD,IAAI,CAAC,sBAAsB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;eACpD,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;eACpD,IAAI,CAAC,sBAAsB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAChE,CAAC;IACD;;;;;;;OAOG;IACI,aAAa,CAAC,SAAuB,EAAE,OAA4C;QACxF,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE;YACvC,KAAK,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE;gBACvC,IAAI,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC;oBAC7D,OAAO,KAAK,CAAC;aAChB;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+CAA+C;IACxC,UAAU,CAAC,MAAgB;QAChC,IAAI,MAAM;YACR,MAAM,CAAC,OAAO,EAAE,CAAC;;YAEjB,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAChC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACtC,MAAM,UAAU,GAAG,uBAAuB,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;YAC7G,MAAO,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0DAA0D;IACnD,aAAa,CAAC,YAAoB,EAAE,OAAkE;QAC3G,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,cAAc,EAAE;YACrC,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE;gBACvB,IAAI,KAAK;oBACP,OAAO,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;aAChC;SACF;IACH,CAAC;CACF","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 { Range2d, Range3d } from \"../../geometry3d/Range\";\r\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\r\nimport { LinearSearchRange2dArray } from \"./LinearSearchRange2dArray\";\r\nimport { Range2dSearchInterface } from \"./Range2dSearchInterface\";\r\n\r\n/**\r\n * Type abbreviation to allow undefined as a Range2dSearchInterface parameter.\r\n * @internal\r\n */\r\nexport type OptionalRange2dSearchInterface<T> = Range2dSearchInterface<T> | undefined;\r\n\r\n/**\r\n * A GriddedRaggedRange2dSet is:\r\n * * A doubly dimensioned array of Range2dSearchInterface.\r\n * * Each entry represents a block in a uniform grid within the master range.\r\n * * Member ranges are noted in the grid block containing the range's lower left corner.\r\n * * Member ranges larger than twice the grid size are rejected by the insert method.\r\n * * Hence a search involving a point in grid block (i,j) must examine ranges in grid blocks left and below, i.e. (i-1,j-1), (i-1,j), (i,j-1)\r\n * @public\r\n */\r\nexport class GriddedRaggedRange2dSet<T> implements Range2dSearchInterface<T> {\r\n  private _range: Range2d;\r\n  private _numXEdge: number;\r\n  private _numYEdge: number;\r\n  /** Each grid block is a simple linear search set */\r\n  private _rangesInBlock: Array<Array<OptionalRange2dSearchInterface<T>>>;\r\n  private static _workRange?: Range2d;\r\n  private constructor(range: Range2d, numXEdge: number, numYEdge: number) {\r\n    this._range = range;\r\n    this._numXEdge = numXEdge;\r\n    this._numYEdge = numYEdge;\r\n    this._rangesInBlock = [];\r\n    for (let j = 0; j < this._numYEdge; j++) {\r\n      const thisRow: Array<OptionalRange2dSearchInterface<T>> = [];\r\n      for (let i = 0; i < this._numXEdge; i++) {\r\n        thisRow.push(undefined);\r\n      }\r\n      this._rangesInBlock.push(thisRow);\r\n    }\r\n  }\r\n  /**\r\n   * Create an (empty) set of ranges.\r\n   * @param range master range\r\n   * @param numXEdge size of grid in x direction\r\n   * @param numYEdge size of grid in y direction\r\n   */\r\n  public static create<T>(range: Range2d, numXEdge: number, numYEdge: number): GriddedRaggedRange2dSet<T> | undefined {\r\n    if (numXEdge < 1 || numYEdge < 1 || range.isNull || range.isSinglePoint)\r\n      return undefined;\r\n    return new GriddedRaggedRange2dSet(range.clone(), numXEdge, numYEdge);\r\n  }\r\n  private xIndex(x: number): number {\r\n    const fraction = (x - this._range.low.x) / (this._range.high.x - this._range.low.x);\r\n    return Math.floor(fraction * this._numXEdge);\r\n  }\r\n  private yIndex(y: number): number {\r\n    const fraction = (y - this._range.low.y) / (this._range.high.y - this._range.low.y);\r\n    return Math.floor(fraction * this._numXEdge);\r\n  }\r\n  private getBlock(i: number, j: number): OptionalRange2dSearchInterface<T> {\r\n    if (i >= 0 && i < this._numXEdge && j >= 0 && j < this._numYEdge) {\r\n      if (!this._rangesInBlock[j][i])\r\n        this._rangesInBlock[j][i] = new LinearSearchRange2dArray();\r\n      return this._rangesInBlock[j][i];\r\n    }\r\n    return undefined;\r\n  }\r\n  /** If possible, insert a range into the set.\r\n   * * Decline to insert (and return false) if:\r\n   *    * range is null\r\n   *    * range is not completely contained in the overall range of this set\r\n   *    * range x or y extent is larger than 2 grid blocks\r\n   */\r\n  public conditionalInsert(range: Range2d | Range3d | LowAndHighXY, tag: T): boolean {\r\n    if (Range2d.isNull(range))\r\n      return false;\r\n    if (!this._range.containsRange(range))\r\n      return false;\r\n    const xIndex0 = this.xIndex(range.low.x);\r\n    const xIndex1 = this.xIndex(range.high.x);\r\n    const yIndex0 = this.yIndex(range.low.y);\r\n    const yIndex1 = this.yIndex(range.high.y);\r\n    if (!(xIndex0 === xIndex1 || xIndex0 + 1 === xIndex1))\r\n      return false;\r\n    if (!(yIndex0 === yIndex1 || yIndex0 + 1 === yIndex1))\r\n      return false;\r\n    const rangesInBlock = this.getBlock(xIndex0, yIndex0);\r\n    if (rangesInBlock) {\r\n      rangesInBlock.addRange(range, tag);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Add a range to the search set. */\r\n  public addRange(range: LowAndHighXY, tag: T): void {\r\n    this.conditionalInsert(range, tag);\r\n  }\r\n  /**\r\n   * * Search a single block\r\n   * * Pass each range and tag to handler\r\n   * * and return false if bad cell or if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  private searchXYInIndexedBlock(i: number, j: number, x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    const rangesInBlock = this.getBlock(i, j);\r\n    if (!rangesInBlock)\r\n      return true;\r\n    return rangesInBlock.searchXY(x, y, handler);\r\n  }\r\n  /**\r\n   * * Search a single block\r\n   * * Pass each range and tag to handler\r\n   * * and return false if bad cell or if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  private searchRange2dInIndexedBlock(i: number, j: number, testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    const rangesInBlock = this.getBlock(i, j);\r\n    if (!rangesInBlock)\r\n      return true;\r\n    return rangesInBlock.searchRange2d(testRange, handler);\r\n  }\r\n  /**\r\n   * * Search for ranges containing testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    const i = this.xIndex(x);\r\n    const j = this.yIndex(y);\r\n    return this.searchXYInIndexedBlock(i, j, x, y, handler)\r\n      && this.searchXYInIndexedBlock(i - 1, j, x, y, handler)\r\n      && this.searchXYInIndexedBlock(i, j - 1, x, y, handler)\r\n      && this.searchXYInIndexedBlock(i - 1, j - 1, x, y, handler);\r\n  }\r\n  /**\r\n   * * Search for ranges overlapping testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    const xIndex0 = this.xIndex(testRange.low.x) - 1;\r\n    const xIndex1 = this.xIndex(testRange.high.x);\r\n    const yIndex0 = this.yIndex(testRange.low.y) - 1;\r\n    const yIndex1 = this.yIndex(testRange.high.y);\r\n    for (let i = xIndex0; i <= xIndex1; i++) {\r\n      for (let j = yIndex0; j <= yIndex1; j++) {\r\n        if (!this.searchRange2dInIndexedBlock(i, j, testRange, handler))\r\n          return false;\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n  /** Return the overall range of all members. */\r\n  public totalRange(result?: Range2d): Range2d {\r\n    if (result)\r\n      result.setNull();\r\n    else\r\n      result = Range2d.createNull();\r\n    this.visitChildren(0, (_depth, child) => {\r\n      const childRange = GriddedRaggedRange2dSet._workRange = child.totalRange(GriddedRaggedRange2dSet._workRange);\r\n      result!.extendRange(childRange);\r\n    });\r\n    return result;\r\n  }\r\n  /** Call the handler on each defined block in the grid. */\r\n  public visitChildren(initialDepth: number, handler: (depth: number, child: Range2dSearchInterface<T>) => void) {\r\n    for (const row of this._rangesInBlock) {\r\n      for (const block of row) {\r\n        if (block)\r\n          handler(initialDepth, block);\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"GriddedRaggedRange2dSet.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSet.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAW,MAAM,wBAAwB,CAAC;AAE1D,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAStE;;;;;;;;GAQG;AACH,MAAM,OAAO,uBAAuB;IAOlC,YAAoB,KAAc,EAAE,QAAgB,EAAE,QAAgB;QACpE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,OAAO,GAA6C,EAAE,CAAC;YAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC1B,CAAC;YACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAI,KAAc,EAAE,QAAgB,EAAE,QAAgB;QACxE,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,aAAa;YACrE,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,uBAAuB,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACxE,CAAC;IACO,MAAM,CAAC,CAAS;QACtB,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpF,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/C,CAAC;IACO,MAAM,CAAC,CAAS;QACtB,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpF,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/C,CAAC;IACO,QAAQ,CAAC,CAAS,EAAE,CAAS;QACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACjE,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,wBAAwB,EAAE,CAAC;YAC7D,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,iBAAiB,CAAC,KAAuC,EAAE,GAAM;QACtE,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,IAAI,OAAO,GAAG,CAAC,KAAK,OAAO,CAAC;YACnD,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,IAAI,OAAO,GAAG,CAAC,KAAK,OAAO,CAAC;YACnD,OAAO,KAAK,CAAC;QACf,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtD,IAAI,aAAa,EAAE,CAAC;YAClB,aAAa,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACnC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qCAAqC;IAC9B,QAAQ,CAAC,KAAmB,EAAE,GAAM;QACzC,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACrC,CAAC;IACD;;;;;;;OAOG;IACK,sBAAsB,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,OAA4C;QACrH,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,aAAa;YAChB,OAAO,IAAI,CAAC;QACd,OAAO,aAAa,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC/C,CAAC;IACD;;;;;;;OAOG;IACK,2BAA2B,CAAC,CAAS,EAAE,CAAS,EAAE,SAAuB,EAAE,OAA4C;QAC7H,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,aAAa;YAChB,OAAO,IAAI,CAAC;QACd,OAAO,aAAa,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,OAA4C;QAChF,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;eAClD,IAAI,CAAC,sBAAsB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;eACpD,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;eACpD,IAAI,CAAC,sBAAsB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAChE,CAAC;IACD;;;;;;;OAOG;IACI,aAAa,CAAC,SAAuB,EAAE,OAA4C;QACxF,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,IAAI,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC;oBAC7D,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+CAA+C;IACxC,UAAU,CAAC,MAAgB;QAChC,IAAI,MAAM;YACR,MAAM,CAAC,OAAO,EAAE,CAAC;;YAEjB,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAChC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACtC,MAAM,UAAU,GAAG,uBAAuB,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;YAC7G,MAAO,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0DAA0D;IACnD,aAAa,CAAC,YAAoB,EAAE,OAAkE;QAC3G,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACtC,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;gBACxB,IAAI,KAAK;oBACP,OAAO,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;CACF","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 { Range2d, Range3d } from \"../../geometry3d/Range\";\r\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\r\nimport { LinearSearchRange2dArray } from \"./LinearSearchRange2dArray\";\r\nimport { Range2dSearchInterface } from \"./Range2dSearchInterface\";\r\n\r\n/**\r\n * Type abbreviation to allow undefined as a Range2dSearchInterface parameter.\r\n * @internal\r\n */\r\nexport type OptionalRange2dSearchInterface<T> = Range2dSearchInterface<T> | undefined;\r\n\r\n/**\r\n * A GriddedRaggedRange2dSet is:\r\n * * A doubly dimensioned array of Range2dSearchInterface.\r\n * * Each entry represents a block in a uniform grid within the master range.\r\n * * Member ranges are noted in the grid block containing the range's lower left corner.\r\n * * Member ranges larger than twice the grid size are rejected by the insert method.\r\n * * Hence a search involving a point in grid block (i,j) must examine ranges in grid blocks left and below, i.e. (i-1,j-1), (i-1,j), (i,j-1)\r\n * @public\r\n */\r\nexport class GriddedRaggedRange2dSet<T> implements Range2dSearchInterface<T> {\r\n  private _range: Range2d;\r\n  private _numXEdge: number;\r\n  private _numYEdge: number;\r\n  /** Each grid block is a simple linear search set */\r\n  private _rangesInBlock: Array<Array<OptionalRange2dSearchInterface<T>>>;\r\n  private static _workRange?: Range2d;\r\n  private constructor(range: Range2d, numXEdge: number, numYEdge: number) {\r\n    this._range = range;\r\n    this._numXEdge = numXEdge;\r\n    this._numYEdge = numYEdge;\r\n    this._rangesInBlock = [];\r\n    for (let j = 0; j < this._numYEdge; j++) {\r\n      const thisRow: Array<OptionalRange2dSearchInterface<T>> = [];\r\n      for (let i = 0; i < this._numXEdge; i++) {\r\n        thisRow.push(undefined);\r\n      }\r\n      this._rangesInBlock.push(thisRow);\r\n    }\r\n  }\r\n  /**\r\n   * Create an (empty) set of ranges.\r\n   * @param range master range\r\n   * @param numXEdge size of grid in x direction\r\n   * @param numYEdge size of grid in y direction\r\n   */\r\n  public static create<T>(range: Range2d, numXEdge: number, numYEdge: number): GriddedRaggedRange2dSet<T> | undefined {\r\n    if (numXEdge < 1 || numYEdge < 1 || range.isNull || range.isSinglePoint)\r\n      return undefined;\r\n    return new GriddedRaggedRange2dSet(range.clone(), numXEdge, numYEdge);\r\n  }\r\n  private xIndex(x: number): number {\r\n    const fraction = (x - this._range.low.x) / (this._range.high.x - this._range.low.x);\r\n    return Math.floor(fraction * this._numXEdge);\r\n  }\r\n  private yIndex(y: number): number {\r\n    const fraction = (y - this._range.low.y) / (this._range.high.y - this._range.low.y);\r\n    return Math.floor(fraction * this._numXEdge);\r\n  }\r\n  private getBlock(i: number, j: number): OptionalRange2dSearchInterface<T> {\r\n    if (i >= 0 && i < this._numXEdge && j >= 0 && j < this._numYEdge) {\r\n      if (!this._rangesInBlock[j][i])\r\n        this._rangesInBlock[j][i] = new LinearSearchRange2dArray();\r\n      return this._rangesInBlock[j][i];\r\n    }\r\n    return undefined;\r\n  }\r\n  /** If possible, insert a range into the set.\r\n   * * Decline to insert (and return false) if:\r\n   *    * range is null\r\n   *    * range is not completely contained in the overall range of this set\r\n   *    * range x or y extent is larger than 2 grid blocks\r\n   */\r\n  public conditionalInsert(range: Range2d | Range3d | LowAndHighXY, tag: T): boolean {\r\n    if (Range2d.isNull(range))\r\n      return false;\r\n    if (!this._range.containsRange(range))\r\n      return false;\r\n    const xIndex0 = this.xIndex(range.low.x);\r\n    const xIndex1 = this.xIndex(range.high.x);\r\n    const yIndex0 = this.yIndex(range.low.y);\r\n    const yIndex1 = this.yIndex(range.high.y);\r\n    if (!(xIndex0 === xIndex1 || xIndex0 + 1 === xIndex1))\r\n      return false;\r\n    if (!(yIndex0 === yIndex1 || yIndex0 + 1 === yIndex1))\r\n      return false;\r\n    const rangesInBlock = this.getBlock(xIndex0, yIndex0);\r\n    if (rangesInBlock) {\r\n      rangesInBlock.addRange(range, tag);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Add a range to the search set. */\r\n  public addRange(range: LowAndHighXY, tag: T): void {\r\n    this.conditionalInsert(range, tag);\r\n  }\r\n  /**\r\n   * * Search a single block\r\n   * * Pass each range and tag to handler\r\n   * * and return false if bad cell or if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  private searchXYInIndexedBlock(i: number, j: number, x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    const rangesInBlock = this.getBlock(i, j);\r\n    if (!rangesInBlock)\r\n      return true;\r\n    return rangesInBlock.searchXY(x, y, handler);\r\n  }\r\n  /**\r\n   * * Search a single block\r\n   * * Pass each range and tag to handler\r\n   * * and return false if bad cell or if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  private searchRange2dInIndexedBlock(i: number, j: number, testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    const rangesInBlock = this.getBlock(i, j);\r\n    if (!rangesInBlock)\r\n      return true;\r\n    return rangesInBlock.searchRange2d(testRange, handler);\r\n  }\r\n  /**\r\n   * * Search for ranges containing testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    const i = this.xIndex(x);\r\n    const j = this.yIndex(y);\r\n    return this.searchXYInIndexedBlock(i, j, x, y, handler)\r\n      && this.searchXYInIndexedBlock(i - 1, j, x, y, handler)\r\n      && this.searchXYInIndexedBlock(i, j - 1, x, y, handler)\r\n      && this.searchXYInIndexedBlock(i - 1, j - 1, x, y, handler);\r\n  }\r\n  /**\r\n   * * Search for ranges overlapping testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    const xIndex0 = this.xIndex(testRange.low.x) - 1;\r\n    const xIndex1 = this.xIndex(testRange.high.x);\r\n    const yIndex0 = this.yIndex(testRange.low.y) - 1;\r\n    const yIndex1 = this.yIndex(testRange.high.y);\r\n    for (let i = xIndex0; i <= xIndex1; i++) {\r\n      for (let j = yIndex0; j <= yIndex1; j++) {\r\n        if (!this.searchRange2dInIndexedBlock(i, j, testRange, handler))\r\n          return false;\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n  /** Return the overall range of all members. */\r\n  public totalRange(result?: Range2d): Range2d {\r\n    if (result)\r\n      result.setNull();\r\n    else\r\n      result = Range2d.createNull();\r\n    this.visitChildren(0, (_depth, child) => {\r\n      const childRange = GriddedRaggedRange2dSet._workRange = child.totalRange(GriddedRaggedRange2dSet._workRange);\r\n      result!.extendRange(childRange);\r\n    });\r\n    return result;\r\n  }\r\n  /** Call the handler on each defined block in the grid. */\r\n  public visitChildren(initialDepth: number, handler: (depth: number, child: Range2dSearchInterface<T>) => void) {\r\n    for (const row of this._rangesInBlock) {\r\n      for (const block of row) {\r\n        if (block)\r\n          handler(initialDepth, block);\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.js.map

@@ -1 +1 @@
-{"version":3,"file":"GriddedRaggedRange2dSetWithOverflow.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAEjD,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AACpE,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAGtE;;;;;;;GAOG;AACH,MAAM,OAAO,mCAAmC;IAI9C,YAAoB,OAAmC,EAAE,WAAsC;QAC7F,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAI,KAAc,EAAE,QAAgB,EAAE,QAAgB;QACxE,MAAM,KAAK,GAAG,uBAAuB,CAAC,MAAM,CAAI,KAAK,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,KAAK;YACP,OAAO,IAAI,mCAAmC,CAAI,KAAK,EAAE,IAAI,wBAAwB,EAAK,CAAC,CAAC;QAC9F,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,OAA4C;QAChF,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC5F,CAAC;IACD;;;;;;;OAOG;IACI,aAAa,CAAC,SAAuB,EAAE,OAA4C;QACxF,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAChH,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAmB,EAAE,GAAM;QACzC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;YAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;gBAC9C,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;SAC1C;IACH,CAAC;IACD,+CAA+C;IACxC,UAAU,CAAC,MAAgB;QAChC,IAAI,MAAM;YACR,MAAM,CAAC,OAAO,EAAE,CAAC;;YAEjB,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAChC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACtC,MAAM,UAAU,GAAG,mCAAmC,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,mCAAmC,CAAC,UAAU,CAAC,CAAC;YACrI,MAAO,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,mFAAmF;IAC5E,aAAa,CAAC,YAAoB,EAAE,OAAkE;QAC3G,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,YAAY,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC;CACF","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 { Range2d } from \"../../geometry3d/Range\";\r\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\r\nimport { GriddedRaggedRange2dSet } from \"./GriddedRaggedRange2dSet\";\r\nimport { LinearSearchRange2dArray } from \"./LinearSearchRange2dArray\";\r\nimport { Range2dSearchInterface } from \"./Range2dSearchInterface\";\r\n\r\n/**\r\n * Use GriddedRaggedRange2dSetWithOverflow for searching among many ranges for which:\r\n * * Most ranges are of somewhat consistent size.\r\n * * A modest number of oversizes.\r\n * * Maintain the smallish ones in a GriddedRaggedRange2dSet.\r\n * * Maintain the overflows in a Range2dSearchInterface.\r\n * @public\r\n */\r\nexport class GriddedRaggedRange2dSetWithOverflow<T> implements Range2dSearchInterface<T> {\r\n  private _gridSet: GriddedRaggedRange2dSet<T>;\r\n  private _overflowSet: Range2dSearchInterface<T>;\r\n  private static _workRange?: Range2d;\r\n  private constructor(gridSet: GriddedRaggedRange2dSet<T>, overflowSet: Range2dSearchInterface<T>) {\r\n    this._gridSet = gridSet;\r\n    this._overflowSet = overflowSet;\r\n  }\r\n  /**\r\n   * Create an (empty) set of ranges.\r\n   * @param range\r\n   * @param numXEdge\r\n   * @param numYEdge\r\n   */\r\n  public static create<T>(range: Range2d, numXEdge: number, numYEdge: number): GriddedRaggedRange2dSetWithOverflow<T> | undefined {\r\n    const grids = GriddedRaggedRange2dSet.create<T>(range.clone(), numXEdge, numYEdge);\r\n    if (grids)\r\n      return new GriddedRaggedRange2dSetWithOverflow<T>(grids, new LinearSearchRange2dArray<T>());\r\n    return undefined;\r\n  }\r\n  /**\r\n   * * Search for ranges containing testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    return this._gridSet.searchXY(x, y, handler) && this._overflowSet.searchXY(x, y, handler);\r\n  }\r\n  /**\r\n   * * Search for ranges overlapping testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    return this._gridSet.searchRange2d(testRange, handler) && this._overflowSet.searchRange2d(testRange, handler);\r\n  }\r\n  /** If possible, insert a range into the set.\r\n   * * Decline to insert (and return false) if\r\n   *   * range is null\r\n   *   * range is not completely contained in the overall range of this set.\r\n   *   * range x or y extent is larger than 2 grid blocks.\r\n   */\r\n  public addRange(range: LowAndHighXY, tag: T): void {\r\n    if (!Range2d.isNull(range)) {\r\n      if (!this._gridSet.conditionalInsert(range, tag))\r\n        this._overflowSet.addRange(range, tag);\r\n    }\r\n  }\r\n  /** Return the overall range of all members. */\r\n  public totalRange(result?: Range2d): Range2d {\r\n    if (result)\r\n      result.setNull();\r\n    else\r\n      result = Range2d.createNull();\r\n    this.visitChildren(0, (_depth, child) => {\r\n      const childRange = GriddedRaggedRange2dSetWithOverflow._workRange = child.totalRange(GriddedRaggedRange2dSetWithOverflow._workRange);\r\n      result!.extendRange(childRange);\r\n    });\r\n    return result;\r\n  }\r\n  /** Call the handler on the overflow set, and on each defined block in the grid. */\r\n  public visitChildren(initialDepth: number, handler: (depth: number, child: Range2dSearchInterface<T>) => void) {\r\n    handler(initialDepth, this._overflowSet);\r\n    this._gridSet.visitChildren(initialDepth + 1, handler);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"GriddedRaggedRange2dSetWithOverflow.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAEjD,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AACpE,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAGtE;;;;;;;GAOG;AACH,MAAM,OAAO,mCAAmC;IAI9C,YAAoB,OAAmC,EAAE,WAAsC;QAC7F,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAI,KAAc,EAAE,QAAgB,EAAE,QAAgB;QACxE,MAAM,KAAK,GAAG,uBAAuB,CAAC,MAAM,CAAI,KAAK,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,KAAK;YACP,OAAO,IAAI,mCAAmC,CAAI,KAAK,EAAE,IAAI,wBAAwB,EAAK,CAAC,CAAC;QAC9F,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,OAA4C;QAChF,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC5F,CAAC;IACD;;;;;;;OAOG;IACI,aAAa,CAAC,SAAuB,EAAE,OAA4C;QACxF,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAChH,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAmB,EAAE,GAAM;QACzC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;gBAC9C,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IACD,+CAA+C;IACxC,UAAU,CAAC,MAAgB;QAChC,IAAI,MAAM;YACR,MAAM,CAAC,OAAO,EAAE,CAAC;;YAEjB,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAChC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACtC,MAAM,UAAU,GAAG,mCAAmC,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,mCAAmC,CAAC,UAAU,CAAC,CAAC;YACrI,MAAO,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,mFAAmF;IAC5E,aAAa,CAAC,YAAoB,EAAE,OAAkE;QAC3G,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,YAAY,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC;CACF","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 { Range2d } from \"../../geometry3d/Range\";\r\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\r\nimport { GriddedRaggedRange2dSet } from \"./GriddedRaggedRange2dSet\";\r\nimport { LinearSearchRange2dArray } from \"./LinearSearchRange2dArray\";\r\nimport { Range2dSearchInterface } from \"./Range2dSearchInterface\";\r\n\r\n/**\r\n * Use GriddedRaggedRange2dSetWithOverflow for searching among many ranges for which:\r\n * * Most ranges are of somewhat consistent size.\r\n * * A modest number of oversizes.\r\n * * Maintain the smallish ones in a GriddedRaggedRange2dSet.\r\n * * Maintain the overflows in a Range2dSearchInterface.\r\n * @public\r\n */\r\nexport class GriddedRaggedRange2dSetWithOverflow<T> implements Range2dSearchInterface<T> {\r\n  private _gridSet: GriddedRaggedRange2dSet<T>;\r\n  private _overflowSet: Range2dSearchInterface<T>;\r\n  private static _workRange?: Range2d;\r\n  private constructor(gridSet: GriddedRaggedRange2dSet<T>, overflowSet: Range2dSearchInterface<T>) {\r\n    this._gridSet = gridSet;\r\n    this._overflowSet = overflowSet;\r\n  }\r\n  /**\r\n   * Create an (empty) set of ranges.\r\n   * @param range\r\n   * @param numXEdge\r\n   * @param numYEdge\r\n   */\r\n  public static create<T>(range: Range2d, numXEdge: number, numYEdge: number): GriddedRaggedRange2dSetWithOverflow<T> | undefined {\r\n    const grids = GriddedRaggedRange2dSet.create<T>(range.clone(), numXEdge, numYEdge);\r\n    if (grids)\r\n      return new GriddedRaggedRange2dSetWithOverflow<T>(grids, new LinearSearchRange2dArray<T>());\r\n    return undefined;\r\n  }\r\n  /**\r\n   * * Search for ranges containing testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    return this._gridSet.searchXY(x, y, handler) && this._overflowSet.searchXY(x, y, handler);\r\n  }\r\n  /**\r\n   * * Search for ranges overlapping testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    return this._gridSet.searchRange2d(testRange, handler) && this._overflowSet.searchRange2d(testRange, handler);\r\n  }\r\n  /** If possible, insert a range into the set.\r\n   * * Decline to insert (and return false) if\r\n   *   * range is null\r\n   *   * range is not completely contained in the overall range of this set.\r\n   *   * range x or y extent is larger than 2 grid blocks.\r\n   */\r\n  public addRange(range: LowAndHighXY, tag: T): void {\r\n    if (!Range2d.isNull(range)) {\r\n      if (!this._gridSet.conditionalInsert(range, tag))\r\n        this._overflowSet.addRange(range, tag);\r\n    }\r\n  }\r\n  /** Return the overall range of all members. */\r\n  public totalRange(result?: Range2d): Range2d {\r\n    if (result)\r\n      result.setNull();\r\n    else\r\n      result = Range2d.createNull();\r\n    this.visitChildren(0, (_depth, child) => {\r\n      const childRange = GriddedRaggedRange2dSetWithOverflow._workRange = child.totalRange(GriddedRaggedRange2dSetWithOverflow._workRange);\r\n      result!.extendRange(childRange);\r\n    });\r\n    return result;\r\n  }\r\n  /** Call the handler on the overflow set, and on each defined block in the grid. */\r\n  public visitChildren(initialDepth: number, handler: (depth: number, child: Range2dSearchInterface<T>) => void) {\r\n    handler(initialDepth, this._overflowSet);\r\n    this._gridSet.visitChildren(initialDepth + 1, handler);\r\n  }\r\n}\r\n"]}

package/lib/esm/polyface/multiclip/LinearSearchRange2dArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"LinearSearchRange2dArray.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/LinearSearchRange2dArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAIjD;;;;;;GAMG;AACH,MAAM,OAAO,wBAAwB;IAInC;QACE,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IAC9C,CAAC;IACD,+BAA+B;IACvB,eAAe;QACrB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACxB,CAAC;IACD,+CAA+C;IACxC,UAAU,CAAC,MAAgB;QAChC,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5C,CAAC;IACD,qCAAqC;IAC9B,QAAQ,CAAC,KAAmB,EAAE,GAAM;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,MAAM,OAAO,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACpC,OAAe,CAAC,GAAG,GAAG,GAAG,CAAC;QAC3B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,OAA4C;QAChF,IAAI,IAAI,CAAC,QAAQ;YACf,IAAI,CAAC,eAAe,EAAE,CAAC;QACzB,+CAA+C;QAC/C,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,WAAW,EAAE;YACxC,IAAI,SAAS,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,SAAS,EAAG,SAAiB,CAAC,GAAG,CAAC;oBAC7C,OAAO,KAAK,CAAC;SAClB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;OAOG;IACI,aAAa,CAAC,SAAuB,EAAE,OAA4C;QACxF,IAAI,IAAI,CAAC,QAAQ;YACf,IAAI,CAAC,eAAe,EAAE,CAAC;QACzB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,WAAW,EAAE;YACxC,IAAI,SAAS,CAAC,eAAe,CAAC,SAAS,CAAC;gBACtC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAG,SAAiB,CAAC,GAAG,CAAC;oBAC7C,OAAO,KAAK,CAAC;SAClB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF","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 { Range2d } from \"../../geometry3d/Range\";\r\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\r\nimport { Range2dSearchInterface } from \"./Range2dSearchInterface\";\r\n\r\n/**\r\n * An array of decorated Range2d.\r\n * * User data is attached to each range via `(myRange as any).tag = myTag`.\r\n * * Search operations are simple linear.\r\n * * This class can be used directly for \"smallish\" range sets, or as the leaf level of hierarchical structures for larger range sets.\r\n * @internal\r\n */\r\nexport class LinearSearchRange2dArray<T> implements Range2dSearchInterface<T> {\r\n  private _rangeArray: Range2d[];\r\n  private _isDirty: boolean;\r\n  private _compositeRange: Range2d;\r\n  public constructor() {\r\n    this._rangeArray = [];\r\n    this._isDirty = false;\r\n    this._compositeRange = Range2d.createNull();\r\n  }\r\n  // TODO: build search structure\r\n  private updateForSearch() {\r\n    this._isDirty = false;\r\n  }\r\n  /** Return the overall range of all members. */\r\n  public totalRange(result?: Range2d): Range2d {\r\n    return this._compositeRange.clone(result);\r\n  }\r\n  /** Add a range to the search set. */\r\n  public addRange(range: LowAndHighXY, tag: T): void {\r\n    this._isDirty = true;\r\n    const myRange = Range2d.createNull();\r\n    (myRange as any).tag = tag;\r\n    myRange.extendXY(range.low.x, range.low.y);\r\n    myRange.extendXY(range.high.x, range.high.y);\r\n    this._compositeRange.extendRange(myRange);\r\n    this._rangeArray.push(myRange);\r\n  }\r\n  /**\r\n   * * Search for ranges containing testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    if (this._isDirty)\r\n      this.updateForSearch();\r\n    // NEEDS WORK: Linear search here -- do better!\r\n    for (const candidate of this._rangeArray) {\r\n      if (candidate.containsXY(x, y))\r\n        if (!handler(candidate, (candidate as any).tag))\r\n          return false;\r\n    }\r\n    return true;\r\n  }\r\n  /**\r\n   * * Search for ranges overlapping testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    if (this._isDirty)\r\n      this.updateForSearch();\r\n    for (const candidate of this._rangeArray) {\r\n      if (candidate.intersectsRange(testRange))\r\n        if (!handler(candidate, (candidate as any).tag))\r\n          return false;\r\n    }\r\n    return true;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"LinearSearchRange2dArray.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/LinearSearchRange2dArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAIjD;;;;;;GAMG;AACH,MAAM,OAAO,wBAAwB;IAInC;QACE,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IAC9C,CAAC;IACD,+BAA+B;IACvB,eAAe;QACrB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACxB,CAAC;IACD,+CAA+C;IACxC,UAAU,CAAC,MAAgB;QAChC,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5C,CAAC;IACD,qCAAqC;IAC9B,QAAQ,CAAC,KAAmB,EAAE,GAAM;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,MAAM,OAAO,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACpC,OAAe,CAAC,GAAG,GAAG,GAAG,CAAC;QAC3B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,OAA4C;QAChF,IAAI,IAAI,CAAC,QAAQ;YACf,IAAI,CAAC,eAAe,EAAE,CAAC;QACzB,+CAA+C;QAC/C,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACzC,IAAI,SAAS,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,SAAS,EAAG,SAAiB,CAAC,GAAG,CAAC;oBAC7C,OAAO,KAAK,CAAC;QACnB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;OAOG;IACI,aAAa,CAAC,SAAuB,EAAE,OAA4C;QACxF,IAAI,IAAI,CAAC,QAAQ;YACf,IAAI,CAAC,eAAe,EAAE,CAAC;QACzB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACzC,IAAI,SAAS,CAAC,eAAe,CAAC,SAAS,CAAC;gBACtC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAG,SAAiB,CAAC,GAAG,CAAC;oBAC7C,OAAO,KAAK,CAAC;QACnB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF","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 { Range2d } from \"../../geometry3d/Range\";\r\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\r\nimport { Range2dSearchInterface } from \"./Range2dSearchInterface\";\r\n\r\n/**\r\n * An array of decorated Range2d.\r\n * * User data is attached to each range via `(myRange as any).tag = myTag`.\r\n * * Search operations are simple linear.\r\n * * This class can be used directly for \"smallish\" range sets, or as the leaf level of hierarchical structures for larger range sets.\r\n * @internal\r\n */\r\nexport class LinearSearchRange2dArray<T> implements Range2dSearchInterface<T> {\r\n  private _rangeArray: Range2d[];\r\n  private _isDirty: boolean;\r\n  private _compositeRange: Range2d;\r\n  public constructor() {\r\n    this._rangeArray = [];\r\n    this._isDirty = false;\r\n    this._compositeRange = Range2d.createNull();\r\n  }\r\n  // TODO: build search structure\r\n  private updateForSearch() {\r\n    this._isDirty = false;\r\n  }\r\n  /** Return the overall range of all members. */\r\n  public totalRange(result?: Range2d): Range2d {\r\n    return this._compositeRange.clone(result);\r\n  }\r\n  /** Add a range to the search set. */\r\n  public addRange(range: LowAndHighXY, tag: T): void {\r\n    this._isDirty = true;\r\n    const myRange = Range2d.createNull();\r\n    (myRange as any).tag = tag;\r\n    myRange.extendXY(range.low.x, range.low.y);\r\n    myRange.extendXY(range.high.x, range.high.y);\r\n    this._compositeRange.extendRange(myRange);\r\n    this._rangeArray.push(myRange);\r\n  }\r\n  /**\r\n   * * Search for ranges containing testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    if (this._isDirty)\r\n      this.updateForSearch();\r\n    // NEEDS WORK: Linear search here -- do better!\r\n    for (const candidate of this._rangeArray) {\r\n      if (candidate.containsXY(x, y))\r\n        if (!handler(candidate, (candidate as any).tag))\r\n          return false;\r\n    }\r\n    return true;\r\n  }\r\n  /**\r\n   * * Search for ranges overlapping testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    if (this._isDirty)\r\n      this.updateForSearch();\r\n    for (const candidate of this._rangeArray) {\r\n      if (candidate.intersectsRange(testRange))\r\n        if (!handler(candidate, (candidate as any).tag))\r\n          return false;\r\n    }\r\n    return true;\r\n  }\r\n}\r\n"]}

package/lib/esm/polyface/multiclip/OffsetMeshContext.js

@@ -600,7 +600,7 @@ export class OffsetMeshContext {
     assignOffsetByAverageNormalAroundVertex(vertexSeed, maxAllowedDeviationRadians, data, distance) {
         const maxDeviationRadians = this.computeAverageNormalAndMaxDeviationAroundVertex(vertexSeed, data);
         if (OffsetMeshContext.stringDebugFunction) {
-            OffsetMeshContext.stringDebugFunction(`XYZ ${HalfEdge.nodeToIdXYZString(vertexSeed)} Average Normal ${data.averageNormal.toJSON()}`);
+            OffsetMeshContext.stringDebugFunction(`XYZ ${HalfEdge.nodeToIdXYZString(vertexSeed)} Average Normal ${JSON.stringify(data.averageNormal.toJSON())}`);
             OffsetMeshContext.stringDebugFunction(`           angle ratio ${data.radiansSum / (2 * Math.PI)}   maxDeviation ${data.maxDeviationRadiansFromAverage}`);
         }
         if (maxDeviationRadians !== undefined && maxDeviationRadians <= maxAllowedDeviationRadians) {
@@ -883,7 +883,7 @@ export class OffsetMeshContext {
                 vertexSeed = vertexSeedA;
             if (OffsetMeshContext.stringDebugFunction !== undefined) {
                 OffsetMeshContext.stringDebugFunction("");
-                OffsetMeshContext.stringDebugFunction(` VERTEX LOOP   ${vertexSeed.getPoint3d().toJSON()} `);
+                OffsetMeshContext.stringDebugFunction(` VERTEX LOOP   ${JSON.stringify(vertexSeed.getPoint3d().toJSON())} `);
                 vertexSeed.sumAroundVertex((node) => { OffsetMeshContext.stringDebugFunction(this.inspectMasks(node, false, true)); return 0; });
             }
             // Take care of the easiest vertices directly . . . note that this returns from the lambda, not computeOffsetFacetIntersections