@itwin/core-geometry 4.1.0-dev.8 → 4.1.0-dev.80

package/lib/esm/polyface/RangeLengthData.js.map

@@ -1 +1 @@
-{"version":3,"file":"RangeLengthData.js","sourceRoot":"","sources":["../../../src/polyface/RangeLengthData.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAElD;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,eAAe;IAO1B;QACE,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IACzC,CAAC;IAED,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","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"]}
+{"version":3,"file":"RangeLengthData.js","sourceRoot":"","sources":["../../../src/polyface/RangeLengthData.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAElD;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,eAAe;IAO1B;QACE,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IACzC,CAAC;IAED,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","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"]}

package/lib/esm/polyface/TaggedNumericData.js

@@ -137,7 +137,7 @@ export class TaggedNumericData {
         if (this.tagB !== other.tagB)
             return false;
         return Geometry.exactEqualNumberArrays(this.intData, other.intData)
-            && Geometry.almostEqualArrays(this.doubleData, other.doubleData, Geometry.isAlmostEqualNumber);
+            && Geometry.almostEqualArrays(this.doubleData, other.doubleData, (a, b) => Geometry.isAlmostEqualNumber(a, b));
     }
     static areAlmostEqual(dataA, dataB) {
         if (dataA === undefined && dataB === undefined)

package/lib/esm/polyface/TaggedNumericData.js.map

@@ -1 +1 @@
-{"version":3,"file":"TaggedNumericData.js","sourceRoot":"","sources":["../../../src/polyface/TaggedNumericData.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC;;;GAGG;AACH,MAAM,KAAW,sBAAsB,CA+BtC;AA/BD,WAAiB,sBAAsB;IACrC;;;MAGE;IACJ,IAAa,oBAGV;IAHH,WAAa,oBAAoB;QAC7B,oDAAoD;QACpD,+FAA0B,CAAA;IAC5B,CAAC,EAHU,oBAAoB,GAApB,2CAAoB,KAApB,2CAAoB,QAG9B;IACD;;;OAGG;IACL,IAAY,iBAKT;IALH,WAAY,iBAAiB;QACzB,uFAAuB,CAAA;QACvB,yEAAgB,CAAA;QAChB,yDAAQ,CAAA;QACR,iEAAY,CAAA;IACd,CAAC,EALS,iBAAiB,GAAjB,wCAAiB,KAAjB,wCAAiB,QAK1B;IACD;;;OAGG;IACL,IAAa,sBAOV;IAPH,WAAa,sBAAsB;QAC/B,4DAA4D;QAC5D,kFAAiB,CAAA;QACjB,4FAA4F;QAC5F,gGAAwB,CAAA;QACxB,kHAAkH;QAClH,oHAAkC,CAAA;IACpC,CAAC,EAPU,sBAAsB,GAAtB,6CAAsB,KAAtB,6CAAsB,QAOhC;AACH,CAAC,EA/BgB,sBAAsB,KAAtB,sBAAsB,QA+BtC;AACD;;;;GAIG;AACH,MAAM,OAAO,iBAAiB;IAM5B,YAAmB,OAAe,CAAC,EAAE,OAAe,CAAC,EACnD,OAAkB,EAAE,UAAqB;QAEzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,OAAO;YAAE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACpC,IAAI,UAAU;YAAE,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/C,CAAC;IAMH;;;;SAIK;IACI,WAAW,CAAC,IAAY,EAAE,IAAY;QAC3C,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QACrC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IACD;;;;OAIG;IACK,iBAAiB,CAAC,IAAY,EAAE,MAAc;QAClD,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IACD;;;;;;OAMG;IACI,QAAQ,CAAC,SAAiB,EAAE,QAAgB,EAAE,QAAgB,EAAE,YAAoB;QAC3F,IAAI,IAAI,CAAC,OAAO,EAAE;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAC;gBAClD,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS;oBAC/B,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;aACpE;SACF;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;;;;OAMG;IACI,kBAAkB,CAAC,SAAiB,EAAE,QAAgB,EAAE,QAAgB,EAAE,YAAoB;QACrG,IAAI,IAAI,CAAC,OAAO,EAAE;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAC;gBAClD,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;oBACjC,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAE,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;iBACjG;aACF;SACF;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,KAAa,EAAE,YAAoB;QACtD,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM;YACjE,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAChC,OAAO,YAAY,CAAC;IACtB,CAAC;IACD,0CAA0C;IACnC,aAAa,CAAC,KAAwB;QAC3C,IAAI,KAAK,KAAK,SAAS;YACrB,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;YAC1B,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;YAC5B,OAAO,KAAK,CAAC;QACb,OAAO,QAAQ,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;eAC9D,QAAQ,CAAC,iBAAiB,CAAS,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,mBAAmB,CAAC,CAAC;IAC3G,CAAC;IAEM,MAAM,CAAC,cAAc,CAAC,KAAoC,EAAE,KAAoC;QACrG,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;YAC5C,OAAO,IAAI,CAAC;QACd,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;YAC5C,OAAO,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACpC,OAAO,KAAK,CAAC;IACf,CAAC;IACH,4BAA4B;IACnB,KAAK,CAAC,MAA0B;QACrC,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,OAAO;YACd,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,UAAU;YACjB,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAC9C,OAAO,MAAM,CAAC;IAChB,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 Polyface\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\n\r\n/**\r\n * `TaggedNumericConstants` defines enums with constant values for use in tags of [[TaggedNumericData]]\r\n * @public\r\n */\r\nexport namespace TaggedNumericConstants {\r\n  /**  Reserved values for the \"tagA\" member of [[TaggedNumericData]]\r\n  * @public\r\n   *\r\n  */\r\nexport  enum TaggedNumericTagType {\r\n    /** `tagA` value identifying a subdivision surface*/\r\n    SubdivisionSurface = -1000\r\n  }\r\n  /**\r\n   * `tagB` values for supported types of subdivision surfaces\r\n   * @public\r\n   */\r\nexport enum SubdivisionMethod {\r\n    ChooseBasedOnFacets = 0,\r\n    CatmullClark = 1,\r\n    Loop = 2,\r\n    DooSabin = 3\r\n  }\r\n  /**\r\n   * numeric values for subdivision control.  These are entered in the intData array as first of a pair.\r\n   * @public\r\n   */\r\nexport  enum SubdivisionControlCode {\r\n    /** pair (FixedDepth, d) indicates subdivision to depth d */\r\n    FixedDepth = -100,\r\n    /** pair (FixedDepth, index) indicates absolute tolerance with value in doubleData[index] */\r\n    AbsoluteTolerance = -101,\r\n    /** pair (FixedDepth, index) indicates tolerance as a fraction of base mesh range is found in doubleData[index] */\r\n    FractionOfRangeBoxTolerance = -102\r\n  }\r\n}\r\n/**\r\n * Structure with 2 integer tags and optional arrays of integers, doubles, points, vectors, and geometry.\r\n * * In typescript/javascript, all integer numbers that can be non-integer.  Please do not insert non-integers in the integer array.\r\n * @public\r\n */\r\nexport class TaggedNumericData {\r\n  /** Application specific primary tag.   See reserved values in  [[TaggedNumericConstants]] */\r\n  public tagA: number;\r\n  /** Application specific secondary tag.   See reserved values in  [[TaggedNumericConstants]] */\r\n  public tagB: number;\r\n\r\n  public constructor(tagA: number = 0, tagB: number = 0,\r\n    intData?: number[], doubleData?: number[]\r\n  ) {\r\n    this.tagA = tagA;\r\n    this.tagB = tagB;\r\n    if (intData) this.intData = intData;\r\n    if (doubleData) this.doubleData = doubleData;\r\n  }\r\n/** Integer data with application-specific meaning */\r\n  public intData?: number[];\r\n/** Double data with application-specific meaning */\r\npublic doubleData?: number[];\r\n\r\n/**\r\n   * push a pair of int values on the intData array.\r\n   * @param intA\r\n   * @param intB\r\n   */\r\n  public pushIntPair(intA: number, intB: number) {\r\n    if (!this.intData) this.intData = [];\r\n    this.intData.push(intA);\r\n    this.intData.push(intB);\r\n  }\r\n  /**\r\n   * push a pair of int values on the intData array.\r\n   * @param intA int to push on the intData array, followed by index of valueB in the doubleData array.\r\n   * @param valueB value to push on the doubleData array.\r\n   */\r\n   public pushIndexedDouble(intA: number, valueB: number) {\r\n      if (!this.intData) this.intData = [];\r\n      if (!this.doubleData) this.doubleData = [];\r\n      this.intData.push(intA);\r\n      this.intData.push(this.doubleData.length);\r\n      this.doubleData.push(valueB);\r\n  }\r\n  /**\r\n   * Search pairs in the intData array for a pair (targetTag, value).  Return the value, possibly restricted to (minValue,maxValue)\r\n   * @param targetTag\r\n   * @param minValue\r\n   * @param maxValue\r\n   * @param defaultValue\r\n   */\r\n  public tagToInt(targetTag: number, minValue: number, maxValue: number, defaultValue: number): number {\r\n  if (this.intData) {\r\n    for (let i = 0; i + 1 < this.intData.length; i += 2){\r\n      if (this.intData[i] === targetTag)\r\n        return Math.min(Math.max(this.intData[i + 1], minValue), maxValue);\r\n      }\r\n    }\r\n    return defaultValue;\r\n  }\r\n\r\n  /**\r\n   * Search pairs in the intData array for a pair (targetTag, index).  Return getDoubleData[index] value, possibly restricted to (minValue,maxValue)\r\n   * @param targetTag\r\n   * @param minValue\r\n   * @param maxValue\r\n   * @param defaultValue\r\n   */\r\n  public tagToIndexedDouble(targetTag: number, minValue: number, maxValue: number, defaultValue: number): number {\r\n  if (this.intData) {\r\n    for (let i = 0; i + 1 < this.intData.length; i += 2){\r\n      if (this.intData[i] === targetTag) {\r\n        return Geometry.clamp(this.getDoubleData (this.intData[i + 1], defaultValue), minValue, maxValue);\r\n        }\r\n      }\r\n    }\r\n    return defaultValue;\r\n  }\r\n  /**\r\n   * get doubleData[index], or indicated default if the index is out of range\r\n   * @param index\r\n   * @param defaultValue\r\n   */\r\n  public getDoubleData(index: number, defaultValue: number): number{\r\n    if (this.doubleData && 0 <= index && index < this.doubleData.length)\r\n      return this.doubleData[index];\r\n    return defaultValue;\r\n  }\r\n  /** Apply isAlmostEqual to all members. */\r\n  public isAlmostEqual(other: TaggedNumericData): boolean{\r\n    if (other === undefined)\r\n      return false;\r\n    if (this.tagA !== other.tagA)\r\n      return false;\r\n    if (this.tagB !== other.tagB)\r\n    return false;\r\n    return Geometry.exactEqualNumberArrays(this.intData, other.intData)\r\n      && Geometry.almostEqualArrays<number>(this.doubleData, other.doubleData, Geometry.isAlmostEqualNumber);\r\n  }\r\n\r\n  public static areAlmostEqual(dataA: TaggedNumericData | undefined, dataB: TaggedNumericData | undefined): boolean{\r\n    if (dataA === undefined && dataB === undefined)\r\n      return true;\r\n    if (dataA !== undefined && dataB !== undefined)\r\n      return dataA.isAlmostEqual(dataB);\r\n    return false;\r\n  }\r\n/** Return a deep clone.  */\r\n  public clone(result?: TaggedNumericData): TaggedNumericData {\r\n    if (!result)\r\n      result = new TaggedNumericData(this.tagA, this.tagB);\r\n    if (this.intData)\r\n      result.intData = this.intData.slice();\r\n    if (this.doubleData)\r\n      result.doubleData = this.doubleData.slice();\r\n    return result;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"TaggedNumericData.js","sourceRoot":"","sources":["../../../src/polyface/TaggedNumericData.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC;;;GAGG;AACH,MAAM,KAAW,sBAAsB,CA+BtC;AA/BD,WAAiB,sBAAsB;IACrC;;;MAGE;IACJ,IAAa,oBAGV;IAHH,WAAa,oBAAoB;QAC7B,oDAAoD;QACpD,+FAA0B,CAAA;IAC5B,CAAC,EAHU,oBAAoB,GAApB,2CAAoB,KAApB,2CAAoB,QAG9B;IACD;;;OAGG;IACL,IAAY,iBAKT;IALH,WAAY,iBAAiB;QACzB,uFAAuB,CAAA;QACvB,yEAAgB,CAAA;QAChB,yDAAQ,CAAA;QACR,iEAAY,CAAA;IACd,CAAC,EALS,iBAAiB,GAAjB,wCAAiB,KAAjB,wCAAiB,QAK1B;IACD;;;OAGG;IACL,IAAa,sBAOV;IAPH,WAAa,sBAAsB;QAC/B,4DAA4D;QAC5D,kFAAiB,CAAA;QACjB,4FAA4F;QAC5F,gGAAwB,CAAA;QACxB,kHAAkH;QAClH,oHAAkC,CAAA;IACpC,CAAC,EAPU,sBAAsB,GAAtB,6CAAsB,KAAtB,6CAAsB,QAOhC;AACH,CAAC,EA/BgB,sBAAsB,KAAtB,sBAAsB,QA+BtC;AACD;;;;GAIG;AACH,MAAM,OAAO,iBAAiB;IAM5B,YAAmB,OAAe,CAAC,EAAE,OAAe,CAAC,EACnD,OAAkB,EAAE,UAAqB;QAEzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,OAAO;YAAE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACpC,IAAI,UAAU;YAAE,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/C,CAAC;IAMH;;;;SAIK;IACI,WAAW,CAAC,IAAY,EAAE,IAAY;QAC3C,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QACrC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IACD;;;;OAIG;IACK,iBAAiB,CAAC,IAAY,EAAE,MAAc;QAClD,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IACD;;;;;;OAMG;IACI,QAAQ,CAAC,SAAiB,EAAE,QAAgB,EAAE,QAAgB,EAAE,YAAoB;QAC3F,IAAI,IAAI,CAAC,OAAO,EAAE;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAC;gBAClD,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS;oBAC/B,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;aACpE;SACF;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;;;;OAMG;IACI,kBAAkB,CAAC,SAAiB,EAAE,QAAgB,EAAE,QAAgB,EAAE,YAAoB;QACrG,IAAI,IAAI,CAAC,OAAO,EAAE;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAC;gBAClD,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;oBACjC,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAE,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;iBACjG;aACF;SACF;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,KAAa,EAAE,YAAoB;QACtD,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM;YACjE,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAChC,OAAO,YAAY,CAAC;IACtB,CAAC;IACD,0CAA0C;IACnC,aAAa,CAAC,KAAwB;QAC3C,IAAI,KAAK,KAAK,SAAS;YACrB,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;YAC1B,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;YAC5B,OAAO,KAAK,CAAC;QACb,OAAO,QAAQ,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;eAC9D,QAAQ,CAAC,iBAAiB,CAAS,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3H,CAAC;IAEM,MAAM,CAAC,cAAc,CAAC,KAAoC,EAAE,KAAoC;QACrG,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;YAC5C,OAAO,IAAI,CAAC;QACd,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;YAC5C,OAAO,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACpC,OAAO,KAAK,CAAC;IACf,CAAC;IACH,4BAA4B;IACnB,KAAK,CAAC,MAA0B;QACrC,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,OAAO;YACd,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,UAAU;YACjB,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAC9C,OAAO,MAAM,CAAC;IAChB,CAAC;CACF","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 Polyface\n */\n\nimport { Geometry } from \"../Geometry\";\n\n/**\n * `TaggedNumericConstants` defines enums with constant values for use in tags of [[TaggedNumericData]]\n * @public\n */\nexport namespace TaggedNumericConstants {\n  /**  Reserved values for the \"tagA\" member of [[TaggedNumericData]]\n  * @public\n   *\n  */\nexport  enum TaggedNumericTagType {\n    /** `tagA` value identifying a subdivision surface*/\n    SubdivisionSurface = -1000\n  }\n  /**\n   * `tagB` values for supported types of subdivision surfaces\n   * @public\n   */\nexport enum SubdivisionMethod {\n    ChooseBasedOnFacets = 0,\n    CatmullClark = 1,\n    Loop = 2,\n    DooSabin = 3\n  }\n  /**\n   * numeric values for subdivision control.  These are entered in the intData array as first of a pair.\n   * @public\n   */\nexport  enum SubdivisionControlCode {\n    /** pair (FixedDepth, d) indicates subdivision to depth d */\n    FixedDepth = -100,\n    /** pair (FixedDepth, index) indicates absolute tolerance with value in doubleData[index] */\n    AbsoluteTolerance = -101,\n    /** pair (FixedDepth, index) indicates tolerance as a fraction of base mesh range is found in doubleData[index] */\n    FractionOfRangeBoxTolerance = -102\n  }\n}\n/**\n * Structure with 2 integer tags and optional arrays of integers, doubles, points, vectors, and geometry.\n * * In typescript/javascript, all integer numbers that can be non-integer.  Please do not insert non-integers in the integer array.\n * @public\n */\nexport class TaggedNumericData {\n  /** Application specific primary tag.   See reserved values in  [[TaggedNumericConstants]] */\n  public tagA: number;\n  /** Application specific secondary tag.   See reserved values in  [[TaggedNumericConstants]] */\n  public tagB: number;\n\n  public constructor(tagA: number = 0, tagB: number = 0,\n    intData?: number[], doubleData?: number[],\n  ) {\n    this.tagA = tagA;\n    this.tagB = tagB;\n    if (intData) this.intData = intData;\n    if (doubleData) this.doubleData = doubleData;\n  }\n/** Integer data with application-specific meaning */\n  public intData?: number[];\n/** Double data with application-specific meaning */\npublic doubleData?: number[];\n\n/**\n   * push a pair of int values on the intData array.\n   * @param intA\n   * @param intB\n   */\n  public pushIntPair(intA: number, intB: number) {\n    if (!this.intData) this.intData = [];\n    this.intData.push(intA);\n    this.intData.push(intB);\n  }\n  /**\n   * push a pair of int values on the intData array.\n   * @param intA int to push on the intData array, followed by index of valueB in the doubleData array.\n   * @param valueB value to push on the doubleData array.\n   */\n   public pushIndexedDouble(intA: number, valueB: number) {\n      if (!this.intData) this.intData = [];\n      if (!this.doubleData) this.doubleData = [];\n      this.intData.push(intA);\n      this.intData.push(this.doubleData.length);\n      this.doubleData.push(valueB);\n  }\n  /**\n   * Search pairs in the intData array for a pair (targetTag, value).  Return the value, possibly restricted to (minValue,maxValue)\n   * @param targetTag\n   * @param minValue\n   * @param maxValue\n   * @param defaultValue\n   */\n  public tagToInt(targetTag: number, minValue: number, maxValue: number, defaultValue: number): number {\n  if (this.intData) {\n    for (let i = 0; i + 1 < this.intData.length; i += 2){\n      if (this.intData[i] === targetTag)\n        return Math.min(Math.max(this.intData[i + 1], minValue), maxValue);\n      }\n    }\n    return defaultValue;\n  }\n\n  /**\n   * Search pairs in the intData array for a pair (targetTag, index).  Return getDoubleData[index] value, possibly restricted to (minValue,maxValue)\n   * @param targetTag\n   * @param minValue\n   * @param maxValue\n   * @param defaultValue\n   */\n  public tagToIndexedDouble(targetTag: number, minValue: number, maxValue: number, defaultValue: number): number {\n  if (this.intData) {\n    for (let i = 0; i + 1 < this.intData.length; i += 2){\n      if (this.intData[i] === targetTag) {\n        return Geometry.clamp(this.getDoubleData (this.intData[i + 1], defaultValue), minValue, maxValue);\n        }\n      }\n    }\n    return defaultValue;\n  }\n  /**\n   * get doubleData[index], or indicated default if the index is out of range\n   * @param index\n   * @param defaultValue\n   */\n  public getDoubleData(index: number, defaultValue: number): number{\n    if (this.doubleData && 0 <= index && index < this.doubleData.length)\n      return this.doubleData[index];\n    return defaultValue;\n  }\n  /** Apply isAlmostEqual to all members. */\n  public isAlmostEqual(other: TaggedNumericData): boolean{\n    if (other === undefined)\n      return false;\n    if (this.tagA !== other.tagA)\n      return false;\n    if (this.tagB !== other.tagB)\n    return false;\n    return Geometry.exactEqualNumberArrays(this.intData, other.intData)\n      && Geometry.almostEqualArrays<number>(this.doubleData, other.doubleData, (a, b) => Geometry.isAlmostEqualNumber(a, b));\n  }\n\n  public static areAlmostEqual(dataA: TaggedNumericData | undefined, dataB: TaggedNumericData | undefined): boolean{\n    if (dataA === undefined && dataB === undefined)\n      return true;\n    if (dataA !== undefined && dataB !== undefined)\n      return dataA.isAlmostEqual(dataB);\n    return false;\n  }\n/** Return a deep clone.  */\n  public clone(result?: TaggedNumericData): TaggedNumericData {\n    if (!result)\n      result = new TaggedNumericData(this.tagA, this.tagB);\n    if (this.intData)\n      result.intData = this.intData.slice();\n    if (this.doubleData)\n      result.doubleData = this.doubleData.slice();\n    return result;\n  }\n}\n"]}

package/lib/esm/polyface/TriangleCandidate.js.map

@@ -1 +1 @@
-{"version":3,"file":"TriangleCandidate.js","sourceRoot":"","sources":["../../../src/polyface/TriangleCandidate.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AAExE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD;;;;;;GAMG;AACH,MAAM,OAAO,iBAAkB,SAAQ,mBAAmB;IAIxD,YAAoB,MAAe,EAAE,MAAe,EAAE,MAAe,EAAE,EAAU,EAAE,OAAe,EAAE,OAAgB;QAClH,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC9B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IACD;;;OAGG;IACa,OAAO,CAAC,KAAwB;QAC9C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,oBAAoB,CAAC,OAA6B,EAAE,MAAc,EAAE,OAA6B,EAAE,MAAc,EAAE,OAA6B,EAAE,MAAc,EAAE,EAAU,EAAE,MAA0B;QACpN,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,IAAI,iBAAiB,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACvG,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC;QACf,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,SAAS,KAAK,OAAO,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/E,QAAQ,EAAE,CAAC;QACb,IAAI,SAAS,KAAK,OAAO,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/E,QAAQ,EAAE,CAAC;QACb,IAAI,SAAS,KAAK,OAAO,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/E,QAAQ,EAAE,CAAC;QACb,IAAI,QAAQ,KAAK,CAAC;YAChB,MAAM,CAAC,iBAAiB,EAAE,CAAC;;YAE3B,MAAM,CAAC,WAAW,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2CAA2C;IAC3C,IAAW,OAAO,KAAc,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACvD;;;;;OAKG;IACI,WAAW,CAAC,OAAgB;QACjC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,IAAI,OAAO,KAAK,SAAS;YACvB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACI,iBAAiB;QACtB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IACtC,CAAC;IACD;;;OAGG;IACa,KAAK,CAAC,MAA0B;QAC9C,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9I,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,oBAAoB,CAAC,UAA6B,EAAE,UAA6B,EAAE,MAA0B;QACzH,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,UAAU,CAAC,OAAO,EAAE;YACtB,MAAM,GAAG,GAAG,UAAU,CAAC,mCAAmC,CAAC,UAAU,CAAC,CAAC;YACvE,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,UAAU,CAAC,WAAW,CAAC,CAAC;YACjF,IAAI,GAAG,GAAG,GAAG;gBACX,MAAM,CAAC,QAAQ,IAAI,GAAG,CAAC;SAC1B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,6BAA6B,CAAC,QAA2B,EAAE,KAAwB;QAC/F,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ;YACrD,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,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 Polyface\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { BarycentricTriangle } from \"../geometry3d/BarycentricTriangle\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\n\r\n/**\r\n * `TriangleCandidate` is a `BarycentricTriangle` with additional application-specific label data:\r\n * * `quality` = numeric indicator of quality (e.g. aspect ratio of this triangle or a combination with other triangles)\r\n * * `isValid` = boolean flag.\r\n * * `id` = application specific identifier\r\n * @internal\r\n */\r\nexport class TriangleCandidate extends BarycentricTriangle {\r\n  private _quality: number;\r\n  private _isValid: boolean;\r\n  public id: number;\r\n  private constructor(point0: Point3d, point1: Point3d, point2: Point3d, id: number, quality: number, isValid: boolean) {\r\n    super(point0, point1, point2);\r\n    this._isValid = isValid;\r\n    this._quality = quality;\r\n    this.id = id;\r\n  }\r\n  /**\r\n   * Copy all coordinate and label data from `other` to this.\r\n   * @param other source triangle\r\n   */\r\n  public override setFrom(other: TriangleCandidate): TriangleCandidate {\r\n    super.setFrom(other);\r\n    this._isValid = other._isValid;\r\n    this._quality = other._quality;\r\n    this.id = other.id;\r\n    return this;\r\n  }\r\n\r\n  /** Create (always) a TriangleCandidate.\r\n   * * Access points from multiple `IndexedXYZCollection`\r\n   * * mark invalid if any indices are invalid.\r\n   */\r\n  public static createFromIndexedXYZ(source0: IndexedXYZCollection, index0: number, source1: IndexedXYZCollection, index1: number, source2: IndexedXYZCollection, index2: number, id: number, result?: TriangleCandidate): TriangleCandidate {\r\n    if (!result)\r\n      result = new TriangleCandidate(Point3d.create(), Point3d.create(), Point3d.create(), id, 0.0, false);\r\n    result.id = id;\r\n    let numValid = 0;\r\n    if (undefined !== source0.getPoint3dAtCheckedPointIndex(index0, result.points[0]))\r\n      numValid++;\r\n    if (undefined !== source1.getPoint3dAtCheckedPointIndex(index1, result.points[1]))\r\n      numValid++;\r\n    if (undefined !== source2.getPoint3dAtCheckedPointIndex(index2, result.points[2]))\r\n      numValid++;\r\n    if (numValid === 3)\r\n      result.updateAspectRatio();\r\n    else\r\n      result.markInvalid();\r\n    return result;\r\n  }\r\n  /** (property) return the validity flag. */\r\n  public get isValid(): boolean { return this._isValid; }\r\n  /**\r\n   * * Mark this triangle invalid.\r\n   * * optionally set aspect ratio.\r\n   * * points are not changed\r\n   * @param aspectRatio\r\n   */\r\n  public markInvalid(quality?: number) {\r\n    this._isValid = false;\r\n    if (quality !== undefined)\r\n      this._quality = quality;\r\n  }\r\n  /**\r\n   * * Recompute the aspect ratio.\r\n   * * Mark invalid if aspect ratio is 0 or negative.\r\n   */\r\n  public updateAspectRatio() {\r\n    this._quality = super.aspectRatio;\r\n    this._isValid = this._quality > 0.0;\r\n  }\r\n  /**\r\n   * Clone all coordinate and label data.\r\n   * @param result optional preallocated `TriangleCandidate`\r\n   */\r\n  public override clone(result?: TriangleCandidate): TriangleCandidate {\r\n    if (result)\r\n      return result.setFrom(this);\r\n    return new TriangleCandidate(this.points[0].clone(), this.points[1].clone(), this.points[2].clone(), this.id, this._quality, this._isValid);\r\n  }\r\n  /**\r\n   * Return a `TriangleCandidate` with\r\n   *  * coordinate data and labels from `candidateA`\r\n   *  * LOWER quality of the two candidates.\r\n   *  * quality reduced by 1 if triangles have opposing normals (negative dot product of the two normals)\r\n   * @param candidateA candidate known to be valid\r\n   * @param candidateB candidate that may by valid\r\n   * @param result copy of candidate A, but if candidateB is valid the result aspect ratio is reduced (a) to the minimum of the two ratios and then (b) reduced by 1 if orientations clash.\r\n   */\r\n  public static copyWithLowerQuality(candidateA: TriangleCandidate, candidateB: TriangleCandidate, result?: TriangleCandidate): TriangleCandidate {\r\n    result = candidateA.clone(result);\r\n    if (candidateB.isValid) {\r\n      const dot = candidateA.dotProductOfCrossProductsFromOrigin(candidateB);\r\n      result._quality = Geometry.minXY(candidateA.aspectRatio, candidateB.aspectRatio);\r\n      if (dot < 0.0)\r\n        result._quality -= 1.0;\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * choose better aspect ratio of triangle, other.\r\n   * @param triangle known valid triangle, to be updated\r\n   * @param other candidate replacement\r\n   */\r\n  public static updateIfOtherHasHigherQuality(triangle: TriangleCandidate, other: TriangleCandidate) {\r\n    if (other.isValid && other._quality > triangle._quality)\r\n      triangle.setFrom(other);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"TriangleCandidate.js","sourceRoot":"","sources":["../../../src/polyface/TriangleCandidate.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AAExE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD;;;;;;GAMG;AACH,MAAM,OAAO,iBAAkB,SAAQ,mBAAmB;IAIxD,YAAoB,MAAe,EAAE,MAAe,EAAE,MAAe,EAAE,EAAU,EAAE,OAAe,EAAE,OAAgB;QAClH,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC9B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IACD;;;OAGG;IACa,OAAO,CAAC,KAAwB;QAC9C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,oBAAoB,CAAC,OAA6B,EAAE,MAAc,EAAE,OAA6B,EAAE,MAAc,EAAE,OAA6B,EAAE,MAAc,EAAE,EAAU,EAAE,MAA0B;QACpN,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,IAAI,iBAAiB,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACvG,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC;QACf,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,SAAS,KAAK,OAAO,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/E,QAAQ,EAAE,CAAC;QACb,IAAI,SAAS,KAAK,OAAO,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/E,QAAQ,EAAE,CAAC;QACb,IAAI,SAAS,KAAK,OAAO,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/E,QAAQ,EAAE,CAAC;QACb,IAAI,QAAQ,KAAK,CAAC;YAChB,MAAM,CAAC,iBAAiB,EAAE,CAAC;;YAE3B,MAAM,CAAC,WAAW,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2CAA2C;IAC3C,IAAW,OAAO,KAAc,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACvD;;;;;OAKG;IACI,WAAW,CAAC,OAAgB;QACjC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,IAAI,OAAO,KAAK,SAAS;YACvB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACI,iBAAiB;QACtB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IACtC,CAAC;IACD;;;OAGG;IACa,KAAK,CAAC,MAA0B;QAC9C,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9I,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,oBAAoB,CAAC,UAA6B,EAAE,UAA6B,EAAE,MAA0B;QACzH,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,UAAU,CAAC,OAAO,EAAE;YACtB,MAAM,GAAG,GAAG,UAAU,CAAC,mCAAmC,CAAC,UAAU,CAAC,CAAC;YACvE,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,UAAU,CAAC,WAAW,CAAC,CAAC;YACjF,IAAI,GAAG,GAAG,GAAG;gBACX,MAAM,CAAC,QAAQ,IAAI,GAAG,CAAC;SAC1B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,6BAA6B,CAAC,QAA2B,EAAE,KAAwB;QAC/F,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ;YACrD,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;CACF","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 Polyface\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { BarycentricTriangle } from \"../geometry3d/BarycentricTriangle\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\n\n/**\n * `TriangleCandidate` is a `BarycentricTriangle` with additional application-specific label data:\n * * `quality` = numeric indicator of quality (e.g. aspect ratio of this triangle or a combination with other triangles)\n * * `isValid` = boolean flag.\n * * `id` = application specific identifier\n * @internal\n */\nexport class TriangleCandidate extends BarycentricTriangle {\n  private _quality: number;\n  private _isValid: boolean;\n  public id: number;\n  private constructor(point0: Point3d, point1: Point3d, point2: Point3d, id: number, quality: number, isValid: boolean) {\n    super(point0, point1, point2);\n    this._isValid = isValid;\n    this._quality = quality;\n    this.id = id;\n  }\n  /**\n   * Copy all coordinate and label data from `other` to this.\n   * @param other source triangle\n   */\n  public override setFrom(other: TriangleCandidate): TriangleCandidate {\n    super.setFrom(other);\n    this._isValid = other._isValid;\n    this._quality = other._quality;\n    this.id = other.id;\n    return this;\n  }\n\n  /** Create (always) a TriangleCandidate.\n   * * Access points from multiple `IndexedXYZCollection`\n   * * mark invalid if any indices are invalid.\n   */\n  public static createFromIndexedXYZ(source0: IndexedXYZCollection, index0: number, source1: IndexedXYZCollection, index1: number, source2: IndexedXYZCollection, index2: number, id: number, result?: TriangleCandidate): TriangleCandidate {\n    if (!result)\n      result = new TriangleCandidate(Point3d.create(), Point3d.create(), Point3d.create(), id, 0.0, false);\n    result.id = id;\n    let numValid = 0;\n    if (undefined !== source0.getPoint3dAtCheckedPointIndex(index0, result.points[0]))\n      numValid++;\n    if (undefined !== source1.getPoint3dAtCheckedPointIndex(index1, result.points[1]))\n      numValid++;\n    if (undefined !== source2.getPoint3dAtCheckedPointIndex(index2, result.points[2]))\n      numValid++;\n    if (numValid === 3)\n      result.updateAspectRatio();\n    else\n      result.markInvalid();\n    return result;\n  }\n  /** (property) return the validity flag. */\n  public get isValid(): boolean { return this._isValid; }\n  /**\n   * * Mark this triangle invalid.\n   * * optionally set aspect ratio.\n   * * points are not changed\n   * @param aspectRatio\n   */\n  public markInvalid(quality?: number) {\n    this._isValid = false;\n    if (quality !== undefined)\n      this._quality = quality;\n  }\n  /**\n   * * Recompute the aspect ratio.\n   * * Mark invalid if aspect ratio is 0 or negative.\n   */\n  public updateAspectRatio() {\n    this._quality = super.aspectRatio;\n    this._isValid = this._quality > 0.0;\n  }\n  /**\n   * Clone all coordinate and label data.\n   * @param result optional preallocated `TriangleCandidate`\n   */\n  public override clone(result?: TriangleCandidate): TriangleCandidate {\n    if (result)\n      return result.setFrom(this);\n    return new TriangleCandidate(this.points[0].clone(), this.points[1].clone(), this.points[2].clone(), this.id, this._quality, this._isValid);\n  }\n  /**\n   * Return a `TriangleCandidate` with\n   *  * coordinate data and labels from `candidateA`\n   *  * LOWER quality of the two candidates.\n   *  * quality reduced by 1 if triangles have opposing normals (negative dot product of the two normals)\n   * @param candidateA candidate known to be valid\n   * @param candidateB candidate that may by valid\n   * @param result copy of candidate A, but if candidateB is valid the result aspect ratio is reduced (a) to the minimum of the two ratios and then (b) reduced by 1 if orientations clash.\n   */\n  public static copyWithLowerQuality(candidateA: TriangleCandidate, candidateB: TriangleCandidate, result?: TriangleCandidate): TriangleCandidate {\n    result = candidateA.clone(result);\n    if (candidateB.isValid) {\n      const dot = candidateA.dotProductOfCrossProductsFromOrigin(candidateB);\n      result._quality = Geometry.minXY(candidateA.aspectRatio, candidateB.aspectRatio);\n      if (dot < 0.0)\n        result._quality -= 1.0;\n    }\n    return result;\n  }\n  /**\n   * choose better aspect ratio of triangle, other.\n   * @param triangle known valid triangle, to be updated\n   * @param other candidate replacement\n   */\n  public static updateIfOtherHasHigherQuality(triangle: TriangleCandidate, other: TriangleCandidate) {\n    if (other.isValid && other._quality > triangle._quality)\n      triangle.setFrom(other);\n  }\n}\n"]}

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

@@ -86,7 +86,7 @@ export class BuildAverageNormalsContext {
             }
         }
         // Sort by the vertex index so all the sectors around each vertex are clustered . .
-        sectors.sort(SectorData.cbVertexSort);
+        sectors.sort((left, right) => SectorData.cbVertexSort(left, right));
         // Walk the sectors around each vertex .  ..
         // For each unassigned sector
         //     walk to further sectors of the same vertex with near-parallel normals, accumulating average normal.
@@ -119,7 +119,7 @@ export class BuildAverageNormalsContext {
             }
         }
         // Resort by original sector index.
-        sectors.sort(SectorData.cbSectorSort);
+        sectors.sort((left, right) => SectorData.cbSectorSort(left, right));
         // normalize the sums and emplace in the facets  . . .
         polyface.data.normalIndex = [];
         polyface.data.normal = new GrowableXYZArray(sectors.length);

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

@@ -1 +1 @@
-{"version":3,"file":"BuildAverageNormalsContext.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/BuildAverageNormalsContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAC5D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAEzD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AAGrE;;;GAGG;AACH,MAAM,oBAAoB;IACxB,YAAmB,KAAa,EAAE,IAAY,EAAE,MAAgB;QAC9D,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAKM,iBAAiB,CAAC,MAAc,EAAE,MAAgB;QACvD,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC;QACpB,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/C,CAAC;IACM,kBAAkB;QACvB,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,UAAU;IACd,YAAoB,SAA+B,EAAE,WAAmB,EAAE,WAAmB;QAC3F,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAKM,MAAM,CAAC,YAAY,CAAC,IAAgB,EAAE,KAAiB,IAAY,OAAO,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;IACjH,MAAM,CAAC,YAAY,CAAC,IAAgB,EAAE,KAAiB,IAAY,OAAO,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;IACjH,MAAM,CAAC,WAAW,CAAC,IAAkB,EAAE,SAA+B,EAAE,WAAmB,EAAE,WAAmB;QACrH,IAAI,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,SAAS,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;IACjE,CAAC;CACF;AACD;;;;GAIG;AAEH,MAAM,OAAO,0BAA0B;IACrC;;;;;;;;;OASG;IACI,MAAM,CAAC,uBAAuB,CAAC,QAAyB,EAAE,cAAqB;QACpF,8EAA8E;QAC9E,MAAM,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,QAAQ,CAAC,0BAA0B,CAAC,CAAI,+BAA+B;QACzF,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,yDAAyD;QACzD,qHAAqH;QAErH,OAAO,OAAO,CAAC,eAAe,EAAE,EAAE;YAChC,MAAM,WAAW,GAAG,UAAU,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC;YAC5D,IAAI,IAAI,GAAG,WAAW,CAAC,SAAS,EAAE,CAAC;YACnC,IAAI,IAAI,GAAG,SAAS,EAAE;gBACpB,WAAW,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;gBAC3C,IAAI,GAAG,GAAG,CAAC;aACZ;iBAAM;gBACL,WAAW,CAAC,YAAY,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;aACtC;YACD,MAAM,SAAS,GAAG,IAAI,oBAAoB,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;YAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;gBAC3C,UAAU,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;aACxF;SACF;QACD,mFAAmF;QACnF,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;QAEtC,4CAA4C;QAC5C,6BAA6B;QAC7B,0GAA0G;QAC1G,4EAA4E;QAC5E,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,IAAI,gBAAgB,GAAG,cAAc,CAAC,OAAO,CAAC;QAC9C,IAAI,gBAAgB,GAAG,MAAM;YAC3B,gBAAgB,GAAG,MAAM,CAAC;QAE5B,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,eAAe,GAAG,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,EAAE,eAAe,EAAE,EAAE;YACjF,MAAM,QAAQ,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;YAC1C,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC;YACzC,MAAM,aAAa,GAAG,QAAQ,CAAC,SAAS,CAAC;YACzC,IAAI,QAAQ,CAAC,iBAAiB,KAAK,SAAS,EAAE;gBAC5C,MAAM,aAAa,GAAG,IAAI,oBAAoB,CAAC,YAAY,EAAE,EAAE,GAAG,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC;gBAC3F,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC7B,sCAAsC;gBACtC,aAAa,CAAC,iBAAiB,CAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;gBACxE,KAAK,IAAI,oBAAoB,GAAG,eAAe,EAC7C,oBAAoB,GAAG,OAAO,CAAC,MAAM,EACrC,oBAAoB,EAAE,EAAE;oBACxB,MAAM,eAAe,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAAC;oBACtD,IAAI,eAAe,CAAC,WAAW,KAAK,WAAW;wBAC7C,MAAM;oBACR,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,OAAO,GAAG,gBAAgB;wBAC3F,SAAS;oBACX,IAAI,eAAe,CAAC,iBAAiB,KAAK,SAAS,EAAE;wBACnD,aAAa,CAAC,iBAAiB,CAAC,GAAG,EAAE,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;wBACvE,eAAe,CAAC,iBAAiB,GAAG,aAAa,CAAC;qBACnD;iBACF;aACF;SACF;QACD,mCAAmC;QACnC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;QACtC,sDAAsD;QACtD,QAAQ,CAAC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QAC/B,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAC9B,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC7B,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC5C,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;SAC3C;QACD,sBAAsB;QACtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;YAC5B,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAkB,CAAC,KAAK,CAAC,CAAC;SACjE;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,mBAAmB,CAAC,QAAyB;QACzD,MAAM,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,gCAAgC;QAChC,MAAM,UAAU,GAAG,IAAI,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC5D,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,OAAO,OAAO,CAAC,eAAe,EAAE,EAAE;YAChC,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC;YAC1C,IAAI,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC;gBACnD,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;gBAE7B,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE;gBACzC,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;SACpC;QACD,QAAQ,CAAC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QACvC,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC;IACpC,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 Polyface\r\n */\r\n\r\nimport { Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { PolygonOps } from \"../../geometry3d/PolygonOps\";\r\nimport { IndexedPolyface } from \"../Polyface\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { GrowableXYZArray } from \"../../geometry3d/GrowableXYZArray\";\r\nimport { Angle } from \"../../geometry3d/Angle\";\r\n\r\n/**\r\n * Normal vector with area (or other numeric) and source index\r\n * @internal\r\n */\r\nclass IndexedAreaAndNormal {\r\n  public constructor(index: number, area: number, normal: Vector3d) {\r\n    this.index = index;\r\n    this.area = area;\r\n    this.normal = normal;\r\n  }\r\n  public index: number;\r\n  public area: number;\r\n  public normal: Vector3d;\r\n\r\n  public addWeightedNormal(weight: number, normal: Vector3d) {\r\n    this.area += weight;\r\n    this.normal.addScaledInPlace(normal, weight);\r\n  }\r\n  public divideNormalByArea() {\r\n    this.normal.scaleInPlace(1.0 / this.area);\r\n  }\r\n}\r\n\r\n/**\r\n * index data for a single sector of some facet.\r\n * @internal\r\n */\r\nclass SectorData {\r\n  private constructor(facetData: IndexedAreaAndNormal, sectorIndex: number, vertexIndex: number) {\r\n    this.facetData = facetData;\r\n    this.sectorClusterData = undefined;\r\n    this.sectorIndex = sectorIndex;\r\n    this.vertexIndex = vertexIndex;\r\n  }\r\n  public facetData: IndexedAreaAndNormal;\r\n  public sectorIndex: number;\r\n  public vertexIndex: number;\r\n  public sectorClusterData: IndexedAreaAndNormal | undefined;\r\n  public static cbSectorSort(left: SectorData, right: SectorData): number { return left.sectorIndex - right.sectorIndex; }\r\n  public static cbVertexSort(left: SectorData, right: SectorData): number { return left.vertexIndex - right.vertexIndex; }\r\n  public static pushToArray(data: SectorData[], facetData: IndexedAreaAndNormal, sectorIndex: number, vertexIndex: number) {\r\n    data.push(new SectorData(facetData, sectorIndex, vertexIndex));\r\n  }\r\n}\r\n/**\r\n * Helper context for normal averaging.\r\n * All methods are static.\r\n * @internal\r\n */\r\n\r\nexport class BuildAverageNormalsContext {\r\n  /**\r\n   * * At each vertex of the mesh\r\n   *   * Find clusters of almost parallel normals\r\n   *   * Compute simple average of those normals\r\n   *   * Index to the averages\r\n   * * For typical meshes, this correctly clusters adjacent normals.\r\n   * * One cam imagine a vertex with multiple \"smooth cone-like\" sets of incident facets such that averaging occurs among two nonadjacent cones.  But this does not seem to be a problem in practice.\r\n   * @param polyface polyface to update.\r\n   * @param toleranceAngle averaging is done between normals up to this angle.\r\n   */\r\n  public static buildFastAverageNormals(polyface: IndexedPolyface, toleranceAngle: Angle) {\r\n    // We ASSUME that the visitor order matches index order in polyface.data .....\r\n    const visitor = polyface.createVisitor(0);\r\n    const defaultNormal = Vector3d.create(0, 0, 1);\r\n    const smallArea = Geometry.smallMetricDistanceSquared;    // I DO NOT LIKE THIS TOLERANCE\r\n    const sectors: SectorData[] = [];\r\n    let facetIndex = 0;\r\n    let sectorIndex = 0;\r\n    // create one IndexedAreaNormal structure for each facet.\r\n    // At each sector of each face, notate (a) IndexedAreaNormal of the facet, (b) the sector index, (c) the point index.\r\n\r\n    while (visitor.moveToNextFacet()) {\r\n      const facetNormal = PolygonOps.areaNormalGo(visitor.point)!;\r\n      let area = facetNormal.magnitude();\r\n      if (area < smallArea) {\r\n        facetNormal.setFromVector3d(defaultNormal);\r\n        area = 0.0;\r\n      } else {\r\n        facetNormal.scaleInPlace(1.0 / area);\r\n      }\r\n      const facetData = new IndexedAreaAndNormal(facetIndex++, area, facetNormal);\r\n      for (let i = 0; i < visitor.pointCount; i++) {\r\n        SectorData.pushToArray(sectors, facetData, sectorIndex++, visitor.clientPointIndex(i));\r\n      }\r\n    }\r\n    // Sort by the vertex index so all the sectors around each vertex are clustered . .\r\n    sectors.sort(SectorData.cbVertexSort);\r\n\r\n    // Walk the sectors around each vertex .  ..\r\n    // For each unassigned sector\r\n    //     walk to further sectors of the same vertex with near-parallel normals, accumulating average normal.\r\n    //     notate all sectors in the cluster with the averaged-normal structure.\r\n    const clusters: IndexedAreaAndNormal[] = [];\r\n    let toleranceRadians = toleranceAngle.radians;\r\n    if (toleranceRadians < 0.0001)\r\n      toleranceRadians = 0.0001;\r\n\r\n    let clusterIndex = 0;\r\n    for (let baseSectorIndex = 0; baseSectorIndex < sectors.length; baseSectorIndex++) {\r\n      const baseData = sectors[baseSectorIndex];\r\n      const vertexIndex = baseData.vertexIndex;\r\n      const baseFacetData = baseData.facetData;\r\n      if (baseData.sectorClusterData === undefined) {\r\n        const clusterNormal = new IndexedAreaAndNormal(clusterIndex++, 0.0, Vector3d.createZero());\r\n        clusters.push(clusterNormal);\r\n        // Accumulate with equal weights . . .\r\n        clusterNormal.addWeightedNormal(1.0, baseData.facetData.normal.clone());\r\n        for (let candidateSectorIndex = baseSectorIndex;\r\n          candidateSectorIndex < sectors.length;\r\n          candidateSectorIndex++) {\r\n          const candidateSector = sectors[candidateSectorIndex];\r\n          if (candidateSector.vertexIndex !== vertexIndex)\r\n            break;\r\n          if (candidateSector.facetData.normal.angleTo(baseFacetData.normal).radians > toleranceRadians)\r\n            continue;\r\n          if (candidateSector.sectorClusterData === undefined) {\r\n            clusterNormal.addWeightedNormal(1.0, candidateSector.facetData.normal);\r\n            candidateSector.sectorClusterData = clusterNormal;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    // Resort by original sector index.\r\n    sectors.sort(SectorData.cbSectorSort);\r\n    // normalize the sums and emplace in the facets  . . .\r\n    polyface.data.normalIndex = [];\r\n    polyface.data.normal = new GrowableXYZArray(sectors.length);\r\n    for (const cluster of clusters) {\r\n      cluster.divideNormalByArea();\r\n      cluster.index = polyface.data.normal.length;\r\n      polyface.data.normal.push(cluster.normal);\r\n    }\r\n    // emplace the indices\r\n    for (const sector of sectors) {\r\n      polyface.data.normalIndex.push(sector.sectorClusterData!.index);\r\n    }\r\n  }\r\n  /**\r\n   * Set up indexed normals with one normal in the plane of each facet of the mesh.\r\n   * @param polyface mesh to modify\r\n   */\r\n  public static buildPerFaceNormals(polyface: IndexedPolyface) {\r\n    const visitor = polyface.createVisitor(0);\r\n    const facetNormal = Vector3d.create(0, 0, 1);\r\n    const defaultNormal = Vector3d.create(0, 0, 1);\r\n    // polyface.data.clearNormals();\r\n    const newNormals = new GrowableXYZArray(polyface.faceCount);\r\n    const newIndices: number[] = [];\r\n    while (visitor.moveToNextFacet()) {\r\n      const thisNormalIndex = newNormals.length;\r\n      if (PolygonOps.unitNormal(visitor.point, facetNormal))\r\n        newNormals.push(facetNormal);\r\n      else\r\n        newNormals.push(defaultNormal);\r\n      for (let i = 0; i < visitor.pointCount; i++)\r\n        newIndices.push(thisNormalIndex);\r\n    }\r\n    polyface.data.normalIndex = newIndices;\r\n    polyface.data.normal = newNormals;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"BuildAverageNormalsContext.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/BuildAverageNormalsContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAC5D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAEzD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AAGrE;;;GAGG;AACH,MAAM,oBAAoB;IACxB,YAAmB,KAAa,EAAE,IAAY,EAAE,MAAgB;QAC9D,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAKM,iBAAiB,CAAC,MAAc,EAAE,MAAgB;QACvD,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC;QACpB,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/C,CAAC;IACM,kBAAkB;QACvB,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,UAAU;IACd,YAAoB,SAA+B,EAAE,WAAmB,EAAE,WAAmB;QAC3F,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAKM,MAAM,CAAC,YAAY,CAAC,IAAgB,EAAE,KAAiB,IAAY,OAAO,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;IACjH,MAAM,CAAC,YAAY,CAAC,IAAgB,EAAE,KAAiB,IAAY,OAAO,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;IACjH,MAAM,CAAC,WAAW,CAAC,IAAkB,EAAE,SAA+B,EAAE,WAAmB,EAAE,WAAmB;QACrH,IAAI,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,SAAS,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;IACjE,CAAC;CACF;AACD;;;;GAIG;AAEH,MAAM,OAAO,0BAA0B;IACrC;;;;;;;;;OASG;IACI,MAAM,CAAC,uBAAuB,CAAC,QAAyB,EAAE,cAAqB;QACpF,8EAA8E;QAC9E,MAAM,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,QAAQ,CAAC,0BAA0B,CAAC,CAAI,+BAA+B;QACzF,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,yDAAyD;QACzD,qHAAqH;QAErH,OAAO,OAAO,CAAC,eAAe,EAAE,EAAE;YAChC,MAAM,WAAW,GAAG,UAAU,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC;YAC5D,IAAI,IAAI,GAAG,WAAW,CAAC,SAAS,EAAE,CAAC;YACnC,IAAI,IAAI,GAAG,SAAS,EAAE;gBACpB,WAAW,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;gBAC3C,IAAI,GAAG,GAAG,CAAC;aACZ;iBAAM;gBACL,WAAW,CAAC,YAAY,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;aACtC;YACD,MAAM,SAAS,GAAG,IAAI,oBAAoB,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;YAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;gBAC3C,UAAU,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;aACxF;SACF;QACD,mFAAmF;QACnF,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QAEpE,4CAA4C;QAC5C,6BAA6B;QAC7B,0GAA0G;QAC1G,4EAA4E;QAC5E,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,IAAI,gBAAgB,GAAG,cAAc,CAAC,OAAO,CAAC;QAC9C,IAAI,gBAAgB,GAAG,MAAM;YAC3B,gBAAgB,GAAG,MAAM,CAAC;QAE5B,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,eAAe,GAAG,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,EAAE,eAAe,EAAE,EAAE;YACjF,MAAM,QAAQ,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;YAC1C,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC;YACzC,MAAM,aAAa,GAAG,QAAQ,CAAC,SAAS,CAAC;YACzC,IAAI,QAAQ,CAAC,iBAAiB,KAAK,SAAS,EAAE;gBAC5C,MAAM,aAAa,GAAG,IAAI,oBAAoB,CAAC,YAAY,EAAE,EAAE,GAAG,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC;gBAC3F,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC7B,sCAAsC;gBACtC,aAAa,CAAC,iBAAiB,CAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;gBACxE,KAAK,IAAI,oBAAoB,GAAG,eAAe,EAC7C,oBAAoB,GAAG,OAAO,CAAC,MAAM,EACrC,oBAAoB,EAAE,EAAE;oBACxB,MAAM,eAAe,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAAC;oBACtD,IAAI,eAAe,CAAC,WAAW,KAAK,WAAW;wBAC7C,MAAM;oBACR,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,OAAO,GAAG,gBAAgB;wBAC3F,SAAS;oBACX,IAAI,eAAe,CAAC,iBAAiB,KAAK,SAAS,EAAE;wBACnD,aAAa,CAAC,iBAAiB,CAAC,GAAG,EAAE,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;wBACvE,eAAe,CAAC,iBAAiB,GAAG,aAAa,CAAC;qBACnD;iBACF;aACF;SACF;QACD,mCAAmC;QACnC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QACpE,sDAAsD;QACtD,QAAQ,CAAC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QAC/B,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAC9B,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC7B,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC5C,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;SAC3C;QACD,sBAAsB;QACtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;YAC5B,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAkB,CAAC,KAAK,CAAC,CAAC;SACjE;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,mBAAmB,CAAC,QAAyB;QACzD,MAAM,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,gCAAgC;QAChC,MAAM,UAAU,GAAG,IAAI,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC5D,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,OAAO,OAAO,CAAC,eAAe,EAAE,EAAE;YAChC,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC;YAC1C,IAAI,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC;gBACnD,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;gBAE7B,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE;gBACzC,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;SACpC;QACD,QAAQ,CAAC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QACvC,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC;IACpC,CAAC;CACF","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 Polyface\n */\n\nimport { Vector3d } from \"../../geometry3d/Point3dVector3d\";\nimport { PolygonOps } from \"../../geometry3d/PolygonOps\";\nimport { IndexedPolyface } from \"../Polyface\";\nimport { Geometry } from \"../../Geometry\";\nimport { GrowableXYZArray } from \"../../geometry3d/GrowableXYZArray\";\nimport { Angle } from \"../../geometry3d/Angle\";\n\n/**\n * Normal vector with area (or other numeric) and source index\n * @internal\n */\nclass IndexedAreaAndNormal {\n  public constructor(index: number, area: number, normal: Vector3d) {\n    this.index = index;\n    this.area = area;\n    this.normal = normal;\n  }\n  public index: number;\n  public area: number;\n  public normal: Vector3d;\n\n  public addWeightedNormal(weight: number, normal: Vector3d) {\n    this.area += weight;\n    this.normal.addScaledInPlace(normal, weight);\n  }\n  public divideNormalByArea() {\n    this.normal.scaleInPlace(1.0 / this.area);\n  }\n}\n\n/**\n * index data for a single sector of some facet.\n * @internal\n */\nclass SectorData {\n  private constructor(facetData: IndexedAreaAndNormal, sectorIndex: number, vertexIndex: number) {\n    this.facetData = facetData;\n    this.sectorClusterData = undefined;\n    this.sectorIndex = sectorIndex;\n    this.vertexIndex = vertexIndex;\n  }\n  public facetData: IndexedAreaAndNormal;\n  public sectorIndex: number;\n  public vertexIndex: number;\n  public sectorClusterData: IndexedAreaAndNormal | undefined;\n  public static cbSectorSort(left: SectorData, right: SectorData): number { return left.sectorIndex - right.sectorIndex; }\n  public static cbVertexSort(left: SectorData, right: SectorData): number { return left.vertexIndex - right.vertexIndex; }\n  public static pushToArray(data: SectorData[], facetData: IndexedAreaAndNormal, sectorIndex: number, vertexIndex: number) {\n    data.push(new SectorData(facetData, sectorIndex, vertexIndex));\n  }\n}\n/**\n * Helper context for normal averaging.\n * All methods are static.\n * @internal\n */\n\nexport class BuildAverageNormalsContext {\n  /**\n   * * At each vertex of the mesh\n   *   * Find clusters of almost parallel normals\n   *   * Compute simple average of those normals\n   *   * Index to the averages\n   * * For typical meshes, this correctly clusters adjacent normals.\n   * * One cam imagine a vertex with multiple \"smooth cone-like\" sets of incident facets such that averaging occurs among two nonadjacent cones.  But this does not seem to be a problem in practice.\n   * @param polyface polyface to update.\n   * @param toleranceAngle averaging is done between normals up to this angle.\n   */\n  public static buildFastAverageNormals(polyface: IndexedPolyface, toleranceAngle: Angle) {\n    // We ASSUME that the visitor order matches index order in polyface.data .....\n    const visitor = polyface.createVisitor(0);\n    const defaultNormal = Vector3d.create(0, 0, 1);\n    const smallArea = Geometry.smallMetricDistanceSquared;    // I DO NOT LIKE THIS TOLERANCE\n    const sectors: SectorData[] = [];\n    let facetIndex = 0;\n    let sectorIndex = 0;\n    // create one IndexedAreaNormal structure for each facet.\n    // At each sector of each face, notate (a) IndexedAreaNormal of the facet, (b) the sector index, (c) the point index.\n\n    while (visitor.moveToNextFacet()) {\n      const facetNormal = PolygonOps.areaNormalGo(visitor.point)!;\n      let area = facetNormal.magnitude();\n      if (area < smallArea) {\n        facetNormal.setFromVector3d(defaultNormal);\n        area = 0.0;\n      } else {\n        facetNormal.scaleInPlace(1.0 / area);\n      }\n      const facetData = new IndexedAreaAndNormal(facetIndex++, area, facetNormal);\n      for (let i = 0; i < visitor.pointCount; i++) {\n        SectorData.pushToArray(sectors, facetData, sectorIndex++, visitor.clientPointIndex(i));\n      }\n    }\n    // Sort by the vertex index so all the sectors around each vertex are clustered . .\n    sectors.sort((left, right) => SectorData.cbVertexSort(left, right));\n\n    // Walk the sectors around each vertex .  ..\n    // For each unassigned sector\n    //     walk to further sectors of the same vertex with near-parallel normals, accumulating average normal.\n    //     notate all sectors in the cluster with the averaged-normal structure.\n    const clusters: IndexedAreaAndNormal[] = [];\n    let toleranceRadians = toleranceAngle.radians;\n    if (toleranceRadians < 0.0001)\n      toleranceRadians = 0.0001;\n\n    let clusterIndex = 0;\n    for (let baseSectorIndex = 0; baseSectorIndex < sectors.length; baseSectorIndex++) {\n      const baseData = sectors[baseSectorIndex];\n      const vertexIndex = baseData.vertexIndex;\n      const baseFacetData = baseData.facetData;\n      if (baseData.sectorClusterData === undefined) {\n        const clusterNormal = new IndexedAreaAndNormal(clusterIndex++, 0.0, Vector3d.createZero());\n        clusters.push(clusterNormal);\n        // Accumulate with equal weights . . .\n        clusterNormal.addWeightedNormal(1.0, baseData.facetData.normal.clone());\n        for (let candidateSectorIndex = baseSectorIndex;\n          candidateSectorIndex < sectors.length;\n          candidateSectorIndex++) {\n          const candidateSector = sectors[candidateSectorIndex];\n          if (candidateSector.vertexIndex !== vertexIndex)\n            break;\n          if (candidateSector.facetData.normal.angleTo(baseFacetData.normal).radians > toleranceRadians)\n            continue;\n          if (candidateSector.sectorClusterData === undefined) {\n            clusterNormal.addWeightedNormal(1.0, candidateSector.facetData.normal);\n            candidateSector.sectorClusterData = clusterNormal;\n          }\n        }\n      }\n    }\n    // Resort by original sector index.\n    sectors.sort((left, right) => SectorData.cbSectorSort(left, right));\n    // normalize the sums and emplace in the facets  . . .\n    polyface.data.normalIndex = [];\n    polyface.data.normal = new GrowableXYZArray(sectors.length);\n    for (const cluster of clusters) {\n      cluster.divideNormalByArea();\n      cluster.index = polyface.data.normal.length;\n      polyface.data.normal.push(cluster.normal);\n    }\n    // emplace the indices\n    for (const sector of sectors) {\n      polyface.data.normalIndex.push(sector.sectorClusterData!.index);\n    }\n  }\n  /**\n   * Set up indexed normals with one normal in the plane of each facet of the mesh.\n   * @param polyface mesh to modify\n   */\n  public static buildPerFaceNormals(polyface: IndexedPolyface) {\n    const visitor = polyface.createVisitor(0);\n    const facetNormal = Vector3d.create(0, 0, 1);\n    const defaultNormal = Vector3d.create(0, 0, 1);\n    // polyface.data.clearNormals();\n    const newNormals = new GrowableXYZArray(polyface.faceCount);\n    const newIndices: number[] = [];\n    while (visitor.moveToNextFacet()) {\n      const thisNormalIndex = newNormals.length;\n      if (PolygonOps.unitNormal(visitor.point, facetNormal))\n        newNormals.push(facetNormal);\n      else\n        newNormals.push(defaultNormal);\n      for (let i = 0; i < visitor.pointCount; i++)\n        newIndices.push(thisNormalIndex);\n    }\n    polyface.data.normalIndex = newIndices;\n    polyface.data.normal = newNormals;\n  }\n}\n"]}

package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSet.d.ts

@@ -3,43 +3,48 @@
  */
 import { Range2d, Range3d } from "../../geometry3d/Range";
 import { LowAndHighXY } from "../../geometry3d/XYZProps";
-import { LinearSearchRange2dArray } from "./LinearSearchRange2dArray";
-export type OptionalLinearSearchRange2dArray<T> = LinearSearchRange2dArray<T> | undefined;
+import { Range2dSearchInterface } from "./Range2dSearchInterface";
 /**
- * A GriddedRaggedRange2dSet is
- * * A doubly dimensioned array of LinearSearchRange2dArray
- * * Each entry represents a block in a uniform grid within the master range of the GriddedRaggedRange2dSet.
+ * Type abbreviation to allow undefined as a Range2dSearchInterface parameter.
+ * @internal
+ */
+export type OptionalRange2dSearchInterface<T> = Range2dSearchInterface<T> | undefined;
+/**
+ * A GriddedRaggedRange2dSet is:
+ * * A doubly dimensioned array of Range2dSearchInterface.
+ * * Each entry represents a block in a uniform grid within the master range.
  * * Member ranges are noted in the grid block containing the range's lower left corner.
  * * Member ranges larger than twice the grid size are rejected by the insert method.
  * * 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)
- * @internal
+ * @public
  */
-export declare class GriddedRaggedRange2dSet<T> {
+export declare class GriddedRaggedRange2dSet<T> implements Range2dSearchInterface<T> {
     private _range;
     private _numXEdge;
     private _numYEdge;
-    /** Each grid block is a simple linear search set
-     *
-     */
+    /** Each grid block is a simple linear search set */
     private _rangesInBlock;
+    private static _workRange?;
     private constructor();
     /**
      * Create an (empty) set of ranges.
-     * @param range
-     * @param numXEdge
-     * @param numYEdge
+     * @param range master range
+     * @param numXEdge size of grid in x direction
+     * @param numYEdge size of grid in y direction
      */
     static create<T>(range: Range2d, numXEdge: number, numYEdge: number): GriddedRaggedRange2dSet<T> | undefined;
     private xIndex;
     private yIndex;
     private getBlock;
     /** If possible, insert a range into the set.
-     * * Decline to insert (and return false) if
-     *   * range is null
-     *   * range is not completely contained in the overall range of this set.
-     *   * range x or y extent is larger than 2 grid blocks.
+     * * Decline to insert (and return false) if:
+     *    * range is null
+     *    * range is not completely contained in the overall range of this set
+     *    * range x or y extent is larger than 2 grid blocks
      */
-    conditionalInsert(range: Range2d | Range3d, tag: T): boolean;
+    conditionalInsert(range: Range2d | Range3d | LowAndHighXY, tag: T): boolean;
+    /** Add a range to the search set. */
+    addRange(range: LowAndHighXY, tag: T): void;
     /**
      * * Search a single block
      * * Pass each range and tag to handler
@@ -76,6 +81,9 @@ export declare class GriddedRaggedRange2dSet<T> {
      * @return false if search terminated by handler.  Return true if no handler returned false.
      */
     searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean;
-    visitChildren(initialDepth: number, handler: (depth: number, child: LinearSearchRange2dArray<T>) => void): void;
+    /** Return the overall range of all members. */
+    totalRange(result?: Range2d): Range2d;
+    /** Call the handler on each defined block in the grid. */
+    visitChildren(initialDepth: number, handler: (depth: number, child: Range2dSearchInterface<T>) => void): void;
 }
 //# sourceMappingURL=GriddedRaggedRange2dSet.d.ts.map

package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSet.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GriddedRaggedRange2dSet.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSet.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAEtE,MAAM,MAAM,gCAAgC,CAAC,CAAC,IAAI,wBAAwB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;AAC1F;;;;;;;;GAQG;AACH,qBAAa,uBAAuB,CAAC,CAAC;IACpC,OAAO,CAAC,MAAM,CAAU;IACxB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAS;IAC1B;;OAEG;IACH,OAAO,CAAC,cAAc,CAAoD;IAC1E,OAAO;IAaP;;;;;OAKG;WACW,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,uBAAuB,CAAC,CAAC,CAAC,GAAG,SAAS;IAKnH,OAAO,CAAC,MAAM;IAId,OAAO,CAAC,MAAM;IAId,OAAO,CAAC,QAAQ;IAQhB;;;;;OAKG;IACI,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,OAAO;IAoBnE;;;;;;;OAOG;IACH,OAAO,CAAC,sBAAsB;IAM9B;;;;;;;OAOG;IACH,OAAO,CAAC,2BAA2B;IAMnC;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAQ5F;;;;;;;OAOG;IACI,aAAa,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAa7F,aAAa,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,wBAAwB,CAAC,CAAC,CAAC,KAAK,IAAI;CAQhH"}
+{"version":3,"file":"GriddedRaggedRange2dSet.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSet.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;GAGG;AACH,MAAM,MAAM,8BAA8B,CAAC,CAAC,IAAI,sBAAsB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;AAEtF;;;;;;;;GAQG;AACH,qBAAa,uBAAuB,CAAC,CAAC,CAAE,YAAW,sBAAsB,CAAC,CAAC,CAAC;IAC1E,OAAO,CAAC,MAAM,CAAU;IACxB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAS;IAC1B,oDAAoD;IACpD,OAAO,CAAC,cAAc,CAAkD;IACxE,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAU;IACpC,OAAO;IAaP;;;;;OAKG;WACW,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,uBAAuB,CAAC,CAAC,CAAC,GAAG,SAAS;IAKnH,OAAO,CAAC,MAAM;IAId,OAAO,CAAC,MAAM;IAId,OAAO,CAAC,QAAQ;IAQhB;;;;;OAKG;IACI,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,GAAG,YAAY,EAAE,GAAG,EAAE,CAAC,GAAG,OAAO;IAoBlF,qCAAqC;IAC9B,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI;IAGlD;;;;;;;OAOG;IACH,OAAO,CAAC,sBAAsB;IAM9B;;;;;;;OAOG;IACH,OAAO,CAAC,2BAA2B;IAMnC;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAQ5F;;;;;;;OAOG;IACI,aAAa,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAapG,+CAA+C;IACxC,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAW5C,0DAA0D;IACnD,aAAa,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,sBAAsB,CAAC,CAAC,CAAC,KAAK,IAAI;CAQ9G"}

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

@@ -5,15 +5,16 @@
 /** @packageDocumentation
  * @module RangeSearch
  */
+import { Range2d } from "../../geometry3d/Range";
 import { LinearSearchRange2dArray } from "./LinearSearchRange2dArray";
 /**
- * A GriddedRaggedRange2dSet is
- * * A doubly dimensioned array of LinearSearchRange2dArray
- * * Each entry represents a block in a uniform grid within the master range of the GriddedRaggedRange2dSet.
+ * A GriddedRaggedRange2dSet is:
+ * * A doubly dimensioned array of Range2dSearchInterface.
+ * * Each entry represents a block in a uniform grid within the master range.
  * * Member ranges are noted in the grid block containing the range's lower left corner.
  * * Member ranges larger than twice the grid size are rejected by the insert method.
  * * 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)
- * @internal
+ * @public
  */
 export class GriddedRaggedRange2dSet {
     constructor(range, numXEdge, numYEdge) {
@@ -31,9 +32,9 @@ export class GriddedRaggedRange2dSet {
     }
     /**
      * Create an (empty) set of ranges.
-     * @param range
-     * @param numXEdge
-     * @param numYEdge
+     * @param range master range
+     * @param numXEdge size of grid in x direction
+     * @param numYEdge size of grid in y direction
      */
     static create(range, numXEdge, numYEdge) {
         if (numXEdge < 1 || numYEdge < 1 || range.isNull || range.isSinglePoint)
@@ -57,13 +58,13 @@ export class GriddedRaggedRange2dSet {
         return undefined;
     }
     /** If possible, insert a range into the set.
-     * * Decline to insert (and return false) if
-     *   * range is null
-     *   * range is not completely contained in the overall range of this set.
-     *   * range x or y extent is larger than 2 grid blocks.
+     * * Decline to insert (and return false) if:
+     *    * range is null
+     *    * range is not completely contained in the overall range of this set
+     *    * range x or y extent is larger than 2 grid blocks
      */
     conditionalInsert(range, tag) {
-        if (range.isNull)
+        if (Range2d.isNull(range))
             return false;
         if (!this._range.containsRange(range))
             return false;
@@ -82,6 +83,10 @@ export class GriddedRaggedRange2dSet {
         }
         return false;
     }
+    /** Add a range to the search set. */
+    addRange(range, tag) {
+        this.conditionalInsert(range, tag);
+    }
     /**
      * * Search a single block
      * * Pass each range and tag to handler
@@ -147,6 +152,19 @@ export class GriddedRaggedRange2dSet {
         }
         return true;
     }
+    /** Return the overall range of all members. */
+    totalRange(result) {
+        if (result)
+            result.setNull();
+        else
+            result = Range2d.createNull();
+        this.visitChildren(0, (_depth, child) => {
+            const childRange = GriddedRaggedRange2dSet._workRange = child.totalRange(GriddedRaggedRange2dSet._workRange);
+            result.extendRange(childRange);
+        });
+        return result;
+    }
+    /** Call the handler on each defined block in the grid. */
     visitChildren(initialDepth, handler) {
         for (const row of this._rangesInBlock) {
             for (const block of row) {

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;AAIH,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAGtE;;;;;;;;GAQG;AACH,MAAM,OAAO,uBAAuB;IAQlC,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,GAA+C,EAAE,CAAC;YAC/D,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,KAAwB,EAAE,GAAM;QACvD,IAAI,KAAK,CAAC,MAAM;YACd,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;;;;;;;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;IACM,aAAa,CAAC,YAAoB,EAAE,OAAoE;QAC7G,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\n\r\nexport type OptionalLinearSearchRange2dArray<T> = LinearSearchRange2dArray<T> | undefined;\r\n/**\r\n * A GriddedRaggedRange2dSet is\r\n * * A doubly dimensioned array of LinearSearchRange2dArray\r\n * * Each entry represents a block in a uniform grid within the master range of the GriddedRaggedRange2dSet.\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 * @internal\r\n */\r\nexport class GriddedRaggedRange2dSet<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   *\r\n   */\r\n  private _rangesInBlock: Array<Array<OptionalLinearSearchRange2dArray<T>>>;\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<OptionalLinearSearchRange2dArray<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\r\n   * @param numXEdge\r\n   * @param numYEdge\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): LinearSearchRange2dArray<T> | undefined {\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, tag: T): boolean {\r\n    if (range.isNull)\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  /**\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  public visitChildren(initialDepth: number, handler: (depth: number, child: LinearSearchRange2dArray<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;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":["/*---------------------------------------------------------------------------------------------\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 { Range2d, Range3d } from \"../../geometry3d/Range\";\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\nimport { LinearSearchRange2dArray } from \"./LinearSearchRange2dArray\";\nimport { Range2dSearchInterface } from \"./Range2dSearchInterface\";\n\n/**\n * Type abbreviation to allow undefined as a Range2dSearchInterface parameter.\n * @internal\n */\nexport type OptionalRange2dSearchInterface<T> = Range2dSearchInterface<T> | undefined;\n\n/**\n * A GriddedRaggedRange2dSet is:\n * * A doubly dimensioned array of Range2dSearchInterface.\n * * Each entry represents a block in a uniform grid within the master range.\n * * Member ranges are noted in the grid block containing the range's lower left corner.\n * * Member ranges larger than twice the grid size are rejected by the insert method.\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)\n * @public\n */\nexport class GriddedRaggedRange2dSet<T> implements Range2dSearchInterface<T> {\n  private _range: Range2d;\n  private _numXEdge: number;\n  private _numYEdge: number;\n  /** Each grid block is a simple linear search set */\n  private _rangesInBlock: Array<Array<OptionalRange2dSearchInterface<T>>>;\n  private static _workRange?: Range2d;\n  private constructor(range: Range2d, numXEdge: number, numYEdge: number) {\n    this._range = range;\n    this._numXEdge = numXEdge;\n    this._numYEdge = numYEdge;\n    this._rangesInBlock = [];\n    for (let j = 0; j < this._numYEdge; j++) {\n      const thisRow: Array<OptionalRange2dSearchInterface<T>> = [];\n      for (let i = 0; i < this._numXEdge; i++) {\n        thisRow.push(undefined);\n      }\n      this._rangesInBlock.push(thisRow);\n    }\n  }\n  /**\n   * Create an (empty) set of ranges.\n   * @param range master range\n   * @param numXEdge size of grid in x direction\n   * @param numYEdge size of grid in y direction\n   */\n  public static create<T>(range: Range2d, numXEdge: number, numYEdge: number): GriddedRaggedRange2dSet<T> | undefined {\n    if (numXEdge < 1 || numYEdge < 1 || range.isNull || range.isSinglePoint)\n      return undefined;\n    return new GriddedRaggedRange2dSet(range.clone(), numXEdge, numYEdge);\n  }\n  private xIndex(x: number): number {\n    const fraction = (x - this._range.low.x) / (this._range.high.x - this._range.low.x);\n    return Math.floor(fraction * this._numXEdge);\n  }\n  private yIndex(y: number): number {\n    const fraction = (y - this._range.low.y) / (this._range.high.y - this._range.low.y);\n    return Math.floor(fraction * this._numXEdge);\n  }\n  private getBlock(i: number, j: number): OptionalRange2dSearchInterface<T> {\n    if (i >= 0 && i < this._numXEdge && j >= 0 && j < this._numYEdge) {\n      if (!this._rangesInBlock[j][i])\n        this._rangesInBlock[j][i] = new LinearSearchRange2dArray();\n      return this._rangesInBlock[j][i];\n    }\n    return undefined;\n  }\n  /** If possible, insert a range into the set.\n   * * Decline to insert (and return false) if:\n   *    * range is null\n   *    * range is not completely contained in the overall range of this set\n   *    * range x or y extent is larger than 2 grid blocks\n   */\n  public conditionalInsert(range: Range2d | Range3d | LowAndHighXY, tag: T): boolean {\n    if (Range2d.isNull(range))\n      return false;\n    if (!this._range.containsRange(range))\n      return false;\n    const xIndex0 = this.xIndex(range.low.x);\n    const xIndex1 = this.xIndex(range.high.x);\n    const yIndex0 = this.yIndex(range.low.y);\n    const yIndex1 = this.yIndex(range.high.y);\n    if (!(xIndex0 === xIndex1 || xIndex0 + 1 === xIndex1))\n      return false;\n    if (!(yIndex0 === yIndex1 || yIndex0 + 1 === yIndex1))\n      return false;\n    const rangesInBlock = this.getBlock(xIndex0, yIndex0);\n    if (rangesInBlock) {\n      rangesInBlock.addRange(range, tag);\n      return true;\n    }\n    return false;\n  }\n  /** Add a range to the search set. */\n  public addRange(range: LowAndHighXY, tag: T): void {\n    this.conditionalInsert(range, tag);\n  }\n  /**\n   * * Search a single block\n   * * Pass each range and tag to handler\n   * * and return false if bad cell or if handler returns false.\n   * @param testRange search range.\n   * @param handler function to receive range and tag hits.\n   * @return false if search terminated by handler.  Return true if no handler returned false.\n   */\n  private searchXYInIndexedBlock(i: number, j: number, x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\n    const rangesInBlock = this.getBlock(i, j);\n    if (!rangesInBlock)\n      return true;\n    return rangesInBlock.searchXY(x, y, handler);\n  }\n  /**\n   * * Search a single block\n   * * Pass each range and tag to handler\n   * * and return false if bad cell or if handler returns false.\n   * @param testRange search range.\n   * @param handler function to receive range and tag hits.\n   * @return false if search terminated by handler.  Return true if no handler returned false.\n   */\n  private searchRange2dInIndexedBlock(i: number, j: number, testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\n    const rangesInBlock = this.getBlock(i, j);\n    if (!rangesInBlock)\n      return true;\n    return rangesInBlock.searchRange2d(testRange, handler);\n  }\n  /**\n   * * Search for ranges containing testRange\n   * * Pass each range and tag to handler\n   * * terminate search if handler returns false.\n   * @param testRange search range.\n   * @param handler function to receive range and tag hits.\n   * @return false if search terminated by handler.  Return true if no handler returned false.\n   */\n  public searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\n    const i = this.xIndex(x);\n    const j = this.yIndex(y);\n    return this.searchXYInIndexedBlock(i, j, x, y, handler)\n      && this.searchXYInIndexedBlock(i - 1, j, x, y, handler)\n      && this.searchXYInIndexedBlock(i, j - 1, x, y, handler)\n      && this.searchXYInIndexedBlock(i - 1, j - 1, x, y, handler);\n  }\n  /**\n   * * Search for ranges overlapping testRange\n   * * Pass each range and tag to handler\n   * * terminate search if handler returns false.\n   * @param testRange search range.\n   * @param handler function to receive range and tag hits.\n   * @return false if search terminated by handler.  Return true if no handler returned false.\n   */\n  public searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\n    const xIndex0 = this.xIndex(testRange.low.x) - 1;\n    const xIndex1 = this.xIndex(testRange.high.x);\n    const yIndex0 = this.yIndex(testRange.low.y) - 1;\n    const yIndex1 = this.yIndex(testRange.high.y);\n    for (let i = xIndex0; i <= xIndex1; i++) {\n      for (let j = yIndex0; j <= yIndex1; j++) {\n        if (!this.searchRange2dInIndexedBlock(i, j, testRange, handler))\n          return false;\n      }\n    }\n    return true;\n  }\n  /** Return the overall range of all members. */\n  public totalRange(result?: Range2d): Range2d {\n    if (result)\n      result.setNull();\n    else\n      result = Range2d.createNull();\n    this.visitChildren(0, (_depth, child) => {\n      const childRange = GriddedRaggedRange2dSet._workRange = child.totalRange(GriddedRaggedRange2dSet._workRange);\n      result!.extendRange(childRange);\n    });\n    return result;\n  }\n  /** Call the handler on each defined block in the grid. */\n  public visitChildren(initialDepth: number, handler: (depth: number, child: Range2dSearchInterface<T>) => void) {\n    for (const row of this._rangesInBlock) {\n      for (const block of row) {\n        if (block)\n          handler(initialDepth, block);\n      }\n    }\n  }\n}\n"]}

package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.d.ts

@@ -1,20 +1,21 @@
 /** @packageDocumentation
  * @module RangeSearch
  */
-import { Range2d, Range3d } from "../../geometry3d/Range";
+import { Range2d } from "../../geometry3d/Range";
 import { LowAndHighXY } from "../../geometry3d/XYZProps";
-import { LinearSearchRange2dArray } from "./LinearSearchRange2dArray";
+import { Range2dSearchInterface } from "./Range2dSearchInterface";
 /**
- * Use GriddedRaggedRange2dSetWithOverflow for searching among many ranges for which
+ * Use GriddedRaggedRange2dSetWithOverflow for searching among many ranges for which:
  * * Most ranges are of somewhat consistent size.
  * * A modest number of oversizes.
  * * Maintain the smallish ones in a GriddedRaggedRange2dSet.
- * * Maintain the overflows in a LinearSearchRange2dArray
- * @internal
+ * * Maintain the overflows in a Range2dSearchInterface.
+ * @public
  */
-export declare class GriddedRaggedRange2dSetWithOverflow<T> {
+export declare class GriddedRaggedRange2dSetWithOverflow<T> implements Range2dSearchInterface<T> {
     private _gridSet;
     private _overflowSet;
+    private static _workRange?;
     private constructor();
     /**
      * Create an (empty) set of ranges.
@@ -47,7 +48,10 @@ export declare class GriddedRaggedRange2dSetWithOverflow<T> {
      *   * range is not completely contained in the overall range of this set.
      *   * range x or y extent is larger than 2 grid blocks.
      */
-    addRange(range: Range2d | Range3d, tag: T): void;
-    visitChildren(initialDepth: number, handler: (depth: number, child: LinearSearchRange2dArray<T>) => void): void;
+    addRange(range: LowAndHighXY, tag: T): void;
+    /** Return the overall range of all members. */
+    totalRange(result?: Range2d): Range2d;
+    /** Call the handler on the overflow set, and on each defined block in the grid. */
+    visitChildren(initialDepth: number, handler: (depth: number, child: Range2dSearchInterface<T>) => void): void;
 }
 //# sourceMappingURL=GriddedRaggedRange2dSetWithOverflow.d.ts.map

package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GriddedRaggedRange2dSetWithOverflow.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAEtE;;;;;;;GAOG;AACH,qBAAa,mCAAmC,CAAC,CAAC;IAChD,OAAO,CAAC,QAAQ,CAA6B;IAC7C,OAAO,CAAC,YAAY,CAA8B;IAClD,OAAO;IAIP;;;;;OAKG;WACW,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,mCAAmC,CAAC,CAAC,CAAC,GAAG,SAAS;IAM/H;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAG5F;;;;;;;OAOG;IACI,aAAa,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAGpG;;;;;OAKG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI;IAMhD,aAAa,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,wBAAwB,CAAC,CAAC,CAAC,KAAK,IAAI;CAIhH"}
+{"version":3,"file":"GriddedRaggedRange2dSetWithOverflow.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAGzD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;;;GAOG;AACH,qBAAa,mCAAmC,CAAC,CAAC,CAAE,YAAW,sBAAsB,CAAC,CAAC,CAAC;IACtF,OAAO,CAAC,QAAQ,CAA6B;IAC7C,OAAO,CAAC,YAAY,CAA4B;IAChD,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAU;IACpC,OAAO;IAIP;;;;;OAKG;WACW,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,mCAAmC,CAAC,CAAC,CAAC,GAAG,SAAS;IAM/H;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAG5F;;;;;;;OAOG;IACI,aAAa,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAGpG;;;;;OAKG;IACI,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI;IAMlD,+CAA+C;IACxC,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAW5C,mFAAmF;IAC5E,aAAa,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,sBAAsB,CAAC,CAAC,CAAC,KAAK,IAAI;CAI9G"}

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

@@ -5,15 +5,16 @@
 /** @packageDocumentation
  * @module RangeSearch
  */
+import { Range2d } from "../../geometry3d/Range";
 import { GriddedRaggedRange2dSet } from "./GriddedRaggedRange2dSet";
 import { LinearSearchRange2dArray } from "./LinearSearchRange2dArray";
 /**
- * Use GriddedRaggedRange2dSetWithOverflow for searching among many ranges for which
+ * Use GriddedRaggedRange2dSetWithOverflow for searching among many ranges for which:
  * * Most ranges are of somewhat consistent size.
  * * A modest number of oversizes.
  * * Maintain the smallish ones in a GriddedRaggedRange2dSet.
- * * Maintain the overflows in a LinearSearchRange2dArray
- * @internal
+ * * Maintain the overflows in a Range2dSearchInterface.
+ * @public
  */
 export class GriddedRaggedRange2dSetWithOverflow {
     constructor(gridSet, overflowSet) {
@@ -61,11 +62,24 @@ export class GriddedRaggedRange2dSetWithOverflow {
      *   * range x or y extent is larger than 2 grid blocks.
      */
     addRange(range, tag) {
-        if (!range.isNull) {
+        if (!Range2d.isNull(range)) {
             if (!this._gridSet.conditionalInsert(range, tag))
                 this._overflowSet.addRange(range, tag);
         }
     }
+    /** Return the overall range of all members. */
+    totalRange(result) {
+        if (result)
+            result.setNull();
+        else
+            result = Range2d.createNull();
+        this.visitChildren(0, (_depth, child) => {
+            const childRange = GriddedRaggedRange2dSetWithOverflow._workRange = child.totalRange(GriddedRaggedRange2dSetWithOverflow._workRange);
+            result.extendRange(childRange);
+        });
+        return result;
+    }
+    /** Call the handler on the overflow set, and on each defined block in the grid. */
     visitChildren(initialDepth, handler) {
         handler(initialDepth, this._overflowSet);
         this._gridSet.visitChildren(initialDepth + 1, handler);

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;AAIH,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AACpE,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAEtE;;;;;;;GAOG;AACH,MAAM,OAAO,mCAAmC;IAG9C,YAAoB,OAAmC,EAAE,WAAwC;QAC/F,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,KAAwB,EAAE,GAAM;QAC9C,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YACjB,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;IACM,aAAa,CAAC,YAAoB,EAAE,OAAoE;QAC7G,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, Range3d } from \"../../geometry3d/Range\";\r\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\r\nimport { GriddedRaggedRange2dSet } from \"./GriddedRaggedRange2dSet\";\r\nimport { LinearSearchRange2dArray } from \"./LinearSearchRange2dArray\";\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 LinearSearchRange2dArray\r\n * @internal\r\n */\r\nexport class GriddedRaggedRange2dSetWithOverflow<T> {\r\n  private _gridSet: GriddedRaggedRange2dSet<T>;\r\n  private _overflowSet: LinearSearchRange2dArray<T>;\r\n  private constructor(gridSet: GriddedRaggedRange2dSet<T>, overflowSet: LinearSearchRange2dArray<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: Range2d | Range3d, tag: T): void {\r\n    if (!range.isNull) {\r\n      if (!this._gridSet.conditionalInsert(range, tag))\r\n        this._overflowSet.addRange(range, tag);\r\n    }\r\n  }\r\n  public visitChildren(initialDepth: number, handler: (depth: number, child: LinearSearchRange2dArray<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;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":["/*---------------------------------------------------------------------------------------------\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 { Range2d } from \"../../geometry3d/Range\";\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\nimport { GriddedRaggedRange2dSet } from \"./GriddedRaggedRange2dSet\";\nimport { LinearSearchRange2dArray } from \"./LinearSearchRange2dArray\";\nimport { Range2dSearchInterface } from \"./Range2dSearchInterface\";\n\n/**\n * Use GriddedRaggedRange2dSetWithOverflow for searching among many ranges for which:\n * * Most ranges are of somewhat consistent size.\n * * A modest number of oversizes.\n * * Maintain the smallish ones in a GriddedRaggedRange2dSet.\n * * Maintain the overflows in a Range2dSearchInterface.\n * @public\n */\nexport class GriddedRaggedRange2dSetWithOverflow<T> implements Range2dSearchInterface<T> {\n  private _gridSet: GriddedRaggedRange2dSet<T>;\n  private _overflowSet: Range2dSearchInterface<T>;\n  private static _workRange?: Range2d;\n  private constructor(gridSet: GriddedRaggedRange2dSet<T>, overflowSet: Range2dSearchInterface<T>) {\n    this._gridSet = gridSet;\n    this._overflowSet = overflowSet;\n  }\n  /**\n   * Create an (empty) set of ranges.\n   * @param range\n   * @param numXEdge\n   * @param numYEdge\n   */\n  public static create<T>(range: Range2d, numXEdge: number, numYEdge: number): GriddedRaggedRange2dSetWithOverflow<T> | undefined {\n    const grids = GriddedRaggedRange2dSet.create<T>(range.clone(), numXEdge, numYEdge);\n    if (grids)\n      return new GriddedRaggedRange2dSetWithOverflow<T>(grids, new LinearSearchRange2dArray<T>());\n    return undefined;\n  }\n  /**\n   * * Search for ranges containing testRange\n   * * Pass each range and tag to handler\n   * * terminate search if handler returns false.\n   * @param testRange search range.\n   * @param handler function to receive range and tag hits.\n   * @return false if search terminated by handler.  Return true if no handler returned false.\n   */\n  public searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\n    return this._gridSet.searchXY(x, y, handler) && this._overflowSet.searchXY(x, y, handler);\n  }\n  /**\n   * * Search for ranges overlapping testRange\n   * * Pass each range and tag to handler\n   * * terminate search if handler returns false.\n   * @param testRange search range.\n   * @param handler function to receive range and tag hits.\n   * @return false if search terminated by handler.  Return true if no handler returned false.\n   */\n  public searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\n    return this._gridSet.searchRange2d(testRange, handler) && this._overflowSet.searchRange2d(testRange, handler);\n  }\n  /** If possible, insert a range into the set.\n   * * Decline to insert (and return false) if\n   *   * range is null\n   *   * range is not completely contained in the overall range of this set.\n   *   * range x or y extent is larger than 2 grid blocks.\n   */\n  public addRange(range: LowAndHighXY, tag: T): void {\n    if (!Range2d.isNull(range)) {\n      if (!this._gridSet.conditionalInsert(range, tag))\n        this._overflowSet.addRange(range, tag);\n    }\n  }\n  /** Return the overall range of all members. */\n  public totalRange(result?: Range2d): Range2d {\n    if (result)\n      result.setNull();\n    else\n      result = Range2d.createNull();\n    this.visitChildren(0, (_depth, child) => {\n      const childRange = GriddedRaggedRange2dSetWithOverflow._workRange = child.totalRange(GriddedRaggedRange2dSetWithOverflow._workRange);\n      result!.extendRange(childRange);\n    });\n    return result;\n  }\n  /** Call the handler on the overflow set, and on each defined block in the grid. */\n  public visitChildren(initialDepth: number, handler: (depth: number, child: Range2dSearchInterface<T>) => void) {\n    handler(initialDepth, this._overflowSet);\n    this._gridSet.visitChildren(initialDepth + 1, handler);\n  }\n}\n"]}

package/lib/esm/polyface/multiclip/LinearSearchRange2dArray.d.ts

@@ -5,11 +5,10 @@ import { Range2d } from "../../geometry3d/Range";
 import { LowAndHighXY } from "../../geometry3d/XYZProps";
 import { Range2dSearchInterface } from "./Range2dSearchInterface";
 /**
- * * Array of Range2d
- * * user data tag attached to each range via cast as (any).userTag.
+ * An array of decorated Range2d.
+ * * User data is attached to each range via `(myRange as any).tag = myTag`.
  * * Search operations are simple linear.
  * * This class can be used directly for "smallish" range sets, or as the leaf level of hierarchical structures for larger range sets.
- * *
  * @internal
  */
 export declare class LinearSearchRange2dArray<T> implements Range2dSearchInterface<T> {
@@ -18,7 +17,7 @@ export declare class LinearSearchRange2dArray<T> implements Range2dSearchInterfa
     private _compositeRange;
     constructor();
     private updateForSearch;
-    /** Return the overall range of all member ranges. */
+    /** Return the overall range of all members. */
     totalRange(result?: Range2d): Range2d;
     /** Add a range to the search set. */
     addRange(range: LowAndHighXY, tag: T): void;

package/lib/esm/polyface/multiclip/LinearSearchRange2dArray.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"LinearSearchRange2dArray.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/LinearSearchRange2dArray.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;;;GAOG;AACH,qBAAa,wBAAwB,CAAC,CAAC,CAAE,YAAW,sBAAsB,CAAC,CAAC,CAAC;IAC3E,OAAO,CAAC,WAAW,CAAY;IAC/B,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,eAAe,CAAU;;IAOjC,OAAO,CAAC,eAAe;IAGvB,qDAAqD;IAC9C,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAI5C,qCAAqC;IAC9B,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC;IAS3C;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAW5F;;;;;;;OAOG;IACI,aAAa,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;CAUrG"}
+{"version":3,"file":"LinearSearchRange2dArray.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/LinearSearchRange2dArray.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;;GAMG;AACH,qBAAa,wBAAwB,CAAC,CAAC,CAAE,YAAW,sBAAsB,CAAC,CAAC,CAAC;IAC3E,OAAO,CAAC,WAAW,CAAY;IAC/B,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,eAAe,CAAU;;IAOjC,OAAO,CAAC,eAAe;IAGvB,+CAA+C;IACxC,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG5C,qCAAqC;IAC9B,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI;IASlD;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAW5F;;;;;;;OAOG;IACI,aAAa,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;CAUrG"}