@itwin/core-geometry 4.0.0-dev.23 → 4.0.0-dev.28

package/lib/cjs/geometry3d/BarycentricTriangle.js.map

@@ -1 +1 @@
-{"version":3,"file":"BarycentricTriangle.js","sourceRoot":"","sources":["../../../src/geometry3d/BarycentricTriangle.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AACvC,uDAAsD;AAEtD;;;GAGG;AACH,MAAa,mBAAmB;IAG9B;;OAEG;IACH,YAAsB,MAAe,EAAE,MAAe,EAAE,MAAe;QACrE,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,MAA4B;QACpK,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,yBAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,yBAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACjH,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,mEAAmE;IAC5D,MAAM,CAAC,MAAM,CAAC,MAAe,EAAE,MAAe,EAAE,MAAe,EAAE,MAA4B;QAClG,IAAI,CAAC,MAAM;YACT,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oEAAoE;IAC7D,KAAK,CAAC,MAA4B;QACvC,OAAO,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC5F,CAAC;IAED,qDAAqD;IACrD,IAAW,WAAW;QACpB,OAAO,mBAAQ,CAAC,kBAAkB,CAAC,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,6BAA6B,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EACnH,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3J,CAAC;IACD,uCAAuC;IACvC,IAAW,IAAI;QACb,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,6BAA6B,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,CAAC;IACD;;;OAGG;IACI,eAAe,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,MAAgB;QACzE,OAAO,yBAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IACtG,CAAC;IAED;OACG;IACI,OAAO,CAAC,KAA0B;QACvC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,2DAA2D;IACpD,GAAG,CAAC,MAA2B,EAAE,MAA2B,EAAE,MAA2B;QAC9F,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IAExC,CAAC;IAGD;;;OAGG;IACI,mCAAmC,CAAC,KAA0B;QACnE,mBAAmB,CAAC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACzI,mBAAmB,CAAC,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC;QAC5I,OAAO,mBAAmB,CAAC,YAAY,CAAC,UAAU,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;IACvF,CAAC;IACD,2CAA2C;IACpC,QAAQ,CAAC,MAAgB;QAC9B,gDAAgD;QAChD,kHAAkH;QAClH,OAAO,yBAAO,CAAC,MAAM,CACnB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAC9D,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAC9D,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAC9D,MAAM,CAAC,CAAC;IACZ,CAAC;IACD,4DAA4D;IACrD,aAAa,CAAC,KAA0B;QAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;eAC/C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;eAC7C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;CACF;AA9FD,kDA8FC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\n\n/**\n * 3 points defining a triangle to be evaluated with Barycentric coordinates.\n * @public\n */\nexport class BarycentricTriangle {\n  /** Array of 3 point coordinates for the triangle. */\n  public points: Point3d[];\n  /** Constructor.\n   * * Point references are CAPTURED\n   */\n  protected constructor(point0: Point3d, point1: Point3d, point2: Point3d) {\n    this.points = [];\n    this.points.push(point0);\n    this.points.push(point1);\n    this.points.push(point2);\n  }\n\n  /**\n   * Return a `BarycentricTriangle` with coordinates given by enumerated x,y,z of the 3 points.\n   * @param result optional pre-allocated triangle.\n   */\n  public static createXYZXYZXYZ(x0: number, y0: number, z0: number, x1: number, y1: number, z1: number, x2: number, y2: number, z2: number, result?: BarycentricTriangle): BarycentricTriangle {\n    if (!result) return new this(Point3d.create(x0, y0, z0), Point3d.create(x1, y1, z1), Point3d.create(x2, y2, z2));\n    result.points[0].set(x0, y0, z0);\n    result.points[1].set(x1, y1, z1);\n    result.points[2].set(x2, y2, z2);\n    return result;\n  }\n  /** create a triangle with coordinates cloned from given points. */\n  public static create(point0: Point3d, point1: Point3d, point2: Point3d, result?: BarycentricTriangle): BarycentricTriangle {\n    if (!result)\n      return new this(point0.clone(), point1.clone(), point2.clone());\n    result.set(point0, point1, point2);\n    return result;\n  }\n  /** Return a new `BarycentricTriangle` with the same coordinates. */\n  public clone(result?: BarycentricTriangle): BarycentricTriangle {\n    return BarycentricTriangle.create(this.points[0], this.points[1], this.points[2], result);\n  }\n\n  /** Return area divided by sum of squared lengths. */\n  public get aspectRatio(): number {\n    return Geometry.safeDivideFraction(0.5 * this.points[0].crossProductToPointsMagnitude(this.points[1], this.points[2]),\n      (this.points[0].distanceSquared(this.points[1]) + this.points[1].distanceSquared(this.points[2]) + this.points[2].distanceSquared(this.points[0])), 0);\n  }\n  /** Return the area of the triangle. */\n  public get area(): number {\n    return 0.5 * this.points[0].crossProductToPointsMagnitude(this.points[1], this.points[2]);\n  }\n  /** Sum the points with given scales.\n   * * In normal use, the scales will add to 1 and the result point is in the plane of the triangle.\n   * * If scales do not add to 1, the point is in the triangle scaled (by the scale sum) from the origin.\n   */\n  public fractionToPoint(a0: number, a1: number, a2: number, result?: Point3d): Point3d {\n    return Point3d.createAdd3Scaled(this.points[0], a0, this.points[1], a1, this.points[2], a2, result);\n  }\n\n  /** Copy all values from `other`\n   */\n  public setFrom(other: BarycentricTriangle) {\n    this.points[0].setFromPoint3d(other.points[0]);\n    this.points[1].setFromPoint3d(other.points[1]);\n    this.points[2].setFromPoint3d(other.points[2]);\n  }\n  /** copy contents of (not pointers to) the given points. */\n  public set(point0: Point3d | undefined, point1: Point3d | undefined, point2: Point3d | undefined) {\n    this.points[0].setFromPoint3d(point0);\n    this.points[1].setFromPoint3d(point1);\n    this.points[2].setFromPoint3d(point2);\n\n  }\n  private static _workVector0?: Vector3d;\n  private static _workVector1?: Vector3d;\n  /**\n   * * For `this` and `other` BarycentricTriangles, compute cross products of vectors from point0 to point1 and from point0 to point2.\n   * * return the dot product of those two\n   */\n  public dotProductOfCrossProductsFromOrigin(other: BarycentricTriangle): number {\n    BarycentricTriangle._workVector0 = this.points[0].crossProductToPoints(this.points[1], this.points[2], BarycentricTriangle._workVector0);\n    BarycentricTriangle._workVector1 = other.points[0].crossProductToPoints(other.points[1], other.points[2], BarycentricTriangle._workVector1);\n    return BarycentricTriangle._workVector0.dotProduct(BarycentricTriangle._workVector1);\n  }\n  /** Return the centroid of the 3 points. */\n  public centroid(result?: Point3d): Point3d {\n    // write it out to get single scale application.\n    // Do the scale as true division (rather than multiply by precomputed 1/3).  This might protect one bit of result.\n    return Point3d.create(\n      (this.points[0].x + this.points[1].x + this.points[2].x) / 3.0,\n      (this.points[0].y + this.points[1].y + this.points[2].y) / 3.0,\n      (this.points[0].z + this.points[1].z + this.points[2].z) / 3.0,\n      result);\n  }\n  /** test for point-by-point `isAlmostEqual` relationship. */\n  public isAlmostEqual(other: BarycentricTriangle): boolean {\n    return this.points[0].isAlmostEqual(other.points[0])\n      && this.points[1].isAlmostEqual(other.points[1])\n      && this.points[2].isAlmostEqual(other.points[2]);\n  }\n}\n"]}
+{"version":3,"file":"BarycentricTriangle.js","sourceRoot":"","sources":["../../../src/geometry3d/BarycentricTriangle.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAC7C,0CAAwD;AACxD,yCAAsC;AACtC,uDAAsD;AACtD,mCAAgC;AAEhC;;;;;;;;;;;;;;GAcG;AACH,MAAa,sBAAsB;IAYjC;QACE,IAAI,CAAC,KAAK,GAAG,IAAI,yBAAO,EAAE,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,yBAAO,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;QACb,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,gBAAgB,GAAG,GAAG,CAAC;IAC9B,CAAC;IACD,8BAA8B;IACvB,UAAU;QACf,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;QACb,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,gBAAgB,GAAG,GAAG,CAAC;IAC9B,CAAC;IACD;;OAEG;IACI,MAAM,CAAC,MAAM,CAAC,MAA+B;QAClD,IAAI,SAAS,KAAK,MAAM;YACtB,MAAM,GAAG,IAAI,sBAAsB,EAAE,CAAC;;YAEtC,MAAM,CAAC,UAAU,EAAE,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;OAEG;IACI,gBAAgB,CAAC,KAA6B;QACnD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,CAAC;QAC/C,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC,gBAAgB,CAAC;IACjD,CAAC;IACD,sCAAsC;IACtC,IAAW,OAAO;QAChB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC5B,CAAC;IACD;;OAEG;IACH,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC;IAC3F,CAAC;IACD;;;OAGG;IACH,IAAW,QAAQ;QACjB,IAAI,CAAC,IAAI,CAAC,OAAO;YACf,OAAO,0BAAe,CAAC,OAAO,CAAC;QACjC,IAAI,IAAI,CAAC,YAAY,EAAE;YACrB,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG;gBAChC,EAAE,OAAO,CAAC;YACZ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG;gBAChC,EAAE,OAAO,CAAC;YACZ,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG;gBAChC,EAAE,OAAO,CAAC;YACZ,IAAI,CAAC,KAAK,OAAO;gBACf,OAAO,0BAAe,CAAC,eAAe,CAAC;YACzC,IAAI,CAAC,KAAK,OAAO;gBACf,OAAO,0BAAe,CAAC,qBAAqB,CAAC;YAC/C,OAAO,0BAAe,CAAC,mCAAmC,CAAC;SAC5D;QACD,OAAO,CAAC,IAAI,CAAC,gBAAgB,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,0BAAe,CAAC,8BAA8B,CAAC,CAAC,CAAC,0BAAe,CAAC,oCAAoC,CAAC;IACjJ,CAAC;CACF;AAhFD,wDAgFC;AAED;;;GAGG;AACH,MAAa,mBAAmB;IAO9B;;OAEG;IACH,YAAsB,MAAe,EAAE,MAAe,EAAE,MAAe;QACrE,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,MAA4B;QACpK,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,yBAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,yBAAO,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACjH,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,mEAAmE;IAC5D,MAAM,CAAC,MAAM,CAAC,MAAe,EAAE,MAAe,EAAE,MAAe,EAAE,MAA4B;QAClG,IAAI,CAAC,MAAM;YACT,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oEAAoE;IAC7D,KAAK,CAAC,MAA4B;QACvC,OAAO,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC5F,CAAC;IAED,qDAAqD;IACrD,IAAW,WAAW;QACpB,OAAO,mBAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtI,CAAC;IACD,uCAAuC;IACvC,IAAW,IAAI;QACb,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,6BAA6B,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,CAAC;IAED,2CAA2C;IAC3C,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IAED;;;;;;;;;OASG;IACI,eAAe,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,MAAgB;QACzE,OAAO,yBAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IACtG,CAAC;IAQD;;;;;;;;OAQG;IACI,eAAe,CAAC,KAAc,EAAE,MAA+B;QACpE,MAAM,MAAM,GAAG,mBAAmB,CAAC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;QAChG,IAAI,SAAS,KAAK,MAAM;YACtB,OAAO,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,mBAAmB,CAAC,QAAQ,GAAG,aAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,mBAAmB,CAAC,QAAQ,CAAC,CAAC;QACrG,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,6BAA6B;IACxE,CAAC;IAED,kEAAkE;IAC3D,MAAM,CAAC,yCAAyC,CAAC,SAAiB;QACvE,OAAO,mBAAQ,CAAC,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,kEAAkE;IAC3D,MAAM,CAAC,yCAAyC,CAAC,gBAAwB;QAC9E,OAAO,mBAAQ,CAAC,YAAY,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC;IACrD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,gBAAgB,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;QAC/D,OAAO,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,oBAAoB,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;QACnE,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,oBAAoB,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;QACpE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;YAC9B,OAAO,CAAC,CAAC;QACX,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC;YAC9B,OAAO,CAAC,CAAC;QACX,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC;YAC9B,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,sBAAsB,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;QACtE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;YAClB,OAAO,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;YAClB,OAAO,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;YAClB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,UAAU,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;QAC1D,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;YAClC,OAAO,CAAC,CAAC;QACX,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;YAClC,OAAO,CAAC,CAAC;QACX,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;YAClC,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,eAAe,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;QAC/D,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;YAC9B,OAAO,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC;YAC9B,OAAO,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC;YAC9B,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,oFAAoF;IAC5E,MAAM,CAAC,cAAc,CAAC,EAAiC;QAC7D,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,GAAG,GAAG,GAAG,EAAE;YACb,CAAC,GAAG,CAAC,CAAC;YACN,GAAG,GAAG,GAAG,CAAC;SACX;QACD,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;YACb,CAAC,GAAG,CAAC,CAAC;QACR,OAAO,CAAC,CAAC;IACX,CAAC;IAED,yGAAyG;IAClG,kBAAkB,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;QAC1D,OAAO,mBAAmB,CAAC,cAAc,CAAC,CAAC,CAAS,EAAE,EAAE;YACtD,MAAM,CAAC,GAAG,mBAAmB,CAAC,UAAU,GAAG,yBAAO,CAAC,UAAU,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;YAC9F,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAChB,OAAO,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACK,uBAAuB,CAAC,CAAS,EAAE,CAAW;QACpD,oCAAoC;QACpC,wGAAwG;QACxG,8BAA8B;QAC9B,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,+BAA+B,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAC3F,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU;QACpD,MAAM,CAAC,GAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC,CAAE,wBAAwB;QAC7C,IAAI,SAAS,GAAG,GAAG,CAAC;QACpB,IAAI,mBAAmB,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,uBAAuB;YAC7E,SAAS,GAAG,mBAAmB,CAAC,cAAc,CAAC,CAAC,CAAS,EAAE,EAAE;gBAC3D,wDAAwD;gBACxD,+DAA+D;gBAC/D,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa;YAC/D,CAAC,CAAC,CAAC;YACH,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;SACxD;aAAM,IAAI,CAAC,SAAS,GAAG,mBAAmB,CAAC,sBAAsB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,yCAAyC;YAC/H,SAAS,GAAG,mBAAQ,CAAC,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YACjD,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YACvD,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE;gBAClC,SAAS,GAAG,mBAAQ,CAAC,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;gBACjD,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;gBACvD,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE;oBAClC,SAAS,GAAG,GAAG,CAAC;oBAChB,SAAS,GAAG,mBAAmB,CAAC,yCAAyC,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;iBAChH;aACF;SACF;aAAM,IAAI,CAAC,SAAS,GAAG,mBAAmB,CAAC,oBAAoB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,uCAAuC;YAC3H,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YACvD,IAAI,SAAS,GAAG,CAAC,EAAE;gBACjB,SAAS,GAAG,GAAG,CAAC,CAAE,qBAAqB;aACxC;iBAAM,IAAI,SAAS,GAAG,CAAC,EAAE;gBACxB,SAAS,GAAG,GAAG,CAAC;gBAChB,SAAS,GAAG,mBAAQ,CAAC,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,wCAAwC;aAC3F;SACF;aAAM,IAAI,CAAC,SAAS,GAAG,mBAAmB,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE;YAC7E,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,mBAAmB,CAAC,yCAAyC,CAAC,SAAS,CAAC,CAAC,CAAC;SAC7F;aAAM,IAAI,CAAC,SAAS,GAAG,mBAAmB,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE;YACxE,SAAS,GAAG,GAAG,CAAC;YAChB,SAAS,GAAG,mBAAmB,CAAC,yCAAyC,CAAC,SAAS,CAAC,CAAC;SACtF;QACD,8DAA8D;QAC9D,IAAA,qBAAM,EAAC,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC,CAAC,CAAC;QAC9D,OAAO;YACL,gBAAgB,EAAE,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,yCAAyC,CAAC,SAAS,CAAC;YACjH,gBAAgB,EAAE,SAAS;SAC5B,CAAC;IACJ,CAAC;IACD;;;;;;;;MAQE;IACK,cAAc,CAAC,GAAU,EAAE,MAA+B;QAC/D,MAAM,GAAG,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/C,8GAA8G;QAC9G,0CAA0C;QAC1C,qFAAqF;QACrF,2BAA2B;QAC3B,oFAAoF;QACpF,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;QACtB,MAAM,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;QACxB,MAAM,CAAC,GAAG,mBAAmB,CAAC,YAAY,GAAG,0BAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACvI,MAAM,CAAC,GAAG,mBAAmB,CAAC,YAAY,GAAG,0BAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACvI,MAAM,CAAC,GAAG,mBAAmB,CAAC,WAAW,GAAG,mBAAQ,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,mBAAmB,CAAC,WAAW,CAAC,CAAC;QAC7G,MAAM,CAAC,GAAG,0BAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC,CAAE,oBAAoB;QAC9G,MAAM,QAAQ,GAAG,mBAAmB,CAAC,YAAY,CAAC,CAAE,oBAAoB;QACxE,IAAI,SAAS,KAAK,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,QAAQ,CAAC;YAC9C,OAAO,MAAM,CAAC,CAAE,UAAU;QAC5B,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;QACvB,GAAG,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxE,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QAChD,MAAM,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QAChD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;MASE;IACK,gBAAgB,CAAC,MAAe,EAAE,MAAe,EAAE,MAA+B;QACvF,mBAAmB,CAAC,QAAQ,GAAG,aAAK,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,mBAAmB,CAAC,QAAQ,CAAC,CAAC;QAClG,OAAO,IAAI,CAAC,cAAc,CAAC,mBAAmB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IACnE,CAAC;IAED;;;;;OAKG;IACI,kBAAkB,CAAC,QAAgC,EAAE,oBAA4B,mBAAQ,CAAC,mBAAmB,EAAE,qBAA6B,mBAAQ,CAAC,aAAa;QACvK,IAAI,CAAC,QAAQ,CAAC,OAAO;YACnB,OAAO,KAAK,CAAC;QACf,iGAAiG;QACjG,IAAI,kBAAkB,GAAG,GAAG,EAAE;YAC5B,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,MAAM,GAAG,GAAG,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvD,IAAI,eAAe,GAAG,GAAG,IAAI,eAAe,GAAG,kBAAkB,EAAE;oBACjE,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;oBAC7B,UAAU,EAAE,CAAC;iBACd;gBACD,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aAChC;YACD,IAAI,UAAU,GAAG,CAAC,IAAI,MAAM,GAAG,GAAG,EAAE;gBAClC,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;gBAC1C,IAAI,CAAC,KAAK,UAAU,EAAE;oBACpB,QAAQ,CAAC,gBAAgB,GAAG,mBAAmB,CAAC,yCAAyC,CAAC,mBAAmB,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACrL,QAAQ,CAAC,gBAAgB,GAAG,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC;iBAChF;qBAAM,EAAG,uBAAuB;oBAC/B,QAAQ,CAAC,gBAAgB,GAAG,mBAAmB,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACjH,QAAQ,CAAC,gBAAgB,GAAG,GAAG,CAAC;iBACjC;gBACD,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC3F,OAAO,IAAI,CAAC;aACb;SACF;QACD,4DAA4D;QAC5D,IAAI,iBAAiB,GAAG,GAAG,EAAE;YAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,gBAAgB,CAAC;YACpC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACtB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACtB,MAAM,cAAc,GAAG,mBAAmB,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,UAAU,CAAC,CAAC;YAC9J,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;YACrD,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,iBAAiB,EAAE;gBAC1C,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,QAAQ,CAAC,gBAAgB,CAAC,CAAC;gBACzD,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,CAAC;gBACnD,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAC7B,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;gBACvC,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;OACG;IACI,OAAO,CAAC,KAA0B;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;YAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;SAC5C;IACH,CAAC;IACD,6HAA6H;IACtH,GAAG,CAAC,MAA2B,EAAE,MAA2B,EAAE,MAA2B;QAC9F,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IACD;;;OAGG;IACI,mCAAmC,CAAC,KAA0B;QACnE,mBAAmB,CAAC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACzI,mBAAmB,CAAC,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,mBAAmB,CAAC,YAAY,CAAC,CAAC;QAC5I,OAAO,mBAAmB,CAAC,YAAY,CAAC,UAAU,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;IACvF,CAAC;IACD,2CAA2C;IACpC,QAAQ,CAAC,MAAgB;QAC9B,gDAAgD;QAChD,kHAAkH;QAClH,OAAO,yBAAO,CAAC,MAAM,CACnB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAC9D,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAC9D,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAC9D,MAAM,CAAC,CAAC;IACZ,CAAC;IAED,2CAA2C;IACpC,QAAQ,CAAC,MAAgB;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/D,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACvE,CAAC;IAED,+CAA+C;IACxC,YAAY,CAAC,MAAgB;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/D,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACvE,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,MAAiB;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC1F,IAAI,KAAK,CAAC,mBAAmB,EAAE;YAC7B,OAAO,KAAK,CAAC;QACf,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,4DAA4D;IACrD,aAAa,CAAC,KAA0B;QAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;eAC/C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;eAC7C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IAED;;OAEG;IACI,UAAU,CAAC,mBAA2B;QAC3C,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAChE,CAAC;IAED;;MAEE;IACK,iBAAiB,CAAC,mBAA2B;QAClD,OAAO,IAAI,CAAC,WAAW,CAAC,mBAAQ,CAAC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,wFAAwF;IACjF,+BAA+B,CAAC,eAAuB;QAC5D,MAAM,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAC5I,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU;QAC3F,uDAAuD;QACvD,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACpK,CAAC;CACF;AA/dD,kDA+dC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Geometry, PolygonLocation } from \"../Geometry\";\nimport { Matrix3d } from \"./Matrix3d\";\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\nimport { Ray3d } from \"./Ray3d\";\n\n/**\n * Carries data about a location in the plane of a triangle.\n * * Each instance carries both world and barycentric coordinates for the point, and provides query services on the latter.\n * * No tolerance is used when querying barycentric coordinates (e.g., `isInsideOrOn`, `classify`). Use `snapLocalToEdge`\n * to adjust the barycentric coordinates to a triangle edge if they lie within a parametric tolerance.\n *\n * Properties of the barycentric coordinates (b0, b1, b2) of a point p in the plane of a triangle T with vertices p0, p1, p2:\n * * 1 = b0 + b1 + b2\n * * p = b0 * p0 + b1 * p1 + b2 * p2\n * * If T is spanned by the vectors U=p1-p0 and V=p2-p0, then the vector P=p-p0 can be written P = b1 * U + b2 * V.\n * * The coordinates are all nonnegative if and only if p is inside or on T.\n * * Exactly one coordinate is zero if and only if p lies on an (infinitely extended) edge of T.\n * * Exactly two coordinates are zero if and only if p coincides with a vertex of T.\n * @public\n */\nexport class TriangleLocationDetail {\n  /** The Cartesian coordinates of the point p. */\n  public world: Point3d;\n  /** The barycentric coordinates of p with respect to the triangle. Assumed to sum to one. */\n  public local: Point3d;\n  /** Application-specific number */\n  public a: number;\n  /** Index of the triangle vertex at the base of the edge closest to p. */\n  public closestEdgeIndex: number;\n  /** The parameter along the closest edge of the projection of p. */\n  public closestEdgeParam: number;\n\n  private constructor() {\n    this.world = new Point3d();\n    this.local = new Point3d();\n    this.a = 0.0;\n    this.closestEdgeIndex = 0;\n    this.closestEdgeParam = 0.0;\n  }\n  /** Invalidate this detail. */\n  public invalidate() {\n    this.world.setZero();\n    this.local.setZero();\n    this.a = 0.0;\n    this.closestEdgeIndex = 0;\n    this.closestEdgeParam = 0.0;\n  }\n  /** Create an invalid detail.\n   * @param result optional pre-allocated object to fill and return\n   */\n  public static create(result?: TriangleLocationDetail): TriangleLocationDetail {\n    if (undefined === result)\n      result = new TriangleLocationDetail();\n    else\n      result.invalidate();\n    return result;\n  }\n  /** Set the instance contents from the other detail.\n   * @param other detail to clone\n   */\n  public copyContentsFrom(other: TriangleLocationDetail) {\n    this.world.setFrom(other.world);\n    this.local.setFrom(other.local);\n    this.a = other.a;\n    this.closestEdgeIndex = other.closestEdgeIndex;\n    this.closestEdgeParam = other.closestEdgeParam;\n  }\n  /** Whether this detail is invalid. */\n  public get isValid(): boolean {\n    return !this.local.isZero;\n  }\n  /** Queries the barycentric coordinates to determine whether this instance specifies a location inside or on the triangle.\n   * @see classify\n   */\n  public get isInsideOrOn(): boolean {\n    return this.isValid && this.local.x >= 0.0 && this.local.y >= 0.0 && this.local.z >= 0.0;\n  }\n  /** Queries this detail to classify the location of this instance with respect to the triangle.\n   * @returns location code\n   * @see isInsideOrOn\n   */\n  public get classify(): PolygonLocation {\n    if (!this.isValid)\n      return PolygonLocation.Unknown;\n    if (this.isInsideOrOn) {\n      let numZero = 0;\n      if (Math.abs(this.local.x) === 0.0)\n        ++numZero;\n      if (Math.abs(this.local.y) === 0.0)\n        ++numZero;\n      if (Math.abs(this.local.z) === 0.0)\n        ++numZero;\n      if (2 === numZero)\n        return PolygonLocation.OnPolygonVertex;\n      if (1 === numZero)\n        return PolygonLocation.OnPolygonEdgeInterior;\n      return PolygonLocation.InsidePolygonProjectsToEdgeInterior;\n    }\n    return (this.closestEdgeParam === 0.0) ? PolygonLocation.OutsidePolygonProjectsToVertex : PolygonLocation.OutsidePolygonProjectsToEdgeInterior;\n  }\n}\n\n/**\n * 3 points defining a triangle to be evaluated with barycentric coordinates.\n * @public\n */\nexport class BarycentricTriangle {\n  /** Array of 3 point coordinates for the triangle. */\n  public points: Point3d[];\n\n  /** Edge length squared cache, indexed by opposite vertex index */\n  protected edgeLength2: number[];\n\n  /** Constructor.\n   * * Point references are CAPTURED\n   */\n  protected constructor(point0: Point3d, point1: Point3d, point2: Point3d) {\n    this.points = [];\n    this.points.push(point0);\n    this.points.push(point1);\n    this.points.push(point2);\n    this.edgeLength2 = [];\n    this.edgeLength2.push(point1.distanceSquared(point2));\n    this.edgeLength2.push(point0.distanceSquared(point2));\n    this.edgeLength2.push(point0.distanceSquared(point1));\n  }\n\n  /**\n   * Return a `BarycentricTriangle` with coordinates given by enumerated x,y,z of the 3 points.\n   * @param result optional pre-allocated triangle.\n   */\n  public static createXYZXYZXYZ(x0: number, y0: number, z0: number, x1: number, y1: number, z1: number, x2: number, y2: number, z2: number, result?: BarycentricTriangle): BarycentricTriangle {\n    if (!result) return new this(Point3d.create(x0, y0, z0), Point3d.create(x1, y1, z1), Point3d.create(x2, y2, z2));\n    result.points[0].set(x0, y0, z0);\n    result.points[1].set(x1, y1, z1);\n    result.points[2].set(x2, y2, z2);\n    return result;\n  }\n  /** create a triangle with coordinates cloned from given points. */\n  public static create(point0: Point3d, point1: Point3d, point2: Point3d, result?: BarycentricTriangle): BarycentricTriangle {\n    if (!result)\n      return new this(point0.clone(), point1.clone(), point2.clone());\n    result.set(point0, point1, point2);\n    return result;\n  }\n  /** Return a new `BarycentricTriangle` with the same coordinates. */\n  public clone(result?: BarycentricTriangle): BarycentricTriangle {\n    return BarycentricTriangle.create(this.points[0], this.points[1], this.points[2], result);\n  }\n\n  /** Return area divided by sum of squared lengths. */\n  public get aspectRatio(): number {\n    return Geometry.safeDivideFraction(this.area, this.edgeLengthSquared(0) + this.edgeLengthSquared(1) + this.edgeLengthSquared(2), 0);\n  }\n  /** Return the area of the triangle. */\n  public get area(): number {\n    return 0.5 * this.points[0].crossProductToPointsMagnitude(this.points[1], this.points[2]);\n  }\n\n  /** Return the perimeter of the triangle */\n  public get perimeter(): number {\n    return this.edgeLength(0) + this.edgeLength(1) + this.edgeLength(2);\n  }\n\n  /** Sum the points with given scales.\n   * * If the scales sum to 1, they are barycentric coordinates, and hence the result point is in the plane of the triangle.\n   * * If the scales do not sum to 1, the point is in the triangle scaled (by the scale sum) from the origin.\n   * @param b0 scale to apply to vertex 0\n   * @param b1 scale to apply to vertex 1\n   * @param b2 scale to apply to vertex 2\n   * @param result optional pre-allocated point to fill and return\n   * @return linear combination of the vertices of this triangle\n   * @see pointToFraction\n   */\n  public fractionToPoint(b0: number, b1: number, b2: number, result?: Point3d): Point3d {\n    return Point3d.createAdd3Scaled(this.points[0], b0, this.points[1], b1, this.points[2], b2, result);\n  }\n\n  private static _workPoint?: Point3d;\n  private static _workVector0?: Vector3d;\n  private static _workVector1?: Vector3d;\n  private static _workRay?: Ray3d;\n  private static _workMatrix?: Matrix3d;\n\n  /** Compute the projection of the given point onto the plane of this triangle.\n   * @param point point p to project\n   * @param result optional pre-allocated object to fill and return\n   * @returns details d of the projection point P = `d.point`:\n   * * `d.isValid` returns true if and only if `this.normal()` is defined.\n   * * `d.classify` can be used to determine where P lies with respect to the triangle.\n   * * `d.a` is the signed projection distance: P = p + a * `this.normal()`.\n   * @see fractionToPoint\n   */\n  public pointToFraction(point: Point3d, result?: TriangleLocationDetail): TriangleLocationDetail {\n    const normal = BarycentricTriangle._workVector0 = this.normal(BarycentricTriangle._workVector0);\n    if (undefined === normal)\n      return TriangleLocationDetail.create(result);\n    const ray = BarycentricTriangle._workRay = Ray3d.create(point, normal, BarycentricTriangle._workRay);\n    return this.intersectRay3d(ray, result); // is free to use workVector0\n  }\n\n  /** Convert from opposite-vertex to start-vertex edge indexing. */\n  public static edgeOppositeVertexIndexToStartVertexIndex(edgeIndex: number): number {\n    return Geometry.cyclic3dAxis(edgeIndex + 1);\n  }\n\n  /** Convert from start-vertex to opposite-vertex edge indexing. */\n  public static edgeStartVertexIndexToOppositeVertexIndex(startVertexIndex: number): number {\n    return Geometry.cyclic3dAxis(startVertexIndex - 1);\n  }\n\n  /** Examine a point's barycentric coordinates to determine if it lies inside the triangle but not on an edge/vertex.\n   * * No parametric tolerance is used.\n   * * It is assumed b0 + b1 + b2 = 1.\n   * @returns whether the point with barycentric coordinates is strictly inside the triangle.\n   */\n  public static isInsideTriangle(b0: number, b1: number, b2: number): boolean {\n    return b0 > 0 && b1 > 0 && b2 > 0;\n  }\n\n  /** Examine a point's barycentric coordinates to determine if it lies inside the triangle or on an edge/vertex.\n   * * No parametric tolerance is used.\n   * * It is assumed b0 + b1 + b2 = 1.\n   * @returns whether the point with barycentric coordinates is inside or on the triangle.\n   */\n  public static isInsideOrOnTriangle(b0: number, b1: number, b2: number): boolean {\n    return b0 >= 0 && b1 >= 0 && b2 >= 0;\n  }\n\n  /** Examine a point's barycentric coordinates to determine if it lies \"outside\" an edge of the triangle.\n   * * No parametric tolerance is used.\n   * * It is assumed b0 + b1 + b2 = 1.\n   * @returns index of vertex/edge i for which b_i < 0 and b_j >= 0 and b_k >= 0, or -1\n   */\n  private static isInRegionBeyondEdge(b0: number, b1: number, b2: number): number {\n    if (b0 < 0 && b1 >= 0 && b2 >= 0)\n      return 0;\n    if (b0 >= 0 && b1 < 0 && b2 >= 0)\n      return 1;\n    if (b0 >= 0 && b1 >= 0 && b2 < 0)\n      return 2;\n    return -1;\n  }\n\n  /** Examine a point's barycentric coordinates to determine if it lies \"outside\" a vertex of the triangle.\n   * * No parametric tolerance is used.\n   * * It is assumed b0 + b1 + b2 = 1.\n   * @returns index of vertex i for which and b_j < 0 and b_k < 0, or -1\n   */\n  private static isInRegionBeyondVertex(b0: number, b1: number, b2: number): number {\n    if (b1 < 0 && b2 < 0)\n      return 0;\n    if (b0 < 0 && b2 < 0)\n      return 1;\n    if (b0 < 0 && b1 < 0)\n      return 2;\n    return -1;\n  }\n\n  /** Examine a point's barycentric coordinates to determine if it lies on a vertex of the triangle.\n   * * No parametric tolerance is used.\n   * * It is assumed b0 + b1 + b2 = 1.\n   * @returns index of vertex i for which b_i = 1 and b_j = b_k = 0, or -1\n   */\n  private static isOnVertex(b0: number, b1: number, b2: number): number {\n    if (b0 === 1 && b1 === 0 && b2 === 0)\n      return 0;\n    if (b0 === 0 && b1 === 1 && b2 === 0)\n      return 1;\n    if (b0 === 0 && b1 === 0 && b2 === 1)\n      return 2;\n    return -1;\n  }\n\n  /** Examine a point's barycentric coordinates to determine if it lies on a bounded edge of the triangle.\n   * * No parametric tolerance is used.\n   * * It is assumed b0 + b1 + b2 = 1.\n   * @returns index of vertex/edge i for which b_i = 0 and b_j > 0 and b_k > 0, or -1\n   */\n  private static isOnBoundedEdge(b0: number, b1: number, b2: number): number {\n    if (b0 === 0 && b1 > 0 && b2 > 0)\n      return 0;\n    if (b0 > 0 && b1 === 0 && b2 > 0)\n      return 1;\n    if (b0 > 0 && b1 > 0 && b2 === 0)\n      return 2;\n    return -1;\n  }\n\n  /** @returns edge/vertex index (0,1,2) for which the function has a minimum value */\n  private static indexOfMinimum(fn: (edgeIndex: number) => number): number {\n    let i = 0;\n    let min = fn(0);\n    const val = fn(1);\n    if (min > val) {\n      i = 1;\n      min = val;\n    }\n    if (min > fn(2))\n      i = 2;\n    return i;\n  }\n\n  /** Return the index of the closest triangle vertex to the point given by its barycentric coordinates. */\n  public closestVertexIndex(b0: number, b1: number, b2: number): number {\n    return BarycentricTriangle.indexOfMinimum((i: number) => {\n      const a = BarycentricTriangle._workPoint = Point3d.createZero(BarycentricTriangle._workPoint);\n      a.setAt(i, 1.0);\n      return this.distanceSquared(a.x, a.y, a.z, b0, b1, b2);\n    });\n  }\n\n  /** Compute the projection of barycentric point p onto the (unbounded) edge e_k(v_i,v_j) of the triangle T(v_i,v_j,v_k).\n   * @param k vertex v_k is opposite the edge e_k\n   * @param b barycentric coordinates of point to project\n   * @returns parameter s along e_k, such that:\n   * * the projection point is q = v_i + s * (v_j - v_i)\n   * * the barycentric coords of the projection are q_ijk = (1 - s, s, 0)\n   */\n  private computeProjectionToEdge(k: number, b: number[]): number {\n    // Let U=v_j-v_i and V=v_k-v_i. Then\n    // 0 = (p-q).(v_j-v_i) = ((p-v_i)-(q-v_i)).(v_j-v_i) = (b[j]U + b[k]V - sU).U = b[j]U.U + b[k]U.V - sU.U\n    // Thus s = b[j] + b[k]U.V/U.U\n    k = Geometry.cyclic3dAxis(k);\n    const i = Geometry.cyclic3dAxis(k + 1);\n    const j = Geometry.cyclic3dAxis(i + 1);\n    return b[j] + b[k] * this.dotProductOfEdgeVectorsAtVertex(i) / this.edgeLengthSquared(k);\n  }\n\n  /** Compute the projection of a barycentric point p to the triangle T(v_0,v_1,v_2).\n   * @param b0 barycentric coordinate of p corresponding to v_0\n   * @param b1 barycentric coordinate of p corresponding to v_1\n   * @param b2 barycentric coordinate of p corresponding to v_2\n   * @returns closest edge start vertex index i and projection parameter u such that the projection q = v_i + u * (v_j - v_i).\n   */\n  public closestPoint(b0: number, b1: number, b2: number): { closestEdgeIndex: number, closestEdgeParam: number } {\n    const b: number[] = [b0, b1, b2];\n    let edgeIndex = -1;  // opposite-vertex index\n    let edgeParam = 0.0;\n    if (BarycentricTriangle.isInsideTriangle(b0, b1, b2)) { // projects to any edge\n      edgeIndex = BarycentricTriangle.indexOfMinimum((i: number) => {\n        // We want smallest projection distance d_i of p to e_i.\n        // Since b[i]=d_i|e_i|/2A we can compare quantities b[i]/|e_i|.\n        return b[i] * b[i] / this.edgeLengthSquared(i); // avoid sqrt\n      });\n      edgeParam = this.computeProjectionToEdge(edgeIndex, b);\n    } else if ((edgeIndex = BarycentricTriangle.isInRegionBeyondVertex(b0, b1, b2)) >= 0) { // projects to other edges, or any vertex\n      edgeIndex = Geometry.cyclic3dAxis(edgeIndex + 1);\n      edgeParam = this.computeProjectionToEdge(edgeIndex, b);\n      if (edgeParam < 0 || edgeParam > 1) {\n        edgeIndex = Geometry.cyclic3dAxis(edgeIndex + 1);\n        edgeParam = this.computeProjectionToEdge(edgeIndex, b);\n        if (edgeParam < 0 || edgeParam > 1) {\n          edgeParam = 0.0;\n          edgeIndex = BarycentricTriangle.edgeStartVertexIndexToOppositeVertexIndex(this.closestVertexIndex(b0, b1, b2));\n        }\n      }\n    } else if ((edgeIndex = BarycentricTriangle.isInRegionBeyondEdge(b0, b1, b2)) >= 0) { // projects to the edge or its vertices\n      edgeParam = this.computeProjectionToEdge(edgeIndex, b);\n      if (edgeParam < 0) {\n        edgeParam = 0.0;  // start of this edge\n      } else if (edgeParam > 1) {\n        edgeParam = 0.0;\n        edgeIndex = Geometry.cyclic3dAxis(edgeIndex + 1); // end of this edge = start of next edge\n      }\n    } else if ((edgeIndex = BarycentricTriangle.isOnBoundedEdge(b0, b1, b2)) >= 0) {\n      edgeParam = 1 - b[BarycentricTriangle.edgeOppositeVertexIndexToStartVertexIndex(edgeIndex)];\n    } else if ((edgeIndex = BarycentricTriangle.isOnVertex(b0, b1, b2)) >= 0) {\n      edgeParam = 0.0;\n      edgeIndex = BarycentricTriangle.edgeStartVertexIndexToOppositeVertexIndex(edgeIndex);\n    }\n    // invalid edgeIndex shouldn't happen, but propagate it anyway\n    assert(edgeIndex === 0 || edgeIndex === 1 || edgeIndex === 2);\n    return {\n      closestEdgeIndex: (edgeIndex < 0) ? -1 : BarycentricTriangle.edgeOppositeVertexIndexToStartVertexIndex(edgeIndex),\n      closestEdgeParam: edgeParam,\n    };\n  }\n  /** Compute the intersection of a line (parameterized as a ray) with the plane of this triangle.\n   * @param ray infinite line to intersect, as a ray\n   * @param result optional pre-allocated object to fill and return\n   * @returns details d of the line-plane intersection `d.point`:\n   * * `d.isValid` returns true if and only if the line intersects the plane.\n   * * `d.classify` can be used to determine where the intersection lies with respect to the triangle.\n   * * `d.a` is the intersection parameter. If `d.a` >= 0, the ray intersects the plane of the triangle.\n   * @see pointToFraction\n  */\n  public intersectRay3d(ray: Ray3d, result?: TriangleLocationDetail): TriangleLocationDetail {\n    result = TriangleLocationDetail.create(result);\n    // Let r0 = ray.origin, d = ray.direction. Write intersection point p two ways for unknown scalars s,b0,b1,b2:\n    //    r0 + s*d = p = b0*p0 + b1*p1 + b2*p2\n    // Subtract p0 from both ends, let u=p1-p0, v=p2-p0, c=r0-p0, and enforce b0+b1+b2=1:\n    //    b1*u + b2*v - s*d = c\n    // This is a linear system Mx=c where M has columns u,v,d and solution x=(b1,b2,-s).\n    const r0 = ray.origin;\n    const d = ray.direction;\n    const u = BarycentricTriangle._workVector0 = Vector3d.createStartEnd(this.points[0], this.points[1], BarycentricTriangle._workVector0);\n    const v = BarycentricTriangle._workVector1 = Vector3d.createStartEnd(this.points[0], this.points[2], BarycentricTriangle._workVector1);\n    const M = BarycentricTriangle._workMatrix = Matrix3d.createColumns(u, v, d, BarycentricTriangle._workMatrix);\n    const c = Vector3d.createStartEnd(this.points[0], r0, BarycentricTriangle._workVector0);  // reuse workVector0\n    const solution = BarycentricTriangle._workVector1;  // reuse workVector1\n    if (undefined === M.multiplyInverse(c, solution))\n      return result;  // invalid\n    result.a = -solution.z;\n    ray.fractionToPoint(result.a, result.world);\n    result.local.set(1.0 - solution.x - solution.y, solution.x, solution.y);\n    const proj = this.closestPoint(result.local.x, result.local.y, result.local.z);\n    result.closestEdgeIndex = proj.closestEdgeIndex;\n    result.closestEdgeParam = proj.closestEdgeParam;\n    return result;\n  }\n\n  /** Compute the intersection of a line (parameterized as a line segment) with the plane of this triangle.\n   * @param point0 start point of segment on line to intersect\n   * @param point1 end point of segment on line to intersect\n   * @param result optional pre-allocated object to fill and return\n   * @returns details d of the line-plane intersection `d.point`:\n   * * `d.isValid` returns true if and only if the line intersects the plane.\n   * * `d.classify` can be used to determine where the intersection lies with respect to the triangle.\n   * * `d.a` is the intersection parameter. If `d.a` is in [0,1], the segment intersects the plane of the triangle.\n   * @see intersectRay3d\n  */\n  public intersectSegment(point0: Point3d, point1: Point3d, result?: TriangleLocationDetail): TriangleLocationDetail {\n    BarycentricTriangle._workRay = Ray3d.createStartEnd(point0, point1, BarycentricTriangle._workRay);\n    return this.intersectRay3d(BarycentricTriangle._workRay, result);\n  }\n\n  /** Adjust the location to an edge of the triangle if within either given tolerance.\n   * @param location details of a point in the plane of the triangle, `location.local` and `location.world` possibly updated to lie on a triangle edge\n   * @param distanceTolerance absolute distance tolerance (or zero to ignore)\n   * @param parameterTolerance barycentric coordinate fractional tolerance (or zero to ignore)\n   * @return whether the location was adjusted\n   */\n  public snapLocationToEdge(location: TriangleLocationDetail, distanceTolerance: number = Geometry.smallMetricDistance, parameterTolerance: number = Geometry.smallFraction): boolean {\n    if (!location.isValid)\n      return false;\n    // first try parametric tol to zero barycentric coordinate (no vertices or world distances used!)\n    if (parameterTolerance > 0.0) {\n      let numSnapped = 0;\n      let newSum = 0.0;\n      for (let i = 0; i < 3; i++) {\n        const barycentricDist = Math.abs(location.local.at(i));\n        if (barycentricDist > 0.0 && barycentricDist < parameterTolerance) {\n          location.local.setAt(i, 0.0);\n          numSnapped++;\n        }\n        newSum += location.local.at(i);\n      }\n      if (numSnapped > 0 && newSum > 0.0) {\n        location.local.scaleInPlace(1.0 / newSum);\n        if (1 === numSnapped) {\n          location.closestEdgeIndex = BarycentricTriangle.edgeOppositeVertexIndexToStartVertexIndex(BarycentricTriangle.isOnBoundedEdge(location.local.x, location.local.y, location.local.z));\n          location.closestEdgeParam = 1.0 - location.local.at(location.closestEdgeIndex);\n        } else {  // 2 snapped, at vertex\n          location.closestEdgeIndex = BarycentricTriangle.isOnVertex(location.local.x, location.local.y, location.local.z);\n          location.closestEdgeParam = 0.0;\n        }\n        this.fractionToPoint(location.local.x, location.local.y, location.local.z, location.world);\n        return true;\n      }\n    }\n    // failing that, try distance tol to closest edge projection\n    if (distanceTolerance > 0.0) {\n      const i = location.closestEdgeIndex;\n      const j = (i + 1) % 3;\n      const k = (j + 1) % 3;\n      const edgeProjection = BarycentricTriangle._workPoint = this.points[i].interpolate(location.closestEdgeParam, this.points[j], BarycentricTriangle._workPoint);\n      const dist = location.world.distance(edgeProjection);\n      if (dist > 0.0 && dist < distanceTolerance) {\n        location.local.setAt(i, 1.0 - location.closestEdgeParam);\n        location.local.setAt(j, location.closestEdgeParam);\n        location.local.setAt(k, 0.0);\n        location.world.setFrom(edgeProjection);\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /** Copy all values from `other`\n   */\n  public setFrom(other: BarycentricTriangle) {\n    for (let i = 0; i < 3; ++i) {\n      this.points[i].setFromPoint3d(other.points[i]);\n      this.edgeLength2[i] = other.edgeLength2[i];\n    }\n  }\n  /** Copy contents of (not pointers to) the given points. A vertex is zeroed if its corresponding input point is undefined. */\n  public set(point0: Point3d | undefined, point1: Point3d | undefined, point2: Point3d | undefined) {\n    this.points[0].setFromPoint3d(point0);\n    this.points[1].setFromPoint3d(point1);\n    this.points[2].setFromPoint3d(point2);\n    this.edgeLength2[0] = this.points[1].distanceSquared(this.points[2]);\n    this.edgeLength2[1] = this.points[0].distanceSquared(this.points[2]);\n    this.edgeLength2[2] = this.points[0].distanceSquared(this.points[1]);\n  }\n  /**\n   * * For `this` and `other` BarycentricTriangles, compute cross products of vectors from point0 to point1 and from point0 to point2.\n   * * return the dot product of those two\n   */\n  public dotProductOfCrossProductsFromOrigin(other: BarycentricTriangle): number {\n    BarycentricTriangle._workVector0 = this.points[0].crossProductToPoints(this.points[1], this.points[2], BarycentricTriangle._workVector0);\n    BarycentricTriangle._workVector1 = other.points[0].crossProductToPoints(other.points[1], other.points[2], BarycentricTriangle._workVector1);\n    return BarycentricTriangle._workVector0.dotProduct(BarycentricTriangle._workVector1);\n  }\n  /** Return the centroid of the 3 points. */\n  public centroid(result?: Point3d): Point3d {\n    // write it out to get single scale application.\n    // Do the scale as true division (rather than multiply by precomputed 1/3).  This might protect one bit of result.\n    return Point3d.create(\n      (this.points[0].x + this.points[1].x + this.points[2].x) / 3.0,\n      (this.points[0].y + this.points[1].y + this.points[2].y) / 3.0,\n      (this.points[0].z + this.points[1].z + this.points[2].z) / 3.0,\n      result);\n  }\n\n  /** Return the incenter of the triangle. */\n  public incenter(result?: Point3d): Point3d {\n    const a = this.edgeLength(0);\n    const b = this.edgeLength(1);\n    const c = this.edgeLength(2);\n    const scale = Geometry.safeDivideFraction(1.0, a + b + c, 0.0);\n    return this.fractionToPoint(scale * a, scale * b, scale * c, result);\n  }\n\n  /** Return the circumcenter of the triangle. */\n  public circumcenter(result?: Point3d): Point3d {\n    const a2 = this.edgeLengthSquared(0);\n    const b2 = this.edgeLengthSquared(1);\n    const c2 = this.edgeLengthSquared(2);\n    const x = a2 * (b2 + c2 - a2);\n    const y = b2 * (c2 + a2 - b2);\n    const z = c2 * (a2 + b2 - c2);\n    const scale = Geometry.safeDivideFraction(1.0, x + y + z, 0.0);\n    return this.fractionToPoint(scale * x, scale * y, scale * z, result);\n  }\n\n  /** Return the unit normal of the triangle.\n   * @param result optional pre-allocated vector to fill and return.\n   * @returns unit normal, or undefined if cross product length is too small.\n   */\n  public normal(result?: Vector3d): Vector3d | undefined {\n    const cross = this.points[0].crossProductToPoints(this.points[1], this.points[2], result);\n    if (cross.tryNormalizeInPlace())\n      return cross;\n    return undefined;\n  }\n\n  /** test for point-by-point `isAlmostEqual` relationship. */\n  public isAlmostEqual(other: BarycentricTriangle): boolean {\n    return this.points[0].isAlmostEqual(other.points[0])\n      && this.points[1].isAlmostEqual(other.points[1])\n      && this.points[2].isAlmostEqual(other.points[2]);\n  }\n\n  /** Compute length of the triangle edge opposite the vertex with the given index.\n   * @see edgeStartVertexIndexToOppositeVertexIndex\n   */\n  public edgeLength(oppositeVertexIndex: number): number {\n    return Math.sqrt(this.edgeLengthSquared(oppositeVertexIndex));\n  }\n\n  /** Compute squared length of the triangle edge opposite the vertex with the given index.\n   * @see edgeStartVertexIndexToOppositeVertexIndex\n  */\n  public edgeLengthSquared(oppositeVertexIndex: number): number {\n    return this.edgeLength2[Geometry.cyclic3dAxis(oppositeVertexIndex)];\n  }\n\n  /** Compute dot product of the edge vectors based at the vertex with the given index. */\n  public dotProductOfEdgeVectorsAtVertex(baseVertexIndex: number): number {\n    const i = Geometry.cyclic3dAxis(baseVertexIndex);\n    const j = Geometry.cyclic3dAxis(i + 1);\n    const k = Geometry.cyclic3dAxis(j + 1);\n    return Geometry.dotProductXYZXYZ(this.points[j].x - this.points[i].x, this.points[j].y - this.points[i].y, this.points[j].z - this.points[i].z,\n      this.points[k].x - this.points[i].x, this.points[k].y - this.points[i].y, this.points[k].z - this.points[i].z);\n  }\n\n  /** Compute the squared distance between two points given by their barycentric coordinates.\n   * * It is assumed that a0 + a1 + a2 = b0 + b1 + b2 = 1.\n   */\n  public distanceSquared(a0: number, a1: number, a2: number, b0: number, b1: number, b2: number): number {\n    // the barycentric displacement vector distance formula\n    return -this.edgeLengthSquared(0) * (b1 - a1) * (b2 - a2) - this.edgeLengthSquared(1) * (b2 - a2) * (b0 - a0) - this.edgeLengthSquared(2) * (b0 - a0) * (b1 - a1);\n  }\n}\n"]}

package/lib/cjs/geometry3d/GrowableFloat64Array.js

@@ -31,12 +31,12 @@ class GrowableFloat64Array {
      * @return count and offset of entries copied
      */
     copyData(source, sourceCount, destOffset) {
-        let myOffset = destOffset !== null && destOffset !== void 0 ? destOffset : 0;
+        let myOffset = destOffset ?? 0;
         if (myOffset < 0)
             myOffset = 0;
         if (myOffset >= this._data.length)
             return { count: 0, offset: 0 };
-        let myCount = sourceCount !== null && sourceCount !== void 0 ? sourceCount : source.length;
+        let myCount = sourceCount ?? source.length;
         if (myCount > 0) {
             if (myCount > source.length)
                 myCount = source.length;

package/lib/cjs/geometry3d/GrowableFloat64Array.js.map

@@ -1 +1 @@
-{"version":3,"file":"GrowableFloat64Array.js","sourceRoot":"","sources":["../../../src/geometry3d/GrowableFloat64Array.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAgB/F;;;;;;;;GAQG;AACH,MAAa,oBAAoB;IAK/B;;;OAGG;IACH,YAAY,kBAA0B,CAAC,EAAE,YAAqB;QAC5D,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,eAAe,CAAC,CAAC;QAC/C,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,YAAY,IAAI,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,MAA+B,EAAE,WAAoB,EAAE,UAAmB;QAC3F,IAAI,QAAQ,GAAG,UAAU,aAAV,UAAU,cAAV,UAAU,GAAI,CAAC,CAAC;QAC/B,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAC/B,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,WAAW,aAAX,WAAW,cAAX,WAAW,GAAI,MAAM,CAAC,MAAM,CAAC;QAC3C,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM;gBACzB,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,IAAI,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACxC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;SAC1C;QACD,IAAI,OAAO,IAAI,CAAC;YACd,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,CAAC,MAAM;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;aAC9B,IAAI,MAAM,YAAY,YAAY;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;;YAEtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,OAAO,EAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,QAAiC;QACpD,MAAM,GAAG,GAAG,IAAI,oBAAoB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtD,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACvB,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC7B,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,OAAO,CAAC,CAAM,EAAE,CAAM;QAClC,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,KAAK,CAAC,yBAAkC,KAAK;QAClD,MAAM,GAAG,GAAG,IAAI,oBAAoB,CAAC,sBAAsB,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7F,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;OAGG;IACH,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;;OAIG;IACI,mBAAmB,CAAC,KAAa,EAAE,KAAa;QACrD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,CAAS,EAAE,CAAS;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD;;;;OAIG;IACI,IAAI,CAAC,CAAS,EAAE,CAAS;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,MAAc;QACxB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;QACjC,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,IAA6B;QAC5C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;IAC7B,CAAC;IACD,uEAAuE;IAChE,aAAa,CAAC,aAAqB,EAAE,SAAiB;QAC3D,IAAI,aAAa,IAAI,CAAC,IAAI,aAAa,GAAG,IAAI,CAAC,MAAM,IAAI,SAAS,GAAG,CAAC,IAAI,aAAa,GAAG,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE;YAClH,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;YAC7C,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,GAAG,SAAS,CAAC,CAAC;YAC7E,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC;SAC1B;IACH,CAAC;IACD,uFAAuF;IAChF,KAAK;QACV,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD;;;;;OAKG;IACI,cAAc,CAAC,WAAmB,EAAE,oBAA6B,IAAI;QAC1E,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE;YACjC,IAAI,iBAAiB;gBACnB,WAAW,IAAI,IAAI,CAAC,aAAa,CAAC;YACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC;YAC3C,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;SACtC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,SAAiB,EAAE,WAAmB,CAAC;QACnD,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM;YAC3C,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;aACrB,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE;YAChC,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;SACzB;IACH,CAAC;IACD;;;;OAIG;IACI,GAAG;QACR,gGAAgG;QAChG,0GAA0G;QAC1G,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;YACnB,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;IACH,CAAC;IACD,4CAA4C;IACrC,gBAAgB,CAAC,KAAa;QACnC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACD,sDAAsD;IAC/C,KAAK;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,oDAAoD;IAC7C,IAAI;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,KAAa,EAAE,KAAa;QAC1C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,gBAA4C,oBAAoB,CAAC,OAAO;QAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE;oBACnC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;oBACtB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;iBACvB;aACF;SACF;IACH,CAAC;IAED;;;;;OAKG;IACI,kBAAkB,CAAC,CAAS,EAAE,CAAS;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClB,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACI,0BAA0B,CAAC,YAAoB,GAAG;QACvD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC;YACT,OAAO;QAET,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE;gBAC/B,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;gBACxB,CAAC,GAAG,CAAC,CAAC;aACP;SACF;QACD,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;CAEF;AAzQD,oDAyQC","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\n/** @packageDocumentation\n * @module ArraysAndInterfaces\n */\n\n/**\n * Type for a OptionalGrowableFloat64Array or undefined.\n * @public\n */\nexport type OptionalGrowableFloat64Array = GrowableFloat64Array | undefined;\n/**\n * Signature for a function which does lexical comparison of `blockSize` consecutive values as 2 starting indices.\n * @public\n */\nexport type BlockComparisonFunction = (data: Float64Array, blockSize: number, index0: number, index1: number) => number;\n/**\n * A `GrowableFloat64Array` is Float64Array accompanied by a count of how many of the array's entries are considered in use.\n * * In C++ terms, this is like an std::vector\n * * As entries are added to the array, the buffer is reallocated as needed to accommodate.\n * * The reallocations leave unused space to accept further additional entries without reallocation.\n * * The `length` property returns the number of entries in use.\n * * the `capacity` property returns the (usually larger) length of the (over-allocated) Float64Array.\n * @public\n */\nexport class GrowableFloat64Array {\n  private _data: Float64Array;\n  private _inUse: number;\n  private _growthFactor: number;\n\n  /** Construct a GrowableFloat64Array.\n   * @param initialCapacity initial capacity (default 8)\n   * @param growthFactor used by ensureCapacity to expand requested reallocation size (default 1.5)\n   */\n  constructor(initialCapacity: number = 8, growthFactor?: number) {\n    this._data = new Float64Array(initialCapacity);\n    this._inUse = 0;\n    this._growthFactor = (undefined !== growthFactor && growthFactor >= 1.0) ? growthFactor : 1.5;\n  }\n\n  /** Copy data from source array. Does not reallocate or change active entry count.\n   * @param source array to copy from\n   * @param sourceCount copy the first sourceCount entries; all entries if undefined\n   * @param destOffset copy to instance array starting at this index; zero if undefined\n   * @return count and offset of entries copied\n   */\n  protected copyData(source: Float64Array | number[], sourceCount?: number, destOffset?: number): {count: number, offset: number} {\n    let myOffset = destOffset ?? 0;\n    if (myOffset < 0)\n      myOffset = 0;\n    if (myOffset >= this._data.length)\n      return {count: 0, offset: 0};\n    let myCount = sourceCount ?? source.length;\n    if (myCount > 0) {\n      if (myCount > source.length)\n        myCount = source.length;\n      if (myOffset + myCount > this._data.length)\n        myCount = this._data.length - myOffset;\n    }\n    if (myCount <= 0)\n      return {count: 0, offset: 0};\n    if (myCount === source.length)\n      this._data.set(source, myOffset);\n    else if (source instanceof Float64Array)\n      this._data.set(source.subarray(0, myCount), myOffset);\n    else\n      this._data.set(source.slice(0, myCount), myOffset);\n    return {count: myCount, offset: myOffset};\n  }\n\n  /**\n   * Create a GrowableFloat64Array with given contents.\n   * @param contents data to copy into the array\n   */\n  public static create(contents: Float64Array | number[]): GrowableFloat64Array {\n    const out = new GrowableFloat64Array(contents.length);\n    out.copyData(contents);\n    out._inUse = contents.length;\n    return out;\n  }\n  /** sort-compatible comparison.\n   * * Returns `(a-b)` which is\n   *   * negative if `a<b`\n   *   * zero if `a === b` (with exact equality)\n   *   * positive if `a>b`\n   */\n  public static compare(a: any, b: any): number {\n    return a - b;\n  }\n  /** Return a new array with\n   * * All active entries copied from this instance\n   * * optionally trimmed capacity to the active length or replicate the capacity and unused space.\n   */\n  public clone(maintainExcessCapacity: boolean = false): GrowableFloat64Array {\n    const out = new GrowableFloat64Array(maintainExcessCapacity ? this.capacity() : this._inUse);\n    out.copyData(this._data, this._inUse);\n    out._inUse = this._inUse;\n    return out;\n  }\n  /**\n   * Returns the number of entries in use.\n   * * Note that this is typically smaller than the length of the length of the supporting `Float64Array`\n   */\n  public get length() {\n    return this._inUse;\n  }\n  /**\n   * Set the value at specified index.\n   * @param index index of entry to set\n   * @param value value to set\n   */\n  public setAtUncheckedIndex(index: number, value: number) {\n    this._data[index] = value;\n  }\n\n  /**\n   * Move the value at index i to index j.\n   * @param i source index\n   * @param j destination index.\n   */\n  public move(i: number, j: number) {\n    this._data[j] = this._data[i];\n  }\n  /**\n   * swap the values at indices i and j\n   * @param i first index\n   * @param j second index\n   */\n  public swap(i: number, j: number) {\n    const a = this._data[i];\n    this._data[i] = this._data[j];\n    this._data[j] = a;\n  }\n\n  /**\n   * append a single value to the array.\n   * @param toPush value to append to the active array.\n   */\n  public push(toPush: number) {\n    this.ensureCapacity(this._inUse + 1);\n    this._data[this._inUse] = toPush;\n    this._inUse++;\n  }\n  /**\n   * Push each value from an array.\n   * @param data array of values to push\n   */\n  public pushArray(data: Float64Array | number[]) {\n    this.ensureCapacity(this._inUse + data.length);\n    this.copyData(data, data.length, this._inUse);\n    this._inUse += data.length;\n  }\n  /** Push `numToCopy` consecutive values starting at `copyFromIndex`. */\n  public pushBlockCopy(copyFromIndex: number, numToCopy: number) {\n    if (copyFromIndex >= 0 && copyFromIndex < this._inUse && numToCopy > 0 && copyFromIndex + numToCopy <= this._inUse) {\n      this.ensureCapacity(this._inUse + numToCopy);\n      this._data.copyWithin(this._inUse, copyFromIndex, copyFromIndex + numToCopy);\n      this._inUse += numToCopy;\n    }\n  }\n  /** Clear the array to 0 length.  The underlying memory remains allocated for reuse. */\n  public clear() {\n    this._inUse = 0;\n  }\n  /**\n   * Returns the number of entries in the supporting Float64Array buffer.\n   * * This number can be larger than the `length` property.\n   */\n  public capacity() {\n    return this._data.length;\n  }\n  /**\n   * * If the capacity (Float64Array length) is less than or equal to the requested newCapacity, do nothing.\n   * * If the requested newCapacity is larger than the existing capacity, reallocate to larger capacity, and copy existing values.\n   * @param newCapacity size of new array\n   * @param applyGrowthFactor whether to apply the growth factor to newCapacity when reallocating\n   */\n  public ensureCapacity(newCapacity: number, applyGrowthFactor: boolean = true) {\n    if (newCapacity > this.capacity()) {\n      if (applyGrowthFactor)\n        newCapacity *= this._growthFactor;\n      const prevData = this._data;\n      this._data = new Float64Array(newCapacity);\n      this.copyData(prevData, this._inUse);\n    }\n  }\n  /**\n   * * If newLength is less than current length, just reset current length to newLength, effectively trimming active entries but preserving original capacity.\n   * * If newLength is greater than current length, reallocate to (exactly) newLength, copy existing entries, and pad with padValue up to newLength.\n   * @param newLength new data count\n   * @param padValue value to use for padding if the length increases.\n   */\n  public resize(newLength: number, padValue: number = 0) {\n    if (newLength >= 0 && newLength < this._inUse)\n      this._inUse = newLength;\n    else if (newLength > this._inUse) {\n      this.ensureCapacity(newLength, false);\n      this._data.fill(padValue, this._inUse);\n      this._inUse = newLength;\n    }\n  }\n  /**\n   * * Reduce the length by one.\n   * * Note that there is no method return value -- use `back` to get that value before `pop()`\n   * * (As with std::vector, separating the `pop` from the value access eliminates error testing from `pop` call)\n   */\n  public pop() {\n    // Could technically access outside of array, if filled and then reduced using pop (similar to C\n    // and accessing out of bounds), but with adjusted inUse counter, that data will eventually be overwritten\n    if (this._inUse > 0) {\n      this._inUse--;\n    }\n  }\n  /** Access by index, without bounds check */\n  public atUncheckedIndex(index: number): number {\n    return this._data[index];\n  }\n  /** Access the 0-index member, without bounds check */\n  public front() {\n    return this._data[0];\n  }\n  /** Access the final member, without bounds check */\n  public back() {\n    return this._data[this._inUse - 1];\n  }\n  /** set a value by index */\n  public reassign(index: number, value: number) {\n    this._data[index] = value;\n  }\n\n  /**\n   * * Sort the array entries.\n   * * Uses insertion sort -- fine for small arrays (less than 30), slow for larger arrays\n   * @param compareMethod comparison method\n   */\n  public sort(compareMethod: (a: any, b: any) => number = GrowableFloat64Array.compare) {\n    for (let i = 0; i < this._inUse; i++) {\n      for (let j = i + 1; j < this._inUse; j++) {\n        const tempI = this._data[i];\n        const tempJ = this._data[j];\n        if (compareMethod(tempI, tempJ) > 0) {\n          this._data[i] = tempJ;\n          this._data[j] = tempI;\n        }\n      }\n    }\n  }\n\n  /**\n   * * compress out values not within the [a,b] interval.\n   * * Note that if a is greater than b all values are rejected.\n   * @param a low value for accepted interval\n   * @param b high value for accepted interval\n   */\n  public restrictToInterval(a: number, b: number) {\n    const data = this._data;\n    const n = data.length;\n    let numAccept = 0;\n    let q = 0;\n    for (let i = 0; i < n; i++) {\n      q = data[i];\n      if (q >= a && q <= b)\n        data[numAccept++] = q;\n    }\n    this._inUse = numAccept;\n  }\n\n  /**\n   * * compress out multiple copies of values.\n   * * this is done in the current order of the array.\n   */\n  public compressAdjacentDuplicates(tolerance: number = 0.0) {\n    const data = this._data;\n    const n = this._inUse;\n    if (n === 0)\n      return;\n\n    let numAccepted = 1;\n    let a = data[0];\n    let b;\n    for (let i = 1; i < n; i++) {\n      b = data[i];\n      if (Math.abs(b - a) > tolerance) {\n        data[numAccepted++] = b;\n        a = b;\n      }\n    }\n    this._inUse = numAccepted;\n  }\n\n}\n"]}
+{"version":3,"file":"GrowableFloat64Array.js","sourceRoot":"","sources":["../../../src/geometry3d/GrowableFloat64Array.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAgB/F;;;;;;;;GAQG;AACH,MAAa,oBAAoB;IAK/B;;;OAGG;IACH,YAAY,kBAA0B,CAAC,EAAE,YAAqB;QAC5D,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,eAAe,CAAC,CAAC;QAC/C,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,YAAY,IAAI,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,MAA+B,EAAE,WAAoB,EAAE,UAAmB;QAC3F,IAAI,QAAQ,GAAG,UAAU,IAAI,CAAC,CAAC;QAC/B,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAC/B,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,WAAW,IAAI,MAAM,CAAC,MAAM,CAAC;QAC3C,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM;gBACzB,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,IAAI,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACxC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;SAC1C;QACD,IAAI,OAAO,IAAI,CAAC;YACd,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,CAAC,MAAM;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;aAC9B,IAAI,MAAM,YAAY,YAAY;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;;YAEtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,OAAO,EAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,QAAiC;QACpD,MAAM,GAAG,GAAG,IAAI,oBAAoB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtD,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACvB,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC7B,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,OAAO,CAAC,CAAM,EAAE,CAAM;QAClC,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,KAAK,CAAC,yBAAkC,KAAK;QAClD,MAAM,GAAG,GAAG,IAAI,oBAAoB,CAAC,sBAAsB,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7F,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;OAGG;IACH,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;;OAIG;IACI,mBAAmB,CAAC,KAAa,EAAE,KAAa;QACrD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,CAAS,EAAE,CAAS;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD;;;;OAIG;IACI,IAAI,CAAC,CAAS,EAAE,CAAS;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,IAAI,CAAC,MAAc;QACxB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;QACjC,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,IAA6B;QAC5C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;IAC7B,CAAC;IACD,uEAAuE;IAChE,aAAa,CAAC,aAAqB,EAAE,SAAiB;QAC3D,IAAI,aAAa,IAAI,CAAC,IAAI,aAAa,GAAG,IAAI,CAAC,MAAM,IAAI,SAAS,GAAG,CAAC,IAAI,aAAa,GAAG,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE;YAClH,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;YAC7C,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,aAAa,EAAE,aAAa,GAAG,SAAS,CAAC,CAAC;YAC7E,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC;SAC1B;IACH,CAAC;IACD,uFAAuF;IAChF,KAAK;QACV,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD;;;;;OAKG;IACI,cAAc,CAAC,WAAmB,EAAE,oBAA6B,IAAI;QAC1E,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE;YACjC,IAAI,iBAAiB;gBACnB,WAAW,IAAI,IAAI,CAAC,aAAa,CAAC;YACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC;YAC3C,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;SACtC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,SAAiB,EAAE,WAAmB,CAAC;QACnD,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM;YAC3C,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;aACrB,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE;YAChC,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;SACzB;IACH,CAAC;IACD;;;;OAIG;IACI,GAAG;QACR,gGAAgG;QAChG,0GAA0G;QAC1G,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;YACnB,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;IACH,CAAC;IACD,4CAA4C;IACrC,gBAAgB,CAAC,KAAa;QACnC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACD,sDAAsD;IAC/C,KAAK;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,oDAAoD;IAC7C,IAAI;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,KAAa,EAAE,KAAa;QAC1C,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,gBAA4C,oBAAoB,CAAC,OAAO;QAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE;oBACnC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;oBACtB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;iBACvB;aACF;SACF;IACH,CAAC;IAED;;;;;OAKG;IACI,kBAAkB,CAAC,CAAS,EAAE,CAAS;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClB,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACI,0BAA0B,CAAC,YAAoB,GAAG;QACvD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC;YACT,OAAO;QAET,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE;gBAC/B,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;gBACxB,CAAC,GAAG,CAAC,CAAC;aACP;SACF;QACD,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;IAC5B,CAAC;CAEF;AAzQD,oDAyQC","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\n/** @packageDocumentation\n * @module ArraysAndInterfaces\n */\n\n/**\n * Type for a OptionalGrowableFloat64Array or undefined.\n * @public\n */\nexport type OptionalGrowableFloat64Array = GrowableFloat64Array | undefined;\n/**\n * Signature for a function which does lexical comparison of `blockSize` consecutive values as 2 starting indices.\n * @public\n */\nexport type BlockComparisonFunction = (data: Float64Array, blockSize: number, index0: number, index1: number) => number;\n/**\n * A `GrowableFloat64Array` is Float64Array accompanied by a count of how many of the array's entries are considered in use.\n * * In C++ terms, this is like an std::vector\n * * As entries are added to the array, the buffer is reallocated as needed to accommodate.\n * * The reallocations leave unused space to accept further additional entries without reallocation.\n * * The `length` property returns the number of entries in use.\n * * the `capacity` property returns the (usually larger) length of the (over-allocated) Float64Array.\n * @public\n */\nexport class GrowableFloat64Array {\n  private _data: Float64Array;\n  private _inUse: number;\n  private _growthFactor: number;\n\n  /** Construct a GrowableFloat64Array.\n   * @param initialCapacity initial capacity (default 8)\n   * @param growthFactor used by ensureCapacity to expand requested reallocation size (default 1.5)\n   */\n  constructor(initialCapacity: number = 8, growthFactor?: number) {\n    this._data = new Float64Array(initialCapacity);\n    this._inUse = 0;\n    this._growthFactor = (undefined !== growthFactor && growthFactor >= 1.0) ? growthFactor : 1.5;\n  }\n\n  /** Copy data from source array. Does not reallocate or change active entry count.\n   * @param source array to copy from\n   * @param sourceCount copy the first sourceCount entries; all entries if undefined\n   * @param destOffset copy to instance array starting at this index; zero if undefined\n   * @return count and offset of entries copied\n   */\n  protected copyData(source: Float64Array | number[], sourceCount?: number, destOffset?: number): {count: number, offset: number} {\n    let myOffset = destOffset ?? 0;\n    if (myOffset < 0)\n      myOffset = 0;\n    if (myOffset >= this._data.length)\n      return {count: 0, offset: 0};\n    let myCount = sourceCount ?? source.length;\n    if (myCount > 0) {\n      if (myCount > source.length)\n        myCount = source.length;\n      if (myOffset + myCount > this._data.length)\n        myCount = this._data.length - myOffset;\n    }\n    if (myCount <= 0)\n      return {count: 0, offset: 0};\n    if (myCount === source.length)\n      this._data.set(source, myOffset);\n    else if (source instanceof Float64Array)\n      this._data.set(source.subarray(0, myCount), myOffset);\n    else\n      this._data.set(source.slice(0, myCount), myOffset);\n    return {count: myCount, offset: myOffset};\n  }\n\n  /**\n   * Create a GrowableFloat64Array with given contents.\n   * @param contents data to copy into the array\n   */\n  public static create(contents: Float64Array | number[]): GrowableFloat64Array {\n    const out = new GrowableFloat64Array(contents.length);\n    out.copyData(contents);\n    out._inUse = contents.length;\n    return out;\n  }\n  /** sort-compatible comparison.\n   * * Returns `(a-b)` which is\n   *   * negative if `a<b`\n   *   * zero if `a === b` (with exact equality)\n   *   * positive if `a>b`\n   */\n  public static compare(a: any, b: any): number {\n    return a - b;\n  }\n  /** Return a new array with\n   * * All active entries copied from this instance\n   * * optionally trimmed capacity to the active length or replicate the capacity and unused space.\n   */\n  public clone(maintainExcessCapacity: boolean = false): GrowableFloat64Array {\n    const out = new GrowableFloat64Array(maintainExcessCapacity ? this.capacity() : this._inUse);\n    out.copyData(this._data, this._inUse);\n    out._inUse = this._inUse;\n    return out;\n  }\n  /**\n   * Returns the number of entries in use.\n   * * Note that this is typically smaller than the length of the length of the supporting `Float64Array`\n   */\n  public get length() {\n    return this._inUse;\n  }\n  /**\n   * Set the value at specified index.\n   * @param index index of entry to set\n   * @param value value to set\n   */\n  public setAtUncheckedIndex(index: number, value: number) {\n    this._data[index] = value;\n  }\n\n  /**\n   * Move the value at index i to index j.\n   * @param i source index\n   * @param j destination index.\n   */\n  public move(i: number, j: number) {\n    this._data[j] = this._data[i];\n  }\n  /**\n   * swap the values at indices i and j\n   * @param i first index\n   * @param j second index\n   */\n  public swap(i: number, j: number) {\n    const a = this._data[i];\n    this._data[i] = this._data[j];\n    this._data[j] = a;\n  }\n\n  /**\n   * append a single value to the array.\n   * @param toPush value to append to the active array.\n   */\n  public push(toPush: number) {\n    this.ensureCapacity(this._inUse + 1);\n    this._data[this._inUse] = toPush;\n    this._inUse++;\n  }\n  /**\n   * Push each value from an array.\n   * @param data array of values to push\n   */\n  public pushArray(data: Float64Array | number[]) {\n    this.ensureCapacity(this._inUse + data.length);\n    this.copyData(data, data.length, this._inUse);\n    this._inUse += data.length;\n  }\n  /** Push `numToCopy` consecutive values starting at `copyFromIndex`. */\n  public pushBlockCopy(copyFromIndex: number, numToCopy: number) {\n    if (copyFromIndex >= 0 && copyFromIndex < this._inUse && numToCopy > 0 && copyFromIndex + numToCopy <= this._inUse) {\n      this.ensureCapacity(this._inUse + numToCopy);\n      this._data.copyWithin(this._inUse, copyFromIndex, copyFromIndex + numToCopy);\n      this._inUse += numToCopy;\n    }\n  }\n  /** Clear the array to 0 length.  The underlying memory remains allocated for reuse. */\n  public clear() {\n    this._inUse = 0;\n  }\n  /**\n   * Returns the number of entries in the supporting Float64Array buffer.\n   * * This number can be larger than the `length` property.\n   */\n  public capacity() {\n    return this._data.length;\n  }\n  /**\n   * * If the capacity (Float64Array length) is less than or equal to the requested newCapacity, do nothing.\n   * * If the requested newCapacity is larger than the existing capacity, reallocate to larger capacity, and copy existing values.\n   * @param newCapacity size of new array\n   * @param applyGrowthFactor whether to apply the growth factor to newCapacity when reallocating\n   */\n  public ensureCapacity(newCapacity: number, applyGrowthFactor: boolean = true) {\n    if (newCapacity > this.capacity()) {\n      if (applyGrowthFactor)\n        newCapacity *= this._growthFactor;\n      const prevData = this._data;\n      this._data = new Float64Array(newCapacity);\n      this.copyData(prevData, this._inUse);\n    }\n  }\n  /**\n   * * If newLength is less than current length, just reset current length to newLength, effectively trimming active entries but preserving original capacity.\n   * * If newLength is greater than current length, reallocate to (exactly) newLength, copy existing entries, and pad with padValue up to newLength.\n   * @param newLength new data count\n   * @param padValue value to use for padding if the length increases.\n   */\n  public resize(newLength: number, padValue: number = 0) {\n    if (newLength >= 0 && newLength < this._inUse)\n      this._inUse = newLength;\n    else if (newLength > this._inUse) {\n      this.ensureCapacity(newLength, false);\n      this._data.fill(padValue, this._inUse);\n      this._inUse = newLength;\n    }\n  }\n  /**\n   * * Reduce the length by one.\n   * * Note that there is no method return value -- use `back` to get that value before `pop()`\n   * * (As with std::vector, separating the `pop` from the value access eliminates error testing from `pop` call)\n   */\n  public pop() {\n    // Could technically access outside of array, if filled and then reduced using pop (similar to C\n    // and accessing out of bounds), but with adjusted inUse counter, that data will eventually be overwritten\n    if (this._inUse > 0) {\n      this._inUse--;\n    }\n  }\n  /** Access by index, without bounds check */\n  public atUncheckedIndex(index: number): number {\n    return this._data[index];\n  }\n  /** Access the 0-index member, without bounds check */\n  public front() {\n    return this._data[0];\n  }\n  /** Access the final member, without bounds check */\n  public back() {\n    return this._data[this._inUse - 1];\n  }\n  /** set a value by index */\n  public reassign(index: number, value: number) {\n    this._data[index] = value;\n  }\n\n  /**\n   * * Sort the array entries.\n   * * Uses insertion sort -- fine for small arrays (less than 30), slow for larger arrays\n   * @param compareMethod comparison method\n   */\n  public sort(compareMethod: (a: any, b: any) => number = GrowableFloat64Array.compare) {\n    for (let i = 0; i < this._inUse; i++) {\n      for (let j = i + 1; j < this._inUse; j++) {\n        const tempI = this._data[i];\n        const tempJ = this._data[j];\n        if (compareMethod(tempI, tempJ) > 0) {\n          this._data[i] = tempJ;\n          this._data[j] = tempI;\n        }\n      }\n    }\n  }\n\n  /**\n   * * compress out values not within the [a,b] interval.\n   * * Note that if a is greater than b all values are rejected.\n   * @param a low value for accepted interval\n   * @param b high value for accepted interval\n   */\n  public restrictToInterval(a: number, b: number) {\n    const data = this._data;\n    const n = data.length;\n    let numAccept = 0;\n    let q = 0;\n    for (let i = 0; i < n; i++) {\n      q = data[i];\n      if (q >= a && q <= b)\n        data[numAccept++] = q;\n    }\n    this._inUse = numAccept;\n  }\n\n  /**\n   * * compress out multiple copies of values.\n   * * this is done in the current order of the array.\n   */\n  public compressAdjacentDuplicates(tolerance: number = 0.0) {\n    const data = this._data;\n    const n = this._inUse;\n    if (n === 0)\n      return;\n\n    let numAccepted = 1;\n    let a = data[0];\n    let b;\n    for (let i = 1; i < n; i++) {\n      b = data[i];\n      if (Math.abs(b - a) > tolerance) {\n        data[numAccepted++] = b;\n        a = b;\n      }\n    }\n    this._inUse = numAccepted;\n  }\n\n}\n"]}

package/lib/cjs/geometry3d/GrowableXYArray.d.ts

@@ -113,7 +113,7 @@ export declare class GrowableXYArray extends IndexedXYCollection {
      */
     getXAtUncheckedPointIndex(pointIndex: number): number;
     /**
-     * Get y coordinate by index, with no index checking
+     * Get y coordinate by point index, with no index checking
      * @param pointIndex index to access
      */
     getYAtUncheckedPointIndex(pointIndex: number): number;

package/lib/cjs/geometry3d/GrowableXYArray.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GrowableXYArray.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/GrowableXYArray.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,0BAA0B,EAAE,MAAM,2BAA2B,CAAC;AACvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAClC,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAE3C;;GAEG;AACH,qBAAa,eAAgB,SAAQ,mBAAmB;IACtD;;OAEG;IACH,OAAO,CAAC,KAAK,CAAe;IAC5B;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAS;IACzB;;OAEG;IACH,OAAO,CAAC,WAAW,CAAS;IAC5B;;OAEG;IACH,OAAO,CAAC,aAAa,CAAS;IAE9B;;;OAGG;gBACgB,SAAS,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM;IAQ/D;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAC;IA2B/H,kGAAkG;IAClG,IAAW,MAAM,IACY,MAAM,CADU;IAC7C,IAAW,MAAM,CAAC,SAAS,EAAE,MAAM,EAAmC;IAEtE,2CAA2C;IAC3C,IAAW,aAAa,WAAgC;IACxD;;OAEG;IACI,WAAW,IAAI,YAAY;IAElC,4HAA4H;IACrH,cAAc,CAAC,aAAa,EAAE,MAAM,EAAE,iBAAiB,GAAE,OAAc;IAU9E;;;;;OAKG;IACK,MAAM,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,OAAO;IAUxD;;;OAGG;IACI,KAAK,IAAI,eAAe;IAM/B;;;;;OAKG;WACW,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,gBAAgB,GAAG,eAAe;IAUvE,0EAA0E;WAC5D,6BAA6B,CAAC,IAAI,EAAE,0BAA0B,GAAG,gBAAgB,EAAE,GAAG,SAAS;IAK7G,2CAA2C;IACpC,IAAI,CAAC,MAAM,EAAE,KAAK;IAIzB,kCAAkC;IAC3B,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE;IAI9B,kCAAkC;IAC3B,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,gBAAgB;IAYxD;;;OAGG;IACI,QAAQ,CAAC,OAAO,EAAE,MAAM;IAS/B,4CAA4C;IACrC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAQlC;;;OAGG;IACI,GAAG;IAIV;;;OAGG;IACI,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAK3C;;OAEG;IACI,KAAK;IAGZ;;;;OAIG;IACI,+BAA+B,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAKrF;;;OAGG;IACI,yBAAyB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAI5D;;;OAGG;IACI,yBAAyB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAI5D;;OAEG;IACI,eAAe,IAAI,OAAO,EAAE;IASnC,0CAA0C;IACnC,6BAA6B,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAQ/F,2CAA2C;IACpC,+BAA+B,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAQpG;;;;;;OAMG;IACI,2BAA2B,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO;IAW5G;;;;;OAKG;IACI,uBAAuB,CAAC,MAAM,EAAE,eAAe,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM;IAkBrF;;;OAGG;IACI,mCAAmC,CAAC,MAAM,EAAE,eAAe,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAY1G;;;;;OAKG;WACW,0BAA0B,CAAC,MAAM,EAAE,gBAAgB,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,eAAe;IAuBhH;;OAEG;IACI,KAAK,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAInD;;OAEG;IACI,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAIlD;;;;OAIG;IACI,sBAAsB,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,OAAO;IAQxE;;;;;OAKG;IACI,wBAAwB,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAQlF;;;OAGG;IACK,yBAAyB,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAIpF;;OAEG;IACI,eAAe,CAAC,CAAC,GAAE,MAAU,GAAG,OAAO,EAAE;IAQhD,mCAAmC;IAC5B,cAAc;IAerB,4DAA4D;IACrD,wBAAwB,CAAC,SAAS,EAAE,SAAS;IAiBpD,gEAAgE;IACzD,uBAAuB,CAAC,MAAM,EAAE,QAAQ;IAc/C,4DAA4D;IACrD,0BAA0B,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAqBhE,8DAA8D;IACvD,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS;IAYhE,kDAAkD;IAC3C,UAAU,IAAI,MAAM;IAS3B;;;OAGG;IACI,YAAY,CAAC,MAAM,EAAE,MAAM;IAOlC,sEAAsE;IAC/D,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAajG,yDAAyD;IAClD,MAAM,IAAI,MAAM;IAmBvB,gEAAgE;IACzD,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAStF,uDAAuD;IAChD,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAW1F,+FAA+F;IACxF,2BAA2B,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAavH,uFAAuF;IAChF,2BAA2B,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAYjH,2DAA2D;IACpD,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAUzD,sEAAsE;IAC/D,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAS/E,oCAAoC;WACtB,aAAa,CAAC,KAAK,EAAE,eAAe,GAAG,SAAS,EAAE,KAAK,EAAE,eAAe,GAAG,SAAS,GAAG,OAAO;IAa5G,+EAA+E;IACxE,kBAAkB,IAAI,WAAW;IAcxC,kDAAkD;IAC3C,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM;IAY1D,oFAAoF;IAC7E,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,MAAM;IAGpE,+BAA+B;IACxB,aAAa,CAAC,KAAK,EAAE,eAAe,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;CAYxG"}
+{"version":3,"file":"GrowableXYArray.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/GrowableXYArray.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,0BAA0B,EAAE,MAAM,2BAA2B,CAAC;AACvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAClC,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAE3C;;GAEG;AACH,qBAAa,eAAgB,SAAQ,mBAAmB;IACtD;;OAEG;IACH,OAAO,CAAC,KAAK,CAAe;IAC5B;;OAEG;IACH,OAAO,CAAC,QAAQ,CAAS;IACzB;;OAEG;IACH,OAAO,CAAC,WAAW,CAAS;IAC5B;;OAEG;IACH,OAAO,CAAC,aAAa,CAAS;IAE9B;;;OAGG;gBACgB,SAAS,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM;IAQ/D;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAC;IA2B/H,kGAAkG;IAClG,IAAoB,MAAM,IACG,MAAM,CADmB;IACtD,IAAW,MAAM,CAAC,SAAS,EAAE,MAAM,EAAmC;IAEtE,2CAA2C;IAC3C,IAAW,aAAa,WAAgC;IACxD;;OAEG;IACI,WAAW,IAAI,YAAY;IAElC,4HAA4H;IACrH,cAAc,CAAC,aAAa,EAAE,MAAM,EAAE,iBAAiB,GAAE,OAAc;IAU9E;;;;;OAKG;IACK,MAAM,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,OAAO;IAUxD;;;OAGG;IACI,KAAK,IAAI,eAAe;IAM/B;;;;;OAKG;WACW,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,gBAAgB,GAAG,eAAe;IAUvE,0EAA0E;WAC5D,6BAA6B,CAAC,IAAI,EAAE,0BAA0B,GAAG,gBAAgB,EAAE,GAAG,SAAS;IAK7G,2CAA2C;IACpC,IAAI,CAAC,MAAM,EAAE,KAAK;IAIzB,kCAAkC;IAC3B,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE;IAI9B,kCAAkC;IAC3B,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,gBAAgB;IAYxD;;;OAGG;IACI,QAAQ,CAAC,OAAO,EAAE,MAAM;IAS/B,4CAA4C;IACrC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAQlC;;;OAGG;IACI,GAAG;IAIV;;;OAGG;IACI,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAK3C;;OAEG;IACI,KAAK;IAGZ;;;;OAIG;IACI,+BAA+B,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAKrF;;;OAGG;IACa,yBAAyB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAIrE;;;OAGG;IACa,yBAAyB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAIrE;;OAEG;IACI,eAAe,IAAI,OAAO,EAAE;IASnC,0CAA0C;IAC1B,6BAA6B,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAQxG,2CAA2C;IAC3B,+BAA+B,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAQ7G;;;;;;OAMG;IACI,2BAA2B,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO;IAW5G;;;;;OAKG;IACI,uBAAuB,CAAC,MAAM,EAAE,eAAe,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM;IAkBrF;;;OAGG;IACI,mCAAmC,CAAC,MAAM,EAAE,eAAe,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAY1G;;;;;OAKG;WACW,0BAA0B,CAAC,MAAM,EAAE,gBAAgB,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,eAAe;IAuBhH;;OAEG;IACI,KAAK,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAInD;;OAEG;IACI,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAIlD;;;;OAIG;IACI,sBAAsB,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,OAAO;IAQxE;;;;;OAKG;IACI,wBAAwB,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAQlF;;;OAGG;IACK,yBAAyB,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAIpF;;OAEG;IACI,eAAe,CAAC,CAAC,GAAE,MAAU,GAAG,OAAO,EAAE;IAQhD,mCAAmC;IAC5B,cAAc;IAerB,4DAA4D;IACrD,wBAAwB,CAAC,SAAS,EAAE,SAAS;IAiBpD,gEAAgE;IACzD,uBAAuB,CAAC,MAAM,EAAE,QAAQ;IAc/C,4DAA4D;IACrD,0BAA0B,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAqBhE,8DAA8D;IACvD,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS;IAYhE,kDAAkD;IAC3C,UAAU,IAAI,MAAM;IAS3B;;;OAGG;IACI,YAAY,CAAC,MAAM,EAAE,MAAM;IAOlC,sEAAsE;IAC/D,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAajG,yDAAyD;IAClD,MAAM,IAAI,MAAM;IAmBvB,gEAAgE;IAChD,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAS/F,uDAAuD;IACvC,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAWnG,+FAA+F;IAC/E,2BAA2B,CAAC,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAahI,uFAAuF;IACvE,2BAA2B,CAAC,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAY1H,2DAA2D;IACpD,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAUzD,sEAAsE;IAC/D,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAS/E,oCAAoC;WACtB,aAAa,CAAC,KAAK,EAAE,eAAe,GAAG,SAAS,EAAE,KAAK,EAAE,eAAe,GAAG,SAAS,GAAG,OAAO;IAa5G,+EAA+E;IACxE,kBAAkB,IAAI,WAAW;IAcxC,kDAAkD;IAC3C,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM;IAY1D,oFAAoF;IAC7E,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,GAAG,MAAM;IAGpE,+BAA+B;IACxB,aAAa,CAAC,KAAK,EAAE,eAAe,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;CAYxG"}

package/lib/cjs/geometry3d/GrowableXYArray.js

@@ -92,7 +92,7 @@ class GrowableXYArray extends IndexedXYCollection_1.IndexedXYCollection {
             this._xyInUse = pointCount;
         else if (pointCount > this._xyInUse) {
             this.ensureCapacity(pointCount, false);
-            if (padWithZero !== null && padWithZero !== void 0 ? padWithZero : false)
+            if (padWithZero ?? false)
                 this._data.fill(0, this._xyInUse * 2);
             this._xyInUse = pointCount;
         }
@@ -214,7 +214,7 @@ class GrowableXYArray extends IndexedXYCollection_1.IndexedXYCollection {
         return this._data[2 * pointIndex];
     }
     /**
-     * Get y coordinate by index, with no index checking
+     * Get y coordinate by point index, with no index checking
      * @param pointIndex index to access
      */
     getYAtUncheckedPointIndex(pointIndex) {

package/lib/cjs/geometry3d/GrowableXYArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"GrowableXYArray.js","sourceRoot":"","sources":["../../../src/geometry3d/GrowableXYArray.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AAEvC,yDAAsD;AACtD,+DAA4D;AAE5D,uDAAsD;AACtD,uDAA4C;AAC5C,qDAAgG;AAKhG;;GAEG;AACH,MAAa,eAAgB,SAAQ,yCAAmB;IAkBtD;;;OAGG;IACH,YAAmB,YAAoB,CAAC,EAAE,YAAqB;QAC7D,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAG,qBAAqB;QACrE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,YAAY,IAAI,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,MAA+B,EAAE,WAAoB,EAAE,UAAmB;QAC3F,qDAAqD;QACrD,IAAI,QAAQ,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAC/B,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,CAAC,SAAS,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5E,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM;gBACzB,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,IAAI,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACxC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;YACzC,IAAI,OAAO,GAAG,CAAC,KAAK,CAAC;gBACnB,OAAO,IAAI,OAAO,GAAG,CAAC,CAAC;SAC1B;QACD,IAAI,OAAO,IAAI,CAAC;YACd,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,CAAC,MAAM;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;aAC9B,IAAI,MAAM,YAAY,YAAY;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;;YAEtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,OAAO,EAAC,KAAK,EAAE,OAAO,GAAG,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAC,CAAC;IACpD,CAAC;IAED,kGAAkG;IAClG,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7C,IAAW,MAAM,CAAC,SAAiB,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAEtE,2CAA2C;IAC3C,IAAW,aAAa,KAAK,OAAO,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IACxD;;OAEG;IACI,WAAW,KAAmB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEzD,4HAA4H;IACrH,cAAc,CAAC,aAAqB,EAAE,oBAA6B,IAAI;QAC5E,IAAI,aAAa,GAAG,IAAI,CAAC,WAAW,EAAE;YACpC,IAAI,iBAAiB;gBACnB,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,CAAC,WAAW,GAAG,aAAa,CAAC;SAClC;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,UAAkB,EAAE,WAAqB;QACtD,IAAI,UAAU,IAAI,CAAC,IAAI,UAAU,GAAG,IAAI,CAAC,QAAQ;YAC/C,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC;aACxB,IAAI,UAAU,GAAG,IAAI,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACvC,IAAI,WAAW,aAAX,WAAW,cAAX,WAAW,GAAI,KAAK;gBACtB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC;SAC5B;IACH,CAAC;IACD;;;OAGG;IACI,KAAK;QACV,MAAM,SAAS,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,SAAS,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;QACjC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,IAAgC;QACnD,MAAM,SAAS,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,IAAI,YAAY,mCAAgB,EAAE;YACpC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;SAC/B;aAAM;YACL,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;SACzB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,0EAA0E;IACnE,MAAM,CAAC,6BAA6B,CAAC,IAAgC;QAC1E,MAAM,SAAS,GAAG,IAAI,qDAAoC,EAAE,CAAC;QAC7D,uCAAsB,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAClD,OAAO,SAAS,CAAC,4BAA4B,EAAE,CAAC;IAClD,CAAC;IACD,2CAA2C;IACpC,IAAI,CAAC,MAAa;QACvB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,kCAAkC;IAC3B,OAAO,CAAC,MAAe;QAC5B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,kCAAkC;IAC3B,aAAa,CAAC,MAAmC;QACtD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1D,IAAI,MAAM,YAAY,mCAAgB,EAAE;YACtC,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;gBAC/B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC/C;aAAM;YACL,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;SAC/C;IACH,CAAC;IAED;;;OAGG;IACI,QAAQ,CAAC,OAAe;QAC7B,IAAI,IAAI,CAAC,QAAQ,IAAI,OAAO,EAAE;YAC5B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,GAAG,OAAO,EAAE,KAAK,CAAC,CAAC;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;gBAChC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAC/C;SACF;IACH,CAAC;IACD,4CAA4C;IACrC,MAAM,CAAC,CAAS,EAAE,CAAS;QAChC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,GAAG;QACR,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC;YACnB,IAAI,CAAC,QAAQ,EAAE,CAAC;IACpB,CAAC;IACD;;;OAGG;IACI,YAAY,CAAC,KAAa;QAC/B,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG,CAAC;YACrC,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACI,KAAK;QACV,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpB,CAAC;IACD;;;;OAIG;IACI,+BAA+B,CAAC,UAAkB,EAAE,MAAgB;QACzE,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC;QAC7B,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC1E,CAAC;IAED;;;OAGG;IACI,yBAAyB,CAAC,UAAkB;QACjD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACI,yBAAyB,CAAC,UAAkB;QACjD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACI,eAAe;QACpB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,0CAA0C;IACnC,6BAA6B,CAAC,UAAkB,EAAE,MAAgB;QACvE,IAAI,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE;YACjC,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC;YAC7B,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SACzE;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,2CAA2C;IACpC,+BAA+B,CAAC,WAAmB,EAAE,MAAiB;QAC3E,IAAI,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE;YAClC,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC;YAC9B,OAAO,0BAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SAC1E;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACI,2BAA2B,CAAC,SAAiB,EAAE,MAAuB,EAAE,WAAmB;QAChG,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE;YACpE,MAAM,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC;YACxB,MAAM,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxC,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACI,uBAAuB,CAAC,MAAuB,EAAE,WAAoB;QAC1E,yBAAyB;QACzB,IAAI,WAAW,KAAK,SAAS,EAAE;YAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC;YAC/B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,QAAQ,EAAE,KAAK,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;YAC1B,OAAO,QAAQ,CAAC;SACjB;QACD,0BAA0B;QAC1B,IAAI,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE;YACpC,MAAM,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,OAAO,CAAC,CAAC;SACV;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;OAGG;IACI,mCAAmC,CAAC,MAAuB,EAAE,CAAS,EAAE,QAAgB,EAAE,CAAS;QACxG,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YACpD,MAAM,SAAS,GAAG,GAAG,GAAG,QAAQ,CAAC;YACjC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC;YAC1B,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,CAAC,MAAM,CACT,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,EACxC,SAAS,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACrD;IACH,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,0BAA0B,CAAC,MAAwB,EAAE,SAAqB,EAAE,IAAsB;QAC9G,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;QAChC,IAAI,CAAC,IAAI;YACP,IAAI,GAAG,IAAI,eAAe,CAAC,SAAS,CAAC,CAAC;aACnC;YACH,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,IAAI,SAAS,EAAE;YACb,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,CAAC,GAAG,SAAS,CAAC;YAC9B,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;gBACnC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrB,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aACrG;SACF;aAAM;YACL,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;SAC5B;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACI,KAAK,CAAC,MAAgB;QAC3B,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC1C,OAAO,IAAI,CAAC,+BAA+B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACzD,CAAC;IACD;;OAEG;IACI,IAAI,CAAC,MAAgB;QAC1B,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC;YAAE,OAAO,SAAS,CAAC;QACxC,OAAO,IAAI,CAAC,+BAA+B,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACzE,CAAC;IACD;;;;OAIG;IACI,sBAAsB,CAAC,UAAkB,EAAE,KAAY;QAC5D,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;OAKG;IACI,wBAAwB,CAAC,UAAkB,EAAE,CAAS,EAAE,CAAS;QACtE,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACK,yBAAyB,CAAC,UAAkB,EAAE,CAAS,EAAE,CAAS;QACxE,OAAO,IAAI,CAAC,wBAAwB,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,IAAY,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,mCAAmC;IAC5B,cAAc;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,EAAE,EAAE,EAAE,CAAC;QACX,IAAI,CAAC,CAAC;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;YAChD,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;YACZ,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;YACZ,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YAChD,EAAE,EAAE,CAAC;YACL,EAAE,EAAE,CAAC;YACL,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;SACjD;IACH,CAAC;IAED,4DAA4D;IACrD,wBAAwB,CAAC,SAAoB;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC;QACrC,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QAChC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;YACvC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;YAC3C,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;SAChD;IACH,CAAC;IAED,gEAAgE;IACzD,uBAAuB,CAAC,MAAgB;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;YACvC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACtC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAC3C;IACH,CAAC;IAED,4DAA4D;IACrD,0BAA0B,CAAC,SAAoB;QACpD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC;QACnC,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QAChC,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC;QAClC,IAAI,CAAC,KAAK;YACR,OAAO,KAAK,CAAC;QACf,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QAChC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;YACvC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACjB,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACtC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAC3C;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,SAAS,EAAE;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,CAAC;gBACvC,aAAa,CAAC,mBAAmB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACtE;aAAM;YACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,CAAC;gBACvC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAEhD;IACH,CAAC;IACD,kDAAkD;IAC3C,UAAU;QACf,IAAI,GAAG,GAAG,GAAG,CAAC;QACd,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAE,gEAAgE;QACpG,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YAAE,GAAG,IAAI,mBAAQ,CAAC,YAAY,CACzD,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EACrB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7B,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,YAAY,CAAC,MAAc;QAChC,IAAI,IAAI,CAAC,KAAK,EAAE;YACd,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;gBAC/B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;SAC1C;IACH,CAAC;IACD,sEAAsE;IAC/D,WAAW,CAAC,CAAS,EAAE,QAAgB,EAAE,CAAS,EAAE,MAAgB;QACzE,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YAChD,MAAM,SAAS,GAAG,GAAG,GAAG,QAAQ,CAAC;YACjC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,yBAAO,CAAC,MAAM,CACnB,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,EACxC,SAAS,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SAC7D;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,yDAAyD;IAClD,MAAM;QACX,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAI,iBAAiB;QACjD,IAAI,CAAC,GAAG,CAAC,EAAE;YACT,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE;gBACnD,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACzB,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;gBAC7B,IAAI,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aACvD;SACF;QACD,OAAO,GAAG,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,gEAAgE;IACzD,gBAAgB,CAAC,CAAS,EAAE,CAAS,EAAE,MAAiB;QAC7D,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;YAChD,OAAO,SAAS,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,0BAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/E,CAAC;IAED,uDAAuD;IAChD,gBAAgB,CAAC,MAAa,EAAE,CAAS,EAAE,MAAiB;QACjE,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,0BAAQ,CAAC,MAAM,CACpB,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAClB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SACnC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,+FAA+F;IACxF,2BAA2B,CAAC,WAAmB,EAAE,YAAoB,EAAE,YAAoB;QAChG,IAAI,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,EAAE;YACxG,MAAM,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC;YAC1B,MAAM,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,OAAO,mBAAQ,CAAC,gBAAgB,CAC9B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACjD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,uFAAuF;IAChF,2BAA2B,CAAC,MAAa,EAAE,YAAoB,EAAE,YAAoB;QAC1F,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,EAAE;YACtE,MAAM,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,OAAO,mBAAQ,CAAC,gBAAgB,CAC9B,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAC1C,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;SAC/C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,2DAA2D;IACpD,QAAQ,CAAC,CAAS,EAAE,CAAS;QAClC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YAChD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,mBAAQ,CAAC,YAAY,CAC1B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAC/B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;SAC5C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,sEAAsE;IAC/D,oBAAoB,CAAC,CAAS,EAAE,UAAmB;QACxD,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YACxB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,mBAAQ,CAAC,YAAY,CAC1B,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAC7B,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,oCAAoC;IAC7B,MAAM,CAAC,aAAa,CAAC,KAAkC,EAAE,KAAkC;QAChG,IAAI,KAAK,IAAI,KAAK,EAAE;YAClB,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBAC/B,OAAO,KAAK,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACnC,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC;oBACnG,OAAO,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC;SACb;QACD,kDAAkD;QAClD,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,+EAA+E;IACxE,kBAAkB;QACvB,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QACxB,sBAAsB;QACtB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,CAAC,IAAI,CACT,CAAC,WAAmB,EAAE,WAAmB,EAAE,EAAE;YAC3C,gBAAgB;YAChB,OAAO,IAAI,CAAC,mBAAmB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QACL,+BAA+B;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,kDAAkD;IAC3C,mBAAmB,CAAC,EAAU,EAAE,EAAU;QAC/C,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC;YACtB,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC,CAAC;SACxB;QACD,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,wDAAwD;IAC1E,CAAC;IAED,oFAAoF;IAC7E,SAAS,CAAC,UAAkB,EAAE,cAAsB;QACzD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,GAAG,cAAc,CAAC,CAAC;IACrD,CAAC;IACD,+BAA+B;IACxB,aAAa,CAAC,KAAsB,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAC3F,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK;YAC1B,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;YAClC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS;gBAC3C,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAhqBD,0CAgqBC","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\n/** @packageDocumentation\n * @module ArraysAndInterfaces\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { MultiLineStringDataVariant } from \"../topology/Triangulation\";\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\nimport { IndexedXYCollection } from \"./IndexedXYCollection\";\nimport { Matrix3d } from \"./Matrix3d\";\nimport { Point2d, Vector2d } from \"./Point2dVector2d\";\nimport { Point3d } from \"./Point3dVector3d\";\nimport { PointStreamGrowableXYZArrayCollector, VariantPointDataStream } from \"./PointStreaming\";\nimport { Range2d } from \"./Range\";\nimport { Transform } from \"./Transform\";\nimport { XAndY, XYAndZ } from \"./XYZProps\";\n\n/** `GrowableXYArray` manages a (possibly growing) Float64Array to pack xy coordinates.\n * @public\n */\nexport class GrowableXYArray extends IndexedXYCollection {\n  /**\n   * array of packed xy xy xy components\n   */\n  private _data: Float64Array;\n  /**\n   * Number of xy tuples (not floats) in the array\n   */\n  private _xyInUse: number;\n  /**\n   * capacity in xy tuples. (not floats)\n   */\n  private _xyCapacity: number;\n  /**\n   * multiplier used by ensureCapacity to expand requested reallocation size\n   */\n  private _growthFactor: number;\n\n  /** Construct a new GrowablePoint2d array.\n   * @param numPoints initial capacity in xy tuples (default 8)\n   * @param growthFactor used by ensureCapacity to expand requested reallocation size (default 1.5)\n   */\n  public constructor(numPoints: number = 8, growthFactor?: number) {\n    super();\n    this._data = new Float64Array(numPoints * 2);   // 2 values per point\n    this._xyInUse = 0;\n    this._xyCapacity = numPoints;\n    this._growthFactor = (undefined !== growthFactor && growthFactor >= 1.0) ? growthFactor : 1.5;\n  }\n\n  /** Copy xy points from source array. Does not reallocate or change active point count.\n   * @param source array to copy from\n   * @param sourceCount copy the first sourceCount points; all points if undefined\n   * @param destOffset copy to instance array starting at this point index; zero if undefined\n   * @return count and offset of points copied\n   */\n  protected copyData(source: Float64Array | number[], sourceCount?: number, destOffset?: number): {count: number, offset: number} {\n    // validate inputs and convert from points to entries\n    let myOffset = (undefined !== destOffset) ? destOffset * 2 : 0;\n    if (myOffset < 0)\n      myOffset = 0;\n    if (myOffset >= this._data.length)\n      return {count: 0, offset: 0};\n    let myCount = (undefined !== sourceCount) ? sourceCount * 2 : source.length;\n    if (myCount > 0) {\n      if (myCount > source.length)\n        myCount = source.length;\n      if (myOffset + myCount > this._data.length)\n        myCount = this._data.length - myOffset;\n      if (myCount % 2 !== 0)\n        myCount -= myCount % 2;\n    }\n    if (myCount <= 0)\n      return {count: 0, offset: 0};\n    if (myCount === source.length)\n      this._data.set(source, myOffset);\n    else if (source instanceof Float64Array)\n      this._data.set(source.subarray(0, myCount), myOffset);\n    else\n      this._data.set(source.slice(0, myCount), myOffset);\n    return {count: myCount / 2, offset: myOffset / 2};\n  }\n\n  /** The number of points in use. When the length is increased, the array is padded with zeroes. */\n  public get length() { return this._xyInUse; }\n  public set length(newLength: number) { this.resize(newLength, true); }\n\n  /** Return the number of float64 in use. */\n  public get float64Length() { return this._xyInUse * 2; }\n  /** Return the raw packed data.\n   * * Note that the length of the returned Float64Array is a count of doubles, and includes the excess capacity\n   */\n  public float64Data(): Float64Array { return this._data; }\n\n  /** If necessary, increase the capacity to a new pointCount.  Current coordinates and point count (length) are unchanged. */\n  public ensureCapacity(pointCapacity: number, applyGrowthFactor: boolean = true) {\n    if (pointCapacity > this._xyCapacity) {\n      if (applyGrowthFactor)\n        pointCapacity *= this._growthFactor;\n      const prevData = this._data;\n      this._data = new Float64Array(pointCapacity * 2);\n      this.copyData(prevData, this._xyInUse);\n      this._xyCapacity = pointCapacity;\n    }\n  }\n  /**\n   * * If pointCount is less than current length, just reset current length to pointCount, effectively trimming active points but preserving original capacity.\n   * * If pointCount is greater than current length, reallocate to exactly pointCount, copy existing points, and optionally pad excess with zero.\n   * @param pointCount new number of active points in array\n   * @param padWithZero when increasing point count, whether to zero out new points (default false)\n   */\n   public resize(pointCount: number, padWithZero?: boolean) {\n    if (pointCount >= 0 && pointCount < this._xyInUse)\n      this._xyInUse = pointCount;\n    else if (pointCount > this._xyInUse) {\n      this.ensureCapacity(pointCount, false);\n      if (padWithZero ?? false)\n        this._data.fill(0, this._xyInUse * 2);\n      this._xyInUse = pointCount;\n    }\n  }\n  /**\n   * Make a copy of the (active) points in this array.\n   * (The clone does NOT get excess capacity)\n   */\n  public clone(): GrowableXYArray {\n    const newPoints = new GrowableXYArray(this.length);\n    newPoints.copyData(this._data, this.length);\n    newPoints._xyInUse = this.length;\n    return newPoints;\n  }\n  /** Create an array populated from\n   * * An array of Point2d\n   * * An array of Point3d (hidden as XAndY)\n   * * An array of objects with keyed values, et `{x:1, y:1}`\n   * * A `GrowableXYZArray`\n   */\n  public static create(data: XAndY[] | GrowableXYZArray): GrowableXYArray {\n    const newPoints = new GrowableXYArray(data.length);\n    if (data instanceof GrowableXYZArray) {\n      newPoints.pushAllXYAndZ(data);\n    } else {\n      newPoints.pushAll(data);\n    }\n    return newPoints;\n  }\n\n  /** Restructure MultiLineStringDataVariant as array of GrowableXYZArray */\n  public static createArrayOfGrowableXYZArray(data: MultiLineStringDataVariant): GrowableXYZArray[] | undefined {\n    const collector = new PointStreamGrowableXYZArrayCollector();\n    VariantPointDataStream.streamXYZ(data, collector);\n    return collector.claimArrayOfGrowableXYZArray();\n  }\n  /** push a point to the end of the array */\n  public push(toPush: XAndY) {\n    this.pushXY(toPush.x, toPush.y);\n  }\n\n  /** push all points of an array */\n  public pushAll(points: XAndY[]) {\n    this.ensureCapacity(this._xyInUse + points.length, false);\n    for (const p of points) this.push(p);\n  }\n  /** push all points of an array */\n  public pushAllXYAndZ(points: XYAndZ[] | GrowableXYZArray) {\n    this.ensureCapacity(this._xyInUse + points.length, false);\n    if (points instanceof GrowableXYZArray) {\n      const xyzBuffer = points.float64Data();\n      const n = points.length * 3;\n      for (let i = 0; i + 2 < n; i += 3)\n        this.pushXY(xyzBuffer[i], xyzBuffer[i + 1]);\n    } else {\n      for (const p of points) this.pushXY(p.x, p.y);\n    }\n  }\n\n  /**\n   * Replicate numWrap xy values from the front of the array as new values at the end.\n   * @param numWrap number of xy values to replicate\n   */\n  public pushWrap(numWrap: number) {\n    if (this._xyInUse >= numWrap) {\n      this.ensureCapacity(this._xyInUse + numWrap, false);\n      for (let i = 0; i < numWrap; i++) {\n        const k = 2 * i;\n        this.pushXY(this._data[k], this._data[k + 1]);\n      }\n    }\n  }\n  /** push a point given by x,y coordinates */\n  public pushXY(x: number, y: number) {\n    this.ensureCapacity(this._xyInUse + 1);\n    const index = this._xyInUse * 2;\n    this._data[index] = x;\n    this._data[index + 1] = y;\n    this._xyInUse++;\n  }\n\n  /** Remove one point from the back.\n   * * NOTE that (in the manner of std::vector native) this is \"just\" removing the point -- no point is NOT returned.\n   * * Use `back ()` to get the last x,y assembled into a `Point2d `\n   */\n  public pop() {\n    if (this._xyInUse > 0)\n      this._xyInUse--;\n  }\n  /**\n   * Test if index is valid for an xy (point or vector) within this array\n   * @param index xy index to test.\n   */\n  public isIndexValid(index: number): boolean {\n    if (index >= this._xyInUse || index < 0)\n      return false;\n    return true;\n  }\n  /**\n   * Clear all xy data, but leave capacity unchanged.\n   */\n  public clear() {\n    this._xyInUse = 0;\n  }\n  /**\n   * Get a point by index, strongly typed as a Point2d.  This is unchecked.  Use atPoint2dIndex to have validity test.\n   * @param pointIndex index to access\n   * @param result optional result\n   */\n  public getPoint2dAtUncheckedPointIndex(pointIndex: number, result?: Point2d): Point2d {\n    const index = 2 * pointIndex;\n    return Point2d.create(this._data[index], this._data[index + 1], result);\n  }\n\n  /**\n   * Get x coordinate by point index, with no index checking\n   * @param pointIndex index to access\n   */\n  public getXAtUncheckedPointIndex(pointIndex: number): number {\n    return this._data[2 * pointIndex];\n  }\n\n  /**\n   * Get y coordinate by index, with no index checking\n   * @param pointIndex index to access\n   */\n  public getYAtUncheckedPointIndex(pointIndex: number): number {\n    return this._data[2 * pointIndex + 1];\n  }\n\n  /**\n   * Gather all points as a Point2d[]\n   */\n  public getPoint2dArray(): Point2d[] {\n    const n = 2 * this._xyInUse;\n    const result = [];\n    const data = this._data;\n    for (let i = 0; i < n; i += 2)\n      result.push(Point2d.create(data[i], data[i + 1]));\n    return result;\n  }\n\n  /** copy xy into strongly typed Point2d */\n  public getPoint2dAtCheckedPointIndex(pointIndex: number, result?: Point2d): Point2d | undefined {\n    if (this.isIndexValid(pointIndex)) {\n      const index = 2 * pointIndex;\n      return Point2d.create(this._data[index], this._data[index + 1], result);\n    }\n    return undefined;\n  }\n\n  /** copy xy into strongly typed Vector2d */\n  public getVector2dAtCheckedVectorIndex(vectorIndex: number, result?: Vector2d): Vector2d | undefined {\n    if (this.isIndexValid(vectorIndex)) {\n      const index = 2 * vectorIndex;\n      return Vector2d.create(this._data[index], this._data[index + 1], result);\n    }\n    return undefined;\n  }\n\n  /**\n   * Read coordinates from source array, place them at index within this array.\n   * @param destIndex point index where coordinates are to be placed in this array\n   * @param source source array\n   * @param sourceIndex point index in source array\n   * @returns true if destIndex and sourceIndex are both valid.\n   */\n  public transferFromGrowableXYArray(destIndex: number, source: GrowableXYArray, sourceIndex: number): boolean {\n    if (this.isIndexValid(destIndex) && source.isIndexValid(sourceIndex)) {\n      const i = destIndex * 2;\n      const j = sourceIndex * 2;\n      this._data[i] = source._data[j];\n      this._data[i + 1] = source._data[j + 1];\n      return true;\n    }\n    return false;\n  }\n\n  /**\n   * push coordinates from the source array to the end of this array.\n   * @param source source array\n   * @param sourceIndex xy index within the source.  If undefined, push entire contents of source\n   * @returns number of points pushed.\n   */\n  public pushFromGrowableXYArray(source: GrowableXYArray, sourceIndex?: number): number {\n    // full array push  . . .\n    if (sourceIndex === undefined) {\n      const numXYAdd = source.length;\n      this.ensureCapacity(this.length + numXYAdd, false);\n      this.copyData(source._data, numXYAdd, this.length);\n      this._xyInUse += numXYAdd;\n      return numXYAdd;\n    }\n    // single point push . . .\n    if (source.isIndexValid(sourceIndex)) {\n      const j = sourceIndex * 2;\n      this.pushXY(source._data[j], source._data[j + 1]);\n      return 1;\n    }\n    return 0;\n  }\n\n  /**\n   * * Compute a point at fractional coordinate between points i and j of source\n   * * push onto this array.\n   */\n  public pushInterpolatedFromGrowableXYArray(source: GrowableXYArray, i: number, fraction: number, j: number) {\n    if (source.isIndexValid(i) && source.isIndexValid(j)) {\n      const fraction0 = 1.0 - fraction;\n      const data = source._data;\n      i = 2 * i;\n      j = 2 * j;\n      this.pushXY(\n        fraction0 * data[i] + fraction * data[j],\n        fraction0 * data[i + 1] + fraction * data[j + 1]);\n    }\n  }\n\n  /**\n   * Create an array of xy points from source xyz points.\n   * @param source source array of xyz\n   * @param transform optional transform to apply to xyz points.\n   * @param dest optional result.\n   */\n  public static createFromGrowableXYZArray(source: GrowableXYZArray, transform?: Transform, dest?: GrowableXYArray) {\n    const numPoints = source.length;\n    if (!dest)\n      dest = new GrowableXYArray(numPoints);\n    else {\n      dest.ensureCapacity(numPoints, false);\n      dest.clear();\n    }\n    if (transform) {\n      const packedXYZ = source.float64Data();\n      const nDouble = 3 * numPoints;\n      let x, y, z;\n      for (let i = 0; i < nDouble; i += 3) {\n        x = packedXYZ[i];\n        y = packedXYZ[i + 1];\n        z = packedXYZ[i + 2];\n        dest.pushXY(transform.multiplyComponentXYZ(0, x, y, z), transform.multiplyComponentXYZ(1, x, y, z));\n      }\n    } else {\n      dest.pushAllXYAndZ(source);\n    }\n    return dest;\n  }\n  /**\n   * Return the first point, or undefined if the array is empty.\n   */\n  public front(result?: Point2d): Point2d | undefined {\n    if (this._xyInUse === 0) return undefined;\n    return this.getPoint2dAtUncheckedPointIndex(0, result);\n  }\n  /**\n   * Return the last point, or undefined if the array is empty.\n   */\n  public back(result?: Point2d): Point2d | undefined {\n    if (this._xyInUse < 1) return undefined;\n    return this.getPoint2dAtUncheckedPointIndex(this._xyInUse - 1, result);\n  }\n  /**\n   * Set the coordinates of a single point.\n   * @param pointIndex index of point to set\n   * @param value coordinates to set\n   */\n  public setAtCheckedPointIndex(pointIndex: number, value: XAndY): boolean {\n    if (!this.isIndexValid(pointIndex))\n      return false;\n    const index = pointIndex * 2;\n    this._data[index] = value.x;\n    this._data[index + 1] = value.y;\n    return true;\n  }\n  /**\n   * Set the coordinates of a single point given as coordinates.\n   * @param pointIndex index of point to set\n   * @param x x coordinate\n   * @param y y coordinate\n   */\n  public setXYAtCheckedPointIndex(pointIndex: number, x: number, y: number): boolean {\n    if (!this.isIndexValid(pointIndex))\n      return false;\n    const index = pointIndex * 2;\n    this._data[index] = x;\n    this._data[index + 1] = y;\n    return true;\n  }\n  /**\n   * Set the coordinates of a single point given as coordinates.\n   * @deprecated in 3.x. Use setXYAtCheckedPointIndex instead\n   */\n   public setXYZAtCheckedPointIndex(pointIndex: number, x: number, y: number): boolean {\n    return this.setXYAtCheckedPointIndex(pointIndex, x, y);\n  }\n\n  /**\n   * Copy all points into a simple array of Point3d with given z.\n   */\n  public getPoint3dArray(z: number = 0): Point3d[] {\n    const n = 2 * this._xyInUse;\n    const result = [];\n    const data = this._data;\n    for (let i = 0; i < n; i += 2)\n      result.push(Point3d.create(data[i], data[i + 1], z));\n    return result;\n  }\n  /** reverse the order of points. */\n  public reverseInPlace() {\n    const n = this.length;\n    let j0, j1;\n    let a;\n    const data = this._data;\n    for (let i0 = 0, i1 = n - 1; i0 < i1; i0++, i1--) {\n      j0 = 2 * i0;\n      j1 = 2 * i1;\n      a = data[j0]; data[j0] = data[j1]; data[j1] = a;\n      j0++;\n      j1++;\n      a = data[j0]; data[j0] = data[j1]; data[j1] = a;\n    }\n  }\n\n  /** multiply each point by the transform, replace values. */\n  public multiplyTransformInPlace(transform: Transform) {\n    const data = this._data;\n    const nDouble = this.float64Length;\n    const coffs = transform.matrix.coffs;\n    const origin = transform.origin;\n    const x0 = origin.x;\n    const y0 = origin.y;\n    let x = 0;\n    let y = 0;\n    for (let i = 0; i + 1 < nDouble; i += 2) {\n      x = data[i];\n      y = data[i + 1];\n      data[i] = coffs[0] * x + coffs[1] * y + x0;\n      data[i + 1] = coffs[3] * x + coffs[4] * y + y0;\n    }\n  }\n\n  /** multiply each xy (as a vector) by matrix, replace values. */\n  public multiplyMatrix3dInPlace(matrix: Matrix3d) {\n    const data = this._data;\n    const nDouble = this.float64Length;\n    const coffs = matrix.coffs;\n    let x = 0;\n    let y = 0;\n    for (let i = 0; i + 1 < nDouble; i += 2) {\n      x = data[i];\n      y = data[i + 1];\n      data[i] = coffs[0] * x + coffs[1] * y;\n      data[i + 1] = coffs[3] * x + coffs[4] * y;\n    }\n  }\n\n  /** multiply each point by the transform, replace values. */\n  public tryTransformInverseInPlace(transform: Transform): boolean {\n    const data = this._data;\n    const nDouble = this.float64Length;\n    const matrix = transform.matrix;\n    matrix.computeCachedInverse(true);\n    const coffs = matrix.inverseCoffs;\n    if (!coffs)\n      return false;\n    const origin = transform.origin;\n    const x0 = origin.x;\n    const y0 = origin.y;\n    let x = 0;\n    let y = 0;\n    for (let i = 0; i + 1 < nDouble; i += 2) {\n      x = data[i] - x0;\n      y = data[i + 1] - y0;\n      data[i] = coffs[0] * x + coffs[1] * y;\n      data[i + 1] = coffs[3] * x + coffs[4] * y;\n    }\n    return true;\n  }\n  /** Extend a `Range2d`, optionally transforming the points. */\n  public extendRange(rangeToExtend: Range2d, transform?: Transform) {\n    const numDouble = this.float64Length;\n    const data = this._data;\n    if (transform) {\n      for (let i = 0; i + 1 < numDouble; i += 2)\n        rangeToExtend.extendTransformedXY(transform, data[i], data[i + 1]);\n    } else {\n      for (let i = 0; i + 1 < numDouble; i += 2)\n        rangeToExtend.extendXY(data[i], data[i + 1]);\n\n    }\n  }\n  /** sum the lengths of segments between points. */\n  public sumLengths(): number {\n    let sum = 0.0;\n    const n = 2 * (this._xyInUse - 1);  // Length already takes into account what specifically is in use\n    const data = this._data;\n    for (let i = 0; i < n; i += 2) sum += Geometry.hypotenuseXY(\n      data[i + 2] - data[i],\n      data[i + 3] - data[i + 1]);\n    return sum;\n  }\n  /**\n   * Multiply each x,y by the scale factor.\n   * @param factor\n   */\n  public scaleInPlace(factor: number) {\n    if (this._data) {\n      const numFloat = this.float64Length;\n      for (let i = 0; i < numFloat; i++)\n        this._data[i] = this._data[i] * factor;\n    }\n  }\n  /** Compute a point at fractional coordinate between points i and j */\n  public interpolate(i: number, fraction: number, j: number, result?: Point2d): Point2d | undefined {\n    if (this.isIndexValid(i) && this.isIndexValid(j)) {\n      const fraction0 = 1.0 - fraction;\n      const data = this._data;\n      i = 2 * i;\n      j = 2 * j;\n      return Point2d.create(\n        fraction0 * data[i] + fraction * data[j],\n        fraction0 * data[i + 1] + fraction * data[j + 1], result);\n    }\n    return undefined;\n  }\n\n  /** Sum the signed areas of the projection to xy plane */\n  public areaXY(): number {\n    let area = 0.0;\n    const n = 2 * this._xyInUse;    // float count !!\n    if (n > 4) {\n      const x0 = this._data[n - 2];\n      const y0 = this._data[n - 1];\n      let dx1 = this._data[0] - x0;\n      let dy1 = this._data[1] - y0;\n      let dx2 = 0;\n      let dy2 = 0;\n      for (let i = 2; i < n; i += 2, dx1 = dx2, dy1 = dy2) {\n        dx2 = this._data[i] - x0;\n        dy2 = this._data[i + 1] - y0;\n        area += Geometry.crossProductXYXY(dx1, dy1, dx2, dy2);\n      }\n    }\n    return 0.5 * area;\n  }\n\n  /** Compute a vector from index origin i to indexed target j  */\n  public vectorIndexIndex(i: number, j: number, result?: Vector2d): Vector2d | undefined {\n    if (!this.isIndexValid(i) || !this.isIndexValid(j))\n      return undefined;\n    const data = this._data;\n    i = 2 * i;\n    j = 2 * j;\n    return Vector2d.create(data[j] - data[i], data[j + 1] - data[i + 1], result);\n  }\n\n  /** Compute a vector from origin to indexed target j */\n  public vectorXAndYIndex(origin: XAndY, j: number, result?: Vector2d): Vector2d | undefined {\n    if (this.isIndexValid(j)) {\n      const data = this._data;\n      j = 2 * j;\n      return Vector2d.create(\n        data[j] - origin.x,\n        data[j + 1] - origin.y, result);\n    }\n    return undefined;\n  }\n\n  /** Compute the cross product of vectors from from indexed origin to indexed targets i and j */\n  public crossProductIndexIndexIndex(originIndex: number, targetAIndex: number, targetBIndex: number): number | undefined {\n    if (this.isIndexValid(originIndex) && this.isIndexValid(targetAIndex) && this.isIndexValid(targetBIndex)) {\n      const i = originIndex * 2;\n      const j = targetAIndex * 2;\n      const k = targetBIndex * 2;\n      const data = this._data;\n      return Geometry.crossProductXYXY(\n        data[j] - data[i], data[j + 1] - data[i + 1],\n        data[k] - data[i], data[k + 1] - data[i + 1]);\n    }\n    return undefined;\n  }\n\n  /** Compute the cross product of vectors from from origin to indexed targets i and j */\n  public crossProductXAndYIndexIndex(origin: XAndY, targetAIndex: number, targetBIndex: number): number | undefined {\n    if (this.isIndexValid(targetAIndex) && this.isIndexValid(targetBIndex)) {\n      const j = targetAIndex * 2;\n      const k = targetBIndex * 2;\n      const data = this._data;\n      return Geometry.crossProductXYXY(\n        data[j] - origin.x, data[j + 1] - origin.y,\n        data[k] - origin.x, data[k + 1] - origin.y);\n    }\n    return undefined;\n  }\n\n  /** Return the distance between two points in the array. */\n  public distance(i: number, j: number): number | undefined {\n    if (this.isIndexValid(i) && this.isIndexValid(j)) {\n      const i0 = 2 * i;\n      const j0 = 2 * j;\n      return Geometry.hypotenuseXY(\n        this._data[j0] - this._data[i0],\n        this._data[j0 + 1] - this._data[i0 + 1]);\n    }\n    return undefined;\n  }\n  /** Return the distance between an array point and the input point. */\n  public distanceIndexToPoint(i: number, spacePoint: Point2d): number | undefined {\n    if (this.isIndexValid(i)) {\n      const i0 = 2 * i;\n      return Geometry.hypotenuseXY(\n        spacePoint.x - this._data[i0],\n        spacePoint.y - this._data[i0 + 1]);\n    }\n    return undefined;\n  }\n  /** Test for nearly equal arrays. */\n  public static isAlmostEqual(dataA: GrowableXYArray | undefined, dataB: GrowableXYArray | undefined): boolean {\n    if (dataA && dataB) {\n      if (dataA.length !== dataB.length)\n        return false;\n      for (let i = 0; i < dataA.length; i++)\n        if (!dataA.getPoint2dAtUncheckedPointIndex(i).isAlmostEqual(dataB.getPoint2dAtUncheckedPointIndex(i)))\n          return false;\n      return true;\n    }\n    // if both are null it is equal, otherwise unequal\n    return (!dataA && !dataB);\n  }\n\n  /** Return an array of block indices sorted per compareLexicalBlock function */\n  public sortIndicesLexical(): Uint32Array {\n    const n = this._xyInUse;\n    // let numCompare = 0;\n    const result = new Uint32Array(n);\n    for (let i = 0; i < n; i++) result[i] = i;\n    result.sort(\n      (blockIndexA: number, blockIndexB: number) => {\n        // numCompare++;\n        return this.compareLexicalBlock(blockIndexA, blockIndexB);\n      });\n    // console.log (n, numCompare);\n    return result;\n  }\n\n  /** compare two blocks in simple lexical order. */\n  public compareLexicalBlock(ia: number, ib: number): number {\n    let ax = 0;\n    let bx = 0;\n    for (let i = 0; i < 2; i++) {\n      ax = this._data[ia * 2 + i];\n      bx = this._data[ib * 2 + i];\n      if (ax > bx) return 1;\n      if (ax < bx) return -1;\n    }\n    return ia - ib; // so original order is maintained among duplicates !!!!\n  }\n\n  /** Access a single double at offset within a block.  This has no index checking. */\n  public component(pointIndex: number, componentIndex: number): number {\n    return this._data[2 * pointIndex + componentIndex];\n  }\n  /** Toleranced equality test */\n  public isAlmostEqual(other: GrowableXYArray, tolerance: number = Geometry.smallMetricDistance): boolean {\n    const numXY = this._xyInUse;\n    if (other._xyInUse !== numXY)\n      return false;\n    const dataA = this._data;\n    const dataB = other._data;\n    for (let i = 0; i < 2 * numXY; i++) {\n      if (Math.abs(dataA[i] - dataB[i]) > tolerance)\n        return false;\n    }\n    return true;\n  }\n}\n"]}
+{"version":3,"file":"GrowableXYArray.js","sourceRoot":"","sources":["../../../src/geometry3d/GrowableXYArray.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AAEvC,yDAAsD;AACtD,+DAA4D;AAE5D,uDAAsD;AACtD,uDAA4C;AAC5C,qDAAgG;AAKhG;;GAEG;AACH,MAAa,eAAgB,SAAQ,yCAAmB;IAkBtD;;;OAGG;IACH,YAAmB,YAAoB,CAAC,EAAE,YAAqB;QAC7D,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAG,qBAAqB;QACrE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,YAAY,IAAI,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,MAA+B,EAAE,WAAoB,EAAE,UAAmB;QAC3F,qDAAqD;QACrD,IAAI,QAAQ,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAC/B,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,CAAC,SAAS,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5E,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM;gBACzB,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,IAAI,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACxC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;YACzC,IAAI,OAAO,GAAG,CAAC,KAAK,CAAC;gBACnB,OAAO,IAAI,OAAO,GAAG,CAAC,CAAC;SAC1B;QACD,IAAI,OAAO,IAAI,CAAC;YACd,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,CAAC,MAAM;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;aAC9B,IAAI,MAAM,YAAY,YAAY;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;;YAEtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,OAAO,EAAC,KAAK,EAAE,OAAO,GAAG,CAAC,EAAE,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAC,CAAC;IACpD,CAAC;IAED,kGAAkG;IAClG,IAAoB,MAAM,KAAK,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACtD,IAAW,MAAM,CAAC,SAAiB,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAEtE,2CAA2C;IAC3C,IAAW,aAAa,KAAK,OAAO,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IACxD;;OAEG;IACI,WAAW,KAAmB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEzD,4HAA4H;IACrH,cAAc,CAAC,aAAqB,EAAE,oBAA6B,IAAI;QAC5E,IAAI,aAAa,GAAG,IAAI,CAAC,WAAW,EAAE;YACpC,IAAI,iBAAiB;gBACnB,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;YACjD,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,CAAC,WAAW,GAAG,aAAa,CAAC;SAClC;IACH,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,UAAkB,EAAE,WAAqB;QACtD,IAAI,UAAU,IAAI,CAAC,IAAI,UAAU,GAAG,IAAI,CAAC,QAAQ;YAC/C,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC;aACxB,IAAI,UAAU,GAAG,IAAI,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACvC,IAAI,WAAW,IAAI,KAAK;gBACtB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC;SAC5B;IACH,CAAC;IACD;;;OAGG;IACI,KAAK;QACV,MAAM,SAAS,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,SAAS,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;QACjC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,IAAgC;QACnD,MAAM,SAAS,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,IAAI,YAAY,mCAAgB,EAAE;YACpC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;SAC/B;aAAM;YACL,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;SACzB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,0EAA0E;IACnE,MAAM,CAAC,6BAA6B,CAAC,IAAgC;QAC1E,MAAM,SAAS,GAAG,IAAI,qDAAoC,EAAE,CAAC;QAC7D,uCAAsB,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAClD,OAAO,SAAS,CAAC,4BAA4B,EAAE,CAAC;IAClD,CAAC;IACD,2CAA2C;IACpC,IAAI,CAAC,MAAa;QACvB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,kCAAkC;IAC3B,OAAO,CAAC,MAAe;QAC5B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,kCAAkC;IAC3B,aAAa,CAAC,MAAmC;QACtD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1D,IAAI,MAAM,YAAY,mCAAgB,EAAE;YACtC,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;gBAC/B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC/C;aAAM;YACL,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;SAC/C;IACH,CAAC;IAED;;;OAGG;IACI,QAAQ,CAAC,OAAe;QAC7B,IAAI,IAAI,CAAC,QAAQ,IAAI,OAAO,EAAE;YAC5B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,GAAG,OAAO,EAAE,KAAK,CAAC,CAAC;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;gBAChC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAC/C;SACF;IACH,CAAC;IACD,4CAA4C;IACrC,MAAM,CAAC,CAAS,EAAE,CAAS;QAChC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,GAAG;QACR,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC;YACnB,IAAI,CAAC,QAAQ,EAAE,CAAC;IACpB,CAAC;IACD;;;OAGG;IACI,YAAY,CAAC,KAAa;QAC/B,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG,CAAC;YACrC,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACI,KAAK;QACV,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpB,CAAC;IACD;;;;OAIG;IACI,+BAA+B,CAAC,UAAkB,EAAE,MAAgB;QACzE,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC;QAC7B,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC1E,CAAC;IAED;;;OAGG;IACa,yBAAyB,CAAC,UAAkB;QAC1D,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACa,yBAAyB,CAAC,UAAkB;QAC1D,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACI,eAAe;QACpB,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,0CAA0C;IAC1B,6BAA6B,CAAC,UAAkB,EAAE,MAAgB;QAChF,IAAI,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE;YACjC,MAAM,KAAK,GAAG,CAAC,GAAG,UAAU,CAAC;YAC7B,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SACzE;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,2CAA2C;IAC3B,+BAA+B,CAAC,WAAmB,EAAE,MAAiB;QACpF,IAAI,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE;YAClC,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC;YAC9B,OAAO,0BAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SAC1E;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACI,2BAA2B,CAAC,SAAiB,EAAE,MAAuB,EAAE,WAAmB;QAChG,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE;YACpE,MAAM,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC;YACxB,MAAM,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxC,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACI,uBAAuB,CAAC,MAAuB,EAAE,WAAoB;QAC1E,yBAAyB;QACzB,IAAI,WAAW,KAAK,SAAS,EAAE;YAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC;YAC/B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,GAAG,QAAQ,EAAE,KAAK,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;YAC1B,OAAO,QAAQ,CAAC;SACjB;QACD,0BAA0B;QAC1B,IAAI,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE;YACpC,MAAM,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,OAAO,CAAC,CAAC;SACV;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;OAGG;IACI,mCAAmC,CAAC,MAAuB,EAAE,CAAS,EAAE,QAAgB,EAAE,CAAS;QACxG,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YACpD,MAAM,SAAS,GAAG,GAAG,GAAG,QAAQ,CAAC;YACjC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC;YAC1B,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,CAAC,MAAM,CACT,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,EACxC,SAAS,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACrD;IACH,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,0BAA0B,CAAC,MAAwB,EAAE,SAAqB,EAAE,IAAsB;QAC9G,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;QAChC,IAAI,CAAC,IAAI;YACP,IAAI,GAAG,IAAI,eAAe,CAAC,SAAS,CAAC,CAAC;aACnC;YACH,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,IAAI,SAAS,EAAE;YACb,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,CAAC,GAAG,SAAS,CAAC;YAC9B,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;gBACnC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrB,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aACrG;SACF;aAAM;YACL,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;SAC5B;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACI,KAAK,CAAC,MAAgB;QAC3B,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC1C,OAAO,IAAI,CAAC,+BAA+B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACzD,CAAC;IACD;;OAEG;IACI,IAAI,CAAC,MAAgB;QAC1B,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC;YAAE,OAAO,SAAS,CAAC;QACxC,OAAO,IAAI,CAAC,+BAA+B,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACzE,CAAC;IACD;;;;OAIG;IACI,sBAAsB,CAAC,UAAkB,EAAE,KAAY;QAC5D,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;OAKG;IACI,wBAAwB,CAAC,UAAkB,EAAE,CAAS,EAAE,CAAS;QACtE,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACK,yBAAyB,CAAC,UAAkB,EAAE,CAAS,EAAE,CAAS;QACxE,OAAO,IAAI,CAAC,wBAAwB,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,IAAY,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,mCAAmC;IAC5B,cAAc;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,EAAE,EAAE,EAAE,CAAC;QACX,IAAI,CAAC,CAAC;QACN,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;YAChD,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;YACZ,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;YACZ,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YAChD,EAAE,EAAE,CAAC;YACL,EAAE,EAAE,CAAC;YACL,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;SACjD;IACH,CAAC;IAED,4DAA4D;IACrD,wBAAwB,CAAC,SAAoB;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC;QACrC,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QAChC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;YACvC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;YAC3C,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;SAChD;IACH,CAAC;IAED,gEAAgE;IACzD,uBAAuB,CAAC,MAAgB;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC;QACnC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;YACvC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACtC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAC3C;IACH,CAAC;IAED,4DAA4D;IACrD,0BAA0B,CAAC,SAAoB;QACpD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC;QACnC,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QAChC,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC;QAClC,IAAI,CAAC,KAAK;YACR,OAAO,KAAK,CAAC;QACf,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QAChC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;YACvC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACjB,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACtC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAC3C;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,SAAS,EAAE;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,CAAC;gBACvC,aAAa,CAAC,mBAAmB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACtE;aAAM;YACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,CAAC;gBACvC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAEhD;IACH,CAAC;IACD,kDAAkD;IAC3C,UAAU;QACf,IAAI,GAAG,GAAG,GAAG,CAAC;QACd,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAE,gEAAgE;QACpG,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YAAE,GAAG,IAAI,mBAAQ,CAAC,YAAY,CACzD,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EACrB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7B,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,YAAY,CAAC,MAAc;QAChC,IAAI,IAAI,CAAC,KAAK,EAAE;YACd,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;gBAC/B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;SAC1C;IACH,CAAC;IACD,sEAAsE;IAC/D,WAAW,CAAC,CAAS,EAAE,QAAgB,EAAE,CAAS,EAAE,MAAgB;QACzE,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YAChD,MAAM,SAAS,GAAG,GAAG,GAAG,QAAQ,CAAC;YACjC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,yBAAO,CAAC,MAAM,CACnB,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,EACxC,SAAS,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SAC7D;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,yDAAyD;IAClD,MAAM;QACX,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAI,iBAAiB;QACjD,IAAI,CAAC,GAAG,CAAC,EAAE;YACT,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAC7B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE;gBACnD,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACzB,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;gBAC7B,IAAI,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aACvD;SACF;QACD,OAAO,GAAG,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,gEAAgE;IAChD,gBAAgB,CAAC,CAAS,EAAE,CAAS,EAAE,MAAiB;QACtE,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;YAChD,OAAO,SAAS,CAAC;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,0BAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/E,CAAC;IAED,uDAAuD;IACvC,gBAAgB,CAAC,MAAa,EAAE,CAAS,EAAE,MAAiB;QAC1E,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,0BAAQ,CAAC,MAAM,CACpB,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAClB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SACnC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,+FAA+F;IAC/E,2BAA2B,CAAC,WAAmB,EAAE,YAAoB,EAAE,YAAoB;QACzG,IAAI,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,EAAE;YACxG,MAAM,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC;YAC1B,MAAM,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,OAAO,mBAAQ,CAAC,gBAAgB,CAC9B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACjD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,uFAAuF;IACvE,2BAA2B,CAAC,MAAa,EAAE,YAAoB,EAAE,YAAoB;QACnG,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,EAAE;YACtE,MAAM,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YAC3B,MAAM,CAAC,GAAG,YAAY,GAAG,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,OAAO,mBAAQ,CAAC,gBAAgB,CAC9B,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAC1C,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;SAC/C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,2DAA2D;IACpD,QAAQ,CAAC,CAAS,EAAE,CAAS;QAClC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YAChD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,mBAAQ,CAAC,YAAY,CAC1B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAC/B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;SAC5C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,sEAAsE;IAC/D,oBAAoB,CAAC,CAAS,EAAE,UAAmB;QACxD,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YACxB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,mBAAQ,CAAC,YAAY,CAC1B,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAC7B,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,oCAAoC;IAC7B,MAAM,CAAC,aAAa,CAAC,KAAkC,EAAE,KAAkC;QAChG,IAAI,KAAK,IAAI,KAAK,EAAE;YAClB,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;gBAC/B,OAAO,KAAK,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACnC,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC;oBACnG,OAAO,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC;SACb;QACD,kDAAkD;QAClD,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,+EAA+E;IACxE,kBAAkB;QACvB,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QACxB,sBAAsB;QACtB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,CAAC,IAAI,CACT,CAAC,WAAmB,EAAE,WAAmB,EAAE,EAAE;YAC3C,gBAAgB;YAChB,OAAO,IAAI,CAAC,mBAAmB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QACL,+BAA+B;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,kDAAkD;IAC3C,mBAAmB,CAAC,EAAU,EAAE,EAAU;QAC/C,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC;YACtB,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC,CAAC;SACxB;QACD,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,wDAAwD;IAC1E,CAAC;IAED,oFAAoF;IAC7E,SAAS,CAAC,UAAkB,EAAE,cAAsB;QACzD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,GAAG,cAAc,CAAC,CAAC;IACrD,CAAC;IACD,+BAA+B;IACxB,aAAa,CAAC,KAAsB,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAC3F,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC5B,IAAI,KAAK,CAAC,QAAQ,KAAK,KAAK;YAC1B,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;YAClC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS;gBAC3C,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAhqBD,0CAgqBC","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\n/** @packageDocumentation\n * @module ArraysAndInterfaces\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { MultiLineStringDataVariant } from \"../topology/Triangulation\";\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\nimport { IndexedXYCollection } from \"./IndexedXYCollection\";\nimport { Matrix3d } from \"./Matrix3d\";\nimport { Point2d, Vector2d } from \"./Point2dVector2d\";\nimport { Point3d } from \"./Point3dVector3d\";\nimport { PointStreamGrowableXYZArrayCollector, VariantPointDataStream } from \"./PointStreaming\";\nimport { Range2d } from \"./Range\";\nimport { Transform } from \"./Transform\";\nimport { XAndY, XYAndZ } from \"./XYZProps\";\n\n/** `GrowableXYArray` manages a (possibly growing) Float64Array to pack xy coordinates.\n * @public\n */\nexport class GrowableXYArray extends IndexedXYCollection {\n  /**\n   * array of packed xy xy xy components\n   */\n  private _data: Float64Array;\n  /**\n   * Number of xy tuples (not floats) in the array\n   */\n  private _xyInUse: number;\n  /**\n   * capacity in xy tuples. (not floats)\n   */\n  private _xyCapacity: number;\n  /**\n   * multiplier used by ensureCapacity to expand requested reallocation size\n   */\n  private _growthFactor: number;\n\n  /** Construct a new GrowablePoint2d array.\n   * @param numPoints initial capacity in xy tuples (default 8)\n   * @param growthFactor used by ensureCapacity to expand requested reallocation size (default 1.5)\n   */\n  public constructor(numPoints: number = 8, growthFactor?: number) {\n    super();\n    this._data = new Float64Array(numPoints * 2);   // 2 values per point\n    this._xyInUse = 0;\n    this._xyCapacity = numPoints;\n    this._growthFactor = (undefined !== growthFactor && growthFactor >= 1.0) ? growthFactor : 1.5;\n  }\n\n  /** Copy xy points from source array. Does not reallocate or change active point count.\n   * @param source array to copy from\n   * @param sourceCount copy the first sourceCount points; all points if undefined\n   * @param destOffset copy to instance array starting at this point index; zero if undefined\n   * @return count and offset of points copied\n   */\n  protected copyData(source: Float64Array | number[], sourceCount?: number, destOffset?: number): {count: number, offset: number} {\n    // validate inputs and convert from points to entries\n    let myOffset = (undefined !== destOffset) ? destOffset * 2 : 0;\n    if (myOffset < 0)\n      myOffset = 0;\n    if (myOffset >= this._data.length)\n      return {count: 0, offset: 0};\n    let myCount = (undefined !== sourceCount) ? sourceCount * 2 : source.length;\n    if (myCount > 0) {\n      if (myCount > source.length)\n        myCount = source.length;\n      if (myOffset + myCount > this._data.length)\n        myCount = this._data.length - myOffset;\n      if (myCount % 2 !== 0)\n        myCount -= myCount % 2;\n    }\n    if (myCount <= 0)\n      return {count: 0, offset: 0};\n    if (myCount === source.length)\n      this._data.set(source, myOffset);\n    else if (source instanceof Float64Array)\n      this._data.set(source.subarray(0, myCount), myOffset);\n    else\n      this._data.set(source.slice(0, myCount), myOffset);\n    return {count: myCount / 2, offset: myOffset / 2};\n  }\n\n  /** The number of points in use. When the length is increased, the array is padded with zeroes. */\n  public override get length() { return this._xyInUse; }\n  public set length(newLength: number) { this.resize(newLength, true); }\n\n  /** Return the number of float64 in use. */\n  public get float64Length() { return this._xyInUse * 2; }\n  /** Return the raw packed data.\n   * * Note that the length of the returned Float64Array is a count of doubles, and includes the excess capacity\n   */\n  public float64Data(): Float64Array { return this._data; }\n\n  /** If necessary, increase the capacity to a new pointCount.  Current coordinates and point count (length) are unchanged. */\n  public ensureCapacity(pointCapacity: number, applyGrowthFactor: boolean = true) {\n    if (pointCapacity > this._xyCapacity) {\n      if (applyGrowthFactor)\n        pointCapacity *= this._growthFactor;\n      const prevData = this._data;\n      this._data = new Float64Array(pointCapacity * 2);\n      this.copyData(prevData, this._xyInUse);\n      this._xyCapacity = pointCapacity;\n    }\n  }\n  /**\n   * * If pointCount is less than current length, just reset current length to pointCount, effectively trimming active points but preserving original capacity.\n   * * If pointCount is greater than current length, reallocate to exactly pointCount, copy existing points, and optionally pad excess with zero.\n   * @param pointCount new number of active points in array\n   * @param padWithZero when increasing point count, whether to zero out new points (default false)\n   */\n   public resize(pointCount: number, padWithZero?: boolean) {\n    if (pointCount >= 0 && pointCount < this._xyInUse)\n      this._xyInUse = pointCount;\n    else if (pointCount > this._xyInUse) {\n      this.ensureCapacity(pointCount, false);\n      if (padWithZero ?? false)\n        this._data.fill(0, this._xyInUse * 2);\n      this._xyInUse = pointCount;\n    }\n  }\n  /**\n   * Make a copy of the (active) points in this array.\n   * (The clone does NOT get excess capacity)\n   */\n  public clone(): GrowableXYArray {\n    const newPoints = new GrowableXYArray(this.length);\n    newPoints.copyData(this._data, this.length);\n    newPoints._xyInUse = this.length;\n    return newPoints;\n  }\n  /** Create an array populated from\n   * * An array of Point2d\n   * * An array of Point3d (hidden as XAndY)\n   * * An array of objects with keyed values, et `{x:1, y:1}`\n   * * A `GrowableXYZArray`\n   */\n  public static create(data: XAndY[] | GrowableXYZArray): GrowableXYArray {\n    const newPoints = new GrowableXYArray(data.length);\n    if (data instanceof GrowableXYZArray) {\n      newPoints.pushAllXYAndZ(data);\n    } else {\n      newPoints.pushAll(data);\n    }\n    return newPoints;\n  }\n\n  /** Restructure MultiLineStringDataVariant as array of GrowableXYZArray */\n  public static createArrayOfGrowableXYZArray(data: MultiLineStringDataVariant): GrowableXYZArray[] | undefined {\n    const collector = new PointStreamGrowableXYZArrayCollector();\n    VariantPointDataStream.streamXYZ(data, collector);\n    return collector.claimArrayOfGrowableXYZArray();\n  }\n  /** push a point to the end of the array */\n  public push(toPush: XAndY) {\n    this.pushXY(toPush.x, toPush.y);\n  }\n\n  /** push all points of an array */\n  public pushAll(points: XAndY[]) {\n    this.ensureCapacity(this._xyInUse + points.length, false);\n    for (const p of points) this.push(p);\n  }\n  /** push all points of an array */\n  public pushAllXYAndZ(points: XYAndZ[] | GrowableXYZArray) {\n    this.ensureCapacity(this._xyInUse + points.length, false);\n    if (points instanceof GrowableXYZArray) {\n      const xyzBuffer = points.float64Data();\n      const n = points.length * 3;\n      for (let i = 0; i + 2 < n; i += 3)\n        this.pushXY(xyzBuffer[i], xyzBuffer[i + 1]);\n    } else {\n      for (const p of points) this.pushXY(p.x, p.y);\n    }\n  }\n\n  /**\n   * Replicate numWrap xy values from the front of the array as new values at the end.\n   * @param numWrap number of xy values to replicate\n   */\n  public pushWrap(numWrap: number) {\n    if (this._xyInUse >= numWrap) {\n      this.ensureCapacity(this._xyInUse + numWrap, false);\n      for (let i = 0; i < numWrap; i++) {\n        const k = 2 * i;\n        this.pushXY(this._data[k], this._data[k + 1]);\n      }\n    }\n  }\n  /** push a point given by x,y coordinates */\n  public pushXY(x: number, y: number) {\n    this.ensureCapacity(this._xyInUse + 1);\n    const index = this._xyInUse * 2;\n    this._data[index] = x;\n    this._data[index + 1] = y;\n    this._xyInUse++;\n  }\n\n  /** Remove one point from the back.\n   * * NOTE that (in the manner of std::vector native) this is \"just\" removing the point -- no point is NOT returned.\n   * * Use `back ()` to get the last x,y assembled into a `Point2d `\n   */\n  public pop() {\n    if (this._xyInUse > 0)\n      this._xyInUse--;\n  }\n  /**\n   * Test if index is valid for an xy (point or vector) within this array\n   * @param index xy index to test.\n   */\n  public isIndexValid(index: number): boolean {\n    if (index >= this._xyInUse || index < 0)\n      return false;\n    return true;\n  }\n  /**\n   * Clear all xy data, but leave capacity unchanged.\n   */\n  public clear() {\n    this._xyInUse = 0;\n  }\n  /**\n   * Get a point by index, strongly typed as a Point2d.  This is unchecked.  Use atPoint2dIndex to have validity test.\n   * @param pointIndex index to access\n   * @param result optional result\n   */\n  public getPoint2dAtUncheckedPointIndex(pointIndex: number, result?: Point2d): Point2d {\n    const index = 2 * pointIndex;\n    return Point2d.create(this._data[index], this._data[index + 1], result);\n  }\n\n  /**\n   * Get x coordinate by point index, with no index checking\n   * @param pointIndex index to access\n   */\n  public override getXAtUncheckedPointIndex(pointIndex: number): number {\n    return this._data[2 * pointIndex];\n  }\n\n  /**\n   * Get y coordinate by point index, with no index checking\n   * @param pointIndex index to access\n   */\n  public override getYAtUncheckedPointIndex(pointIndex: number): number {\n    return this._data[2 * pointIndex + 1];\n  }\n\n  /**\n   * Gather all points as a Point2d[]\n   */\n  public getPoint2dArray(): Point2d[] {\n    const n = 2 * this._xyInUse;\n    const result = [];\n    const data = this._data;\n    for (let i = 0; i < n; i += 2)\n      result.push(Point2d.create(data[i], data[i + 1]));\n    return result;\n  }\n\n  /** copy xy into strongly typed Point2d */\n  public override getPoint2dAtCheckedPointIndex(pointIndex: number, result?: Point2d): Point2d | undefined {\n    if (this.isIndexValid(pointIndex)) {\n      const index = 2 * pointIndex;\n      return Point2d.create(this._data[index], this._data[index + 1], result);\n    }\n    return undefined;\n  }\n\n  /** copy xy into strongly typed Vector2d */\n  public override getVector2dAtCheckedVectorIndex(vectorIndex: number, result?: Vector2d): Vector2d | undefined {\n    if (this.isIndexValid(vectorIndex)) {\n      const index = 2 * vectorIndex;\n      return Vector2d.create(this._data[index], this._data[index + 1], result);\n    }\n    return undefined;\n  }\n\n  /**\n   * Read coordinates from source array, place them at index within this array.\n   * @param destIndex point index where coordinates are to be placed in this array\n   * @param source source array\n   * @param sourceIndex point index in source array\n   * @returns true if destIndex and sourceIndex are both valid.\n   */\n  public transferFromGrowableXYArray(destIndex: number, source: GrowableXYArray, sourceIndex: number): boolean {\n    if (this.isIndexValid(destIndex) && source.isIndexValid(sourceIndex)) {\n      const i = destIndex * 2;\n      const j = sourceIndex * 2;\n      this._data[i] = source._data[j];\n      this._data[i + 1] = source._data[j + 1];\n      return true;\n    }\n    return false;\n  }\n\n  /**\n   * push coordinates from the source array to the end of this array.\n   * @param source source array\n   * @param sourceIndex xy index within the source.  If undefined, push entire contents of source\n   * @returns number of points pushed.\n   */\n  public pushFromGrowableXYArray(source: GrowableXYArray, sourceIndex?: number): number {\n    // full array push  . . .\n    if (sourceIndex === undefined) {\n      const numXYAdd = source.length;\n      this.ensureCapacity(this.length + numXYAdd, false);\n      this.copyData(source._data, numXYAdd, this.length);\n      this._xyInUse += numXYAdd;\n      return numXYAdd;\n    }\n    // single point push . . .\n    if (source.isIndexValid(sourceIndex)) {\n      const j = sourceIndex * 2;\n      this.pushXY(source._data[j], source._data[j + 1]);\n      return 1;\n    }\n    return 0;\n  }\n\n  /**\n   * * Compute a point at fractional coordinate between points i and j of source\n   * * push onto this array.\n   */\n  public pushInterpolatedFromGrowableXYArray(source: GrowableXYArray, i: number, fraction: number, j: number) {\n    if (source.isIndexValid(i) && source.isIndexValid(j)) {\n      const fraction0 = 1.0 - fraction;\n      const data = source._data;\n      i = 2 * i;\n      j = 2 * j;\n      this.pushXY(\n        fraction0 * data[i] + fraction * data[j],\n        fraction0 * data[i + 1] + fraction * data[j + 1]);\n    }\n  }\n\n  /**\n   * Create an array of xy points from source xyz points.\n   * @param source source array of xyz\n   * @param transform optional transform to apply to xyz points.\n   * @param dest optional result.\n   */\n  public static createFromGrowableXYZArray(source: GrowableXYZArray, transform?: Transform, dest?: GrowableXYArray) {\n    const numPoints = source.length;\n    if (!dest)\n      dest = new GrowableXYArray(numPoints);\n    else {\n      dest.ensureCapacity(numPoints, false);\n      dest.clear();\n    }\n    if (transform) {\n      const packedXYZ = source.float64Data();\n      const nDouble = 3 * numPoints;\n      let x, y, z;\n      for (let i = 0; i < nDouble; i += 3) {\n        x = packedXYZ[i];\n        y = packedXYZ[i + 1];\n        z = packedXYZ[i + 2];\n        dest.pushXY(transform.multiplyComponentXYZ(0, x, y, z), transform.multiplyComponentXYZ(1, x, y, z));\n      }\n    } else {\n      dest.pushAllXYAndZ(source);\n    }\n    return dest;\n  }\n  /**\n   * Return the first point, or undefined if the array is empty.\n   */\n  public front(result?: Point2d): Point2d | undefined {\n    if (this._xyInUse === 0) return undefined;\n    return this.getPoint2dAtUncheckedPointIndex(0, result);\n  }\n  /**\n   * Return the last point, or undefined if the array is empty.\n   */\n  public back(result?: Point2d): Point2d | undefined {\n    if (this._xyInUse < 1) return undefined;\n    return this.getPoint2dAtUncheckedPointIndex(this._xyInUse - 1, result);\n  }\n  /**\n   * Set the coordinates of a single point.\n   * @param pointIndex index of point to set\n   * @param value coordinates to set\n   */\n  public setAtCheckedPointIndex(pointIndex: number, value: XAndY): boolean {\n    if (!this.isIndexValid(pointIndex))\n      return false;\n    const index = pointIndex * 2;\n    this._data[index] = value.x;\n    this._data[index + 1] = value.y;\n    return true;\n  }\n  /**\n   * Set the coordinates of a single point given as coordinates.\n   * @param pointIndex index of point to set\n   * @param x x coordinate\n   * @param y y coordinate\n   */\n  public setXYAtCheckedPointIndex(pointIndex: number, x: number, y: number): boolean {\n    if (!this.isIndexValid(pointIndex))\n      return false;\n    const index = pointIndex * 2;\n    this._data[index] = x;\n    this._data[index + 1] = y;\n    return true;\n  }\n  /**\n   * Set the coordinates of a single point given as coordinates.\n   * @deprecated in 3.x. Use setXYAtCheckedPointIndex instead\n   */\n   public setXYZAtCheckedPointIndex(pointIndex: number, x: number, y: number): boolean {\n    return this.setXYAtCheckedPointIndex(pointIndex, x, y);\n  }\n\n  /**\n   * Copy all points into a simple array of Point3d with given z.\n   */\n  public getPoint3dArray(z: number = 0): Point3d[] {\n    const n = 2 * this._xyInUse;\n    const result = [];\n    const data = this._data;\n    for (let i = 0; i < n; i += 2)\n      result.push(Point3d.create(data[i], data[i + 1], z));\n    return result;\n  }\n  /** reverse the order of points. */\n  public reverseInPlace() {\n    const n = this.length;\n    let j0, j1;\n    let a;\n    const data = this._data;\n    for (let i0 = 0, i1 = n - 1; i0 < i1; i0++, i1--) {\n      j0 = 2 * i0;\n      j1 = 2 * i1;\n      a = data[j0]; data[j0] = data[j1]; data[j1] = a;\n      j0++;\n      j1++;\n      a = data[j0]; data[j0] = data[j1]; data[j1] = a;\n    }\n  }\n\n  /** multiply each point by the transform, replace values. */\n  public multiplyTransformInPlace(transform: Transform) {\n    const data = this._data;\n    const nDouble = this.float64Length;\n    const coffs = transform.matrix.coffs;\n    const origin = transform.origin;\n    const x0 = origin.x;\n    const y0 = origin.y;\n    let x = 0;\n    let y = 0;\n    for (let i = 0; i + 1 < nDouble; i += 2) {\n      x = data[i];\n      y = data[i + 1];\n      data[i] = coffs[0] * x + coffs[1] * y + x0;\n      data[i + 1] = coffs[3] * x + coffs[4] * y + y0;\n    }\n  }\n\n  /** multiply each xy (as a vector) by matrix, replace values. */\n  public multiplyMatrix3dInPlace(matrix: Matrix3d) {\n    const data = this._data;\n    const nDouble = this.float64Length;\n    const coffs = matrix.coffs;\n    let x = 0;\n    let y = 0;\n    for (let i = 0; i + 1 < nDouble; i += 2) {\n      x = data[i];\n      y = data[i + 1];\n      data[i] = coffs[0] * x + coffs[1] * y;\n      data[i + 1] = coffs[3] * x + coffs[4] * y;\n    }\n  }\n\n  /** multiply each point by the transform, replace values. */\n  public tryTransformInverseInPlace(transform: Transform): boolean {\n    const data = this._data;\n    const nDouble = this.float64Length;\n    const matrix = transform.matrix;\n    matrix.computeCachedInverse(true);\n    const coffs = matrix.inverseCoffs;\n    if (!coffs)\n      return false;\n    const origin = transform.origin;\n    const x0 = origin.x;\n    const y0 = origin.y;\n    let x = 0;\n    let y = 0;\n    for (let i = 0; i + 1 < nDouble; i += 2) {\n      x = data[i] - x0;\n      y = data[i + 1] - y0;\n      data[i] = coffs[0] * x + coffs[1] * y;\n      data[i + 1] = coffs[3] * x + coffs[4] * y;\n    }\n    return true;\n  }\n  /** Extend a `Range2d`, optionally transforming the points. */\n  public extendRange(rangeToExtend: Range2d, transform?: Transform) {\n    const numDouble = this.float64Length;\n    const data = this._data;\n    if (transform) {\n      for (let i = 0; i + 1 < numDouble; i += 2)\n        rangeToExtend.extendTransformedXY(transform, data[i], data[i + 1]);\n    } else {\n      for (let i = 0; i + 1 < numDouble; i += 2)\n        rangeToExtend.extendXY(data[i], data[i + 1]);\n\n    }\n  }\n  /** sum the lengths of segments between points. */\n  public sumLengths(): number {\n    let sum = 0.0;\n    const n = 2 * (this._xyInUse - 1);  // Length already takes into account what specifically is in use\n    const data = this._data;\n    for (let i = 0; i < n; i += 2) sum += Geometry.hypotenuseXY(\n      data[i + 2] - data[i],\n      data[i + 3] - data[i + 1]);\n    return sum;\n  }\n  /**\n   * Multiply each x,y by the scale factor.\n   * @param factor\n   */\n  public scaleInPlace(factor: number) {\n    if (this._data) {\n      const numFloat = this.float64Length;\n      for (let i = 0; i < numFloat; i++)\n        this._data[i] = this._data[i] * factor;\n    }\n  }\n  /** Compute a point at fractional coordinate between points i and j */\n  public interpolate(i: number, fraction: number, j: number, result?: Point2d): Point2d | undefined {\n    if (this.isIndexValid(i) && this.isIndexValid(j)) {\n      const fraction0 = 1.0 - fraction;\n      const data = this._data;\n      i = 2 * i;\n      j = 2 * j;\n      return Point2d.create(\n        fraction0 * data[i] + fraction * data[j],\n        fraction0 * data[i + 1] + fraction * data[j + 1], result);\n    }\n    return undefined;\n  }\n\n  /** Sum the signed areas of the projection to xy plane */\n  public areaXY(): number {\n    let area = 0.0;\n    const n = 2 * this._xyInUse;    // float count !!\n    if (n > 4) {\n      const x0 = this._data[n - 2];\n      const y0 = this._data[n - 1];\n      let dx1 = this._data[0] - x0;\n      let dy1 = this._data[1] - y0;\n      let dx2 = 0;\n      let dy2 = 0;\n      for (let i = 2; i < n; i += 2, dx1 = dx2, dy1 = dy2) {\n        dx2 = this._data[i] - x0;\n        dy2 = this._data[i + 1] - y0;\n        area += Geometry.crossProductXYXY(dx1, dy1, dx2, dy2);\n      }\n    }\n    return 0.5 * area;\n  }\n\n  /** Compute a vector from index origin i to indexed target j  */\n  public override vectorIndexIndex(i: number, j: number, result?: Vector2d): Vector2d | undefined {\n    if (!this.isIndexValid(i) || !this.isIndexValid(j))\n      return undefined;\n    const data = this._data;\n    i = 2 * i;\n    j = 2 * j;\n    return Vector2d.create(data[j] - data[i], data[j + 1] - data[i + 1], result);\n  }\n\n  /** Compute a vector from origin to indexed target j */\n  public override vectorXAndYIndex(origin: XAndY, j: number, result?: Vector2d): Vector2d | undefined {\n    if (this.isIndexValid(j)) {\n      const data = this._data;\n      j = 2 * j;\n      return Vector2d.create(\n        data[j] - origin.x,\n        data[j + 1] - origin.y, result);\n    }\n    return undefined;\n  }\n\n  /** Compute the cross product of vectors from from indexed origin to indexed targets i and j */\n  public override crossProductIndexIndexIndex(originIndex: number, targetAIndex: number, targetBIndex: number): number | undefined {\n    if (this.isIndexValid(originIndex) && this.isIndexValid(targetAIndex) && this.isIndexValid(targetBIndex)) {\n      const i = originIndex * 2;\n      const j = targetAIndex * 2;\n      const k = targetBIndex * 2;\n      const data = this._data;\n      return Geometry.crossProductXYXY(\n        data[j] - data[i], data[j + 1] - data[i + 1],\n        data[k] - data[i], data[k + 1] - data[i + 1]);\n    }\n    return undefined;\n  }\n\n  /** Compute the cross product of vectors from from origin to indexed targets i and j */\n  public override crossProductXAndYIndexIndex(origin: XAndY, targetAIndex: number, targetBIndex: number): number | undefined {\n    if (this.isIndexValid(targetAIndex) && this.isIndexValid(targetBIndex)) {\n      const j = targetAIndex * 2;\n      const k = targetBIndex * 2;\n      const data = this._data;\n      return Geometry.crossProductXYXY(\n        data[j] - origin.x, data[j + 1] - origin.y,\n        data[k] - origin.x, data[k + 1] - origin.y);\n    }\n    return undefined;\n  }\n\n  /** Return the distance between two points in the array. */\n  public distance(i: number, j: number): number | undefined {\n    if (this.isIndexValid(i) && this.isIndexValid(j)) {\n      const i0 = 2 * i;\n      const j0 = 2 * j;\n      return Geometry.hypotenuseXY(\n        this._data[j0] - this._data[i0],\n        this._data[j0 + 1] - this._data[i0 + 1]);\n    }\n    return undefined;\n  }\n  /** Return the distance between an array point and the input point. */\n  public distanceIndexToPoint(i: number, spacePoint: Point2d): number | undefined {\n    if (this.isIndexValid(i)) {\n      const i0 = 2 * i;\n      return Geometry.hypotenuseXY(\n        spacePoint.x - this._data[i0],\n        spacePoint.y - this._data[i0 + 1]);\n    }\n    return undefined;\n  }\n  /** Test for nearly equal arrays. */\n  public static isAlmostEqual(dataA: GrowableXYArray | undefined, dataB: GrowableXYArray | undefined): boolean {\n    if (dataA && dataB) {\n      if (dataA.length !== dataB.length)\n        return false;\n      for (let i = 0; i < dataA.length; i++)\n        if (!dataA.getPoint2dAtUncheckedPointIndex(i).isAlmostEqual(dataB.getPoint2dAtUncheckedPointIndex(i)))\n          return false;\n      return true;\n    }\n    // if both are null it is equal, otherwise unequal\n    return (!dataA && !dataB);\n  }\n\n  /** Return an array of block indices sorted per compareLexicalBlock function */\n  public sortIndicesLexical(): Uint32Array {\n    const n = this._xyInUse;\n    // let numCompare = 0;\n    const result = new Uint32Array(n);\n    for (let i = 0; i < n; i++) result[i] = i;\n    result.sort(\n      (blockIndexA: number, blockIndexB: number) => {\n        // numCompare++;\n        return this.compareLexicalBlock(blockIndexA, blockIndexB);\n      });\n    // console.log (n, numCompare);\n    return result;\n  }\n\n  /** compare two blocks in simple lexical order. */\n  public compareLexicalBlock(ia: number, ib: number): number {\n    let ax = 0;\n    let bx = 0;\n    for (let i = 0; i < 2; i++) {\n      ax = this._data[ia * 2 + i];\n      bx = this._data[ib * 2 + i];\n      if (ax > bx) return 1;\n      if (ax < bx) return -1;\n    }\n    return ia - ib; // so original order is maintained among duplicates !!!!\n  }\n\n  /** Access a single double at offset within a block.  This has no index checking. */\n  public component(pointIndex: number, componentIndex: number): number {\n    return this._data[2 * pointIndex + componentIndex];\n  }\n  /** Toleranced equality test */\n  public isAlmostEqual(other: GrowableXYArray, tolerance: number = Geometry.smallMetricDistance): boolean {\n    const numXY = this._xyInUse;\n    if (other._xyInUse !== numXY)\n      return false;\n    const dataA = this._data;\n    const dataB = other._data;\n    for (let i = 0; i < 2 * numXY; i++) {\n      if (Math.abs(dataA[i] - dataB[i]) > tolerance)\n        return false;\n    }\n    return true;\n  }\n}\n"]}

package/lib/cjs/geometry3d/GrowableXYZArray.js

@@ -92,7 +92,7 @@ class GrowableXYZArray extends IndexedXYZCollection_1.IndexedReadWriteXYZCollect
             this._xyzInUse = pointCount;
         else if (pointCount > this._xyzInUse) {
             this.ensureCapacity(pointCount, false);
-            if (padWithZero !== null && padWithZero !== void 0 ? padWithZero : false)
+            if (padWithZero ?? false)
                 this._data.fill(0, this._xyzInUse * 3);
             this._xyzInUse = pointCount;
         }